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

Dan Hajela

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

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

Theory of computation · 2 · 2 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
2 papers
Coding theory · 77% Information theory · 23%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation › bandwidth-efficient modulation
faster-than-nyquist signaling
0.011990
On computing the minimum distance for faster than Nyquist signaling · IEEE Trans. Inf. Theory 1990
Physical-layer communications › channel coding
minimum distance
0.011990
On computing the minimum distance for faster than Nyquist signaling · IEEE Trans. Inf. Theory 1990
Coding theory › source coding
rate-distortion theory
0.011990
Bounds on s-rate for linear, time-invariant, multiinput/multioutput channels · IEEE Trans. Inf. Theory 1990
Physical-layer communications › MIMO
MIMO channel
0.011990
Bounds on s-rate for linear, time-invariant, multiinput/multioutput channels · IEEE Trans. Inf. Theory 1990
Information theory › communication channels
intersymbol interference
0.011990
On computing the minimum distance for faster than Nyquist signaling · IEEE Trans. Inf. Theory 1990

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

volume argument · 0.0minimum distance computation · 0.0eigenvalue distribution · 0.0
YearPublicationVenuePosition
1990 On computing the minimum distance for faster than Nyquist signaling
abstract
The degradation suffered when pulses satisfying the Nyquist criterion are used to transmit binary data at a rate faster than the Nyquist rate over the ideal band-limited (brick-wall) channel is studied. The minimum distance between received signals is used as a performance criterion. It is well-known that when Nyquist pulses (i.e. pulses satisfying the Nyquist criterion) are sent at the Nyquist rate, the minimum distance between signal points is the same as the pulse energy. The main result is to show that the minimum distance between received signals is the same as the pulse energy for rates of transmission about 25% beyond the Nyquist rate, which is the best possible result. In fact, one can even identify the precise error event and signaling rate that causes the minimum distance to be no longer equal to the pulse energy. The mathematical formulation of the problem is analyzed.>
Dan Hajela
IEEE Trans. Inf. Theory1
1990 Bounds on s-rate for linear, time-invariant, multiinput/multioutput channels
abstract
Upper and lower bounds on the epsilon -rate of a linear, time-invariant multiple input multiple output channel are derived by using the same volume argument previously used by W.L. Root (1968) for single input single output channels. Because these bounds are not very tight, an approximation to the epsilon -rate is presented which lies between the upper and lower bounds, and can be used to compare epsilon -rates for different channels. The extension considered uses a result due to Lerer (1978) on the eigenvalue distribution of a convolution operator with a matrix kernel (impulse response). The present results are used to assess the increase in data rate attainable by designing input signals which exploit the multidimensional nature of the channel, relative to treating each constituent channel in isolation. Numerical results based upon a simple model for two coupled twisted-pair wires are presented.>
Dan Hajela, Michael L. Honig
IEEE Trans. Inf. Theory1