Joachim Hagenauer

Joachim Hagenauer (29 July 1941 – 16 January 2026) was a German information theorist and academic[1] who was professor emeritus at Technical University of Munich. He pioneered the use of soft bits (see Soft output Viterbi algorithm), a coding theory technique that contributes to the high performance of the turbo codes.

Hagenauer's work enabled the advancement of turbo coding and led to a significant improvement in channel coding for digital communications and storage. His works have been applied to digital receiver designs, satellite transmissions and other facets of telecommunications.

Life and career

Hagenauer received his doctorate in 1974 from Darmstadt University of Technology where he also served as an assistant professor. In 1990 he was appointed a director of the Institute for Communication Technology at the German Aerospace Center DLR in Oberpfaffenhofen. In 1993 he became the Chair of the University of Technology's Communications Technology department in Munich, Germany.[2]

He was also active at the IEEE Information Theory Society.[3]

In 1992, Hagenauer was elevated to the grade of IEEE fellow for contribution to the application of convolutional codes to mobile radio and satellite communications.[4]

He was awarded the Erich Regener and Otto Lilienthal Prizes from the German Aerospace Association, and the Armstrong Award from the IEEE Communications Society, and was also elected to the Bavarian Academy of Science. In 2003, he received the IEEE Alexander Graham Bell Medal for meritorious achievements in telecommunications.

Hagenauer died on 16 January 2026, at the age of 84.[5]

See also

  • Google scholar profile [1]

References

  1. ^ "Emeritius Professor, TUM".
  2. ^ "Faculty page at TUM".
  3. ^ "Participation & Positions at IEEE Information Theory Society". Archived from the original on 19 July 2019.
  4. ^ "IEEE Fellows 1992 | IEEE Communications Society".
  5. ^ "Obituary: Professor Joachim Hagenauer". Technical University of Munich. 24 January 2026. Retrieved 27 January 2026.
This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.