New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes

This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate structured codes with constant column weights 3 and higher. The proposed codes are efficiently encodable and exhibit good structural properties. Experimental results on decoding performance with the sum-product algorithm show that the novel codes offer substantial practical application potential, for instance, in high-speed applications in magnetic recording and optical communications channels.Comment: 10 pages; to appear in "IEEE Transactions on Communications

Sub-graph based joint sparse graph for sparse code multiple access systems

Sparse code multiple access (SCMA) is a promising air interface candidate technique for next generation mobile networks, especially for massive machine type communications (mMTC). In this paper, we design a LDPC coded SCMA detector by combining the sparse graphs of LDPC and SCMA into one joint sparse graph (JSG). In our proposed scheme, SCMA sparse graph (SSG) defined by small size indicator matrix is utilized to construct the JSG, which is termed as sub-graph based joint sparse graph of SCMA (SG-JSG-SCMA). In this paper, we first study the binary-LDPC (B-LDPC) coded SGJSG- SCMA system. To combine the SCMA variable node (SVN) and LDPC variable node (LVN) into one joint variable node (JVN), a non-binary LDPC (NB-LDPC) coded SG-JSG-SCMA is also proposed. Furthermore, to reduce the complexity of NBLDPC coded SG-JSG-SCMA, a joint trellis representation (JTR) is introduced to represent the search space of NB-LDPC coded SG-JSG-SCMA. Based on JTR, a low complexity joint trellis based detection and decoding (JTDD) algorithm is proposed to reduce the computational complexity of NB-LDPC coded SGJSG- SCMA system. According to the simulation results, SG-JSGSCMA brings significant performance improvement compare to the conventional receiver using the disjoint approach, and it can also outperform a Turbo-structured receiver with comparable complexity. Moreover, the joint approach also has advantages in terms of processing latency compare to the Turbo approaches

An Opportunistic Error Correction Layer for OFDM Systems

In this paper, we propose a novel cross layer scheme to lower power\ud consumption of ADCs in OFDM systems, which is based on resolution\ud adaptive ADCs and Fountain codes. The key part in the new proposed\ud system is that the dynamic range of ADCs can be reduced by\ud discarding the packets which are transmitted over 'bad' sub\ud carriers. Correspondingly, the power consumption in ADCs can be\ud reduced. Also, the new system does not process all the packets but\ud only processes surviving packets. This new error correction layer\ud does not require perfect channel knowledge, so it can be used in a\ud realistic system where the channel is estimated. With this new\ud approach, more than 70% of the energy consumption in the ADC can be\ud saved compared with the conventional IEEE 802.11a WLAN system under\ud the same channel conditions and throughput. The ADC in a receiver\ud can consume up to 50% of the total baseband energy. Moreover, to\ud reduce the overhead of Fountain codes, we apply message passing and\ud Gaussian elimination in the decoder. In this way, the overhead is\ud 3% for a small block size (i.e. 500 packets). Using both methods\ud results in an efficient system with low delay