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.

Joint Multi-User Detection with Weighting Factors for Unsourced Multiple Access

Multi-user detection techniques are currently being studied as highly promising technologies for improving the performance of unsourced multiple access systems. In this paper, we propose joint multi-user detection schemes with weighting factors for unsourced multiple access. First, we introduce bidirectional weighting factors in the extrinsic information passing process between the multi-user detector based on belief propagation (BP) and the LDPC decoder. Second, we incorporate bidirectional weighting factors in the message passing process between the MAC nodes and the user variable nodes in BP- based multi-user detector. The proposed schemes select the optimal weighting factors through simulations. The simulation results demonstrate that the proposed schemes exhibit significant performance improvements in terms of block error rate (BLER) compared to traditional schemes. .

Complex field network-coded cooperation based on multi-user detection in wireless networks

Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC） scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation（CC） scheme and network-coded cooperation（NCC） scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability（SEP） performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio（SNR） values.

Wavelet Packet Domain LMS Based Multi-User Detection

An improved wavelet packet domain least mean square （IWPD-LMS） based adaptive muhiuser detection algorithm is proposed. The algorithm employs the wavelet packet transform to rewhiten the input data, and chooses the best wavelet packet basis according to a novel convergence contribution function rather than the conventional Shannon entropy. The theoretic analyses show that the inadequacy of the eigenvalue spread of the tap-input correlation matrix is ameliorated, thus the convergence performance is improved greatly. The simulation result of convergence performance and bit error rate（BER） performance as a function of the signal power to noise power ratio（SNR） are presented finally to prove the validity of the proposed algorithm.

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.

Low-Complexity Detection and Decoding Scheme for LDPC-Coded MLC NAND Flash Memory

With the development of manufacture technology, the multi-level cell(MLC)technique dramatically increases the storage density of NAND flash memory. As the result,cell-to-cell interference(CCI) becomes more serious and hence causes an increase in the raw bit error rate of data stored in the cells.Recently, low-density parity-check(LDPC)codes have appeared to be a promising solution to combat the interference of MLC NAND flash memory. However, the decoding complexity of the sum-product algorithm(SPA) is extremely high. In this paper, to improve the accuracy of the log likelihood ratio(LLR) information of each bit in each NAND flash memory cell, we adopt a non-uniform detection(N-UD) which uses the average maximum mutual information to determine the value of the soft-decision reference voltages.Furthermore, with an aim to reduce the decoding complexity and improve the decoding performance, we propose a modified soft reliabilitybased iterative majority-logic decoding(MSRBI-MLGD) algorithm, which uses a non-uniform quantizer based on power function to decode LDPC codes. Simulation results show that our design can offer a desirable trade-off between the performance and complexity for high-column-weight LDPC-coded MLC NAND flash memory.

RLS and LMS blind adaptive multi-user detection method and comparison in acoustic communication

RLS and LMS blind adaptive multi-user detection algorithm and multi-user detector was proposed to solve the problem of multi-user signal detection problem encountered in underwater acoustic communication networks.In simulation analysis,RLS and the LMS blind adaptive multi-user detector were designed and tested for synchronous and asynchronous multi-user communication process.The results of SIR comparison and MMSE comparison show that,both of the two methods can realize blind adaptive detection when any user change in multi-user communication,during this process,the training communication sequences are not needed.The RLS algorithm has about 5 dB higher in SIR compared with LMS algorithm,and the convergence velocity of RLS algorithm is also higher than LMS algorithm when the communication users change.RLS algorithm has better ability in multi-user detection than that of LMS algorithm,and it has great attraction and guiding significance for solving the problem of multiple access interference(MAI) in multi-user communication.

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.

Study of multi-rate multi-user detection based on supervision decision

Multi-user detection (MUD) based on multirate transmission in code division multiple access (CDMA) system is discussed. Under the requirement of signal interference ratio (SIR) detection at base station and framework with parallel interference cancellation, a supervision decision algorithm based on pre-decision of probabilistic data association (PDA) and hard decision is proposed. The detection performance is analyzed and simulation is implemented to show that the supervision decision algorithm improves the detection performance effectively.

Iterative Detection and Decoding with PIC Algorithm for MIMO-OFDM Systems

In this paper, we propose a new iterative detection and decoding scheme based on parallel interference cancel (PIC) for coded MIMO-OFDM systems. The performance of proposed receiver is improved through the joint PIC MIMO detection and iterative detection and decoding. Its performance is evaluated based on com-puter simulation. The simulation results indicate that the performance of the proposed receiver is greatly im-proved compared to coded MIMO-OFDM systems based on VBLAST detection scheme.

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.

Dynamic K-Best Sphere Decoding Algorithms for MIMO Detection

Multiple Input Multiple Output (MIMO) technology is of great significance in high data rate wireless communication. The K-Best Sphere Decoding (K-Best SD) algorithm was proposed as a powerful method for MIMO detection that can approach near-optimal performance. However, some extra computational complexity is contained in K-Best SD. In this paper, we propose an improved K-Best SD to reduce the complexity of conventional K-Best SD by assigning K for each level dynamically following some rules. Simulation proves that the performance degradation of the improved K-Best SD is very little and the complexity is significantly reduced.

ROLS-AWS algorithm used in RBF neural network for multi-user detection

To improve the computational speed, the ROLS-AWS algorithm was employed in the RBF based MUD receiver. The radial basis function was introduced into the multi-user detection （MUD） firstly. Then a three-layer neural network demodulation spread-spectrum signal model in the synchronous Gauss channel was given and the multi-user detection receiver was analyzed intensively. Simulations by computer illustrate that the proposed RBF based MUD receiver employing the ROKS-AWS algorithm is better than conventional detectors and common BP neural network based MUD receivers on suppressing multiple access interference and near-far resistance.

A New Approach to Multi-user Detection in DS-CDMA

A graph model is constructed for the Multi-user Detection of DS-CDMA system. Based on it, a Hopfield-like algorithm is put forward for the implementation of optimum receiver. Compared with the Hopfield approach, it has a higher computational complexity but better performance.

A Turbo Decoder Included in a Multi-User Detector: A Solution to be Retained

This paper deals with the presentation of different multi-user detectors in the Universal Mobile Telecommunications System (UMTS) context. The challenge is always to optimize the compromise between performance and complexity. Compared with the solution commonly used today, the rake detector, successive interference cancellation (SIC) detector has better performance despite its higher complexity. Our innovative solution proposes joining detector and channel turbo decoder to get a significant gain in terms of performance. Furthermore, when detection and decoding are implemented in a single function, complexity does not increase much.

Joint Channel and Multi-User Detection Empowered with Machine Learning

The numbers of multimedia applications and their users increase with each passing day.Different multi-carrier systems have been developed along with varying techniques of space-time coding to address the demand of the future generation of network systems.In this article,a fuzzy logic empowered adaptive backpropagation neural network(FLeABPNN)algorithm is proposed for joint channel and multi-user detection(CMD).FLeABPNN has two stages.The first stage estimates the channel parameters,and the second performsmulti-user detection.The proposed approach capitalizes on a neuro-fuzzy hybrid systemthat combines the competencies of both fuzzy logic and neural networks.This study analyzes the results of using FLeABPNN based on a multiple-input andmultiple-output(MIMO)receiver with conventional partial oppositemutant particle swarmoptimization(POMPSO),total-OMPSO(TOMPSO),fuzzy logic empowered POMPSO(FL-POMPSO),and FL-TOMPSO-based MIMO receivers.The FLeABPNN-based receiver renders better results than other techniques in terms of minimum mean square error,minimum mean channel error,and bit error rate.

Dynamic multi-user detection scheme based on CVA-SSAOMP algorithm in uplink grant-free NOMA

In the uplink grant-free non-orthogonal multiple access(NOMA)scenario,since the active user at the sender has a structured sparsity transmission characteristic,the compressive sensing recovery algorithm is initially applied to the joint detection of the active user and the transmitted data.However,the existing compressed sensing recovery algorithms with unknown sparsity often require noise power or signal-to-noise ratio(SNR)as the priori conditions,which greatly reduces the algorithm adaptability in multi-user detection.Therefore,an algorithm based on cross validation aided structured sparsity adaptive orthogonal matching pursuit(CVA-SSAOMP)is proposed to realize multi-user detection in dynamic change communication scenario of channel state information(CSI).The proposed algorithm transforms the structured sparsity model into a block sparse model,and without the priori conditions above,the cross validation method in the field of statistics and machine learning is used to adaptively estimate the sparsity of active user through the residual update of cross validation.The simulation results show that,compared with the traditional orthogonal matching pursuit(OMP)algorithm,subspace pursuit(SP)algorithm and cross validation aided block sparsity adaptive subspace pursuit(CVA-BSASP)algorithm,the proposed algorithm can effectively improve the accurate estimation of the sparsity of active user and the performance of system bit error ratio(BER),and has the advantage of low-complexity.

Quantum Multi-User Detection Based on Coherent State Signals

Multi-user detection is one of the important technical problems for moderncommunications. In the field of quantum communication, the multi-access channel onwhich we apply the technology of quantum information processing is still an openquestion. In this work, we investigate the multi-user detection problem based on thebinary coherent-state signals whose communication way is supposed to be seen as aquantum channel. A binary phase shift keying model of this multi-access channel isstudied and a novel method of quantum detection proposed according to the conclusionof the quantum measurement theory. As a result, the average interference betweendeferent users is presented and the average error probability of the quantum detection isderived theoretically. Finally, we show the maximum channel capacity of this effectivedetection for a two-access quantum channel.

Low complexity iterative differential decoding algorithm for multiband UWB communication systems

Due to not requiring channel state information （CSI） at both the transmitter and the receiver, noncoherent ultra-wideband （UWB） incurs a performance penalty of approximately 3 dB in the required signal to noise ratio （SNR） compared to the coherent case. To overcome the gap, an effective differential encoding and decoding scheme for multiband UWB systems is proposed. The proposed scheme employs the parallel concatenation of two recursive differential unitary space-frequency encoders at the transmitter. At the receiver, two component decoders iteratively decode information bits by interchanging soft metric values between each other. To reduce the computation complexity, a decoding algorithm which only uses transition probability to calculate the log likelihood ratios （LLRs） for the decoded bits is given. Simulation results show that the proposed scheme can dramatically outperform the conventional differential and even coherent detection at high SNR with a few iterations.

Novel K-best detection algorithms for MIMO system

Aiming at the optimum path excluding characteristics and the full constellation searching characteristics of the K-best detection algorithm, an improved-performance K-best detection algorithm and several reduced-complexity K-best detection algorithms are proposed. The improved-performance K-best detection algorithm deploys minimum mean square error （MMSE） filtering of a channel matrix before QR decomposition. This algorithm can decrease the probability of excluding the optimum path and achieve better performance. The reducedcomplexity K-best detection algorithms utilize a sphere decoding method to reduce searching constellation points. Simulation results show that the improved performance K-best detection algorithm obtains a 1 dB performance gain compared to the K- best detection algorithm based on sorted QR decomposition （SQRD）. Performance loss occurs when K = 4 in reduced complexity K-best detection algorithms. When K = 8, the reduced complexity K-best detection algorithms require less computational effort compared with traditional K-best detection algorithms and achieve the same performance.