Systems and processes for decoding a chain reaction code through inactivation
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H03M-005/00
출원번호
UP-0842102
(2007-08-20)
등록번호
US-7633413
(2009-12-24)
발명자
/ 주소
Shokrollahi, M. Amin
Lassen, Soren
Karp, Richard
출원인 / 주소
QUALCOMM Incorporated
대리인 / 주소
Albert, Phillip H.
인용정보
피인용 횟수 :
34인용 특허 :
21
초록▼
A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an atte
A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
대표청구항▼
What is claimed is: 1. In a chain reaction code communication system wherein an encoder generates a plurality of multi-stage output symbols that are check symbols and generates a plurality of source symbols, wherein each of the check symbols is associated with one or more source symbols, the check
What is claimed is: 1. In a chain reaction code communication system wherein an encoder generates a plurality of multi-stage output symbols that are check symbols and generates a plurality of source symbols, wherein each of the check symbols is associated with one or more source symbols, the check symbols associated with one or more source symbols referred to as check symbols of degree one or higher, wherein at least one check symbol is associated with at least two source symbols, the check symbols associated with two or more source symbols referred to as check symbols of degree two or higher, and wherein at least one source symbol is marked as active, a method for processing the chain reaction code, comprising: (i) selecting one of the active source symbols associated with a check symbol of degree two or higher; and (ii) deactivating the selected source symbol associated with a check symbol of degree two or higher. 2. The method of claim 1, wherein a transmitter transmits the one or more source symbols to a receiver, the method further comprising: inferring, at a decoder at the receiver, the check symbols without having to receive them from the transmitter; and using the inferred check symbols to check that the one or more source symbols were received correctly. 3. In a decoder for decoding input symbols from output symbols, wherein output symbols are generated at an encoder for source symbols derived from the input symbols and check symbols associated with source symbols, wherein a degree of a check symbol is the number of source symbols associated with that check symbol and the degree of check symbols can be one or more than one, a method of decoding comprising: receiving output symbols and check symbols; marking source symbols as active to indicate that it is to be decoded from received output symbols and check symbols; marking at least one of the active source symbols that is associated with a check symbol of degree two or higher as an inactive source symbol; decoding, in part, the received source symbols, by decoding the active source symbols; determining a process for decoding the inactive source symbols; and decoding the inactive source symbols. 4. The method of claim 3, wherein the check symbols are generated according to a parity code. 5. The method of claim 3, wherein the check symbols are generated according to an LDPC code. 6. In a decoder for decoding source symbols from output symbols, wherein output symbols are generated at an encoder derived from the source symbols, wherein a degree of an output symbol is the number of source symbols associated with that output symbol, a method of decoding comprising: (i) receiving a first set of output symbols; (ii) recovering source symbols from the output symbols contained in the first set of output symbols; (iii) deactivating one or more unrecovered source symbols associated with an output symbol of degree two or higher thereby reducing the degree of any output symbol associated with a deactivated source symbol by one; (iv) repeating steps (ii) and (iii) until all of the output symbols in the first set of output symbols have been used; and (v) decoding the source symbols that have been deactivated. 7. The method of claim 6 further comprising: (vi) determining if all of the source symbols have been recovered; (vii) requesting a second set of output symbols if it is determined that not all of the source symbols have been recovered; (viii) receiving a second set of output symbols; and (ix) repeating steps (ii)-(viii) on the second set of output symbols until all of the source symbols have been recovered. 8. The method of claim 6 further comprising: (vi) receiving a second set of output symbols; and (vii) merging the second set of output symbols into the first set of output symbols. 9. The method of claim 8 wherein steps (vi) and (vii) occur substantially concurrently with steps (ii)-(v). 10. The method of claim 9 wherein steps (ii)-(vii) repeat until all of the source symbols have been recovered. 11. In a decoder that receives multi-stage output symbols, wherein the multi-stage output symbols are generated at an encoder derived from output symbols and check symbols, wherein the output symbols are generated at an encoder derived from source symbols, wherein a degree of an output symbol is the number of source symbols associated with that output symbol, wherein the degree of a check symbol is the number of source symbols associated with that check symbol, a method of decoding comprising: (i) receiving a first set of multi-stage output symbols wherein at least one of the multi-stage output symbols in the first set of multi-stage output symbols comprises a check symbol and at least one of the multi-stage output symbols in the first set of output symbols comprises an output symbol; (ii) recovering source symbols from the output symbols contained in the first set of multi-stage output symbols; (iii) deactivating one or more unrecovered source symbols associated with an output symbol of degree two or higher thereby reducing the degree of any output symbol associated with a deactivated source symbol by one; (iv) repeating steps (ii) and (iii) until all of the output symbols in the first set of output symbols have been used; (v) decoding the source symbols that have been deactivated; and (vi) recovering check symbols from the check symbols in the first set of multi-stage output symbols. 12. The method of claim 11 further comprising: (vii) determining if all of the source symbols have been recovered; (viii) requesting a second set of multi-stage output symbols if it is determined that not all of the source symbols have been recovered; (ix) receiving a second set of multi-stage output symbols; and (x) repeating steps (ii)-(ix) on the second set of multi-stage output symbols until all of the source symbols have been recovered. 13. The method of claim 12 further comprising: (xi) repeating steps (ii)-(ix) on the second set of multi-stage output symbols until all of the check symbols have been recovered. 14. The method of claim 11 further comprising: (vii) receiving a second set of multi-stage output symbols; and (viii) merging the second set of multi-stage output symbols into the first set of multi-stage output symbols. 15. The method of claim 14 wherein steps (vii) and (viii) occur substantially concurrently with steps (ii)-(vi). 16. The method of claim 15 wherein steps (ii)-(viii) repeat until all of the source symbols have been recovered. 17. The method of claim 16 wherein steps (ii)-(viii) repeat until all of the check symbols have been recovered. 18. The method of claim 15 wherein step (vi) can be interrupted in favor of step (ii) if new output symbols containing source symbols are received.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (21)
Gemmell, David James, Data carousel receiving and caching.
Shokrollahi,M. Amin, Error-correcting multi-stage code generator and decoder for communication systems having single transmitters or multiple transmitters.
Watson, Mark; Luby, Michael G., Code generator and decoder for communications systems operating using hybrid codes to allow for multiple efficient uses of the communications systems.
Luby, Michael G.; Pakzad, Payam; Shokrollahi, Mohammad Amin; Watson, Mark; Vicisano, Lorenzo, Encoding and decoding using elastic codes with flexible source block mapping.
Luby, Michael G.; Watson, Mark; Vicisano, Lorenzo; Pakzad, Payam; Wang, Bin, Enhanced block-request streaming using block partitioning or request controls for improved client-side handling.
Shokrollahi, M. Amin, Error-correcting multi-stage code generator and decoder for communication systems having single transmitters or multiple transmitters.
Luby, Michael G.; Shokrollahi, Mohammad Amin; Minder, Lorenz Christoph, Methods and apparatus employing FEC codes with permanent inactivation of symbols for encoding and decoding processes.
Luby, Michael G.; Shokrollahi, Mohammad Amin; Minder, Lorenz Christoph, Methods and apparatus employing FEC codes with permanent inactivation of symbols for encoding and decoding processes.
Luby, Michael G.; Shokrollahi, Mohammad Amin; Minder, Lorenz Christoph, Methods and apparatus employing FEC codes with permanent inactivation of symbols for encoding and decoding processes.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.