DocumentCode :
1355815
Title :
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization
Author :
Chee, Yeow Meng ; Ling, Alan C H ; Yin, Jianxing
Author_Institution :
Div. of Math. Sci., Nanyang Technol. Univ., Singapore, Singapore
Volume :
56
Issue :
11
fYear :
2010
Firstpage :
5738
Lastpage :
5746
Abstract :
Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, based on almost difference sets and cyclic difference matrices, are given. These produce new infinite families of optimal PCDPs (and hence optimal frequency-hopping sequences and optimal comma-free codes). The existence problem for optimal PCDPs in BBZ3m, with m base blocks of size three, is also solved for all m ≠ 8,16 mod 24.
Keywords :
cyclic codes; frequency hop communication; synchronisation; code synchronization; cyclic difference matrices; optimal PCDP construction; optimal comma-free codes; optimal frequency hopping sequences; optimal partitioned cyclic difference packings; Correlation; Decision support systems; Delta modulation; Frequency synchronization; Indexes; Redundancy; Synchronization; Almost difference sets; code synchronization; comma-free codes; cyclic difference matrices; frequency-hopping sequence (FHS); partitioned difference packings;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2010.2070530
Filename :
5605385
Link To Document :
بازگشت