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 Sippel

dblp:169/9977 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0001-9754-5952ORCID · verified

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

Computer networks · 2Systems, architecture and hardware · 1 · 1 since 2021

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

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.312017
Capacity of the Gaussian Two-Hop Full-Duplex Relay Channel With Residual Self-Interference · IEEE Trans. Commun. 2017
Information theory › channel capacity
relay channel capacity
0.312017
Capacity of the Gaussian Two-Hop Full-Duplex Relay Channel With Residual Self-Interference · IEEE Trans. Commun. 2017
Physical-layer communications › relaying › duplex relaying
full-duplex relaying
0.112017
Capacity of the Gaussian Two-Hop Full-Duplex Relay Channel With Residual Self-Interference · IEEE Trans. Commun. 2017
Physical-layer communications › full-duplex communication
residual self-interference
0.112017
Capacity of the Gaussian Two-Hop Full-Duplex Relay Channel With Residual Self-Interference · IEEE Trans. Commun. 2017

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

gaussian input distribution analysis · 0.6capacity-achieving coding scheme · 0.6
YearPublicationVenuePosition
2021 A 12 Bit 8 GS/s Randomly-Time-Interleaved SAR ADC with Adaptive Mismatch Correction
abstract
This paper presents a wideband 12 Bit 8 GS/s time-interleaved successive approximation register (SAR) analog-to-digital converter (ADC), featuring a sub-2 radix architecture with an overrange of 10% and randomized sampling with mismatch correction in a 28 nm CMOS technology. For this purpose, 18 500 MHz SAR-ADCs plus an additional reference ADC are interleaved. This topology enables a randomization approach, reducing mismatch related interleaving spurs. Furthermore, the additional reference ADC operating in parallel to the main ADC enables adaptive digital calibration to correct for static and time-interleaved mismatch effects. A wideband front-end features two subsequent push-pull buffer stages to achieve a high track- and-hold (T/H) bandwidth and high sampling linearity, while improving kickback related settling limitations. After calibration, the ADC achieves a signal to noise and distortion ratio (SNDR) of 56.8 dB and a spurious free dynamic range (SFDR) of 80 dBc applying a single full scale sine wave tone close to the Nyquist frequency of 4 GHz.
Sebastian Linnhoff, Erik Sippel, Frowin Buballa, Michael Reinhold, Martin Vossiek, Friedel Gerfers
ISCAS2
2017 Capacity of the Gaussian Two-Hop Full-Duplex Relay Channel With Residual Self-Interference
abstract
In this paper, we investigate the capacity of the Gaussian two-hop full-duplex (FD) relay channel with residual self-interference. This channel is comprised of a source, an FD relay, and a destination, where a direct source-destination link does not exist and the FD relay is impaired by residual self-interference. We adopt the worst case linear self-interference model with respect to the channel capacity, and model the residual self-interference as a Gaussian random variable whose variance depends on the amplitude of the transmit symbol of the relay. For this channel, we derive the capacity and propose an explicit capacity-achieving coding scheme. Thereby, we show that the optimal input distribution at the source is Gaussian and its variance depends on the amplitude of the transmit symbol of the relay. On the other hand, the optimal input distribution at the relay is discrete or Gaussian, where the latter case occurs only when the relay-destination link is the bottleneck link. The derived capacity converges to the capacity of the two-hop ideal FD relay channel without self-interference and to the capacity of the two-hop half-duplex (HD) relay channel in the limiting cases when the residual self-interference is zero and infinite, respectively. Our numerical results show that significant performance gains are achieved with the proposed capacity-achieving coding scheme compared with the achievable rates of conventional HD relaying and/or conventional FD relaying.
Nikola Zlatanov, Erik Sippel, Vahid Jamali, Robert Schober
IEEE Trans. Commun.2
2016 Capacity of the Gaussian Two-Hop Full-Duplex Relay Channel with Self-Interference
abstract
In this paper, we investigate the capacity of the Gaussian two-hop full-duplex (FD) relay channel with self-interference. This channel is comprised of a source, an FD relay, and a destination, where a direct source-destination link does not exist and the FD relay is impaired by self- interference. We model the self-interference as an additive Gaussian random variable whose variance is proportional to the amplitude of the transmit symbol at the relay. For this channel, we derive the capacity and propose an explicit capacity- achieving coding scheme. Thereby, we show that the optimal input distribution at the source is Gaussian and its variance depends on the amplitude of the transmit symbol at the relay. On the other hand, the optimal input distribution at the relay is discrete or Gaussian, where the latter case occurs only when the relay- destination link is the bottleneck link. The derived capacity converges to the capacity of the two-hop ideal FD relay channel without self- interference and to the capacity of the two-hop half-duplex (HD) relay channel in the limiting cases when the self-interference is zero and infinite, respectively. Our numerical results show that significant performance gains are achieved using the proposed capacity-achieving coding scheme compared to the achievable rates of conventional FD relaying and HD relaying.
Nikola Zlatanov, Erik Sippel, Vahid Jamali, Robert Schober
GLOBECOM2