ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Asymptotically-good, multigroup decodable space-time block codes

Natarajan, Lakshmi Prasad and Rajan, Sundar B (2013) Asymptotically-good, multigroup decodable space-time block codes. In: IEEE Transactions on Wireless Communications, 12 (10). pp. 5035-5047.

[img] PDF
IEEE_Tran_Wire_Comm_12-10_5035_2013.pdf - Published Version
Restricted to Registered users only

Download (378kB) | Request a copy
Official URL: http://dx.doi.org/10.1109/TWC.2013.090313.121748

Abstract

For a family of Space-Time Block Codes (STBCs) C-1, C-2,..., with increasing number of transmit antennas N-i, with rates R-i complex symbols per channel use, i = 1, 2,..., we introduce the notion of asymptotic normalized rate which we define as lim(i ->infinity) R-i/N-i, and we say that a family of STBCs is asymptotically-good if its asymptotic normalized rate is non-zero, i. e., when the rate scales as a non-zero fraction of the number of transmit antennas. An STBC C is said to be g-group decodable, g >= 2, if the information symbols encoded by it can be partitioned into g groups, such that each group of symbols can be ML decoded independently of the others. In this paper we construct full-diversity g-group decodable codes with rates greater than one complex symbol per channel use for all g >= 2. Specifically, we construct delay-optimal, g-group decodable codes for number of transmit antennas N-t that are a multiple of g2left perpendicular(g-1/2)right perpendicular with rate N-t/g2(g-1) + g(2)-g/2N(t). Using these new codes as building blocks, we then construct non-delay-optimal g-group decodable codes with rate roughly g times that of the delay-optimal codes, for number of antennas N-t that are a multiple of 2left perpendicular(g-1/2)right perpendicular, with delay gN(t) and rate Nt/2(g-1) + g-1/2N(t). For each g >= 2, the new delay-optimal and non-delay- optimal families of STBCs are both asymptotically-good, with the latter family having the largest asymptotic normalized rates among all known families of multigroup decodable codes with delay T <= gN(t). Also, for g >= 3, these are the first instances of g-group decodable codes with rates greater than 1 reported in the literature.

Item Type: Journal Article
Publication: IEEE Transactions on Wireless Communications
Publisher: IEEE-Institute of Electrical and Electronics Engineers
Additional Information: Copyright of this article belongs to IEEE-Institute of Electrical and Electronics Engineers.
Keywords: Asymptotically-Good; Full-Diversity; Hurwitz-Radon Orthogonality; Maximum-Likelihood (ML) Decoding; Multi-Group Decodable Codes; Space-Time Block Codes (STBCs)
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 06 Jan 2014 08:57
Last Modified: 06 Jan 2014 09:00
URI: http://eprints.iisc.ac.in/id/eprint/48114

Actions (login required)

View Item View Item