We present an optimized implementation of the Blahut-Arimoto algorithm via GPU parallelization, which we use to obtain improved upper bounds on the capacity of the binary deletion channel. In particular, our results imply that the capacity of the binary deletion channel with deletion probability $d$ is at most $0.3578(1-d)$ for all $d\geq 0.64$.

翻译：我们采用GPU并行化方式优化实现了Blahut-Arimoto算法，并据此获得了二进制删除信道容量的改进上界。具体而言，我们的结果表明：当删除概率$d\geq 0.64$时，二进制删除信道的容量不超过$0.3578(1-d)$。