In this paper, we derive a lower bound on the minimum decoding delay for convolutional network codes, which provides us with a guide line in the performance of decoding delay for convolutional network code decoders. T...
详细信息
In this paper, we derive a lower bound on the minimum decoding delay for convolutional network codes, which provides us with a guide line in the performance of decoding delay for convolutional network code decoders. The lower bound can be achievable by the sequential decoder introduced by E. Erez and F. Feder. Then we discuss the relationship between the network topology and the minimum decoding delay. Finally, we illustrate our results by an example.
We show the existence of a good tree code with a sequential decoder for the exponential server timing channel. The expected number of computations before moving one step ahead is upper-bounded by a finite number. The ...
详细信息
We show the existence of a good tree code with a sequential decoder for the exponential server timing channel. The expected number of computations before moving one step ahead is upper-bounded by a finite number. The rate of information transfer for this code is mu/(2e) nats per second, i.e., one half of the capacity. The cutoff rate for the exponential server queue is therefore at least mu/(2e) nats per second.
Combining tree search detection with iterative detection-decoding allows achieving near-capacity performance in multiple antenna systems. In this contribution we show that the list sequential detector employing a Schn...
详细信息
Combining tree search detection with iterative detection-decoding allows achieving near-capacity performance in multiple antenna systems. In this contribution we show that the list sequential detector employing a Schnorr-Euchner enumeration strategy visits the minimum amount of tree nodes necessary to find a given number of hypotheses on the transmit signal which maximize the a posterior probability. It it thus the tree search scheme with lowest complexity for solving the soft output detection task optimally for a given list size.
We address distributed source coding with decoder side information, when the decoder observes the source through a noisy channel. Existing approaches employ syndrome- or parity-based channel codes. We propose a new ap...
详细信息
ISBN:
(纸本)9781424479948
We address distributed source coding with decoder side information, when the decoder observes the source through a noisy channel. Existing approaches employ syndrome- or parity-based channel codes. We propose a new approach based on distributed arithmetic coding (DAC). We introduce a DAC with forbidden symbol, which allows to tune the redundancy according to the amount of channel noise. We propose a novel sequential decoder that employs the known side information to decode the corrupted codeword. Experimental results show that the proposed scheme is better than parity-based turbo codes at relatively short block lengths.
暂无评论