Subdimensional single-carrier modulation

• US 6,778,611 B1
• Filed: 08/31/2000
• Issued: 08/17/2004
• Est. Priority Date: 08/31/1999
• Status: Expired due to Term

• Current Assignee: Avago Technologies International Sales Pte Limited (Broadcom, Inc.)
• Original Assignee: Broadcom Corporation (Broadcom, Inc.)
• Inventors: Ungerboeck, Gottfried
• Primary Examiner(s): Le, Amanda T.
• Application Number:
  US09/652,721
• Time in Patent Office: 1,447 Days
• Field of Search: 375/285, 375/296, 375/346, 375/348, 375/350, 375/232, 375/233
• US Class Current: 375/285
• CPC Class Codes: H04L 2025/03375 Passband transmission
• CPC Class Codes: H04L 2025/03477 not time-recursive
• CPC Class Codes: H04L 25/03038 with a non-recursive structure H04L25/03031 takes precedence
• CPC Class Codes: H04L 25/03343 Arrangements at the transmitter end
• CPC Class Codes: H04L 25/49 using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems spectral shaping H04L25/03828
• CPC Class Codes: H04L 27/3405 Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power

Abstract

A method for modulating a sequence of data symbols such that the transmit signal exhibits spectral redundancy. Null symbols are inserted in the sequence of data symbols such that a specified pattern of K data symbols and N-K null symbols is formed in every period of N symbols in the modulated sequence, N and K being positive integers and K being smaller than N.

Claims

1. A method for modulating a sequence of data symbols such that the modulated sequence has spectral redundancy, the method comprising the operation of:

inserting null symbols in the sequence of data symbols such that a specified pattern of K data symbols and N-K null symbols is formed in every period of N symbols in the modulated sequence, N and K being positive integers and K being smaller than N, wherein positions of the K data symbols within every period of N symbols are defined by an index set.

2. The method of claim 1 wherein K is equal to N−

1.

3. The method of claim 2 wherein a null symbol is inserted as a last symbol in every period of N symbols in the modulated sequence.

4. The method of claim 1 wherein the specified pattern has K consecutive data symbols and N-K null symbols.

5. The method of claim 1 wherein said specified pattern is replaced by a second pattern, the specified pattern defining a K-dimensional subspace of the N-dimensional signal space, the second pattern specifying a rotated version of said K-dimensional subspace, the rotation being obtained by transforming N-dimensional signal vectors in said K-dimensional subspace by an N×

N unitary matrix.

6. The method of claim 1 wherein the specified pattern of K data symbols and N-K null symbols in every period of N symbols in the modulated sequence does not exhibit a subperiod.

7. The method of claim 1 wherein N is a prime number.

8. The method of claim 1 wherein the positions of the K data symbols within every period of N symbols are defined by an index set ψ

={k₀, k₁, . . . , k<sub>K−

1</sub>}, the index set ψ

being included in the set {0, 1, 2, . . . , N−

1}, and wherein the index set ψ

is a proper set.

9. The method of claim 1 wherein the index set is equal to {k_i=iΔ

modN, i=0,1,2, . . . , K−

1}, Δ

being an integer, and wherein the greatest common divisor of Δ and

N is 1.

10. The method of claim 1 further comprising the operation of:

filtering the modulated sequence to produce notches in spectrum of the modulated sequence at predetermined frequency bands, the notches having an aggregate bandwidth of less than or equal to ((N-K)/N)×

(1/T), where 1/T is the Nyquist bandwidth.

11. The method of claim 1 further comprising the operation of:

filtering the modulated sequence using a transmit filter to produce a transmit signal; and

transmitting the transmit signal over a transmission channel.

12. The method of claim 11 wherein the transmit filter is a raised cosine filter.

13. The method of claim 11 wherein the transmission channel has disturbances causing at least one notch in the spectrum of the transmit signal as received at a receiver.

14. The method of claim 13 wherein an aggregate bandwidth of notches caused by disturbances in the transmission channel and of notches already existing in the spectrum of the transmit signal before transmission is less than or equal to ((N-K)/N)×

(1/T), where 1/T is the Nyquist bandwidth.

15. A method for processing a receive sequence, the receive sequence corresponding to a modulated sequence having a specified pattern of K data symbols and N-K null symbols within every period of N symbols, the positions of the K data symbols within every period of N symbols being defined by an index set, N and K being positive integers and K being smaller than N, the method comprising the operation of:

equalizing the receive sequence using a time-varying equalizer having K sets of coefficients, each of the K sets of coefficients being used periodically and in accordance with the index set, to produce an equalized receive sequence.

16. The method of claim 15 further comprising the operations of:

receiving at a receive filter a receive analog signal corresponding to said modulated sequence via a communication channel; and

sampling an output of the receive filter to produce the receive sequence.

17. The method of claim 16 wherein the receive analog signal has spectral notches having an aggregate bandwidth of less than or equal to ((N-K)/N)×

(1/T), where 1/T is the Nyquist bandwidth, and wherein the equalized receive sequence is substantially free of intersymbol interference.

18. The method of claim 15 wherein the operation of equalizing comprises:

swapping each of the K sets of coefficients in and out of a plurality of buffers, in accordance with the index set, to be used periodically to equalize the receive sequence, the K sets of coefficients being stored in said plurality of buffers.

19. A system for modulating a sequence of data symbols such that the modulated sequence has spectral redundancy, the system comprising:

a modulator for inserting null symbols in the sequence of data symbols such that a specified pattern of K data symbols and N-K null symbols is formed in every period of N symbols in the modulated sequence, N and K being positive integers and K being smaller than N, wherein the positions of the K data symbols within every period of N symbols are defined by an index set; and

a transmit filter for filtering the modulated sequence to produce a transmit signal.

20. The system of claim 19 wherein K is equal to N−

1.

21. The system of claim 20 wherein the modulator inserts a null symbol as a last symbol in every period of N symbols in the modulated sequence.

22. The system of claim 19 wherein the specified pattern has K consecutive data symbols and N-K null symbols.

23. The system of claim 19 wherein the modulator uses a second pattern instead of said specified pattern, the specified pattern defining a K-dimensional subspace of the N-dimensional signal space, the second pattern specifying a rotated version of said K-dimensional subspace, the rotation being obtained by transforming N-dimensional signal vectors in said K-dimensional subspace by an N×

N unitary matrix.

24. The system of claim 19 wherein the specified pattern of K data symbols and N-K null symbols in every period of N symbols in the modulated sequence does not exhibit a subperiod.

25. The system of claim 19 wherein N is a prime number.

26. The system of claim 19 wherein the positions of the K data symbols within every period of N symbols are defined by an index set ψ

={k₀, k₁, . . . , k<sub>K−

1</sub>}, the index set ψ

being included in the set {0, 1, 2, . . . , N−

1}, and wherein the index set ψ

is a proper set.

27. The system of claim 19 wherein the index set is equal to {k_i=iΔ

modN, i=0,1,2, . . . , K−

1}, Δ

being an integer, and wherein the greatest common divisor of Δ and

N is 1.

28. The system of claim 19 further comprising:

a notch filter for filtering the modulated sequence to produce notches in spectrum of the modulated sequence at predetermined frequency bands, the notches having an aggregate bandwidth of less than or equal to ((N-K)/N)×

(1/T), where 1/T is the Nyquist bandwidth.

29. The system of claim 19 wherein the transmit filter is coupled to a transmission channel to transmit the transmit signal.

30. The system of claim 29 wherein the transmit filter is a raised cosine filter.

31. The system of claim 29 wherein the transmission channel has disturbances causing at least one notch in the spectrum of the transmit signal as received at a receiver.

32. The system of claim 31 wherein an aggregate bandwidth of notches caused by disturbances in the transmission channel and of notches already existing in the spectrum of the transmit signal before transmission is less than or equal to ((N-K)/N)×

(1/T), where 1/T is the Nyquist bandwidth.

33. A system for processing a receive sequence, the receive sequence corresponding to a modulated sequence having a specified pattern of K data symbols and N-K null symbols within every period of N symbols in the modulated sequence, positions of the K data symbols within every period of N symbols being defined by an index set, N and K being positive integers and K being smaller than N, the system comprising:

a receive filter configured to receive an analog signal associated with the receive sequence; and

a time-varying equalizer having K sets of coefficients for equalizing the receive sequence, each of the K sets of coefficients being used periodically and in accordance with the index set.

34. The system of claim 33 further comprising

a sampler sampling an output of the receive filter and producing the receive sequence.

35. The system of claim 34 wherein the receive analog signal has spectral notches having an aggregate bandwidth of less than or equal to ((N-K)/N)×

(1/T), where 1/T is the Nyquist bandwidth, and wherein the time-varying equalizer produces an output substantially free of intersymbol interference.

36. The system of claim 33 wherein the K sets of coefficients are stored in a plurality of buffers, each of the K sets of coefficients being swapped in and out of said plurality of buffers, in accordance with the index set, to be used periodically to equalize the receive sequence.