English
Related papers

Related papers: A Low Complexity Detection Algorithm for SCMA

200 papers

Code Division Multiple Access (CDMA) in which the spreading code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particular attractive as it…

Disordered Systems and Neural Networks · Physics 2015-05-13 Jack Raymond , David Saad

Data detection in massive multi-user (MU) multiple-input multiple-output (MIMO) wireless systems is among the most critical tasks due to the excessively high implementation complexity. In this paper, we propose a novel, equalization-based…

Information Theory · Computer Science 2016-11-29 Michael Wu , Chris Dick , Joseph R. Cavallaro , Christoph Studer

In this letter, a novel variation of sparse code multiple access (SCMA), called codeword position index based SCMA (CPI-SCMA), is proposed. In this scheme, the information is transmitted not only by the codewords in M point SCMA codebook,…

Signal Processing · Electrical Eng. & Systems 2018-11-12 Ke Lai , Lei Wen , Jing Lei , Gaojie Chen , Pei Xiao , Amine Maaref

In this paper, we propose a reduced-complexity optimal modified sphere decoding (MSD) detection scheme for SCMA. As SCMA systems are characterized by a number of resource elements (REs) that are less than the number of the supported users,…

Information Theory · Computer Science 2017-08-30 Monirosharieh Vameghestahbanati , Ebrahim Bedeer , Ian Marsland , Ramy H. Gohary , Halim Yanikomeroglu

Massive machine type communication (mMTC) is one of the basic components of the future fifth generation (5G) wireless communication system. In mMTC, the information processing at the sensor nodes is required to be simple, low power…

Signal Processing · Electrical Eng. & Systems 2018-10-01 Mehmood Alam , Qi Zhang

Sparse Code Multiple Access (SCMA) and Blind Interference Alignment (BIA) are key enablers for multi-user communication, yet each suffers from distinct limitations: SCMA faces high complexity and limited multiplexing gain, while BIA…

Information Theory · Computer Science 2026-03-05 Jianjian Wu , Chi-Tsun Cheng , Qingfeng Zhou , Jianlin Liang , Jinke Wu

In this paper, we present a low-complexity recursive approach for massive and scalable code-domain nonorthogonal multiple access (NOMA) with applications to emerging low-capacity scenarios. The problem definition in this paper is inspired…

Information Theory · Computer Science 2021-03-12 Mohammad Vahid Jamali , Hessam Mahdavifar

This paper studies randomly spread code-division multiple access (CDMA) and multiuser detection in the large-system limit using the replica method developed in statistical physics. Arbitrary input distributions and flat fading are…

Information Theory · Computer Science 2007-07-13 Dongning Guo , Sergio Verdu

This paper addresses the four enabling technologies, namely multi-user sparse code multiple access (SCMA), content caching, energy harvesting, and physical layer security for proposing an energy and spectral efficient resource allocation…

Information Theory · Computer Science 2018-08-15 Mohammad R. Abedi , Nader Mokari , Mohammad R. Javan , Eduard. A. Jorswieck

In this paper, pattern division multiple access with large-scale antenna array (LSA-PDMA) is proposed as a novel non-orthogonal multiple access (NOMA) scheme. In the proposed scheme, pattern is designed in both beam domain and power domain…

Information Theory · Computer Science 2017-03-22 Peng Li , Yanxiang Jiang , Shaoli Kang , Fuchun Zheng , Xiaohu You

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

We consider online change detection of high dimensional data streams with sparse changes, where only a subset of data streams can be observed at each sensing time point due to limited sensing capacities. On the one hand, the detection…

Machine Learning · Statistics 2020-09-23 Jie Guo , Hao Yan , Chen Zhang , Steven Hoi

In this paper, we present an efficient algorithm to sample random sparse matrices to be used as check matrices for quantum Low-Density Parity-Check (LDPC) codes. To ease the treatment, we mainly describe our algorithm as a technique to…

Information Theory · Computer Science 2026-01-27 Paolo Santini

The label propagation algorithm (LPA) has been proved to be a fast and effective method for detecting communities in large complex networks. However, its performance is subject to the non-stable and trivial solutions of the problem. In this…

Physics and Society · Physics 2016-12-15 Jihui Han , Wei Li , Zhu Su , Longfeng Zhao , Weibing Deng

Processing long contexts has become a critical capability for modern large language models (LLMs). However, serving long-context LLMs comes with significant inference costs due to the high memory overhead of the key-value (KV) cache.…

Machine Learning · Computer Science 2025-03-04 Qihui Zhou , Peiqi Yin , Pengfei Zuo , James Cheng

The joint transmission scheme of polar codes and sparse code multiple access (SCMA) has been regarded as a promising technology for future wireless communication systems. However, most of the existing polar-coded SCMA (PC-SCMA) systems…

Information Theory · Computer Science 2022-04-01 Shufeng Li , Mingyu Cai , Libiao Jin , Yao Sun , Hongda Wu , Ping Wang

In object detection, post-processing methods like Non-maximum Suppression (NMS) are widely used. NMS can substantially reduce the number of false positive detections but may still keep some detections with low objectness scores. In order to…

Computer Vision and Pattern Recognition · Computer Science 2023-04-04 Angzhi Fan , Benjamin Ticknor , Yali Amit

This paper considers the discrete convexity of a cross-layer on-off transmission control problem in wireless communications. In this system, a scheduler decides whether or not to transmit in order to optimize the long-term quality of…

Information Theory · Computer Science 2015-08-26 Ni Ding , Parastoo Sadeghi , Rodney A. Kennedy

Kudekar et al. proved that the belief-propagation (BP) performance for low-density parity check (LDPC) codes can be boosted up to the maximum-a-posteriori (MAP) performance by spatial coupling. In this paper, spatial coupling is applied to…

Information Theory · Computer Science 2016-11-18 Keigo Takeuchi , Toshiyuki Tanaka , Tsutomu Kawabata

Spatial modulation (SM) is a promising multiple-input multiple-output system used to increase spectral efficiency. The maximum likelihood (ML) decoder jointly detects the transmitted SM symbol, which is of high complexity. In this paper, a…

Information Theory · Computer Science 2020-06-11 Ibrahim Al-Nahhal , Octavia A. Dobre , Salama Ikki
‹ Prev 1 3 4 5 6 7 10 Next ›