Concatenated coding for DS/CDMA transmission in wirelesscommunications

We investigate the use of forward-error correction (FEC) as well as concatenated coding for reliable data transmission in asynchronous direct-sequence code-division multiple-access communications over frequency-selective Rayleigh fading channels. The FEC scheme combines antenna diversity with low complexity concatenated codes which consist of a Reed-Solomon outer code and a convolutional inner code. Under this concatenated coding scheme, we analyze the average bit-error rate performance and capacity tradeoffs between various system parameters under a fixed total bandwidth expansion and concatenated codes constraint requirements     

交织的空时分组码级联不对称网格编码调制方法

根据交织的空时分组码级联TCM编码设计标准,提出了一种空时分组码级联不对称网格编码调制(A-TCM)的优化设计方案,并得到了在空时分组码级联不对称8PSK调制的TCM情况下最优的星座图旋转角度.仿真和分析结果表明,在相同的频谱效益和译码复杂度的情况下,相比传统空时分组码级联TCM的方法,新方法可进一步提高系统性能.     

Concatenated coding schemes and interleaving techniques over Rayleigh fading ionospheric channels

In this paper the performance of a concatenated coding scheme is evaluated over a slow Rayleigh fading HF ionospheric link with additive white Gaussian noise (AWGN). Well‐known Ungerboeck TCM techniques onto an 8‐PSK signal set are used as inner codes and Reed–Solomon block codes as outer codes. The coded/modulated signal is further differentially encoded before transmission to combat random phase changes. Block interleaving techniques are necessary to randomise long bursts of errors caused by the fading channel. The performance of the proposed concatenated coding system is investigated for various Doppler spreads. Significant coding gains are achieved over uncoded, diversity or other conventionally coded systems with a small bandwidth expansion. Finally the interesting effects of interleaving on the behaviour of the proposed systems are analysed. Copyright © 2001 John Wiley & Sons, Ltd.     

Concatenated space-time block coding with trellis coded modulation in fading channels

Trellis coded modulation (TCM) is a bandwidth efficient transmission scheme that can achieve high coding gain by integrating coding and modulation. This paper presents an analytical expression for the error event probability of concatenated space-time block coding with TCM which reveals some dominant factors affecting the system performance over slow fading channels when perfect interleavers are used. This leads to establishing the design criteria for constructing the optimal trellis codes of such a concatenated system over slow flat fading channels. Through simulation, significant performance improvement is shown to be obtained by concatenating the interleaved streams of these codes with space-time block codes over fading channels. Simulation results also demonstrate that these trellis codes have better error performance than traditional codes designed for single-antenna Gaussian or fading channels. Performance results over quasi-static fading channels without interleaving are also compared in this paper. Furthermore, it is shown that concatenated space-time block coding with TCM (with/without interleaving) outperforms space-time trellis codes under the same spectral efficiency, trellis complexity, and signal constellation.     

Space-time overlays for convolutionally coded systems

We consider the design of space-time overlays to upgrade single-antenna wireless communication systems to accommodate multiple transmit antennas efficiently. We define the overlay constraint such that the signal transmitted from the first antenna in the upgraded system is the same as that in the single-antenna system. The signals transmitted from the remaining antennas are designed according to space-time coding principles to achieve full spatial diversity in quasi-static flat fading channels. For both binary phase-shift keying (BPSK) and quaternary phase-shift keying modulation systems, we develop an algebraic design framework that exploits the structure of existing single-dimensional convolutional codes in designing overlays that achieve full spatial diversity with minimum additional decoding complexity at the receiver. We also investigate a concatenated coding approach for a BPSK overlay design in which the inner code is an orthogonal block code. This approach is shown to yield near optimal asymptotic performance for quasi-static fading channels. We conclude by offering a brief discussion outlining the extension of the proposed techniques to time-varying block fading channels.     

Non-full rank space-time trellis codes for serially concatenated system

The feasibility of the non-full rank space-time trellis codes (NFR-STTCs) for the serially concatenated system is described carefully in this letter and a QPSK-based NFR-STTC suitable for the system is proposed. As the simulation results show, over the flat block Rayleigh fading channels, a concatenated system with the proposed NFR-STTC inner code can achieve full diversity, and improve the coding gains compared with other concatenated systems adopting full-rank space-time trellis codes (FR-STTCs) of the same complexity. The introduction of the NFR-STTC to serial concatenation space-time (SCST) system provides a new research community of SCST.     

Turbo Decoding of Super-Orthogonal Space-Time Trellis Codes in Rayleigh Fading Channels

Space-time trellis codes have shown to provide a good performance in Rayleigh fading channels. Recently Super-orthogonal space-time trellis codes have shown to outperform these codes, and also provide a systematic design method to maximize diversity and coding gain in quasi-static Rayleigh fading channels. We investigate the performance of these new codes in rapid Rayleigh fading channels and further propose two concatenated versions of these codes. We further investigate the effect of imperfect channel state information on one of the concatenated versions. Some simulation results of the various concatenated schemes in quasi-static and rapid Rayleigh fading channels are presented. Jayesh N. Pillai received the B.Tech degree in Electrical and Electronic Engineering from the University of Calicut, Kerala, India in 2001. He is currently pursuing an MScEng degree in Electronic Engineering at the School of Electrical, Electronic and Computer Engineering at the University of KwaZulu-Natal, Durban, South Africa. His research interests are in the area of wireless communications, including multiple-antenna systems, space-time coding and channel coding. Stanley Henry Mneney obtained his B.Sc.(Hons) Eng. Degree from the University of Science and Technology, Kumasi in Ghana in 1976. In 1979 he completed his M.A.Sc. from the University of Toronto in Canada. In a Nuffic funded project by the Netherlands government he embarked on a sandwich Ph.D. programme between the Eindhoven Univesity of Technology and the University of Dar es Salaam, the latter awarding the degree in 1988. His co-supervisors were Prof Jens Arnbak and Prof Ramje Prasad representing the two Universities. The research area was on the application satellite technology to provide low cost systems and services to the rural population in the developing countries.Prof Mneney has taught at the Universities of Dar es Salaam, Nairobi, Durban Westville and he is currently an Associate Professor and Deputy Head of School of Electrical, Electronic and Computer Engineering at the University of KwaZulu-Natal in South Africa. His research interest includes Signal and Image processing, radio propagation and communication systems.     

Performance evaluation of superorthogonal turbo codes in AWGN andflat Rayleigh fading channels

Turbo codes are parallel concatenated codes whose performance in the additive white Gaussian noise (AWGN) channel has been shown to be near the theoretical limit. In this paper, we describe a low-rate superorthogonal turbo code that combines the principles of low-rate convolutional coding and that of parallel concatenation. Due to the bandwidth expansion, this code outperforms the ordinary turbo code both in AWGN and especially in fading channels. Thus, superorthogonal turbo codes are suited mainly for spread-spectrum applications. For the purposes of iterative decoding, we concisely describe the connection between the optimal maximum a posteriori symbol estimation and suboptimal soft-output decoding based on sequence estimation. The suboptimal decoder produces outputs that can directly be used as additive metrics at successive decoding iterations, without the need for estimating channel noise variance. Simulation results in AWGN and flat Rayleigh fading channels are also presented, along with analytical upper bounds of bit- and frame-error probabilities     

On the use of repetition coding with binary digital modulations onmobile channels

Repetition, diversity, and single-error-correcting codes are examined for use with binary modulation techniques over a mobile communication fading channel. Both bit-error performance and bandwidth efficiency are considered for phase-shift keyed, differential phase-shift keyed, and frequency-shift keyed modulations. The error-correction capability of repetition coding is considered, and optimum repetition is found. M-tuple diversity with maximum-ratio-combining is then compared with repetition coding both with a single-error-correcting code and without coding. It is found that a minimum of a 10 dB signal-to-noise power ratio is required for an improved performance with repetition code or diversity. The repetition code is about 3 dB inferior to optimal diversity. An optimized design of moderate complexity and bandwidth expansion can be reached with twofold diversity and three repetitions as an inner layer of coding concatenated with an outer single-error-correcting code     

Robust space-time codes for correlated Rayleigh fading channels

Space-time (ST) coding has emerged as an effective strategy to enhance performance of wireless communications in fading environments. Many different ST coding schemes have been proposed to achieve reliable communications in independent fading channels. However, a design of robust ST codes for correlated fading channels has not been addressed. We propose a simple robust ST coding scheme that achieves robust performance over a wide range of fading conditions. The key to achieve robust performance is to formulate code design criteria that are not dependent on the channel correlation statistics. A provably robust scheme can be formulated by concatenating a full-rank ST block code with an outer encoder. We derive several robust code examples via the concatenated orthogonal ST block code and TCM construction. The simulation results show that some traditional ST codes perform poorly, whereas the proposed codes achieve robust performance over a broad range of fading conditions.     

Constructing Space-Time Trellis Codes Using Orthogonal Designs

In this paper we consider the design of space-time trellis codes usingorthogonal designs. We derive a condition on the codewords to obtainthe maximum received signal energy and show that the codes based onorthogonal designs satisfy this condition.We consider in detail the design of a trellis code for two transmitantennas. The new code we develophas a higher diversity in fast fading and a higher coding gain in quasi-static fading when compared to otherexisting space-time codes. We also consider a turbo implementation ofthe new trellis code which results in very high diversity gains infast fading channels.     

Performance analysis on LDPC-Coded systems over quasi-static (MIMO) fading channels

In this paper, we derive closed form upper bounds on the error probability of low-density parity-check (LDPC) coded modulation schemes operating on quasi-static fading channels. The bounds are obtained from the so-called Fano- Gallager?s tight bounding techniques, and can be readily calculated when the distance spectrum of the code is available. In deriving the bounds for multiple-input multiple-output (MIMO) systems, we assume the LDPC code is concatenated with the orthogonal space-time block code as an inner code. We obtain an equivalent single-input single-output (SISO) channel model for this concatenated coded-modulation system. The upper bounds derived here indicate good matches with simulation results of a complete transceiver system over Rayleigh and Rician MIMO fading channels in which the iterative detection and decoding algorithm is employed at the receiver.     

Space-Time-Block-Coded Transmissions for Downlink MC-CDMA Transmissions Over Frequency-Selective Fading Channels

Mitigation of multipath fading effects and suppression of multiuser interference (MUI) constitute major challenges in the design of the third generation wireless mobile systems. Space-time (ST) coding offers a attractive solution to cope with mutipath fading, but most existing ST coding schemes assume flat fading channels that may not be realistic for wide-band communications. Especially multiuser ST block-coded transmissions through multipath fading channels present unique challenge in suppressing not only MUI but also intersymbol/chip interference. In this paper, we design ST multiuser transceivers for MC-CDMA quasi-synchronous systems, capable to reliably transmit over frequency-selective multipath downlink channels. The proposed system is able to provide transmit diversity and to guarantee symbol recovery in multiuser environments, regardless of unknown multipath. Unlike existing approaches, the mobile does not need to know the channel of other users. In addition to decoding simplicity, computer simulations show the performance merits of the proposed transceiver.     

一种新的两用户协作分集方案及其性能研究

该文提出了一种基于信道编码和分布式空时分组码级联下的两用户协作分集方案,并且在准静态的瑞利衰落信道下对此方案的系统容量,中断概率以及误比特率进行了理论推导和系统仿真,分别给出了解析表达式和数值结果。通过将信道编码和空时码引入到协作分集中,系统容量得到显著改善,同时中断概率也明显降低。在协作用户间信道存在噪声的情况下,对卷积码与分布式空时分组码级联下的发射方案进行了性能分析和仿真。仿真结果表明:即使协作用户间的信道存在噪声,该文所提方案在各方面都优于传统协作分集,系统容量明显增大,中断概率及误比特率大大降低。     

基于Turbo-TCM与时空分组码的级联系统的次优译码算法

针对瑞利信道中存在的严重的多径衰落,本文实现了Turbo-TCM方案与时空分组码的级联系统,以期利用空间分集改善系统的误码率性能。针对级联系统的译码,本文给出了一种具有低译码时延的次优译码算法,该算法的特点是各模块独立译码,先算比特对数似然比再进行二进制Turbo码译码。最后通过计算机仿真给出了使用该次优译码算法的Turbo－TCM方案与时空分组码的级联系统的译码性能。仿真结果说明,当发射天线数目一定时,随着接收天线数目的增加,译码性能的增益随之增加而帧长对译码性能的影响则随之减小。     

Reliability and Throughput Analysis of a Concatenated Coding Scheme

In this paper, the performance of a concatenated coding scheme for error control in ARQ systems is analyzed for both randomerror and burst-error channels. In particular, the probability of undetected error and the system throughput are calculated. In this scheme, the inner code is used for both error correction and error detection, and the outer code is used for error detection only. Interleaving/deinterleaving of the outer code is assumed. A retransmission is requested if either the inner code or the outer code detects the Presence of errors. Various coding examples are considered. The results show that concatenated coding can provide extremely high system reliability (i.e., low probability of undetected error) and high system throughput.     

Concatenated Reed-Solomon/convolutional coding for datatransmission in CDMA-based cellular systems

A robust error control scheme for data transmission in CDMA-based cellular systems is proposed which employs outer Reed-Solomon codes concatenated with inner convolutional codes. The performance of this scheme is analyzed assuming nonperiodic random spreading sequences and a Rake receiver with perfect knowledge of the channel. In particular, a simple model for the memoryless inner coding channel that encompasses the effects of multiple access interference, self-noise and thermal noise is first derived. Using new tight upper bounds on bit- and symbol-error probabilities of convolutional codes over Nakagami, Rayleigh, and Rician fading multipath channels, the performance of the concatenated coding scheme is then evaluated. The Reed-Solomon/convolutional coding scheme has been adopted by the European RACE Project Code Division Testbed (CODIT) and implemented in an experimental testbed. The code design methodology, which has been used to specify the 9.6-, 64-, and 128-kbit/s data traffic channels of the CODIT testbed, is presented and the single-cell CDMA capacity is computed     

Serial concatenation of Hermitian codes with ring‐TCM codes

Hermitian codes are a class of very long algebraic‐geometric (AG) codes constructed from Hermitian curves, which outperform Reed–Solomon codes defined over the same finite fields and with the same code rates, as recently demonstrated by the authors. However, since there are no soft‐decision decoding algorithms for AG codes in the literature, the performance of Hermitian codes is limited and their potential is yet to be realized. An alternative method for achieving more significant coding gains is presented in this paper by serially concatenating long Hermitian codes with ring‐trellis‐coded modulation codes over the ring of integers ?₄ and evaluating their performance through simulation results on the AWGN and Rayleigh fading channels. The scheme achieves large coding gains over single Hermitian and Reed–Solomon codes with no increase in bandwidth use and a performance comparable with the well‐known capacity‐approaching codes. Copyright © 2007 John Wiley & Sons, Ltd.     

The Effect of Metric Modification on the Performance of TCM and Concatenated Systems Over Rayleigh Fading Channels

The performance improvement of conventional TCM schemes over frequency nonselective slow Rayleigh fading channels, caused by a slight modification on the metric calculation of the Viterbi decoder, is investigated in this paper. A statistical analysis of the Euclidean distances at the input of the Viterbi decoder is carried out to explain this improvement. Furthermore, the performance improvement of two concatenated coding systems incorporating the above modification, under the same conditions, is studied. The performance of the TCM and the concatenated systems is evaluated by Monte Carlo simulation. The results show that the examined systems, using the proposed modification on the metric calculation, achieve BER performances comparable to other codes and systems, especially designed for fading channels.     

Adaptive rate Zigzag coding in interference channels

In practice, channels in wireless communication systems are time-variable. Because of the variability of the channels in wireless systems and networks, the performance of error-control coding can be improved by adapting the rate of the code to the channel conditions. Thus, the bit-error performance of error-control coding system can be improved. In this study, an adaptive rate error control coding with concatenated Zigzag coding is investigated. The bit-error-rate performance of the adaptive rate Zigzag coding system is evaluated for channels with interference and noise.