IMPULSE ULTRA-WIDEBAND RADIO COMMUNICATION SYSTEM

• US 20090258669A1
• Filed: 04/15/2008
• Published: 10/15/2009
• Est. Priority Date: 04/15/2008
• Status: Active Grant

• Current Assignee: Chengdu Sprouting Technology Co., Ltd.
• Original Assignee: Hong Nie, Zhizhang Chen
• Inventors: Nie, Hong, Chen, Zhizhang
• Granted Patent: US 8,023,571 B2
• Time in Patent Office: Days
• US Class Current: 455/552.100
• CPC Class Codes: H04B 1/71637 Receiver aspects H04B1/7183 takes precedence
• CPC Class Codes: H04B 1/719 Interference-related aspects

Abstract

A method and apparatus are provided for implementing an impulse ultra-wideband communications system which combines the technique of transmitted reference (TR) with a code-sifted reference scheme that separates the reference and the data pulses with a sequence of codes such as a subset of Walsh codes. The combination of the two techniques in ultra-wideband (UWB) radio systems removes the wideband delay elements required by conventional TR UWB systems. The invention provides a system with no analog carriers and lower complexities than other UWB systems, and which has better performances, higher tolerance to nonlinearity, and larger capacities

Claims

1. A method of transmitting and receiving information bits in an ultra-wideband (UWB) radio communication system, comprising:

encoding a reference bit and at least one information bit using shifting codes;

modulating a series of ultra-wideband UWB pulses with modulation amplitudes determined from the encoded reference bit and the at least one encoded information bit;

transmitting the modulated series of UWB pulses as a signal;

receiving the signal; and

decoding the received signal using detection codes.

2. The method of claim 1 wherein modulating a series of wideband pulses with modulation amplitudes comprises:

determining the modulation amplitudes by summing the encoded bits into a sequence of modulating amplitudes; and

modulating the amplitude of the series of UWB pulses using the absolute value of the modulating amplitudes.

3. The method of claim 1 wherein decoding the received signal comprises:

generating a series of signal values by squaring and integrating over time the signal; and

recovering the information bits from the series of signal values.

4. The method of claim 3 wherein recovering the information bits from the series of signal values comprises:

correlating the series of signal values with a series of detection codes; and

determining the information bits from the correlation results.

5. The method of claim 4 wherein encoding at least one information bit comprises directly encoding at least one information bit.

6. The method of claim 5 wherein determining the information bits from the correlation results comprises determining each information bit as the sign of a respective one of the correlation results.

7. The method of claim 6 wherein the shifting codes c_k and the detection codes {tilde over (c)}_k are Walsh codes satisfying the rules

{tilde over (c)}_k=c₀c_k, ∀

kε

{1, 2, . . . , M}, and

c₁c_n≠

{tilde over (c)}_k, ∀

k,l,nε

{1, 2, . . . , M},

where M is the number of information bits in a group, and k, l, and n are integer indices.

8. The method of claim 4 wherein determining the information bits from the correlation results comprises determining which information bits {circumflex over (b)}_jk yield a maximum value of

$\sum _{}^{}$

l = 0 M - 1 

∑

n = l + 1 M 

r ~ jln 

∏

k = l + 1 n 

b ^ jk ,

where j is a group number of information bits, M is the number of information bits within the group, k identifies an information bit within the group, and n and l are indices identifying a particular one of the detection codes used to generate a particular one {tilde over (r)}_ln of the correlation results.

9. The method of claim 8 wherein encoding at least one information bit comprises:

generating processed information bits d_jk as

$d_{\mathrm{jk}}=\underset{i=1}{\overset{k}{\prod <br><br>}}<br><br>b_{\mathrm{jl}}<br><br><br><br>\forall <br><br>k\in <br><br>\left\{1,2,\mathrm{\dots <br><br>}<br><br>,M\right\},$

where b_jl is a raw information bit, j is a group number of information bits, M is the number of information bits within the group, k identifies an information bit within the group, and l is a summation index; and

encoding the processed information bits.

10. The method of claim 9 wherein the shifting codes c_l and the detection codes {tilde over (c)}_ln are Walsh codes satisfying the rules

{tilde over (c)}_ln=c₁c_n, ∀

lε

{0, 1, . . . M−

1} and ∀

nε

{l+1, l+2, . . . M}, and

{tilde over (c)}_ln≠

{tilde over (c)}_pq except l=p and n=q, ∀

l, pε

{0, 1, . . . , M−

1} and ∀

n,qε

{1, 2, . . . , M},

where M is the number of information bits in a group, and l, n, p, and q are integer indices.

11. An ultra-wideband (UWB) radio communication system comprising:

means for generating a series of UWB pulses containing an encoded reference bit and at least one encoded information bit;

a transmitter having an antenna for transmitting the UWB pulses as a signal;

a receiver having an antenna for receiving the signal; and

means for decoding the signal to recover the at least one information bit.

12. The UWB radio communication system of claim 11 wherein the means for generating series of UWB pulses comprise means for encoding the reference bit and the at least one information bit.

13. The UWB radio communication system of claim 12 wherein the means for encoding the reference bit and the at least one information bit comprise:

means for encoding the reference bit and the at least one information bit with a series of shifting codes;

means for summing the encoded bits into a sequence of modulating amplitudes; and

means for modulating the amplitude of a series of UWB pulses using the absolute value of the modulating amplitudes.

14. The UWB radio communication system of claim 13 wherein the means for decoding the signal comprise:

means for squaring and integrating over time the signal to generate a series of signal values;

an information bit detection unit for recovering the information bits from the series of signal values.

15. The UWB radio communication system of claim 14 wherein the information bit detection unit comprises:

means for correlating the series of signal values with a series of detection codes; and

means for determining the information bits from the correlation results.

16. The UWB radio communication system of claim 15 wherein the means for encoding the at least one information bit comprise means for directly encoding the at least one information bit.

17. The UWB radio communication system of claim 16 wherein the means for determining the information bits from the correlation results comprise determining each information bit as the sign of a respective one of the correlation results.

18. The UWB radio communication system of claim 17 wherein the shifting codes c_k and the detection codes {tilde over (c)}_k are Walsh codes satisfying the rules

{tilde over (c)}_k=c₀c_k, ∀

kε

{1, 2, . . . , M}, and

c₁c_n≠

{tilde over (c)}_k, ∀

k,l,nε

{1, 2, . . . , M},

where M is the number of information bits in a group, and k, l, and n are integer indices.

19. The UWB radio communication system of claim 14 wherein the means for determining the information bits from the correlation results comprise determining which information bits {circumflex over (b)}_jk yield a maximum value of

$\sum _{}^{}$

l = 0 M - 1 

∑

n = l + 1 M 

r ~ jln 

∏

k = l + 1 n 

b ^ jk ,

where j is a group number of information bits, M is the number of information bits within the group, k identifies an information bit within the group, and n and l are indices identifying a particular one of the detection codes used to generate a particular one {tilde over (r)}_ln of the correlation results.

20. The UWB radio communication system of claim 17 wherein the shifting codes c_l and the detection codes {tilde over (c)}_ln are Walsh codes satisfying the rules

{tilde over (c)}_ln=c₁c_n, ∀

lε

{0, 1, . . . M−

1} and ∀

nε

{l+1, l+2, . . . M}, and

{tilde over (c)}_ln≠

{tilde over (c)}_pq except l=p and n=q, ∀

l, pε

{0, 1, . . . , M−

1} and ∀

n,qε

{1, 2, . . . , M},

where M is the number of information bits in a group, and l, n, p, and q are integer indices.