1.4. Present the Chase-MP iterative decoding algorithm for GLD codes, and provide the performance analysis of the iterative algorithm by using the Gaussian approximation on the BI-AWGN channel: We give a fast hybrid method for the realization of Chase-II decoding, by which the low-complexity Chase-MP algorithm is designed based on the Tanner graph of the low-density matrix. By using
给出由乘积码构造GLD码的一般方法，将Chase-MP算法应用于乘积码迭代译码，与其它算法进行性能比较。 BI-AWGN和BI-Rayleigh衰落信道下的实验仿真表明，Chase-MP算法能够取得接近信道容量限的译码性能。
2.In comparison with the serially iterative Chase-2 algorithm, the Chase-MP algorithm is more convenient for fully parallelizable decoding and can achieve better performance.
与传统的串行迭代Chase-2算法相比,Chase-MP算法适合用于全并行译码处理,便于硬件实现, 而且译码性能优于串行迭代Chase-2算法。
3.By means of these sets, the number of test codes for Chase Ialgorithm can be reduced and the performance of Chase II algorithm can be improved.
利用这些重新构造的码集,可以大幅度减少ChaseⅠ算法的试探码,改进Chase Ⅱ算法的性能。
4.Pulse-chase results showed that no 35 S-AT protein could be detected in ATM culture supernatant. At 0 min chase time, 35 S-AT protein of ATM cell lysate was only 27 8% that of ATN.
脉冲追踪试验发现 ,在ATM转染的COS7细胞培养上清液中 ,检测不到3 5S标记的AT蛋白 ,在chase 0min时 ,ATM细胞内3 5S标记的AT蛋白只有ATN的 2 7 8% ;
5.The generalized threshold Chase algorithms called GTCⅠ, GTCⅡ, STC and fast soft decision error trap decoding are suggested.
本文提出了两种快速软判决译码算法:一是广义最小距寓译码(GMD)与Chase算法相结合、利用已经试探的译码错误信息、减少试探次数的广义门限Chase算法;
6.At 180 min chase time, it was about 50% that of 0 min chase time.
在chase 180min时 ,ATM细胞内3 5S标记的AT蛋白为 0min时的 5 0 %左右。
7.The skilled memory theory (Chase and Ericsson, 1982) demonstrated how retrieval structure helped expert to perform in recall tasks.
Chase & Ericsson的熟练记忆理论详细地阐述了提取结构如何帮助记忆专家执行记忆任务；
8.An algorithm for soft-decision decoding (15, 11) RS is presented, which refers to the Chase algorithm.
本文利用Chase算法的思想，将软判决译码应用到RS(15，11)码上，降低了译码的复杂度。
9.And a low-complexity erased Chase algorithm is developed.
提出了一种带删除的Chase算法,在译码性能和复杂度之间取得了比较好的折衷。
10.Cyclic-2 PML (Pseudo Maximum Likelihood) algorithm is of lower complexity compared with the traditional Chase algorithm when extended hamming code is used as the sub-code of Turbo Product Code(TPC).
采用扩展汉明码作为Turbo乘积码 (TPC)的子码时,与传统的Chase算法相比,Cyclic-2PML(循环 2伪最大似然)算法复杂度低。
