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

Ulf J. S. Johansson

dblp:273/1384 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1974
—ORCID · none

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

Computer networks · 1Theory of computation · 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
2 papers
Physical-layer communications · 57% Optical networks · 43%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.011974
A general time-discrete equivalent to a time-continuous Gaussian channel (Corresp.) · IEEE Trans. Inf. Theory 1974
Information theory › channel capacity
gaussian channel
0.011974
A general time-discrete equivalent to a time-continuous Gaussian channel (Corresp.) · IEEE Trans. Inf. Theory 1974
Physical-layer communications
digital transmission systems
0.011973
High-Capacity Digital Line Links · IEEE Trans. Commun. 1973
Optical networks › optical fiber transmission
repeater spacing
0.011973
High-Capacity Digital Line Links · IEEE Trans. Commun. 1973
Physical-layer communications
signal processing for communications
0.011974
A general time-discrete equivalent to a time-continuous Gaussian channel (Corresp.) · IEEE Trans. Inf. Theory 1974

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

matched filter design · 0.0band-limited filter optimization · 0.0parameter optimization · 0.0economic measure of goodness · 0.0
YearPublicationVenuePosition
1974 A general time-discrete equivalent to a time-continuous Gaussian channel (Corresp.)
abstract
Transmission of a time-discrete message over a time-continuous channel is considered. The channel is assumed to be stationary and Gaussian. The following results are shown. 1) An optimum receiver will always contain a matched matrix filter followed by a sampling unit. 2) Jointly optimized transmitting and receiving filters will always be strictly band limited to a set of Nyquist domains. It is shown that both these results are true for any kind of message and under any measure of performance. On the basis of these results a general time-discrete matrix channel equivalent to the original time-continuous scalar channel is derived. The significance of the results is that any optimization of transmitter and receiver is reduced from a time-continuous problem to a time-discrete one.
Thomas H. E. Ericson, Ulf J. S. Johansson
IEEE Trans. Inf. Theory2
1973 High-Capacity Digital Line Links
abstract
A hybrid digital transmission system of the kind originally proposed by Chang and Freeny [4], [6] is considered. Based on predictions about cable and repeater costs around 1980, an investigation of a certain economic measure of goodness is performed. Specifically, the influence on the system cost of the choice of certain fundamental system parameters like repeater spacing, symbol rate, and number of signal levels is studied.
Thomas H. E. Ericson, Ulf J. S. Johansson
IEEE Trans. Commun.2