16,039 research outputs found
Iterative Multiuser Detection and Decoding with Spatially Coupled Interleaving
Spatially coupled (SC) interleaving is proposed to improve the performance of
iterative multiuser detection and decoding (MUDD) for quasi-static fading
multiple-input multiple-output systems. The linear minimum mean-squared error
(LMMSE) demodulator is used to reduce the complexity and to avoid error
propagation. Furthermore, sliding window MUDD is proposed to circumvent an
increase of the decoding latency due to SC interleaving. Theoretical and
numerical analyses show that SC interleaving can improve the performance of the
iterative LMMSE MUDD for regular low-density parity-check codes.Comment: Long version of a paper submitted to IEEE Wireless Commun. Let
Recommended from our members
Parallel data compression
Data compression schemes remove data redundancy in communicated and stored data and increase the effective capacities of communication and storage devices. Parallel algorithms and implementations for textual data compression are surveyed. Related concepts from parallel computation and information theory are briefly discussed. Static and dynamic methods for codeword construction and transmission on various models of parallel computation are described. Included are parallel methods which boost system speed by coding data concurrently, and approaches which employ multiple compression techniques to improve compression ratios. Theoretical and empirical comparisons are reported and areas for future research are suggested
Fast Convergence and Reduced Complexity Receiver Design for LDS-OFDM System
Low density signature for OFDM (LDS-OFDM) is able to achieve satisfactory performance in overloaded conditions, but the existing LDS-OFDM has the drawback of slow convergence rate for multiuser detection (MUD) and high receiver complexity. To tackle these problems, we propose a serial schedule for the iterative MUD. By doing so, the convergence rate of MUD is accelerated and the detection iterations can be decreased. Furthermore, in order to exploit the similar sparse structure of LDS-OFDM and LDPC code, we utilize LDPC codes for LDS-OFDM system. Simulations show that compared with existing LDS-OFDM, the LDPC code improves the system performance
Performance Analysis of Iteratively Decoded Variable-Length Space-Time Coded Modulation
It is demonstrated that iteratively Decoded Variable Length Space Time Coded Modulation (VL-STCM-ID) schemes are capable of simultaneously providing both coding gain as well as multiplexing and diversity gain. The VL-STCM-ID arrangement is a jointly designed iteratively decoded scheme combining source coding, channel coding, modulation as well as spatial diversity/multiplexing. In this contribution, we analyse the iterative decoding convergence of the VL-STCM-ID scheme using symbol-based three-dimensional EXIT charts. The performance of the VL-STCM-ID scheme is shown to be about 14.6 dB better than that of the Fixed Length STCM (FL-STCM) benchmarker at a source symbol error ratio of 10?4, when communicating over uncorrelated Rayleigh fading channels. The performance of the VL-STCM-ID scheme when communicating over correlated Rayleigh fading channels using imperfect channel state information is also studied
- …