序号 | 专利名 | 申请号 | 申请日 | 公开(公告)号 | 公开(公告)日 | 发明人 |
---|---|---|---|---|---|---|
101 | METHOD AND APPARATUS FOR DECODING RECEIVED DATA SIGNALS | EP08751147.3 | 2008-02-11 | EP2243240A1 | 2010-10-27 | VILLION, Mathieu; POIRIER-CLARAC, Laurence; TARDY, Pierre |
Decoder (300) is arranged to receive an encoded data signal. The decoder (300) comprises a forward error correction decoder (310) arranged to perform forward error correction decoding on the encoded data signal, to produce a decoded data signal. The decoder (300) comprises header bit prediction logic (350) arranged to predict a value for at least one header bit within the decoded data signal, and to provide the predicted value for the at least one header bit to the forward error correction decoder (310) to be applied during forward error correction decoding. | ||||||
102 | Method and apparatus for channel encoding and decoding in a communication system using low-density parity-check codes | EP09154641.6 | 2009-02-26 | EP2099136A1 | 2009-09-09 | Myung, Seho; Kwon, Hwan-Joon; Kim, Kyung-Joong; Yang, Kyeong-Cheol; Yang, Hyun-Koo; Kim, Jae-Yoel; Lee, Hak-Ju |
A method and apparatus for decoding a channel in a communication system using a Low-Density Parity-Check (LDPC) code. The decoding method includes demodulating a signal transmitted from a transmitter; determining whether there is at least one shortened bit in the demodulated signal; when there is at least one shortened bit, determining a position of the at least one shortened bit by estimating information about a shortening pattern; and decoding data using the determined position of the shortened bit; wherein the shortening pattern is determined in consideration of a modulation scheme. |
||||||
103 | VERFAHREN ZUM KANALDECODIEREN EINES DATENSTROMS MIT NUTZDATEN UND REDUNDANZDATEN, VORRICHTUNG ZUM KANALDECODIEREN, COMPUTERLESBARES SPEICHERMEDIUM UND COMPUTERPROGRAMM-ELEMENT | EP01931438.4 | 2001-04-11 | EP1287617A1 | 2003-03-05 | BURKERT, Frank; BÄSE, Gero; BUSCHMANN, Ralf |
The data stream contains useful data and redundant data and at least one source-coded error-containing bit sequence that characterizes a given position within the data stream. The source-coded, error-free bit sequence is known by the channel decoder. The data stream is channel-decoded and the source-coded, error-containing bit sequence is determined from the channel-coded data stream. The data stream is once again channel-decoded, wherein the data stream is once again channel decoded taking into account the detected source-coded, error-containing bit sequence. | ||||||
104 | VERFAHREN UND ANORDNUNG ZUR DECODIERUNG VON INFORMATIONEN | EP00988598.9 | 2000-11-14 | EP1252716A1 | 2002-10-30 | XU, Wen |
In order to achieve source-controlled decoding, the influence of the a priori or a posteriori information about the source statistics is modified in accordance with the reliability of the decoding. | ||||||
105 | A LOW COMPLEXITY ENCRYPTION METHOD FOR CONTENT THAT IS CODED BY A RATELESS CODE | PCT/US2008004035 | 2008-03-27 | WO2008156514A2 | 2008-12-24 | RAMPRASHAD SEAN A |
A method and apparatus is disclosed herein for a low complexity method of securing content that is coded by a rateless code whereby it is noted that it is sufficient to encrypt only a subset of the ratelessly coded packets. In one embodiment, the method comprises performing rateless coding on a first set of blocks of data to produce ratelessly encoded blocks of data and performing encryption on a subset of the ratelessly encoded blocks of data based on a degree value for each of the ratelessly encoded blocks of data. | ||||||
106 | APPARATUS AND METHOD FOR DECODING A RECEIVED MESSAGE WITH A PRIORI INFORMATION | PCT/US2006061381 | 2006-11-30 | WO2007065115A3 | 2008-01-10 | SMOLINSKE JEFFREY C; BUCKLEY MICHAEL E; STEWART KENNETH A |
An apparatus and method for receiving a message stream on a channel (140). A message (160) is received (320) on the channel. Information regarding the bits of a successfully decoded message is added (340) to a message attributes list (275) if the message is successfully decoded. An attempt is made to decode (330) a subsequent message based on the information in the message attributes list. | ||||||
107 | Joint encryption and error correction encoding | US15114501 | 2014-01-30 | US10050645B2 | 2018-08-14 | Han Wang; Joseph E. Foster; Raghavan V. Venugopal; Patrick A. Raymond |
A technique includes jointly encrypting and error encoding plain text data. The joint encryption and error encoding includes processing plain text data in an encryption cipher comprising a plurality of successive rounds to generate cipher text data; and embedding error correction encoding in the encryption cipher to error correction encode the cipher text data. | ||||||
108 | TRANSACTION IDENTIFICATION SYNCHRONIZATION | US15417984 | 2017-01-27 | US20180219562A1 | 2018-08-02 | Xiaobing Lee; Feng Yang; Shaojie Chen |
Various embodiments include methods and apparatus structured to provide synchronization of a transaction identification between a host and a memory module using a parity check. A transaction identification can be generated at both the host and the memory module independently using incremental counters of these apparatus. Synchronization of the transaction identifications generated by the host and by a controller of the memory module can be implemented using a parity bit sequences pattern of a combination of the generated transaction identification plus the corresponding transaction command and data address. Use of transaction commands modified with respect to transaction identifications can be used in initialization of the synchronization, in message passing, and in error detection and response to errors. Additional apparatus, systems, and methods can be implemented in a variety of applications. | ||||||
109 | Concatenates of an E8 lattice with binary and non binary codes | US14466361 | 2014-08-22 | US09991907B1 | 2018-06-05 | Dariush Dabiri |
A transceiver architectures can contain an encoder and a decoder for communicating high speed transmissions. The encoder can modulate signal data for being mapped in a constellation that is generated based on concatenations of an E8 lattice having binary and non-binary codes. The data can be transmitted at a high speed according to the constellation with an embedded E8 lattice configuration in order to generate a coding gain. A decoder operates to decode the received input signal data with a decreased latency or a minimal latency with a high spectral efficiency. | ||||||
110 | METHOD AND DEVICE FOR TRANSMITTING DATA USING LDPC CODE | US15406060 | 2017-01-13 | US20180097581A1 | 2018-04-05 | Zhikun XU; Su HUANG; Zhengang PAN |
The present disclosure provides a method and a device for transmitting data using a LDPC code. The method for transmitting data using a LDPC code includes: determining a check code length according to a current LDPC code rate; informing a receiving end about the current LDPC code rate and the check code length, adding a check code with the check code length to data to be sent, and implementing a LDPC encoding using the current LDPC code rate, so as to obtain LDPC code data; and sending the LDPC code data to a receiving end. The method and the device of the present disclosure can improve spectrum effectiveness of transmitting data using LDPC code. | ||||||
111 | Key encapsulation mechanisms | US15619046 | 2017-06-09 | US09912479B1 | 2018-03-06 | Atsushi Yamada |
In a general aspect, a key encapsulation mechanism is used in a communication network. In some aspects, an error vector derivation function is applied to a random value to produce an error vector, and a plaintext value is obtained based on the random value. The error vector and the plaintext value are used in an encryption function to produce a ciphertext, and a key derivation function (KDF) is applied to the random value to produce a key derivation function output that includes a symmetric key and a confirmation value. The symmetric key is used to generate an encrypted message based on an unencrypted message. The ciphertext, the confirmation value, and the encrypted message are provided for transmission in a communication network. | ||||||
112 | Multi-wire symbol transition clocking symbol error correction | US14949290 | 2015-11-23 | US09842020B2 | 2017-12-12 | Shoichiro Sengoku |
Apparatus, systems and methods for error detection in transmissions on a multi-wire interface are disclosed. A method for correcting transmission errors in multi-wire transition-encoded interface may include determining whether a symbol error is present in the sequence of symbols based on a value of an error detection code (EDC) in the received plurality of bits, generating one or more permutations of the sequence of symbols, where each permutation includes one symbol that is different from corresponding symbols in the sequence of symbols and different from corresponding symbols in other permutations. A permutation in the one or more permutations may be identified as including a corrected sequence of symbols when it produces a decoded EDC value that matches an expected EDC value. The expected EDC value may correspond to a predefined value for EDCs transmitted over the multi-wire interface to enable detection of up to two symbol errors at the receiver. | ||||||
113 | Multi-rate transmissions over twinax cables | US14466327 | 2014-08-22 | US09787519B2 | 2017-10-10 | Dariush Dabiri; Tarun Gupta; Venkatesh Nagapudi |
Cable systems and assemblies integrate a reduced number of twin axial cables to transmit and received in a full-duplex transmission signals at transmission speeds greater than or equal to one hundred Giga bytes per second. The reduced number of twin axial cables comprise four or less twin axial cables, in which each pair forms a single twin axial full-duplex cable for passive or active communication of the signals at multiple different transmission rates concurrently. A processor can be integrated with the twin axial cables and operate to encode the signals for fast transmission speeds at the different transmission rates. | ||||||
114 | Duplex transmission over reduced pairs of twinax cables | US14179727 | 2014-02-13 | US09736000B2 | 2017-08-15 | Dariush Dabiri; Tarun Gupta; Venkatesh Nagapudi |
Cable systems and assemblies integrate a reduced number of twin axial copper pairs to transmit and received in a full-duplex transmission signals at transmission speeds greater than or equal to one hundred Giga bytes per second. The reduced number of twin axial copper pairs comprise four or less twin axial copper pairs, in which each pair forms a single twin axial full-duplex cable for passive or active communication of the signals. A processor can be integrated with the twin axial copper pairs operate to encode the signals for fast transmission speeds. | ||||||
115 | TECHNIQUES TO PERFORM FORWARD ERROR CORRECTION FOR AN ELECTRICAL BACKPLANE | US15360005 | 2016-11-23 | US20170104554A1 | 2017-04-13 | Ilango S. Ganga; Luke Chang; Andrey Belogolovy; Andrei Ovchinnikov |
Techniques to perform forward error correction for an electrical backplane are described. | ||||||
116 | SOFT GENERATION OF BIOMETRIC CANDIDATES AND REFERENCES BASED ON EMPIRICAL BIT ERROR PROBABILITY | US15126496 | 2015-03-17 | US20170093576A1 | 2017-03-30 | JOHAN-PAUL MARIA GERARD LINNARTZ |
A biometric verification device (100) arranged to compare a reference hash (480) with a verification bit string (420) obtained from a biometric, the biometric verification device comprising: —a candidate bit string generator (130) arranged to generate candidate bit strings (430) from the verification bit string and error probabilities, —a hash unit (140) arranged to apply a cryptographic hash function to said generated candidate bit strings to obtain candidate hashes, —a comparison unit (160) arranged to verify if a candidate hash generated by the hash unit matches a reference hash. | ||||||
117 | JOINT ENCRYPTION AND ERROR CORRECTION ENCODING | US15114501 | 2014-01-30 | US20160344428A1 | 2016-11-24 | Han Wang; Joseph E. Foster; Raghavan V. Venugopal; Patrick A. Raymond |
A technique includes jointly encrypting and error encoding plain text data. The joint encryption and error encoding includes processing plain text data in an encryption cipher comprising a plurality of successive rounds to generate cipher text data; and embedding error correction encoding in the encryption cipher to error correction encode the cipher text data. | ||||||
118 | DATA ENCODING IN SOLID-STATE STORAGE APPARATUS | US15225856 | 2016-08-02 | US20160342466A1 | 2016-11-24 | Thomas Mittelholzer; Nikolaos Papandreou; Charalampos Pozidis |
A method for encoding an input data block for storage in q-level cells of solid-state memory includes producing a preliminary block from the input data block by modulation encoding at least part of the input block into a first group of qary symbols via a first drift-tolerant encoding scheme, the preliminary block comprising the first group of qary symbols and any remainder of the input block not encoded via the first encoding scheme; generating parity data for the preliminary block via an error-correction encoding scheme; modulation encoding the parity data and any remainder of the input block into a second group of qary symbols via a second drift-tolerant encoding scheme; and supplying the qary symbols of the first and second groups for storage in respective q-level memory cells. | ||||||
119 | TRANSMITTER AND REPETITION METHOD THEREOF | US15099998 | 2016-04-15 | US20160248442A1 | 2016-08-25 | Se-ho MYUNG; Kyung-joong KIM; Hong-sil JEONG |
A transmitter is provided. The transmitter includes: a low density parity check (LDPC) encoder configured to encode input bits to generate an LDPC codeword including the input bits and parity bits; a repeater configured to select at least a part of bits constituting the LDPC codeword and add the selected bits after the input bits; and a puncturer configured to puncture at least a part of the parity bits. | ||||||
120 | MAP DECODING METHOD USING AUGMENTED LATTICES | US15026433 | 2014-09-29 | US20160226527A1 | 2016-08-04 | Asma MEJRI; Ghaya REKAYA-BEN OTHMAN |
The invention relates to a MAP decoding method of a signal received through a noisy channel, the signal being composed of symbols in an alphabet having a non-uniform probability distribution, the symbols being represented by points in a lattice (Λ). The probability distribution of symbols is modeled using a Gaussian distribution. An augmented lattice (Λexp) is formed from the lattice (Λ) and the ratio (β) between variance of the noise and variance of the Gaussian distribution of symbols. Therefore, the disclosed MAP decoding method consists essentially of decoding using an ML criterion searching the point in the augmented lattice closest to the point representative of the received signal (yexp). |