A joint source channel coding scheme for binary (non necessarily symmetric) sources and binary symmetric channels with feedback is proposed and analyzed. IS is shown that the scheme performs optimally in the sense that the average number of channel uses per source symbol approaches the source entropy divided by the channel capacity. By taking advantage of obvious approximations, the scheme is implementable at low complexity and moderate latency. Simulation results show strong agreement between the performance of the analyzed optimal system and that of the low complexity implementation
展开▼
