专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2007116335A2 DATA PROCESSING CIRCUIT AND A METHOD WITH ERASURE BASED ERROR CORRECTION OF A DEINTERLEAVED SIGNAL 审中-公开
标题翻译：数据处理电路和一种基于消除信号的基于误差校正的方法
公开(公告)号：WO2007116335A2
公开(公告)日：2007-10-18
申请号：PCT/IB2007051121
申请日：2007-03-29
申请人： KONINKL PHILIPS ELECTRONICS NV , EGNER SEBASTIAN , BAGGEN CONSTANT P M J , KOPPELAAR ARIE G C , TOLHUIZEN LUDOVICUS M G M
发明人： EGNER SEBASTIAN , BAGGEN CONSTANT P M J , KOPPELAAR ARIE G C , TOLHUIZEN LUDOVICUS M G M
CPC分类号： H03M13/00
摘要： A series of data symbols is received. Unreliable units in the series of data symbols are detected on a per unit basis. A block of the data symbols that comprises a plurality of units is stored in a memory for de-interleaving. The information about unreliability has been found to have more redundancy than the data symbols. This used to reduce the amount of information stored for de-interleaving. Respective compressed reliability symbols are formed for successive parts of the series during reception of the series, using compressive coding of combinations of reliability information for respective ones of the units. The data symbols of the block are read from the memory in a de-interleaved order. The compressed reliability symbols are decompressed out of order, according to the de- interleaved order, in combination with said reading according to the de-interleaved order.
摘要翻译：接收一系列数据符号。一系列数据符号中不可靠的单位是以单位为单位进行检测的。包含多个单元的数据符号块被存储在用于解交织的存储器中。已经发现关于不可靠性的信息具有比数据符号更多的冗余。这用于减少存储用于解交织的信息量。使用对于各个单元的可靠性信息的组合的压缩编码，在接收串联期间，为串联的连续部分形成相应的压缩可靠性符号。以解交织的顺序从存储器读取块的数据符号。压缩的可靠性符号根据解交织顺序按照解交织顺序结合所述读取而按顺序解压缩。

2. 发明申请

WO2004112307A2 MULTIPLICATION IN A FINITE FIELD 审中-公开
标题翻译：有限域中的乘法
公开(公告)号：WO2004112307A2
公开(公告)日：2004-12-23
申请号：PCT/IB2004050827
申请日：2004-06-02
申请人： KONINKL PHILIPS ELECTRONICS NV , EGNER SEBASTIAN
发明人： EGNER SEBASTIAN
IPC分类号： G06F1/03 , G06F7/72 , H04L9/00
CPC分类号： G06F7/724 , G06F1/0307
摘要： An apparatus for performing a multiplication in a finite field Fq ={O, 1, alpha, (alpha ,..., alpha , or, in an index representation, Fq = {x0, x1,..., xq-1 } where each element xj of the field is represented by a respective index j indicated as j=i(xj). A memory 410 includes a logarithm table L 416 with at least q entries L[j] = logalpha,(xj), for j=0,...,q-1 and an exponent table E with a first part 412 with respective entries E[j] = i(alpha) for j=0,...,q-2 and a second part 414 immediately subsequent to the first part with respective entries E[j+q-1 ] = (a ) for j=0,...,q-3. A processor 420 provides as the outcome of the multiplication of non-zero elements x, y ∈ Fq an index retrieved from a table entry E[L[i(x)] + L[i(y)]] in the memory.
摘要翻译：用于在有限域Fq = {O，1，α，（α2，...，α）中进行乘法的装置，或者在索引表示中，Fq = {x0， ...，xq-1}，其中字段的每个元素xj由指示为j = i（xj）的相应索引j表示。存储器410包括对数表L 416，其具有至少q个条目L [j] = 对于j = 0，...，q-1和指数表E，对于j = 0，...，q，具有相应条目E [j] = i（α）的第一部分412的logalpha，（xj） -2和紧接在第一部分之后的第二部分414，其中针对j = 0，...，q-3的相应条目E [j + q-1] =（a ）。处理器420 非零元素x，y∈Fq相乘的结果是从存储器中的表项E [L [i（x）] + L [i（y）]]检索的索引。

3. 发明申请

WO2004079631A3 METHOD AND ARRANGEMENT FOR SEARCHING FOR STRINGS 审中-公开
标题翻译：搜索字符串的方法和安排
公开(公告)号：WO2004079631A3
公开(公告)日：2004-10-28
申请号：PCT/IB2004050148
申请日：2004-02-25
申请人： KONINKL PHILIPS ELECTRONICS NV , PAUWS STEFFEN C , EGNER SEBASTIAN , KORST JOHANNES H M , VAN VUUREN MARCEL
发明人： EGNER SEBASTIAN , KORST JOHANNES H M , VAN VUUREN MARCEL
IPC分类号： G06F17/30
CPC分类号： G06F17/30985
摘要： This invention relates to methods of searching for a final number of result strings (30-33) having a partial or an exact match with a query string (34) in a database (80) comprised of many long strings or a long string, said method includes the steps of partitioning the query string in a first number of input query strings (35, 36, 37); determining a second number of neighboring strings (38-41, 42-45, 44-49, respectively) for each string in said first number of input query strings, wherein each string in said second number of neighboring strings has a predetermined first number of errors; searching the database for a third number of exact matches (50-61, 70-74) for each string in said second number of neighboring strings based on a search method; concatenating said searched exact matched strings from the database into a fourth number of intermediate strings (29, 30, 32, 33, 34) wherein said searched exact matched strings (50-61, 70-74) comprised in each of said intermediate strings are in succession to one another in said database; and determining the final number of result strings (30-33) based in said fourth number of intermediate strings, wherein each string in the final number of result strings has a maximum of predetermined second number of errors compared to said query string (34). This enables for a perfect match or a partial match containing only minor errors with respect to said query string, and for a fast search in larger databases with a relative low use of processing power.
摘要翻译：本发明涉及搜索具有与由许多长串或长串组成的数据库（80）中的查询串（34）的部分或完全匹配的最终数目的结果串（30-33）的方法，所述方法包括步骤：在第一数目的输入查询字符串（35,36,37）中划分查询字符串; 确定所述第一数量的输入查询串中的每个串的相邻串的第二数量（分别为38-41,42-45,44-49），其中所述第二数量的相邻串中的每个串具有预定的第一数量的错误; 基于搜索方法在所述数据库中搜索所述第二数量的相邻串中的每个串的第三数量的精确匹配（50-61,70-74）; 将来自数据库的搜索到的精确匹配的字符串连接成第四数量的中间字符串（29,30,32,33,34），其中包括在每个所述中间字符串中的所述搜索到的精确匹配字符串（50-61,70-74）是在所述数据库中彼此相继; 以及基于所述第四数量的中间串确定最终数量的结果串（30-33），其中与所述查询串（34）相比，最终数量的结果串中的每个串具有最大数量的预定的第二数量的错误。这使得对于所述查询字符串仅包含较小错误的完美匹配或部分匹配以及对处理能力使用相对较少的较大数据库中的快速搜索成为可能。

4. 发明申请

WO0243292A2 METHOD FOR GENERATING A SERIAL BITSTREAM COMPRISING INFORMATION FOR SYNCHRONIZATION 审中-公开
标题翻译：用于产生包含同步信息的串行比特的方法
公开(公告)号：WO0243292A2
公开(公告)日：2002-05-30
申请号：PCT/EP0113010
申请日：2001-11-06
申请人： KONINKL PHILIPS ELECTRONICS NV
发明人： EGNER SEBASTIAN , BAGGEN CONSTANT P M J , VAN DIJK MARTEN E
IPC分类号： G11B27/30 , H04J3/06 , H04L7/00
CPC分类号： H04J3/0605 , G11B27/3027 , G11B2220/2545 , G11B2220/2562
摘要： The invention relates to a method for generating a serial bitstream comprising information for synchronizing the serial bitstream internally and/or to another serial bitstream and/or for determining the position in the serial bitstream wherein a fixed code pattern is embedded in the serial bitstream. In order to retrieve a synchronization information or to determine the position in the serial bitstream very fast after the start of reading the serial bitstream and at any time during reading the serial bitstream it is provided according to the invention that the code pattern is periodically repeated in the serial bitstream and that any sequence of a fixed number of successive bits of the code pattern forms a unique code word allowing for synchronization and/or position determination, even under the occurrence of bit errors. The invention also refers to a corresponding device, to a binary signal comprising a serial bitstream, to a record carrier carrying such a binary signal and to a method and device for reading such a binary signal.
摘要翻译：本发明涉及一种用于产生串行比特流的方法，其包括用于在串行比特流内部和/或另一个串行比特流同步串行比特流和/或用于确定串行比特流中的位置的信息，其中固定码型嵌入在串行比特流中。为了在读取串行比特流之后并且在读取串行比特流期间的任何时间，检索同步信息或确定串行比特流中的位置非常快，根据本发明提供了代码模式周期性地重复串行比特流，并且代码模式的固定数量的连续比特的任何序列形成允许同步和/或位置确定的唯一码字，即使在比特错误的发生下也是如此。本发明还涉及一种对应于包括串行比特流的二进制信号到携带这种二进制信号的记录载体的装置以及用于读取这种二进制信号的方法和装置。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式