Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Vladimir Parizhsky

dblp:118/6872 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1996
—ORCID · none

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

Computer networks · 1 · 1 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.

Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding		 0.011996
Simplified trellis decoder · IEEE Trans. Commun. 1996
Physical-layer communications › channel coding › error control coding
convolutional codes		 0.011996
Simplified trellis decoder · IEEE Trans. Commun. 1996
Physical-layer communications › channel coding › error control coding › channel decoding
decoder design		 0.011996
Simplified trellis decoder · IEEE Trans. Commun. 1996
Physical-layer communications › channel coding › decoding algorithms
reduced-complexity decoding		 0.011996
Simplified trellis decoder · IEEE Trans. Commun. 1996
Physical-layer communications › channel coding › decoding algorithms
trellis decoding		 0.011996
Simplified trellis decoder · IEEE Trans. Commun. 1996
Physical-layer communications › signal detection › sequence estimation
viterbi algorithm		 0.011996
Simplified trellis decoder · IEEE Trans. Commun. 1996

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

simulation · 0.0add-compare-select reduction · 0.0
YearPublicationVenuePosition
1996 Simplified trellis decoder
abstract
A new simplified trellis decoder (STD) Viterbi-type algorithm is proposed for fast trellis decoding of rate K/K+1 binary convolutional codes. Viterbi algorithm (VA) computation is dominated by add-compare-select (ACS) operations when k/spl ges/2. The STD can substantially reduce the number of ACS operations and allow for a trade-off between the computational load and the performance of the decoder, The STD is analyzed and simulated for a four-dimensional (4-D) rate 4/5 64-state convolutional encoder specified by the ITU-T V.34 modem recommendation.
Vladimir Parizhsky, Dale M. Walsh
 IEEE Trans. Commun.1