IP Library Granted Patent US 8,234,552
Granted Patent B2
US 8,234,552 · App. 12/265,705 · Granted Jul 31, 2012

Method and apparatus for preamble creation and communication in a wireless communication network

Assignee: QUALCOMM Incorporated
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 8,234,552
App. No.
12/265,705
Granted
Jul 31, 2012
Kind
B2
Abstract

A wireless communications network uses a beamforming process to increase signal quality as well as transmission capabilities and reduction of interference. An improved Golay sequence is also used in the wireless communications network. In one aspect, the processes can be used to communicate regardless of whether the system is on an OFDM mode or a single carrier mode.

Claims (80)

1. A method of communication, comprising:

obtaining an extended Golay code selected from a set of extended Golay codes;

modifying the extended Golay code;

generating a preamble using the modified extended Golay code; and

transmitting the preamble.

2. The method of claim 1 , further comprising generating the set of extended Golay codes based on a Golay code and a set of short sequences.

3. The method of claim 2 , wherein each of the short sequences comprises at least one of a row of a Fourier Transform matrix and a Hadamard matrix.

4. The method of claim 3 , wherein the Fourier Transform matrix or the Hadamard matrix has four rows and four columns.

5. The method of claim 2 , wherein each of the extended Golay codes is generated by performing a Kronecker product of the Golay code and one of the set of short sequences.

6. The method of claim 2 , wherein each of the short sequences comprises an inverse Fourier Transform of a Kronecker sequence.

7. The method of claim 2 , wherein one of the set of short sequences comprises a sequence selected from a group consisting of:

[1 1 1 1];

[1 j −1 −j];

[1 −1 1 −1]; and

[1 −j −1 j].

8. The method of claim 1 , wherein the set of extended Golay codes comprises Golay codes with zero periodic cross-correlation.

9. The method of claim 1 , where the modification comprises cyclically filtering the extended Golay code with a time domain filter having a defined spectral mask.

10. The method of claim 1 , where the modification comprises:

performing a Fast Fourier Transform (FFT) on the extended Golay code to create a set of subcarriers;

attenuating at least one subcarrier of the set of subcarriers; and

performing an inverse FFT of the attenuated at least one subcarrier.

11. The method of claim 10 , wherein the attenuation comprises zeroing out the at least one subcarrier of the set of subcarriers.

12. A communication apparatus, comprising:

means for obtaining an extended Golay code selected from a set of extended Golay codes;

means for modifying the extended Golay code;

means for generating a preamble using the modified extended Golay code; and

means for transmitting the preamble.

13. The communication apparatus of claim 12 , further comprising means for generating the set of extended Golay codes based on a Golay code and a set of short sequences.

14. The communication apparatus of claim 11 , wherein each of the short sequences comprises at least one of a row of a Fourier Transform matrix and a Hadamard matrix.

15. The communication apparatus of claim 14 , wherein the Fourier Transform matrix or the Hadamard matrix has four rows and four columns.

16. The communication apparatus of claim 11 , wherein each of the extended Golay codes is generated by performing a Kronecker product of the Golay code and one of the set of short sequences.

17. The communication apparatus of claim 11 , wherein each of the short sequences comprises an inverse Fourier Transform of a Kronecker sequence.

18. The communication apparatus of claim 11 , wherein one of the set of short sequences comprises a sequence selected from a group consisting of:

[1 1 1 1];

[1 j −1 −j];

[1 −1 1 −1]; or

[1 −j −1 j].

19. The communication apparatus of claim 12 , wherein the set of extended Golay codes comprises Golay codes with zero periodic cross-correlation.

20. The communication apparatus of claim 12 , where the modification means comprises means for cyclically filtering the extended Golay code with a time domain filter having a defined spectral mask.

21. The communication apparatus of claim 12 , where the modification means comprises:

means for performing a Fast Fourier Transform (FFT) on the extended Golay code to create a set of subcarriers;

means for attenuating at least one subcarrier of the set of subcarriers; and

means for performing an inverse FFT of the attenuated at least one subcarrier.

22. The communication apparatus of claim 21 , wherein the attenuation means comprises means for zeroing out the at least one subcarrier of the set of subcarriers.

23. A communication apparatus, comprising:

a processing system configured to:

obtain an extended Golay code selected from a set of extended Golay codes;

modify the extended Golay code;

generate a preamble using the modified extended Golay code; and

transmit the preamble.

24. The communication apparatus of claim 12 , wherein the processing system is further configured to generate the set of extended Golay codes based on a Golay code and a set of short sequences.

25. The communication apparatus of claim 11 , wherein each of the short sequences comprises at least one of a row of a Fourier Transform matrix and a Hadamard matrix.

26. The communication apparatus of claim 14 , wherein the Fourier Transform matrix or the Hadamard matrix has four rows and four columns.

27. The communication apparatus of claim 11 , wherein each of the extended Golay codes is generated by performing a Kronecker product of the Golay code and one of the set of short sequences.

28. The communication apparatus of claim 11 , wherein each of the short sequences comprises an inverse Fourier Transform of a Kronecker sequence.

29. The communication apparatus of claim 11 , wherein one of the set of short sequences comprises a sequence selected from a group consisting of:

[1 1 1 1];

[1 j −1 −j];

[1 −1 1 −1]; or

[1 −j −1 j].

30. The communication apparatus of claim 12 , wherein the set of extended Golay codes comprises Golay codes with zero periodic cross-correlation.

31. The communication apparatus of claim 12 , wherein the processing system is further configured to cyclically filter the extended Golay code with a time domain filter having a defined spectral mask.

32. The communication apparatus of claim 12 , wherein the processing system is further configured to:

perform a Fast Fourier Transform (FFT) on the extended Golay code to create a set of subcarriers;

attenuate at least one subcarrier of the set of subcarriers; and

perform an inverse FFT of the attenuated at least one subcarrier.

33. The communication apparatus of claim 21 , wherein the processing system is further configured to zero out the at least one subcarrier of the set of subcarriers.

34. A computer-program product for wireless communications comprising:

a machine-readable medium encoded with instructions executable to:

obtain an extended Golay code selected from a set of extended Golay codes;

modify the extended Golay code;

generate a preamble using the modified extended Golay code; and

transmit the preamble.

35. A piconet coordinator comprising:

an antenna; and

a processing system configured to:

obtain an extended Golay code selected from a set of extended Golay codes;

modify the extended Golay code;

generate a preamble using the modified extended Golay code; and

transmit the preamble via the antenna.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 13, 2009
From: LAKKIS, ISMAIL
To: QUALCOMM INCORPORATED
Reel/Frame 022539/0109 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 22, 2009
From: LAKKIS, ISMAIL
To: QUALCOMM INCORPORATED
Reel/Frame 022143/0600 →
Continuity (2)
Provisional Application 60985957 · Nov 6, 2007
Related Publication 20090125792A1 · May 14, 2009