Abstract (EN):
When correlated sources are to be communicated over a network to more than one sink, joint source-network
coding is in general required for information theoretically optimal transmission. Whereas on the encoder side simple randomized schemes based on linear codes suffice, the decoder is required to perform joint source-network decoding which is computationally expensive. Focusing on maximum a-posteriori decoders (or conditional mean estimators, in the case of continuous sources), we
show how to exploit (structural) knowledge about the network topology as well as the source correlations giving rise to an efficient decoder implementation (in some cases even with linear dependency on the number of nodes). In particular, we show how to statistically represent the overall system (including the messages) by a factor-graph on which the sum-product algorithm can be run. A proof-of-concept is provided in the form of a
working decoder for the case of three sources and two sinks.
Language:
Portuguese
Type (Professor's evaluation):
Scientific