Based on the Berlekamp-Massy （BM） algorithm for Reed-Solomon（RS） decoding, an improved version is proposed, which focuses on how to find the error locator polynomial using least iterative operations. The condition...Based on the Berlekamp-Massy （BM） algorithm for Reed-Solomon（RS） decoding, an improved version is proposed, which focuses on how to find the error locator polynomial using least iterative operations. The conditions to end the iterative operations is derived. As a special case, criterion of only one error symbol in one received codeword is derived as well. Steps are listed concerning the implementation of the improved iterative decoding algorithm, which is carried out as software on the platform of TI＇s C6416 DSP. Decoding performance and decoding-delay of both improved and original algorithms under different （n,k） conditions are simulated. The results of simulations demonstrate that the improved algorithm has less computational complexity when the number of errors in a received codeword is relatively small. Therefore, in channels with low noise power spectrum density, the improved algorithm results in less decoding-delay than BM algorithm.展开更多
The paper deals with growth estimates and approximation（not necessarily entire） of solutions of certain elliptic partial differential equations. These solutions are called generalized bi-axially symmetric potentials...The paper deals with growth estimates and approximation（not necessarily entire） of solutions of certain elliptic partial differential equations. These solutions are called generalized bi-axially symmetric potentials（GBASP＇s）. To obtain more refined measure of growth, we have defined q-proximate order and obtained the characterization of generalized q-type and generalized lower q-type with respect to q-proximate order of a GBASP in terms of approximation errors and ratio of these errors in sup norm.展开更多
An approach is presented for computing integral values, such as areas and volumes of revo-lution . of regions bounded by rational plane B zier curves. The method approximates rational curveswith polynomial curves, an...An approach is presented for computing integral values, such as areas and volumes of revo-lution . of regions bounded by rational plane B zier curves. The method approximates rational curveswith polynomial curves, and then computes the integral values on those polynomial curves. Errorbounds are provided. For high precision, this new algorithm performs much more quickly than con-ventional numerical methods.展开更多
基金Sponsored by the National High Technology Research and Development Program of China ("863"Program) (2007AA01Z293)
文摘Based on the Berlekamp-Massy （BM） algorithm for Reed-Solomon（RS） decoding, an improved version is proposed, which focuses on how to find the error locator polynomial using least iterative operations. The conditions to end the iterative operations is derived. As a special case, criterion of only one error symbol in one received codeword is derived as well. Steps are listed concerning the implementation of the improved iterative decoding algorithm, which is carried out as software on the platform of TI＇s C6416 DSP. Decoding performance and decoding-delay of both improved and original algorithms under different （n,k） conditions are simulated. The results of simulations demonstrate that the improved algorithm has less computational complexity when the number of errors in a received codeword is relatively small. Therefore, in channels with low noise power spectrum density, the improved algorithm results in less decoding-delay than BM algorithm.
文摘The paper deals with growth estimates and approximation（not necessarily entire） of solutions of certain elliptic partial differential equations. These solutions are called generalized bi-axially symmetric potentials（GBASP＇s）. To obtain more refined measure of growth, we have defined q-proximate order and obtained the characterization of generalized q-type and generalized lower q-type with respect to q-proximate order of a GBASP in terms of approximation errors and ratio of these errors in sup norm.
文摘An approach is presented for computing integral values, such as areas and volumes of revo-lution . of regions bounded by rational plane B zier curves. The method approximates rational curveswith polynomial curves, and then computes the integral values on those polynomial curves. Errorbounds are provided. For high precision, this new algorithm performs much more quickly than con-ventional numerical methods.
