US6385752B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for puncturing a convolutionally encoded bit stream
Assignee: Apple Inc
•
Filing: 1999-06-01
•
Granted: 2002-05-07
•
Expires: 2019-06-01
Abstract
Abstract An improved method of puncturing a convolutionally encoded bit stream is provided. Assuming that the convolutionally encoded bit stream has been encoded at rate k/n, puncturing is performed in clusters of n-bit consecutive bits each, these clusters being evenly distributed throughout the encoded bit stream. Improved puncturing matrices are provided for the specific examples consisting of PCS-4 and PCS-5, these being encoding schemes provided in accordance with the EDGE standard.
Inventors
- 👤 Diana D. Li
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 18:33
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/03; H03M13/23
Claims Analysis
Total Claims: 34
Claim 1
Independent Claim
82 words
A method of puncturing a convolutionally encoded bit stream, the convolutionally encoded bit stream comprising an input bit stream which has been convolutionally encoded at a coding rate of k/n to produce the convolutionally encoded bit stream such that for each k-bit block of data to be encoded, an n-bit block in the convolutionally encoded bit stream is produced, where k>=1, and n>k, the method comprising: puncturing the convolutionally encoded bit stream in only clusters of n consecutive bits each, where n≧3.
Claim 2
Independent Claim
82 words
A method of puncturing a convolutionally encoded bit stream, the convolutionally encoded bit stream comprising an input bit stream which has been convolutionally encoded at a coding rate of k/n to produce the convolutionally encoded bit stream such that for each k-bit block of data to be encoded, an n-bit block in the convolutionally encoded bit stream is produced, where k>=1, and n>k, the method comprising: puncturing the convolutionally encoded bit stream in only clusters of n consecutive bits each, where n≧3.
Claim 3
Dependent Claim
62 words
A method according to claim 1 wherein puncturing the convolutionally encoding data is done for input blocks of L bits; and said step of puncturing the convolutionally encoded data in clusters of n-bits each comprises puncturing sufficient bits such that the input blocks of L bits are reduced in size to M bits, where M is a required block size for interleaving.
Claim 4
Dependent Claim
16 words
A method according to claim 2 wherein the clusters are equally spaced through each L-bit block.
Claim 5
Dependent Claim
10 words
A method according to claim 2 wherein L=2306 and M=1384.
Claim 6
Dependent Claim
10 words
A method according to claim 2 wherein L=2422 and M=1384.
Claim 7
Dependent Claim
10 words
A method according to claim 2 wherein L=2076 and M=1384.
Claim 8
Dependent Claim
8 words
A method according to claim 1 wherein k=1.
Claim 9
Independent Claim
96 words
A method of puncturing a convolutionally encoded bit stream, the convolutionally encoded bit stream comprising an input bit stream which has been convolutionally encoded at a coding rate of k/n to produce the convolutionally encoded bit stream such that for each k-bit block of data to be encoded, an n-bit block in the convolutionally encoded bit stream is produced, where k>=1, and n>k, the method comprising: puncturing the convolutionally encoded bit stream in only clusters of n consecutive bits each, wherein each said cluster is aligned with a respective one of said k-bit blocks of bits.
Claim 10
Independent Claim
96 words
A method of puncturing a convolutionally encoded bit stream, the convolutionally encoded bit stream comprising an input bit stream which has been convolutionally encoded at a coding rate of k/n to produce the convolutionally encoded bit stream such that for each k-bit block of data to be encoded, an n-bit block in the convolutionally encoded bit stream is produced, where k>=1, and n>k, the method comprising: puncturing the convolutionally encoded bit stream in only clusters of n consecutive bits each, wherein each said cluster is aligned with a respective one of said k-bit blocks of bits.
Claim 11
Dependent Claim
18 words
A method according to claim 2 wherein said clusters are equally spaced through the convolutionally encoded bit stream.
Claim 12
Independent Claim
183 words
A method of puncturing a convolutionally encoded bit stream, the convolutionally encoded bit stream comprising an input bit stream which has been convolutionally encoded at a coding rate of k/n to produce the convolutionally encoded bit stream such that for each k-bit block of data to be encoded, an n-bit block in the convolutionally encoded bit stream is produced, where k>=1, and n>k, the method comprising: puncturing the convolutionally encoded bit stream in only clusters of n consecutive bits each, for input blocks of L bits, wherein L=2306 and sufficient bits are punctured so that the input blocks of L bits are reduced in size to M bits, where M is a required block size for interleaving and M=1384, each L-bit block contains bit locations 0, 1, . . . , 2305 and a puncturing matrix is defined by P(n)=1, ∀n except for n=10k+4, 10K+5, 10k+8, 10k+9, kε0, . . ,229, and n=2304, 2305 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 13
Independent Claim
183 words
A method of puncturing a convolutionally encoded bit stream, the convolutionally encoded bit stream comprising an input bit stream which has been convolutionally encoded at a coding rate of k/n to produce the convolutionally encoded bit stream such that for each k-bit block of data to be encoded, an n-bit block in the convolutionally encoded bit stream is produced, where k>=1, and n>k, the method comprising: puncturing the convolutionally encoded bit stream in only clusters of n consecutive bits each, for input blocks of L bits, wherein L=2306 and sufficient bits are punctured so that the input blocks of L bits are reduced in size to M bits, where M is a required block size for interleaving and M=1384, each L-bit block contains bit locations 0, 1, . . . , 2305 and a puncturing matrix is defined by P(n)=1, ∀n except for n=10k+4, 10K+5, 10k+8, 10k+9, kε0, . . ,229, and n=2304, 2305 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 14
Dependent Claim
21 words
A method according to claim 10 for application in an EDGE PCS-5 encoding scheme except for modifications to the puncturing matrix.
Claim 15
Independent Claim
184 words
A method of puncturing a convolutionally encoded bit stream, the convolutionally encoded bit stream comprising an input bit stream which has been convolutionally encoded at a coding rate of k/n to produce the convolutionally encoded bit stream such that for each k-bit block of data to be encoded, an n-bit block in the convolutionally encoded bit stream is produced, where k>=1, and n>k, the method comprising: puncturing the convolutionally encoded bit stream in only clusters of n consecutive bits each, for input blocks of L bits, wherein L=2422 and sufficient bits are punctured such that the input blocks of L bits are reduced in size to M bits, where M is a required block size for interleaving and M=1384, each L-bit block contains bit locations 0, 1, . . . , 2421 and a puncturing matrix is defined by P(n)=1, ∀n except for n=14k+2, 14k+3, 14k+6, 14k+7, 14k+10, 14k+11, kε0, . . . , 172 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 16
Independent Claim
184 words
A method of puncturing a convolutionally encoded bit stream, the convolutionally encoded bit stream comprising an input bit stream which has been convolutionally encoded at a coding rate of k/n to produce the convolutionally encoded bit stream such that for each k-bit block of data to be encoded, an n-bit block in the convolutionally encoded bit stream is produced, where k>=1, and n>k, the method comprising: puncturing the convolutionally encoded bit stream in only clusters of n consecutive bits each, for input blocks of L bits, wherein L=2422 and sufficient bits are punctured such that the input blocks of L bits are reduced in size to M bits, where M is a required block size for interleaving and M=1384, each L-bit block contains bit locations 0, 1, . . . , 2421 and a puncturing matrix is defined by P(n)=1, ∀n except for n=14k+2, 14k+3, 14k+6, 14k+7, 14k+10, 14k+11, kε0, . . . , 172 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 17
Dependent Claim
21 words
A method according to claim 12 for application in an EDGE PCS-5 encoding scheme except for modifications to the puncturing matrix.
Claim 18
Independent Claim
182 words
A method of puncturing a convolutionally encoded bit stream, the convolutionally encoded bit stream comprising an input bit stream which has been convolutionally encoded at a coding rate of k/n to produce the convolutionally encoded bit stream such that for each k-bit block of data to be encoded, an n-bit block in the convolutionally encoded bit stream is produced, where k>=1, and n>k, the method comprising: puncturing the convolutionally encoded bit stream in only clusters of n consecutive bits each, for input blocks of L bits, wherein L=2076 and sufficient bits are punctured such that the input blocks of L bits are reduced in size to M bits, where M is a required block size for interleaving and M=1384, each L-bit block contains bit locations 0, 1, . . . , 2075 and a puncturing matrix is defined by P(n)=1, ∀n except for n=12k+2, 12k+3, 12k+8, 12k+9, kε0, . . . , 172 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 19
Independent Claim
182 words
A method of puncturing a convolutionally encoded bit stream, the convolutionally encoded bit stream comprising an input bit stream which has been convolutionally encoded at a coding rate of k/n to produce the convolutionally encoded bit stream such that for each k-bit block of data to be encoded, an n-bit block in the convolutionally encoded bit stream is produced, where k>=1, and n>k, the method comprising: puncturing the convolutionally encoded bit stream in only clusters of n consecutive bits each, for input blocks of L bits, wherein L=2076 and sufficient bits are punctured such that the input blocks of L bits are reduced in size to M bits, where M is a required block size for interleaving and M=1384, each L-bit block contains bit locations 0, 1, . . . , 2075 and a puncturing matrix is defined by P(n)=1, ∀n except for n=12k+2, 12k+3, 12k+8, 12k+9, kε0, . . . , 172 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 20
Dependent Claim
21 words
A method according to claim 14 for application in an EDGE PCS-4 encoding scheme except for modifications to the puncturing matrix.
Claim 21
Independent Claim
59 words
An apparatus comprising: a transmission mask circuit which punctures bits from L-bit blocks so as to produce M-bit blocks, where L,M are integers and M<L; a puncturing matrix memory defining a series of bit locations to be punctured by the transmission mask circuit, the bit locations to puncture consisting of clusters of n consecutive bit locations each where n>=2.
Claim 22
Independent Claim
59 words
An apparatus comprising: a transmission mask circuit which punctures bits from L-bit blocks so as to produce M-bit blocks, where L,M are integers and M<L; a puncturing matrix memory defining a series of bit locations to be punctured by the transmission mask circuit, the bit locations to puncture consisting of clusters of n consecutive bit locations each where n>=2.
Claim 23
Dependent Claim
12 words
An apparatus according to claim 16 wherein the clusters are equally spaced.
Claim 24
Dependent Claim
28 words
An apparatus according to claim 17 further comprising: a convolutional encoder for encoding an input bit stream at a rate k/n, where k,n are integers, k≧1, and k<n.
Claim 25
Dependent Claim
17 words
An apparatus according to claim 18 further comprising an interleaver for performing interleaving on Said M-bit blocks.
Claim 26
Dependent Claim
64 words
A TDMA (time division multiple access) transmitter comprising: a convolutional encoder for encoding an input bit stream at a rate k/n to produce an encoded bit stream; a puncturing circuit which punctures bits from L-bit blocks of said encoded bit stream in clusters of n consecutive bit locations where n≧2 to produce M-bit blocks; and an interleaver for performing interleaving on said M-bit blocks.
Claim 27
Dependent Claim
64 words
A TDMA (time division multiple access) transmitter comprising: a convolutional encoder for encoding an input bit stream at a rate k/n to produce an encoded bit stream; a puncturing circuit which punctures bits from L-bit blocks of said encoded bit stream in clusters of n consecutive bit locations where n≧2 to produce M-bit blocks; and an interleaver for performing interleaving on said M-bit blocks.
Claim 28
Dependent Claim
38 words
A transmitter according to claim 20 wherein the convolutional encoder encodes k-bit blocks of data to produce n-bit blocks of data, and wherein each said cluster is aligned with a respective one of said k-bit blocks of bits.
Claim 29
Dependent Claim
130 words
A TDMA (time division multiple access) transmitter comprising: a convolutional encoder for encoding an input bit stream at a rate k/n to produce an encoded bit stream; a puncturing circuit which punctures bits from L-bit blocks of said encoded bit stream in clusters of n consecutive bit locations where n >2 to produce M-bit blocks; and an interleaver for performing interleaving on said M-bit blocks, wherein each L-bit block contains bit locations 0,1, . . . , 2421 and a puncturing matrix is defined by P(n)=1, ∀n except for n=14k+2, 14k+3, 14k+6, 14k+7, 14k+10, 14k+11, kε0, . . . , 172 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 30
Dependent Claim
130 words
A TDMA (time division multiple access) transmitter comprising: a convolutional encoder for encoding an input bit stream at a rate k/n to produce an encoded bit stream; a puncturing circuit which punctures bits from L-bit blocks of said encoded bit stream in clusters of n consecutive bit locations where n >2 to produce M-bit blocks; and an interleaver for performing interleaving on said M-bit blocks, wherein each L-bit block contains bit locations 0,1, . . . , 2421 and a puncturing matrix is defined by P(n)=1, ∀n except for n=14k+2, 14k+3, 14k+6, 14k+7, 14k+10, 14k+11, kε0, . . . , 172 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 31
Dependent Claim
127 words
A TDMA (time division multiple access) transmitter comprising: a convolutional encoder for encoding an input bit stream at a rate k/n to produce an encoded bit stream; a puncturing circuit which punctures bits from L-bit blocks of said encoded bit stream in clusters of n consecutive bit locations where n ≧2 to produce M-bit blocks; and an interleaver for performing interleaving on said M-bit blocks, wherein each L-bit block contains bit locations 0,1, . . . , 2075 and a puncturing matrix is defined by P(n)=1, ∀n except for n=12k+2, 12k+3, 12k+8, 12k+9, kε0, . . ., 172 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 32
Dependent Claim
127 words
A TDMA (time division multiple access) transmitter comprising: a convolutional encoder for encoding an input bit stream at a rate k/n to produce an encoded bit stream; a puncturing circuit which punctures bits from L-bit blocks of said encoded bit stream in clusters of n consecutive bit locations where n ≧2 to produce M-bit blocks; and an interleaver for performing interleaving on said M-bit blocks, wherein each L-bit block contains bit locations 0,1, . . . , 2075 and a puncturing matrix is defined by P(n)=1, ∀n except for n=12k+2, 12k+3, 12k+8, 12k+9, kε0, . . ., 172 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 33
Dependent Claim
131 words
A TDMA (time division multiple access) transmitter comprising: a convolutional encoder for encoding an input bit stream at a rate k/n to produce an encoded bit stream; a puncturing circuit which punctures bits from L-bit blocks of said encoded bit stream in clusters of n consecutive bit locations where n ≧2 to produce M-bit blocks; and an interleaver for performing interleaving on said M-bit blocks, wherein each L-bit block contains bit locations 0,1, . . . , 2305 and a puncturing matrix is defined by P(n)=1, ∀n except for n=10k+4, 10k+5, 10k+8, 10k+9, kε0, . . . , 229, and n=2304, 2305 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
Claim 34
Dependent Claim
131 words
A TDMA (time division multiple access) transmitter comprising: a convolutional encoder for encoding an input bit stream at a rate k/n to produce an encoded bit stream; a puncturing circuit which punctures bits from L-bit blocks of said encoded bit stream in clusters of n consecutive bit locations where n ≧2 to produce M-bit blocks; and an interleaver for performing interleaving on said M-bit blocks, wherein each L-bit block contains bit locations 0,1, . . . , 2305 and a puncturing matrix is defined by P(n)=1, ∀n except for n=10k+4, 10k+5, 10k+8, 10k+9, kε0, . . . , 229, and n=2304, 2305 where P(n)=0 where P(n)=1 means the nth bit location in the L-bit block is not punctured and P(n)=0 means the nth bit location in the L-bit block is punctured.
References Cited (Backward Citations)
US5438590A
Cited
EP0643510A1
Cited
US5511082A
Cited
US5668820A
Cited
US6170076B1
Cited
US6209116B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-05-06 | 2005-11-05 | 2006-05-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-05-06 | 2009-11-05 | 2010-05-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-05-06 | 2013-11-05 | 2014-05-07 | $7700.00 | Window Closed / Lapsed |