| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 61 | Interface - Li - Breakfast type decoder capacity building method for decoding the error correction code | JP27014592 | 1992-10-08 | JP2520551B2 | 1996-07-31 | MIGEERU MARIO BURAUMU; HENRIKUSU SEE UAN TEIRUBORUGU |
| Decoding power is enhanced by (1) flagging only those codewords where the ECC capability has been exceeded; (2) permitting codewords to be of any byte length (n) and codeword depth ((lambda)) subject only to the requirement that n and (lambda) be relatively prime; and (3) interleaving encoded bytes of successive codewords diagonally in a single continuous sequence to form an array with a toroidal topology so that all burst errors will be continuous from codeword to codeword, irrespective of where they occur in the array. These attributes assure that there will never be a problem with burst errors affecting<=(lambda) rows because there is no "last row" and "first row". | ||||||
| 62 | Decoder capability reinforcing method for decoding interleaving-type error correction code | JP27014592 | 1992-10-08 | JPH05244020A | 1993-09-21 | MIGEERU MARIO BURAUMU; HENRIKUSU SEE BUAN TEIRUBORUGU |
| PURPOSE: To reinforce the capability of decoding by adding a flag mark to a code word exceeding the ability of ECC. CONSTITUTION: The marks are given to all code words which are left since they exceed the error correction ability of the ECC code and cannot be corrected with flags. Whether an error exists in at least one code word (adjacent code word) in the code words to which the marks are given by the flags or not is discriminated. Location where the error in the adjacent code word occurs is declared to be an elimination trace against the location adjacent in an oblique direction among the locations in the code word to which the mark is given by the flag. Then, the code word to which the mark is given by the flag is decoded. When decoding does not succeed, that the code word is that which cannot be corrected is declared. COPYRIGHT: (C)1993,JPO | ||||||
| 63 | JPH04501044A - | JP50692489 | 1989-06-12 | JPH04501044A | 1992-02-20 | |
| 64 | Information processing | JP8841886 | 1986-04-18 | JPS61281721A | 1986-12-12 | HONG JU-HI JOHN |
| 65 | SYSTEMS AND METHODS FOR DECODING FORWARD ERROR CORRECTING CODES | PCT/US2006018215 | 2006-05-11 | WO2006124504A3 | 2007-11-22 | CONWAY ADRIAN EVANS |
| Systems and methods are disclosed that can improve the performance of decoders of forward error correcting codes by using the information contained in late packet arrivals to update (26) (or recompute) the state of the decoder (24) The systems and methods of the disclosed embodiments are generally applicable to decoders that maintain state information in decoding successive bits or information frames The systems and methods disclosed herein can improve the performance (? e, the bit error rate) of the decoder since the recomputed state is exactly the state that the decoder would have had if the information contained in the late packet had originally arrived on time and been decoded in a usual manner In effect, the updating of the decoder (24) state following a late packet arrival (26) terminates the propagation in time of the effect of the late packet erasure on the state of the decoder | ||||||
| 66 | ITERATIVE DECODING OF DIFFERENTIALLY MODULATED SYMBOLS | PCT/EP0202777 | 2002-03-12 | WO02078195A2 | 2002-10-03 | WILHELMSSON LEIF |
| Method and apparatus (30) for decoding block-coded data which has been transmitted by means of differential modulation. The method first attempts to decode all codewords using an error correcting code (100), and if at least one codeword is still not decoded, uses a correctly decoded codeword to locate a possibly erroneous code symbol in the at least one codeword, alters the possibly erroneous code symbol (120), and again attempts to decode the at least one codeword (130). The invention recognizes that errors in such data typically occur in pairs, and utilizes this property to improve the decoding process. | ||||||
| 67 | 無線ネットワークを介したビデオデータストリームの送信を最適化する方法 | JP2018513771 | 2016-09-15 | JP2018536311A | 2018-12-06 | ケフラン,ピエール; カーニール,クリストフ; デディッセ,ダニエル |
| 本発明は、Wi−Fi通信プロトコルにより制御される無線ネットワークを介したビデオデータストリーム受信の信頼性および品質を向上させる方法に関し、当該ビデオデータストリームが、前方誤り訂正(FEC)のためにK個の先頭データブロックおよびH個の冗長ブロックを各々含むQ個のパケットの形式で符号化されていて、前記ストリームが、スマートフォン等のクライアント視聴装置に当該パケットをマルチキャスティングする少なくとも1個の送信装置により送信されるK+N個のブロックを各々含む一連のG個のパケットを含んでいる。前記方法は、当該1個または複数の送信装置から受信したG個のデータパケットの各々に対して前記クライアント装置により実行される以下のステップ、すなわち、a/ K個の先頭データブロックの正常な受信を確認し、結果が肯定的である場合にビデオストリームを復号化して視聴すること、b/ K個の先頭データブロックの全てが受信されなかった場合、可能ならば前方誤り訂正(FEC)アルゴリズムにより復号化を行うこと、c/ 受信したK+N個のブロックの総数XがKよりも小さいか、または先の復号化ステップから肯定的な結果が得られなかった場合、1個以上の欠落ブロックに関するメッセージを送信すること、d/ 送信装置の統計アルゴリズムにより欠落データの再送信を行う場合、a/およびb/における受信を確認し、結果が肯定的である場合にビデオストリームを復号化して視聴することを含んでいる。 | ||||||
| 68 | ポーラ符号逐次除去リスト復号器でのメモリ管理およびパスソート技法 | JP2018525737 | 2016-11-23 | JP2018535608A | 2018-11-29 | ラーザ,ザヒール; シェルビー,ケヴィン・エイ |
| 改善されたSCL復号器動作のためのシステムおよび方法のさまざまな実施形態について記述する。詳細には、更新されたパス指標統計情報に基づきバッファ管理の効率を改善するさまざまな実施形態について記述する。いくつかの実施形態では、SCL復号器は、先行する更新サイクル以来、変化した統計情報だけに、行あたりのLLR更新の範囲を制限するように選択的置換を遂行してもよい。いくつかの実施形態では、SCL復号器は、更新された行が導出される元の行に基づき、 【数1】 と 【数2】 の両方のビット推定値(LLR)更新のインプレースの計算を伴う場合がある遅延更新を遂行してもよい。 【選択図】図7 |
||||||
| 69 | 信号処理装置及び信号処理方法 | JP2016573224 | 2016-02-02 | JP6365695B2 | 2018-08-01 | 森江 正夫 |
| 70 | 通信装置、通信システム、通信方法およびプログラム | JP2017525792 | 2016-04-25 | JPWO2017002291A1 | 2018-04-19 | 深田 浩之; 古谷 高弘 |
| 基地局から送信された情報パケットを受信する機能と、複数の受信端末で情報を共有するためのローカルネットワークに接続する通信機能と、パリティパケットを生成する機能と、生成したパリティパケットと生成元パケットすべての識別情報とをローカルネットワークにマルチキャストする機能と、他の端末がマルチキャストしたパリティパケットと生成元パケットすべての識別情報とをローカルネットワークを通じて受信する機能と、受信したパリティパケットと生成元パケットすべての識別情報とを記憶部に保存する機能と、パリティパケットと生成元パケットすべての識別情報とを使用して欠落しているパケットを回復させる機能とを備える。図3 | ||||||
| 71 | 設計支援方法、設計支援プログラム、および設計支援装置 | JP2016507155 | 2014-03-11 | JP6164359B2 | 2017-07-19 | 富田 憲範 |
| 72 | 演算回路、符号化回路及び復号回路 | JP2016520885 | 2014-05-23 | JPWO2015177917A1 | 2017-04-20 | 富田 憲範; 憲範 富田 |
| 演算処理を高速化する。メモリ(M0〜M15)は、排他的論理和演算を行う単位となるデータブロックを保持し、選択回路(2a〜2p)は、選択信号を受け、メモリ(M0〜M15)から読み出される複数のデータブロックのうち、排他的論理和演算に使用する2以上のデータブロックを選択信号に基づき選択し、XOR回路(3a〜3o)(排他的論理和演算回路)は、選択回路(2a〜2p)で選択された2以上のデータブロックに基づく排他的論理和演算を行う。 | ||||||
| 73 | 関数の計算のためのルックアップテーブルを記憶した計算装置 | JP2015522246 | 2013-10-21 | JP5851074B2 | 2016-02-03 | ゴリッセン パウルス マシアス ヒューバータス メチティルディス アントニウス; トルフィツェン ルドヴィクス マリヌス ジェラルダス マリア |
| 74 | In-place transformation with application to encoding and decoding various classes of codes | JP2012155062 | 2012-07-10 | JP2012249305A | 2012-12-13 | MICHAEL G RUBIN; M AMIN SHOKROLLAHI |
| PROBLEM TO BE SOLVED: To provide FEC encoding and decoding transformations of source blocks using in-place transformations.SOLUTION: An encoder for encoding symbols of data with the use of a computing device having memory constraints loads a source block into memory of the computing device, performs an intermediate transformation of less than all of the source block, replaces a part of the source block with intermediate results in the memory, and then completes the transformation such that output symbols stored in the memory form a set of encoded symbols. A decoder performs decoding steps in an order that allows for use of substantially the same memory for storing received data and decoded source data as performing an in-place transformation. Using an in-place transformation, a large portion of memory set aside for received data is overwritten as that received data is transformed into decoded source data. | ||||||
| 75 | System for the implied user equipment identification | JP2008068359 | 2008-03-17 | JP4951557B2 | 2012-06-13 | イー．テリー スティーブン; ジー．ディック スティーブン; ボローチ ネーダー |
| A user equipment (UE) comprising means for receiving a wireless signal of a control channel; means for determining whether criteria are met; and means for processing a downlink shared channel indicated by the wireless signal on a condition that the criteria are met. | ||||||
| 76 | System for implicit user equipment identification | JP2011183967 | 2011-08-25 | JP2011234423A | 2011-11-17 | BOLOURCHI NADER; TERRY STEPHEN E; DICK STEPHEN G |
| PROBLEM TO BE SOLVED: To eliminate the necessity of performing separate processes for a user equipment identity (UE ID) and a cyclic redundancy check (CRC).SOLUTION: User equipment (UE) receives a first wireless signal of a high speed shared control channel (HS-SCCH), containing: an N-bit field containing an N-bit cyclic redundancy check (CRC) modulo 2 combined with an N-bit UE identity; and information indicating at least one high speed downlink shared channel (step 4). Whether the CRC is correct is determined (step 5). When a criterion that the CRC is correct is satisfied, a second wireless signal of the at least one high speed downlink shared channel related to the first wireless signal is processed (steps 6 and 7). | ||||||
| 77 | System for implicit user equipment identification | JP2009173239 | 2009-07-24 | JP2009296620A | 2009-12-17 | BOLOURCHI NADER; TERRY STEPHEN E; DICK STEPHEN G |
| PROBLEM TO BE SOLVED: To perform a user equipment identification (UE ID) and a cyclic redundancy check (CRC) not separately. SOLUTION: A method includes: a step 4 of receiving, by user equipment (UE), an N-bit field including an N-bit cyclic redundancy check (CRC) code modulo 2 combined with an N-bit UE identification, and wireless signal of a high speed shared control channel including data indicative of at least one high speed downlink shared channel; a step 5 of determining whether the CRC code is correct; and steps 6 and 7 of processing wireless signal related to the above wireless signal, of the above at least one high speed downlink shared channel, when the criterion including that the CRC code is correct is satisfied. COPYRIGHT: (C)2010,JPO&INPIT | ||||||
| 78 | In the selective call radio, a method of decrypting the jamming data block is received as a radio signal | JP2000552815 | 1999-04-28 | JP4282903B2 | 2009-06-24 | スリム・スイッシ; トーマス・エー・セクストン; ハイ・シェ |
| 79 | Method and system for decoding symbol sequence received via communication path into codeword of error correcting code | JP2008127204 | 2008-05-14 | JP2009005343A | 2009-01-08 | DRAPER STARK C; YEDIDIA JONATHAN S |
| PROBLEM TO BE SOLVED: To provide a decoding method for executing an optimum ML decoding of a LDPC code having a long block length in a reasonable time. SOLUTION: A log likelihood ratio is determined from a symbol sequence received via a communication path. A constraint set is initialized in accordance with the log likelihood ratio. An adaptive linear programming decoder is applied to the constraint set and the log likelihood ratio in accordance with an error correcting code to generate an estimated value for a codeword and an updated constraint set. When the estimated value for the codeword is a non-integer false codeword, the updated constraint set is further updated into an integer constraint set and an applicable step is set on. If no, the estimated value for the codeword is generated as a final codeword. COPYRIGHT: (C)2009,JPO&INPIT | ||||||
| 80 | Simple decoding method and apparatus | JP2003550370 | 2002-11-26 | JP4191043B2 | 2008-12-03 | コンスタント ピー エム ジェイ バッゲン |
QQ群二维码
意见反馈
意见反馈