Abstract
Two algorithms are presented that approximate complex numbers by elements of the algebraic integers of Q(w) where w = e2pai i/8. These algorithms substantially reduce the computational burden. Range and memory requirements are given as a function of the desired accuracy and expressions are obtained for the number of computations required by each algorithm.
Original language | English (US) |
---|---|
Pages (from-to) | 1133-1136 |
Number of pages | 4 |
Journal | IEEE Transactions on Information Theory |
Volume | 35 |
Issue number | 5 |
DOIs | |
State | Published - Sep 1989 |
Externally published | Yes |
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences