In this paper, a Look-Up-Table (LUT) based calculation for implementing log-likelihood ratio (LLR) of the Maximum a Posterior (map) decoder is introduced and analysed. In the region of low signal to noise ratio, the a...
详细信息
In this paper, a Look-Up-Table (LUT) based calculation for implementing log-likelihood ratio (LLR) of the Maximum a Posterior (map) decoder is introduced and analysed. In the region of low signal to noise ratio, the analysed performances of turbo coding have been found very satisfying. However, when implementing the map turbo decoder, the required calculation for LLR is too complex prohibiting its applications. In order to reduce the complexity a dynamic-LUT based simplification is proposed whereas a static-LUT never converge the expectations, since the limited size and resolution of LUT dramatically degrade the performance. In order to maintain simplicity for a high performance implementation, a dynamic LUT, which has partial resolutions in separate decision regions and being re-calculated for further iterations of decoding, is proposed. One of the most important results obtained is that our proposed dynamic-LUT based map algorithm removes "ln(center dot)" process, which is the natural logarithm in LLR's calculation. Therefore, it reduces high computational complexity in the map algorithm with some reasonable performance degradations.
作者:
Görtz, NUniv Kiel
Fac Engn Inst Circuits & Syst Theory Kiel Germany
Joint source-channel decoding is formulated as an estimation problem. The optimal solution is stated and it is shown that it is not feasible in many practical systems due to its complexity. Therefore, a novel iterativ...
详细信息
Joint source-channel decoding is formulated as an estimation problem. The optimal solution is stated and it is shown that it is not feasible in many practical systems due to its complexity. Therefore, a novel iterative procedure for the approximation of the optimal solution is introduced, which is based on the principle of iterative decoding of turbo codes. New analytical expressions for different types of information in the optimal algorithm are used to derive the iterative approximation. A direct comparison of the performances of the optimal algorithm and its iterative approximation is given for a simple transmission system with "short" channel codewords. Furthermore, the performance of iterative joint source-channel decoding is investigated for a more realistic system.
Memory accesses take a large part of the power consumption in the iterative decoding of double-binary convolutional turbo code (DB-CTC). To deal with this, a low-memory intensive decoding architecture is proposed for ...
详细信息
Memory accesses take a large part of the power consumption in the iterative decoding of double-binary convolutional turbo code (DB-CTC). To deal with this, a low-memory intensive decoding architecture is proposed for DB-CTC in this paper. The new scheme is based on an improved maximum a posteriori probability algorithm, where instead of storing all of the state metrics, only a part of these state metrics is stored in the state metrics cache (SMC), and the memory size of the SMC is thus reduced by 25%. Owing to a compare-select{recalculate processing (CSRP) module in the proposed decoding architecture, the unstored state metrics are recalculated by simple operations, while maintaining near optimal decoding performance.
The concatenation of an equalizer and a Viterbi decoder is a powerful means for improving receiver performance in wireless communication systems. A soft-output equalizer increases the impact of this combination by ena...
详细信息
The concatenation of an equalizer and a Viterbi decoder is a powerful means for improving receiver performance in wireless communication systems. A soft-output equalizer increases the impact of this combination by enabling the use of. soft-decision Viterbi decoding, It is well known that the maximum a posteriori (map) algorithm provides optimal reliability information, but at the cost of substantial complexity. This paper contains the results of an investigation into the design and performance of soft-output adaptive equalization techniques based on suboptimum trellis-based soft-output decoding algorithms. It is shown that the performance improvement relative to hard output equalizers is substantial, while the cost in terms of complexity is modest. A time-division multiple-access (TDMA) cellular system is used as the basis for comparisons. Simulation results and a complexity analysis are presented.
The deployment of non-binary pulse amplitude modulation (PAM) and soft decision (SD)-forward error correction (FEC) in future intensity-modulation (IM)/direct-detection (DD) links is inevitable. However, high-speed IM...
详细信息
The deployment of non-binary pulse amplitude modulation (PAM) and soft decision (SD)-forward error correction (FEC) in future intensity-modulation (IM)/direct-detection (DD) links is inevitable. However, high-speed IM/DD links suffer from inter-symbol interference (ISI) due to bandwidth-limited hardware. Traditional approaches to mitigate the effects of ISI are filters and trellis-based algorithms targeting symbol-wise maximum a posteriori (map) detection. The former approach includes decision-feedback equalizer (DFE), and the latter includes Max-Log-map (MLM) and soft-output Viterbi algorithm (SOVA). Although DFE is easy to implement, it introduces error propagation (EP). Such burst errors distort the log-likelihood ratios (LLRs) required by SD-FEC, causing performance degradation. On the other hand, MLM and SOVA provide near-optimum performance, but their complexity is very high for high-order PAM. In this article, we consider a one-tap partial response channel model, which is relevant for high-speed IM/DD links. We propose to combine DFE with either MLM or SOVA in a low-complexity architecture. The key idea is to allow MLM or SOVA to detect only 3 typical DFE symbol errors, and use the detected error information to generate LLRs in a modified demapper. The proposed structure enables a tradeoff between complexity and performance: i) the complexity of MLM or SOVA is reduced and ii) the decoding penalty due to EP is mitigated. Compared to SOVA detection, the proposed scheme can achieve a significant complexity reduction of up to 94% for PAM-8 transmission. Simulation and experimental results show that the resulting SNR loss is roughly $0.3\!\sim\! 0.4$ dB for PAM-4, and becomes marginal 0.18 dB for PAM-8.
Most of the restrictions in indoor environments do not exist for outdoor sites. The main limitations for indoors are the attenuation of walls and the multipath fading effects. The signal propagation is limited by the ...
详细信息
Most of the restrictions in indoor environments do not exist for outdoor sites. The main limitations for indoors are the attenuation of walls and the multipath fading effects. The signal propagation is limited by the standard free space path loss in outdoor environments or free space. The loss in free space is usually equal to the range squared whereas the loss exponent for indoors is more like the 4th power. This study investigates the performance of turbo codes with modified Maximum-A-Posteriori (map) decoding algorithm for Bluetooth data packets in indoor environments over the frequency selective Rayleigh fading channels;which are also called as indoor wireless communication channels. In order to reduce the computational complexity of turbo decoders, map algorithm is modified in this study. Bit error rate (BER) versus energy of bit-to-noise ratio (E (b) /N (o) ) of modified map algorithms for Bluetooth data packets at 2.4 GHz industrial-scientific-medical (ISM) band are evaluated by means of computer simulations. Thus, modified logarithmic likelihood ratio (LLR) method can significantly reduce the computational complexity of the map algorithm. Furthermore, the performances of different types of forward error correction (FEC) coding for Bluetooth data packets are compared in the study.
Low-density parity-check (LDPC) codes and convolutional Turbo codes are two of the most powerful error correcting codes that are widely used in modern communication systems. In a multi-mode baseband receiver, both LDP...
详细信息
Low-density parity-check (LDPC) codes and convolutional Turbo codes are two of the most powerful error correcting codes that are widely used in modern communication systems. In a multi-mode baseband receiver, both LDPC and Turbo decoders may be required. However, the different decoding approaches for LDPC and Turbo codes usually lead to different hardware architectures. In this paper we propose a unified message passing algorithm for LDPC and Turbo codes and introduce a flexible soft-input soft-output (SISO) module to handle LDPC/Turbo decoding. We employ the trellis-based maximum a posteriori (map) algorithm as a bridge between LDPC and Turbo codes decoding. We view the LDPC code as a concatenation of n super-codes where each super-code has a simpler trellis structure so that the map algorithm can be easily applied to it. We propose a flexible functional unit (FFU) for map processing of LDPC and Turbo codes with a low hardware overhead (about 15% area and timing overhead). Based on the FFU, we propose an area-efficient flexible SISO decoder architecture to support LDPC/Turbo codes decoding. Multiple such SISO modules can be embedded into a parallel decoder for higher decoding throughput. As a case study, a flexible LDPC/Turbo decoder has been synthesized on a TSMC 90 nm CMOS technology with a core area of 3.2 mm(2). The decoder can support IEEE 802.16e LDPC codes, IEEE 802.11n LDPC codes, and 3GPP LTE Turbo codes. Running at 500 MHz clock frequency, the decoder can sustain up to 600 Mbps LDPC decoding or 450 Mbps Turbo decoding.
In this paper, we consider the applicability of turbo code for future third generation (3G) mobile telecommunication systems. Futhermore, we propose a simple method of estimating the channel variance which is necessar...
详细信息
In this paper, we consider the applicability of turbo code for future third generation (3G) mobile telecommunication systems. Futhermore, we propose a simple method of estimating the channel variance which is necessary for the map (Maximum A Posteriori) decoding algorithm. We compare the performance of turbo code with a known channel variance, conventional variance estimate and variance estimated by our proposed technique. We show that our variance estimation scheme is adequate for 3G WB-CDMA mobile systems without degradation of turbo code performance.
For binary codes, Fossorier et al. have shown that the soft-output Viterbi algorithm (SOVA) becomes equivalent to the Max-Log-maximum a posteriori (map) algorithm after a modification. In this letter, we generalize su...
详细信息
For binary codes, Fossorier et al. have shown that the soft-output Viterbi algorithm (SOVA) becomes equivalent to the Max-Log-maximum a posteriori (map) algorithm after a modification. In this letter, we generalize such modified SOVA to nonbinary cases, motivated by the fact that the performance gap between the original SOVA and the Max-Log-map algorithm broadens in these cases. The equivalence between the two algorithms is proved in a more compact form. The modified SOVA requires only add-compare-select operations and is well suited for high-speed parallel implementation.
This paper presents a novel approach to a soft-output equalizer, which makes a symbol-by-symbol soft-decision based on a posteriori probabilities (APP's) criterion in the presence of intersymbol interference. The ...
详细信息
This paper presents a novel approach to a soft-output equalizer, which makes a symbol-by-symbol soft-decision based on a posteriori probabilities (APP's) criterion in the presence of intersymbol interference. The authors propose a soft-output Viterbi equalizer (SOVE) employing expanded memory length in a trellis of the Viterbi algorithm with small arithmetic complexity. The proposed equalizer gives suboptimum soft-decision closer to that of a equalizer with the maximum a posteriori probabilities (map) algorithm than the conventional SOVE.
暂无评论