(Created page with " == Abstract == The Manchester decoding algorithm (MDA) presented in N. Petrochilos and A.J. van der Veen (2004) succeeds in separating secondary surveillance radar (SSR) rep...") |
m (Scipediacontent moved page Draft Content 707452323 to Comon Petrochilos 2006a) |
(No difference)
| |
Latest revision as of 17:51, 3 February 2021
Abstract
The Manchester decoding algorithm (MDA) presented in N. Petrochilos and A.J. van der Veen (2004) succeeds in separating secondary surveillance radar (SSR) replies impinging on an array. The final step of the MDA consist of jointly diagonalizing a collection of several symmetric cubes by a sub-optimal technique. In this article, we demonstrate that it is in fact a PARAFAC problem with an almost symmetric solution. Furthermore, comparisons with other algorithms are carried out, with the help of computer simulation
Original document
The different versions of the original document can be found in:
Back to Top
Document information
Published on 01/01/2006
Volume 2006, 2006
DOI: 10.1109/sam.2006.1706157
Licence: CC BY-NC-SA license
Share this document
claim authorship
Are you one of the authors of this document?