Simon Huettinger

Learn More
When the same data sequence is transmitted over two independent channels, or when a data sequence is transmitted twice but independently over the same channel, the independent observations can be combined at the receiver side. From an information-theory point of view, the overall mutual information between the data sequence and the received sequences(More)
Recent literature presents methods for the analysis of concatenated coding schemes by solely characterizing the behavior of the component codes [4], [12], [16], [9], [7]. Component codes are analyzed either analytically using unique properties of special component codes, e.g., single–parity–check code or accumulator, or via simulations. The goals of this(More)
For the construction of low rate turbo– codes, the concept of multiple parallel concatenated codes, i.e. the “multiple–turbo–code” has been successfully employed e.g. in [13, 16]. Analysis of this structure has been done via simulations [16] or the analysis of equivalent coding schemes [13]. In this paper we extend the method of EXIT charts [5], that has(More)
Recent literature presents methods for the analysis of concatenated coding schemes by solely characterizing the behavior of the component codes [4, 12, 14, 9, 7]. Component codes are analyzed either analytically using unique properties of special component codes, e.g., single–parity–check code or accumulator, or via simulations. The goals of this paper are(More)
| Recently very good iterative decoding performance close to Shannon's capacity limit [12] has been obtained by using a serially concatenated structure consisting of an outer repetition code and an inner rate one scrambler [5, 7]. In this paper we show that these codes can also be interpreted as parallel concatenated \turbo" codes, if we apply some(More)
In the low signal-to-noise ratio regime, the performance of concatenated coding schemes is limited by the convergence properties of the iterative decoder. Idealizing the model of iterative decoding by an independence assumption, which represents the case in which the codeword length is infinitely large, leads to analyzable structures from which this(More)
The rapid progress of power line communications (PLC) for data transmission over electric power supply systems is now opening ways for special applications such as train automation in local transportation and mass transit (MT) systems. These DC-powered traction networks can be used as communication links between wayside equipment and the moving trains. As(More)
For coded transmission over a memoryless channel, two kinds of mutual information are considered: the mutual information between a code symbol and its noisy observation and the overall mutual information between encoder input and decoder output. The overall mutual information is interpreted as a combination of the mutual informations associated with the(More)