Efficient LDPC Encoding by Rich,Urbanke(Read:07/29/06)
Efficient encoding of low-density parity-check codes[pdf]:-
The Encoding and Decoding operations for LDPC Codes have a complexity of O(N^2).This remarkable paper tries to complete the operations in a linear time.Infact,it has a complexity of 0.017^2* n2,which is linear even for large block lengths n.
A new method called approximate lower triangulation method is used which retains the sparcity of H as very less transformations are performed.Greedy Algorithms are used for finding the approximate lower triangule which gives a good idea of the Greedy Algo.
The Encoding and Decoding operations for LDPC Codes have a complexity of O(N^2).This remarkable paper tries to complete the operations in a linear time.Infact,it has a complexity of 0.017^2* n2,which is linear even for large block lengths n.
A new method called approximate lower triangulation method is used which retains the sparcity of H as very less transformations are performed.Greedy Algorithms are used for finding the approximate lower triangule which gives a good idea of the Greedy Algo.
posted by Chaitanya at 6:26 PM
0 Comments:
Post a Comment
<< Home