IST-4-027756 WINNER II D6.13.12 v1.0 Final CG “local area ...
IST-4-027756 WINNER II D6.13.12 v1.0 Final CG “local area ...
IST-4-027756 WINNER II D6.13.12 v1.0 Final CG “local area ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>WINNER</strong> <strong>II</strong> <strong>D6.13.12</strong> <strong>v1.0</strong>Additionally, a parity check matrix for R = 1/3 BLDPCC is also provided, but this code is not ratecompatiblewith other rates at the moment. For the DBTC the following compatible code rates can beobtained through puncturing:⎧12 1 4 2 3 4 6 ⎫R = ⎨ , , , , , , , ⎬(5.2)⎩35 2 7 3 4 5 7 ⎭Both the BLDPCC and DBTC have their advantages and disadvantages, but their performance vs.decoding complexity is not a sufficient metric to take the final choice, since more implementation aspectswould need to be taken into account. Further complexity comparison can be found in appendix F.2 from[WIND210]. Besides, Table 5.1 from [WIND210] summarises the proposed FEC techniques with respectto their performance, memory requirements, decoding complexity and maturity 3 .Table 5.1: Comparison of the most promising FEC techniques [WIND210]CC 4 DBTC BLDPCCPerformance 5 Short blocks -