公开(公告)号：US20090316840A1

公开(公告)日：2009-12-24

申请号：US12211935

申请日：2008-09-17

申请人： Jong Hyeon Park ,  Brian Clark Banister ,  Inyup Kang ,  Je Woo Kim ,  James Y. Hurt ,  Matthias Brehler

发明人： Jong Hyeon Park ,  Brian Clark Banister ,  Inyup Kang ,  Je Woo Kim ,  James Y. Hurt ,  Matthias Brehler

IPC分类号： H04L27/06

CPC分类号： H04L1/0631 ,  H04L1/0662

摘要： Space time coding (STC) may be applied at the transmitter adding redundant information in both space and time dimensions. At the receiver, the received STC signal may be decoded using a spatial multiplexing MIMO decoding, for example, based on either Minimum Mean Square Error (MMSE) or maximum-likelihood (ML) algorithms. A selective STC decoder may incorporate both the conventional maximum ratio combining (MRC) decoding scheme and a MIMO decoding scheme. One of the STC decoding schemes may be selected, for example, based on estimated channel conditions in order to achieve a trade-off between error rate performance and computational complexity. Components used for a non-selected scheme may be powered down.

摘要翻译： 空间时间编码（STC）可以在发射机上应用于空间和时间维度上的冗余信息。 在接收机处，可以使用例如基于最小均方误差（MMSE）或最大似然（ML）算法的空间复用MIMO解码来解码所接收的STC信号。 选择性STC解码器可以并入传统的最大比组合（MRC）解码方案和MIMO解码方案。 可以例如基于估计的信道条件来选择STC解码方案之一，以便实现错误率性能和计算复杂度之间的权衡。 用于未选择方案的组件可能会关闭电源。

公开(公告)号：US08923424B2

公开(公告)日：2014-12-30

申请号：US12711128

申请日：2010-02-23

申请人： Michael L. McCloud ,  Matthias Brehler ,  Ju Won Park ,  Jong Hyeon Park ,  Je Woo Kim ,  Inyup Kang ,  Brian C. Banister

发明人： Michael L. McCloud ,  Matthias Brehler ,  Ju Won Park ,  Jong Hyeon Park ,  Je Woo Kim ,  Inyup Kang ,  Brian C. Banister

IPC分类号： H04B7/02 ,  H04L25/03 ,  H04B7/04

CPC分类号： H04L25/03229 ,  H04B7/0413 ,  H04L25/03242 ,  H04L25/03318 ,  H04L2025/0342 ,  H04L2025/03426

摘要： Providing for reduced complexity or improved accuracy in de-mapping received wireless data streams for multi-channel wireless communication is described herein. By way of example, a low-complexity likelihood algorithm can be employed to de-map data bits from the wireless data streams. In one particular example, the likelihood algorithm can approximate a received bit with a subset of received wireless symbols correlated the bit, reducing algorithm complexity. In other examples, a limited set of received wireless symbols can be employed for the subset, further reducing algorithm complexity. According to at least one other example, logarithmic terms of the algorithm can be approximated with non-logarithmic functions, such as a look-up table, series expansion, polynomial approximation, or the like. These approximations can enhance symbol de-mapping accuracy while maintaining or improving processing overhead for a wireless receiver.

摘要翻译： 本文描述了为了解复用用于多信道无线通信的接收的无线数据流而提供降低的复杂度或提高的精度。 作为示例，可以采用低复杂度似然算法来从无线数据流解映射数据比特。 在一个特定示例中，似然算法可以用接收到的无线符号的子集近似接收到的比特，从而降低算法的复杂度。 在其他示例中，可以对该子集采用有限的一组接收到的无线符号，进一步降低了算法的复杂度。 根据至少另一个示例，算法的对数项可以用非对数函数来近似，例如查找表，串联展开，多项式近似等。 这些近似可以增强符号解映射精度，同时保持或改善无线接收机的处理开销。

公开(公告)号：US20110206151A1

公开(公告)日：2011-08-25

申请号：US12711128

申请日：2010-02-23

申请人： Michael L. McCloud ,  Matthias Brehler ,  Ju Won Park ,  Jong Hyeon Park ,  Je Woo Kim ,  Inyup Kang ,  Brian C. Banister

发明人： Michael L. McCloud ,  Matthias Brehler ,  Ju Won Park ,  Jong Hyeon Park ,  Je Woo Kim ,  Inyup Kang ,  Brian C. Banister

IPC分类号： H04L1/02 ,  H04L27/06

CPC分类号： H04L25/03229 ,  H04B7/0413 ,  H04L25/03242 ,  H04L25/03318 ,  H04L2025/0342 ,  H04L2025/03426

摘要： Providing for reduced complexity or improved accuracy in de-mapping received wireless data streams for multi-channel wireless communication is described herein. By way of example, a low-complexity likelihood algorithm can be employed to de-map data bits from the wireless data streams. In one particular example, the likelihood algorithm can approximate a received bit with a subset of received wireless symbols correlated the bit, reducing algorithm complexity. In other examples, a limited set of received wireless symbols can be employed for the subset, further reducing algorithm complexity. According to at least one other example, logarithmic terms of the algorithm can be approximated with non-logarithmic functions, such as a look-up table, series expansion, polynomial approximation, or the like. These approximations can enhance symbol de-mapping accuracy while maintaining or improving processing overhead for a wireless receiver.

摘要翻译： 本文描述了为了解复用用于多信道无线通信的接收的无线数据流而提供降低的复杂度或提高的精度。 作为示例，可以采用低复杂度似然算法来从无线数据流解映射数据比特。 在一个特定示例中，似然算法可以用接收到的无线符号的子集近似接收到的比特，从而降低算法的复杂度。 在其他示例中，可以对该子集采用有限的一组接收到的无线符号，进一步降低了算法的复杂度。 根据至少另一个示例，算法的对数项可以用非对数函数来近似，例如查找表，串联展开，多项式近似等。 这些近似可以增强符号解映射精度，同时保持或改善无线接收机的处理开销。

公开(公告)号：US08229013B2

公开(公告)日：2012-07-24

申请号：US12211928

申请日：2008-09-17

申请人： Jong Hyeon Park ,  Allert van Zelst ,  Brian Clarke Banister ,  Je Woo Kim ,  Matthias Brehler ,  Vincent K. Jones, IV

发明人： Jong Hyeon Park ,  Allert van Zelst ,  Brian Clarke Banister ,  Je Woo Kim ,  Matthias Brehler ,  Vincent K. Jones, IV

IPC分类号： H04L5/12 ,  H03D1/00

CPC分类号： H04L25/03171 ,  H04L25/03197 ,  H04L25/03331 ,  H04L2025/03414 ,  H04L2025/03426

摘要： A “post-squaring” detection algorithm, and related devices, that may reduce the complexity of maximum likelihood detection (MLD) schemes while preserving their performance is provided. Rather than search for optimum metrics (such as minimum distance metrics) based on squared norm values, a search may be based on un-squared norm metrics, and the squaring may be postponed, for example, until subsequent log-likelihood ratio (LLR) computation. For certain embodiments, approximations of un-squared norm values may significantly reduce computation complexity.

摘要翻译： 提供了可以降低最大似然检测（MLD）方案的复杂性同时保持其性能的“后置”检测算法和相关设备。 搜索可以基于平方范数，而不是基于平方范数搜索最佳度量（例如最小距离度量），并且可以延迟平方，例如直到后续的对数似然比（LLR） 计算。 对于某些实施例，非平方范数值的近似可以显着降低计算复杂度。

公开(公告)号：US08243775B2

公开(公告)日：2012-08-14

申请号：US12337641

申请日：2008-12-18

申请人： Junqiang Li ,  Je Woo Kim ,  Jong Hyeon Park ,  Matthias Brehler

发明人： Junqiang Li ,  Je Woo Kim ,  Jong Hyeon Park ,  Matthias Brehler

IPC分类号： H04L1/7083

CPC分类号： H04L27/2659 ,  H04J11/0073 ,  H04L27/2675 ,  H04L27/2684

摘要： Techniques for initial wireless network synchronization by a mobile station are provided. For certain embodiments, the techniques may involve a joint search for the cell identification (ID-cell index) and the coarse carrier frequency offset (CFO) estimation. For certain embodiments, the techniques may be based on hard correlation and binary differential despreading that substantially simplifies computational complexity compare to known techniques that independently search for the ID-cell index and perform CFO estimation.

摘要翻译： 提供了由移动台进行初始无线网络同步的技术。 对于某些实施例，这些技术可以涉及对小区标识（ID-小区索引）和粗略载波频率偏移（CFO）估计的联合搜索。 对于某些实施例，该技术可以基于硬相关和二进制差分解扩，其与独立地搜索ID小区索引并执行CFO估计的已知技术相比基本上简化了计算复杂度。

公开(公告)号：US20100067597A1

公开(公告)日：2010-03-18

申请号：US12211928

申请日：2008-09-17

申请人： Jong Hyeon Park ,  Allert van Zelst ,  Brian Clarke Banister ,  Je Woo Kim ,  Matthias Brehler ,  Vincent K. Jones, IV

发明人： Jong Hyeon Park ,  Allert van Zelst ,  Brian Clarke Banister ,  Je Woo Kim ,  Matthias Brehler ,  Vincent K. Jones, IV

IPC分类号： H04L5/12

CPC分类号： H04L25/03171 ,  H04L25/03197 ,  H04L25/03331 ,  H04L2025/03414 ,  H04L2025/03426

摘要： A “post-squaring” detection algorithm, and related devices, that may reduce the complexity of maximum likelihood detection (MLD) schemes while preserving their performance is provided. Rather than search for optimum metrics (such as minimum distance metrics) based on squared norm values, a search may be based on un-squared norm metrics, and the squaring may be postponed, for example, until subsequent log-likelihood ratio (LLR) computation. For certain embodiments, approximations of un-squared norm values may significantly reduce computation complexity.

摘要翻译： 提供了可以降低最大似然检测（MLD）方案的复杂性同时保持其性能的“后置”检测算法和相关设备。 搜索可以基于平方范数，而不是基于平方范数搜索最佳度量（例如最小距离度量），并且可以延迟平方，例如直到后续的对数似然比（LLR） 计算。 对于某些实施例，非平方范数值的近似可以显着降低计算复杂度。

公开(公告)号：US20100091912A1

公开(公告)日：2010-04-15

申请号：US12351820

申请日：2009-01-10

申请人： Jong Hyeon Park ,  Matthias Brehler ,  Brian Clarke Banister ,  Albert van Zelst ,  Tae Ryun Chang ,  Vincent K. Jones ,  Je Woo Kim

发明人： Jong Hyeon Park ,  Matthias Brehler ,  Brian Clarke Banister ,  Albert van Zelst ,  Tae Ryun Chang ,  Vincent K. Jones ,  Je Woo Kim

IPC分类号： H04L27/06

CPC分类号： H04L25/03171 ,  H04L5/0023 ,  H04L25/03197 ,  H04L25/03331 ,  H04L2025/03414 ,  H04L2025/03426

摘要： Certain embodiments of the present disclosure provide techniques for approximate computation of l2 norms as a part of the maximum likelihood (ML) detection: tri-maxmin, maxsum and sortsum algorithms. The proposed approximation schemes show better accuracy than conventional approximation schemes—the abssum and maxmin algorithms, while the computational complexity is very similar. The error rate performance of the ML detection that utilizes proposed norm-approximation techniques are very close to the reference ML detection with exact calculation of l2 norms, while the computational complexity is significantly smaller.

摘要翻译： 本公开的某些实施例提供了作为最大似然（ML）检测的一部分近似计算l2范数的技术：tri-maxmin，maxsum和sortsum算法。 所提出的近似方案显示出比传统的近似方案更好的精度 - abssum和maxmin算法，而计算复杂度非常相似。 利用提出的范数近似技术的ML检测的误码率性能与精确计算l2范数的参考ML检测非常接近，而计算复杂度显着更小。

公开(公告)号：US08726138B2

公开(公告)日：2014-05-13

申请号：US12250169

申请日：2008-10-13

申请人： Ju Won Park ,  Brian Banister ,  Je Woo Kim ,  Jong Hyeon Park ,  Matthias Brehler ,  Remi Gurski ,  Tae Chang

发明人： Ju Won Park ,  Brian Banister ,  Je Woo Kim ,  Jong Hyeon Park ,  Matthias Brehler ,  Remi Gurski ,  Tae Chang

IPC分类号： H03M13/00

CPC分类号： H03M13/413 ,  H03M13/3723 ,  H03M13/3955 ,  H03M13/3972 ,  H03M13/6544

摘要： A method and apparatus for decoding of tailbiting convolutional codes (TBCC) are disclosed. The proposed modified maximum-likelihood TBCC decoding technique preserves error correction performance of optimal maximum-likelihood based TBCC decoding, while the computational complexity is substantially decreased since a reduced number of decoding states has been evaluated. Compare to other sub-optimal TBCC decoding algorithms, modified maximum-likelihood TBCC decoding achieves improved packet error rate performance with similar computational complexity.

摘要翻译： 公开了一种用于解码尾部卷积码（TBCC）的方法和装置。 所提出的修改的最大似然TBCC解码技术保留了最佳最大似然度TBCC解码的纠错性能，同时由于已经减少了解码状态数量，所以计算复杂度显着降低。 与其他次优TBCC解码算法相比，修改的最大似然TBCC解码实现了具有类似计算复杂度的改进的分组错误率性能。

公开(公告)号：US08374274B2

公开(公告)日：2013-02-12

申请号：US12351820

申请日：2009-01-10

申请人： Jong Hyeon Park ,  Matthias Brehler ,  Brian Clarke Banister ,  Albert van Zelst ,  Tae Ryun Chang ,  Vincent K. Jones ,  Je Woo Kim

发明人： Jong Hyeon Park ,  Matthias Brehler ,  Brian Clarke Banister ,  Albert van Zelst ,  Tae Ryun Chang ,  Vincent K. Jones ,  Je Woo Kim

IPC分类号： H04B7/02 ,  H04L1/02

CPC分类号： H04L25/03171 ,  H04L5/0023 ,  H04L25/03197 ,  H04L25/03331 ,  H04L2025/03414 ,  H04L2025/03426

摘要： Certain embodiments of the present disclosure provide techniques for approximate computation of l2 norms as a part of the maximum likelihood (ML) detection: tri-maxmin, maxsum and sortsum algorithms. The proposed approximation schemes show better accuracy than conventional approximation schemes—the abssum and maxmin algorithms, while the computational complexity is very similar. The error rate performance of the ML detection that utilizes proposed norm-approximation techniques are very close to the reference ML detection with exact calculation of l2 norms, while the computational complexity is significantly smaller.

摘要翻译： 本公开的某些实施例提供了作为最大似然（ML）检测的一部分近似计算l2范数的技术：tri-maxmin，maxsum和sortsum算法。 所提出的近似方案显示出比传统的近似方案更好的精度 - abssum和maxmin算法，而计算复杂度非常相似。 利用提出的范数近似技术的ML检测的误码率性能与精确计算l2范数的参考ML检测非常接近，而计算复杂度显着更小。

公开(公告)号：US20100158079A1

公开(公告)日：2010-06-24

申请号：US12337641

申请日：2008-12-18

申请人： Junqiang Li ,  Je Woo Kim ,  Jong Hyeon Park ,  Matthias Brehler

发明人： Junqiang Li ,  Je Woo Kim ,  Jong Hyeon Park ,  Matthias Brehler

IPC分类号： H04B1/707

CPC分类号： H04L27/2659 ,  H04J11/0073 ,  H04L27/2675 ,  H04L27/2684

摘要： Techniques for initial wireless network synchronization by a mobile station are provided. For certain embodiments, the techniques may involve a joint search for the cell identification (ID-cell index) and the coarse carrier frequency offset (CFO) estimation. For certain embodiments, the techniques may be based on hard correlation and binary differential despreading that substantially simplifies computational complexity compare to known techniques that independently search for the ID-cell index and perform CFO estimation.

摘要翻译： 提供了由移动台进行初始无线网络同步的技术。 对于某些实施例，这些技术可以涉及对小区标识（ID-小区索引）和粗略载波频率偏移（CFO）估计的联合搜索。 对于某些实施例，该技术可以基于硬相关和二进制差分解扩，其与独立地搜索ID小区索引并执行CFO估计的已知技术相比基本上简化了计算复杂度。