A Direct Construction of Optimal ZCCS With Maximum Column Sequence PMEPR Two for MC-CDMA System

Palash Sarkar; Sudhan Majhi

Home/Archive/arXiv

arXiv · 1907.01308

A Direct Construction of Optimal ZCCS With Maximum Column Sequence PMEPR Two for MC-CDMA System

Palash Sarkar·Sudhan Majhi

View original source ↗Read source document ↗Export metadata ↓

Abstract

Multicarrier code-division multiple-access (MC-CDMA) combines an orthogonal frequency division multiplexing (OFDM) modulation and a code-division multiple-access (CDMA) scheme to exploits the benefits of both the technologies. The high peak-to-mean envelope power ratio (PMEPR) is a considerable problem in MC-CDMA system. However, the problem can be addressed by utilizing complete complementary codes (CCCs) in MC-CDMA system. But the set size upper bound of CCC does not allow the system to support large number of users for a given number of subcarriers in the system. In a CCC and Z-complementary code set (ZCCS) based asynchronous MC-CDMA system, the PMEPR is determined by column sequence PMEPR of the codes. In order to support a large number of users with low column sequence PMEPR, in this paper, we have proposed a new optimal ZCCS with larger set size. The code is constructed using Boolean function approach, i.e., by a direct construction method. The number of constituent sequences in ZCCS is the same as the number of subcarriers in MC-CDMA. So, large size ZCCS for large number of users in MC-CDMA can be constructed through a rapid hardware generation. The proposed ZCCS has maximum column sequence PMEPR of 2 and it achieves the theoretical upper bound of optimality. Our proposed construction can also generate inter-group complementary (IGC) code set for MC-CDMA with the same PMEPR. This work also establishes a link from ZCCS and IGC code set to higher-order ($\geq 2$) Reed-Muller (RM) code.

Explore related subjects

cs.IT math.CO math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Palash Sarkar, Sudhan Majhi. 2019-09-19. A Direct Construction of Optimal ZCCS With Maximum Column Sequence PMEPR Two for MC-CDMA System. https://arxiv.org/abs/1907.01308

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗

arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗

arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗