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

J. A. Fergus Ross

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

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

Computer networks · 1 · 1 first-authorTheory 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.

Computer networks
2 papers
Physical-layer communications · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.011995
Multiuser signaling in the symbol-synchronous AWGN channel · IEEE Trans. Inf. Theory 1995
Physical-layer communications › channel coding › error control coding
convolutional codes
0.011995
Multiuser signaling in the symbol-synchronous AWGN channel · IEEE Trans. Inf. Theory 1995
Physical-layer communications › signal design
signal set design
0.011995
Multiuser signaling in the symbol-synchronous AWGN channel · IEEE Trans. Inf. Theory 1995
Physical-layer communications › equalization
blind equalization
0.011991
An enhancement to blind equalization algorithms · IEEE Trans. Commun. 1991
Physical-layer communications
equalization
0.011991
An enhancement to blind equalization algorithms · IEEE Trans. Commun. 1991
Physical-layer communications
signal processing for communications
0.011991
An enhancement to blind equalization algorithms · IEEE Trans. Commun. 1991
Information theory › network information theory › multiple-access channel
adder channel
0.011995
Multiuser signaling in the symbol-synchronous AWGN channel · IEEE Trans. Inf. Theory 1995
Information theory › network information theory
multiple-access channel
0.011995
Multiuser signaling in the symbol-synchronous AWGN channel · IEEE Trans. Inf. Theory 1995

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

signal set construction · 0.0euclidean distance analysis · 0.0zero-forcing algorithm · 0.0step-size adaptation · 0.0
YearPublicationVenuePosition
1995 Multiuser signaling in the symbol-synchronous AWGN channel
abstract
Multiuser signal set design for the energy-constrained linear real-additive symbol-synchronous additive white Gaussian noise channel is investigated in this correspondence. An argument is presented showing the suboptimality of binary alphabets which, in turn, uncovers a rule for the formation of multiuser signal sets. This simple rule leads to a theorem stating the dimensionality at which additional users can be added to a multiuser system without decreasing the minimum Euclidean distance. Specific vector sets with the desired property are then constructed as examples and some generalizations are discussed. The theorem may also be used as a platform for the design of more efficient multiuser codes incorporating redundant signal sets. Two such codes are presented. In particular, a code combining four-dimensional unit-energy signals with a rate-2/3 convolutional code obtains a summed rate of 1.75 bits/dimension in the two-user adder channel with received minimum Euclidean distance of 2.>
J. A. Fergus Ross, Desmond P. Taylor
IEEE Trans. Inf. Theory1
1991 An enhancement to blind equalization algorithms
abstract
Blind equalization performance can be improved by controlling the equalizer adaption step-size according to the region in which the received signal lies in the constellation plane. A simple technique based on this principle is proposed as a modification to blind equalization algorithms, and its effectiveness is demonstrated by simulation. As an example, the algorithm of Picchi and Prati (1987) is considered since it is simpler and converges faster. The proposed modification is applied to the zero-forcing (ZF) algorithm.>
J. A. Fergus Ross, Desmond P. Taylor
IEEE Trans. Commun.1