会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明公开
    • Method and apparatus for map detection with reduced complexity
    • 降低复杂度的地图检测方法和装置
    • EP2083520A2
    • 2009-07-29
    • EP09151154.3
    • 2009-01-22
    • Agere Systems, Inc.
    • Fitzpatrick, Kelly K.Haratsch, Erich F.
    • H03M13/39H04L1/00
    • G11B5/09H03M13/3905H03M13/395H03M13/6343H03M13/6502H04L1/0055H04L1/0066
    • Methods and apparatus are provided for high-speed, low-power, high-performance channel detection. A soft output channel detector is provided that operates at a rate of 1/N and detects N bits per 1/N-rate clock cycle. The channel detector comprises a plurality, D, of MAP detectors operating in parallel, wherein each of the MAP detectors generates N/D log-likelihood ratio values per 1/N-rate clock cycle and wherein at least one of the plurality of MAP detectors constrains each of the bits. The log-likelihood ratio values can be merged to form an output sequence. A single MAP detector is also provided that comprises a forward detector for calculating forward state metrics; a backward detector for calculating backward state metrics; and a current branch detector for calculating a current branch metric, wherein at least two of the forward detector, the backward detector and the current branch detector employ different trellis structures.
    • 提供了用于高速,低功率,高性能信道检测的方法和装置。 提供一个软输出通道检测器,以1 / N的速率工作,并检测每个1 / N速率时钟周期的N位。 信道检测器包括并行操作的多个MAP检测器,其中每个MAP检测器每个1 / N速率时钟周期产生N / D对数似然比值,并且其中多个MAP检测器中的至少一个 约束每个比特。 对数似然比值可以合并以形成输出序列。 还提供单个MAP检测器,其包括用于计算正向状态度量的正向检测器; 用于计算反向状态量度的后向检测器; 以及电流分支检测器,用于计算电流分支量度,其中正向检测器,反向检测器和当前分支检测器中的至少两个采用不同的格子结构。
    • 6. 发明公开
    • Error correction apparatus using a viterbi decoder
    • 错误修正装置使用VITERBI解码器
    • EP0138598A3
    • 1988-03-16
    • EP84307011
    • 1984-10-12
    • NEC CORPORATION
    • Otani, Susumu
    • H03M13/12
    • H03M13/395H03M13/41
    • Received, convolutionally coded bits are grouped and applied to a branch metric calculator and an adder to provide a plurality (sixteen) of sums of branch metrics over branches defining two depths of a Viterby trellis diagram corresponding to the convolutional code. Such sums, of the form Z 11 +Z 11 , Z 31 + Zi etc. where the two components of each sum pertain to successive time slots and the index values specify the path branches, are applied to terminals (31-34,41-44) forming first inputs to sixteen adders (eight shown, 301-304, 401-404) whose other inputs receive appropriate ones of four stored path metrics (M l - M 4 ). The adders all operate in parallel and the stored metrics are updated over two depths of the trellis diagram by an arrangement of comparators and selectors effecting two levels of comparison and selection. For example, in the firstlevel a comparator (305) compares the sum from one pair of adders (301, 302) and controls both a selector (307) for that pair of adders and a selector (407) for another pair of adders (401,402). In the second level comparators (309, 409) and corresponding selectors (310, 410) select between outputs of pairs of first level selectors. The control signals from all the comparators indicating the determinations made thereby are coupled to a path memory (101) indicating the paths of the selected values and hence the decoded output bits corresponding to the servicing paths.
    • 8. 发明公开
    • Viterbi decoding scheme for RFID reader
    • Viterbi-DekodierschemafürRFID-Lesegerät
    • EP2175563A1
    • 2010-04-14
    • EP09165123.2
    • 2009-07-10
    • ASSA ABLOY AB
    • Mutti, Carlo
    • H03M13/41H03M5/12G06K7/00
    • H03M13/4169G06K7/0008H03M5/12H03M13/395H03M13/3961H03M13/41H03M13/6325
    • The present invention is directed toward the recovery of RFID signals from RFID credentials. The recovery and subsequent interpretation of RFID signals may be accomplished by providing a set of predetermined probabilities for the occurrence of a symbol after another symbol in a received signal. The predetermined probabilities may be dependent only upon the encoding scheme used, thereby providing a more robust and less processor intensive decoding protocol than has previously been contemplated. The RFID signal may be a FM0 encoded signal. The recovery of the RFID encoded signal is achieved by determining the maximum-likelihood path through a trellis (maximum likelihood sequence estimation, Viterbi decoding).
    • 本发明旨在从RFID凭证恢复RFID信号。 RFID信号的恢复和随后的解释可以通过为接收到的信号中的另一符号之后的符号的出现提供一组预定概率来实现。 预定概率可以仅依赖于所使用的编码方案,从而提供比先前预期的更强大和更少的处理器密集型解码协议。 RFID信号可以是FM0编码信号。 通过确定通过网格的最大似然路径(最大似然序列估计,维特比解码)来实现RFID编码信号的恢复。
    • 9. 发明公开
    • Soft-output Viterbi detection using a Radix-n trellis
    • 维特比检测仪器
    • EP2093888A2
    • 2009-08-26
    • EP09162284.5
    • 2005-11-14
    • Agere Systems, Inc.
    • Ashley, Jonathan JamesFitzpatrick, Kelly KnudsonHaratsch, Erich Franz
    • H03M13/41
    • H03M13/4192H03M13/395H03M13/4153
    • Methods and apparatus are provided for performing SOVA detection at higher data rates than achievable with conventional designs. A received signal is processed by (i) determining at least three selection signals that define a plurality of paths through a multiple-step trellis into a given state, wherein a first of the plurality of paths is a winning path for each single-step-trellis period of a multiple-step-trellis cycle, a second path is a winning path for a first single-step-trellis period and is a losing path for a second single-step-trellis period of a multiple-step-trellis cycle and a third path is a losing path for a first single-step-trellis period and is a winning path for a second single-step-trellis period of a multiple-step-trellis cycle; and (ii) determining at least one reliability value (such as a reliability value for a bit decision associated with a maximum-likelihood path through the multiple-step trellis or a plurality of reliability values for each multiple-step-trellis cycle).
    • 提供了用于以比常规设计可实现的更高数据速率执行SOVA检测的方法和装置。 处理接收信号的步骤包括以下步骤:(i)确定至少三个选择信号,所述至少三个选择信号将通过多步网格的多条路径定义为给定状态,其中,所述多个路径中的第一条路径是用于每个单步骤的路线, 一个多步骤网格周期的网格周期,第二条路径是第一个单步网格周期的获胜路径,并且是多阶段格状周期的第二个单步网格周期的丢失路径, 第三条路径是第一个单步网格周期的失败路径,是多步骤网格周期的第二个单步网格周期的获胜路径; 和(ii)确定至少一个可靠性值(诸如与通过多步网格的最大似然路径相关联的比特决定的可靠性值或每个多步骤格状周期的多个可靠性值)。