摘要:
A method of providing forward error correction for data services uses a parallel concatenated convolutional code which is a Turbo Code comprising a plurality of eight-state constituent encoders wherein a plurality of data block sizes are used in conjunction with said Turbo Code. A variation uses the method in a cellular radio system. Another variation uses the method in both forward and reverse likes of a cellular radio system.
摘要:
A method and apparatus for Turbo encoding uses a set of rate-compatible Turbo Codes optimized at high code rates and derived from a universal constituent code. The Turbo Codes have rate-compatible puncturing patterns. The method comprises: encoding a signal at a first and second encoder using a best rate 1/2 constituent code universal with higher code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for each information bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing patterns; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern. In a variation, the best rate 1/2 constituent code represents a concatenation of polynomials 1+D2+D3 (octal 13) and 1+D+D3 (octal 15), D a data bit. A Turbo Encoder is provided which has hardware to implement the method.
摘要:
A method of terminating two or more constituent encoders of a turbo encoder employing a turbo code, comprising the steps of: generating tail input bits at each of two or more constituent encoders, including deriving the tail input bits from each of the two or more constituent encoders separately from a contents of shift registers within each of the two or more constituent encoders, after an encoding of information bits by the two or more constituent encoders; puncturing one or more tail output bits such that 1/R output tail bits are transmitted for each of a plurality of trellis branches, wherein R is a turbo code rate employed by the turbo encoder during an information bit transmission. In yet another variation, the step of puncturing the tail output bits further comprises the step of: transmitting, during trellis termination, the tail output bits, only if they are sent from an output branch of one of the two or more constituent encoders that are used during information bit transmission.
摘要:
A method and apparatus for Turbo encoding uses a set of rate-compatible Turbo Codes optimized at high code rates and derived from a universal constituent code. The Turbo Codes have rate-compatible puncturing patterns.The method comprises: encoding a signal at a first and second encoder using a best rate 1/2 constituent code universal with higher code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for each information bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing patterns; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern. In a variation, the best rate 1/2 constituent code represents a concatenation of polynomials 1+D2+D3 (octal 13) and 1+D+D3 (octal 15), D a data bit. A Turbo Encoder is provided which has hardware to implement the method.
摘要:
Systems and methods implementing a protocol that provides reliable transport over a point-to-point link characterized by deep and sustained fades. Such a communications link may be a free space optical channel or may be a radio frequency point-to-point channel. Data frames are processed through a circular data buffer that operates in a round robin fashion at a transmission node. The coding and forward error correction processes allow for continued operation in spite of possible signal fades due to atmospheric turbulence or other causes. At a receive node, incoming data is also saved in a circular buffer. A re-acknowledgment list is maintained at the receive node for tracking recently received and decoded data. This allows for a new acknowledgment to be sent in the event that a previously sent acknowledgment failed to reach the transmission node.
摘要:
The present invention includes a system and method by which a network of directional, wireless nodes that are not fixed in space can be optimized by optimizing each node individually. The network does not have a central control node, so each node is responsible for optimizing its surrounding topology. This is accomplished by synthesizing incoming information from neighboring nodes and determining which nodes will provide the best connections based on specific utilities each node is attempting to optimize. Neighboring nodes then exchange messages to request, accept, or reject directional connections between them based on their preferred optimizations. The overall directional network topology is achieved by consensus driven by local preferences.
摘要:
A decontamination apparatus is provided including an enclosure. A first and second decontamination system may be provided within the enclosure. The first and second decontamination systems may be arranged within the enclosure and configured to decontaminate the articles received in the enclosure. The first and second decontamination systems may rely on different methods of decontamination. The enclosure of the decontamination apparatus may be defined by a plurality of connected prefabricated modular walls. A mobile control and supply module may also be provided.
摘要:
A system and method for calculating and applying a metric that is calculated over a binary interval that corresponds in length to a preamble. The value of the metric reflects the likelihood that the interval is the preamble. A lower value for the metric suggests that the interval is more likely to be the preamble. In an embodiment, the metric is calculated beginning at an initial location in the bitstream, and then recalculated beginning at each of several successive locations in the bitstream. This results in a set of calculated metrics. The start of the preamble is considered likely to be the initial location of the interval that corresponds to the metric having the lowest value.