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

Tsunehachi Ishitani

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

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

Computer networks · 1

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 architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
digital circuit design
0.011993
Novel Viterbi decoder VLSI implementation and its performance · IEEE Trans. Commun. 1993
Integrated circuit design › digital circuit design › VLSI architecture
viterbi decoder
0.011993
Novel Viterbi decoder VLSI implementation and its performance · IEEE Trans. Commun. 1993
Physical-layer communications › channel coding › error control coding
convolutional codes
0.011993
Novel Viterbi decoder VLSI implementation and its performance · IEEE Trans. Commun. 1993
Physical-layer communications › channel coding
error correction
0.011993
Novel Viterbi decoder VLSI implementation and its performance · IEEE Trans. Commun. 1993

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

variable-rate decoding · 0.0scarce state transition decoding · 0.0
YearPublicationVenuePosition
1993 Novel Viterbi decoder VLSI implementation and its performance
abstract
An advanced, high-speed, and universal-coding-rate Viterbi decoder VLSI implementation is presented. Two novel circuit design schemes have been proposed: scarce state transition (SST) decoding and direct high-coding-rate convolutional code generation and variable-rate decoding. SST makes it possible to omit the final decision circuit and to reduce the required path memory length without degrading error probability performance. Moreover, the power consumption of the SST Viterbi decoder is significantly reduced when implemented as a CMOS device. These features overcome the speed limits of high-speed and high-coding-gain Viterbi decoder VLSIs in the rate one-half mode imposed by the thermal limitation. The other Viterbi decoding scheme makes it possible to realize a simple and variable coding-rate forward-error-correction circuit by changing only the branch metric calculation ROM tables. By employing these schemes, high-speed (25-Mb/s) and universal-coding-rate Viterbi decoder VLSIs have been developed.>
Shuji Kubota, Shuzo Kato, Tsunehachi Ishitani
IEEE Trans. Commun.3