首页> 外国专利> Efficient implementation of M-algorithm based on QR decomposition for higher-order constellations

Efficient implementation of M-algorithm based on QR decomposition for higher-order constellations

机译:基于QR分解的高阶星座 M 算法的高效实现

摘要

A method of detecting received data in a communication system includes the steps of: performing a QR decomposition on a received input vector as a function of one or more characteristics of a communication channel over which the input vector was transmitted; generating a subset of best symbol candidates from a symbol constellation by comparing an input sample (corresponding to an element of the input vector) with one or more prescribed thresholds; identifying at least one symbol satisfying prescribed minimum Euclidian distance criteria among multiple ambiguity symbols in the subset of best symbol candidates; and generating a subset of best symbols including a prescribed number of symbols from the symbol constellation determined to be closest to the input sample. The subset of best symbols is used in a subsequent iteration of the steps of generating the subset of best symbol candidates and identifying at least one symbol satisfying the prescribed minimum Euclidian distance criteria.
机译:一种在通信系统中检测接收到的数据的方法,包括以下步骤:根据接收到的输入矢量,根据其上传输了输入矢量的通信信道的一个或多个特性,执行QR分解;通过将输入样本(对应于输入向量的元素)与一个或多个规定的阈值进行比较,从符号星座中生成最佳符号候选者的子集;在最佳符号候选者子集中的多个歧义符号中,识别至少一个满足规定的最小欧几里得距离标准的符号;从确定为最接近输入样本的符号星座中生成包括规定数量的符号的最佳符号的子集。最佳符号的子集用于以下步骤的后续迭代中:生成最佳符号候选者的子集,并标识至少一个满足规定的最小欧几里得距离准则的符号。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号