Abstract
Computer operations involving complex numbers, essential in such applications as digital signal processing and image processing, are usually performed in a "divide-and-conquer" approach dealing separately with the real and imaginary parts and then accumulating the results. There have been several proposals to treat complex numbers as a single unit but all seem to have floundered on the basic problem of the division process without which, of course, it is impossible to carry out all but the most basic arithmetic. This paper resurrects an early proposal to express complex numbers in a single "binary" representation and provides a fail-safe procedure for obtaining the quotient of two complex numbers expressed in this representation.
| Original language | English |
|---|---|
| Title of host publication | Conference Proceedings - IEEE SOUTHEASTCON |
| Pages | 188-195 |
| Number of pages | 8 |
| Publication status | Published - 2001 |
| Event | IEEE SoutheastCon 2001 - Clemson, SC, United States Duration: Mar 30 2001 → Apr 1 2001 |
Other
| Other | IEEE SoutheastCon 2001 |
|---|---|
| Country | United States |
| City | Clemson, SC |
| Period | 3/30/01 → 4/1/01 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
Blest, D. C., & Jamil, T. (2001). Efficient division in the binary representation of complex numbers. In Conference Proceedings - IEEE SOUTHEASTCON (pp. 188-195)