Table 2 The types and numbers of operations needed to implement the perfect scrambling (randomly generated), FF soft decoding (BCJR), and FF hard decoding (as perfect scrambling)
| Operations | Perfect scrambling | FF soft | FF hard decoding |
|---|---|---|---|
| (random matrix) | (BCJR) | (perfect scrambling) | |
| Addition | n(n−1) | 2(2t−1)n | n−1 |
| Multiplication | n 2 | 8t n | |
| Division | n | ||
| Logarithm | n |
