US2008069255A1PendingUtilityA1
Efficient Bit Interleaver for A Multi-Band OFDM Ultra-Wideband System
Est. expiryMar 11, 2023(expired)· nominal 20-yr term from priority
H04L 5/0044H03M 13/2707H04L 1/0071H04L 5/0083H04B 1/7176H04L 1/0068H04B 1/719H04L 1/0059H04L 5/0007H04L 5/0042
52
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
An efficient bit interleaving scheme for a multi-band OFDM ultra-wideband (UWB) system. The encoded bits of the multi-band OFDM system are interleaved within each OFDM symbol and across OFDM symbols. The bit interleaving scheme minimizes performance degradation due to groups of contiguous OFDM tones experiencing a poor SNR caused by the frequency selective channel, exploits the frequency diversity across sub-bands, randomizes the effect of co-channel interference from simultaneously operating un-coordinated piconets, and randomizes the impact of generic narrow-band interferers present within the UWB spectrum.
Claims
exact text as granted — not AI-modified1 - 53 . (canceled)
54 . A bit interleaving method comprising the steps of: permuting coded bits of an OFDM symbol stream and generating interleaved OFDM symbols in response thereto; and permuting each group of bits associated with each interleaved OFDM symbol and generating interleaved OFDM tones within each OFDM symbol in response thereto.
55 . The bit interleaving method according to claim 54 , wherein generating interleaved OFDM symbols comprises interleaving OFDM symbols via an interleaver selected from the group consisting of a regular block interleaver, a random interleaver, a random block interleaver, a triangular interleaver, and a composite symbol/tone interleaver.
56 . The bit interleaving method according to claim 54 , wherein generating interleaved OFDM tones comprises interleaving OFDM tones within each OFDM symbol via an interleaver selected from the group consisting of a regular block interleaver, a random interleaver, a random block interleaver, a triangular interleaver, and a composite symbol/tone interleaver.
57 . The bit interleaving method according to claim 54 , wherein generating interleaved OFDM symbols comprises adding pad bits to the OFDM symbol stream sufficient to allow generating a desired number of OFDM symbols whenever the number of incoming OFDM symbol bits is insufficient to accommodate generating the desired number of OFDM symbols.
58 . A bit interleaving method comprising:
permuting coded bits of an OFDM symbol stream and generating interleaved OFDM symbols to implement a desired interleaved OFDM symbol pattern in response thereto; and permuting each group of bits associated with each interleaved OFDM symbol and generating interleaved OFDM tones within each OFDM symbol in response to the desired interleaved OFDM symbol pattern.
59 . The bit interleaving method according to claim 58 , wherein permuting each group of bits associated with each interleaved OFDM symbol and generating interleaved OFDM tones within each OFDM symbol in response to the desired interleaved OFDM symbol pattern is achieved via a plurality of different types of symbol/tone interleaving operations, wherein each type of symbol/tone interleaving operation is determined via the desired interleaved OFDM symbol pattern.
60 . A bit interleaving method comprising:
grouping the coded bits of an OFDM symbol stream into blocks of 3N CBPS , wherein 3 is a desired number of OFDM symbols and further wherein N CBPS is the number of coded bits per symbol; permuting each group of coded bits and generating interleaved OFDM symbols in response thereto only if the coded bits available for grouping correspond to no less than 3 OFDM symbols; grouping the interleaved OFDM symbols into blocks of N CBPS bits; and permuting each block of N CBPS bits associated with the interleaved OFDM symbols and generating interleaved OFDM tones in response thereto.
61 . The bit interleaving method according to claim 60 , wherein N CBPS =100.
62 . The bit interleaving method according to claim 60 , wherein N CBPS =200.
63 . The bit interleaving method according to claim 60 , wherein the desired number of OFDM symbols is 6 and N CBPS =200.
64 . The bit interleaving method according to claim 60 , wherein permuting each group of coded bits and generating interleaved OFDM symbols in response thereto is implemented via a symbol interleaving operation having an input-output relationship defined by
S
(
j
)
=
U
{
Floor
(
i
N
CBPS
)
+
X
Mod
(
i
,
N
CBPS
)
}
,
wherein {U(i)} and {S(j)}, where i, j=0, . . . , XN CBPS , represent the input and output bits of the symbol interleaving operation respectively, and further wherein the function Floor(.) returns the largest integer value less than or equal to its argument value, and further wherein the function Mod(•) returns the remainder after division of N CBPS by i.
65 . The bit interleaving method according to claim 64 , wherein N CBPS =100.
66 . The bit interleaving method according to claim 64 , wherein N CBPS =200.
67 . The bit interleaving method according to claim 69 , wherein the desired number of OFDM symbols is 6 and N CBPS =200.
68 . The bit interleaving method according to claim 60 , wherein permuting each block of N CBPS its associated with the interleaved OFDM symbols and generating interleaved OFDM tones in response thereto comprises permuting each block of N CBPS bits via a tone interleaving operation of size N Tint ×10, wherein N Tint =N CBPS 10, and further wherein 10 is a desired integer value.
69 . The bit interleaving method according to claim 68 , wherein and N Tint =10.
70 . The bit interleaving method according to claim 68 , wherein N Tint =20.
71 . The bit interleaving method according to claim 68 , wherein the tone interleaving operation has an input-output relationship defined by
T
(
j
)
=
S
{
Floor
(
i
N
T
int
)
+
10
Mod
(
i
,
N
T
int
)
}
,
wherein {S(i)} and {T(j)}, where i, j=0, . . . , N CBPS −1 represent the input and output bits of the tone interleaving operation respectively, and further wherein the function Floor(•) returns the largest integer value no greater than it argument value, and further wherein the function Mod(•) returns the remainder after division of N Tint by i.
72 . The bit interleaving method according to claim 71 , wherein N Tint =10.
73 . The bit interleaving method according to claim 71 , wherein N Tint =20.
74 . A bit interleaving method comprising:
grouping the coded bits of an OFDM symbol stream into blocks of 3N CBPS , wherein 3 is a desired number of OFDM symbols and further wherein N CBPS the number of coded bits per symbol, and further wherein pad bits are added to increase the number of bits to correspond to 3N CBPS , whenever the number of coded bits per symbol is less than N CBPS ; permuting each group of coded bits and generating interleaved OFDM symbols in response thereto; grouping the interleaved OFDM symbols into blocks of N CBPS bits; and permuting each block of N CBPS its associated with the interleaved OFDM symbols and generating interleaved OFDM tones in response thereto.
75 . The bit interleaving method according to claim 74 , wherein N CBPS =100.
76 . The bit interleaving method according to claim 74 , wherein N CBPS =200.
77 . The bit interleaving method according to claim 74 , wherein the desired number of OFDM symbols 6 and N CBPS =200.
78 . The bit interleaving method according to claim 74 , wherein the step of permuting each group of coded bits and generating interleaved OFDM symbols in response thereto is implemented via a symbol interleaving operation having an input-output relationship defined by
S
(
j
)
=
U
{
Floor
(
i
N
CBPS
)
+
3
Mod
(
i
,
N
CBPS
)
}
,
wherein {S(i)} and {T(j)}, where i, j=0, . . . , 3N CBPS , represent the input and output bits of the symbol interleaving operation respectively, and further wherein the function Floor(•) returns the largest integer value less than or equal to its argument value, and further wherein the function Mod(•) returns the remainder after division of N CBPS by i.
79 . The bit interleaving method according to claim 74 , wherein permuting each block of N CBPS bits associated with the interleaved OFDM symbols and generating interleaved OFDM tones in response thereto comprises permuting each block of N CBPS bits via a tone interleaving operation of size N Tint ×10, wherein N Tint =t N CBPS /10, and further wherein 10 is a desired integer value.
80 . The bit interleaving method according to claim 79 , wherein desired number of OFDM symbols is 6.
81 . The bit interleaving method according to claim 78 , wherein the tone interleaving operation has an input-output relationship defined by
T
(
j
)
=
S
{
Floor
(
i
N
T
int
)
+
10
Mod
(
i
,
N
T
int
)
}
,
wherein {S(i)} and {T(j)}, where i, j=0, . . . , N CBPS −1 represent the input and output bits of the tone interleaving operation respectively, and further wherein the function Floor(•) returns the largest integer value no greater than it argument value, and further wherein the function Mod(•) returns the remainder after division of N Tint by i.
82 . The bit interleaving method according to claim 68 , wherein and N Tint =10.
83 . The bit interleaving method according to claim 68 , wherein N Tint =20.
84 . A bit interleaver comprising:
a symbol interleaver operational to group the coded bits of a an OFDM symbol stream into blocks of 1200 coded bits, wherein 6 is the desired number of OFDM symbols and further wherein 200 is the number of coded bits per symbol, and further operational to permute each group of coded bits and generate interleaved OFDM symbols in response thereto only if the coded bits available for grouping correspond to no less than 6 OFDM symbols; and a tone interleaver operational to group the interleaved OFDM symbols into blocks of 200 bits and permute each block of 200 bits associated with the interleaved OFDM symbols and generate interleaved OFDM tones in response thereto.
85 . The bit interleaver according to claim 84 , wherein the symbol interleaver is configured to have an input-output relationship defined by
S
(
j
)
=
U
{
Floor
(
i
200
)
+
6
Mod
(
i
,
200
)
}
,
wherein {S(i)} and {T(j)}, where i, j=0, . . . , 1199, represent the input and output bits of the symbol interleaver respectively, and further wherein the function Floor(•) returns the largest integer value less than or equal to its argument value, and further wherein the function Mod(•) returns the remainder after division of 200 by i.
86 . The bit interleaver according to claim 84 , wherein the tone interleaver is configured to have an input-output relationship defined by
T
(
j
)
=
S
{
Floor
(
i
N
T
int
)
+
10
Mod
(
i
,
N
T
int
)
}
,
wherein {S(i)} and {T(j)}, where i, j=0, . . . , 199 represent the input and output bits of the tone interleaver respectively, and further wherein the tone interleaver size=N Tint ×10, N Tint =20 and 10 is a desired integer value, and further wherein the function Floor(•) returns the largest integer value no greater than it argument value, and further wherein the function Mod(•) returns the remainder after division of N Tint By i.
87 . The bit interleaving method according to claim 71 , wherein N Tint =10.
88 . The bit interleaving method according to claim 71 , wherein N Tint =20.
89 . A composite bit interleaver operational to group the coded bits of an OFDM symbol stream into blocks of 1200 coded bits, wherein 6 is the desired number of OFDM symbols and further wherein 200 is the number of coded bits per symbol, and further operational to permute each group of coded bits and generate interleaved OFDM symbols in response thereto only if the coded bits available for grouping correspond to no less than 6 OFDM symbols; and further operational to group the interleaved OFDM symbols into blocks of 200 its and permute each block of 200 bits associated with the interleaved OFDM symbols and generate interleaved OFDM tones in response thereto.
90 . The composite bit interleaver according to claim 89 , wherein the symbol interleaving operation is defined via an input-output relationship according to
S
(
j
)
=
U
{
Floor
(
i
200
)
+
6
Mod
(
i
,
200
)
}
,
wherein {S(i)} and {T(j)}, where i, j=0, . . . , 1199, represent the input and output bits of the symbol interleaving operation respectively, and further wherein the function Floor(•) returns the largest integer value less than or equal to its argument value, and further wherein the function Mod(•) returns the remainder after division of 200 by i.
91 . The composite bit interleaver according to claim 89 , wherein the tone interleaving operation is defined via an input-output relationship according to
T
(
j
)
=
S
{
Floor
(
i
N
T
int
)
+
10
Mod
(
i
,
N
T
int
)
}
,
wherein {S(i)} and {T(j)}, where i, j=0, . . . , 199 represent the input and output bits of the tone interleaving operation respectively, and further wherein the tone interleaver size=N Tint ×10, N Tint =20 and 10 is a desired integer value, and further wherein the function Floor(•) returns the largest integer value no greater than it argument value, and further wherein the function Mod(•) returns the remainder after division of N Tint by i.
91 . A composite bit interleaver operational to group the coded bits of an OFDM symbol stream into blocks of 1200 coded bits, wherein 6 is the desired number of OFDM symbols, N CBPS is the number of coded bits per symbol, and pad bits are used to increase the number of bits to correspond to 6 OFDM symbols whenever the number of coded bits per symbol is less than N CBPS , and to permute each group of coded bits and generate interleaved OFDM symbols in response thereto; and further operational to group the interleaved OFDM symbols into blocks of 200 bits and permute each block of 200 bits associated with the interleaved OFDM symbols and generate interleaved OFDM tones in response thereto.
92 . The composite bit interleaver according to claim 91 , wherein the symbol interleaving operation is defined via an input-output relationship according to
S
(
j
)
=
U
{
Floor
(
i
200
)
+
10
Mod
(
i
,
200
)
}
,
wherein {S(i)} and {T(j)}, where i, j=0, . . . , 1199, represent the input and output bits of the symbol interleaving operation respectively, and further wherein the function Floor(•) returns the largest integer value less than or equal to its argument value, and further wherein the function Mod(•) returns the remainder after division of 200 by i.
93 . The composite bit interleaver according to claim 91 , wherein the tone interleaving operation is defined via an input-output relationship according to
T
(
j
)
=
S
{
Floor
(
i
N
T
int
)
+
10
Mod
(
i
,
N
T
int
)
}
,
wherein {S(i)} and {T(j)}, where i, j=0, . . . , N CBPS −1 represent the input and output bits of the tone interleaving operation respectively, and further wherein the tone interleaver size=N Tint ×A, N Tint =20 and 10 is a desired integer value, and further wherein the function Floor(•) returns the largest integer value no greater than it argument value, and further wherein the function Mod(•) returns the remainder after division of N Tint by i.
94 . The bit interleaving method according to claim 93 , wherein N Tint =10.
95 . The bit interleaving method according to claim 93 , wherein N Tint =20.Join the waitlist — get patent alerts
Track US2008069255A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.