Encoding algorithms for complex approximations in Z[e2πi/8]

Michael W Marcellin, Thomas R. Fischer

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Two algorithms are presented that approximate complex numbers by elements of the algebraic integers of Q(w) where w = e2π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 languageEnglish (US)
Pages (from-to)1133-1136
Number of pages4
JournalIEEE Transactions on Information Theory
Volume35
Issue number5
DOIs
StatePublished - Sep 1989
Externally publishedYes

Fingerprint

Data storage equipment

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Encoding algorithms for complex approximations in Z[e2πi/8]. / Marcellin, Michael W; Fischer, Thomas R.

In: IEEE Transactions on Information Theory, Vol. 35, No. 5, 09.1989, p. 1133-1136.

Research output: Contribution to journalArticle

@article{fb16c62d408a4ddaa18a6892405680f0,
title = "Encoding algorithms for complex approximations in Z[e2πi/8]",
abstract = "Two algorithms are presented that approximate complex numbers by elements of the algebraic integers of Q(w) where w = e2π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 = "9",
doi = "10.1109/18.42236",
language = "English (US)",
volume = "35",
pages = "1133--1136",
journal = "IEEE Transactions 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πi/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 = e2π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 = e2π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

VL - 35

SP - 1133

EP - 1136

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

ER -