Gottfried Schnabl
Siemens
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Gottfried Schnabl.
IEEE Transactions on Information Theory | 1995
Gottfried Schnabl; Martin Bossert
Constructs Reed-Muller codes by generalized multiple concatenation of binary block codes of length 2. As a consequence of this construction, a new decoding procedure is derived that uses soft-decision information. The algorithm is designed for low decoding complexity and is applicable to all Reed-Muller codes. It gives better decoding performance than soft-decision bounded-distance decoding. Its decoding complexity is much lower than that of maximum-likelihood trellis decoding of Reed-Muller codes, especially for long codes. >
2002 International Zurich Seminar on Broadband Communications Access - Transmission - Networking (Cat. No.02TH8599) | 2002
Ingo Viering; Thomas Frey; Gottfried Schnabl
A hybrid beamforming technique for multiple antenna receivers is introduced. It is a combination of a simple fixed beam method and the adaptive eigen beamforming algorithm. This two-stage solution allows for a user-specific scalable trade-off between performance and complexity, depending on the interference scenario. Furthermore, the dimensions of the eigen beamforming stage can be reduced with only slight performance degradation. The hybrid scheme is compared with the stand-alone algorithms in different two-user scenarios under ideal as well as under more realistic assumptions. It is shown, that in many scenarios the fixed beamforming stage is sufficient. In more severe interference scenarios, the hybrid techniques approach the performance of the eigen beamformer with less complexity.
Applicable Algebra in Engineering, Communication and Computing | 1990
Gottfried Schnabl; Martin Bossert
Block coded modulation schemes can be obtained by generalized concatenation of the modulation and block codes of length N. The modulation is considered as a code in the euclidean space IR2. One obtains a concatenated code in the euclidean space IR2N using binary block codes. In this paper the obtained code is taken as an inner code, which is concatenated with block codes once again. The advantage of this multiple concatenation compared to single concatenation is the use of very short (easy to decode) outer codes such as repetition codes and even weight codes.
Archive | 1999
Ralph Jordan; Martin Bossert; Gottfried Schnabl
Archive | 2002
Thomas Frey; Markus Reinhardt; Gottfried Schnabl; Alexander Seeger; Ingo Viering
Archive | 2004
Christina Breining; Hans Dieterich; Thomas Frey; Joachim Schmid; Gottfried Schnabl; Christoph Schreyoegg
Archive | 2003
Christina Breining; Hans Dieterich; Thomas Frey; Gottfried Schnabl; Christoph Schreyoegg; Joachim Schmid
Archive | 2003
Christina Breining; Hans Dietrich; Thomas Frey; Gottfried Schnabl; Christoph Schreyoegg; Joachim Schmid
Archive | 2001
Thomas Frey; Markus Reinhardt; Gottfried Schnabl; Alexander Seeger
Archive | 2001
Christina Breining; Hans Dieterich; Thomas Frey; Gottfried Schnabl; Christoph Schreyoegg; Joachim Schmid