42 results about "Global iteration" patented technology

Certain embodiments of the present invention are improved turbo-equalization methods for decoding encoded codewords. In one embodiment, in global decoding iteration i, the magnitude values of all decoder-input LLR values (Lch) are adjusted based on the number b of unsatisfied check nodes in the decoded codeword produced by global iteration i−1. The improved turbo-equalization methods can be used as the sole turbo-equalization method for a given global decoding session, or interleaved with other turbo-equalization methods.

Gauss-Seidel-Patel Loadflow (GSPL) loadflow calculation method is invented involving self-iteration over a node within global iteration over (n−1) nodes in n-node power network. Also invented is a network decomposition technique referred to as Suresh's diakoptics that determines a sub-network for each node involving directly connected nodes referred to as level-1 nodes and their directly connected nodes referred to as level-2 nodes, wherein the level of outward connectivity for local solution of a sub-network around a given node is to be determined experimentally. Sub-networks are solved in parallel, and local solution of sub networks are related into network wide global solution using an invented technique. These led to the invention of the best possible parallel computer—a server-processor parallel-processors architecture wherein each of the parallel processors communicate only with the server processor, commonly shared memory locations, and each processor's private memory locations but not among themselves.

Decoding is performed on input data to obtain first decoded data using a first error correction decoder. If decoding by a second error correction decoder on the first decoded data fails, decoding is performed using an output of the second decoder and using the first decoder. A reservation request is sent from the second error correction decoder to a memory prior to completion of the decoding on the first decoded data. Space is reserved in the memory in response to receiving the reservation request from the second decoder.

An error correction data processing apparatus includes a noise predictive calibration circuit operable to calibrate a first set of filter coefficients based on a first data set and a second set of filter coefficients based on a second data set, and includes a first noise predictive detector operable to receive the first set of filter coefficients. The apparatus further includes a decoder operable to perform a first global iteration with the first noise predictive detector and determine a violation check count value, and a second noise predictive detector operable to receive the second set of filter coefficients if the violation check count value is less than a predetermined value or receive the first set of filter coefficients if the violation check count value is greater than the predetermined value.

The present inventions are related to systems and methods for information data processing included selective decoder message determination. In one example, a data processing system is disclosed that includes a data decoder circuit operable to apply a conditional data decoding algorithm to a data set to yield a decoded output. The conditional decoding algorithm is operable to calculate node messages using an approach selected from a group consisting of: a first message determination mechanism, and a second message determination mechanism; where one of the first message determination mechanism and the second message determination mechanism is selected based upon a condition that includes a global iteration count applied to the data set.

Decoding is performed on input data to obtain first decoded data using a first error correction decoder. If decoding by a second error correction decoder on the first decoded data fails, decoding is performed using an output of the second decoder and using the first decoder. A reservation request is sent from the second error correction decoder to a memory prior to completion of the decoding on the first decoded data. Space is reserved in the memory in response to receiving the reservation request from the second decoder.

The invention discloses a layout optimization method of a short-range communication system roadside communication unit special for the Internet of vehicles. The method includes the steps that firstly, an Internet-of-vehicles roadside unit network in an actual application scene is extracted and abstracted into a complex network; secondly, a target function and an efficiency and cost function are built; thirdly, initial disturbance is introduced to simulate the cascading failure process of the network, and parameters of the target function are adjusted; fourthly, parameters in the CRO algorithm are determined, and the iteration process is executed to obtain the global optimal solution; fifthly, change trends of four theoretical index values corresponding to the global iteration process are recorded and saved in an information database, and qualitative and quantitative evaluation and reference are provided for similar network optimization. The network structure of the Internet-of-vehicles roadside unit network is optimized by means of related theories of the complex network according to the common cascading failure problem in a communication network, and reliable guarantee is provided for normal operation of a vehicle self-organizing network.