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 EDBT 2026 / reviewers in the wild / expert

B. S. Katakol

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

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

Applied, interdisciplinary, general and emerging computing · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding		 0.011987
Performance of modified Fano algorithm in AWGN and fading channels · Proc. IEEE 1987
Physical-layer communications › channel coding
convolutional decoding		 0.011987
Performance of modified Fano algorithm in AWGN and fading channels · Proc. IEEE 1987
Physical-layer communications › channel coding › convolutional decoding
viterbi decoding		 0.011987
Performance of modified Fano algorithm in AWGN and fading channels · Proc. IEEE 1987

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

simulation · 0.0
YearPublicationVenuePosition
1987 Performance of modified Fano algorithm in AWGN and fading channels
abstract
A computationally efficient modified Fano algorithm for decoding of convolutional codes, recently proposed by the authors [1] has been further studied through simulation. Computational efforts and the BER performance of the original Fano and the modified Fano algorithms have been compared for the i) BSC and ii) Rayleigh fading channel with flat fading assumption. For the simulation example, the performance of the modified Fano algorithm was found to be comparable to the Viterbi decoder.
B. S. Katakol, Shankar Lall Maskara
 Proc. IEEE1