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

Håkan B. Eriksson

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

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

Computer networks · 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
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › signal detection › sequence estimation
maximum-likelihood sequence estimation
0.012000
Making MLSD decisions by thresholding the matched filter output · IEEE Trans. Commun. 2000
Physical-layer communications
signal detection
0.012000
Making MLSD decisions by thresholding the matched filter output · IEEE Trans. Commun. 2000
Physical-layer communications › signal detection › hypothesis testing
threshold detection
0.012000
Making MLSD decisions by thresholding the matched filter output · IEEE Trans. Commun. 2000
Physical-layer communications › interference
intersymbol interference
0.012000
Making MLSD decisions by thresholding the matched filter output · IEEE Trans. Commun. 2000

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

thresholding · 0.0matched filter · 0.0log-likelihood bound · 0.0
YearPublicationVenuePosition
2000 Making MLSD decisions by thresholding the matched filter output
abstract
This paper presents an iterative detector that, by thresholding the output of the matched filter, gives maximum-likelihood sequence detector (MLSD) decisions on binary, antipodally modulated symbols that have been corrupted by intersymbol interference and additive Gaussian noise. The detector will make decisions on some, but often not all, of the symbols in a transmitted sequence, and those decisions will be the same decisions as the MLSD would have made. The number of symbols that are detected is stochastic, varying from sequence to sequence. The basis of the detector is a bound on a crossterm of the quadratic form in the log-likelihood function for the transmitted sequence. The detector is simple in structure, consisting of a matched filter and two variable threshold values for each symbol.
Per Ödling, Håkan B. Eriksson, Per Ola Börjesson
IEEE Trans. Commun.2
1994 Combined linear-Viterbi equalizers-a comparative study and a minimax design
abstract
Combined linear-Viterbi equalizer (CLVE) is a term often used for a class of digital receivers reducing the complexity of the Viterbi detector by assuming an approximate channel model together with linear pre-equalization of the received data. The authors reconsider a weighted least squares design technique for CLVEs by introducing a minimax criterion for suppressing the strongest component of the residual intersymbol interference. Odling (1993) studied the performance of some proposed CLVE design methods and evaluated them by simulated bit error rates. The present authors investigate the performance of the minimax design and of the CLVE designs found in literature for two GSM test channels. They also present a comparison of the CLVE designs based on a common quadratic optimization criterion for the selection of the channel prefilter and the desired impulse response.>
Nils Sundström, Ove Edfors, Per Ödling, Håkan B. Eriksson, Timo Koski, Per Ola Börjesson
VTC4