5 . according to the euclidean algorithm rs encoder and decoder are implemented in fpga 根據(jù)euclid迭代譯碼算法,用fpga設(shè)計(jì)實(shí)現(xiàn)了rs碼編譯碼器。
This paper emphasizes on the most popular rs decoding algorithm : berlekamp ? massey algorithm and euclidean algorithm , and their improved form 本文重點(diǎn)研究了最流行的兩種rs解碼算法? berlekamp ? massey算法和euclidean算法及其各種改進(jìn)形式。
Because the method proposed here does n ' t use the euclidean algorithm , it is easy to solve the coefficients . moreover , its results are the same as that obtained by other methods 因?yàn)樵摲椒]有采用采用歐幾里德算法,所以算法簡單,易于實(shí)現(xiàn),且與其它方法獲得的提升系數(shù)相同。
In this paper , a new architecture of hardware decoder based on the modified euclidean algorithm ( mea ) is provided , and it is called the fprme ( fully - pipelined recursive modified euclidean ) decoder 本文基于修正的歐幾里德算法( mea )設(shè)計(jì)了一種新的硬件解碼器實(shí)現(xiàn)結(jié)構(gòu),稱其為fprme ( fully - pipelinedrecursivemodifiedeuclidean )解碼器。
Firstly , a 52 degree univariate polynomial equation is deduced by using resultant elimination method . 6 extraneous roots are found during the process to obtain the other 3 variables by using euclidean algorithm 首先使用結(jié)式對(duì)4個(gè)多項(xiàng)式方程直接消元,得到1個(gè)一元52次的多項(xiàng)式方程,再用輾轉(zhuǎn)相除法求其他3個(gè)變量,在此過程中發(fā)現(xiàn)了6個(gè)增根。
Methods of estimating baud rate , signal to noise ratio ( snr ) and reference phase are investigated . a modified euclidean algorithm is proposed to estimate baud rate of the burst packets . a cumulant based algorithm of estimating snr of star - qam is proposed which has better estimation performance in medium scope of snr 研究了自適應(yīng)調(diào)制中波特率,信噪比和載波相位等參數(shù)的估計(jì)算法;提出一種基于修改的歐幾里得算法的波特率估計(jì)算法,這種算法可以對(duì)突發(fā)分組的波特率做出準(zhǔn)確估計(jì);提出一種星型qam信號(hào)的信噪比估計(jì)算法,在中等信噪比條件下,具有較好估計(jì)性能。
The evaluation criterion of the performance and the taxonomy for wireless sensor networks self - localization system and algorithms are described , the principles and characteristics of recent representative localization approaches are discussed and presented in detail . 3 . based on the euclidean algorithm 2 、綜述了無線傳感器網(wǎng)絡(luò)自身定位算法和系統(tǒng)的性能評(píng)價(jià)指標(biāo)、分類方法,在研究和比較現(xiàn)有的典型算法和系統(tǒng)的基礎(chǔ)上,對(duì)現(xiàn)有的無限傳感器網(wǎng)絡(luò)定位系統(tǒng)和算法進(jìn)行分析和總結(jié)。
In this paper , the common used encoding algorithms and basic finite - field opera - tions algorithms are introduced , and the decoding algorithms such as inverse - free ber - lekamp - massey ( ibm ) algorithm , reformulated inverse - free berlekamp - massey ( ribm ) algorithm and modified euclidean algorithm are analyzed in great detail . based on the ribm algorithm , a modified structure and a pipelined decoder scheme are presented . a tradeoff has been made between the hardware complexities and decoding latency , thus this scheme gains significant improvement in hardware complexity and maximum fre - quency 本文簡要介紹了有限域基本運(yùn)算的算法和常用的rs編碼算法,詳細(xì)分析了改進(jìn)后的euclid算法和改進(jìn)后的bm算法,針對(duì)改進(jìn)后的bm算法提出了一種流水線結(jié)構(gòu)的譯碼器實(shí)現(xiàn)方案并改進(jìn)了該算法的實(shí)現(xiàn)結(jié)構(gòu),在譯碼器復(fù)雜度和譯碼延時(shí)上作了折衷,降低了譯碼器的復(fù)雜度并提高了譯碼器的最高工作頻率。
百科解釋
In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, also known as the greatest common factor (GCF) or highest common factor (HCF). It is named after the Greek mathematician Euclid, who described it in Books?VII and X of his Elements.