Linear Recursive Sequence - LRS Flashcards

1
Q

Why are linear recursive sequences used at a basic level?

A

To help maintain synchronicity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Where are linear recursive sequences used

A

Over the horizon radars

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How do linear recursive systems help over the horizon radars ?

A

They given each radar pulse a unique sequence so that the receiver terminal can calculate the timings of the original data stream.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the uses of linear recursive sequences?

A
Selcal - selective calling 
Encryption 
Code division multiple access - CDMA
Frequency hopping 
But error test rate 
Elint 
Randomisation 
Direct sequence spread spectrum 
Synchronisation 
Echo cancellation 
Forward error correction / error detection and correction
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How is a linear recursive sequence generated ?

A

A shift register generator (SRG) known commercially as a linear feedback shift register (LFSR)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is a shift register generator made up of ?

A

An xor gate
Clock
Shift register

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is a a shift register made of ?

What can they hold ?

A

Bistable cells

Which can independently hold a 1 or a 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Is the length of a shift register fixed ?

A

No, it is dependant on the size of the LRS being generated

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Where will there always be a tap point ?

A

The first cell

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the initial start condition of the shift register called ?

A

The fill

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What do the tapped cells link to ?

A

They are used to feed the xor gate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How is the output of the xor gate calculated

A
They are modulo 2 added 
00 = 0
01 = 1
10= 1
11 = 0
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Where does the put out of the xor gate go ?

A

Feeds back into the shift register

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What can the initial fill not be ?

A

All 0’s

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

How can the arrangement of cells and tap points be defined ?

A

Numerically 1+2 = 5
Algebraic / generating polynomial PG - pg = x 0 + x 1 + x 4 = 0
Standard form R4(0,1,4)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the equation for a maximal length linear recursive sequence ?

A

2 n - 1

N = the number of cells in the shift register

17
Q

What is the minimum number of tap points for a maximal linear recursive sequence?

Will it be an even or odd amount of tap points ?

A

Two

Even

18
Q

What is the equation for a non maximal length linear recursive sequence?

A

< 2n -1

19
Q

How does an additive randomiser work ?

A

It generates a linear recursive sequence of a given length and modulo - 2 adds it to the data repeatedly.

The data to be transmitted is modulo 2 added to the Lrs data

20
Q

What is the result of an error within an additive randomiser ?

A

However many errors in the transmission will also be the amount of errors in the output data

21
Q

What are the advantages of an additive randomiser ?

A

They are not prone to burst errors

22
Q

What are the disadvantages of an addictive randomiser ?

A

An external sync area is required which adds over head

The frame width is still evident in the transmitted data

23
Q

What are the two randomiser associated with linear recursive sequences?

A

The additive randomiser and the feed trough randomiser

24
Q

Where is the input of a feed through randomiser ?

A

It is modulo 2 added with an Lrs after the first xor gate from which feeds the shift register

25
Q

What are the advantages of a feed through randomiser ?

A

They are self synchronising and the data appears random

26
Q

What are the disadvantages of a feed through randomiser ?

A

They are prone to producing errors or burst errors

One error = 1 x the number of tap points

27
Q

What are two methods of error detection and correction?

A

Cyclic redundancy checks

A checksum

28
Q

What similarities and differences do checksums and cyclic redundancy checks have to a linear recursive sequence?

A

They both employ a data stream generated in the same way as an Lrs

However they are used for error detection and correction rather than synchronisation

29
Q

What is a checksum ?

A

It is a fixed sized datum or data code that is generated from the data to be sent.

It can be regenerated at anytime to compare with the stored checksum, to check for errors in the data

30
Q

What is the procedure that produces a checksum called ?

A

A checksum function or a checksum algorithm

31
Q

What is a cyclic redundancy check ?

A

It is a non secure function designed to detect accidental changes in raw communications or computer data

32
Q

Where are cyclic redundancy checks often used ?

A

On digital networks and storage devices

33
Q

What is a feature of a cyclic redundancy check ?

A

The check code adds zero information to the data

34
Q

How does a cyclic redundancy check work ?

A

It calculates a short fixed length of binary sequence for each block of data.

It then sends and Stores them both together

35
Q

How does a device check for errors using a cyclic redundancy check?

A

It repeats the initial calculation that generated the first cyclic redundancy check and compares the stored one with the new one

36
Q

Why are cyclic redundancy checks popular ?

3 advantages

A

Because they are easily implemented in binary hardware

Easy to analyse mathematically

Useful in detecting common errors cause by noise

37
Q

What are the disadvantages of a cyclic redundancy checks ?

A

They are not suitable in detecting intentional alteration of data.

There is no authentication and a crc and data could be easily edited even when encrypted