Encoding Algorithms for Complex Approximations in Z[e2π/8]

Michael W. Marcellin; Thomas R. Fischer

doi:10.1109/18.42236

Encoding Algorithms for Complex Approximations in Z[e^2π/8]

Michael W. Marcellin, Thomas R. Fischer

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

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	https://doi.org/10.1109/18.42236
State	Published - Sep 1989
Externally published	Yes

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.42236

Cite this

@article{fb16c62d408a4ddaa18a6892405680f0,

title = "Encoding Algorithms for Complex Approximations in Z[e2π/8]",

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.",

author = "Marcellin, {Michael W.} and Fischer, {Thomas R.}",

year = "1989",

month = sep,

doi = "10.1109/18.42236",

language = "English (US)",

volume = "35",

pages = "1133--1136",

journal = "IRE Professional Group on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Encoding Algorithms for Complex Approximations in Z[e2π/8]

AU - Marcellin, Michael W.

AU - Fischer, Thomas R.

PY - 1989/9

Y1 - 1989/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024733201&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024733201&partnerID=8YFLogxK

U2 - 10.1109/18.42236

DO - 10.1109/18.42236

M3 - Article

AN - SCOPUS:0024733201

VL - 35

SP - 1133

EP - 1136

JO - IRE Professional Group on Information Theory

JF - IRE Professional Group on Information Theory

SN - 0018-9448

IS - 5

ER -

Encoding Algorithms for Complex Approximations in Z[e^2π/8]

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this