Four-Group Decodable Space–Time Block Codes

Dao, Dung Ngoc; Yuen, Chau; Tellambura, Chintha; Guan, Yong Liang; Tjhung, Tjeng Thiang

doi:10.1109/tsp.2007.906729

Cited by 81 publications

(78 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We begin with a review of the perfect [7], TAST [4], and SAST [11] codes. The perfect codes were originally designed as full-rate codes for square channels, but with puncturing, they can achieve any rate in the range R{1, , M}.…”

Section: B Review Of the Perfect Tast And Sast Codesmentioning

confidence: 99%

“…The rate of the TAST codes is limited to the same range and the rate of the SAST codes is always R = 1. In terms of these definitions, the perfect space-time code [7], TAST [4] and SAST [11] codes are defined as follows.…”

Section: B Review Of the Perfect Tast And Sast Codesmentioning

confidence: 99%

“…This version of SAST differs from the original in [11] only by the fact that the submatrices D are diagonal instead of circulant. The circulant matrix reduces the peak-to-average-power ratio (PAPR) but has no impact on the diversity, coding gain, and decoding complexity.…”

Section: B Review Of the Perfect Tast And Sast Codesmentioning

confidence: 99%

“…• The proposed EAST code differs from other ABBA codes in [11] and [12] in that the symbols are conjugated before encoding. In fact, if the code matrices P( a*) and P(-b*) are replaced with either the conjugate matrices ( P( a))* and ( P(-b))* respectively, as done in [12], or with the conjugate transpose matrices ( P( a)) H and ( P(-b)) H , respectively, as done in [11], then the codematrix in (11) is no longer full rank.…”

Section: A Encodingmentioning

confidence: 99%

“…When compared to previously reported codes with the same number of antennas and the same rate larger than one, the EAST codes are simultaneously lower in complexity and lower in error probability. Lastly, we show that the proposed code subsumes the rate-one semi-orthogonal algebraic spacetime (SAST) codes of [11] as a special case.…”

Section: Introductionmentioning

confidence: 96%

See 4 more Smart Citations

Embedded Alamouti space-time codes for high rate and low decoding complexity

Barry¹,

Madisetti²

2008

2008 42nd Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

-We introduce a new family of space-time codes called embedded Alamouti space-time (EAST) codes which offer high rate, a nonvanishing determinant and low decoding complexity. The family is parameterized by both the number of transmit antennas, which can range from two to eight, and by the rate, which can range from one to half the number of transmit antennas. The EAST codes combine a modified version of the perfect spacetime codes with an Alamouti embedding. For rates higher than one, the resulting space-time codes are simultaneously lower in decoding complexity and better performing than all known previous constructions in terms of the error probability achieved on a quasistatic Rayleigh fading channel with a given dimension.Index Terms -transmit diversity, space-time coding. I. INTRODUCTIONRecent work in space-time code design has shifted away from increasing the diversity order [1,2] or transmission rate [3] alone to increasing both simultaneously [4][5][6][7][8][9]. The continuous tradeoff between the achievable diversity and multiplexing gains as a function of the signal-to-noise ratio (SNR) was characterized in [10]. The threaded algebraic space-time (TAST) codes of [4] achieve the extremal points of the diversity-multiplexing tradeoff for any number of antennas and arbitrary rates. The perfect space-time codes of [7] achieve the entire frontier of the diversity-multiplexing tradeoff. Perfect space-time codes were originally proposed for only two, three, four and six antennas in [7] and later generalized for any number of antennas in [8].One approach to constructing a high-rate code is to start with a maximal-rate TAST or perfect space-time code and then puncture one or more of its layers. For example, TAST and perfect space-time codes of rate R  {1, 2, 3, 4} are easily obtained by puncturing 4 -R layers of a rate-4 code. Unfortunately, the resulting codes often have a high decoding complexity and worse BER performance than space-time codes that were designed for a particular rate and a particular number of antennas.No previously reported space-time code achieve an arbitrary rate for arbitrary number of antennas while maintaining low decoding complexity. In this paper we partially fill this gap by proposing a framework for the construction and decoding of high rate space-time block codes. In particular, we make three contributions. First, we show that the complex rotation matrices of the perfect spacetime code of [7] can be replaced by equivalent real-valued matrices without affecting the diversity or coding gain; the real matrices lead to lower-complexity decoding. Second, we use the equivalent real generator matrices to construct the embedded Alamouti space-time (EAST) codes, which is a family of codes for any number of antennas up to eight, and for any rate up to half the number of antennas. When compared to previously reported codes with the same number of antennas and the same rate larger than one, the EAST codes are simultaneously lower in complexity and lower in error probability. Lastly, ...

show abstract

Section: B Review Of the Perfect Tast And Sast Codesmentioning

confidence: 99%

Section: B Review Of the Perfect Tast And Sast Codesmentioning

confidence: 99%

Section: B Review Of the Perfect Tast And Sast Codesmentioning

confidence: 99%

Section: A Encodingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 96%

See 3 more Smart Citations

Embedded Alamouti space-time codes for high rate and low decoding complexity

Barry¹,

Madisetti²

2008

2008 42nd Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

show abstract

Transceiver design for STBC transmission over MIMO multiple‐access SC‐FDE systems

Sheikh‐Hosseini

2018

Trans Emerging Tel Tech

View full text Add to dashboard Cite

This paper investigates the transceiver design for a multiple‐input multiple‐output multiple‐access system, J cochannel users each having Q antennas and an array‐processing receiver employing M receive antennas, in which the single‐carrier frequency‐domain equalization technique is used as the physical layer solution for the transmission of different space‐time block coding (STBC) schemes. Assuming quasi‐static fading model and no channel state information at the user terminals, a transceiver design is provided for this system utilizing M=J receive antennas for interference cancellation, frequency‐domain equalization, and detection of the users. First, this design is considered for orthogonal and generalized coordinate interleaved orthogonal design STBCs as 2 single‐symbol decodable STBC schemes and then extended to quasi‐orthogonal STBC as a double‐symbol decodable STBC scheme. For this extension, each quasi‐orthogonal system of J users and Q transmit antennas is converted to 2 orthogonal subsystems of J cochannel users each having Q antennas and then each subsystem is detected using the proposed method for orthogonal STBC transmission. Finally, the average bit error rate of the obtained designs is numerically illustrated for different STBC schemes with various numbers of users and transmitting antennas.

show abstract

Design of Improved Quasi-Orthogonal Space-Time Block Codes Based on Closed-Loop Control

Ding

Long

et al. 2014

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Four-Group Decodable Space–Time Block Codes

Cited by 81 publications

References 17 publications

Embedded Alamouti space-time codes for high rate and low decoding complexity

Embedded Alamouti space-time codes for high rate and low decoding complexity

Transceiver design for STBC transmission over MIMO multiple‐access SC‐FDE systems

Design of Improved Quasi-Orthogonal Space-Time Block Codes Based on Closed-Loop Control

Contact Info

Product

Resources

About