Abstract:
PROBLEM TO BE SOLVED: To provide methods and apparatuses for detecting and/or correcting errors in binary data by utilizing LDPC codes. SOLUTION: For facilitating hardware implementation, messages are quantized to integral multiples of 1/2 In2. Messages are transformed between more compact variable and less compact constraint message representation formats. The variable node message format allows variable node message operations to be performed through simple additions and subtractions, while the constraint node representation allows constraint node message processings that are performed through simple additions and subtractions. Variable and constraint nodes are realized by using an accumulator module, subtractor module and delay pipeline. COPYRIGHT: (C)2009,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a method and apparatus for communication resource assignment information and for using the assignment information in a wireless communications system.SOLUTION: A mobile is assigned an identifier and a mask value as a part of a state transition message. The mobile uses the assigned identifier and/or the assigned mask value in determining whether traffic channel assignment messages are directed to a wireless terminal. Predetermined associations between assigned slots, assigned segments, and/or the mask values are utilized to limit control signaling overhead. Different groups of segments are available for assignment to different wireless terminals as a function of mask values. Different types of assignment messages use different amounts of information bits to convey the assignment. Some types of assignments use a wireless terminal identifier, while other types of assignments use a wireless terminal identifier and a mask identifier.
Abstract:
PROBLEM TO BE SOLVED: To provide methodologies that facilitate transmitting beacon symbols of a beacon message such that a sequence of symbols can satisfy a linear constraint over a field where the field elements can be identified with carriers.SOLUTION: A coding scheme can be applied to a beacon message; the coding scheme can produce a plurality of beacon symbols to transmit on given subcarriers. A receiving device of the beacon symbols decodes a beacon message by receiving less than the total number of symbols in a beacon message and determining the remaining symbol subcarriers based on the linear constraint. Thus, more efficient decoding of beacons is facilitated as well as resolving beacon ambiguity by figuring out which symbols satisfy linear constraints for the symbols, and resolving time and frequency shift by detecting an offset that would result in satisfaction of the linear constraint.
Abstract:
PROBLEM TO BE SOLVED: To efficiently utilize limited amounts of bandwidth for redundant information communication in improved ARQ mechanisms. SOLUTION: Different NAK signals are used to indicate different relative levels in regard to an unsuccessful attempt to decode a received signal. An ACK signal is used in the case of successful decoding. A device which generates and transmits the original encoded signal receives the NAK signal and selects a portion of redundant information, e.g., additional error correction bits, to be transmitted based on the value of the NAK signal. If the NAK signal indicates a low level decoding success, indicating a relatively large number of errors in the decoded signal, a large set of redundant information is selected and transmitted. If the NAK signal indicates a relatively successful decoding, e.g., relatively few errors, a small set of redundant information is selected and transmitted. When a small set of redundant information is transmitted, new information can be transmitted with the redundant information. COPYRIGHT: (C)2011,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide techniques for implementing message passing decoders, e.g., LDPC decoders.SOLUTION: Messages are quantized to integer multiples of 1/2 ln2, and transformed between a more compact variable node message representation format and less compact constraint node message representation format. The variable node message format allows variable node message operations to be performed through simple additions and subtractions while the constraint node representation allows constraint node message processing to be performed through simple additions and subtractions. Variable and constraint nodes are implemented using an accumulator module 1302, a subtractor module 1304 and a delay pipeline 1306. The accumulator module 1302 generates and stores an accumulated message sum 1316, and then delayed input messages from the delay pipeline 1306 are subtracted from the accumulated message sum to generate output messages 1321.
Abstract:
A flexible and relatively hardware efficient LDPC decoder is described. The decoder can be implemented with a level of parallelism which is less than the full parallelism of the code structure used to control the decoding process. Each command of a relatively simple control code used to describe the code structure can be stored and executed multiple times to complete the decoding of a codeword. Different codeword lengths are supported using the same set of control code instructions but with the code being implemented a different number of times depending on the codeword length. The decoder can switch between decoding codewords of different lengths, without the need to change the stored code description information, by simply changing a code lifting factor that is indicative of codeword length and is used to control the decoding process.; When decoding codewords shorter than the maximum supported codeword length some block storage locations may go unused.
Abstract:
Systems and methodologies are described that facilitate identifying peers based upon encoded signals during peer discovery in a peer to peer network. For example, direct signaling that partitions a time-frequency resource into a number of segments can be utilized to communicate an identifier within a peer discovery interval; thus, a particular segment selected for transmission can signal a portion of the identifier, while a remainder can be signaled based upon tones communicated within the selected segment. Moreover, a subset of symbols within the resource can be reserved (e.g., unused) to enable identifying and/or correcting timing offset. Further, signaling can be effectuated over a plurality of peer discovery intervals such that partial identifiers communicated during each of the peer discovery intervals can be linked (e.g., based upon overlapping bits and/or bloom filter information).
Abstract:
A flexible and relatively hardware efficient LDPC decoder is described. The decoder can be implemented with a level of parallelism which is less than the full parallelism of the code structure used to control the decoding process. Each command of a relatively simple control code used to describe the code structure can be stored and executed multiple times to complete the decoding of a codeword. Different codeword lengths are supported using the same set of control code instructions but with the code being implemented a different number of times depending on the codeword length. The decoder can switch between decoding codewords of different lengths, without the need to change the stored code description information, by simply changing a code lifting factor that is indicative of codeword length and is used to control the decoding process.; When decoding codewords shorter than the maximum supported codeword length some block storage locations may go unused.
Abstract:
A flexible and relatively hardware efficient LDPC decoder is described. The decoder can be implemented with a level of parallelism which is less than the full parallelism of the code structure used to control the decoding process. Each command of a relatively simple control code used to describe the code structure can be stored and executed multiple times to complete the decoding of a codeword. Different codeword lengths are supported using the same set of control code instructions but with the code being implemented a different number of times depending on the codeword length. The decoder can switch between decoding codewords of different lengths, without the need to change the stored code description information, by simply changing a code lifting factor that is indicative of codeword length and is used to control the decoding process.; When decoding codewords shorter than the maximum supported codeword length some block storage locations may go unused.