AMP Dual-Turbo Iterative Detection and Decoding for LDPC Coded Multibeam MSC Uplink

The uplink of mobile satellite communication(MSC) system with hundreds of spot beams is essentially a multiple-input multiple-output(MIMO) channel. Dual-turbo iterative detection and decoding as a kind of MIMO receiver, which exchanges soft extrinsic information between a soft-in soft-out(SISO) detector and an SISO decoder in an iterative fashion, is an efficient method to reduce the uplink inter-beam-interference(IBI),and so the receiving bit error rate(BER).We propose to replace the linear SISO detector of traditional dual-turbo iterative detection and decoding with the AMP detector for the low-density parity-check(LDPC) coded multibeam MSC uplink. This improvement can reduce the computational complexity and achieve much lower BER.

Iterative Detection and Decoding Algorithm in Dual Polarized Land Mobile Satellite MIMO Systems

An iterative detection and decoding algorithm with outer code decision feedback is proposed for the dual polarized( DP) land mobile satellite( LMS) MIMO systems using concatenated codes. A feedback structure is added after the outer decoder in the proposed algorithm. The feedback information is exploited to control the detecting list in the MIMO detector and reduce the number of symbols which have to be processed at each iteration. As a result,the computational complexity is reduced. Meanwhile,the successfully decoded outer code words are used to calculate the more reliable initial information for the inner decoder and the system performance can be improved by this step. The simulation results show that the proposed algorithm can reduce the computational complexity compared to the traditional iterative detection and decoding algorithm and achieve better performance.

基于信道短化和圆球译码的水声通信迭代序列检测

The demand for high-data-rate underwater acoustic communications(UACs)in marine development is increasing;however,severe multipaths make demodulation a challenge.The decision feedback equalizer(DFE)is one of the most popular equalizers in UAC;however,it is not the optimal algorithm.Although maximum likelihood sequence estimation(MLSE)is the optimal algorithm,its complexity increases exponentially with the number of channel taps,making it challenging to apply to UAC.Therefore,this paper proposes a complexity-reduced MLSE to improve the bit error rate(BER)performance in multipath channels.In the proposed algorithm,the original channel is first shortened using a channel-shortening method,and several dominant channel taps are selected for MLSE.Subsequently,sphere decoding(SD)is performed in the following MLSE.Iterations are applied to eliminate inter-symbol interference caused by weak channel taps.The simulation and sea experiment demonstrate the superiority of the proposed algorithm.The simulation results show that channel shortening combined with SD can drastically reduce computational complexity,and iterative SD performs better than DFE based on recursive least squares(RLS-DFE),DFE based on improved proportionate normalized least mean squares(IPNLMS-DFE),and channel estimation-based DFE(CE-DFE).Moreover,the sea experimental results at Zhairuoshan Island in Zhoushan show that the proposed receiver scheme has improved BER performance over RLSDFE,IPNLMS-DFE,and CE-DFE.Compared with the RLS-DFE,the BER,after five iterations,is reduced from 0.0076 to 0.0037 in the 8–12 k Hz band and from 0.1516 to 0.1145 in the 13–17 k Hz band at a distance of 2000 m.Thus,the proposed algorithm makes it possible to apply MLSE in UAC in practical scenarios.

NOVEL DECODING OF SQUARE QAM MODULATED MIMO SYSTEMS BASED ON TURBO MULTIUSER DETECTION

By introducing the bit-level multi-stream coded Layered Space-Time （LST） transmitter along with a novel iterative MultiStage Decoding （MSD） at the receiver, the paper shows how to achieve the near-capacity performance of the Multiple-Input Multiple-Output （MIMO） systems with square Quadrature Amplitude Modulation （QAM）. In the proposed iterative MSD scheme, the detection at each stage is equivalent to multiuser detection of synchronous Code Division Multiple Access （CDMA） multiuser systems with the aid of the binary representation of the transmitted symbols. Therefore, the optimal Soft-Input Soft-Output （SISO） multiuser detection and low-complexity SISO multiuser detection can be utilized herein. And the proposed scheme with low-complexity SISO multiuser detection has polynomial complexity in the number of transmit antennas M, the number of receive antennas N, and the number of bits per constellation point Me. Simulation results demonstrate that the proposed scheme has similar Bit Error Rate （BER） performance to that of the known Iterative Tree Search （ITS） detection.

A NEW RECURSIVE ALGORITHM FOR MULTIUSER DETECTION

Based on the synthesis and analysis of recursive receivers, a new algorithm, namely partial grouping maximization likelihood algorithm, is proposed to achieve satisfactory performance with moderate computational complexity.During the analysis, some interesting properties shared by the proposed procedures are described.Finally, the performance assessment shows that the new scheme is superior to the linear detector and ordinary grouping algorithm, and achieves a bit-error rate close to that of the optimum receiver.

Complexity Iterative Receiver for Turbo-BLAST over Frequency Selective Fading Channels

The computationally efficient iterative receiver is investigated for Turbo-BLAST （Bell Labs layered space time） system over frequency selective fading channels. Compared with the conventional receiver based on soft interference cancellation（SIC）, an iterative detection scheme based on bit-level cancellation is presented to reduce the complexity of the receiver by decomposing of an M-QAM constellation into a linear Combination of binary constellations. Simulation results demonstrate that compared with the conventional SIC scheme, the proposed scheme based on bit-level cancellation performs almost as well as the SIC scheme after several iterations while proving a lot of saving in computational complexity.

Improved iterative convergence method in Q-ary LDPC coded high order PR-CPM

The Q-ary low-density parity-check（LDPC） coded high order partial response continuous phase modulation（PR-CPM） with double iterative loops is investigated. This scheme shows significant improvements in power and bandwidth efficiency, but at the expense of long iterative decoding delay and computational complexity induced by the improper match between the demodulator and the decoder. To address this issue, the convergence behavior of Q-ary LDPC coded CPM is investigated for the Q=2 and Q〉2 cases, and an optimized design method based on the extrinsic information transfer chart is proposed to improve the systematic iterative efficiency. Simulation results demonstrate that the proposed method can achieve a perfect tradeoff between iterative decoding delay and bit error rate performance to satisfy real-time applications.

Improved List Sphere Decoder for Multiple Antenna Systems

An improved list sphere decoder （ILSD） is proposed based on the conventional list sphere decoder （LSD） and the reduced- complexity maximum likelihood sphere-decoding algorithm. Unlike the conventional LSD with fixed initial radius, the ILSD adopts an adaptive radius to accelerate the list cdnstruction. Characterized by low-complexity and radius-insensitivity, the proposed algorithm makes iterative joint detection and decoding more realizable in multiple-antenna systems. Simulation results show that computational savings of ILSD over LSD are more apparent with more transmit antennas or larger constellations, and with no performance degradation. Because the complexity of the ILSD algorithm almost keeps invariant with the increasing of initial radius, the BER performance can be improved by selecting a sufficiently large radius.

A Survey on Low Complexity Detectors for OTFS Systems

The newly emerging orthogonal time frequency space(OTFS)modulation can ob⁃tain delay-Doppler diversity gain to significantly improve the system performance in high mobility wireless communication scenarios such as vehicle-to-everything(V2X),high-speed railway and unmanned aerial vehicles(UAV),by employing inverse symplectic finite Fouri⁃er transform(ISFFT)and symplectic finite Fourier transform(SFFT).However,OTFS modu⁃lation will dramatically increase system complexity,especially at the receiver side.Thus,de⁃signing low complexity OTFS receiver is a key issue for OTFS modulation to be adopted by new-generation wireless communication systems.In this paper,we review low complexity OTFS detectors and provide some insights on future researches.We firstly present the OTFS system model and basic principles,followed by an overview of OTFS detector structures,classifications and comparative discussion.We also survey the principles of OTFS detection algorithms.Furthermore,we discuss the design of hybrid OTFS and orthogonal frequency di⁃vision multiplexing(OFDM)detectors in single user and multi-user multi-waveform commu⁃nication systems.Finally,we address the main challenges in designing low complexity OT⁃FS detectors and identify some future research directions.

Iterative multiuser detection for high spectral efficiency reverse-link of multibeam satellite via expectation propagation

Multibeam satellite communications employing full frequency reuse have the potential to increase spectral efficiency.However,they suffer from severe inter-beam interference.An expectation propagation based message passing algorithm is proposed for decoding multi-user transmissions in the reverse link of multi-beam satellite communications with full frequency reuse.Compared with an iterative MMSE(Minimum Mean Square Error)interference cancellation algorithm,the proposed algorithm reduces the cubic complexity to square complexity in the number of interfering beams.Numerical results show that the proposed algorithm outperforms the iterative MMSE algorithm slightly in terms of bit error rate when the energy per bit to noise power spectral density ratio is low.The performance of both algorithms is the same for other cases.

Threshold-based piecewise companding transform for PAPR reduction in OFDM systems

Piecewise companding transform is a flexible and efficient way to solve the high peak-to-average power ratio （PAPR） problem for orthogonal frequency division multiplexing （OFDM） systems. A novel threshold-based piecewise companding transform is proposed in this paper. Based on the statistical characteristics of amplitudes, OFDM signals are classified into three groups （i.e., small, average and large signals）. Different from conventional approaches, two dedicated designed thresholds are set to amplify the small signals and compress the large signals, respectively. Simulation results verify the improvement in PAPR reduction of the proposed scheme. Moreover, a lower bit error rate （BER） performance loss can be obtained by introducing the iterative detection with a moderate increase in complexity.

Block Markov superposition transmission with pulse position modulation over free-space optical links

In FSO(Free-Space Optical)communications,performance of the communication systems is severely degraded by atmospheric turbulence.PPM(Pulse Position Modulation)is widely used in FSO communication systems owing to its high power efficiency.In this paper,we present a combination of the BMST(Block Markov Superposition Transmission)technique and the PPM scheme to improve the reliability of the transmission over FSO links.Based on analyzing an equivalent system,a lower bound on the bit-error-rate of the proposed scheme is presented.Extensive simulations are performed which show that the BMST-PPM system performs well under a wide range of turbulence conditions and improves the performance of the basic code.Simulation results also show that,the performance of the system with the sliding-window detection/decoding algorithm matches well with the lower bound in the low-error-rate region.