English
Related papers

Related papers: A New Decoding Scheme for Errorless Codes for Over…

200 papers

Grant-free random access and uplink non-orthogonal multiple access (NOMA) have been introduced to reduce transmission latency and signaling overhead in massive machine-type communication (mMTC). In this paper, we propose two novel…

Information Theory · Computer Science 2023-03-01 Thushan Sivalingam , Samad Ali , Nurul Huda Mahmood , Nandana Rajatheva , Matti Latva-Aho

Code Division Multiple Access (CDMA) is the most promising candidate for wideband data access. This is due to the advantage of soft limit on the number of active mobile devices. Many wireless mesh systems impose an upper bound on the BER…

Information Theory · Computer Science 2012-12-12 Muhammad Zeeshan , Shoab A Khan , Muhammad Yasir Malik

The cyclically equivariant neural decoder was recently proposed in [Chen-Ye, International Conference on Machine Learning, 2021] to decode cyclic codes. In the same paper, a list decoding procedure was also introduced for two widely used…

Information Theory · Computer Science 2021-06-16 Xiangyu Chen , Min Ye

A joint sparse-regression-code (SPARC) and low-density-parity-check (LDPC) coding scheme for multiple-input multiple-output (MIMO) massive unsourced random access (URA) is proposed in this paper. Different from the state-of-the-art…

Information Theory · Computer Science 2022-01-12 Tianya Li , Yongpeng Wu , Mengfan Zheng , Dongming Wang , Wenjun Zhang

Since Tse and Verdu proved that the global maximum likelihood (GML) detector achieves unit asymptotic multiuser efficiency (AME) in the limit of large random spreading (LRS) CDMA, no suboptimal detector has been found to achieve unit AME.…

Information Theory · Computer Science 2007-11-27 Yi Sun

Novel sparse regression LDPC (SR-LDPC) codes exhibit excellent performance over additive white Gaussian noise (AWGN) channels in part due to their natural provision of shaping gains. Though SR-LDPC-like codes have been considered within the…

Information Theory · Computer Science 2024-02-13 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

OCDMA systems can support multiple classes of service by differentiating code parameters, power level and diversity order. In this paper, we analyze BER performance of a multi-class 1D/2D OCDMA system and propose a new approximation method…

Information Theory · Computer Science 2017-06-28 Mohammad Hadi , Mohammad Reza Pakravan

We consider communication over the Gaussian multiple-access channel in the regime where the number of users grows linearly with the codelength. In this regime, schemes based on sparse superposition coding can achieve a near-optimal tradeoff…

Information Theory · Computer Science 2025-06-04 Xiaoqi Liu , Kuan Hsieh , Ramji Venkataramanan

Sparse code multiple access (SCMA), as a codebook-based non-orthogonal multiple access (NOMA) technique, has received research attention in recent years. The codebook design problem for SCMA has also been studied to some extent since…

Information Theory · Computer Science 2022-05-03 Chinwei Huang , Borching Su , Tingyi Lin , Yenming Huang

Massive machine-type communications (mMTC) in 6G requires supporting a massive number of devices with limited resources, posing challenges in efficient random access. Grant-free random access and uplink non-orthogonal multiple access (NOMA)…

Information Theory · Computer Science 2023-06-01 Thushan Sivalingam , Samad Ali , Nurul Huda Mahmood , Nandana Rajatheva , Matti Latva Aho

The effect of different spreading codes in DWT based MC-CDMA wireless communication system is investigated. In this paper, we present the Bit Error Rate (BER) performance of different spreading codes (Walsh-Hadamard code, Orthogonal gold…

Information Theory · Computer Science 2012-07-18 Saleh Masum , M. Hasnat Kabir , Md. Matiqul Islam , Rifat Ara Shams , Shaikh Enayet Ullah

In this paper, we propose a physical-layer rateless code for wireless channels. A novel rateless encoding scheme is developed to overcome the high error floor problem caused by the low-density generator matrix (LDGM)-like encoding scheme in…

Information Theory · Computer Science 2013-06-25 Shuang Tian , Yonghui Li , Mahyar Shirvanimoghaddam , Branka Vucetic

Large multiple-input multiple-output (MIMO) appears in massive multi-user MIMO and randomly-spread code-division multiple access (CDMA)-based wireless systems. In order to cope with the excessively high complexity of optimal data detection…

Information Theory · Computer Science 2018-11-06 Charles Jeon , Ramina Ghods , Arian Maleki , Christoph Studer

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid…

Information Theory · Computer Science 2007-07-13 M. Twitto , I. Sason , S. Shamai

Sparse code multiple access (SCMA) is a new multiple access technique which supports massive connectivity. Compared with the current Long Term Evolution (LTE) system, it enables the overloading of active users on limited orthogonal…

Information Theory · Computer Science 2016-11-29 Chenchen Zhang , Yuan Luo , Yan Chen

Reed-Muller codes are studied for peak power control in multicarrier code-division multiple access (MC-CDMA) communication systems. In a coded MC-CDMA system, the information data multiplexed from users is encoded by a Reed-Muller subcode…

Information Theory · Computer Science 2010-10-04 Nam Yul Yu

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

High quality data is essential in deep learning to train a robust model. While in other fields data is sparse and costly to collect, in error decoding it is free to query and label thus allowing potential data exploitation. Utilizing this…

Information Theory · Computer Science 2019-11-22 Ishay Be'ery , Nir Raviv , Tomer Raviv , Yair Be'ery

Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-check (LDPC) codes is provided and the resulting bound can be…

Information Theory · Computer Science 2007-07-13 Chih-Chun Wang , Sanjeev R. Kulkarni , H. Vincent Poor

Sparse code multiple access (SCMA) has been one of non-orthogonal multiple access (NOMA) schemes aiming to support high spectral efficiency and ubiquitous access requirements for 5G wireless communication networks. Conventional SCMA…

Signal Processing · Electrical Eng. & Systems 2019-06-20 Jinzhi Lin , Shengzhong Feng , Zhile Yang , Yun Zhang , Yong Zhang