Frequency/Time Hopping Sequences with Large Linear Complexities
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(p k ) by taking successive k-tuples of given sequences over GF(p). We are able to characterize those p-ary sequences whose k-tuple versions now over GF(p k ) have the maximum possible linear complexities (LCs). Next, we consider the FH/TH sequence generators composed of a combinatorial function generator and some buffers. We are able to characterize the generators whose output FH/TH sequences over GF(p k ) have the maximum possible LC for the given algebraic normal form.
KeywordsBinary Sequence Linear Complexity Minimal Polynomial Hardware Complexity Linear Feedback Shift Register
Unable to display preview. Download preview PDF.