English
Related papers

Related papers: Errorless Codes for Over-loaded CDMA with Active U…

200 papers

In this paper we introduce a new class of codes for over-loaded synchronous wireless and optical CDMA systems which increases the number of users for fixed number of chips without introducing any errors. Equivalently, the chip rate can be…

Information Theory · Computer Science 2008-10-18 P. Pad , F. Marvasti , K. Alishahi , S. Akbari

Recently, a new class of binary codes for overloaded CDMA systems are proposed that not only has the ability of errorless communication but also suitable for detecting active users. These codes are called COWDA [1]. In [1], a Maximum…

Information Theory · Computer Science 2010-01-26 Ali Mousavi , Pedram Pad , Farokh Marvasti

We study the Gaussian multiple access channel with random user activity, in the regime where the number of users is proportional to the code length. The receiver may know some statistics about the number of active users, but does not know…

Information Theory · Computer Science 2025-10-21 Xiaoqi Liu , Pablo Pascual Cobo , Ramji Venkataramanan

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the…

Information Theory · Computer Science 2019-02-27 Michel Kulhandjian , Hovannes Kulhandjian , Claude D'Amours , Halim Yanikomeroglu , Gurgen Khachatrian

In this paper, we explore the mystery of synchronous CDMA as applied to wireless and optical communication systems under very general settings for the user symbols and the signature matrix entries. The channel is modeled with real/complex…

Information Theory · Computer Science 2015-03-17 K. Alishahi , S. Dashmiz , P. Pad , F. Marvasti , M. H. Shafinia , M. Mansouri

In CDMA systems, the received user powers vary due to moving distance of users. Thus, the CDMA receivers consist of two stages. The first stage is the power estimator and the second one is a Multi-User Detector (MUD). Conventional methods…

Information Theory · Computer Science 2015-03-19 Damoun Nashtaali , Omid Mashayekhi , Pedram Pad , Seyed Reza Moghadasi , Farokh Marvasti

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

In this paper, a new detection algorithm is proposed for turbo coded Code Division Multiple Access (CDMA) signals in detect and forward cooperative channels. Use of user cooperation makes much improvement in the performance of CDMA systems.…

Signal Processing · Electrical Eng. & Systems 2018-03-13 Ebrahim Karami

In this paper, we study binary and ternary matrices that are used for CDMA applications that are injective on binary or ternary user vectors. In other words, in the absence of additive noise, the interference of overloaded CDMA can be…

Information Theory · Computer Science 2009-01-15 Sh. Dashmiz , P. Pad , F. Marvasti

Sparse Code Multiple Access (SCMA) is a disruptive code-domain non-orthogonal multiple access (NOMA) scheme to enable \color{black}future massive machine-type communication networks. As an evolved variant of code division multiple access…

Signal Processing · Electrical Eng. & Systems 2022-05-17 Saumya Chaturvedi , Zilong Liu , Vivek Ashok Bohara , Anand Srivastava , Pei Xiao

In this paper, we consider the problem of recursively designing uniquely decodable ternary code sets for highly overloaded synchronous code-division multiple-access (CDMA) systems. The proposed code set achieves larger number of users $K <…

Information Theory · Computer Science 2019-02-27 Michel Kulhandjian , Claude D'Amours , Hovannes Kulhandjian

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

In this work, we consider the problem of detecting the presence of a new user in a direct-sequence/code-division-multiple-access (DS/CDMA) system with a doubly-dispersive fading channel, and we propose a novel blind detection strategy which…

Information Theory · Computer Science 2010-02-17 Stefano Buzzi , Luca Venturino , Alessio Zappone , Antonio De Maio

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

We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals Kamax is the…

Signal Processing · Electrical Eng. & Systems 2022-05-11 Michel Kulhandjian , Claude D'Amours , Hovannes Kulhandjian , Halim Yanikomeroglu , Dimitris A. Pados , Gurgen Khachatrian

Balancing efficiency of bandwidth use and complexity of detection involves choosing a suitable load for a multi-access channel. In the case of synchronous CDMA, with random codes, it is possible to demonstrate the existence of a threshold…

Information Theory · Computer Science 2009-05-22 Jack Raymond

This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…

Information Theory · Computer Science 2023-07-04 Alexander Fengler , Alejandro Lancho , Yury Polyanskiy

Sparse Code Multiple Access (SCMA) is an enabling code-domain non-orthogonal multiple access (NOMA)scheme for massive connectivity and ultra low-latency in future machine-type communication networks. As an evolved variant of code division…

Information Theory · Computer Science 2021-05-17 Saumya Chaturvedi , Zilong Liu , Vivek Ashok Bohara , Anand Srivastava , Pei Xiao

Reliable communication is a challenge in a very noisy RF channel further corrupted by severe, multiple narrowband interference. Code Division Multiple Access (CDMA) is a widely used method to both mitigate such interference and support…

Information Theory · Computer Science 2014-10-20 Dave Clites , Richard Orr , Jack Rieser , Michael Dellomo

In most existing grant-free (GF) studies, the two key tasks, namely active user detection (AUD) and payload data decoding, are handled separately. In this paper, a two-step dataaided AUD scheme is proposed, namely the initial AUD step and…

Information Theory · Computer Science 2022-07-27 Linjie Yang , Pingzhi Fan , Des McLernon , Li X Zhang
‹ Prev 1 2 3 10 Next ›