Boris Stender

Learn More
Let the Viterbi algorithm be applied for maximum-likelihood decoding of a terminated convolutional code using a trellis. We propose an additional procedure that permits a receiver to locate unreliable segments within an estimated code sequence. This reliability output may be used, for example, to request retransmissions, in systems with error concealment,(More)
In wireless communication schemes packetized data is transmitted by utilizing a certain modulation and coding scheme (MCS). The granularity effects provoked by a limited number of available MCS results in an inefficient performance. A hybrid automatic repeat request (HARQ) scheme is proposed, in which the granularity loss is reduced by scheduled(More)
This paper is concerned with the capacity evaluation of an incremental redundancy (IR) scheme with mapper rearrangement. The AWGN performance of the scheme originally proposed by Schmitt [6], [7] is evaluated for the coded modulation (CM) as well as for the bitinterleaved coded modulation (BICM) scenario. A mapper that is improving the BICM performance at(More)
Broadcast transmission, as proposed by Cover, is an optimal downlink transmission method to serve many users by a single base station. Substituting or complementing the fast scheduler in high speed downlink schemes, broadcasting schemes should have a low computational complexity, as typically, decisions have to be made within milliseconds. We propose a(More)
In this paper, a novel Automatic Repeat reQuest (ARQ) scheme is proposed, utilizing the Incremental Redundancy (IR) principle to the user and control data. A disadvantage of existing IR schemes is that the self adaptive property is only applied to the payload. In the novel scheme the whole communication -except a single feedback bit per transmission frameis(More)
  • 1