Optimal biphase sequences with large linear complexity derived from sequences over Z4

Udaya, Paramapalli and Siddiqi, Mohammad Umar (1996) Optimal biphase sequences with large linear complexity derived from sequences over Z4. IEEE Transactions on Information Theory, 42 (1). pp. 206-216. ISSN 0018-9448

PDF (Optimal biphase sequences with large linear complexity derived from sequences over Z4) - Published Version Restricted to Repository staff only Download (1MB) | Request a copy

Abstract

New families of biphase sequences of size 2T-1 + I, r being a positive integer, are derived from families of in- terleaved maximal-length sequences over 24 of period 2(Zr - 1). These sequences have applications in code-division spread- spectrum multiuser communication systems. The families satisfy Sidelnikov bound with equality on Omax, which denotes the maximum magnitude of the periodic crosscorreslation and out-of- phase antocorrelatiou values. One of the families satisfies Welch bound on Om,, with equality. The linear complexity and the period of all sequences are equal to T(T + 3)/2 and 2(2' - l), respectively, with an exception of the single m-sequence which has linear complexity r and period 2' - 1. Sequence imbalance and correlation distributions are also computed.

Item Type:	Article (Journal)
Additional Information:	5072/14202
Uncontrolled Keywords:	Biphase sequences, Galois rings, nonlinear p01y- nomial mappings, linear complexity, CDMA spread-spectrum systems.
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5101 Telecommunication. Including telegraphy, radio, radar, television
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Engineering
Depositing User:	Prof. Mohammad Umar Siddiqi
Date Deposited:	22 Jul 2013 10:51
Last Modified:	22 Jul 2013 10:51
URI:	http://irep.iium.edu.my/id/eprint/14202

Actions (login required)

View Item