US2012054572A1PendingUtilityA1

Method and Apparatus for Delta Data Storage

Assignee: ANDERSEN JAKOB BAEKGAARDPriority: Apr 24, 2009Filed: Apr 24, 2009Published: Mar 1, 2012
Est. expiryApr 24, 2029(~2.7 yrs left)· nominal 20-yr term from priority
H04L 1/1845H04L 1/1812
29
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Various methods for implementing delta data storage, for example, within a hybrid automatic repeat request (HARQ) buffer, are provided. One example method includes receiving a redundancy version including a plurality of redundancy version bits and soft combining the redundancy version bits with corresponding buffered bits to generate corresponding soft combined bits. The example method further includes comparing the soft combined bits with the corresponding buffered bits to identify changed bits and unchanged bits, storing the changed bits in a buffer to thereby replace the buffered bits that correspond to the changed bits. Similar example apparatuses are also provided.

Claims

exact text as granted — not AI-modified
1 .- 20 . (canceled) 
     
     
         21 . A method comprising:
 receiving a redundancy version including a plurality of redundancy version bits;   soft combining the redundancy version bits with corresponding buffered bits to generate corresponding soft combined bits;   comparing the soft combined bits with the corresponding buffered bits to identify changed bits and unchanged bits; and   storing the changed bits in a buffer to thereby replace the buffered bits that correspond to the changed bits.   
     
     
         22 . The method of  claim 21 , wherein receiving the redundancy version includes receiving the redundancy version in response to an implementation of a hybrid automatic repeat request (HARQ). 
     
     
         23 . The method of  claim 21 , wherein comparing the soft combined bits with the corresponding buffered bits to identify changed bits and unchanged bits includes setting a value of the unchanged bits to a neutral value and discarding the unchanged bits having the neutral value. 
     
     
         24 . The method of  claim 21 , wherein receiving the redundancy version includes receiving the redundancy version in response to an implementation of a hybrid automatic repeat request (HARQ); and wherein storing the changed bits includes storing the changed bits in an external HARQ buffer. 
     
     
         25 . The method of  claim 21 , wherein receiving the redundancy version includes receiving the redundancy version in response to an implementation of a hybrid automatic repeat request (HARQ); and wherein storing the changed bits includes storing the changed bits in an internal HARQ buffer. 
     
     
         26 . The method of  claim 21 , wherein soft combining the redundancy version bits with corresponding buffered bits to generate the corresponding soft combined bits includes soft combining to generate the corresponding soft combined bits, the soft combined bits being probability values indicative of whether a respective coded bit is a one or a zero. 
     
     
         27 . An apparatus comprising:
 at least one processor,   at least one memory including computer program code,   the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to at least:
 receive a redundancy version including a plurality of redundancy version bits; 
 soft combine the redundancy version bits with corresponding buffered bits to generate corresponding soft combined bits; 
 compare the soft combined bits with the corresponding buffered bits to identify changed bits and unchanged bits; and 
 store the changed bits in a buffer to thereby replace the buffered bits that correspond to the changed bits. 
   
     
     
         28 . The apparatus of  claim 27 , wherein the apparatus caused to receive the redundancy version includes being caused to receive the redundancy version in response to an implementation of a hybrid automatic repeat request (HARQ). 
     
     
         29 . The apparatus of  claim 27 , wherein the apparatus caused to compare the soft combined bits with the corresponding buffered bits to identify changed bits and unchanged bits includes being caused to set a value of the unchanged bits to a neutral value and discard the unchanged bits having the neutral value. 
     
     
         30 . The apparatus of  claim 27 , wherein the apparatus caused to receive the redundancy version includes being caused to receive the redundancy version in response to an implementation of a hybrid automatic repeat request (HARQ); and wherein the apparatus caused to store the changed bits includes being caused to store the changed bits in all external HARQ buffer. 
     
     
         31 . The apparatus of  claim 27 , wherein the apparatus caused to receive the redundancy version includes being caused to receive the redundancy version in response to an implementation of a hybrid automatic repeat request (HARQ); and wherein the apparatus caused to store the changed bits includes being caused to store the changed bits in an internal HARQ buffer. 
     
     
         32 . The apparatus of  claim 27 , wherein the apparatus caused to soft combine the redundancy version bits with corresponding buffered bits to generate the corresponding soft combined bits includes being caused to soft combine to generate the corresponding soft combined bits, the soft combined bits being probability values indicative of whether a respective coded bit is a one or a zero. 
     
     
         33 . A computer program product comprising a computer-readable medium bearing computer program code embodied therein for use with a computer, the computer program code comprising:
 code for receiving a redundancy version including a plurality of redundancy version bits;   code for soft combining the redundancy version bits with corresponding buffered bits to generate corresponding soft combined bits;   code for comparing the soft combined bits with the corresponding buffered bits to identify changed bits and unchanged bits; and   code for causing the changed bits to be stored in a buffer to thereby replace the buffered bits that correspond to the changed bits.   
     
     
         34 . The computer program product of  claim 33 , wherein receiving the redundancy version include receiving the redundancy version in response to an implementation of a hybrid automatic repeat request (HARQ). 
     
     
         35 . The computer program product of  claim 33 , wherein comparing the soft combined bits with the corresponding buffered bits to identify changed bits and unchanged bits include setting a value of the unchanged bits to a neutral value and discard the unchanged bits having the neutral value. 
     
     
         36 . The computer program product of  claim 33 , wherein receiving the redundancy version include receiving the redundancy version in response to an implementation of a hybrid automatic repeat request (HARQ); and wherein storing the changed bits include storing the changed bits in an external HARQ buffer. 
     
     
         37 . The computer program product of  claim 33 , wherein receiving the redundancy version include receiving the redundancy version in response to an implementation of a hybrid automatic repeat request (HARQ); and wherein causing the changed bits to be stored include causing the changed bits to be stored in an internal HARQ buffer. 
     
     
         38 . The computer program product of  claim 33 , wherein the soft combined bits being probability values indicative of whether a respective coded bit is a one or a zero.

Join the waitlist — get patent alerts

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

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