利用广义似然比检验（GLRT）解码算法，导出了成对符号错误概率（PEP）上限和码的设计准则。
The chernoff upper bound of the pairwise error probability(PEP) and the code design criteria are derived by means of the generalized likelihood-ratio test(GLRT) decoding algorithm.
从精确成对错误概率(PEP)出发，推导得到了DUST调制群码符号误码率(sep)的联合边界。
Starting from the precise pair-wise error probability (PEP), the joint border of group coding signal error probability (SEP) in differential unitary space-time (DUST) modulation is deduced.
仿真结果表明，与已有的分组检测算法相比，新方法具有更低的分组检测错误概率，同时也改善了符号精定时的精度。
Simulation results show that the new detector has a lower packet detect error rate and a higher symbol timing precision compared with the existing schemes.
仿真结果表明，与已有的分组检测算法相比，新方法具有更低的分组检测错误概率，同时也改善了符号精定时的精度。
Simulation results show that the new detector has a lower packet detect error rate and a higher symbol timing precision compared with the existing schemes.
应用推荐