Asymmetric Turbo Code for Coded-Cooperative Wireless Communication Based on Matched Interleaver with Channel Estimation and Multi-Receive Antennas at the Destination

Mughal, Shoaib; Ahmed, Saleem; Yang, Fang; Ejaz, Saqib; Umar, Rahim

doi:10.13164/re.2017.0878

Cited by 10 publications

(19 citation statements)

References 34 publications

(51 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Actually, only those input sequences whose weights are less than certain value w max (β) (β = 2,4) should be eliminated. The parameter w max (β) acts like a threshold [30]. By combining Equation 4with w max β=2 , and integrating…”

Section: Code Matched Interleavermentioning

confidence: 99%

“…It is worth mentioning that not all finite weight sequences are bad. Actually, only those input sequences whose weights are less than certain value w max acts like a threshold [30]. By combining Equation (4) with w β=2 max , and integrating Equation (8) with w β=4 max , we obtained the following inequalities:…”

Section: Asymmetric Turbo-coded Spatial Modulation (Atc-sm) Scheme Wimentioning

confidence: 99%

“…In [28], it was well proven that the code matched interleaver (CMI) is the optimum interleaver of turbo codes. In [30], the authors analyzed and discussed the BER performance of asymmetric turbo codes with the CMI. To the best of our knowledge, asymmetric turbo coded SM (ATC-SM) as an integration of asymmetric turbo codes based on the CMI and SM with higher-order modulation in non-cooperative scenarios, has not been investigated.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Two-Source Asymmetric Turbo-Coded Cooperative Spatial Modulation Scheme with Code Matched Interleaver

et al. 2020

View full text Add to dashboard Cite

This paper proposes, for the first time, a two-source asymmetric turbo-coded-cooperative spatial modulation (SM) scheme over the slow Rayleigh fading channel. As in any coded cooperative communication, the interleaver plays a vital role in mitigating the harsh effect of the wireless channel. Therefore, the code matched interleaver (CMI) is effectively used in the proposed design. The simulated results reveal that the bit error rate (BER) performance of the proposed coded cooperative communication system outperforms the asymmetric turbo-coded non-cooperative scheme under identical conditions. This prominent performance improvement has been made possible due to the joint asymmetric turbo decoding at the destination node. Furthermore, to check the effectiveness of the proposed scheme, we have also developed a two-source asymmetric turbo-coded cooperative scheme based on the vertical bell labs layered space-time (VBLAST), incorporating the CMI as the suitable benchmark. It is observed that the proposed scheme employing SM has a better BER performance than the VBLAST scheme under identical conditions.

show abstract

Section: Code Matched Interleavermentioning

confidence: 99%

Section: Asymmetric Turbo-coded Spatial Modulation (Atc-sm) Scheme Wimentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Two-Source Asymmetric Turbo-Coded Cooperative Spatial Modulation Scheme with Code Matched Interleaver

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Distributed decoding of turbo codes has been investigated widely over cooperative relay network system [1], [2], [3], [4], and [5]. One of the turbo codes types is the Turbo Product Code TPC.…”

Section: Introductionmentioning

confidence: 99%

Iterative Decoding of Chase Pyndiah Decoder Utilizing Multiple Relays Network

Alnawayseh¹

2021

IJACSA

View full text Add to dashboard Cite

In this paper, a distributed Encoding and decoding of Turbo Product Code (TPC) over single and multiple relays network are proposed. The information message matrix is encoded at source by Bose Chaudhuri Hochquenghem (BCH) as component code and transmitted to destination and relays in the midway between source and destination. The coded source message is decoded by simple chase П decoder at relay and encoded again horizontally and vertically by BCH component code to construct TPC. Two scenarios were investigated. First scenario, utilizing one relay in cooperative network, where the vertical parity part of TPC is transmitted to destination to be the input of row decoder for original chase pyndiah decoder, while the received encoded horizontally matrix from source is the input of the column decoder. In the second scenario multiple relays are utilized and multiple copies of vertical parity part of TPC are sent to destination to be decoded by the proposed modified iterative chase pyndiah decoder with multiple integrated stages for each iteration. Simulation results for the first scenario over Additive White Gaussian (AWGN) and Rayleigh fading channels and using original chase Pyndiah decoder at destination shows 2dB gain improvement at BER= − and 4dB gain improvement at BER= − respectively over BER performance of un cooperative system. While results for distributed TPC decoding for the second scenario and using the proposed modified iterative chase Pyndiah decoder at destination shows 2.7 dB and 3 dB gain at BER = − for AWGN and Rayleigh fading channels respectively over the first scenario.

show abstract

“…These protocols have been combined with channel codes to construct a more efficient way of cooperation known as coded-cooperative. Various codedcooperative schemes have been presented in literature such as low density parity check (LDPC) codes [4,5], turbo codes [6,7], polar codes [8][9][10] and Reed-Muller (RM) codes [11,12].…”

Section: Introductionmentioning

confidence: 99%

Jointly Optimized Design of Distributed RS Codes by Proper Selection in Relay

Guo

Yang

Zhao

et al. 2021

Preprint

View full text Add to dashboard Cite

This paper proposes a distributed RS coding scheme which is comprised of two different ReedSolomon (RS) codes over fast Rayleigh fading channel. Practically in any distributed coding scheme, an appropriate encoding strategy at the relay plays a vital role in achieving an optimized code at the destination. Therefore, the authors have proposed an efficient approach for proper selection of information at the relay based on subspace approach. Using this approach as the proper benchmark, another more practical selection approach with low complexity is also proposed. Monte Carlo simulations demonstrate that the distributed RS coding scheme under the two approaches can achieve nearly the same bit error rate (BER) performance. Furthermore, to jointly decode the source and relay codes at the destination, two different decoding algorithms named as naive and smart algorithms are proposed. The simulation results reveal that the advantage of smart algorithm as compared to naive one. The proposed distributed RS coding scheme with smart algorithm outperforms its non-cooperative scheme by a gain of 2.4-3.2 dB under identical conditions. Moreover, the proposed distributed RS coding scheme outperforms multiple existing distributed coding schemes, making it an excellent candidate for the future distributed coding wireless communications.

show abstract

Asymmetric Turbo Code for Coded-Cooperative Wireless Communication Based on Matched Interleaver with Channel Estimation and Multi-Receive Antennas at the Destination

Cited by 10 publications

References 34 publications

Two-Source Asymmetric Turbo-Coded Cooperative Spatial Modulation Scheme with Code Matched Interleaver

Two-Source Asymmetric Turbo-Coded Cooperative Spatial Modulation Scheme with Code Matched Interleaver

Iterative Decoding of Chase Pyndiah Decoder Utilizing Multiple Relays Network

Jointly Optimized Design of Distributed RS Codes by Proper Selection in Relay

Contact Info

Product

Resources

About