Re: A question on pseudo-random codes
- From: kennheinrich@xxxxxxxxxxxx
- Date: Mon, 18 Aug 2008 18:41:35 -0700 (PDT)
On Aug 18, 8:33 pm, "nagarajcs" <nagara...@xxxxxxxx> wrote:
On Aug 17, 10:46 am, "nagarajcs" <nagara...@xxxxxxxx> wrote:
Hi all,
taps),For m-sequences(generated by an n-bit LFSR with predefined feedback
shiftthe next generated bit can be determined by the current state of the
bitregister. In other words, given the whole sequence, the shift of any
succeedingcan be uniquely identified by looking at n-bits (preceding or
that bit).
For Gold codes, the same is possible with 2n-bits.
whichI want to know what is the term used in literature for this length
can identify the shift in a random sequence.
Sorry if this question is a very basic one.
Nagaraj
I think you're referring to "linear span". Googled and found these
course notes; check out the definition at the top of page 2:
http://comsec.uwaterloo.ca/~ggong/EE599S07/BM-chapter99.pdf
- Kenn
Thanks mate!! Yes.. it is the "Linear Span".
Does the word 'linear' relate to the linear in LFSR? Is there a generic
term for the sequences generated not necessarily through LFSR?
Nagaraj
Linear... sounds reasonable. PRBS (pseudo random bit sequences)
generally describes sequences generated through either an LFSR or
other deterministic process. Although an LFSR isn't necessarily
constrained to be binary (it could be over any finite field), so the
"B" in PRBS doesn't quite fit.
- Kenn
.
- References:
- A question on pseudo-random codes
- From: nagarajcs
- Re: A question on pseudo-random codes
- From: kennheinrich
- Re: A question on pseudo-random codes
- From: nagarajcs
- A question on pseudo-random codes
- Prev by Date: Best Computer Prices On The Web
- Next by Date: Re: A question on pseudo-random codes
- Previous by thread: Re: A question on pseudo-random codes
- Next by thread: Re: A question on pseudo-random codes
- Index(es):
Relevant Pages
|