Abstract:
Certain aspects of the present disclosure generally relate to methods and apparatus for decoding low density parity check (LDPC) codes, and more particularly to an efficient list decoder for list decoding low density parity check (LDPC) codes.
Abstract:
Certain aspects of the present disclosure generally relate to techniques for enhanced puncturing and low-density parity-check (LDPC) code structure. A method for wireless communications by a transmitting device is provided. The method generally includes encoding a set of information bits based on a LDPC code to produce a code word, the LDPC code defined by a base matrix having a first number of variable nodes and a second number of check nodes; puncturing the code word according to a puncturing pattern designed to puncture bits corresponding to at least two of the variable nodes to produce a punctured code word; adding at least one additional parity bit for the at least two punctured variable nodes; and transmitting the punctured code word.
Abstract:
Certain aspects of the present disclosure generally relate to techniques for efficient, high-performance decoding of low-density parity check (LDPC) codes, for example, by using an adjusted minimum-sum (AdjMS) algorithm, which involves approximating an update function and determining magnitudes of outgoing log likelihood ratios (LLRs). Similar techniques may also be used for decoding turbo codes. Other aspects, embodiments, and features (such as encoding technique) are also claimed and described.
Abstract:
Certain aspects of the present disclosure generally relate to techniques for puncturing of structured low-density parity-check (LDPC) codes. Certain aspects of the present disclosure generally relate to methods and apparatus for a high-performance, flexible, and compact LDPC code. Certain aspects can enable LDPC code designs to support large ranges of rates, blocklengths, and granularity, while being capable of fine incremental redundancy hybrid automatic repeat request (IR-HARQ) extension while maintaining good floor performance, a high-level of parallelism to deliver high throughout performance, and a low description complexity.
Abstract:
Systems and methods which implement forward checking of data integrity are disclosed. A storage system of embodiments may, for example, comprise data integrity forward checking logic which is operable to perform forward checking of data integrity in real-time or near real-time to check that a number of node failures can be tolerated without loss of data. Embodiments may be utilized to provide assurance that a number of fragments needed for source data recovery will be available for the source objects most susceptible to failure when a certain number of additional fragments are lost, such as due to storage node failures.
Abstract:
Provided are apparatus and methods for ranging between a plurality of wireless devices. An exemplary method includes, at a first wireless device, transmitting a primary portion symbol comprising a first packet and transmitting a secondary portion symbol. The secondary portion symbol is transmitted simultaneously at a lower transmit power than the primary portion symbol, and the secondary portion symbol comprises a second packet identical to the first packet. The primary portion symbol can be transmitted in a first channel having a substantially 20 MHZ bandwidth and the secondary portion can be transmitted in a second channel having a substantially 20 MHZ bandwidth. The first and second channels are substantially adjacent in frequency. After transmitting the primary portion symbol, for example, a high-throughput long-training-field symbol or a very-high-throughput long-training-field symbol can be repetitively transmitted. This exemplary method enhances time-of-arrival estimation accuracy, minimizes decoding bottlenecking, and maximizes wireless device range.
Abstract:
Encoders, decoders and methods of encoding and decoding data can comprise receiving source symbols in a first sequence, storing the source symbols to a first memory in a second sequence, wherein the first sequence is a first interlacing relative to the second sequence, determining if the memory contains all source symbols of a codeword, wherein the source symbols of a codeword are the symbols used to generate repair symbols for that codeword, generating repair symbols for the codeword, storing the repair symbols to a second memory in a third sequence, interlacing the repair symbols and the source symbols into an output stream as a stream of encoded symbols, wherein the repair symbols appear in the output stream in a fourth sequence, wherein the fourth sequence is a second interlacing relative to the third sequence, and outputting the stream of encoded symbols.
Abstract:
A method, an apparatus, and a computer program product for wireless communication are provided in connection with enabling distributed frequency synchronization based on a fastest node clock rate. In one example, a first UE is equipped to determine that a fastest clock rate is faster than an internal clock rate of the first UE by more than a first positive offset, and adjust the internal clock rate based on the determined fastest clock rate. In an aspect, the fastest clock rate is associated with a second UE of one or more other UEs from which synchronization signals may be received. In another example, a UE is equipped to obtain GPS based timing information, adjust an internal clock rate based on the GPS based timing information, and transmit a synchronization signal at an artificially earlier time in comparison to a scheduled time of transmission associated with the adjusted internal clock rate.
Abstract:
Systems and methods which implement forward checking of data integrity are disclosed. A storage system of embodiments may, for example, comprise data integrity forward checking logic which is operable to perform forward checking of data integrity in real-time or near real-time to check that a number of node failures can be tolerated without loss of data. Embodiments may be utilized to provide assurance that a number of fragments needed for source data recovery will be available for the source objects most susceptible to failure when a certain number of additional fragments are lost, such as due to storage node failures.
Abstract:
Systems and methods which implement one or more data organization techniques that facilitate efficient access to source data stored by a storage system are disclosed. Data organization techniques implemented according to embodiments are adapted to optimize (e.g., maximize) input/output efficiency and/or (e.g., minimize) storage overhead, while maintaining mean time to data loss, repair efficiency, and/or traffic efficiency. Data organization techniques as may be implemented by embodiments include blob based organization techniques, grouped symbols organization techniques, data ordering organization techniques, and combinations thereof.