publication . Article . Preprint . 2006

Complementary Set Matrices Satisfying a Column Correlation Constraint

Wu, Di; Spasojevic, Predrag;
Open Access
  • Published: 03 May 2006 Journal: IEEE Transactions on Information Theory, volume 54, pages 3,330-3,339 (issn: 0018-9448, Copyright policy)
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Motivated by the problem of reducing the peak to average power ratio (PAPR) of transmitted signals, we consider a design of complementary set matrices whose column sequences satisfy a correlation constraint. The design algorithm recursively builds a collection of $2^{t+1}$ mutually orthogonal (MO) complementary set matrices starting from a companion pair of sequences. We relate correlation properties of column sequences to that of the companion pair and illustrate how to select an appropriate companion pair to ensure that a given column correlation constraint is satisfied. For $t=0$, companion pair properties directly determine matrix column correlation properti...
Subjects
free text keywords: Library and Information Sciences, Information Systems, Computer Science Applications, Combinatorics, Discrete mathematics, Autocorrelation, Brute-force search, Binary number, Minimum phase, Complementary sequences, Mathematics, Recursion, Cross-correlation, Matrix (mathematics), Computer Science - Information Theory

[1] M. J. E. Golay, “Multislit spectrometry,” J. Opt. Soc. Amer., vol. 39, pp. 437-444, 1949. [2] M. J. E. Golay, “Complementary series,” IEEE Transactions on Information Theory, vol. 7, pp. 82-87, Apr. 1961. [3] C. C. Tseng and C. Liu, “Complementary sets of sequences,” IEEE Transactions on Information Theory, vol. 18, pp. 644-652, Sep.

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Article . Preprint . 2006

Complementary Set Matrices Satisfying a Column Correlation Constraint

Wu, Di; Spasojevic, Predrag;