Recently, high reliability is required in digital communications. Research on error correcting codes are actively conducted to achieve high reliable communications. In this study, a method to reduce average computatio...
详细信息
ISBN:
(纸本)9781538620878
Recently, high reliability is required in digital communications. Research on error correcting codes are actively conducted to achieve high reliable communications. In this study, a method to reduce average computational complexity of Generalized Minimum Distance (GMD) decoding is proposed. GMD decoding can be implemented by several times bounded distance decoding (BDD). The proposed method reduces the average number of BDDs. The effectiveness of reduction on average execution time of the proposed method is confirmed against a simple method by computer simulations.
The goal of this paper is to describe a rather general approach for constructing upper and lower bounds for the average computational complexity of divide-and-conquer algorithms.
The goal of this paper is to describe a rather general approach for constructing upper and lower bounds for the average computational complexity of divide-and-conquer algorithms.
暂无评论