AG Kommunikationstheorie

Thema:

Discrete Signaling over General Channels

Abstract:

In practice, signaling points should be kept discrete and bounded. Capacity-achieving condition for discrete signaling was proved by former study and correspoding distribution was found by Blahut-Arimoto algorithm. Imagine we have large input alphabet, then we think about if it is possble to use only a small subset of it which can still achieve very close capacity compared with the original. Uniform distribution over the selected subset is considered first, and non-uniform follows. With algorithm design and simulation, it proves that the subset signaling scheme is realizable, possessing both good achieving capacity and high implementation efficiency.



zurück zur Terminübersicht