메뉴 건너뛰기




Volumn , Issue , 2006, Pages 1-5

Approximate lattice decoding: Primal versus dual basis reduction

Author keywords

[No Author keywords available]

Indexed keywords

DECODING TECHNIQUES; DUAL BASIS REDUCTION; LATTICE DECODING; MULTI-INPUT MULTI-OUTPUT (MIMO) COMMUNICATIONS;

EID: 39049151793     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261586     Document Type: Conference Paper
Times cited : (25)

References (17)
  • 1
    • 0032217929 scopus 로고    scopus 로고
    • VBLAST: An architecture for realizing very high data rates over the richscattering wireless channel
    • Pisa, Italy, Sept. 29
    • P.W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela, "VBLAST: An architecture for realizing very high data rates over the richscattering wireless channel," Proc. ISSSE, Pisa, Italy, Sept. 29, 1998.
    • (1998) Proc. ISSSE
    • Wolniansky, P.W.1    Foschini, G.J.2    Golden, G.D.3    Valenzuela, R.A.4
  • 2
    • 0032636505 scopus 로고    scopus 로고
    • A universal lattice code decoder for fading channels
    • July
    • E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , pp. 1639-1642
    • Viterbo, E.1    Boutros, J.2
  • 4
    • 4143058249 scopus 로고    scopus 로고
    • Universal lattice decoding: Principle and recent advances
    • Aug
    • W. H. Mow, "Universal lattice decoding: Principle and recent advances," Wireless Communications and Mobile Computing, vol. 3, pp. 553-569, Aug. 2003.
    • (2003) Wireless Communications and Mobile Computing , vol.3 , pp. 553-569
    • Mow, W.H.1
  • 5
    • 84966239268 scopus 로고
    • Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
    • Apr
    • U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, pp. 463-471, Apr. 1985.
    • (1985) Math. Comput , vol.44 , pp. 463-471
    • Fincke, U.1    Pohst, M.2
  • 6
    • 51249173801 scopus 로고
    • On Lovász' lattice reduction and the nearest lattice point problem
    • L. Babai, "On Lovász' lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, no. 1, pp. 1-13, 1986.
    • (1986) Combinatorica , vol.6 , Issue.1 , pp. 1-13
    • Babai, L.1
  • 7
    • 4143051891 scopus 로고    scopus 로고
    • Lattice-reduction-aided detectors for MIMO communication systems
    • Taipei, China, Nov. 17-21
    • H. Yao and G W. Wornell, "Lattice-reduction-aided detectors for MIMO communication systems," in Proc. Globecom, Taipei, China, Nov. 17-21, 2002.
    • (2002) Proc. Globecom
    • Yao, H.1    Wornell, G.W.2
  • 8
    • 11244299755 scopus 로고    scopus 로고
    • Optimum and sub-optimum latticereduction-aided detection and precoding for MIMO communication
    • Waterloo, ON, Canada, May
    • C. Windpassinger and R. Fischer, "Optimum and sub-optimum latticereduction-aided detection and precoding for MIMO communication," in Proc. Canadian Workshop Information Theory, Waterloo, ON, Canada, May 203, p. 88-91.
    • Proc. Canadian Workshop Information Theory , vol.203 , pp. 88-91
    • Windpassinger, C.1    Fischer, R.2
  • 9
    • 39049094202 scopus 로고    scopus 로고
    • Multiple-antenna differential lattice decoding
    • Sept
    • C. Ling, W H. Mow, K. H. Li and A. C. Kot, "Multiple-antenna differential lattice decoding," IEEE J-SAC, vol. 23, pp. 1281-1289, Sept. 2005.
    • (2005) IEEE J-SAC , vol.23 , pp. 1281-1289
    • Ling, C.1    Mow, W.H.2    Li, K.H.3    Kot, A.C.4
  • 10
    • 85091830022 scopus 로고    scopus 로고
    • C. Ling, Towards characterizing the performance of approximate lattice decoding, in Proc. Int. Symp. Turbo Codes I Int. ITG Conf Source Channel Coding '06, Munich, Germany, Apr. 2006.
    • C. Ling, "Towards characterizing the performance of approximate lattice decoding," in Proc. Int. Symp. Turbo Codes I Int. ITG Conf Source Channel Coding '06, Munich, Germany, Apr. 2006.
  • 11
    • 34250244723 scopus 로고
    • Factoring polynomials with rational coefficients
    • A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász, "Factoring polynomials with rational coefficients," Math. Ann., vol. 261, pp. 515-534, 1982.
    • (1982) Math. Ann , vol.261 , pp. 515-534
    • Lenstra, A.K.1    Lenstra Jr., H.W.2    Lovász, L.3
  • 14
    • 34249953865 scopus 로고
    • Krokin-Zolotarev bases and successive minimal of a lattice and its reciprocal lattice
    • J. C. Lagarias, W H. Lenstra, C. P. Schnorr, "Krokin-Zolotarev bases and successive minimal of a lattice and its reciprocal lattice," Combinatorica, vol. 10, pp. 333-348, 1990.
    • (1990) Combinatorica , vol.10 , pp. 333-348
    • Lagarias, J.C.1    Lenstra, W.H.2    Schnorr, C.P.3
  • 15
    • 0023532388 scopus 로고
    • A hierarchy of polynomial time lattice basis reduction algorithms
    • C. P. Schnorr, "A hierarchy of polynomial time lattice basis reduction algorithms," Theor. Comput. Sci., vol. 53, no. 2-3, pp. 201-224, 1987.
    • (1987) Theor. Comput. Sci , vol.53 , Issue.2-3 , pp. 201-224
    • Schnorr, C.P.1
  • 17
    • 0000303291 scopus 로고
    • New bounds in some transference theorems in the geometry of number
    • W. Banaszczyk, "New bounds in some transference theorems in the geometry of number," Math. Ann., vol. 296, pp. 625-635, 1993.
    • (1993) Math. Ann , vol.296 , pp. 625-635
    • Banaszczyk, W.1


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