Generalized pairwise complementary codes with set-wise uniform interference-free windows

Chen, Hsiao‐Hwa; Yeh, Yu-Ching; Zhang, Xi; Huang, Aiping; Yang, Yang; Li, Jie; Yang, Xiao; Sharif, Hamid; Vinck, A. J. Han

doi:10.1109/jsac.2005.858878

Cited by 33 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…derived from generalized even shift orthogonal sequences of length 4L 0 [14]. These sequences are divided into two subgroups (U 0 , U 1 ) of G pairs of sequences, expressed in the rest of the paper by the super index j ∈ {0, 1}, which offer a uniform IFW.…”

Section: Generalized Pairwise Complementary Sequencesmentioning

confidence: 99%

“…One of them is the synthesis of new types of sequences derived from the traditional CSS in order to obtain or improve some of their characteristics [10,11]. As a result, in the last years, different types of sequences have been developed, such as the ZCZ (Zero Correlation Zone [12]), LS (Loosely Synchronous [13]), and GPC (Generalized Pairwise Complementary [14]), which are characterized by an Interference Free Window (IFW) in their Autocorrelation Function (ACF) and Cross Correlation Function (CCF). In particular, GPC sequences have attracted an increasing attention because of their particular mathematical properties, namely, greater energy efficiency and larger IFW for a given length, as compared with other sequences.…”

Section: Introductionmentioning

confidence: 99%

“…The GPC sequences are pairs of binary sequences initially introduced by Chen et al [14]. They can be generated and correlated using schemes derived from CSS, as proposed by García et al [15].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Simultaneous generation and correlation of complete sets of generalized pairwise complementary sequences

Hadad

Funes

Donato

et al. 2015

Circuit Theory & Apps

View full text Add to dashboard Cite

New coding schemes are increasingly being developed to adapt multisensor and communication systems to the requirements of the current technological environment. In some cases, the practical implementation of these schemes involves a great amount of signal processing operations. In order to achieve and make suitable their use in different platforms, efficient algorithms are required to process coding. In the last years, a new kind of complementary sequences, known as Generalized Pairwise Complementary sequences, has been proposed. These sequences provide high noise immunity when they are applied to multiuser systems, as well as a low cross-correlation, which is convenient in those applications. The aim of this paper is to propose optimized generation and correlation architectures for Generalized Pairwise Complementary sequences that would allow to process a complete set using a reduced amount of operations. An analytical demonstration is provided, with a final comparison to evaluate the reduction with regard to other algorithms. Copyright . MN Hadad, MA Funes, PG Donato, DO Carrica. Hardware implementation of simultaneous M mutually orthogonal complementary sets of sequences algorithms.

show abstract

Section: Generalized Pairwise Complementary Sequencesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Simultaneous generation and correlation of complete sets of generalized pairwise complementary sequences

Hadad

Funes

Donato

et al. 2015

Circuit Theory & Apps

View full text Add to dashboard Cite

show abstract

Evolution from symbol‐level space–time coded MIMO to chip‐level space–time coded MIMO: a review

Sun

Meng

et al. 2012

Wireless Communications

View full text Add to dashboard Cite

Space–time coded multiple‐input multiple‐output (MIMO) technology is an important technique that improves the performance of wireless communication systems significantly without consuming bandwidth resource. This paper first discusses the characteristics and limitations of traditional symbol‐level space–time coding schemes, which work largely on the basis of an assumption that signals are sent to a block‐fading channel. Therefore, the symbol‐level space–time coding schemes rely on symbol‐level signal processing. Taking advantage of orthogonal complementary codes, we propose a novel MIMO scheme, in this paper, based on chip‐level space–time coding that is different from the traditional symbol‐level space–time coding. With the help of space–time–frequency complementary coding and multicarrier modem, the proposed scheme is able to achieve multipath interference‐free and multiuser interference‐free communications with simple a correlator detector. The proposed chip‐level space–time coded MIMO works well even in a fast fading channel in addition to its flexibility to achieve diversity and multiplexing gains simultaneously in varying channel environments. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

Development of the Next Generation CDMA Technology and Lessons We Learnt from the Past

Chen

2009

Communications in Computer and Information Science

View full text Add to dashboard Cite

Generalized pairwise complementary codes with set-wise uniform interference-free windows

Cited by 33 publications

References 13 publications

Simultaneous generation and correlation of complete sets of generalized pairwise complementary sequences

Simultaneous generation and correlation of complete sets of generalized pairwise complementary sequences

Evolution from symbol‐level space–time coded MIMO to chip‐level space–time coded MIMO: a review

Development of the Next Generation CDMA Technology and Lessons We Learnt from the Past

Contact Info

Product

Resources

About