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

1. 发明申请

WO1997012301A1 DRAFTING METHOD FOR INDUSTRIAL AND BUILDING SYSTEMS AND COMPUTER-CONTROLLED PLANNING SYSTEM FOR USE IN SAID METHOD 审中-公开
标题翻译：程序草案对于使用这个方法中的技术和计算机辅助规划体系
公开(公告)号：WO1997012301A1
公开(公告)日：1997-04-03
申请号：PCT/DE1996001815
申请日：1996-09-25
申请人： SIEMENS AKTIENGESELLSCHAFT , SONST, Horst , FISCHER, Horst , LÖWEN, Ulrich , FREITAG, Hartmut , WEHN, Norbert , ROSEN, Roland
发明人： SIEMENS AKTIENGESELLSCHAFT
IPC分类号： G05B17/02
CPC分类号： G06F17/5004 , G05B17/02 , G05B19/0426 , G05B2219/23005 , G05B2219/23292 , G05B2219/23293 , G05B2219/32085 , G06F17/5009 , Y02P90/24
摘要： For the automation of industrial plants in particular the plant technology can be described by processing technology on the one hand and control and instrumentation technology on the other. According to the invention, industrial process objects are formed from models of the process and control and instrumentation technology and processed in a computer-controlled planning system from which interlinked models are generated by control and/or regulation and/or simulation, including breakdown analysis. With the associated planning system, a computer (10) is used in a similar manner to access a component library (11) comprising industrial process elements and to access a description (12) of the elements of the actual plant from the viewpoint of a processing engineer.
摘要翻译：特别地，对于工业设备，所述植物通过过程控制用一只手的技术，和的自动化可以在另一方面进行说明。根据本发明，可以形成从该过程的模型和其在计算机辅助工程系统中被处理，得到的互锁模型的故障分析控制系统过程对象与控制和/或调节和/或仿真，包括被生成。当相关联的工程系统发生用计算机（10）相等地访问过程元件的组件库（11），和特定的植物的从工艺工程技术专家的观点来看的元件的描述（12）。

2. 发明申请

WO1997040629A1 VIDEO DECODER AND CORRESPONDING PROCESS 审中-公开
标题翻译：视频解码器和相应的方法
公开(公告)号：WO1997040629A1
公开(公告)日：1997-10-30
申请号：PCT/DE1997000866
申请日：1997-04-22
申请人： SIEMENS AKTIENGESELLSCHAFT , HEIN, Sören , MEIER, Wolfgang , WEHN, Norbert
发明人： SIEMENS AKTIENGESELLSCHAFT
IPC分类号： H04N07/50
CPC分类号： H04N19/427 , H04N19/423 , H04N19/61
摘要： The decoder has a first storage means (S1) to store a coded first image (B), which can be stored until it has been decoded at least twice. The results of the decodings can be given to a playback device (D). The invention makes it possible to dispense with an output frame buffer for the decoded first image (B), thus making for low memory requirements in the decoder.
摘要翻译：该解码器包括用于存储编码的第一图像（B）的第一存储器装置（S1）。这是只要可以存储直到它被解码至少两次。该解码的结果对重放装置（D）gebbar。本发明消除了对用于将解码第一图片（B）的输出帧缓冲器的需要，因此，在解码器中的存储器要求是小的。

3. 发明申请

WO2007110436A1 FAST CONVERGENCE LDPC DECODING USING BCJR ALGORITHM AT THE CHECK NODES 审中-公开
标题翻译：使用BCJR算法的快速融合LDPC解码在检查NODES
公开(公告)号：WO2007110436A1
公开(公告)日：2007-10-04
申请号：PCT/EP2007/052986
申请日：2007-03-28
申请人： STMICROELECTRONICS N.V. , KIENLE, Franck , WEHN, Norbert , BRACK, Torben
发明人： KIENLE, Franck , WEHN, Norbert , BRACK, Torben
IPC分类号： H03M13/11
CPC分类号： H03M13/3905 , H03M13/1165 , H03M13/1197 , H03M13/3972
摘要： Method of decoding LDPC codes such as IRA codes used in the DVB-S2 standard, the code graph comprising first variable nodes (systematic), second variable nodes (parity) having a degree two, and check nodes connected to second variable nodes by a zigzag connectivity, the method comprising a) grouping the check nodes into at least one group, the check nodes of each group being connected by variable nodes called internal variable nodes, b) performing for each group (GR j ) the following sub-steps b1) and b2): b1) jointly updating (71) all the check nodes of said group by using an algorithm of the Maximum-A-Posteriori (MAP) type on a two-state trellis, b2) updating (72, 73) all the first variable nodes and all the second variable nodes (PN i-1,i ; PN i,i+1 ) connected to said group except said at least one internal second variable node, c) iteratively repeating step b). When using a plurality of groups, a corresponding plurality of trellis windows are LogMAP decoded without training period since connecting parity nodes are updated according to the sum-product algorithm.
摘要翻译：对DVB-S2标准中使用的诸如IRA代码的LDPC码进行解码的方法，包括具有度2的第一可变节点（系统），第二可变节点（奇偶校验）的代码图，以及通过Z字形连接到第二可变节点的校验节点所述方法包括：a）将所述校验节点分组为至少一个组，每个组的校验节点由被称为内部变量节点的变量节点连接，b）对每个组执行（GR 以下子步骤b1）和b2）：b1）通过使用两状态网格上的最大后验（MAP）类型的算法来共同更新（71）所述组的所有校验节点，b2）更新（72,73）连接到所述组的所有第一可变节点和所有第二可变节点（PN 1，i>，N i，i + 1）除所述至少一个内部第二可变节点，c）迭代地重复步骤b）。当使用多个组时，由于连接奇偶校验节点根据和积算法被更新，所以对应的多个网格窗口不进行训练周期的LogMAP解码。

4. 发明申请

WO2006117135A1 METHOD AND DEVICE FOR CONTROLLING THE DECODING OF A LDPC ENCODED CODEWORD, IN PARTICULAR FOR DVB-S2 LDPC ENCODED CODEWORDS 审中-公开
标题翻译：用于控制LDPC编码编码的解码的方法和装置，特别是用于DVB-S2 LDPC编码的编码
公开(公告)号：WO2006117135A1
公开(公告)日：2006-11-09
申请号：PCT/EP2006/003942
申请日：2006-04-27
申请人： STMICROELECTRONICS N.V. , WEHN, Norbert , KIENLE, Frank , BRACK, Torben
发明人： WEHN, Norbert , KIENLE, Frank , BRACK, Torben
IPC分类号： H03M13/11 , H03M13/27 , H03M13/45
CPC分类号： H03M13/1111 , H03M13/1128 , H03M13/1165 , H03M13/3738
摘要： This is a method for controlling the decoding of a LDPC encoded codeword composed of several digital data, said LDPC code being represented by a bipartite graph between check nodes (CN 1 ) and variable nodes (VN i ). Said method compri ses updating messages exchanged iteratively between variable nodes (VN1) and check nodes (CN 1 ). Said method comprises, at each iteration, calculating for each variable node a first sum ( Λ n ) of all the incident messages ( λ i ) received by said variable node and the corresponding digital data ( λ ch ) and calculating a second sum (VNR new ) of all the absolute values of the first sums ( Λ n ), and stopping the decoding process if the second sum (VNR new ) is unchanged or decreases within two successive iterations and if a predetermined threshold condition is satisfied.
摘要翻译：这是一种用于控制由几个数字数据组成的LDPC编码码字的解码的方法，所述LDPC码由校验节点（CN1> 1）和可变节点（VN）之间的二分图表示， I ）。所述方法包括更新在可变节点（VN1）和校验节点（CN <1）之间迭代地交换的消息。所述方法包括：在每次迭代时，为每个可变节点计算由所述可变节点接收的所有事件消息（？> i i i> the the the the the the the the the the the the the the）相对应的数字数据（ΔTA），并且计算第一和（％）的所有绝对值的第二和（VNR）新的＆lt; / SUB＆gt; 并且如果在两个连续的迭代中第二个和（VNR新的）不变或减小，并且如果满足预定的阈值条件，则停止解码过程。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式