Abstract
In non-cooperative communication systems, the effective recognition by intercepted bitstream at the 3rd-party receiver is an important mission for military or security purposes. However, the existing recognition schemes lead to long latency and significant hardware due to the large number of traversal operations. Hence, the spectra update algorithm (SUA) is proposed by analyzing the differences between the adjacent reconstructed matrices. Compared with the spectra calculations available like the Galois field Fourier transform (GFFT) and simplified-GFFT (S-GFFT), the presented algorithm reduces the computational complexity to 2/ <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> and 2/λ without performance loss, respectively, where <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> is the code length and λ is the cardinality of the conjugacy class of the corresponding Galois fields. Besides, a reduced-complexity RS recognizer architecture is designed and analyzed to show the effectiveness of the proposed SUA.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
