Low Correlation Sequences over the QAM Constellation
M. Anand, P. Vijay Kumar
Abstract
This paper presents the first concerted look at low correlation sequence families over QAM constellations of size M2=4m and their potential applicability as spreading sequences in a CDMA setting. Five constructions are presented, and it is shown how such sequence families have the ability to transport a larger amount of data as well as enable variable-rate signalling on the reverse link. Canonical family CQ has period N, normalized maximum-correlation parameter thetamax bounded above by A sqrt(N), where 'A' ranges from 1.8 in the 16-QAM case to 3.0 for large M. In a CDMA setting, each user is enabled to transfer 2m bits of data per period of the spreading sequence which can be increased to 3m bits of data by halving the size of the sequence family. The technique used to construct CQ is easily extended to produce larger sequence families and an example is provided. Selected family SQ has a lower value of thetamax but permits only (m+1)-bit data modulation. The interleaved 16-QAM sequence family IQ has thetamax <= sqrt(2) sqrt(N) and supports 3-bit data modulation. The remaining two families are over a quadrature-PAM (Q-PAM) subset of size 2M of the M2-QAM constellation. Family P has a lower value of thetamax in comparison with Family SQ, while still permitting (m+1)-bit data modulation. Interleaved family IP, over the 8-ary Q-PAM constellation, permits 3-bit data modulation and interestingly, achieves the Welch lower bound on thetamax.
Create a lesson
Related papers
An Approach to Asynchronous Unsourced Random Access
Alireza Karami, Dmitry Trukhachev
Local Private Information Retrieval for Graph-Based Replicated Systems
Shreya Meel, Mohamed Nomeir, Sennur Ulukus
Semantic Freshness Optimal Sampling and Transmission for Gossiping Receivers
Irtiza Hasan, Ahmed Arafa
Minimax bounds for watermarked and masked recursive discrete distribution estimation
Millen Kanabar, Michael Gastpar
Fast Fault-Tolerant Decoders for Hypergraph Product and Lifted-Product Codes
Asit Kumar Pradhan, Nithin Raveendran, David Declercq et al.
Asymptotic Bounds on Generalized Covering Radii of Binary Primitive BCH Codes
Maosheng Xiong, Chi Hoi Yip, Ferdinando Zullo