11,077 research outputs found

    A Systematic Framework for the Construction of Optimal Complete Complementary Codes

    Full text link
    The complete complementary code (CCC) is a sequence family with ideal correlation sums which was proposed by Suehiro and Hatori. Numerous literatures show its applications to direct-spread code-division multiple access (DS-CDMA) systems for inter-channel interference (ICI)-free communication with improved spectral efficiency. In this paper, we propose a systematic framework for the construction of CCCs based on NN-shift cross-orthogonal sequence families (NN-CO-SFs). We show theoretical bounds on the size of NN-CO-SFs and CCCs, and give a set of four algorithms for their generation and extension. The algorithms are optimal in the sense that the size of resulted sequence families achieves theoretical bounds and, with the algorithms, we can construct an optimal CCC consisting of sequences whose lengths are not only almost arbitrary but even variable between sequence families. We also discuss the family size, alphabet size, and lengths of constructible CCCs based on the proposed algorithms

    Generalized pairwise z-complementary codes

    Get PDF
    An approach to generate generalized pairwise Z-complementary (GPZ) codes, which works in pairs in order to offer a zero correlation zone (ZCZ) in the vicinity of zero phase shift and fit extremely well in power efficient quadrature carrier modems, is introduced in this letter. Each GPZ code has MK sequences, each of length 4NK, whereMis the number of Z-complementary mates, K is a factor to perform Walsh–Hadamard expansions, and N is the sequence length of the Z-complementary code. The proposed GPZ codes include the generalized pairwise complementary (GPC)codes as special cases

    Bandwidth efficient multi-station wireless streaming based on complete complementary sequences

    Get PDF
    Data streaming from multiple base stations to a client is recognized as a robust technique for multimedia streaming. However the resulting transmission in parallel over wireless channels poses serious challenges, especially multiple access interference, multipath fading, noise effects and synchronization. Spread spectrum techniques seem the obvious choice to mitigate these effects, but at the cost of increased bandwidth requirements. This paper proposes a solution that exploits complete complementary spectrum spreading and data compression techniques jointly to resolve the communication challenges whilst ensuring efficient use of spectrum and acceptable bit error rate. Our proposed spreading scheme reduces the required transmission bandwidth by exploiting correlation among information present at multiple base stations. Results obtained show 1.75 Mchip/sec (or 25%) reduction in transmission rate, with only up to 6 dB loss in frequency-selective channel compared to a straightforward solution based solely on complete complementary spectrum spreading

    On the variable capacity property of CC/DS-CDMA systems

    Get PDF
    A complete complementary code based direct sequence code division multiple access (CC/DS-CDMA) system has been proposed recently as a potential candidate for beyond third generation (B3G) wireless communications. This paper addresses the issues that design of efficient code assignment schemes should be based on a flexible physical layer support, which is extremely important for emerging cross-layer designs in future wireless applications. The study in this paper considers a CC/DS-CDMA system with multiple time slots, three traffic classes and two dynamic code-flock assignment schemes, namely random assignment (RA) and compact assignment (CA). Simulation results show that the CC/DS-CDMA system has variable capacity property (VCP), which is sensitively affected by different code-flock assignment schemes. In general, CA can offer lower blocking probability, whereas RA can offer a larger mean system capacity and higher throughput when offered traffic is heavy

    Good Code Sets from Complementary Pairs via Discrete Frequency Chips

    Full text link
    It is shown that replacing the sinusoidal chip in Golay complementary code pairs by special classes of waveforms that satisfy two conditions, symmetry/anti-symmetry and quazi-orthogonality in the convolution sense, renders the complementary codes immune to frequency selective fading and also allows for concatenating them in time using one frequency band/channel. This results in a zero-sidelobe region around the mainlobe and an adjacent region of small cross-correlation sidelobes. The symmetry/anti-symmetry property results in the zero-sidelobe region on either side of the mainlobe, while quasi-orthogonality of the two chips keeps the adjacent region of cross-correlations small. Such codes are constructed using discrete frequency-coding waveforms (DFCW) based on linear frequency modulation (LFM) and piecewise LFM (PLFM) waveforms as chips for the complementary code pair, as they satisfy both the symmetry/anti-symmetry and quasi-orthogonality conditions. It is also shown that changing the slopes/chirp rates of the DFCW waveforms (based on LFM and PLFM waveforms) used as chips with the same complementary code pair results in good code sets with a zero-sidelobe region. It is also shown that a second good code set with a zero-sidelobe region could be constructed from the mates of the complementary code pair, while using the same DFCW waveforms as their chips. The cross-correlation between the two sets is shown to contain a zero-sidelobe region and an adjacent region of small cross-correlation sidelobes. Thus, the two sets are quasi-orthogonal and could be combined to form a good code set with twice the number of codes without affecting their cross-correlation properties. Or a better good code set with the same number codes could be constructed by choosing the best candidates form the two sets. Such code sets find utility in multiple input-multiple output (MIMO) radar applications
    • …
    corecore