메뉴 건너뛰기




Volumn 54, Issue 9, 2008, Pages 4378-4381

An algorithm to compute the nearest point in the lattice An *

Author keywords

Channel coding; Direction of arrival estimation; Frequency estimation; Lattice theory; Nearest point algorithm; Quantization; Synchronization

Indexed keywords

CHANNEL CODING; DIRECTION-OF-ARRIVAL ESTIMATION; FREQUENCY ESTIMATION; LATTICE THEORY; NEAREST POINT ALGORITHM; QUANTIZATION; SYNCHRONIZATION;

EID: 51349083795     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.928280     Document Type: Article
Times cited : (16)

References (9)
  • 1
    • 84957688279 scopus 로고    scopus 로고
    • An algorithm to compute a nearest point in the lattice
    • Applied Algebra, Algebraic Algorithms and Error- Correcting Codes , M. Fossorier, H. Imai, S. Lin, and A. Poli, Eds. Berlin, Germany: Springer-Verlag
    • I. V. L. Clarkson, "An algorithm to compute a nearest point in the lattice," in Applied Algebra, Algebraic Algorithms and Error- Correcting Codes (Lecture Notes in Computer Science), M. Fossorier, H. Imai, S. Lin, and A. Poli, Eds. Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 104-120.
    • (1999) Lecture Notes in Computer Science , vol.1719 , pp. 104-120
    • Clarkson, I.V.L.1
  • 3
    • 51349168627 scopus 로고    scopus 로고
    • Approximate maximum-likelihood period estimation from sparse, noisy tinting data
    • May
    • I. V. L. Clarkson, "Approximate maximum-likelihood period estimation from sparse, noisy tinting data," IEEE Trans. Signal Process., vol. 56, no. 5, pp. 1779-1787, May 2008.
    • (2008) IEEE Trans. Signal Process , vol.56 , Issue.5 , pp. 1779-1787
    • Clarkson, I.V.L.1
  • 4
    • 0032665718 scopus 로고    scopus 로고
    • Frequency estimation, phase unwrapping and the nearest lattice point problem
    • Phoenix, AZ, Mar
    • I. V. L. Clarkson, "Frequency estimation, phase unwrapping and the nearest lattice point problem," in Proc. Int. Conf. Acoustics, Speech and Signal Processing, Phoenix, AZ, Mar. 1999, vol. 3, pp. 1609-1612.
    • (1999) Proc. Int. Conf. Acoustics, Speech and Signal Processing , vol.3 , pp. 1609-1612
    • Clarkson, I.V.L.1
  • 6
    • 0020102220 scopus 로고
    • Fast quantizing and decoding and algorithms for lattice quantizers and codes
    • Mar
    • J. H. Conway and N. J. A. Sloane, "Fast quantizing and decoding and algorithms for lattice quantizers and codes," IEEE Trans. Inf. Theory, vol. IT-28, no. 2, pp. 227-232, Mar. 1982.
    • (1982) IEEE Trans. Inf. Theory , vol.IT-28 , Issue.2 , pp. 227-232
    • Conway, J.H.1    Sloane, N.J.A.2
  • 7
    • 0022563696 scopus 로고
    • Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
    • Jan
    • J. H. Conway and N. J. A. Sloane, "Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice," IEEE Trans. Inf. Theory, vol. IT-32, no. 1, pp. 41-50, Jan. 1986.
    • (1986) IEEE Trans. Inf. Theory , vol.IT-32 , Issue.1 , pp. 41-50
    • Conway, J.H.1    Sloane, N.J.A.2
  • 8
    • 0001590074 scopus 로고
    • Extreme forms
    • H. S. M. Coxeter, "Extreme forms," Canad. J. Math., vol. 3, pp. 391-441,1951.
    • (1951) Canad. J. Math , vol.3 , pp. 391-441
    • Coxeter, H.S.M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.