English
Related papers

Related papers: Lattice-Code Multiple Access: Architecture and Eff…

200 papers

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

We propose a two-layer coding architecture for communication of multiple users over a shared slotted medium enabling joint collision resolution and decoding. Each user first encodes its information bits with an outer code for reliability,…

Information Theory · Computer Science 2020-08-18 MohammadReza Ebrahimi , Farshad Lahouti , Victoria Kostina

Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem…

Information Theory · Computer Science 2016-11-17 Yiwei Song , Natasha Devroye , Huai-Rong Shao , Chiu Ngo

Sparse code multiple access (SCMA) is a new frequency domain non-orthogonal multiple-access technique which can improve spectral efficiency of wireless radio access. With SCMA, different incoming data streams are directly mapped to…

Information Theory · Computer Science 2016-11-18 Hosein Nikopour , Eric Yi , Alireza Bayesteh , Kelvin Au , Mark Hawryluck , Hadi Baligh , Jianglei Ma

Sparse code multiple access (SCMA) scheme is considered to be one promising non-orthogonal multiple access technology for the future fifth generation (5G) communications. Due to the sparse nature, message passing algorithm (MPA) has been…

Information Theory · Computer Science 2017-12-06 Xiangming Meng , Yiqun Wu , Yan Chen , Meng Cheng

A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's…

Information Theory · Computer Science 2009-04-14 Tal Philosof , Ram Zamir , Uri Erez , Ashish Khisti

A novel detector for multiple-input multiple-output (MIMO) communications is presented. The algorithm belongs to the class of the lattice detectors, i.e. it finds a reduced complexity solution to the problem of finding the closest vector to…

Information Theory · Computer Science 2007-07-13 Massimiliano Siti , Michael P. Fitz

Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood receiver, and yet with complexity similar to linear receivers.…

Data Structures and Algorithms · Computer Science 2007-07-13 Ying Hung Gan , Cong Ling , Wai Ho Mow

We consider the transmission of spatially correlated analog information in a wireless sensor network (WSN) through fading single-input and multiple-output (SIMO) multiple access channels (MACs) with low-latency requirements. A lattice-based…

Information Theory · Computer Science 2024-01-31 Pedro Suárez-Casal , Óscar Fresnedo , Darian Pérez-Adán , Luis Castedo

Compute-forward multiple access (CFMA) is a transmission strategy which allows the receiver in a multiple access channel (MAC) to first decode linear combinations of the transmitted signals and then solve for individual messages. Compared…

Information Theory · Computer Science 2024-05-10 Lanwei Zhang , Jamie Evans , Jingge Zhu

In this paper, an LSTM-aided hybrid random access scheme (LSTMH-RA) is proposed to support diverse quality of service (QoS) requirements in 6G machine-type communication (MTC) networks, where massive MTC (mMTC) devices and ultra-reliable…

Signal Processing · Electrical Eng. & Systems 2022-08-01 Wenchao Zhai , Huimei Han , Lei Liu , Jun Zhao

Design efficient lattice-based cryptosystem secure against adaptive chosen ciphertext attack (IND-CCA2) is a challenge problem. To the date, full CCA2-security of all proposed lattice-based PKE schemes achieved by using a generic…

Cryptography and Security · Computer Science 2013-03-04 Roohallah Rastaghi

In this paper, we study the coded caching scheme for the $(L, K, M, N)$ multi-user information retrieval (MIR) system, which consists of a content library containing $N$ files, a base station (BS) with $L$ antennas that cannot access the…

Information Theory · Computer Science 2025-01-23 Junyi Wang , Quan Zang , Jinyu Wang , Minquan Cheng

This paper considers a low-complexity iterative Linear Minimum Mean Square Error (LMMSE) multi-user detector for the Multiple-Input and Multiple-Output system with Non-Orthogonal Multiple Access (MIMO-NOMA), where multiple single-antenna…

Information Theory · Computer Science 2019-03-27 Lei Liu , Yuhao Chi , Chau Yuen , Yong Liang Guan , Ying Li

This paper proposes spatial lattice modulation (SLM), a spatial modulation method for multipleinput-multiple-output (MIMO) systems. The key idea of SLM is to jointly exploit spatial, in-phase, and quadrature dimensions to modulate…

Information Theory · Computer Science 2018-05-23 Jiwook Choi , Yunseo Nam , Namyoon Lee

We present a lattice-based scheme for homomorphic evaluation of quantum programs and proofs that remains secure against quantum adversaries. Classical homomorphic encryption is lifted to the quantum setting by replacing composite-order…

Quantum Physics · Physics 2025-05-01 Ben Goertzel

In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with the spectral efficiency. The current state of the art in MIMO…

Information Theory · Computer Science 2007-07-13 Massimiliano Siti , Michael P. Fitz

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 this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic,…

Information Theory · Computer Science 2016-11-17 Zheng Wang , Shuiyin Liu , Cong Ling

This paper conceives a novel sparse code multiple access (SCMA) codebook design which is motivated by the strong need for providing ultra-low decoding complexity and good error performance in downlink Internet-of-things (IoT) networks, in…

Information Theory · Computer Science 2022-09-13 Qu Luo , Zilong Liu , Gaojie Chen , Pei Xiao , Yi Ma , Amine Maaref