| 1. |
- Melentyev, Oleg, et al.
(författare)
-
Computing the parameters of the discrete channel resulting under frequency hopping in the general case
- 2013
-
Ingår i: Automation and remote control. - 0005-1179 .- 1608-3032. ; 74:7, s. 1128-1131
-
Tidskriftsartikel (refereegranskat)abstract
- We derive expressions for computing the parameters of the resulting discrete channel formed by frequency hopping between an arbitrary number of original channels defined by simple Markov chains for any hopping slot lengths. In obtaining the expressions, we aggregate the graph that described the hopping process. The expressions define transition probabilities of the graph defined by a Markov chain reduced to two states.
|
|
| 2. |
- Shapin, Alexey G., et al.
(författare)
-
An Algorithm for the Exact Packet Error Probability Calculation for Viterbi Decoding
- 2018
-
Ingår i: 2018 14th International Scientific Technical Conference on Actual Problems of Electronic Instrument Engineering (APEIE – 2018) – Proceedings. - : IEEE. ; , s. 282-287
-
Konferensbidrag (refereegranskat)abstract
- The performance of the Viterbi decoding algorithm in a binary symmetric channel is usually estimated by a lower or an upper bounds of a bit error probability. Nowadays, there are expressions for the exact bit error probability estimation for several trivial convolutional codes. However, traffic in modern systems is packetized. Thus, packet error probability is also an important performance metric. Besides, the existed methods could not be used for the task of packet error probability estimation. Therefore this paper presents an algorithm for the calculation of the exact packet error probability for the Viterbi decoding. The algorithm is based on a recurrent search of the cases, which lead to an error free-decoding and then cumulative probabilities of these cases are calculated.
|
|
| 3. |
- Shapin, Alexey G., et al.
(författare)
-
Performance Peculiarities of Viterbi Decoder in Mathworks Simulink, GNU Radio and Other Systems with Likewise Implementation
- 2018
-
Ingår i: 2018 14th International Scientific Technical Conference on Actual Problems of Electronic Instrument Engineering (APEIE – 2018) – Proceedings. - : IEEE. ; , s. 288-292
-
Konferensbidrag (refereegranskat)abstract
- The performance of convolutional codes decoding by the Viterbi algorithm should not depend on the particular distribution of zeros and ones in the input messages, as they are linear. However, it was identified that specific implementations of Add-Compare-Select unit for the Viterbi Algorithm demonstrate the decoding performance that depends on proportion of elements in the input message. It is conjectured that the modern commercial hard- and software defined communication equipment may also feature similar implementation and as such their decoding performance could also vary.
|
|
| 4. |
- Shapin, Alexey, et al.
(författare)
-
Performance Peculiarities of Viterbi Decoder in Mathworks Simulink, GNU Radio and Other Systems with Likewise Implementation
- 2016
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- The performance of convolutional codes decoding by the Viterbi algorithm should not depend on the particular distribution of zeros and ones in the input messages, as they are linear. However, it was identified that specific implementations of Add-Compare-Select unit for the Viterbi Algorithm demonstrate the decoding performance that depends on proportion of elements in the input message. It is conjectured that the modern commercial hard- and software defined communication equipment may also feature similar implementation and as such their decoding performance could also vary.
|
|
