Demo Data from EDBT 2026 / reviewers in the wild / expert
Mats Öberg
dblp:02/10713
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4 · 2 first-authorSecurity and privacy · 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.
| Computer networks
2 papers |
Physical-layer communications · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications
channel coding |
0.1 | 2 | 2001 | Performance analysis of turbo-equalized partial response channels · IEEE Trans. Commun. 2001 Turbo decoding for partial response channels · IEEE Trans. Commun. 2000 |
Physical-layer communications › channel modeling › channel with memory
partial-response channel |
0.1 | 2 | 2001 | Performance analysis of turbo-equalized partial response channels · IEEE Trans. Commun. 2001 Turbo decoding for partial response channels · IEEE Trans. Commun. 2000 |
Physical-layer communications › channel coding › decoding algorithms
maximum-likelihood decoding |
0.0 | 1 | 2001 | Performance analysis of turbo-equalized partial response channels · IEEE Trans. Commun. 2001 |
Physical-layer communications › equalization
turbo equalization |
0.0 | 1 | 2001 | Performance analysis of turbo-equalized partial response channels · IEEE Trans. Commun. 2001 |
Physical-layer communications › channel coding › error control coding › concatenated codes
turbo codes |
0.0 | 1 | 2000 | Turbo decoding for partial response channels · IEEE Trans. Commun. 2000 |
Physical-layer communications › channel coding › decoding algorithms › iterative decoding
turbo decoding |
0.0 | 1 | 2000 | Turbo decoding for partial response channels · IEEE Trans. Commun. 2000 |
Physical-layer communications › channel coding › error control coding
convolutional codes |
0.0 | 1 | 2000 | Turbo decoding for partial response channels · IEEE Trans. Commun. 2000 |
Methods — techniques the papers use, named apart from their topics
union bound · 0.0euclidean distance spectrum · 0.0computer simulation · 0.0serial concatenation · 0.0interleaver design · 0.0a posteriori probability detection · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Estimation of areal density gains of TDMR system with 2D detector
Rathnakumar Radhakrishnan, Nedeljko Varnica, Mats Öberg |
ISITA | 3 |
| 2001 | Performance bound for parity-check coded partial-response channelsabstractWe consider maximum-likelihood decoder performance in additive white Gaussian noise for the serial concatenation of an outer code comprising multiple, independent odd-parity-check codes and an inner precoded dicode partial-response channel through a random interleaver. Using a technique proposed in Oberg and Siegel (1998, 2001) we derive an approximation of the average weight enumerator, assuming that code bit values within error events are independent, identically distributed, and equiprobable. We show that the union bound on word-error-rate based upon the approximate weight enumerator is actually an upper bound to that based upon the true average weight enumerator, for suitably large signal-to-noise ratios. Mats Öberg, Paul H. Siegel |
ICC | 1 |
| 2001 | Performance analysis of turbo-equalized partial response channelsabstractThe performance of maximum-likelihood decoding of a serial concatenation comprising a high-rate block code, convolutional code, or a turbo code, a uniform interleaver, and a partial response channel with additive white Gaussian noise is addressed. The effect of a channel precoder on the system performance is also considered. Bit- and word-error rate estimates based upon properties of the average Euclidean distance spectrum of the coded partial response channel are derived. The estimates are compared to computer simulation results, and implications for system design are discussed. Mats Öberg, Paul H. Siegel |
IEEE Trans. Commun. | 1 |
| 2000 | Turbo decoding for partial response channelsabstractThe partial response channel can be viewed as a rate-1 encoder in which the output alphabet differs from the input alphabet. In serially concatenated coding schemes, the partial response channel can serve as the inner encoder. Previous work on the application of turbo decoding techniques to partial response channels has focused on using a parallel concatenation of convolutional encoders as the outer code and the partial response channel as the inner code. This system requires three a posteriori probability (APP) detectors-one matched to the channel and two matched to the constituent encoders. A simplified system is presented that uses as its outer code a single convolutional code and as its inner code the partial response channel. The simplified system requires only two APP detectors, offering significant savings in complexity and computation time. This single convolutional code system is shown to perform as well as the more complicated system, offering substantial gains over uncoded systems. Simulation results for three magnetic recording channel models are presented: a partial response channel with additive white Gaussian noise, an equalized Lorentzian channel model, and a media noise model called the microtrack model. Since the use of an outer Reed-Solomon code is anticipated in an actual system, the burst-error statistics are investigated. System performance with various interleaver designs and precoders is also investigated. Tom V. Souvignier, Mats Öberg, Paul H. Siegel, Robert E. Swanson, Jack K. Wolf |
IEEE Trans. Commun. | 2 |
| 1999 | Turbo decoding for PR4: parallel versus serial concatenationabstractRecent work on the application of turbo decoding techniques to partial response class 4 (PR4) channels has focused on parallel concatenation systems that require three a posteriori (APP) detectors. A simplified serial concatenation system is presented that uses as its outer code a single convolutional code and as its inner code the partial response channel. An extension of this serial concatenation system is also presented that combines a second code with the channel, forming a more powerful inner code. Both proposed systems require only two APP detectors, offering significant savings in complexity and computation time. These serial concatenation systems are shown to perform as well as the more complicated parallel concatenation systems, offering substantial gains over uncoded systems. Additionally, the effect of precoding is investigated. Simulation results comparing the parallel and serial concatenation systems are also presented. Tom V. Souvignier, Arnon Friedmann, Mats Öberg, Paul H. Siegel, Robert E. Swanson, Jack K. Wolf |
ICC | 3 |