摘要:
Methods and apparatus for implementing memory efficient LDPC decodes are described. In accordance with the invention message information is stored in a compressed state for check node processing operations. The state for a check node is fully updated and then subject to an extraction process to generate check node to variable node messages. The signs of messages received from variable nodes may be stored by the check node processor module of the invention for use in message extraction. The check node processor can process messages in variable node order thereby allowing the variable node processor and check node processor to operate on messages in the same order reducing or eliminating the need to buffer and/or reorder messages passed between check nodes and variable nodes. Graph structures which allow check node processing on one graph iteration to proceed before the previous graph iteration has been completed are also described.
摘要:
Methods and apparatus for decoding codewords using message passing decoding techniques which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow decoding graph structures which are largely comprised of multiple identical copies of a much smaller graph. Copies of the smaller graph are subject to a controlled permutation operation to create the larger graph structure. The same controlled permutations are directly implemented to support message passing between the replicated copies of the small graph. Messages corresponding to individual copies of the graph are stored in a memory and accessed in sets, one from each copy of the graph, using a SIMD read or write instruction. The graph permutation operation may be implemented by simply reordering messages, e.g., using a cyclic permutation operation, in each set of messages read out of a message memory so that the messages are passed to processing circuits corresponding to different copies of the small graph.
摘要:
Methods and apparatus for encoding codewords which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow encoding graph structures which are largely comprised of multiple identical copies of a much smaller graph. Copies of the smaller graph are subject to a controlled permutation operation to create the larger graph structure. The same controlled permutations are directly implemented to support bit passing between the replicated copies of the small graph. Bits corresponding to individual copies of the graph are stored in a memory and accessed in sets, one from each copy of the graph, using a SIMD read or write instruction. The graph permutation operation may be implemented by simply reordering bits, e.g., using a cyclic permutation operation, in each set of bits read out of a bit memory so that the bits are passed to processing circuits corresponding to different copies of the small graph.
摘要:
Methods and apparatus for encoding codewords which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow encoding graph structures which are largely comprised of multiple identical copies of a much smaller graph. Copies of the smaller graph are subject to a controlled permutation operation to create the larger graph structure. The same controlled permutations are directly implemented to support bit passing between the replicated copies of the small graph. Bits corresponding to individual copies of the graph are stored in a memory and accessed in sets, one from each copy of the graph, using a SIMD read or write instruction. The graph permutation operation may be implemented by simply reordering bits, e.g., using a cyclic permutation operation, in each set of bits read out of a bit memory so that the bits are passed to processing circuits corresponding to different copies of the small graph.
摘要:
Methods and apparatus for decoding codewords using message passing decoding techniques which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow decoding graph structures which are largely comprised of multiple identical copies of a much smaller graph. Copies of the smaller graph are subject to a controlled permutation operation to create the larger graph structure. The same controlled permutations are directly implemented to support message passing between the replicated copies of the small graph. Messages corresponding to individual copies of the graph are stored in a memory and accessed in sets, one from each copy of the graph, using a SIMD read or write instruction. The graph permutation operation may be implemented by simply reordering messages, e.g., using a cyclic permutation operation, in each set of messages read out of a message memory so that the messages are passed to processing circuits corresponding to different copies of the small graph.
摘要:
A shield-like garment to be worn by dogs. The garment includes a durable water-resistant fabric cover that fits snugly on the back of the dog with straps that pass under the torso holding it in place. Due to the stiffness of the garment, the dog finds it very difficult if not impossible to bend and scratch areas that may be itching. The garment may have a fabric outer cover which presents relatively soft surfaces against the dog and a stiff plastic insert that extends up the length of the shield. The garment is sized to extend from the dog's tail to just behind the dog's neck for maximum resistance to the dog bending around.
摘要:
A first mobile node supports peer to peer communications but not cellular communications. Other mobile modes in the communication system support a cellular mode and may support a peer to peer communications mode. The communications system is such that spectrum may be dynamically reallocated between being designated to be used for peer to peer operations and being used primarily for cellular network based operations. Beacon signals are used to communicate a current mode of frequency spectrum usage designation. The first mobile node, being in an ongoing peer to peer communications session detects that the spectrum is being reallocated for cellular based operations. The first mobile node reduces its transmission power level in response to the detected spectrum reallocation. In some embodiments, the first mobile is allowed to continue its ongoing peer to peer session while the spectrum is primarily allocated for cellular communications, albeit at a lower transmission power level.
摘要:
Systems and methodologies are described that facilitate sharing bandwidth between a wide area network and a local area peer-to-peer network. The peer-to-peer network may use an air interface technology that is similar to distinct from an air interface technology used in the wide area network. Moreover, the wide area network and the local area peer-to-peer network may utilize distinct sets of parameters. For example, if the wide area network and the peer-to-peer network use OFDM-based air interface technologies, parameters such as tone spacing, symbol time, cyclic prefix, and the like of the two networks may vary. Further, peer-to-peer parameters may be a function of parameters for the wide area network.
摘要:
Downlink traffic channel data rate options and methods of indicating to a wireless terminal a utilized downlink data rate option are described. The downlink traffic channel rate option for a segment is conveyed using an assignment signal and/or a block in the downlink traffic channel segment which is not used for user data. Downlink segment assignment signals in some implementations allocate fewer bits for rate option indication than are required to uniquely identify each option. In some implementations low rate options, e.g., using QPSK, are uniquely identified via assignment signals. Higher rate options, e.g., using QAM16 modulation, are conveyed via the distinct information block in the downlink traffic segment using a first coding/modulation method. Still higher rate options, e.g., using QAM16, QAM64, or QAM256, are conveyed via the information block in the segment using a second coding/modulation method which is applied to the rate option information.
摘要:
The claimed subject matter relates to encoding and decoding information in a wireless communication system using soft-demodulation and interleaving of concatenated code received in a strip channel. A set of symbols is received containing a plurality of information bits, dividing the received set of symbols into a plurality of subsets of symbols, each subset corresponding to the input of an inner code demodulation selecting a set of initial a priori values of the inner code demodulation for each subset of symbols, and demodulating each subset of symbols, using the initial a priori values of the subset of symbols and an inner code generator matrix, to generate a plurality of first soft information values as the output of the inner code demodulation.