Abstract: The present invention relates to SISO decoder for iteratively decoding a block of received information symbols (r), in particular for use in a turbo decoder, said block being divided into a number of windows of information symbols.

Abstract: In an electronic circuit data is transmitted between data processing circuits across a network (12). A two-way network interface is provided for both sending transmission messages and receiving reception messages between a pair of processors through the network. The network interface uses transmission messages to transmit both data and information representing respective amounts of unreported buffer space R for receiving data items from reception messages in a buffer storage circuit (27) for the processing circuit (10). The network interface holds up transmission of a transmission message from a particular one of the data processing circuits (10) until a number A of data items, that the particular one of the data processing circuits (10) has made available for transmission in the message and for which buffer space is available across the network (12), exceeds a threshold.

Abstract: The invention relates to a decoding method for decoding Low-Density Parity Check codes in transmission and recording systems. The method comprises a running minimum loop comprising the following iterative sub-steps:—reading a reliability value from the input sequence of input reliability values,—comparing said reliability value with a stored value,—overwriting the stored value with said reliability value if said reliability value is smaller than said stored value.

Abstract: Sliding-window decoders with processor-systems (1) for decoding streams of symbols run prolog deriving processes (23) for deriving initial parameters for prolog-windows, and run main deriving processes (24) for deriving main parameters for main-windows thereby using initial conditions defined by said initial parameters. By introducing defining processes (22) for defining the prolog-windows having a flexible number of symbols, a flexible size, dependently upon the needed quality of the initial condition, the prolog-window can be made larger/smaller (initial condition with higher/lower quality). As a result, the efficiency is improved, as a consequence of the average overlap between prolog-windows of a certain main-window and a neighboring main-window being reduced. Preferably, per main-window, the prolog-windows get increasing sizes. Based upon the insight of initial conditions needing to have flexible qualities, the basic idea introduces flexible sizes for prolog-windows.