Complex Multiply-Add and Other Related Operators

Abstract : In this work, we present algorithms and schemes for computing common arithmetic expressions defined in the complex domain as hardware-implemented operators.The operators include Complex Multiply-Add (CMA: ab+c), Complex Sum of Producrs (CSP: ab+ce+f), Complex Sum of Squares (CSS: a^2+b^2) and complex Integer Powers. The proposed approach is to map the expression to a system of linear equations, apply a complex-to-real transform, and compute the solutions to the linear system using a digit-by-digit, the most significant digit first, recurrence method. The components of the solution vector corresponds to the expressions being evaluated. The number of digit cycles is about m for m-digit precision. The basic modules are similar to left-to-right multipliers. The interconnections between the modules are digit-wide.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00167372
Contributor : Jean-Michel Muller <>
Submitted on : Monday, August 20, 2007 - 11:32:11 AM
Last modification on : Wednesday, August 7, 2019 - 12:14:40 PM
Long-term archiving on : Monday, September 24, 2012 - 11:40:37 AM

File

spie07-complex-ops.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00167372, version 1

Collections

Citation

Milos Ercegovac, Jean-Michel Muller. Complex Multiply-Add and Other Related Operators. SPIE Conf. Advanced Signal Processing Algorithms, Architectures and Implementation XVII, 6697, SPIE, Aug 2007, San Diego, United States. ⟨ensl-00167372⟩

Share

Metrics

Record views

223

Files downloads

229