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

David J. Tait

dblp:118/6834 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1996
—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 networks
1 paper
Physical-layer communications · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 50% Energy-efficient computing · 50%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.011996
Scarce-state-transition syndrome-former error-trellis decoding of (n, n-1) convolutional codes · IEEE Trans. Commun. 1996
Physical-layer communications › channel coding › error control coding
convolutional codes
0.011996
Scarce-state-transition syndrome-former error-trellis decoding of (n, n-1) convolutional codes · IEEE Trans. Commun. 1996
Physical-layer communications › channel coding › decoding algorithms
trellis decoding
0.011996
Scarce-state-transition syndrome-former error-trellis decoding of (n, n-1) convolutional codes · IEEE Trans. Commun. 1996
Energy-efficient computing
low-power design
0.011996
Scarce-state-transition syndrome-former error-trellis decoding of (n, n-1) convolutional codes · IEEE Trans. Commun. 1996
Integrated circuit design
VLSI design
0.011996
Scarce-state-transition syndrome-former error-trellis decoding of (n, n-1) convolutional codes · IEEE Trans. Commun. 1996

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

scarce-state-transition trellis decoding · 0.0
YearPublicationVenuePosition
1996 Scarce-state-transition syndrome-former error-trellis decoding of (n, n-1) convolutional codes
abstract
A novel scarce-state-transition (SST) type trellis decoding system for (n,n-1) convolutional codes with coherent BPSK signals is proposed. The new system retains the same number of binary comparisons as the syndrome-former trellis decoding technique. Like the original SST-type encoder trellis technique, the proposed system is also suitable for CMOS VLSI implementation. A combination of the two techniques results in a less complex and low power consumption decoding system.
L. H. Charles Lee, David J. Tait, Patrick Guy Farrell
IEEE Trans. Commun.2