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

John R. Pierce

dblp:42/3290 · also John Robinson Pierce · DBLP profile ↗
← Back
10ranked-venue papers
9as first author
0since 2021 · last 1998
—ORCID · none

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

Theory of computation · 5 · 5 first-authorComputer networks · 4 · 3 first-authorApplied, 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 architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%
Computer networks
5 papers
Physical-layer communications · 83% Internet architecture and protocols · 10% Routing and switching · 7%
Theoretical computer science
6 papers
Information theory · 78% Coding theory · 22%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design › semiconductor devices
transistor
0.011998
The naming of the transistor · Proc. IEEE 1998
Information theory
channel capacity
0.031981
The capacity of the photon counting channel · IEEE Trans. Inf. Theory 1981
Comparison of Three-Phase Modulation with Two-Phase and Four-Phase Modulation · IEEE Trans. Commun. 1980
Optical Channels: Practical Limits with Photon Counting · IEEE Trans. Commun. 1978
Information theory › communication channels › channel models › optical channel
photon counting channels
0.011981
The capacity of the photon counting channel · IEEE Trans. Inf. Theory 1981
Physical-layer communications
modulation
0.011980
Comparison of Three-Phase Modulation with Two-Phase and Four-Phase Modulation · IEEE Trans. Commun. 1980
Physical-layer communications › modulation
phase-shift keying
0.011980
Comparison of Three-Phase Modulation with Two-Phase and Four-Phase Modulation · IEEE Trans. Commun. 1980
Physical-layer communications
optical communication
0.011978
Optical Channels: Practical Limits with Photon Counting · IEEE Trans. Commun. 1978
Physical-layer communications › optical communication
photon counting
0.011978
Optical Channels: Practical Limits with Photon Counting · IEEE Trans. Commun. 1978
Internet architecture and protocols
distributed control
0.011972
How Far Can Data Loops Go? · IEEE Trans. Commun. 1972
Routing and switching › switching
message switching
0.011972
How Far Can Data Loops Go? · IEEE Trans. Commun. 1972
Coding theory › constrained coding › line codes
DC-free codes
0.011972
Spectra and Efficiency of Binary Codes Without DC · IEEE Trans. Commun. 1972
Coding theory › constrained coding
line codes
0.011972
Spectra and Efficiency of Binary Codes Without DC · IEEE Trans. Commun. 1972
Information theory › signal processing › spectral estimation
power spectral density
0.011972
Spectra and Efficiency of Binary Codes Without DC · IEEE Trans. Commun. 1972
Information theory › channel capacity
energy per bit
0.011980
Comparison of Three-Phase Modulation with Two-Phase and Four-Phase Modulation · IEEE Trans. Commun. 1980
Internet architecture and protocols › network topology
loop communication networks
0.011972
How Far Can Data Loops Go? · IEEE Trans. Commun. 1972
Physical-layer communications
diversity
0.011966
Ultimate performance of M -ary transmissions on fading channels · IEEE Trans. Inf. Theory 1966
Physical-layer communications
fading channels
0.011966
Ultimate performance of M -ary transmissions on fading channels · IEEE Trans. Inf. Theory 1966
Coding theory › channel coding
random coding
0.011967
Average digit-error probability after decoding random codes (Corresp.) · IEEE Trans. Inf. Theory 1967

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

error rate analysis · 0.0photon counting · 0.0asymptotic analysis · 0.0spectral analysis · 0.0energy detection · 0.0decoding · 0.0
YearPublicationVenuePosition
1998 The naming of the transistor
abstract
The author devised the name "transistor" in may 1948 when W. Brattain asked him for a suitable name. The early transistor was the dual of a vacuum tube and as such would have transresistance; this suggested the name. Some historical aspects concerning the development of the transistor are discussed.
John R. Pierce
Proc. IEEE1
1981 The capacity of the photon counting channel
abstract
Previous work has shown that the capacity of the single-mode photon-counting channel in the region in which quantum effects are most pronounced is1/(kT \ln 2)bit/J. HereTis the quantum noise temperature, andkis Boltzmann's constant. However, to achieve this, the number of photons per second must be very low, so this does not determine the capacity of the average power-limited photon channel in bits per second. Here the previous work is extended and the capacity is determined in bits per second. This includes a determination of the optimum counting time. The capacity in bits per second is for lowTasymptotic toP_{s}/(kT \ln 2), whereP_{s}is the average signal power. This is high enough to suggest that photon counting be seriously considered for applications such as a deep space to near Earth link. Some related problems are also considered including a peak power limitation.
John R. Pierce, Edward C. Posner, Eugene R. Rodemich
IEEE Trans. Inf. Theory1
1980 Comparison of Three-Phase Modulation with Two-Phase and Four-Phase Modulation
abstract
For a constant added noise density at high signal-to-noise ratios and for the same error rate, three-phase PSK requires about 0.75 dB less energy per bit than two-phase or four-phase PSK. However, at very low signal-to-noise ratios, three-phase PSK requires about 0.74 dB more energy per bit of channel capacity than two-phase or four-phase PSK.
John R. Pierce
IEEE Trans. Commun.1
1978 Optical Channels: Practical Limits with Photon Counting
abstract
In optical communication, ideal amplification of the received signal leads to a limiting signaling rate of 1 nat per photon. This is much inferior to the optimum limit ofkTjoules/nat, which we can theoretically approach by counting photons. Practically, the rates we can attain by photon counting will be limited by how elaborate codes we can instrument rather than by thermal photons.
John R. Pierce
IEEE Trans. Commun.1
1973 The early days of information theory
abstract
Shannon's communication (information) theory cast about as much light on the problem of the communication engineer as can be shed. It reflected or encompassed earlier work, but it was so new that it was not really understood by many of those who first talked or wrote about it. Most of the papers published on information theory through 1950 are irrelevant to Shannon's work. Later work has given us useful information and encoding schemes as well as greater rigor, but the wisdom of Shannon's way of looking at things and his original theorems are of primary importance.
John R. Pierce
IEEE Trans. Inf. Theory1
1972 Spectra and Efficiency of Binary Codes Without DC
abstract
In digital transmission of binary (+1,-1) signals it is desirable that the stream of pulses which constitutes the signal have no dc, that is, that the power spectrum go to zero at zero frequency. It is desirable that, for a given efficiency or entropy, the spectrum rise slowly with increasing frequency. We have obtained the spectrum for selected blocks with equal numbers of plus ones and minus ones. For a given efficiency, this is better than the spectrum obtained by Rice, using the Monte Carlo method, for block encoding using polarity pulses. An algorithm given by Schalwijk should allow simple encoding into selected blocks.
J. N. Franklin, John R. Pierce
IEEE Trans. Commun.2
1972 How Far Can Data Loops Go?
abstract
The switching of addressed blocks of data through a network (message switching) is particularly suited to the sort of inquiry-response communication characteristic of many business transactions. In a system of interconnected loops, efficient message switching can be attained with distributed control rather than common control. The initial capital investment in such a system would be low and the investment would grow only as the system grew.
John R. Pierce
IEEE Trans. Commun.1
1967 Average digit-error probability after decoding random codes (Corresp.)
John R. Pierce
IEEE Trans. Inf. Theory1
1966 Ultimate performance of M -ary transmissions on fading channels
abstract
One ofMfrequency translates of a common signal is sent over a fading channel and is received in additive white noise. The receiver decides which signal was sent using energy measurements only. It is shown that asMis allowed to become very large, the performance depends only on the probability distribution of received energy per bit, and that this limiting behavior is the same as for optimum detection based on full knowledge of instantaneous channel properties. If sufficiently many independent copies of the channel can be achieved (i.e., independent diversity branches), the performance can be made to approach as closely as desired that of the nonfading infinite-bandwidth channel, independently of the exact channel statistics.
John R. Pierce
IEEE Trans. Inf. Theory1
1965 Possibility of theoretical prediction of fading circuit error clustering (Corresp.)
John R. Pierce
IEEE Trans. Inf. Theory1