scispace - formally typeset
J

Johannes B. Huber

Researcher at University of Erlangen-Nuremberg

Publications -  195
Citations -  10531

Johannes B. Huber is an academic researcher from University of Erlangen-Nuremberg. The author has contributed to research in topics: Decoding methods & Turbo code. The author has an hindex of 38, co-authored 195 publications receiving 10239 citations.

Papers
More filters
Proceedings ArticleDOI

π/2-shifted phase shift keying on the hypersphere: Transmitter and receiver algorithms

TL;DR: π/2-PSKH is a multidimensional extension of shifted QAM which allows to use load-modulated MIMO transmitters with a highly efficient power amplifier with reduced backoff and shows excellent performance even if used with conventional amplifiers.
Proceedings ArticleDOI

Comparison of OFDM and Single-Carrier Transmission for Ultra-Low Delay Applications

TL;DR: It is shown that Orthogonal Frequency Division Multiplexing (OFDM) is not well suited for transmission over wireless channels with intersymbol interference (ISI), if a low delay constraint prohibits the use of channel codes with long code words.
Patent

Sendevorrichtung und Empfangsvorrichtung Transmitting device and receiving device

TL;DR: In this paper, a redundancy-addirection encoder with a code rate less than or equal to 0.5 is used to obtain two data streams to two different stations, which are located at spatially different positions.
Posted Content

Layering of Communication Networks and a Forward-Backward Duality.

TL;DR: A "layering procedure" to transform an arbitrary network into a layered structure is proposed and a "forward-backward duality" for linear network codes is derived, which can be seen as an analogon to the "uplink-downlinkDuality" in MIMO communication systems.
Proceedings ArticleDOI

Limited-Feedback Parity-Based Hybrid ARQ Using Spatially-Coupled LDPC Codes

TL;DR: A variant of RB-HARQ designed for limited feedback is compared with a new low-overhead, clustered Parity-Based Partial-Retransmission (PBPR) HARQ scheme, which selects symbols connected to unsatisfied parity checks and intersects this set with a subset of all symbols consisting of uniformly distributed information or parity symbols to improve the throughput.