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.

B. Dunbridge

dblp:134/3829 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1967
—ORCID · none

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

Theory of computation · 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.

Theoretical computer science
1 paper
Information theory · 56% Coding theory · 44%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing
signal design
0.011967
Asymmetric signal design for the coherent Gaussian channel · IEEE Trans. Inf. Theory 1967
Coding theory › error-correcting codes › block codes › linear code
simplex codes
0.011967
Asymmetric signal design for the coherent Gaussian channel · IEEE Trans. Inf. Theory 1967

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

necessary optimality conditions · 0.0SNR asymptotics · 0.0
YearPublicationVenuePosition
1967 Asymmetric signal design for the coherent Gaussian channel
abstract
Signal design theory is concerned with the problem of determining transmitter signal waveforms such that the probability of correct reception (or some other appropriate measure of communication efficiency) is maximized. The selection of signals must be performed under specified constraints of signal power and bandwidth and channel noise disturbance. In this paper three cases are treated for the coherent Gaussian channel: \begin{enumerate} \item white noise, equal signal energies, unequal message probabilities, \item white noise, average signal power bounded, equal message probabilities, and \item colored noise, average signal power bounded, equal message probabilities. \end{enumerate} In each problem, necessary general conditions for signal optimality are derived, and specific solutions obtained for small and large signal-to-noise ratios (SNR's). Complete solutions are indicated for the case of three messages. It is shown that the regular simplex codes are always global solutions at large SNR. Other results are also presented.
B. Dunbridge
IEEE Trans. Inf. Theory1