Fast decoding of the golden code by diophantine approximation

2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

Volumn , Issue , 2007, Pages 590-594

  Howard, S D ^a   Sirianunpiboon, S ^a   Calderbank, A R ^b  

^a DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(E ,2E) THEORY; BATTERY LIFE; CHANNEL STATE (CS); DIOPHANTINE APPROXIMATION; FAST DECODING; GOLDEN CODE; IEEE 802.16 STANDARD; IMPLEMENTATION COMPLEXITY; MAXIMUM LIKELIHOOD (ML) DECODING; MOBILE TERMINAL (MT); NEW APPROACHES; RECEIVE ANTENNAS; SIGNAL CONSTELLATIONS; SIGNAL TO NOISE; SIMULATION RESULTS; SPACE-TIME CODES (STCS); SPHERE DECODING; WORST CASE COMPLEXITY; ZERO FORCING (ZF);

ANTENNA ACCESSORIES; APPROXIMATION THEORY; CODES (STANDARDS); CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); CYBERNETICS; INFORMATION THEORY; MOBILE ANTENNAS; POLYNOMIAL APPROXIMATION; RECEIVING ANTENNAS; SIGNAL TO NOISE RATIO; STANDARDS; WIRELESS TELECOMMUNICATION SYSTEMS;

DECODING;

EID: 46749095597     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2007.4313140     Document Type: Conference Paper

References (14)

1. V. Tarokh, N. Seshadri, and A. R. Calderbank, "Space-time codes for high data rate wireless communications: performance criterion and code construction," IEEE Trans. Inform. Theory, vol. 44, pp. 744-765, March 1998.
2. E. Viterbo and F. Oggier, Algebraic Number Theory and Code Design for Rayleigh Fading Channels. Foundation and Trend in Communication and Information Theory, Now Publishers Inc, 2005.
3. M. O. Damen, H. Gamal, and G. Caire, "On maximum likelihood detection and the search for the closest lattice point," IEEE Trans. Inform. Theory, vol. 49, pp. 2389-2402, October 2003.
4. B. Hassibi and H. Vikalo, "On the sphere-decoding algorithm I. Expected complexity," IEEE Trans. Inform. Theory, vol. 53, pp. 2806-2818, August 2005.
5. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, p. 4637471, April 1985.
6. J.-C. Belfiore, G.Regaya, and E. Viterbo, "The golden code: A 2×2 full-rate space-time code with nonvanishing determinants," IEEE Trans. Inform. Theory, vol. 51, pp. 1432-1436, 2005.
7. H. Yao and G. W Wornell, "Achieving the full MIMO diversity multiplexing frontier with rotation-based space-time codes," in Proc. Allerton Conference on Communication, Control and Computing, October 2003.
8. P. Dayal and M. K. Varanasi, "Optimal two transmit antenna space-time code and its stacked extensions," IEEE Trans. Inform. Theory, vol. 51, pp. 4348-4355, 2005.
9. L. Zheng and D. N. Tse, "Diversity and multiplexing: A fundamental tradeoff in multiple-antenna channels," IEEE Trans. Inform. Theory, vol. 49, pp. 1073-1096, May 2003.
10. M. O. Damen, A. Tewfik, and J.-C. Belfiore, "A construction of a spacetime code based on number theory," IEEE Trans. Inform. Theory, vol. 48, pp. 753-760, March 2002.
11. P. Rabiei and N. Al-Dhahir, "A new full-rate, full-diversity STBC for 2 Tx with low complexity ML decoding," in to appear in VTC 2007, (Baltimore, Maryland), Sept. 2007.
12. S. J. Lee et. al, "A space-time code with full diversity and rate 2 for 2 transmit antenna transmission," in IEEE 802.16 Session #34, 2004, Contribution IEEE C 802.16e-04/434r2, 2004.
13. R. Akhtar, "Cyclotomic euclidean number fields." Senior thesis. Harvard University., 1995.
14. S. N. Diggavi, N. Al-Dhahir, A. Stamoulis, and A. R. Calderbank, "Great expectations: The value of spacial diversity to wireless networks," Proc. IEEE, pp. 219-270, Feb. 2004.