Table 3 Average number of tested matrices before finding a solution (between round brackets: number of spreading matrices in the considered search space and number of solutions within this search space), for different codes and search algorithms
From: Optimizing quasi-cyclic spatially coupled LDPC codes by eliminating harmful objects
Code | \(m_s\) | MIHAO | Exhaustive search | Smart exhaustive search | Minimum overlapping [29] |
|---|---|---|---|---|---|
Array (3, 5) | 1 | \(\textbf{21}\) | 328 (\(2^{15}\)/100) | 211 (16807/80) | No solution (1000/0) |
Tanner (3, 5) | 2 | \(\textbf{1350}\) | 4227 (\(3^{21}\)/–) | 1709 (\(19^7\)/\(\ge {673}\)) | 2358 (9261000/3928) |
Array (3, 7) | 1 | \(\textbf{14}\) | 58 (\(2^{15}\)/570) | 32 (16807/540) | 23 (1000/45) |
Tanner (3, 7) | 2 | \(\textbf{5292}\) | 18396 (\(3^{21}\)/–) | 12493 (\(19^7\)/–) | 5941 (9261000/–) |