Lyubomir Laskov
ABSTRACT
This paper presents a study and results from the effectiveness of the convolutional codes with code rate 1/2 and constrained lengths 7, 8 and 9. The dependencies of the bit error probability at the output of the Viterbi decoder from the generator polynomials have been studied. The obtained most efficient codes and their basic parameters are given. The dependences of the BER at the output of the Viterbi decoder from the Eb/No ratio at the receiver input for these codes have been studied. An analysis of the possibilities for increasing radio channel noise immunity when using concatenated coding with Reed-Solomon and newly proposed convolutional codes instead of the codes used in the DVB-S standard is performed.
- ETSI EN 300 421 V1.1.2,1997, Digital Video Broadcasting (DVB). Framing Structure, Channel Coding and Modulation for 11/12 GHz Satellite Services., Sophia Antipolis, France.Google Scholar
- B. Sklar. 2001. Digital Communication. Fundamentals and Applications. Prentice Hall, New Jersey, USA.Google Scholar
- R. Johannesson and K. Sh. Zigangirov. 2015. Fundamentals of Convolutional Coding (2nd ed.). John Wiley & Sons, New Jersey, USA. Google ScholarDigital Library
- P. Sweeney. 2002. Error Control Coding, From Theory to Practice. John Wiley & Sons, Chichester, United Kingdom. Google ScholarDigital Library
- K. Larsen (1973). Short Convolutional Codes with Maximal Free Distance for rates 1/2, 1/3 and 1/4. IEEE Transactions ON Information Theory, May 1973, pp. 371 -- 372 Google ScholarDigital Library
- M. Connor, L. Perez and D. Costello (1993). Search for Optimal Distance Spectrum Convolutional Codes. Presented at the 4-th Annum Argonne Symposium for Undergraduates in Science, Engineering, and Mathematics, 6 November 1993, USA.Google Scholar
- S. B. Wicker. 1994. Error Control Systems for Digital Communication and Storage. Prentice-Hall, New Jersey, USA. Google ScholarDigital Library
- ETSI ETR 290, 1997, Digital Video Broadcasting (DVB); Measurement Guidelines for DVB Systems., Sophia Antipolis, France.Google Scholar
- B. Золотарев и Г. Овечнин. 2004. Помехоусмоŭчuво кобuровaнuе. Memo∂ьl u aпѕoрumмьl Cправочник. Горячая линия, Mосква, Россия.Google Scholar
- Дж. Прокис. 2000. Цuфровая Cвязь. Радио и Связь, Mосква, Россия.Google Scholar
- J. M. Cioffi, EE 379B, Digital Communication II: Coding, chapter 10, http://web.stanford.edu/group/cioffi/doc/book/chap10.pdfGoogle Scholar
Recommendations
Soft Convolutional Codes Decoding Algorithm for Concatenated Codes in Visible Light Communication
In this paper, we propose a new decoding algorithm for soft convolutional codes and concatenated codes in visible light communication (VLC) systems. RLL codes are used to control the dimming in VLC since each codeword has same 1s and 0s, hard RLL ...
Deriving Good LDPC Convolutional Codes from LDPC Block Codes
Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper, we discuss several graph-cover-based methods for deriving families of time-invariant and time-...
Pseudocodeword performance analysis for LDPC convolutional codes
Message-passing iterative decoders for low-density parity-check (LDPC) block codes are known to be subject to decoding failures due to so-called pseudocodewords. These failures can cause the large signal-to-noise ratio (SNR) performance of message-...
Comments