Ivan M. Onyszchuk

dblp:122/1411 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Coding theory · 100%
Computer networks
2 papers
Physical-layer communications · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
convolutional codes
0.021993
Quantization loss in convolutional decoding · IEEE Trans. Commun. 1993
Truncation length for Viterbi decoding · IEEE Trans. Commun. 1991
Coding theory › source coding
quantization
0.011993
Quantization loss in convolutional decoding · IEEE Trans. Commun. 1993
Coding theory › error-correcting codes › decoding
soft-decision decoding
0.011993
Quantization loss in convolutional decoding · IEEE Trans. Commun. 1993
Coding theory › decoder design
decoder implementation
0.011991
Truncation length for Viterbi decoding · IEEE Trans. Commun. 1991
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding
0.011991
Truncation length for Viterbi decoding · IEEE Trans. Commun. 1991
Physical-layer communications › modulation › phase-shift keying
BPSK
0.011993
Quantization loss in convolutional decoding · IEEE Trans. Commun. 1993
Physical-layer communications
modulation
0.011993
Quantization loss in convolutional decoding · IEEE Trans. Commun. 1993
Physical-layer communications › channel modeling › gaussian channel
AWGN channel
0.011991
Truncation length for Viterbi decoding · IEEE Trans. Commun. 1991
Physical-layer communications › error probability analysis
bit error rate analysis
0.011991
Truncation length for Viterbi decoding · IEEE Trans. Commun. 1991

Methods — techniques the papers use, named apart from their topics

viterbi decoding · 0.0cutoff rate analysis · 0.0BER bound analysis · 0.0
YearPublicationVenuePosition
1993 Quantization loss in convolutional decoding
abstract
The loss in quantizing coded symbols in the additive white Gaussian noise (AWGN) channel with binary phase-shift keying (BPSK) or quadrature phase-shift keying (QPSK) modulation is discussed. A quantization scheme and branch metric calculation method are presented. For the uniformly quantized AWGN channel, cutoff rate is used to determine the step size and the smallest number of quantization bits needed for a given bit-signal-to-noise ratio (E/sub b//N/sub 0/) loss. A nine-level quantizer is presented, along with 3-b branch metrics for a rate-1/2 code, which causes an E/sub b//N/sub 0/ loss of only 0.14 dB. These results also apply to soft-decision decoding of block codes. A tight upper bound is derived for the range of path metrics in a Viterbi decoder. The calculations are verified by simulations of several convolutional codes, including the memory-14, rate-1/4 or -1/6 codes used by the big Viterbi decoders at JPL.>
Ivan M. Onyszchuk, Kar-Ming Cheung, Oliver Collins
IEEE Trans. Commun.1
1991 Truncation length for Viterbi decoding
abstract
A bound is derived and analyzed for the bit error rate (BER) of a Viterbi decoder with survivor truncation. Estimates of the SNR (signal-to-noise ratio) loss on the AWGN (additive white Gaussian noise) channel due to truncation are obtained for convolutional codes. Larger truncation lengths are required than the smallest value that does not effectively decrease the code's free distance, especially at low E/sub b//N/sub 0/.>
Ivan M. Onyszchuk
IEEE Trans. Commun.1