Multigroup ML Decodable Collocated and Distributed Space-Time Block Codes

Rajan, G. Susinder; Rajan, B. Sundar

doi:10.1109/tit.2010.2048475

Cited by 72 publications

(60 citation statements)

References 73 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The overall interest in this field of research lies in the construction of a high-rate D-STBC that has the ability to utilise any arbitrary number of relays [13,14]. It would appear that research has had limited success in designing high-rate codes while maintaining a single-symbol decodability at the destination.…”

Section: Prior Workmentioning

confidence: 99%

An adaptive transmission protocol for exploiting diversity and multiplexing gains in wireless relaying networks

Astal

Abu‐Hudrouss

Salmon

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

Wireless relaying networks with distributed space-time block codes have been shown to provide high link reliability. This is because of the space diversity gain from multiple transmitting relays, which improves by adding more relays. The drawback of this approach is the overall reduction in throughput of the network. In this paper, we propose a method to construct a distributed space-time block code that is combined with spatial modulation to find a flexible trade-off between reliability and throughput. This proposed method is not restricted to a specific number of relays and can be constructed as necessary. The constructed code also uses a novel adaptive transmission protocol to achieve higher space diversity, even with relays equipped with a single antenna. This protocol assumes use of coherent detection, meaning that a perfect channel estimation is available at the destination. Lastly, a new decoder is proposed that offers significant reduction in complexity to maintain high data throughput. All claims in this work are supported with theoretical analysis and backed up with empirical results.

show abstract

Section: Prior Workmentioning

confidence: 99%

An adaptive transmission protocol for exploiting diversity and multiplexing gains in wireless relaying networks

Astal

Abu‐Hudrouss

Salmon

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…For such STBCs, the minimum self-interference is achieved if the STBCs are g-group decodable, with g as large as possible. At present, the best known rate-1 low complexity multi-group decodable codes are the 4-group decodable codes for any number of transmit antennas [27], [28], [29]. These codes are not full-rate for n r > 1.…”

Section: )mentioning

confidence: 99%

“…in literature [27], [28], [29] are not suitable for extension to higher number of receive antennas, since their design is obtained by iterative methods. In the next section, we propose a new design methodology to obtain the weight matrices of a rate-1, 4-group decodable code by algebraic methods for 2 a transmit antennas.…”

Section: )mentioning

confidence: 99%

“…Theorem 1: [28] An n × n linear dispersion code transmitting k real symbols is g-group decodable if the weight matrices satisfy the following conditions: Table I illustrates the weight matrices of a g-group decodable code which satisfy the above conditions. The weight matrices in each column belong to the same group.…”

Section: Construction Of Rate-1 4-group Decodable Codesmentioning

confidence: 99%

See 1 more Smart Citation

Generalized Silver Codes

Srinath

Rajan

2011

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

For an n t transmit, n r receive antenna system (n t × n r system), a full-rate space time block code (STBC) transmits n min = min(n t , n r ) complex symbols per channel use. The well known Golden code is an example of a full-rate, full-diversity STBC for 2 transmit antennas. Its ML-decoding complexity is of the order of M 2.5 for square M -QAM. The Silver code for 2 transmit antennas has all the desirable properties of the Golden code except its coding gain, but offers lower ML-decoding complexity of the order of M 2 . Importantly, the slight loss in coding gain is negligible compared to the advantage it offers in terms of lowering the ML-decoding complexity. For higher number of transmit antennas, the best known codes are the Perfect codes, which are full-rate, full-diversity, information lossless codes (for n r ≥ n t )but have a high ML-decoding complexity of the order of M ntnmin (for n r < n t , the punctured Perfect codes are considered). In this paper 1 , a scheme to obtain full-rate STBCs for 2 a transmit antennas and any n r with reduced ML-decoding complexity of the order of M nt(nmin− 3 4 )−0.5 , is presented. The codes constructed are also information lossless for n r ≥ n t , like the Perfect codes and allow higher mutual information than the comparable punctured Perfect codes for n r < n t . These codes are referred to as the generalized Silver codes, since they enjoy the same desirable properties as the comparable Perfect codes (except possibly the coding gain) with lower ML-decoding complexity, analogous to the Silver-Golden codes for 2 transmit antennas. Simulation results of the symbol error rates for 4 and 8 transmit antennasshow that the generalized Silver codes match the punctured Perfect codes in error performance while offering lower ML-decoding complexity.

show abstract

“…are systematically constructed, 2-group decodable [6], fullrate (one complex symbol per channel use), full-diversity distributed codes. Using the proposed codes, we can employ large number of antennas and potential relays to improve the diversity order.…”

Section: Introductionmentioning

confidence: 99%

Quasi-Orthogonal Design and Performance Analysis of Amplify-And-Forward Relay Networks with Multiple-Antennas

Maham

Hjørungnes

Rajan

2010

2010 IEEE Wireless Communication and Networking Conference

Self Cite

View full text Add to dashboard Cite

Abstract-This paper is on the design and performance analysis of practical distributed space-time codes for wireless relay networks with multiple antennas terminals. The amplify-andforward scheme is used in a way that each relay transmits a scaled version of the linear combination of the received symbols. We propose distributed generalized quasi-orthogonal space-time codes which are distributed among the source antennas and relays, and valid for any number of relays. Assuming M -PSK and M -QAM signals, we derive a formula for the symbol error probability of the investigated scheme over Rayleigh fading channels. For sufficiently large SNR, this paper derives closed-form average SER expression. The simplicity of the asymptotic results provides valuable insights into the performance of cooperative networks and suggests means of optimizing them. Our analytical results have been confirmed by simulation results, using full-rate full-diversity distributed codes. I. INTRODUCTIONIn [1], a cooperative strategy was proposed which achieves a diversity factor of R in a R-relay wireless network, using the distributed space-time codes (DSTC). A two-phase protocol is used for this strategy. In phase one, the transmitter sends the information signal to the relays and in phase two, relays send information to the receiver. The signal sent by every relay in the second phase is designed as a linear function of its received signal. It was shown that the relays can generate a linear space-time codeword at the receiver, as in a multiple antenna system, although they only cooperate distributively. This method does not require decoding at the relays and for high SNR it achieves the optimal diversity factor [1]. Recently, the design of practical DSTC in amplify-and-forward (A&F) mode, that lead to reliable communication in wireless relay networks, has been presented in [2] and [3].Distributed space-time coding in A&F mode was generalized to networks with multiple-antenna nodes in [4]. However, design of the appropriate space-time codes is not investigated in [4]. Note that in decode-and-forward (D&F) based spacetime codes, we can simply use the same space-time codes in the context of MIMO in multiple antenna source and relays [5]. Compared with D&F, since no decoding is needed at the relays, A&F DSTC saves both time and energy and more importantly, there is no rate constraint on the transmission.In this paper, we focus on the design of the quasi-orthogonal DSTCs for multiple-antenna terminals with A&F relays, which

show abstract

Multigroup ML Decodable Collocated and Distributed Space-Time Block Codes

Cited by 72 publications

References 73 publications

An adaptive transmission protocol for exploiting diversity and multiplexing gains in wireless relaying networks

An adaptive transmission protocol for exploiting diversity and multiplexing gains in wireless relaying networks

Generalized Silver Codes

Quasi-Orthogonal Design and Performance Analysis of Amplify-And-Forward Relay Networks with Multiple-Antennas

Contact Info

Product

Resources

About