DocumentCode
2095324
Title
The pseudorandom sequence of arrays
Author
Ali, Anjum ; Halijak, Charles A.
Author_Institution
Dept. of Electr. & Comput. Eng., Mercer Univ., Macon, GA, USA
fYear
1989
fDate
26-28 Mar 1989
Firstpage
138
Lastpage
140
Abstract
Pseudorandom sequences, also known as maximal-length sequences, are generated by 1/D (z ), where the denominator is a primitive polynomial of a given degree. The pseudorandom sequence of arrays (PRSA) is generated by N (z )/D (z ), where for a fixed D (z ) the numerator polynomial varies over an arbitrary set of linearly independent polynomials. Some properties of the PRSA are mentioned; these show that the PRSA is in many ways similar to pseudorandom sequences and that each member of the PRSA is in many ways similar to pseudorandom arrays. An immediate application is an autonomous binary image sequence generator
Keywords
computerised picture processing; logic arrays; polynomials; binary image sequence generator; computerised picture processing; logic arrays; maximal-length sequences; primitive polynomial; pseudorandom sequence; Autocorrelation; Clocks; Delay; Hardware; Image generation; Image sequences; Polynomials; Random sequences; Shift registers; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
System Theory, 1989. Proceedings., Twenty-First Southeastern Symposium on
Conference_Location
Tallahassee, FL
ISSN
0094-2898
Print_ISBN
0-8186-1933-3
Type
conf
DOI
10.1109/SSST.1989.72449
Filename
72449
Link To Document