US2007061690A1PendingUtilityA1

Block puncturing for turbo code based incremental redundancy

Assignee: MOTOROLA INCPriority: Oct 22, 2001Filed: Jul 5, 2006Published: Mar 15, 2007
Est. expiryOct 22, 2021(expired)· nominal 20-yr term from priority
H04L 1/0066H04L 1/0069H04L 1/1819
50
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A method of block puncturing for turbo code based incremental redundancy includes a first step ( 1200 ) of coding an input data stream into systematic bits and parity bits. A next step ( 1202 ) includes loading the systematic bits and parity bits into respective systematic and parity block interleavers in a column-wise manner. A next step ( 1204 ) includes selecting a predefined redundancy. A next step ( 1206 ) includes outputting bits from the block interleavers in a row-wise manner in accordance with the selected predefined redundancy.

Claims

exact text as granted — not AI-modified
1 . (canceled)  
   
   
       2 . (canceled)  
   
   
       3 . (canceled)  
   
   
       4 . (canceled)  
   
   
       5 . (canceled)  
   
   
       6 . (canceled)  
   
   
       7 . (canceled)  
   
   
       8 . (canceled)  
   
   
       9 . (canceled)  
   
   
       10 . (canceled)  
   
   
       11 . (canceled)  
   
   
       12 . (canceled)  
   
   
       13 . (canceled)  
   
   
       14 . (canceled)  
   
   
       15 . (canceled)  
   
   
       16 . (canceled)  
   
   
       17 . (canceled)  
   
   
       18 . (canceled)  
   
   
       19 . (canceled)  
   
   
       20 . (canceled)  
   
   
       21 . A method of bit priority mapping a turbo codeword, the method comprising the steps of: 
 associating predefined disjoint areas of an array with differing bit reliability positions offered by a constellation;    loading the punctured systematic turbo codeword bits and punctured parity turbo codeword bits into the array, giving higher priority to one set of bits when loading a predefined disjoint area; and    continuously gathering bits from all distinct disjoint areas to form a symbol.    
   
   
       22 . The method of  claim 21 , wherein: 
 the number of rows in the array is log 2 (M) where M is the constellation order;    sets of rows are associated with bit reliability positions offered by a constellation;    data is read out of the array on a column wise basis each column wholly associated with one modulated symbol.

Join the waitlist — get patent alerts

Track US2007061690A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.