
	ECE4253 Digital Communications

	Department of Electrical and Computer Engineering - University of New Brunswick, Fredericton, NB, Canada

Linear Recursive Sequence Generator

Shift registers with feedback essentially divide polynomials to create distinctive binary sequences.

This online tool draws and analyzes digital circuits which generate Linear Recursive Sequences (LRS) based on a defining polynomial P(x). A complete state table is derived for the sequential circuit shown below.

Fibonacci Implementation

alternate configuration Fibonacci

Circuit based on P(x) = x³+x+1

The circuit taps correspond to P(x) = (1011).

State Table

This circuit may be analyzed by considering what would happen when the shift register is clocked for each possible state of the circuit. In the state table below, the shift register is filled with each possible value and the contents after the next clock are computed. Results are shown in binary and in decimal. A sequence of states may be traced by following the states from any starting value. The least significant bit is shifted out to create a bitstream output sequence.

Taps: (1011) (prime)

THIS STATE		⇒	NEXT STATE
0 0 0	0	⇒	0 0 0	0
0 0 1	1	⇒	1 0 0	4
0 1 0	2	⇒	1 0 1	5
0 1 1	3	⇒	0 0 1	1
1 0 0	4	⇒	0 1 0	2
1 0 1	5	⇒	1 1 0	6
1 1 0	6	⇒	1 1 1	7
1 1 1	7	⇒	0 1 1	3

See the various output sequences for this circuit.

Specify the taps for your sequence

Modulo 2 addition is shown schematically equivalent to Exclusive-OR gates.


2026-02-15 19:36:59 AST Last Updated: 2014-01-13	Richard Tervo [ tervo@unb.ca ]	Back to the course homepage...