会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • METHOD OF REDUCED STATE DECODING AND DECODER THEREOF
    • 减少状态解码的方法及其解码器
    • US20170019222A1
    • 2017-01-19
    • US15203498
    • 2016-07-06
    • Yiqun GeWuxian Shi
    • Yiqun GeWuxian Shi
    • H04L5/00H04B7/26
    • H04L5/0007H04B7/2628
    • Methods and devices are disclosed for receiving and decoding sparsely encoded data sequences using a message passing algorithm (MPA) or maximum likelihood sequence estimation (MLSE). Such data sequences may be used in wireless communications systems supporting multiple access, such as sparse code multiple access (SCMA) systems. The Methods and devices reduce the number of states in a search space for each received signal and associated function node based on a search threshold based on a characteristic related to the received signal and/or to a quality of a resource element over which the received signal is transmitted.
    • 公开了使用消息传递算法(MPA)或最大似然序列估计(MLSE)来接收和解码稀疏编码的数据序列的方法和装置。 这样的数据序列可以用于支持多个接入的无线通信系统,例如稀疏码多址(SCMA)系统。 方法和装置基于与接收信号相关的特征和/或资源元素的质量,基于搜索阈值来减少每个接收信号和相关联功能节点在搜索空间中的状态数量, 被传送。
    • 7. 发明申请
    • DECODING METHOD FOR TAIL-BITING CONVOLUTIONAL CODES USING A SEARCH DEPTH VITERBI ALGORITHM
    • 使用搜索深度维特比算法解码转换代码的解码方法
    • US20070245209A1
    • 2007-10-18
    • US11687543
    • 2007-03-16
    • Wuxian SHIJuan DUYiqun GEGuobin SUN
    • Wuxian SHIJuan DUYiqun GEGuobin SUN
    • H03M13/00
    • H03M13/3938H03M13/413H03M13/6362H03M13/6502H03M13/6505H04L1/0054H04L1/0059
    • A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as “previous output.” A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.
    • 一种用于解码尾巴卷积码的方法。 该方法包括初始化校正深度,从一组编码状态中选择第一起始状态,以及将所选择的起始状态的度量值初始化为零,将其他状态初始化为无穷大。 读取输入比特流,执行搜索深度维特比算法(SDVA)以确定路径度量并识别最小度量路径。 确定最小度量路径的结束状态,将该结束状态的输出识别为“先前输出”。 第二起始状态被设置为最小度量路径的结束状态,并且读取等于来自先前输出的校正深度的符号。 在第二组读符号上执行SDVA以产生校正输出。 通过使用校正输出替换先前输出开始处的符号来产生解码输出。