IP Library Granted Patent US 7,035,408
Granted Patent B2
US 7,035,408 · App. 09/840,046 · Granted Apr 25, 2006

Method to generate pseudo-random sequence of multi-carrier data symbols, and related transmitter and receiver

Assignee: Alcatel
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,035,408
App. No.
09/840,046
Granted
Apr 25, 2006
Kind
B2
Abstract

To generate a pseudo-random sequence (PRMS 1 ) of multi-carrier data symbols (DMT 0 , DMT 1 , DMT 2 ), a pseudo-random bit sequence (PRBS 1 ) is produced by repetitively generating a pseudo-random sequence of L bits, L being a first integer value (L=4). To create a multi-carrier data symbol (DMT 0 , DMT 1 , DMT 2 ) N bits are used, N being a second integer value (N=8). The pseudo-random bit sequence (PRBS 1 ) is subdivided into strings of N′ bits, N′ being a third integer value larger than N (N′=9), and N bits out of each string of N′ bits are used to generate a respective multi-carrier data symbol (DMT 0 , DMT 1 , DMT 2 ). N′-N bits out of each string of N′ bits are left unused.

Claims (30)

1. A method to generate a pseudo-random sequence of multi-carrier data symbols, said method comprising:

producing a pseudo-random bit sequence by repetitively generating a pseudo-random sequence of L bits, L being a first integer value;

packetizing into multi-carrier data symbols thereby using N bits of said pseudo-random bit sequence per multi-carrier data symbol, N being a second integer number, to thereby generate said pseudo-random sequence of multi-carrier data symbols,

wherein said packetizing comprises:

dividing said pseudo-random bit sequence into strings of N′ bits, N′ being a third integer value larger than N, wherein N is greater than or equal to two, N′ differs from L−1 and from L+1, and N′ is not fractionally related to L; and

using N bits out of each string of N′ bits to generate a multi-carrier data symbol out of said pseudo-random sequence of multi-carrier data symbols, and leaving N′-N bits out of each string of N′ bits unused.

2. A generator of a pseudo-random sequence of multi-carrier data symbols, said generator comprising:

scrambling means, adapted to repetitively generate a pseudo-random sequence of L bits, L being a first integer value, to thereby produce a pseudo-random bit sequence;

packetizing means, adapted to packetize into multi-carrier data symbols using N bits of said pseudo-random bit sequence per multi-carrier data symbol, N being a second integer number, to thereby generate said pseudo-random sequence of multi-carrier data symbols,

wherein said packetizing means comprises:

dividing means, adapted to divide said pseudo-random bit sequence into strings of N′ bits, N′ being a third integer value larger than N, wherein N is greater than or equal to two;

multi-carrier data symbol generating means, adapted to use N bits out of each string of N′ bits to generate a multi-carrier data symbol out of said pseudo-random sequence of multi-carrier data symbols and to leave N′-N bits out of each string of N′ bits unused; and

selection means, adapted to select said third integer value N′, wherein N′ differs from L−1 and from L+1, and N′ is not fractionally related to L.

3. The pseudo-random sequence generator according to claim 2 , further comprising transmitting means, coupled to said pseudo-random sequence generator, and adapted to transmit a pseudo-random sequence of multi-carrier symbols generated by said pseudo-random sequence generator over a communication channel.

4. The pseudo-random sequence generator according to claim 3 , further comprising communication means coupled to said selection means, and adapted to communicate said third integer value N′ to a multi-carrier receiver.

5. The pseudo-random sequence generator according to claim 2 , further comprising:

receiving means adapted to receive a first pseudo-random sequence of multi-carrier symbols transmitted over a communication channel, and

decoding means, coupled to said receiving means and to said pseudo-random sequence generator, and adapted to decode said first pseudo-random sequence of multi-carrier symbols and a second pseudo-random sequence of multi-carrier symbols generated by said pseudo-random sequence generator.

6. A generator of a pseudo-random sequence of multi-carrier data symbols, said generator, comprising:

a scrambler that repetitively generates a pseudo-random sequence of L bits, L being a first integer value, to thereby produce a pseudo-random bit sequence;

a packet generator that packetizes multi-carrier data symbols using N bits of said pseudo-random bit sequence per multi-carrier data symbol, N being a second integer number, to thereby generate said pseudo-random sequence of multi-carrier data symbols,

wherein said packet generator comprises:

a divider that divides said pseudo-random bit sequence into strings of N′ bits, N′ being a third integer value larger than N, and wherein, wherein N is greater than or equal to two; and

a multi-carrier data symbol generator that uses N bits out of each string of N′ bits to generate a multi-carrier data symbol out of said pseudo-random sequence of multi-carrier data symbols and to leave N′-N bits out of each string of N′ bits unused; and

a switch that selects said third integer value N′, wherein N′ differs from L−1 and differs from L+1, and N′ is not fractionally related to L.

7. The pseudo-random sequence generator according to claim 6 , further comprising a transmitter, coupled to said pseudo-random sequence generator, and adapted to transmit a pseudo-random sequence of multi-carrier symbols generated by said pseudo-random sequence generator over a communication channel.

8. The pseudo-random sequence generator according to claim 7 , further comprising a communication device coupled to said switch, and adapted to communicate said third integer value N′ to a multi-carrier receiver.

9. The pseudo-random sequence generator according to claim 6 , further comprising:

a receiver that receives a first pseudo-random sequence of multi-carrier symbols transmitted over a communication channel, and

a decoder coupled to said receiving means and to said pseudo-random sequence generator, and decoding said first pseudo-random sequence of multi-carrier symbols and a second pseudo-random sequence of multi-carrier symbols generated by said pseudo-random sequence generator.

Assignments (4)
RELEASE OF SECURITY INTEREST Recorded Sep 30, 2014
From: CREDIT SUISSE AG
To: ALCATEL LUCENT
Reel/Frame 033868/0001 →
CHANGE OF NAME Recorded Jan 16, 2014
From: ALCATEL
To: ALCATEL LUCENT
Reel/Frame 032070/0519 →
SECURITY AGREEMENT Recorded Jan 30, 2013
From: ALCATEL LUCENT
To: CREDIT SUISSE AG
Reel/Frame 029821/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 28, 2001
From: ANTOINE, PHILIPPE
To: ALCATEL
Reel/Frame 012115/0441 →
Priority Claims (1)
EP 00401154 · Apr 26, 2000 · regional
Continuity (1)
Related Publication 20010036274A1 · Nov 1, 2001