Iterative Detection of Unity-Rate Precoded FFH-MFSK and Irregular Variable-Length Coding
https://doi.org/10.1109/TVT.2009.2013989…
6 pages
Sign up for access to the world's latest research
Abstract
—Iterative decoding of an irregular variable-length coding (IrVLC) scheme concatenated with precoded fast frequency-hopping (FFH) M-ary frequency-shift keying (MFSK) is considered. We employ EXtrinsic Information Transfer (EXIT) charts to investigate the three-stage concatenation of the FFH-MFSK demodulator, the rate-1 decoder, and the outer IrVLC decoder. The proposed joint source and channel coding scheme is capable of operating at low signal-to-noise ratios (SNRs) in Rayleigh fading channels contaminated by partial-band noise jamming (PBNJ). The IrVLC scheme is composed of a number of component variable-length coding (VLC) codebooks employing different coding rates that encode particular fractions of the input source symbol stream. These fractions may be chosen with the aid of EXIT charts to shape the inverted EXIT curve of the IrVLC codec so that it can be matched with the EXIT curve of the inner decoder. We demonstrate that using the proposed scheme, an infinitesimally low bit error ratio (BER) may be achieved at low SNR values. Index Terms—FEC, irregular channel coding, iterative detection of fast frequency-hopping (FFH) M-ary frequency-shift keying (MFSK), turbo-detection, unity-rate coding, variable-length coding (VLC).
Related papers
2015
Unary Error Correction (UEC) codes constitute a recently proposed Joint Source and Channel Code (JSCC) family, conceived for alphabets having an infinite cardinality, whilst out-performing previously used Separate Source and Channel Codes (SSCCs). UEC based schemes rely on an iterative decoding process, which involves three decoding blocks when concatenated with a turbo code. Owing to this, following the activation of one of the three blocks, the next block to be activated must be chosen from the other two decoding block options. Furthermore, the UEC decoder offers a number of decoding options, allowing its complexity and error correction capability to be dynamically adjusted. It has been shown that iterative decoding convergence can be expedited by activating the specific decoding option that offers the highest Mutual Information (MI) improvement to computational complexity ratio. This paper introduces an iterative demodulator, which is shown to improve the associated error correction performance, while reducing the overall iterative decoding complexity. The challenge is that the iterative demodulator has to forward its soft-information to the other two iterative decoding blocks, and hence the corresponding MI improvements cannot be compared on a like-for-like basis. Additionally, we also propose a method of eliminating the logarithmic calculations from the adaptive iterative decoding algorithm, hence further reducing its implementational complexity without impacting its error correcting performance.
2005
A new linear block precoding technique is combined with error-correction coding for wireless orthogonal frequenc ydivision multiplexing (OFDM) transmissions through frequency-selective fading channels. Our precoder is based on the maximization of the mean cutoff rate and requires only the knowledge of the average relative channel multipath gains and delays at the transmitter. Convolutional cod ing is used as an outer channel coding (CC). Two decoding schemes are developed for the proposed joint channel-coded and linearly-precoded OFDM communication system. The first decoding scheme consists of the cascade of maximum likelihood (ML) symbol detector and Viterbi decoder. The ML detector decodes the symbols encoded by the linear precoder, and the Viterbi decoder decodes the convolutional channel codes. The second decoding scheme is based on the iterative (turbo) decoding approach, which exploits the so ft information and enables to further improve the decoding performance. Simulation re...
VTC Spring 2009 - IEEE 69th Vehicular Technology Conference
In this contribution we propose the novel serial concatenation of Irregular Variable Length Coding (IrVLC) and Irregular Unity Rate Coding (IrURC), where we matched the corresponding EXtrinsic Information Transfer (EXIT) functions to each other. This approach facilitates a higher degree of design freedom than matching the EXIT function of an irregular codec to that of a regular codec. As a result, a narrow EXIT chart tunnel can be created, facilitating operation at E b /N0 values that are closer to the channel's capacity bound. The computational complexity and Bit Error Ratio (BER) performance of our IrVLC-IrURC scheme is favourable in comparison to the bench markers that replace either one or both of the irregular codecs by the equivalent-rate regular codec.
Ieee Transactions on Communications, 2005
Several recent publications have shown that joint source-channel decoding could be a powerful technique to take advantage of residual source redundancy for fixed-and variable-length source codes. This letter gives an in-depth analysis of a low-complexity method recently proposed by Guivarch et al., where the redundancy left by a Huffman encoder is used at a bit level in the channel decoder to improve its performance. Several simulation results are presented, showing for two first-order Markov sources of different sizes that using a priori knowledge of the source statistics yields a significant improvement, either with a Viterbi channel decoder or with a turbo decoder. Index Terms-Convolutional codes (CCs), joint source-channel coding, turbo codes (TCs), variable-length codes (VLCs).
IEEE Transactions on Wireless Communications, 2000
We present a novel symbol-based soft-input a posteriori probability (APP) decoder for packetized variable-length encoded source indexes transmitted over wireless channels where the residual redundancy after source encoding is exploited for error protection. In combination with a mean-square or maximum APP estimation of the reconstructed source data, the whole decoding process is close to optimal. Furthermore, solutions for the proposed APP decoder with reduced complexity are discussed and compared to the near-optimal solution. When, in addition, channel codes are employed for protecting the variable-length encoded data, an iterative source-channel decoder can be obtained in the same way as for serially concatenated codes, where the proposed APP source decoder then represents one of the two constituent decoders. The simulation results show that this iterative decoding technique leads to substantial error protection for variable-length encoded correlated source signals, especially, when they are transmitted over highly corrupted channels.
IEEE Transactions on Wireless Communications, 2000
American Journal of Applied Sciences, 2005
Code Division Multiple Access (CDMA) performs well in a multi-cellular environment where a single frequency is used in all cells. Code Division Multiple Access (CDMA) has severe problems associated with multipath and Channel news. One possible problem is that the receiver may require a very large dynamic range in order to handle the large signal strength variation among users. Due to that the Bit Error Rate (BER) is getting increased. Moreover due to the addition of uncontrollable random channel noise degrade the performance of the receiver. The multipath problems give inter symbol interference. This can be reduced by Orthogonal Frequency Division Multiplexing (OFDM) technique. More work could be done on investigating suitable techniques for doing OFDM promises to be a suitable modulation technique for high capacity wireless communications and will become increasing important in the future as wireless networks become more relied on. In order to increase the wireless network performance, this study has concentrated on OFDM with a novel forward error correction by data transmission with Quadrature Phase Shift Keying (QPSK) as modulation techniques. Here an FEC scheme by concatenation of Reed Solomon (RS) and the Irregular Turbo code is implemented in OFDM. The simulation results show that the system BER performance is decreased with this technique, when compared to the system having Forward Error Correction (FEC) by RS code alone and irregular turbo code alone.
EURASIP Journal on Advances in Signal Processing, 2005
Multimedia transmission over time-varying wireless channels presents a number of challenges beyond existing capabilities conceived so far for third-generation networks. Efficient quality-of-service (QoS) provisioning for multimedia on these channels may in particular require a loosening and a rethinking of the layer separation principle. In that context, joint source-channel decoding (JSCD) strategies have gained attention as viable alternatives to separate decoding of source and channel codes. A statistical framework based on hidden Markov models (HMMs) capturing dependencies between the source and channel coding components sets the foundation for optimal design of techniques of joint decoding of source and channel codes. The problem has been largely addressed in the research community, by considering both fixed-length codes (FLC) and variable-length source codes (VLC) widely used in compression standards. Joint source-channel decoding of VLC raises specific difficulties due to the fact that the segmentation of the received bitstream into source symbols is random. This paper makes a survey of recent theoretical and practical advances in the area of JSCD with soft information of VLC-encoded sources. It first describes the main paths followed for designing efficient estimators for VLC-encoded sources, the key component of the JSCD iterative structure. It then presents the main issues involved in the application of the turbo principle to JSCD of VLC-encoded sources as well as the main approaches to source-controlled channel decoding. This survey terminates by performance illustrations with real image and video decoding systems.
IEEE Communications Letters, 2000
We show that several coding schemes, in particular turbo encoding, dramatically improve the performance of a noncoherently detected frequency shift-keying modulation with correlated signals.The proposed a posteriori probability (APP) decoder based on bit-by-bit decisions proves to be highly flexible and more efficient than a classical block decisions decoding scheme. Moreover, the choice of the FSK modulation tone spacing is important. Simulation results show that the turbo-coded FSK exhibits the lowest error probability when compared to TCM, convolutional and lattice encoding schemes. I. INTRODUCTION F REQUENCY shift-keying (FSK) modulation with orthog- onal signals is commonly used on noncoherent channels and exhibits an excellent robustness [1]. However, it suffers from its poor spectral efficiency. With a modulation tone spacing chosen smaller than , being the symbol period, the transmitted signals are correlated and the spectral efficiency increases. The price to pay for this bandwidth reduction is a degradation in the noncoherent detector performance.It can be shown that several coding schemes dramatically reduce this performance degradation. We describe two system models. The decoder of the first model makes classical block decisions from the signal correlations delivered by the matched filter bank. In the second model, the FSK noncoherent detector computes APP's for each coded bit, directly related to these correlation values. The decoder operates on these APP's, considered as channel observations, to make bit-by-bit decisions. Note that the second model is valid for all coding schemes: simple block or convolutional codes, parallel or serial concatenated (turbo) codes [2] and classical trellis-coded modulations (TCM) . Computer simulation results show that the turbo-coded scheme yields better results than either TCM, convolutional or lattice encoded schemes. As expected high latency coding schemes perform better than low latency schemes. Consider a -ary frequency shift-keying modulation with tone spacing and symbol period respectively denoted by and .
IEEE Transactions on Vehicular Technology, 2010
This paper develops a family of irregular convolutional codes for bit-interleaved coded modulation (BICM) systems under iterative detection and decoding. Irregular convolutional codes are constructed through irregular puncturing over multiple mother codes of different memory. Strategies based on fixed-and variable-size trellises are proposed to connect different memory mother codes. The use of irregular puncturing and code memory yields improved coding efficiency with the aid of extrinsic information transfer charts. Under ergodic and quasi-static fading conditions, multiantenna BICM systems using the proposed codes outperform comparable turbo-coded systems and multilevel coding strategies.
References (19)
- K. C. Teh, A. C. Kot, and K. H. Li, "FFT-based clipper receiver for fast frequency-hopping spread-spectrum system," in Proc. IEEE Symp. Circuits Syst., May/Jun. 1998, vol. 4, pp. 305-308.
- X. F. Wu, C. M. Zhao, X. H. You, and S. Q. Li, "Robust diversity-combing receivers for LDPC coded FFH-SS with partial-band interference," IEEE Commun. Lett., vol. 11, no. 7, pp. 613-615, Jul. 2007.
- P. C. P. Liang and W. E. Stark, "Algorithm for joint decoding of turbo codes and M -ary orthogonal modulation," in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2000, p. 191.
- K. Cheun and W. E. Stark, "Performance of robust metrics with convo- lutional coding and diversity in FHSS systems under partial-band noise jamming," IEEE Trans. Commun., vol. 41, no. 1, pp. 200-209, Jan. 1993.
- M. C. Valenti and S. Cheng, "Iterative demodulation and decoding of turbo-coded M -ary noncoherent orthogonal modulation," IEEE J. Sel. Areas Commun., vol. 23, no. 9, pp. 1739-1747, Sep. 2005.
- Q. Zhang and T. Le-Ngoc, "Turbo product codes for FH-SS with partial- band interference," IEEE Trans. Wireless Commun., vol. 1, no. 3, pp. 513- 520, Jul. 2002.
- U. C. Fiebig, "Soft-decision and erasure decoding in fast frequency- hopping systems with convolutional, turbo, and Reed-Solomon codes," IEEE Trans. Commun., vol. 47, no. 11, pp. 1646-1654, Nov. 1999.
- D. Park and B. G. Lee, "Iterative decoding in convolutionally and turbo coded MFSK/FH-SSMA systems," in Proc. IEEE ICC, Jun. 2001, vol. 9, pp. 2784-2788.
- M. Tüchler and J. Hagenauer, "EXIT charts of irregular codes," in Proc. Conf. Inf. Sci. Syst., Princeton, NJ, Mar. 2002, pp. 748-753.
- S. ten Brink, "Convergence of iterative decoding," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
- R. Y. S. Tee, S. X. Ng, and L. Hanzo, "Precoder-aided iterative detection assisted multilevel coding and three-dimensional EXIT-chart analysis," in Proc. IEEE WCNC, Apr. 2006, vol. 3, pp. 1322-1326.
- R. G. Maunder, J. Wang, S. X. Ng, L.-L. Yang, and L. Hanzo, "Iteratively decoded irregular variable length coding and trellis coded modulation," in Proc. IEEE Workshop Signal Process. Syst., Shanghai, China, Oct. 2007, pp. 222-227.
- V. Buttigieg and P. G. Farrell, "Variable-length error-correcting codes," Proc. Inst. Elect. Eng.-Commun., vol. 147, no. 4, pp. 211-215, Aug. 2000.
- R. Bauer and J. Hagenauer, "Iterative source/channel-decoding using reversible variable length codes," in Proc. Data Compression Conf., Snowbird, UT, 2000, pp. 93-102.
- S. Ahmed, R. G. Maunder, L. L. Yang, S. X. Ng, and L. Hanzo, "Joint source coding, unity rate precoding and FFH-MFSK modulation using iteratively decoded irregular variable length coding," in Proc. 66th IEEE VTC-Fall, Sep./Oct. 2007, pp. 1042-1046.
- S. Lloyd, "Least squares quantization in PCM," IEEE Trans. Inf. Theory, vol. IT-28, no. 2, pp. 129-137, Mar. 1982.
- J. G. Proakis, Digital Communications. Singapore: McGraw-Hill, 2001.
- V. B. Balakirsky, "Joint source-channel coding with variable length codes," in Proc. IEEE Int. Symp. Inf. Theory, Ulm, Germany, Jun. 1997, p. 419.
- J. Wang, S. X. Ng, A. Wolfgang, L.-L. Yang, S. Chen, and L. Hanzo, "Near-capacity three-stage MMSE turbo equalization using irregular con- volutional codes," in Proc. Int. Symp. Turbo Codes, Munich, Germany, Apr. 2006. Electronic publication.
Sohail Ahmed