HIGHLIGHTS
- who: Harpal Maini and colleagues from the University have published the Article: Genetic Algorithms for Soft Decision Decoding of Linear Block Codes, in the Journal: (JOURNAL)
- what: The authors show that this problem is equivalent to the problem of optimizing Walsh polynomials. The authors need to minimize the following objective function for nearest-neighbor decoding: 2 n X j=1 (rj ? cj )=2 n X j=1 (rj ) + n ? 2 2 n X j=1 rj c j: The authors show analyze the time and memory complexity of algorithm GADEC. The authors provide a comparison . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.