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

Gary Lorden

dblp:203/6419 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1984
—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 · 70% Internet architecture and protocols · 30%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.011984
Node Synchronization for the Viterbi Decoder · IEEE Trans. Commun. 1984
Physical-layer communications › channel coding › error control coding
convolutional codes
0.011984
Node Synchronization for the Viterbi Decoder · IEEE Trans. Commun. 1984
Internet architecture and protocols › network synchronization
node synchronization
0.011984
Node Synchronization for the Viterbi Decoder · IEEE Trans. Commun. 1984
Physical-layer communications › channel coding › convolutional decoding
viterbi decoding
0.011984
Node Synchronization for the Viterbi Decoder · IEEE Trans. Commun. 1984

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

statistical detection · 0.0reed-solomon outer coding · 0.0
YearPublicationVenuePosition
1984 Node Synchronization for the Viterbi Decoder
abstract
Motivated by the needs of NASA's Voyager 2 mission, in this paper we describe an algorithm which detects and corrects losses of node synchronization in convolutionally encoded data. This algorithm, which would be implemented as a hardware device external to a Viterbi decoder, makes statistical decisions about node synch based on the hard-quantized undecoded data stream. We will show that in a worst-case Voyager environment, our method will detect and correct a true loss of synch (thought to be a very rare event) within several hundred bits; many of the resulting outages will be corrected by the outer Reed-Solomon code. At the same time, the mean time between false alarms is on the order of several years, independent of the signal-to-noise ratio.
Gary Lorden, Robert J. McEliece, Laif Swanson
IEEE Trans. Commun.1