Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings

Author

Udaya, P. ; Siddiqi, M.U.

Author_Institution

Dept. of Math., R. Melbourne Inst. of Technol. Univ., Vic., Australia

Volume

44

Issue

4

fYear

1998

fDate

7/1/1998 12:00:00 AM

Firstpage

1492

Lastpage

1503

Abstract

We construct new sequences over finite rings having optimal Hamming correlation properties. These sequences are useful in frequency hopping multiple-access (FHMA) spread-spectrum communication systems. Our constructions can be classified into linear and nonlinear categories, both giving optimal Hamming correlations according to Lempel-Greenberger (1974) bound. The nonlinear sequences have large linear complexity and can be seen as a generalized version of GMW sequences over fields

Keywords

Galois fields; computational complexity; correlation methods; frequency hop communication; multi-access systems; optimisation; polynomials; sequences; spread spectrum communication; FHMA; Galois fields; Lempel-Greenberger bound; MFSK; finite rings; frequency hopping multiple-access; frequency hopping patterns; linear sequences; multiple frequency shift keying; nonlinear sequences; optimal Hamming correlation; optimal large linear complexity patterns; polynomial residue class rings; spread-spectrum communication systems; Communication systems; Frequency shift keying; Galois fields; Information theory; Jamming; Libraries; Linear feedback shift registers; Mathematics; Polynomials; Spread spectrum communication;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.681324

Filename

681324