activity
20072020
most citedNon-Systematic Complex Number RS Coded OFDM by Unique Word Prefix

69 citations · 271 across the 24 of their papers we have counts for

collaborators

24 papers

eess.SP2020★ 3 cited

Comparison of Windowed-Decoder Configurations for Spatially Coupled LDPC Codes Under Equal-Complexity Constraints

Janik Frenzel, Stefan Müller-Weinfurtner, Johannes Huber +1

Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes offer excellent decoding performance and can be elegantly decoded with a Windowed Decoder (WD). We determine an efficient…

cs.IT2016★ 5 cited

Phase Shift Keying on the Hypersphere: Peak Power-Efficient MIMO Communications

Christoph Rachinger, Ralf R. Müller, Johannes B. Huber

Phase Shift Keying on the Hypersphere (PSKH), a generalization of conventional Phase Shift Keying (PSK) for Multiple-Input Multiple-Output (MIMO) systems, is introduced. In PSKH, c…

cs.IT2016

Layering of Communication Networks and a Forward-Backward Duality

Michael Cyran, Birgit Schotsch, Johannes B. Huber +2

In layered communication networks there are only connections between intermediate nodes in adjacent layers. Applying network coding to such networks provides a number of benefits i…

cs.IT2015★ 2 cited

Error Correction for Differential Linear Network Coding in Slowly-Varying Networks

Sven Puchinger, Michael Cyran, Robert F. H. Fischer +2

Differential linear network coding (DLNC) is a precoding scheme for information transmission over random linear networks. By using differential encoding and decoding, the conventio…

cs.IT2014

Low Complexity Decoding for Higher Order Punctured Trellis-Coded Modulation Over Intersymbol Interference Channels

Fabian Schuh, Johannes B. Huber

Trellis-coded modulation (TCM) is a power and bandwidth efficient digital transmission scheme which offers very low structural delay of the data stream. Classical TCM uses a signal…

cs.IT2014★ 8 cited

On the Design of Fast Convergent LDPC Codes: An Optimization Approach

Vahid Jamali, Yasser Karimian, Johannes Huber +1

The complexity-performance trade-off is a fundamental aspect of the design of low-density parity-check (LDPC) codes. In this paper, we consider LDPC codes for the binary erasure ch…