Talk:Low-density parity-check code: Difference between revisions

Revision as of 17:39, 28 July 2018

Revision as of 19:45, 28 July 2018

Line 267:

The part about seeing an LDPC as independent SPC codes and using SOVA or BCJR is confusing. I believe it tries to draw an analogy between turbo codes or convolutional codes and LDPC codes. It currently has no reference and the only references I could find on applying those algorithms to LDPC were in really specific constructions with structured codes or concatenations.

The part about lookup table has no reference either. I have no doubt that a bit flipping algorithm can run on a low power CPU and that some computations can be avoided by using a lookup table (for the check nodes computations for example). But I am not sure that this is what the author meant and if this is what was meant I don't see how it is relevant to detail the lookup table and the usage of the FIFO. <!-- Template:Unsigned --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by

[[User:Bpcov|Bpcov]] ([[User talk:Bpcov#top|talk]] • [[Special:Contributions/Bpcov|contribs]]) 1719:3844, 28 July 2018 (UTC)</small> <!--Autosigned by SineBot-->