会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Error-erasure decoding of interleaved reed-solomon code
    • 交织的芦苇码的错误解码解码
    • US07254771B1
    • 2007-08-07
    • US09577177
    • 2000-05-23
    • Leilei SongMeng-Lin Yu
    • Leilei SongMeng-Lin Yu
    • H03M13/00
    • H03M13/154H03M13/2954H03M13/6561
    • A method of decoding interleaved Reed-Solomon codes to achieve an improved performance for burst errors is described. The method takes advantage of both interleaving and erasure decoding to increase the error correcting capability of a system without necessarily depending on channel reliability information. The observed correlation of burst errors in interleaved systems is advantageously used to achieve an improved error-correcting system, wherein a first code word is decoded, and the error locations in the first codeword are used to determine erasures for the remaining code words in the same interleaving block, and finally, decoding the remaining code words in parallel.
    • 描述了对交错的里德 - 所罗门码进行解码以实现突发错误的改进性能的方法。 该方法利用交织和擦除解码来增加系统的纠错能力,而不必依赖于信道可靠性信息。 观察到交织系统中突发错误的相关性有利地用于实现改进的纠错系统,其中第一码字被解码,并且第一码字中的错误位置被用于确定相同的剩余码字的擦除 交织块,最后并行解码剩余码字。
    • 8. 发明授权
    • Parallel processing decision-feedback equalizer (DFE) with look-ahead processing
    • 并行处理决策反馈均衡器(DFE)与前瞻处理
    • US06192072B1
    • 2001-02-20
    • US09326781
    • 1999-06-04
    • Kameran AzadetMeng-Lin Yu
    • Kameran AzadetMeng-Lin Yu
    • H03H730
    • H04L25/03057H04L2025/0349
    • A method and apparatus are disclosed for increasing the effective processing speed of a parallel decision-feedback equalizer (DFE) by combining block processing and look-ahead techniques in the selection (multiplexing) stage. The present invention extends a parallel DFE by using look-ahead techniques in the selection stage to precompute the effect of previous blocks on each subsequent block, and to thereby remove the serial output dependency. The parallel DFE includes a multiplexor tree structure that selects an appropriate output value for each block and precomputes the effect of previous blocks on each subsequent block. A multiplexing delay algorithm on the order of logN is employed to resolve the output dependency and thus speeds up parallel block processing DFEs. The disclosed DFE architecture can be combined with pipelining to completely eliminate the critical path problem. Pipelining reduces the required critical path timing to one multiplexing time. The disclosed multiplexor tree circuitry for the parallel DFE groups multiplexor blocks into groups of two, referred to as block pairs, and provides at least one multiplexor for each block, i, to select an output value, yi, from among the possible precomputed values. The output of each parallel block depends on the possible precomputed values generated by the look-ahead processors for the block, as well as the actual values that are ultimately selected for each previous block. In order to reduce the delay in obtaining each actual output value, the present invention assumes that each block contains each possible value, and carries the assumption through to all subsequent blocks. Thus, the number of multiplexors required to select from among the possible values grows according to N·logN, where N is the block number.
    • 公开了一种用于通过在选择(复用)阶段中组合块处理和先行技术来增加并行判决反馈均衡器(DFE)的有效处理速度的方法和装置。 本发明通过在选择阶段中使用先行技术来扩展并行DFE,以预先计算先前块对每个后续块的影响,从而消除串行输出依赖性。 并行DFE包括多路复用器树结构,其为每个块选择适当的输出值,并且预先计算先前块在每个后续块上的影响。 采用logN顺序的复用延迟算法来解决输出依赖关系,从而加快并行块处理DFE。 所公开的DFE架构可以与流水线结合,以完全消除关键路径问题。 流水线将所需的关键路径时序减少到一个复用时间。 所公开的用于并行DFE组多路复用器的多路复用器树电路块分成两组,被称为块对,并且为每个块提供至少一个多路复用器,i从可能的预计算值中选择输出值yi。 每个并行块的输出取决于由块的先行处理器生成的可能的预计算值,以及最终为每个先前块选择的实际值。 为了减少获得每个实际输出值的延迟,本发明假设每个块包含每个可能的值,并将假设传递给所有后续块。 因此,从可能值中选择的多路复用器的数量根据N.logN而增长,其中N是块号。
    • 10. 发明授权
    • Incremental preamble detection
    • 增量前导码检测
    • US09362977B2
    • 2016-06-07
    • US13566146
    • 2012-08-03
    • Ivan Leonidovich MazurenkoAlexander Alexandrovich PetyushkoMeng-Lin YuJian-Guo Chen
    • Ivan Leonidovich MazurenkoAlexander Alexandrovich PetyushkoMeng-Lin YuJian-Guo Chen
    • H04B1/7075H04L7/04
    • H04B1/70755H04L7/042
    • In one embodiment, the present invention is a method for performing incremental preamble detection in a wireless communication network. The method processes non-overlapping chunks of incoming antenna data, where each chunk is smaller than the preamble length, to detect the signature of the transmitted preamble. For each chunk processed, chips of the chunk are correlated with possible signatures employed by the wireless network to update a set of correlation profiles, each profile comprising a plurality of profile values. Further, an intermediate detection is performed by comparing the updated profile values to an intermediate threshold that is also updated for each chunk. Upon receiving the final chunk, the correlation profiles are updated, and a final preamble detection is made by comparing the updated profile values to a final threshold. Detections are performed on an incremental basis to meet latency requirements of the wireless network.
    • 在一个实施例中,本发明是一种用于在无线通信网络中执行增量前导码检测的方法。 该方法处理输入天线数据的不重叠块,其中每个块小于前导码长度,以检测所发送的前导码的签名。 对于处理的每个块,块的码片与由无线网络使用的可能的签名相关联,以更新一组相关轮廓,每个轮廓包括多个轮廓值。 此外,通过将更新的简档值与也为每个块更新的中间阈值进行比较来执行中间检测。 在接收到最后的块之后,更新相关轮廓,并且通过将更新的简档值与最终的阈值进​​行比较来进行最终的前导码检测。 检测是按增量执行的,以满足无线网络的延迟要求。