会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • POWER-REDUCED PRELIMINARY DECODED BITS IN VITERBI DECODERS
    • VITERBI解码器中的功率降低的初步解码器
    • US20110161787A1
    • 2011-06-30
    • US12647885
    • 2009-12-28
    • Andries Pieter HekstraWeihua Tang
    • Andries Pieter HekstraWeihua Tang
    • H03M13/23G06F11/10H04L23/02
    • H03M13/4184
    • Various embodiments relate to a storage unit and a related method in a Viterbi decoder for decoding a binary convolutional code with power efficiency. A storage unit for storing survivor paths may use a register exchange method to append additional information received from an add-compare-select unit onto the end of the survivor path. An exemplary method produces a prediction path after a specified depth in the survivor path processing history and subtracts the prediction path from the survivor path. This may cause a majority of bits that comprise the survivor path to be converted to a low-energy bit, such as a logical “0”. During subsequent copies of a differential survivor path using the register exchange method, less energy is consumed when copying the entire survivor path, as a majority of the bits in the survivor paths are a logical “0”.
    • 各种实施例涉及维特比解码器中的存储单元和相关方法,用于以功率效率对二进制卷积码进行解码。 用于存储幸存路径的存储单元可以使用寄存器交换方法将从加法比较选择单元接收到的附加信息附加到幸存路径的末端。 示例性方法在幸存路径处理历史中的指定深度之后产生预测路径,并从幸存路径中减去预测路径。 这可能导致构成幸存者路径的大多数位被转换为低能量位,例如逻辑“0”。 在使用寄存器交换方法的差分幸存者路径的随后复制期间,当复制整个幸存者路径时消耗较少的能量,因为幸存路径中的大多数位是逻辑“0”。
    • 4. 发明授权
    • Power-reduced preliminary decoded bits in viterbi decoders
    • 维特比解码器中功耗降低的初步解码位
    • US08566683B2
    • 2013-10-22
    • US12647885
    • 2009-12-28
    • Andries Pieter HekstraWeihua Tang
    • Andries Pieter HekstraWeihua Tang
    • H03M13/03
    • H03M13/4184
    • Various embodiments relate to a storage unit and a related method in a Viterbi decoder for decoding a binary convolutional code with power efficiency. A storage unit for storing survivor paths may use a register exchange method to append additional information received from an add-compare-select unit onto the end of the survivor path. An exemplary method produces a prediction path after a specified depth in the survivor path processing history and subtracts the prediction path from the survivor path. This may cause a majority of bits that comprise the survivor path to be converted to a low-energy bit, such as a logical “0”. During subsequent copies of a differential survivor path using the register exchange method, less energy is consumed when copying the entire survivor path, as a majority of the bits in the survivor paths are a logical “0”.
    • 各种实施例涉及维特比解码器中的存储单元和相关方法,用于以功率效率对二进制卷积码进行解码。 用于存储幸存路径的存储单元可以使用寄存器交换方法将从加法比较选择单元接收到的附加信息附加到幸存路径的末端。 示例性方法在幸存路径处理历史中的指定深度之后产生预测路径,并从幸存路径中减去预测路径。 这可能导致构成幸存者路径的大多数位被转换为低能量位,例如逻辑“0”。 在使用寄存器交换方法的差分幸存者路径的随后复制期间,当复制整个幸存者路径时消耗较少的能量,因为幸存路径中的大多数位是逻辑“0”。