why LDCP didn't use earlie ?

[byakuya]

i have read an article about LDPC.

i've read that LDPC has found over 35 years ago, but it's forgotten because computational demand for simulation can't be found at that time.

but we know that LDPC has less computational / less complexity than other codes, for example Reed Solomon.
How come, LDPC can't be implemented at that time, but Reed Solomon can be applied? what's the factor?
can anyone answer for something that is confused me? :?

thank you

 

[zorro]

i've read that LDPC has found over 35 years ago, but it's forgotten because computational demand for simulation can't be found at that time.

You should change the word "simulation" by "decoding".

but we know that LDPC has less computational / less complexity than other codes, for example Reed Solomon.

Are you sure? The success of codes like Reed Solomon is because their structure allows combination of good performance with reasonably low decoding complexity.
Regards

Z

 

[byakuya]

But i've read in some reference, that (binary / gallager) LDPC has lower complexity than the other. But this condition also depend on the application.

Can anyone help me why LDPC can't be implemented in the past but Reed Solomon is chosen. Whereas, LDPC often use nowaday and compete with Turbo Code..
I thought it has correlation with application...

please give me an explanation about it..

thank you