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

L. C. Peach

dblp:271/5528 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1981
—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%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › error probability analysis
bit error rate analysis
0.011981
Characteristics of the Hedeman H-1, H-2, and H-3 Codes · IEEE Trans. Commun. 1981
Physical-layer communications
channel coding and estimation
0.011981
Characteristics of the Hedeman H-1, H-2, and H-3 Codes · IEEE Trans. Commun. 1981
Physical-layer communications › modulation
line coding
0.011981
Characteristics of the Hedeman H-1, H-2, and H-3 Codes · IEEE Trans. Commun. 1981
Physical-layer communications
modulation and signal design
0.011981
Characteristics of the Hedeman H-1, H-2, and H-3 Codes · IEEE Trans. Commun. 1981
Physical-layer communications
synchronization
0.011981
Characteristics of the Hedeman H-1, H-2, and H-3 Codes · IEEE Trans. Commun. 1981
Physical-layer communications › synchronization
timing recovery
0.011981
Characteristics of the Hedeman H-1, H-2, and H-3 Codes · IEEE Trans. Commun. 1981

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

soft decision · 0.0maximum-likelihood sequence estimation · 0.0
YearPublicationVenuePosition
1981 Characteristics of the Hedeman H-1, H-2, and H-3 Codes
abstract
This paper examines three new digital modulation binary codes developed by Hedeman and denoted as the H-1, H-2, and H-3 codes. It contains a complete description of the Hedeman codes and analyzes several of their important properties. The bit error probability is displayed as a function of signal-to-noise ratio, and detector implementation is discussed. It is shown that with a maximum likelihood sequence estimator using soft decisions, the H-2 and H-3 codes can achieve the same bit error rate as the nonreturn-to-zero (NRZ) or Manchester codes. Autocorrelation functions and power spectral densities of the Hedeman codes are presented. These results indicate that they possess the favorable quality of no dc component. Finally, symbol synchronization is considered. Here, phase synchronizing template patterns are identified and the probability of resynchronization is given as a function of time after loss of synchronization.
Joseph L. LoCicero, Daniel J. Costello Jr., L. C. Peach
IEEE Trans. Commun.3