|
Problemy Peredachi Informatsii, 1993, Volume 29, Issue 2, Pages 56–63
(Mi ppi176)
|
|
|
|
Methods of Signal Processing
Branch and Bound Method for Design of Recurrent Signal Reception Algorithms
S. A. Belous, D. D. Klovskii
Abstract:
Two algorithms of recurrent-signal reception (for the maximum likelihood metric and that of Fano) are synthesized with the branch and bound technique. These two algorithms require a moderate amount of memory. In their computational performance they are inferior only to the stack-algorithm of Zigangirov.
Received: 09.06.1992
Citation:
S. A. Belous, D. D. Klovskii, “Branch and Bound Method for Design of Recurrent Signal Reception Algorithms”, Probl. Peredachi Inf., 29:2 (1993), 56–63; Problems Inform. Transmission, 29:2 (1993), 147–153
Linking options:
https://www.mathnet.ru/eng/ppi176 https://www.mathnet.ru/eng/ppi/v29/i2/p56
|
Statistics & downloads: |
Abstract page: | 407 | Full-text PDF : | 131 |
|