A reordered first fit algorithm based novel storage scheme for parallel turbo decoder

In this paper we discuss a novel storage scheme for simultaneous memory access in parallel turbo decoder. The new scheme employs vertex coloring in graph theory. Compared to a similar method that also uses unnatural order in storage, our scheme requires 25 more memory blocks but allows a simpler configuration for variable sizes of code lengths that can be implemented on-chip. Experiment shows that for a moderate to high decoding throughput （40-100 Mbps）, the hardware cost is still affordable for 3GPP＇s （3rd generation partnership project） interleaver.

Interference cancellation scheme for uplink cognitive radio systems

This paper investigates the interference cancellation （IC） scheme for uplink cognitive radio systems, using the spectrum underlay strategy where the primary users （PUs） and the secondary users （SUs） coexist and operate in the same spectrum. Joint MMSE-based parallel interference cancellation （PIC） and Turbo decoding scheme is proposed to reduce the interference to the PUs, as well as to the SUs, in which the minimum mean square estimation （MMSE） filter is only employed in the first iteration, regarded as the ＂weakest link＂ of the whole detection process, to improve the quality of the preliminary detections results before they are fed to the Turbo decoder. Simulation results show that the proposed scheme can efficiently eliminate the interference to the PUs, as well as to the SUs.

An iterative ITI cancellation method for multi-head multi-track bit-patterned magnetic recording systems

Bit-Pattemed Magnetic Recording(BPMR)is one of the emerging data storage technologies,which promises an Areal Density(AD)of about 4 Tb/in2.However,a major problem practically encountered in a BPMR system is Inter-Track Interference(ITI)that can deteriorate the overall system performance,especially at high ADs.This paper proposes an iterative ITI cancellation method for an m-head m-track BPMR system,which uses m heads to read m adjacent tracks and decodes them simultaneously.To cancel the ITI,we subtract the weighted readback signals of adjacent tracks,acting as the ITI signals,from the readback signal of the target track,before passing the refined readback signal to a turbo decoder.Then,the decoded data will be employed to reconstruct the ITI signal for the next turbo iteration.Experimental results indicate that the proposed system performs better than the conventional system that uses one head to read one data track.Furthermore,we also find out that the proposed system is more robust to media noise and track misregistration than the conventional system.

Reduced-Complexity Turbo Equalization for Turbo Coded MIMO/OFDM Systems

This paper derives a low-complexity turbo equalization algorithm for turbo coded multiple input multiple output/ orthogonal frequency division multiplexing systems. This algorithm consists of soft-output decision-feedback equalization with a probabilistic data association algorithm and a soft-input soft-output turbo channel decoder using iterative operations. In each iteration, extrinsic information extracted from the probabilistic data association algorithm detector and from the channel decoder is used as the prior information for the next iteration to realize iterative channel equalization and channel decoding, Our simulation results show that the algorithm improves the signal noise ratio around 1 dB with bit error rate reaching 10 -6 when the Eb/ N0 - 4 dB compared to minimum mean square error and match filter, and can greatly reduce the intersymbol interference at a low overall complexity of O（ N^3） after 2 iterations.

LTE turbo decoder design

This paper presents a turbo decoder supporting all 188 block sizes in 3GPP long term evolution （LTE） standard which can be employed in the LTE micro-eNodB system. The design allows 1, 2, 4, 8 or 16 soft-in/softout （SISO） decoders to concurrently process each block size, and the number of iterations can be adjusted. By adding a register in core structure add-compare-select-add, this article proposes an improved SISO algorithm and interleaving design, calculated forward state matrix and backward state matrix alternately, and the branch transition probability can be used in the Turbo decode process directly just after one clock delay. The structure enables a decoder processing radix-2 algorithm with high speed, instead of radix-4 as the conventional decoder. Moreover, the paper details an interleaver/de-interleaver, which is combined by two operational steps. One is column address mapping and the other is intra-row permutation. Decoder realizes interleaving by loading data from memories whose address is generated by column mapping and then lets data passing through inter-row permutation. For de-interleaving, the system can adopt reverse operation.

Iterative multi-user detection and decoding for space-time block coding systems

To restrain the interference of co-channel users using space-time block coding （STBC）, the proposed Gaussian-forcing soft decision multi-user detection （GFSDMUD） algorithm is applied in fiat-fading channels by using the relation among the users＇ signals, which can enhance the capacity by introducing co-channel users. During iterations, extrinsic information is calculated and exchanged between a soft multi-user detector and a bank of turbo decoders to achieve refined estimates of the users＇ signals. The simulations show that the proposed iterative receiver techniques provide significant performance improvement around 2 dB over conventional noniterative methods. Furthermore, iterative multi-user space-time processing techniques offer substantial performance gains around 8 dB by adding the number of receiver antennas from 4 to 6, and the system performance can be enhanced by using this strategy in multi-user STBC systems, which is very important for enlarging the system capacity.