Presentation 2008-07-25
On Some Properties of Complete Complementary Codes
Yi JIN, Hiroki KOGA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) An (M, N, L)-complete complementary code, which contains M sets of N sequences of length L, can be considered as a spread code with ideal auto- and cross-correlation properties. In this paper, we first prove that, given (M, N, L)- and (M', N', L')-complete complementary codes, we can generate an (MM', NN', LL')-complete complementary code by using the Kronecker product. This fact is easily established from properties of the Kroneker product and the inner product of vectors. Next, we prove that a new (N, N, N)-complete complementary code is obtained from the DFT matrix of order N and its cyclic shift with respect to the rows. The (N, N, N)-complete complementary code is an example in which every set of N sequences contains the same sequences and leads to reduction of the number of matched filters in demodulators.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Spread code / Complete Complementary Code / Kronecker Product / DFT Matrix
Paper # IT2008-16
Date of Issue

Conference Information
Committee IT
Conference Date 2008/7/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Some Properties of Complete Complementary Codes
Sub Title (in English)
Keyword(1) Spread code
Keyword(2) Complete Complementary Code
Keyword(3) Kronecker Product
Keyword(4) DFT Matrix
1st Author's Name Yi JIN
1st Author's Affiliation Graduate School of Systems and Information Engineering, University of Tsukuba()
2nd Author's Name Hiroki KOGA
2nd Author's Affiliation Graduate School of Systems and Information Engineering, University of Tsukuba
Date 2008-07-25
Paper # IT2008-16
Volume (vol) vol.108
Number (no) 159
Page pp.pp.-
#Pages 6
Date of Issue