Figure 1.
Figure 2.
Figure 3.
Figure 4.
Figure 5.
Figure 6.
Figure 7.
Figure 8.
Memory overhead Analysis
| Decoding algorithm | Memory overhead |
|---|---|
| RNN-BP | N(log2 N + 1) = 448 |
| CS-BF | N(log2N + 1) + ωTmax = 736 |
| CNN-Tree-MBF | 2IN(log2 N + 1) + Tmax + K + 0.3M ≈ 0.3M |
| CA-SCL | N + 3NL – L = 1592 |
| Proposed | N(log2N + 1) + ωTmax = 469 |
Computational Complexity Analysis
| Decoding algorithm | Multiplication |
|---|---|
| RNN-BP | 2INlog2 N = 3840 |
| CS-BF | 2INlog2 NTavg =144080 |
| CNN-Tree-MBF | 2INlog2NTavg + 9.8M × TCNN |
| CA-SCL | |
| Proposed | 0 |
Simulation parameter
| Set options | Value |
|---|---|
| Test platform | Tensorflow1.8.0 |
| Encoding | (64,32) |
| CRC Generator Polynomial | x6+x5+1 |
| Training codeword | 7.8×104 |
| Testing codeword | 3.4×103 |
| Batch_size | 3600 |
| Loss function | Cross entropy |
| Optimizer | Adam |