Table of Contents
Fetching ...

A Construction of Type-II ZCCS for the MC-CDMA System with Low PMEPR

Rajen Kumar, Sushant Kumar Jha, Prashant Kumar Srivastava, Sudhan Majhi

TL;DR

This work introduces a type-II ZCCS construction with arbitrary sequence lengths by taking the Kronecker product of a $(K,K,N)$-CCC with $r$ mutually orthogonal uni-modular sequences of length $P$, yielding a type-II $(rK,K,NP-P+1,NP)$-ZCCS. Barker sequences and unimodular scaling are leveraged to reduce column PMEPR, achieving an upper bound below $2$, and enabling new lengths for type-II ZCPs and ZCS with improved PMEPR relative to existing type-II constructions. The framework is applied to a QS MC-CDMA uplink system, where the ZCCS properties suppress MPI/MAI within the ZCZ, and simulations indicate superior BER performance and greater delay tolerance compared to type-I ZCCS. The paper also places the construction in context with existing type-II ZCPs and type-I versus type-II ZCCS, highlighting broader code counts, larger ZCZ widths, and practical advantages for multiuser, quasi-synchronous environments. Overall, the approach extends ZCCS design to longer, more flexible code sets with favorable PMEPR and performance characteristics for MC-CDMA applications.

Abstract

In this letter, we propose a novel construction of type-II $Z$-complementary code set (ZCCS) having arbitrary sequence length using the Kronecker product between a complete complementary code (CCC) and mutually orthogonal uni-modular sequences. In this construction, Barker sequences are used to reduce row sequence peak-to-mean envelope power ratio (PMEPR) for some specific lengths sequence and column sequence PMEPR for some specific sizes of codes. The column sequence PMEPR of the proposed type-II ZCCS is upper bounded by a number smaller than $2$. The proposed construction also contributes new lengths of type-II $Z$-complementary pair (ZCP) and type-II $Z$-complementary set (ZCS). Furthermore, the PMEPR of these new type-II ZCPs is also lower than existing type-II ZCPs.

A Construction of Type-II ZCCS for the MC-CDMA System with Low PMEPR

TL;DR

This work introduces a type-II ZCCS construction with arbitrary sequence lengths by taking the Kronecker product of a -CCC with mutually orthogonal uni-modular sequences of length , yielding a type-II -ZCCS. Barker sequences and unimodular scaling are leveraged to reduce column PMEPR, achieving an upper bound below , and enabling new lengths for type-II ZCPs and ZCS with improved PMEPR relative to existing type-II constructions. The framework is applied to a QS MC-CDMA uplink system, where the ZCCS properties suppress MPI/MAI within the ZCZ, and simulations indicate superior BER performance and greater delay tolerance compared to type-I ZCCS. The paper also places the construction in context with existing type-II ZCPs and type-I versus type-II ZCCS, highlighting broader code counts, larger ZCZ widths, and practical advantages for multiuser, quasi-synchronous environments. Overall, the approach extends ZCCS design to longer, more flexible code sets with favorable PMEPR and performance characteristics for MC-CDMA applications.

Abstract

In this letter, we propose a novel construction of type-II -complementary code set (ZCCS) having arbitrary sequence length using the Kronecker product between a complete complementary code (CCC) and mutually orthogonal uni-modular sequences. In this construction, Barker sequences are used to reduce row sequence peak-to-mean envelope power ratio (PMEPR) for some specific lengths sequence and column sequence PMEPR for some specific sizes of codes. The column sequence PMEPR of the proposed type-II ZCCS is upper bounded by a number smaller than . The proposed construction also contributes new lengths of type-II -complementary pair (ZCP) and type-II -complementary set (ZCS). Furthermore, the PMEPR of these new type-II ZCPs is also lower than existing type-II ZCPs.
Paper Structure (11 sections, 7 theorems, 25 equations, 3 figures, 6 tables)

This paper contains 11 sections, 7 theorems, 25 equations, 3 figures, 6 tables.

Key Result

Lemma 1

Let $\mathbf{a}$ and $\mathbf{a'}$ be two complex-valued sequences of identical length $N$, where $\mathbf{a'}=e^{\sqrt{-1}\theta}\mathbf{a}$ and $\theta\in [0,2\pi)$. Then $\rho(\mathbf{a'})(\tau)=\rho(\mathbf{a})(\tau).$

Figures (3)

  • Figure 1: QS-Uplink Scenario
  • Figure 2: Uplink QS MC-CDMA system model
  • Figure 3: BER performance comparison of uplink QS MC-CDMA in Rayleigh fading environment.

Theorems & Definitions (20)

  • Definition 1: Sarkar_Psu
  • Lemma 1
  • Lemma 2
  • Definition 2
  • Definition 3
  • Conjecture 1: Rajen bound
  • Lemma 3: Jin_CCC_kron_DFT_2008
  • Definition 4: Davis
  • Lemma 4: Davis
  • Definition 5
  • ...and 10 more