会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Iterative decoding
    • 迭代解码
    • US07903766B2
    • 2011-03-08
    • US12637868
    • 2009-12-15
    • William Turin
    • William Turin
    • H04L27/06
    • H04L1/005H03M13/3746H03M13/3905H03M13/3933H04L1/0055H04L1/006
    • This invention provides an iterative process to maximum a posteriori (MAP) decoding. The iterative process uses an auxiliary function which is defined in terms of a complete data probability distribution. The auxiliary function is derived based on an expectation maximization (EM) algorithm. For a special case of trellis coded modulators, the auxiliary function may be iteratively evaluated by a combination of forward-backward and Viterbi algorithms. The iterative process converges monotonically and thus improves the performance of any decoding algorithm. The MAP decoding minimizes a probability of error. A direct approach to achieve this minimization results in complexity which grows exponentially with T, where T is the size of the input. The iterative process avoids this complexity by converging on the MAP solution through repeated maximization of the auxiliary function.
    • 本发明提供了一种用于最大化后验(MAP)解码的迭代过程。 迭代过程使用根据完整数据概率分布定义的辅助功能。 辅助功能是基于期望最大化(EM)算法导出的。 对于网格编码调制器的特殊情况,辅助功能可以通过前向后向和维特比算法的组合进行迭代评估。 迭代过程单调收敛,从而提高了任何解码算法的性能。 MAP解码使错误概率最小化。 实现这种最小化的直接方法导致复杂度随着T指数增长,其中T是输入的大小。 迭代过程通过辅助功能的重复最大化收敛在MAP解决方案上来避免这种复杂性。
    • 3. 发明申请
    • Training-Based Channel Estimation for Multiple-Antennas
    • 基于训练的多天线信道估计
    • US20100220803A1
    • 2010-09-02
    • US12777421
    • 2010-05-11
    • Naofal Al-DhahirChristine FragouliWilliam Turin
    • Naofal Al-DhahirChristine FragouliWilliam Turin
    • H04B7/02
    • H04B7/0684H04B7/0669H04B7/0848H04B7/0851H04B7/0854H04B7/0882H04L1/0618H04L25/0204H04L25/03006
    • The burden of designing multiple training sequences for systems having multiple transmit antennas, is drastically reduced by employing a single sequence from which the necessary multiple sequences are developed. The single sequence is selected to create sequences that have an impulse-like autocorrelation function and zero cross correlations. A sequence of any desired length Nt can be realized for an arbitrary number of channel taps, L. The created sequences can be restricted to a standard constellation (that is used in transmitting information symbols) so that a common constellation mapper is used for both the information signals and the training sequence. In some applications a training sequence may be selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.
    • 为具有多个发射天线的系统设计多个训练序列的负担通过采用从其开发必需的多个序列的单个序列而大大降低。 选择单个序列以创建具有脉冲状自相关函数和零交叉相关的序列。 可以对任意数量的信道抽头L实现任何期望长度Nt的序列。所创建的序列可以被限制为标准星座(用于发送信息符号),使得公共星座映射器被用于 信息信号和训练序列。 在一些应用中,可以选择训练序列,使得它用与编码信息符号相同的编码器进行编码。 在采用这种方法的实施例中,块和网格编码都是可能的。
    • 4. 发明授权
    • Training-based channel estimation for multiple-antennas
    • 基于训练的多天线信道估计
    • US07746945B2
    • 2010-06-29
    • US11190403
    • 2005-07-27
    • Naofal Al-DhahirChristine FragouliWilliam Turin
    • Naofal Al-DhahirChristine FragouliWilliam Turin
    • H04B7/02H04L1/02
    • H04B7/0684H04B7/0669H04B7/0848H04B7/0851H04B7/0854H04B7/0882H04L1/0618H04L25/0204H04L25/03006
    • The burden of designing multiple training sequences for systems having multiple transmit antennas, is drastically reduced by employing a single sequence from which the necessary multiple sequences are developed. The single sequence is selected to create sequences that have an impulse-like autocorrelation function and zero cross correlations. A sequence of any desired length Nt can be realized for an arbitrary number of channel taps, L. The created sequences can be restricted to a standard constellation (that is used in transmitting information symbols) so that a common constellation mapper is used for both the information signals and the training sequence. In some applications a a training sequence may be selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.
    • 为具有多个发射天线的系统设计多个训练序列的负担通过采用从其开发必需的多个序列的单个序列而大大降低。 选择单个序列以创建具有脉冲状自相关函数和零交叉相关的序列。 可以对任意数量的信道抽头L实现任何期望长度Nt的序列。所创建的序列可以被限制为标准星座(用于发送信息符号),使得公共星座映射器被用于 信息信号和训练序列。 在一些应用中,可以选择训练序列,使得它用与用于对信息符号进行编码的相同编码器进行编码。 在采用这种方法的实施例中,块和网格编码都是可能的。
    • 5. 发明申请
    • Iterative Decoding
    • 迭代解码
    • US20100091914A1
    • 2010-04-15
    • US12637868
    • 2009-12-15
    • William Turin
    • William Turin
    • H04L27/00
    • H04L1/005H03M13/3746H03M13/3905H03M13/3933H04L1/0055H04L1/006
    • This invention provides an iterative process to maximum a posteriori (MAP) decoding. The iterative process uses an auxiliary function which is defined in terms of a complete data probability distribution. The auxiliary function is derived based on an expectation maximization (EM) algorithm. For a special case of trellis coded modulators, the auxiliary function may be iteratively evaluated by a combination of forward-backward and Viterbi algorithms. The iterative process converges monotonically and thus improves the performance of any decoding algorithm. The MAP decoding minimizes a probability of error. A direct approach to achieve this minimization results in complexity which grows exponentially with T, where T is the size of the input. The iterative process avoids this complexity by converging on the MAP solution through repeated maximization of the auxiliary function.
    • 本发明提供了一种用于最大化后验(MAP)解码的迭代过程。 迭代过程使用根据完整数据概率分布定义的辅助功能。 辅助函数是基于期望最大化(EM)算法导出的。 对于网格编码调制器的特殊情况,辅助功能可以通过前向后向和维特比算法的组合进行迭代评估。 迭代过程单调收敛,从而提高了任何解码算法的性能。 MAP解码使错误概率最小化。 实现这种最小化的直接方法导致复杂度随着T成指数增长,其中T是输入的大小。 迭代过程通过辅助功能的重复最大化收敛在MAP解决方案上来避免这种复杂性。
    • 8. 发明授权
    • Method and system for decoding distorted image and symbology data
    • 用于解码失真图像和符号系统数据的方法和系统
    • US5780830A
    • 1998-07-14
    • US687124
    • 1996-07-24
    • Robert Albert BoieWilliam Turin
    • Robert Albert BoieWilliam Turin
    • G06K7/00G06K7/10G06K7/14
    • G06K7/14
    • Disclosed is a system and method for reading and decoding distorted data, e.g., bar code label or other symbology data, by fitting a scanned signal model j(t, .theta.), using a Deterministic Expectation-Maximization (DEM) algorithm, to the measured or detected data signal y(t). The DEM algorithm, which is a novel variation of the conventional Expectation-Maximization (EM) algorithm, enables the system and method according to the invention to determine the values of a plurality of parameters .theta. defining the scanned signal model j(t, .theta.) as it is being fitted to the measured data signal y(t). Based on these values, characteristic information such as data elements or symbols encoded within the image data are generated using conventional signal processing techniques. The use of the DEM algorithm advantageously deblurs the signal by reducing the effects of intersymbol interference. In an alternative embodiment, the DEM algorithm is supplemented by a conventional zero crossings decoding technique. In this manner, the zero crossings technique is used to obtain initial parameter estimates for the DEM algorithm in determining the parameters .theta. of the scanned signal model j(t, .theta.).
    • 公开了一种用于通过使用确定性期望最大化(DEM)算法将扫描信号模型j(t,θ)拟合到所测量的,用于读取和解码失真数据(例如条形码标签或其他符号系统数据)的系统和方法 或检测数据信号y(t)。 DEM算法是常规期望最大化(EM)算法的新颖变型,使得根据本发明的系统和方法可以确定定义扫描信号模型j(t,θ)的多个参数θ的值, 因为它被拟合到测量数据信号y(t)。 基于这些值,使用传统的信号处理技术生成诸如数据元素或在图像数据内编码的符号之类的特征信息。 使用DEM算法有利地通过减少符号间干扰的影响来消除信号。 在替代实施例中,DEM算法由传统的过零点解码技术补充。 以这种方式,过零点技术用于在确定扫描信号模型j(t,θ)的参数θ时获得DEM算法的初始参数估计。