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

Erik Rantapaa

dblp:25/2809 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1995
—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.

Theoretical computer science
2 papers
Information theory · 61% Coding theory · 39%
Computer networks
2 papers
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing
signal design
0.011995
Discrete-time signal design for maximizing separation in amplitude · IEEE Trans. Inf. Theory 1995
Physical-layer communications
signal design
0.011991
On optimal signal sets for digital communications with finite precision and amplitude constraints · IEEE Trans. Commun. 1991
Information theory
channel capacity
0.011991
On optimal signal sets for digital communications with finite precision and amplitude constraints · IEEE Trans. Commun. 1991

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

non-convex optimization · 0.0channel impulse response analysis · 0.0
YearPublicationVenuePosition
1995 Discrete-time signal design for maximizing separation in amplitude
abstract
Given a discrete-time, linear, shift-invariant channel with finite impulse response, the problem of designing finite-length input signals with bounded amplitude (l/sub /spl infin// norm) such that the corresponding output signals are maximally separated in amplitude (l/sub /spl infin// sense) is considered. In general, this is a nonconvex optimization problem, and appears to be computationally difficult. An optimization algorithm that seems to perform well is described. Optimized signal sets and associated minimum distances (minimum l/sub /spl infin// separation between two distinct channel outputs) are presented for some example impulse responses. A conjectured upper bound on the minimum distance is given that is easily computed given the impulse response of the channel, the number of inputs, and the input length. This upper bound is shown to be valid for a limited class of impulse response functions.>
Michael L. Honig, Kenneth Steiglitz, Venkataramanan Balakrishnan, Erik Rantapaa
IEEE Trans. Inf. Theory4
1991 On optimal signal sets for digital communications with finite precision and amplitude constraints
abstract
The maximum data rate that can be reliably communicated given a linear, time-invariant, dispersive channel, a receiver that samples the channel output to within an accuracy of +or-d where d>0, and a transmitter with an output amplitude constraint is evaluated. For any dispersive channel the maximum rate depends on d and is finite. The transmitted waveforms must be designed so that two channel outputs associated with two distinct transmitted signals are separated in amplitude at a particular time by d. It is shown that given any channel impulse response with rational Laplace transform, there exists an optimal sets of inputs that are +or-A everywhere where A is the maximum allowable amplitude. Furthermore, in any finite time interval, each input changes sign a finite number of times. If the channel impulse response is a single decaying exponential, it is shown that simple binary signaling, in which A or -A, depending on the current message bit, is transmitted during each symbol interval, maximizes the data rate.>
Michael L. Honig, Stephen P. Boyd, Erik Rantapaa
IEEE Trans. Commun.4