Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Kamil Zigangirov"'
Autor:
Rolf Johannesson, Kamil Zigangirov
In this chapter, the LDPC block codes, which were invented by Robert Gallager and appeared in his thesis, are discussed. Then they are generalized to LDPC convolutional codes, which were invented by the second author and his graduate student Alberto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb224c3b3cbe0e3c3ea49354107e8ed2
https://doi.org/10.1002/9781119098799.ch8
https://doi.org/10.1002/9781119098799.ch8
Autor:
Rolf Johannesson, Kamil Zigangirov
Publikováno v:
Fundamentals of Convolutional Coding
From the Publisher: Convolutional codes, among the main error control codes, are routinely used in applications for mobile telephony, satellite communications, and voice-band modems. Written by two leading authorities in coding and information theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47ede10349260da1fcd57d79970b886b
https://doi.org/10.1002/9781119098799.fmatter
https://doi.org/10.1002/9781119098799.fmatter
Autor:
Kamil Zigangirov, Rolf Johannesson
This chapter reviews general descriptions and analyses of important decoding algorithms for convolutional codes. The Viterbi algorithm that outputs the codeword maximizing the probability of the received sequence conditioned on the information sequen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e01923c4938eacf01c5925689edf2178
https://doi.org/10.1002/9781119098799.ch4
https://doi.org/10.1002/9781119098799.ch4
Autor:
Rolf Johannesson, Kamil Zigangirov
This chapter derives various random ensemble bounds for decoding error probability. The decoding error probability of the Viterbi decoding algorithm is analyzed for convolutional codes but only for the ensemble of time-varying convolutional codes. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4249620d039a29b29d014abcfc9c4098
https://doi.org/10.1002/9781119098799.ch5
https://doi.org/10.1002/9781119098799.ch5
Publikováno v:
Electronic Notes in Discrete Mathematics. 6:123-131
New upper bounds for the bit and burst error probabilities are derived for the case, when a fixed convolutional code is used for communication over the binary symmetric channel (BSC) and the decoder performs maximum likelihood decoding. These bounds
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1b3ebeb4a3b4902bfa74d8ee9e27717
https://doi.org/10.1016/s1571-0653(04)00163-5
https://doi.org/10.1016/s1571-0653(04)00163-5
Autor:
A. Jimenez Felstrom, Kamil Zigangirov
Publikováno v:
IEEE Transactions on Information Theory. 45:2181-2191
We present a class of convolutional codes defined by a low-density parity-check matrix and an iterative algorithm for decoding these codes. The performance of this decoding is close to the performance of turbo decoding. Our simulation shows that for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab8c15cd659cb952d261e2476f2ba1c5
https://doi.org/10.1109/18.782171
https://doi.org/10.1109/18.782171
Autor:
L. Wilhelmsson, Kamil Zigangirov
Publikováno v:
IEEE Transactions on Information Theory. 43:707-711
A coding-decoding strategy for the noiseless T-user q-ary multiple-access channel is presented where no cooperation between the users is needed, neither in the code construction nor in the decoding process. Statistics for the received symbols as a fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b09d9f152a09af94a41323ea9eedce3
https://doi.org/10.1109/18.556127
https://doi.org/10.1109/18.556127
Autor:
Alexandre Graell i Amat, Daniel J. Costello, Joerg Kliewer, Kamil Zigangirov, Francesca Vatta, Christian Koller
It has been widely observed that there exists a fundamental trade-off between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. While capacity achieving code ensembles typically are asympto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76812c120e9cb5dd401672922822670d
https://hdl.handle.net/11368/2634772
https://hdl.handle.net/11368/2634772
Publikováno v:
ISIT
We consider an ensemble of systematic low-density parity-check (LDPC) codes of length N with linear encoding complexity, i.e., with complexity O(N). We call these codes partially-regular, since they can be considered as modifications of regular LDPC
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f26c792232e93c8648571a0c02f9ec4b
https://doi.org/10.1109/isit.2011.6034184
https://doi.org/10.1109/isit.2011.6034184