-
Notifications
You must be signed in to change notification settings - Fork 9
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Application Scenario #4
Comments
Yes, it support long length. I construct up to 800000 code length. Soon article about long length code construction shall be publish. Time for construction depend from circulant, protograph size and cycles constraint (cycles size, EMD). Before define cycle constrains better to check balance cycle (voltage graph) which define girth Upper bound, to applied reasonable parameters on Girth and EMD. For some even large circulant QC extension with desire cycle properties Couldn't exist. Use parallel run with different seed as I describe in article. Current it SA one of the best way to construct long length QC-LDPC codes. With BR Vasiliy! |
Dear Vasiliy, thanks for your kind response. Because it is difficult to determine reasonable values of EMD and Girth in SA algorithm, I would like to ask you how to check balance cycle. Would you like to tell me the related references or paper? Thanks!!! |
Dear Victor, |
Dear Vasiliy,
I would like to ask if such algorithm support the QC-LDPC construction in term of a base matrix with long length? For example, I want to construct a long length LDPC code whose column number is 10^6. Firstly, I construct a base matrix whose column number is 5*10^4 according to optimized degree distribution with PEG algorithm. Thus, the size of circulant permutation matrix is 20. Or the number of column of base matrix is 1000, the size of circulant permutation matrix is 1000. Then, the exponent matrix of QC-LDPC is constructed by "Simulated-annneling-lifting-QC-LDPC" algorithm. When I'm using such algorithm to construct long QC-LDPC code, It takes a lots of time.
Best Regards
Victor Chou
The text was updated successfully, but these errors were encountered: