Novel way to generate pseudo-random sequences longer than maximal length sequences

J. Mouine; N. Boutin

Novel way to generate pseudo-random sequences longer than maximal length sequences

Université de Sherbrooke

Research output: Contribution to journal › Conference article › peer-review

Abstract

We show in this paper that it is possible to generate, using an l-stage shift register, a pseudo-random binary sequence longer than (2^l-1), that is longer than the so-called maximal length sequence. This can be done by subdividing the l-stage shift register into two parts and clocking each part at different speeds. An example is presented to show some results.

Original language	English
Pages (from-to)	529-532
Number of pages	4
Journal	Canadian Conference on Electrical and Computer Engineering
Volume	2
State	Published - 1998
Externally published	Yes
Event	Proceedings of the 1998 11th Canadian Conference on Electrical and Computer Engineering, CCECE. Part 2 (of 2) - Toronto, Can Duration: 24 May 1998 → 28 May 1998

Cite this

@article{9ef73d05cd3e490292ecd9e978c3eee5,

title = "Novel way to generate pseudo-random sequences longer than maximal length sequences",

abstract = "We show in this paper that it is possible to generate, using an l-stage shift register, a pseudo-random binary sequence longer than (2l-1), that is longer than the so-called maximal length sequence. This can be done by subdividing the l-stage shift register into two parts and clocking each part at different speeds. An example is presented to show some results.",

author = "J. Mouine and N. Boutin",

year = "1998",

language = "English",

volume = "2",

pages = "529--532",

journal = "Canadian Conference on Electrical and Computer Engineering",

issn = "0840-7789",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings of the 1998 11th Canadian Conference on Electrical and Computer Engineering, CCECE. Part 2 (of 2) ; Conference date: 24-05-1998 Through 28-05-1998",

}

TY - JOUR

T1 - Novel way to generate pseudo-random sequences longer than maximal length sequences

AU - Mouine, J.

AU - Boutin, N.

PY - 1998

Y1 - 1998

N2 - We show in this paper that it is possible to generate, using an l-stage shift register, a pseudo-random binary sequence longer than (2l-1), that is longer than the so-called maximal length sequence. This can be done by subdividing the l-stage shift register into two parts and clocking each part at different speeds. An example is presented to show some results.

AB - We show in this paper that it is possible to generate, using an l-stage shift register, a pseudo-random binary sequence longer than (2l-1), that is longer than the so-called maximal length sequence. This can be done by subdividing the l-stage shift register into two parts and clocking each part at different speeds. An example is presented to show some results.

UR - http://www.scopus.com/inward/record.url?scp=0031630830&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0031630830

SN - 0840-7789

VL - 2

SP - 529

EP - 532

JO - Canadian Conference on Electrical and Computer Engineering

JF - Canadian Conference on Electrical and Computer Engineering

T2 - Proceedings of the 1998 11th Canadian Conference on Electrical and Computer Engineering, CCECE. Part 2 (of 2)

Y2 - 24 May 1998 through 28 May 1998

ER -

Novel way to generate pseudo-random sequences longer than maximal length sequences

Abstract

Other files and links

Fingerprint

Cite this