论文部分内容阅读
Based on the synthesis and analysis of recursive receivers, a new algorithm, namely partial grouping maximization likelihood algorithm, is proposed to achieve satisfactory performance with moderate computational complexity.During the analysis, some interesting properties shared by the proposed procedures are described.Finally, the performance assessment shows that the new scheme is superior to the linear detector and ordinary grouping algorithm, and achieves a bit-error rate close to that of the optimum receiver.
Based on the synthesis and analysis of recursive receivers, a new algorithm, namely partial grouping maximization likelihood algorithm, is proposed to achieve satisfactory performance with moderate computational complexity. Playing the analysis, some interesting properties shared by the proposed procedures are described .Finally, the performance assessment shows that the new scheme is superior to the linear detector and ordinary grouping algorithm, and achieves a bit-error rate close to that of the optimum receiver.