Abstract
A description of the algorithm for optimal symbol-by-symbol reception of signal structures based on block noise-resistant codes in non-binary Galois fields is given. It is shown that the basis of this algorithm is the fast spectral transformation algorithm in the Walsh–Hadamard basis with the dimension of the Galois field. It is shown that the resulting complexity of the analyzed character-by-character reception algorithm is determined by the dimension of the dual code, which determines the prospects of its application for block noise-resistant codes with a high code rate (with low redundancy). The results of modeling a character-by-symbol reception algorithm are presented in order to study noise immunity for a number of frequency-efficient digital signals with quadrature-amplitude and amplitude-phase manipulations (with frequency coefficient efficiencies of 3, 4 and 6 bps/Hz) in combination with a parity check code. It is shown that the use of a symbol-by-symbol reception algorithm provides an energy gain of up to 1.5...3.0 dB in relation to the transmission and reception of the considered series of signals without coding.
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.
