| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 161 | Semiconductor device | JP2003308839 | 2003-09-01 | JP3940713B2 | 2007-07-04 | 修 平林 |
| A semiconductor device in which at least one bit of data bits configuring data read out from a memory is supplied to a pseudo error generating circuit in a test mode to generate a pseudo error bit which is supplied to an ECC (error connection code) circuit together with remainder bits of the data bits to obtain an error-corrected data which is then supplied to a BIST (Built-In-Self-Test) circuit for testing the error-corrected data obtained from the ECC circuit. | ||||||
| 162 | Signal evaluation apparatus and a signal evaluation method | JP2001369955 | 2001-12-04 | JP3817470B2 | 2006-09-06 | 哲也 奥村; 淳 秋山 |
| 163 | Evaluation and optimization of the error correction code using the projection analysis | JP2003535338 | 2002-09-30 | JP2005505981A | 2005-02-24 | イェディダ、ジョナサン、エス; サッダース、エリック、ビー; ブーショー、ジャン−フィリップ |
| 雑音の多い通信路を介して送信され、繰り返しメッセージ交換復号器により復号される誤り訂正符号を評価し最適化する方法である。 誤り訂正符号は、変数ノードと検査ノードを持つ二部グラフとしてモデル化される奇遇検査行列で表される。 復号器は１式のメッセージ交換規則を含む。 復号器は分析され、その後射影演算子と射影演算数に変換される演算子と演算数を含む１式の密度発展規則が取得され、１式の射影メッセージ交換規則が生成される。 終了状態に達するまで射影メッセージ交換規則が二部グラフとしてモデル化された誤り訂正符号に繰り返し適用される。 その後、対応する前記演算数を評価することで誤り訂正符号の選択されたビットの誤り率が決定される。 誤り率は、最適化器に渡され、誤り訂正符号が最適化される。 | ||||||
| 164 | Device and method to evaluate signal | JP2001369955 | 2001-12-04 | JP2003173618A | 2003-06-20 | AKIYAMA ATSUSHI; OKUMURA TETSUYA |
| PROBLEM TO BE SOLVED: To provide a signal evaluating device and a method in which accurate measurement is always made for a bit error rate regardless of the distribution shape of the likelihood differences (difference metrics) of a data group. SOLUTION: In the signal evaluating device in which a data group is decoded using a maximum likelihood decoding, a path in which distance between two paths becomes a minimum value is selected by a path selecting circuit 10. A difference metric obtained by a difference metric computing circuit 9 for the path selected by the circuit 10 is statistically processed by a μ, σ computing circuit 13 in order to compute a bit error rate. Then, the bit error rate is corrected by correcting means (11, 12 and 13) based on the measurement sample number of the path selected by the circuit 10 and a total sample number. COPYRIGHT: (C)2003,JPO | ||||||
| 165 | Crc / edc checker system | JP51040696 | 1995-09-15 | JP3281387B2 | 2002-05-13 | クリストファー ピー． ズーク， |
| 166 | Method and device for detecting encoding rate | JP18282999 | 1999-06-29 | JP2001016114A | 2001-01-19 | KAKEMIZU TAKASHI; KAMATA TAKEHIRO; NAKAI YUJI |
| PROBLEM TO BE SOLVED: To reduce a digital noise to be generated at the time of switching a synchronizing signal. SOLUTION: In this encoding rate detecting method, a received encoded signal is decoded while using a clock signal corresponding to an encoding rate ri in a first Viterbi decoding process ST11. Next, synchronism of the decoded signal is discriminated in a first synchronism discriminating process ST12 and when the synchronism is not established, the clock signal having a frequency corresponding to an encoding rate ri+1 is assigned in a first clock signal updating process ST13. Next, when the encoding rate ri+1 is a maximum value rk, the encoding signal is decoded while using the clock signal which is assigned in a second Viterbi decoding process ST15 in an encoding rate upper limit discriminating process ST14. Next, the synchronism of the decoded signal is discriminated in a second synchronism discriminating process ST16 and when the synchronism is not established, the clock signal having the frequency corresponding to an encoding rate ri-1 is assigned in a second clock signal updating process ST17. | ||||||
| 167 | Multi-dimensional pseudo noise generation circuit for soft decision demodulation | JP28748898 | 1998-10-09 | JP2000115144A | 2000-04-21 | MARU TSUGIO |
| PROBLEM TO BE SOLVED: To provide a circuit for accurately testing the error rate characteristics of a fine soft decision error correction circuit without receiving interference from other devices inside a laboratory or the like. SOLUTION: This circuit is provided with a pseudo noise generation circuit 3 provided with a PN generation means 1, a first memory storing a threshold level based on cumulative distribution for which a prescribed probability density is integrated, a first address generation means and a first comparison means for comparing read data and a PN sequence by a prescribed bit length for successively updating an address based on a result from the comparison means and outputting the address at the time of ending comparison. Also, separately, the circuit is provided with the pseudo noise generation circuit 6 of the same constitution provided with the PN generation means 4, a second memory, a second address generation means and a second comparison means for successively updating the address of the second address generation means based on the result of the second comparison means and the output of the pseudo noise generation circuit 3 and outputting the address at the time of ending the comparison as pseudo noise information. COPYRIGHT: (C)2000,JPO | ||||||
| 168 | Crc / edc checker system | JP51040696 | 1995-09-15 | JPH10508988A | 1998-09-02 | クリストファー ピー． ズーク， |
| (57)【要約】 ＥＤＣ／ＣＲＣチェッカ（70）は、訂正パスの間に、１データブロックが訂正されているあいだに、ＥＤＣ／ＣＲＣチェックをおこなうことによって、ブロック訂正に引き続いてＥＤＣ／ＣＲＣを目的としてバッファにアクセスすることを不要にする。 訂正パスのあいだ、ＥＤＣ／ＣＲＣの和が累算される。 その和は、そのブロックのパスが完了した後、もしそのブロックにおけるＥＤＣ／ＣＲＣバイトによりそのブロックが訂正されたことが確認されれば、ゼロになる。 ブロックの一回の訂正パスのあいだに、訂正されていない、最も最近のコードワードのバイトが、累算された和に加算される。 最も最近のコードワードのバイトとバイト同期関係にある以前のコードワードのバイトは、（必要であれば）訂正され、かつ（訂正がおこなわれる時には）以前のコードワードのバイトを訂正するのに用いられた誤りパターンを含む誤りパターン係数もまた、累算された和に加算される。 ここで説明される実施形態では、ブロックは、複数のコードワードカラムを有するものとして概念づけられ、バイト同期関係は、訂正されていないバイトが累算されるときには、次の以前のコードワードの対応するバイトに対して訂正がおこなわれるようにするものである。 本発明の各種実施形態では、複数のコードワードを同時に操作することが可能になる。 | ||||||
| 169 | Fault detection and decision device | JP29209790 | 1990-10-31 | JPH04167029A | 1992-06-15 | OKAWA KENZO |
| PURPOSE: To shorten a process time and to decrease the number of components by providing a compressing circuit which cyclically encodes and compresses an output signal pattern and a means which compares cyclic encoded codes of a circuit where a fault is set with a normal circuit where the fault is not set. CONSTITUTION: This device is equipped with the compressing circuit 3 which cyclically encodes and compresses the primary coupling of the output signal pattern obtained through a circuit model 2 by inputting an input signal pattern to the circuit model 2, a memory 4 wherein the cyclic code of the normal circuit which has no fault, and the means 5 which compares the cyclic code of the normal circuit with the cyclic code obtained from the faulty circuit. Therefore, the advantage that operation for generating the output pattern by propagating the input signal pattern on the circuit model 2 is speeded up is displayed as it is and the need for a memory unit for the output signal pattern of the normal circuit is eliminated. Consequently, the process time is shortened and the memory capacity is reducible. COPYRIGHT: (C)1992,JPO&Japio | ||||||
| 170 | Test method for viterbi decoder | JP24066785 | 1985-10-29 | JPS62101128A | 1987-05-11 | SHIMODA KANEYASU; YAMASHITA ATSUSHI; KATO TADAYOSHI |
| PURPOSE: To test the operation of each section separately respectively by applying an input signal for a test directly corresponding a distributor, an ACS circuit and a path memory constituting a viterbi decoder, leading and collating the output signals. CONSTITUTION: The distributor 1 calculates a branch metric from an input signal such as a demodulation signal fed to a terminal (a), its output signal is fed to selectors 4, 6 and a selection output signal of the selector 4 is fed to the ACS circuit 2. The ACS includes an adder, a comparator and a selector, the adder adds a branch metric and a path metric, the pathmetrics being the outputs of the addition are compared by the comparator, and the most likelihood of the result of comparison is outputted while being selected by the selector. The path memory 3 consists of lots of cells storing the history of the most likelihood path, is reset by a reset signal from a terminal (c) and brought into an initial state. COPYRIGHT: (C)1987,JPO&Japio | ||||||
| 171 | METHOD AND APPARATUS FOR CALIBRATING DATA-DEPENDENT NOISE PREDICTION | PCT/EP0304098 | 2003-04-18 | WO03088240A2 | 2003-10-23 | ASHLEY JONATHAN; STOCKMANNS HEINRICH |
| Disclosed herein is an apparatus and method of calibrating the parameters of a Viterbi detector 138 in which each branch metric is calculated based on noise statistics that depend on the signal hypothesis corresponding to the branch. An offline algorithm for calculating the parameters of data-dependent noise predictive filters 304A-D is presented which has two phases: a noise statistics estimation or training phase, and a filter calculation phase. During the training phase, products of pairs of noise samples are accumulated in order to estimate the noise correlations. Further, the results of the training phase are used to estimate how wide (in bits) the noise correlation accumulation registers need to be. The taps [t2 |
||||||
| 172 | METHOD AND APPARATUS FOR RECOVERY OF PARTICULAR BITS OF RECEIVED FRAME | PCT/US0118254 | 2001-06-04 | WO0195501A3 | 2002-04-11 | SAIFUDDIN AHMED; ODENWALDER JOSEPH P; JOU YU-CHEUN; TIEDEMANN EDWARD G JR |
| A method and an apparatus for recovery of particular bits in a frame are disclosed. An origination station forms a frame structure with groups of information bits of different importance. All the information bits are then protected by an outer quality metric. Additionally, the groups of more important information bits are further protected by an inner quality metric; each group having a corresponding quality metric. The frame is then transmitted to a destination station. The destination station decodes the received frame and decides, first in accordance with the outer quality metric, whether the frame has been correctly received, or whether the frame is erased. If the fame has been declared erased, the destination station attempts to recover the groups of more important information bits in accordance with the corresponding inner quality metrics. | ||||||
| 173 | TRAITEMENT DE DONNEES POUR L'ENCODAGE ET LE DECODAGE D'UN MESSAGE | EP11737987.5 | 2011-06-17 | EP2589154A1 | 2013-05-08 | LE GUELVOUIT, Gaëtan; BOUTITON, Sophie |
| The invention relates to processing data for encoding and decoding a message (m j) transmitted through a communication channel having adjacent information (x) known during the encoding, the encoding method comprising the construction of a surjective correcting code produced from a characterization of the adjacent information in a system of spherical coordinates. Said method comprises the steps of: a) determining a spherical information vector (t) characterizing the adjacent information in the system of spherical coordinates, the spherical information vector (t) having a size n, where n is a positive integer; b) constructing a surjective correcting code by using the spherical information vector (t) and by carrying out a quantification operation comprising: i) determining a quantification interval (d) on the basis of a number (q) of code words (u j,i) to be associated with a message (m j), the quantification interval (d) being equal to 2π / q 1/(n-1), where q is the number of code words (u j,i) to be associated with a message (m j); and ii) determining, from the quantification interval (d), a set of code words (u j,i) distributed over the surface of a hypersphere, the center of which is 0 and a radius of which is equal to the value of a given component (t[n]) of the spherical information vector (t); and c) encoding the message (m j) using the surjective correcting code. | ||||||
| 174 | METHOD AND APPARATUS FOR RECOVERY OF PARTICULAR BITS OF RECEIVED FRAME | EP01941976.1 | 2001-06-04 | EP1287618B1 | 2011-11-16 | SAIFUDDIN, Ahmed; ODENWALDER, Joseph, P.; JOU, Yu-Cheun; TIEDEMANN, Edward, G., Jr. |
| A method and an apparatus for recovery of particular bits in a frame are disclosed. An origination station forms a frame structure with groups of information bits of different importance. All the information bits are then protected by an outer quality metric. Additionally, the groups of more important information bits are further protected by an inner quality metric; each group having a corresponding quality metric. The frame is then transmitted to a destination station. The destination station decodes the received frame and decides, first in accordance with the outer quality metric, whether the frame has been correctly received, or whether the frame is erased. If the frame has been declared erased, the destination station attempts to recover the groups of more important information bits in accordance with the corresponding inner quality metrics. | ||||||
| 175 | METHOD AND SYSTEM FOR OPTIMIZING FORWARD ERROR CORRECTION OF MULTIMEDIA STREAMING OVER WIRELESS NETWORKS | EP06771551.6 | 2006-05-26 | EP1900134B1 | 2010-12-15 | BAUER, Claus; JIANG, Wenyu |
| The loss of packets in a communication system can be minimized in an optimal manner by adapting a set of error correction (EC) parameters in response to a calculated probability of packet loss. The calculated probability is obtained from derived algorithms that are applied to a set of communication parameters. Algorithms are derived from Bernoulli-distributed traffic models and constant bit rate (CBR) traffic models of the communication system. A collapsed-state model is used to derive a very efficient algorithm that calculates an approximate probability of packet loss. Alternate applications for the algorithms are also disclosed. | ||||||
| 176 | Modeling of a bursty channel | EP06807120.8 | 2006-10-10 | EP1949544B1 | 2009-03-11 | SEGER, Paul |
| A method, system and program product accurately model the error characteristics of a communications system, such as a tape storage system. Input parameters are entered which describe defect rates and sizes, Codeword Data Structure bytes, and any interleaving factor. Bit defects from simulated defect sources are generated, defined by the starting and ending bits of each defect within a codeword. Any codewords which are defect-free are filtered out and not processed further, thereby increasing the processing speed of the model. Within the defect streams, overlapping defects are merged, redefining defect regions by starting and ending bits. Because only the definitions are processed, not the entire length of the codewords or defects, processing efficiency is further enhanced. The number of defects that occur in each codeword is determined and the probability of the occurrence of N bytes in error per processed codeword may be computed. | ||||||
| 177 | MODELING OF BURSTY CHANNEL OF ERROR CORRECTION CODES | EP06807120.8 | 2006-10-10 | EP1949544A1 | 2008-07-30 | SEGER, Paul |
| A method, system and program product accurately model the error characteristics of a communications system, such as a tape storage system. Input parameters are entered which describe defect rates and sizes, Codeword Data Structure bytes, and any interleaving factor. Bit defects from simulated defect sources are generated, defined by the starting and ending bits of each defect within a codeword. Any codewords which are defect-free are filtered out and not processed further, thereby increasing the processing speed of the model. Within the defect streams, overlapping defects are merged, redefining defect regions by starting and ending bits. Because only the definitions are processed, not the entire length of the codewords or defects, processing efficiency is further enhanced. The number of defects that occur in each codeword is determined and the probability of the occurrence of N bytes in error per processed codeword may be computed. | ||||||
| 178 | Evaluating and optimizing error-correcting codes using a renormalization group transformation | EP02009144.3 | 2002-04-24 | EP1258999B1 | 2007-04-04 | Yedidia, Jonathan S.; Bouchaud, Jean-Philippe M. |
| 179 | METHOD AND APPARATUS FOR CODING INFORMATION, METHOD AND APPARATUS FOR DECODING CODED INFORMATION, METHOD OF FABRICATING A RECORDING MEDIUM, THE RECORDING MEDIUM AND MODULATED SIGNAL | EP00973254 | 2000-11-11 | EP1332561A4 | 2005-11-09 | SCHOUHAMER IMMINK KEES A |
| In the coding device and method, m-bit information words are converted into n-bit code words such that the coding rate m/n is greater than 2/3. The n-bit code words are divided into a first type and a second type, and into coding states of a first kind and a second kind such that an m-bit information word is converted into an n-bit code word of the first or second kind if the previous m-bit information word was converted into an n-bit code word of the first type and is converted into an n-bit code word of the first kind if the previous m-bit information word was converted into an n-bit code word of the second type. In one embodiment, n-bit code words of the first type end in zero, n-bit code words of the second type end in one, n-bit code words of the first kind start with zero, and n-bit code words of the second kind start with zero or one. Furthermore, in the embodiments, the n-bit code words satisfy a dk-constraint to (1,k) such that a minimum of 1 zero and a maximum of k zeros falls between consecutive ones. The coding device and method are employed to record information on a recording medium and thus create the recording medium. The coding device and method are further employed to transmit information. In the decoding method and apparatus, n-bit code words are decoded into m-bit information words. The decoding involves determining the state of a next n-bit code word, and based on the state determination, the current n-bit code word is converted into an m-bit information word. The decoding device and method are employed to reproduce information from a recording medium, and to receive information transmitted over a medium. | ||||||
| 180 | METHOD AND APPARATUS FOR CALIBRATING DATA-DEPENDENT NOISE PREDICTION | EP03722512.5 | 2003-04-18 | EP1495469A2 | 2005-01-12 | ASHLEY, Jonathan; STOCKMANNS, Heinrich |
| Disclosed herein is an apparatus and method of calibrating the parameters of a Viterbi detector 138 in which each branch metric is calculated based on noise statistics that depend on the signal hypothesis corresponding to the branch. An offline algorithm for calculating the parameters of data-dependent noise predictive filters 304 A-D is presented which has two phases: a noise statistics estimation or training phase, and a filter calculation phase. During the training phase, products of pairs of noise samples are accumulated in order to estimate the noise correlations. Further, the results of the training phase are used to estimate how wide (in bits) the noise correlation accumulation registers need to be. The taps [t |
||||||
QQ群二维码
意见反馈
意见反馈