Multigroup ML decodable collocated and distributed space-time block codes

IEEE Transactions on Information Theory

Volumn 56, Issue 7, 2010, Pages 3221-3247

  Rajan, G Susinder ^a   Rajan, B Sundar ^b  

^a Atheros India LLC   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Asynchronous cooperative communication; Clifford algebra; Cooperative diversity; Decoding complexity; Distributed space time codes; Orthogonal frequency division multiplexing (OFDM); Space time codes

Indexed keywords

CLIFFORD ALGEBRA; CO-OPERATIVE DIVERSITY; COOPERATIVE COMMUNICATION; DECODING COMPLEXITY; DISTRIBUTED SPACE-TIME CODES; SPACE TIME CODE;

ALGEBRA; BLOCK CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); FREQUENCY DIVISION MULTIPLEXING; MAXIMUM LIKELIHOOD; ORTHOGONAL FUNCTIONS; RELAY CONTROL SYSTEMS; SPACE TIME ADAPTIVE PROCESSING; SPACE-TIME BLOCK CODING (STBC); TRANSMISSIONS; WIRELESS SENSOR NETWORKS;

DECODING;

EID: 77953764113     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2048475     Document Type: Article

References (65)

1. V. Tarokh, H. Jafarkhani, and A. R. Calderbank, "Space-time block codes from orthogonal designs," IEEE Trans. Inf. Theory, vol.45, no.5, pp. 1456-1467, Jul. 1999.
2. O. Tirkkonen and A. Hottinen, "Square-matrix embeddable space-time block codes for complex signal constellations," IEEE Trans. Inf. Theory, vol.48, no.2, pp. 384-395, Feb. 2002.
3. X.-B. Liang, "Orthogonal designs with maximal rates," IEEE Trans. Inf. Theory, vol.49, no.10, pp. 2468-2503, Oct. 2003.
4. H. Jafarkhani, "A quasi-orthogonal space-time block code," IEEE Trans. Commun., vol.49, no.1, pp. 1-4, Jan. 2001.
5. O. Tirkkonen, A. Boariu, and A. Hottinen, "Minimal non-orthogonality rate 1 space-time block code for Tx antennas," in Proc. IEEE Int. Symp. Spread-Spectrum Techn. Appl., Sep. 6-8, 2000, pp. 429-432.
6. C. Yuen, Y. L. Guan, and T. T. Tjhung, "Quasi-orthogonal STBC with minimum decoding complexity," IEEE Trans. Wireless Commun., vol.4, no.5, pp. 2089-2094, Sep. 2005.
7. H. Wang, D. Wang, and X.-G. Xia, "On optimal quasi-orthogonal space-time block codes with minimum decoding complexity," IEEE Trans. Inf. Theory, vol.55, no.3, pp. 1104-1130, Mar. 2009.
8. D. N. Dao, C. Yuen, C. Tellambura, Y. L. Guan, and T. T. Tjhung, "Four-group decodable space-time block codes," IEEE Trans. Signal Process., vol.56, no.1, pp. 424-430, Jan. 2008.
9. B. A. Sethuraman, B. S. Rajan, and V. Shashidhar, "Full-diversity, high-rate space-time block codes from division algebras," IEEE Trans. Inf. Theory, vol.49, no.10, pp. 2596-2616, Oct. 2003.
10. V. Shashidhar, B. S. Rajan, and B. A. Sethuraman, "Information- lossless space-time block codes from crossed-product algebras," IEEE Trans. Inf. Theory, vol.52, no.9, pp. 3913-3935, Sep. 2006.
11. Md. Z. A. Khan and B. S. Rajan, "Single-symbol maximum-likelihood decodable linear STBCs," IEEE Trans. Inf. Theory, vol.52, no.5, pp. 2062-2091, May 2006.
12. S. Karmakar and B. S. Rajan, "Minimum-decoding complexity, maximum-rate space-time block codes from Clifford algebras," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, July 9-14, 2006, pp. 788-792. (Pubitemid 351244202)
13. S. Karmakar and B. S. Rajan, "High-rate double-symbol-decodable STBCs from Clifford algebras," in Proc. IEEE Conf. Global Commun., San Francisco, CA, Nov. 27-Dec. 1 2006, DOI: 10.1109/GLOCOM. 2006.90.
14. S. Karmakar and B. S. Rajan, "Multi-group decodable STBCs from Clifford algebras," in Proc. IEEE Inf. Theory Workshop, Chengdu, China, Oct. 22-26, 2006, pp. 448-452.
15. S. Karmakar and B. S. Rajan, "High-rate multi-symbol-decodable STBCs from Clifford algebras," in Proc. 13th Nat. Conf. Commun., Jan. 26-28, 2007 [Online]. Available: http://ece.iisc.ernet.in/∼bsrajan
16. B. Hassibi and B. M. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inf. Theory, vol.48, no.7, pp. 1804-1824, Jul. 2002.
17. L. Zheng and D. N. C. Tse, "Diversity and multiplexing:Afundamental tradeoff in multiple-antenna channels," IEEE Trans. Inf. Theory, vol.49, no.5, pp. 1073-1096, May 2003.
18. S. Tavildar and P. Viswanath, "Approximately universal codes over slow-fading channels," IEEE Trans. Inf. Theory, vol.52, no.7, pp. 3233-3258, Jul. 2006.
19. T. Kiran and B. S. Rajan, "STBC-schemes with nonvanishing determinant for certain number of transmit antennas," IEEE Trans. Inf. Theory, vol.51, no.8, pp. 2984-2992, Aug. 2005. (Pubitemid 41158622)
20. F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, "Perfect space-time block codes," IEEE Trans. Inf. Theory, vol.52, no.9, pp. 3885-3902, Sep. 2006.
21. P. Elia, K. R. Kumar, S. A. Pawar, P. V. Kumar, and H.-F. Lu, "Explicit Space-time codes achieving the diversity multiplexing gain tradeoff," IEEE Trans. Inf. Theory, vol.52, no.9, pp. 3869-3884, Sep. 2006.
22. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol.45, no.5, pp. 1639-1642, Jul. 1999.
23. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code decoder for space-time codes," IEEE Commun. Lett., vol.4, no.5, pp. 161-163, May 2000.
24. B. Hassibi and H. Vikalo, "On the sphere-decoding algorithm I. Expected complexity," IEEE Trans. Signal Process., vol.53, no.8, pp. 2806-2818, Aug. 2005.
25. J. Jalden and B. Ottersten, "An exponential lower bound on the expected complexity of sphere decoding," in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., Montreal, QC, Canada, May 17-21, 2004, vol.4, pp. 393-396.
26. A. Hottinen, O. Tirkkonen, and R. Wichman, Multi-Antenna Transceiver Techniques for 3G and Beyond. New York: Wiley, 2003.
27. S. M. Alamouti, "A simple transmit diversity technique for wireless communications," IEEE J. Sel. Areas Commun., vol.16, no.8, pp. 1451-1458, Oct. 1998.
28. J.-C. Belfiore, G. Rekaya, and E. Viterbo, "The golden code: A 2 × 2 full-rate space time code with nonvanishing determinants," IEEE Trans. Inf. Theory, vol.51, no.4, pp. 1432-1436, Apr. 2005.
29. E. Biglieri, Y. Hong, and E. Viterbo, "On fast-decodable space-time block codes," IEEE Trans. Inf. Theory, vol.55, no.2, pp. 524-530, Feb. 2009.
30. J. Paredes, A. B. Gershman, and M. Gharavi-Alkhansari, "A 2 × 2 space-time code with non-vanishing determinants and fast maximum likelihood decoding," in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., Honolulu, HI, Apr. 15-20, , pp. II-877-II-880.
31. M. Samuel and M. P. Fitz, "Reducing the detection complexity by using 2 × 2 multi-strata space-time codes," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007, pp. 1946-1950.
32. J. N. Laneman and G. W.Wornell, "Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks," IEEE Trans. Inf. Theory, vol.49, no.10, pp. 2415-2425, Oct. 2003.
33. Y. Jing and B. Hassibi, "Distributed space-time coding in wireless relay networks," IEEE Trans. Wireless Commun., vol.5, no.12, pp. 3524-3536, Dec. 2006.
34. F. Oggier and B. Hassibi, "An algebraic family of distributed spacetime codes for wireless relay networks," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 9-14, 2006, pp. 538-541.
35. P. Elia, F. Oggier, and P. V. Kumar, "Asymptotically optimal cooperative wireless networks with reduced signaling complexity," IEEE J. Sel. Areas Commun., vol.25, no.2, pp. 258-267, Feb. 2007.
36. P. Elia, K. Vinodh, M. Anand, and P. V. Kumar, "D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols," IEEE Trans. Inf. Theory, vol.55, no.7, pp. 3161-3185, Jul. 2009.
37. T. Kiran and B. S. Rajan, "Distributed space-time codes with reduced decoding complexity," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 9-14, 2006, pp. 542-546.
38. Y. Jing and H. Jafarkhani, "Using orthogonal and quasi-orthogonal designs in wireless relay networks," IEEE Trans. Inf. Theory, vol.53, no.11, pp. 4106-4118, Nov. 2007.
39. Z. Li and X.-G. Xia, "A simple Alamouti space-time transmission scheme for asynchronous cooperative systems," IEEE Signal Process. Lett., vol.14, no.11, pp. 804-807, Nov. 2007.
40. X. Guo and X.-G. Xia, "A distributed space-time coding in asynchronous wireless relay networks," IEEE Trans. Wireless Commun., vol.7, no.5, pp. 1812-1816, May 2008.
41. S. Wei, D. L. Goeckel, and M. C. Valenti, "Asynchronous cooperative diversity," IEEE Trans. Wireless Commun., vol.5, no.6, pp. 1547-1557, Jun. 2006.
42. X. Li, "Space-time coded multi-transmission among distributed transmitters without perfect synchronization," IEEE Signal Process. Lett., vol.11, no.12, pp. 948-951, Dec. 2004.
43. Y. Li and X.-G. Xia, "Full diversity distributed space-time codes for asynchronous cooperative communications," in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 4-9, 2005, pp. 911-915.
44. Y. Shang and X.-G. Xia, "Shift-full-rank matrices and applications in space-time trellis codes for relay networks with asynchronous cooperative diversity," IEEE Trans. Inf. Theory, vol.52, no.7, pp. 3153-3167, Jul. 2006.
45. Y. Mei, Y. Hua, A. Swami, and B. Daneshrad, "Combating synchronization errors in cooperative relays," in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., Mar. 2005, vol.3, pp. 369-372.
46. Y. Li, W. Zhang, and X.-G. Xia, "Distributed high-rate full-diversity space-frequency codes for asynchronous cooperative communications," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 9-14, 2006, pp. 2612-2616.
47. E. Bayer-Fluckiger, F. Oggier, and E. Viterbo:, "New algebraic constructions of rotated -lattice constellations for the Rayleigh fading channel," IEEE Trans. Inf. Theory, vol.50, no.4, pp. 702-714, Apr. 2004.
48. G. S. Rajan, A. Tandon, and B. S. Rajan, "On four-groupMLdecodable distributed space time codes for cooperative communication," in Proc. IEEE Wireless Commun. Netw. Conf., Hong Kong, Mar. 11-15, 2007, pp. 606-610.
49. G. S. Rajan and B. S. Rajan, "A Non-orthogonal distributed space-time protocol-Part I: Signal model and design criteria," in Proc. IEEE Inf. Theory Workshop, Chengdu, China, Oct. 22-26, 2006, pp. 385-389.
50. G. S. Rajan and B. S. Rajan, "A Non-orthogonal distributed space-time protocol-Part II: Code constructions and DM-G tradeoff," in Proc. IEEE Inf. Theory Workshop, Chengdu, China, Oct. 22-26, 2006, pp. 488-492.
51. G. S. Rajan and B. S. Rajan, "Algebraic distributed space-time codes with low ML decoding complexity," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007, pp. 1516-1520.
52. G. S. Rajan and B. S. Rajan, "STBCs from representation of extended Clifford algebras," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007, pp. 1626-1630.
53. G. S. Rajan and B. S. Rajan, "OFDM based distributed space time coding for asynchronous relay networks," in Proc. IEEE Int. Conf. Commun., Beijing, China, May 19-23, 2008, pp. 1118-1122.
54. G. S. Rajan and B. S. Rajan, "Algebraic distributed differential space-time codes with low decoding complexity," IEEE Trans. Wireless Commun., vol.7, no.10, pp. 3962-3971, Oct. 2008.
55. T. Kiran and B. S. Rajan, "Partially-coherent distributed space-time codes with differential encoder and decoder," IEEE J. Sel. Areas Commun., vol.25, no.2, pp. 426-433, Feb. 2007.
56. F. Oggier and B. Hassibi, "Cyclic distributed space-time codes for wireless relay networks with no channel information," IEEE Trans. Inf. Theory, vol.56, no.1, pp. 250-265, Jan. 2010.
57. Y. Jing and H. Jafarkhani, "Distributed differential space-time coding for wireless relay networks," IEEE Trans. Commun., vol.56, no.7, pp. 1092-1100, Jul. 2008.
58. C. Yuen, Y. L. Guan, and T. T. Tjhung, "On the search for high-rate quasi-orthogonal space-time block code," Int. J. Wireless Inf. Netw., vol.13, no.4, pp. 329-340, Oct. 2006.
59. Full Diversity Rotations [Online]. Available: http://www1.tlc.polito.it/ ∼viterbo/rotations/rotations.html
60. Z. Yi and I.-M. Kim, "Single-symbol MLdecodable distributed STBCs for cooperative networks," IEEE Trans. Inf. Theory, vol.53, no.8, pp. 2977-2985, Aug. 2007.
61. J. Harshan and B. S. Rajan, "High rate single-symbol ML decodable precoded DSTBCs for cooperative networks," IEEE Trans. Inf. Theory, vol.55, no.5, pp. 2004-2015, May 2009.
62. Z. Li and X.-G. Xia, "An Alamouti coded OFDM transmission for cooperative systems robust to both timing errors and frequency offsets," IEEE Trans. Wireless Commun., vol.7, no.5, pp. 1839-1844, May 2008.
63. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
64. N. Jacobson, Basic Algebra I, 2nd ed. New York: W. H. Freeman, 1985.
65. J.-P. Serre, Linear Representations of Finite Groups. New York: Springer-Verlag, 1977.