THE SYMBOL-BY-SYMBOL DECODING ALGORITHMS FOR BASIC FOURIER SIGNALS

L. E. Nazarov, M. A. Sheglov

Kotel'nikov Institute of Radio Engineering and Electronics RAS, Fryazino Brunch, Vvedensky Sq. 1, Fryazino Moscow region, 141120, Russia

 

The paper is received on January 31, 2017

 

Abstract. The symbol-by-symbol decoding algorithms (optimal and suboptimal, coherent and noncoherent) for orthogonal basic Fourier signals are presented in the article. The base of these algorithms is Fast Fourier Transformation and Fast Hadamard Transformation. The suboptimal decoding algorithms are simpler than optimal decoding algorithms concerning their complexity.

Key words: symbol-by-symbol, digital signals, FFT, FHT.

References

1. Fink L.M. Teoriya peredachi discretnykh soobschenii. [The theory of discrete message transmission]. Moscow, Sov. Radio Publ. 1970. (In Russian).

2. Vitrbi A.D., Omura D.K. Principy cifrovoy svyasi i kodirovania [Principles of Digital Communication and Coding]. Moscow, Radio I Svyaz Publ. 1982. (In Russian).

3. Piterson W., Weldon E. Kody ispravlyachie oshibki. [Error-corecting Codes]. Moscow, Mir. 1976. (In Russian).

4. Smolyaninov V.M., Nazarov L.E. Spectral analysis features for detection of discrete signals based on the binary codes. // Radiotechnika I elektronika - Journal of Communications Technology and Electronics, 1987, Vol. 32, No. 11, pp.2341-2347. (In Russian).

5. Hartmann C.R., Rudolph L.D. An optimum symbol-by-symbol decoding rule for linear codes. //IEEE Transactions on Information Theory. 1976. V.22. N5. P.514-517. DOI: 10.1109/TIT.1976.1055617.

6. Bahl L.R., Cocke J., Jelinek F., Raviv J. Optimal decoding of linear codes for minimizing symbol error rate. // IEEE Transactions on Information Theory. 1974. V.IT-20. N3. P.284-287. DOI: 10.1109/TIT.1974.1055186.

7. Johnson S.J. Iterative Error Correction: Turbo, Low-density Parity-Check and Repeat-Accumulate Codes. Cambrige University Press. 2010.

8. Smolyaninov V.M., Nazarov L.E. The application of Fast Hadamard Transformation for symbol-by-symbol decoding of linear codes. // Radiotechnika I elektronika - Journal of Communications Technology and Electronics, 1997, Vol. 42, No. 10, pp.1214-1219. (In Russian).

9. Nazarov L.E. Effective algorithms for optimal symbol-by-symbol decoding signals, based on linear codes. // Radiotechnika I elektronika - Journal of Communications Technology and Electronics, 1999, Vol. 44, No. 9, pp.1116-1119. (In Russian).

10. Akhmed N., Rao K.R. Ortogonalnye preobrazovaniya pri tsifrovoy obrabotke signalov. [Orthogonal transformations in digital signal processing]. Moscow: Svyaz Publ. 1980. 248 p. (In Russian).

11. Trahtman A.M., Trahtman V.A. Osnovy diskretnich signalov na konecnich intervalah. [The base of discrete signals on constrained intervals]. Moscow: Svyaz Publ.. 1975. (In Russian).

12. Nazarov L.E., Shishkin P.V., Batanov V.V. Algorithms for noncoherent iterative reception of signals based on serial turbo codes and Walsh signals during transmission over nonstationary channels. // Journal of Communications Technology and Electronics, 2016, Vol. 61, No. 4, pp.414-423. DOI: 10.1134/S1064226916040082.

13. Nazarov L.E., Shishkin P.V. The error-performances of orthogonal signal symbol-by-symbol noncoherent decoding. Zhurnal radioelectroniki - Journal of Radio Electronics, 2016, No. 5 (In Russian) Available at http://jre.cplire.ru/may16/5/text.pdf.

For citation:
L. E. Nazarov, M. A. Sheglov. M. W. The symbol-by-symbol decoding algorithms for basic Fourier signals. Zhurnal Radioelektroniki - Journal of Radio Electronics, 2017, No. 2. Available at http://jre.cplire.ru/jre/feb17/2/text.pdf. (In Russian)