CDMA system with frequency domain equalization

• US 7,099,299 B2
• Filed: 03/04/2002
• Issued: 08/29/2006
• Est. Priority Date: 03/04/2002
• Status: Expired due to Fees

• Current Assignee: Agency For Science Technology and Research
• Original Assignee: Agency For Science Technology and Research
• Inventors: Liang, Ying-Chang, Shin, Francois Chin Po, Madhukumar, Appukuttan Nair Saraswathy Amma
• Primary Examiner(s): HO, DUC CHI
• Application Number:
  US10/090,370
• Publication Number:
  US 20030165131A1
• Time in Patent Office: 1,639 Days
• Field of Search: None
• US Class Current: 370/342
• CPC Class Codes: H04B 1/7103 the interference being multiple access interference
• CPC Class Codes: H04B 2201/70701 featuring pilot assisted reception
• CPC Class Codes: H04B 2201/709709 Methods of preventing interference
• CPC Class Codes: H04L 2025/03414 Multicarrier
• CPC Class Codes: H04L 2025/03522 Frequency domain
• CPC Class Codes: H04L 25/0216 with estimation of channel length
• CPC Class Codes: H04L 25/022 of frequency response
• CPC Class Codes: H04L 25/0226 sounding signals per se
• CPC Class Codes: H04L 25/0228 with direct estimation from sounding signals
• CPC Class Codes: H04L 25/0248 Eigen-space methods
• CPC Class Codes: H04L 25/0256 Channel estimation using minimum mean square error criteria
• CPC Class Codes: H04L 25/03159 operating in the frequency domain H04L25/03165, H04L25/03178 take precedence
• CPC Class Codes: H04L 25/03834 using pulse shaping
• CPC Class Codes: H04L 27/2621 Reduction thereof using phase offsets between subcarriers
• CPC Class Codes: H04L 5/0016 Time-frequency-code
• CPC Class Codes: H04L 5/0048 Allocation of pilot signals, i.e. of signals known to the receiver

Abstract

A code division multiple access (CDMA) system and methods for processing symbol blocks of a spread signal in both frequency and time domains are described. A transmitter (10) of the CDMA system spreads pilot symbols and data of the symbol blocks to derive a spread sequence. Thereafter, the spread sequence is extended with a predetermined number of chips and pulse shaped for transmission as the spread signal. A receiver (400) of the CDMA system receives the spread signal, removes the predetermined number of chips and then orthogonally transforms the spread signal to the frequency domain to derive a transformed signal. The transformed signal is equalized in the frequency domain to derive an equalized signal. The equalized signal is then inverse orthogonally transformed to an output in the time domain. The output is then despreaded to derive the symbol blocks.

Claims

1. A code division multiple access (CDMA) system comprising:

at least one CDMA transmitter having;

at least one spreader for spreading a packet having one or more blocks to derive an M×

G spread sequence for each of said blocks to thereby form a spread signal, where M represents number of symbols, said number being greater or equal to one, each of said at least one spreader having a processing gain of G;

and

a sequence extender for extending each of said blocks using a predetermined number of chips to thereby form an extended spread signal, said sequence extender having an extender input coupled to said spreader output.

2. The CDMA system of claim 1, wherein said packet comprises a plurality of pilot chips.

3. The CDMA system of claim 2, wherein said plurality of pilot chips is placed together as one or more pilot blocks within said packet.

4. The CDMA system of claim 2, wherein said plurality of pilot chips is dedicated to a single user.

5. The CDMA system of claim 2, wherein said plurality of pilot chips is common to one or more users in a transmission of said extended spread signal.

6. The CDMA system of claim 2, wherein pilot chips within each of said blocks are equally spaced in a transmission of said extended spread signal.

7. The CDMA system of claim 6, wherein said pilot chips within each of said blocks are determined based upon data from said each of said blocks.

8. The CDMA system of claim 7, wherein said pilot chips is determined based upon p=A⁻

1(α

g−

Bd), where p is a pilot vector in the time domain, g is a known spreading sequence for channel estimation, d is the sum of spread data of all users, α

is a scalar value based upon data in said blocks, and A and B are sub-matrices derived from Fast Fourier Transform based upon positions of p and g.

9. The CDMA system of claim 2, wherein said sequence extender is adapted to extract said predetermined number of chips from a tail portion of each of said blocks for placing in front of said each of said blocks.

10. The CDMA system of claim 2, wherein said sequence extender is adapted to extract said predetermined number of chips from a head portion and a tail portion of each of said blocks, said predetermined number of chips from said head portion being placed behind said tail portion and said predetermined number of chips from said tail portion being placed behind said tail portion.

11. The CDMA system of claim 2, wherein said sequence extender is adapted to insert said predetermined number of chips as zeros after each of said blocks.

12. The CDMA system of claim 2, wherein said sequence extender is adapted to insert said predetermined number of chips as zeros before and after each of said blocks.

13. The CDMA system of claim 1, wherein said CDMA transmitter fisher comprises a combiner having a combiner input and a combiner output, said combiner input being coupled to said spreader output of each of said at least one spreader, said combiner output being coupled to said extender input.

14. The CDMA system of claim 1, wherein said transmitter further comprises a pulse shaper, coupled to output of said sequence extender.

15. A method for transmitting signals in a code division multiple access (CDMA) system, said method comprising the steps of:

spreading, by at least one spreader, a packet having one or more blocks to derive an M×

G spread sequence for each of said blocks to thereby form a spread signal, where M represents number of symbols, said number being greater or equal to one, each of said at least one spreader having a processing gain of G;

and

extending, by a sequence extender, said M×

G spread sequence using a predetermined number of chips to thereby form an extended spread signal, said M×

G spread sequence being received from a spreader output of each of said at least one spreader.

16. The method of claim 15, and further comprising the step of multiplexing a plurality of pilot chips with data of said packet before said spreading step.

17. The method of claim 16, wherein said multiplexing step comprises the step of placing said plurality of pilot chips together as one or more pilot blocks within said packet.

18. The method of claim 16, wherein said multiplexing step comprises the step of dedicating said plurality of pilot chips to a single user.

19. The method of claim 16, wherein said multiplexing step comprises the step of setting said plurality of pilot chips to be common to one or more users in a transmission of said extended spread signal.

20. The method of claim 15, and further comprising the step of determining pilot chips for each of said blocks after said spreading step and before said extending step, said pilot chips being based upon data from said each of said blocks.

21. The method of claim 20, wherein said determining step comprises the step of multiplexing said pilot chips to be equally spaced within said each of said blocks.

22. The method of claim 20, wherein said determining step comprises the step of determining said pilot chips based upon p=A⁻

1(α

g−

Bd), where p is a pilot vector in the time domain, g is a known spreading sequence for channel estimation, d is the sum of spread data of all users, α

is a scalar value based upon data in said blocks, and A and B are sub-matrices derived from Fast Fourier Transform based upon positions of p and g.

23. The method of claim 15, wherein said extending step comprises the step of extracting said predetermined number of chips from a tail portion of each of said blocks for placing in front of said each of said blocks.

24. The method of claim 15, wherein said extending step comprises the step of extracting said predetermined number of chips from a head portion and a tail portion of each of said blocks, said predetermined number of chips from said head portion being placed behind said tail portion and said predetermined number of chips from said tail portion being placed behind said tail portion.

25. The method of claim 15, wherein said extending step comprises the step of inserting said predetermined number of chips as zeros after each of said blocks.

26. The method of claim 15, wherein said extending step comprises the step of inserting said predetermined number of chips as zeros before and after each of said blocks.

27. The method of claim 15, wherein said spreading step comprises the step of combining output from said at least one spreader.

28. The method of claim 15, and further comprising the step of pulse shaping said M×

G spread sequence after said extending step.

29. A code division multiple access (CDMA) system comprising:

at least one CDMA receiver for processing a received signal, said CDMA receiver having;

a sequence extension remover for removing a predetermined number of chips from at least one predetermined position of said received signal to thereby form a modified signal;

an orthogonal transform block, coupled to said sequence extension remover, for transforming said modified signal in a first domain to form a transformed signal in a second domain;

an equalizer block, coupled to said transform block and having a channel estimator, for equalizing said transformed signal to thereby reduce channel distortion and form an equalized signal;

an inverse orthogonal transform block, coupled to said equalizer block, for inverse transforming said equalized signal to form an output in said first domain;

and

a despreader for despreading said output to thereby derive a group of symbols.

30. The CDMA system of claim 29, wherein said at least one predetermined position comprises a front portion of each of one or more blocks of said received signal.

31. The CDMA system of claim 29, wherein said at least one predetermined position comprises a tail portion of each of one or more blocks of said received signal, wherein said sequence extension remover adds said tail portion to a starting portion of said each of one or more blocks, said starting portion having the same number of chips as said tail portion.

32. The CDMA system of claim 29, wherein said at least one predetermined position comprises a head portion and a tail portion of each of one or more blocks of said received signal.

33. The CDMA system of claim 29, wherein said at least one predetermined position comprises a front portion and a tail portion of each of one or more blocks of said received signal, wherein said sequence extension remover adds said tail portion to a portion of said each of one or more blocks, said portion having the same number of chips as said tail portion and starts immediately after said front portion in said each of one or more blocks.

34. The CDMA system of claim 29, wherein said orthogonal transform block comprises a Fast Fourier Transform block, further wherein said first domain is the time domain and said second domain is the frequency domain.

35. The CDMA system of claim 34, wherein said inverse orthogonal transform block comprises an inverse Fast Fourier Transform block.

36. The CDMA system of claim 29, wherein said spread signal comprises a plurality of pilot chips.

37. The CDMA system of claim 36, wherein said spread signal is a transmission to one or more users, said plurality of pilot chips being common to said one or more users.

38. The CDMA system of claim 36, wherein said spread signal is a transmission to one or more users, said plurality of pilot chips being equally spaced within each of one or more blocks of said spread signal.

39. A method for processing a received signal received in a code division multiple access (CDMA) system, said method comprising the steps of:

removing a predetermined number of chips from at least one predetermined position of said received signal to thereby form a modified signal;

orthogonally transforming said modified signal in a first domain to form a transformed signal in a second domain;

equalizing said transformed signal to thereby reduce channel distortion and form an equalized signal;

inverse orthogonally transforming said equalized signal to form an output in said first domain;

and

despreading said output to thereby derive a group of symbols.

40. The method of claim 39, wherein said removing step comprises the step of removing said predetermined number of chips from a front portion of each of one or more blocks of said received signal.

41. The method of claim 39, wherein said removing step comprises the steps of:

removing said predetermined number of chips from a tail portion of each of one or more blocks of said received signal;

and

adding said tail portion to a starting portion of said each of one or more blocks, said starting portion having the same number of chips as said tail portion.

42. The method of claim 39, wherein said removing step comprises the step of removing said predetermined number of chips from a head portion and a tail portion of each of one or more blocks of said received signal.

43. The method of claim 39, wherein said removing step comprises the steps of:

removing said predetermined number of chips from a front portion and a tail portion of each of one or more blocks of said received signal;

and

adding said tail portion to a portion of said each of one or more blocks, said portion having the same number of chips as said tail portion.

44. The method of claim 39, wherein said orthogonally transforming step comprises the step of orthogonally transforming from the time domain as said first domain to the frequency domain as said second domain being.

45. The method of claim 44, wherein said inverse orthogonally transforming step comprises the step of inverse orthogonally transforming from the frequency domain to the time domain.