Parallel decomposition of complex multipliers

Thanos Stouraitis, Alexander Skavantzos

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations


The authors discuss the mathematical basis and hardware implementations of new complex multipliers. They are based on appropriate encoding of complex numbers as polynomials and on a recently developed arithmetic system, the polynomial residue number system (PRNS), in which totally parallel polynomial multiplication can be achieved provided that the arithmetic takes place in some carefully chosen ring. A no-error third-order and a small-error seventh-order polynomial encoding are examined. The new multipliers allow a variety of implementation options and are shown to exhibit performance up to 3.5 times better than traditional techniques in a multiplicative intensive environment.

Original languageBritish English
Pages (from-to)379-383
Number of pages5
JournalConference Record - Asilomar Conference on Circuits, Systems & Computers
StatePublished - 1988
Eventv 1 (of 2) - Pacific Grove, CA, USA
Duration: 31 Oct 19882 Nov 1988


Dive into the research topics of 'Parallel decomposition of complex multipliers'. Together they form a unique fingerprint.

Cite this