Toward Optimizing Cauchy Matrix for Cauchy Reed-Solomon Code
编辑：admin日期：2012-12-20
访问次数：674
Toward Optimizing Cauchy Matrix for Cauchy Reed-Solomon Code
来源: IEEE COMMUNICATIONS LETTERS 卷: 13 期: 8 页: 603-605, 2009
CRS编码计算代价对其在实际应用中的性能有很大影响。该文主要研究如何构造一个可以产生有效CRS编码方案的合适柯西矩阵，并提出了相应的局部贪婪算法LGA。与现有的方法相比较，LGA需要较低的计算复杂度就可获得较好的性能。
The computational costs of Cauchy Reed-Solomon (CRS) encoding operation make a great impact on the performance of its practical applications. The letter concentrates on how to construct a good Cauchy matrix which can lead to an efficient CRS coding scheme, and presents a corresponding approximate method called localized greedy algorithm (LGA) to solve it. Compared with existing work, LGA requires much lower complexities to obtain the same performance of Cauchy matrices.