Complex ±1 Multiplier Based on Signed-Binary Transformations

  • Authors:
  • Boris D. Andreev;Edward L. Titlebaum;Eby G. Friedman

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Rochester, Rochester, New York 14627, USA;Department of Electrical and Computer Engineering, University of Rochester, Rochester, New York 14627, USA;Department of Electrical and Computer Engineering, University of Rochester, Rochester, New York 14627, USA

  • Venue:
  • Journal of VLSI Signal Processing Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A complex ±1 multiplier is an integral element in modern CDMA communication systems, specifically as a pseudonoise code scrambler/descrambler. An efficient implementation is essential to reduce the critical path delay, power, and area of wireless receivers. A signed-binary architecture is proposed to achieve this complex multiplier function. Tradeoffs and design solutions are discussed. It is shown that the VLSI circuit implementation of the arithmetic operations may be significantly improved by using non-conventional number representations and transforming intermediate results from one format to another format. For a target function, the objective is to change the number representations of the input and output operands such that a minimum amount of logic circuitry is required to achieve a computation. An analytical framework is developed that expands the scope of the functions that can be efficiently implemented using signed-binary representation. Simulations exhibit a significant speed improvement as compared to alternative architectures.