https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Comon_Petrochilos_2006aComon Petrochilos 2006a - Revision history2026-04-23T14:02:00ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Comon_Petrochilos_2006a&diff=205033&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 707452323 to Comon Petrochilos 2006a2021-02-03T15:51:53Z<p>Scipediacontent moved page <a href="/public/Draft_Content_707452323" class="mw-redirect" title="Draft Content 707452323">Draft Content 707452323</a> to <a href="/public/Comon_Petrochilos_2006a" title="Comon Petrochilos 2006a">Comon Petrochilos 2006a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 15:51, 3 February 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Comon_Petrochilos_2006a&diff=205032&oldid=prevScipediacontent: 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..."2021-02-03T15:51:50Z<p>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..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
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<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://hal.univ-reims.fr/hal-01693645 https://hal.univ-reims.fr/hal-01693645]<br />
<br />
* [http://xplorestaging.ieee.org/ielx5/11178/36018/01706157.pdf?arnumber=1706157 http://xplorestaging.ieee.org/ielx5/11178/36018/01706157.pdf?arnumber=1706157],<br />
: [http://dx.doi.org/10.1109/sam.2006.1706157 http://dx.doi.org/10.1109/sam.2006.1706157]<br />
<br />
* [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000001706157 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000001706157],<br />
: [https://hal.univ-reims.fr/hal-01693645 https://hal.univ-reims.fr/hal-01693645],<br />
: [https://academic.microsoft.com/#/detail/2165003818 https://academic.microsoft.com/#/detail/2165003818]</div>Scipediacontent