Open Access Open Access  Restricted Access Subscription or Fee Access

A Comparative Study on the Performance of Delay-Tolerant Space Time Codes using Threaded Algebra and Cyclic Division Algebra for Cooperative Networks

A. Ancy Marzla, C. Arunachala Perumal


In wireless communication systems, to combat fading, multiple antennas may be equipped at the transmitter and/or the receiver, where multiple antennas may provide spatial diversity gain as well as multiplexing gain. Cooperative diversity, which employs multiple nodes for the simultaneous relaying of a given packet in MIMO wireless networks, has been shown to be an effective means of improving diversity, and, hence, mitigating the detrimental effects of multipath fading. In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each terminal has its own local oscillator. In cooperative networks using a decode-and forward strategy, the multiple relays effectively transmit a distributed space–time code, the performance of which can be severely degraded when timing synchronization among the relays is not assured. the new Distributed-threaded algebraic space–time (TAST) codes are effective and flexible, enabling use of different signalling constellations, transmission rates, numbers of transmit and receive antennas, and decoders of varying levels of complexity. Perfect space-time codes (STC) based on cyclic division algebras (CDA), maintain the same properties as perfect codes in the synchronous case. Moreover, these codes preserve their full-diversity in asynchronous transmission. This paper presents a comparative study on the performance of the two schemes.



Full Text:



E. Telatar, “Capacity of multi-antenna Gaussian channels,” European Trans. Telecommun., vol. 10, no. 6, pp. 558–595, Nov./Dec. 1999.

A. Sandonaris, E. Erkip, and B. Aazhang, “User cooperative diversitypart I: System description,” IEEE Trans. Commun. , vol. 51, no. 11, pp. 1927–1938, Nov. 2003.

Y. Li and X.-G. Xia, “Full Diversity Distributed Space-Time Trellis Codes for Asynchronous Cooperative Communications,” 2004, preprint.

H. F. Lu and P. V. Kumar, “A unified construction of space–time codes with optimal rate-diversity tradeoff,” IEEE Trans. Inf. Theory, vol. 51, no. 5, pp. 1709–1730, May 2005.

Y. Shang and X.-G. Xia, “Shift Full Rank Matrices and Applications in Space-Time Trellis Codes for Relay Networks With Asynchronous Cooperative Diversity,” preprint.

A. R. Hammons, Jr. and R. E. Conklin, Jr., “Space-time block codes for quasi-synchronous cooperative diversity,” in Proc. Military Communications Conf. (MILCOM), Washington, DC, Oct. 2006, pp. 1–7.

H. El Gamal and A. R. Hammons, “A new approach to layered spacetime coding and signal processing,” IEEE Trans. Inf. Theory, vol. 47, no. 6, pp. 2335–2367, Sep. 2001.

G. J. Foschini, “Layered space-time architecture for wireless communication in a fading environment when using multiple antennas,” AT&T Bell Labs. Tech. J., vol. 1, no. 2, pp. 41–59, 1996.

M. O. Damen, K. Abed-Meraim, and J.-C. Belfiore, “Diagonal algebraic space-time block codes,” IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 628–636, Mar. 2002.

D. A. Marcus, Number Fields. New York: Springer-Verlag, 1977.

S. Lang, Algebraic Number Theory. New York: Springer-Verlag, 1970.

H. El Gamal and M. O. Damen, “Universal space–time coding,” IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1097–1119, May 2003.

A. R. Hammons, Jr, “Algebric space-time codes for quasi-synchronous cooperative diversity,” in Proc. IEEE Int. Conf. Wireless Networks, Communications and Mobile Computing, Jun. 2005, pp. 11–15.

A. R. Hammons, Jr, “Space-time code designs based on the generalized binary rank criterion with applications to cooperative diversity,” in Proc. Int. Workshop on Coding and Cryptography, Mar. 2005, pp.69–84.

A. R. Hammons, Jr and R. E. Conklin, “Space-time block codes for quasi-synchronous cooperative diversity,” in Proc. IEEE Military Communications Conf., Oct. 2006, pp. 1–7.

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.

M. O. Damen and A. R. Hammons, Jr, “Delay-tolerant distributed- TAST codes for cooperative diversity,” IEEE Trans. Inf. Theory, vol. 33, no. 10, pp. 3755–3773, Oct. 2007.

]M. Torbatian and M. O. Damen, “On the design of delay-tolerant distributed space-time codes with minimum length,” IEEE Trans.Wireless Commun., to be published.

J.-C. Belfiore, G. Rekaya, and E. Viterbo, “The golden code: A 2􀀀2 full-rate space-time code with non-vanishing determinants,” IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1432 1436, Apr. 2005.

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.

P. Elia, P. R. Kumar, S. A. Pawar, P.V. Kumar, and H.-F. Lu, “Explicit, minimum-delay, space-time codes achieving the diversity-multiplexing gain tradeoff,” IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 3869–3884, Sep. 2006.

P. Elia, B. A. Sethuraman, and P. V. Kumar, “Perfect space-time codes for any number of antennas,” IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 3853–3868, Nov. 2007.

S. Yang and J.-C. Belfiore, “Optimal space-time codes for the amplifyand- forward cooperative channel,” IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 647–663, Feb. 2007.

F. Oggier and B. Hassibi, “An algebraic coding scheme for wireless relay networks with multiple-antennas nodes,” IEEE Trans. Signal Process. Theory, vol. 56, no. 7, pp. 2957–2966, Jul. 2008.

L. Zheng and D. Tse, “Diveristy and multiplexing: A fundamental tradeoff in multiple-antenna channels,” IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1073–1096, May 2003.

P. Elia and P. V. Kumar, “Construction of cooperative diversity schemes for asynchronous wireless networks,” in Proc. IEEE Int. Symp. Information Theory, Jul. 2006, pp. 2724–2728.

G. Berhuy and F. Oggier, “Applied algebra, algebraic algorithms and error-correcting codes,” in Chapter: Space-Time Codes From Crossed Product Algebras of Degree 4. New York: Springer-Verlag, 2007, pp. 90–99.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.