Abstract:
A sorting deck for paper, board, or pulp rolls has a plane (1) for transporting the rolls and controllable stops (2) for holding the rolls in place and releasing them. The stops (2) are positioned to form at least one line (3) in placed consecutively in the longitudinal direction (4) of the plane (1), and at least one row (5), in which the stops (2) are positioned adjacently to each other along the lateral direction (6) of the plane (1). At least some of the stops (2) are a collector (41) and a feeder (42), both of which can be moved freely between the hold and release positions, so that the travel of the rolls over the stop (2) can be optionally prevented, freely permitted, or permitted one roll at a time. The same sorting deck can be used to handle rolls of different widths.
Abstract:
In one aspect this invention provides a method to operate a decoder, and a decoder that operates in accordance with the method. The method includes monitoring, during operation of the decoder on a signal received from a channel, the value of at least one extrinsic value; and based on the monitored at least one value, determining whether the signal comprises a valid code word or comprises only noise. In a preferred, but non-limiting embodiment, the decoder comprises one of a LogMap or a MaxLogMap turbo decoder, and the decoder forms a part of a baseband section of a wideband code division multiple access (WCDMA) user equipment. During the process of decoding rounds the absolute values of extrinsic values tend to increase, provided that the input signal contains a valid code word, as opposed to when the input signal contains only noise, and where determining accurately distinguishes a valid code word from noise, and may also obtain information that is indicative of the quality of the decoding process.
Abstract:
A method and apparatus for automatically marking paper, board or cellulose web rolls at a slitter for the purpose of identifying the rolls during later finishing steps. Such finishing operations include, e.g., roll transport, rewinding, sheeting or other finishing steps and roll packaging. The roll identification code is also used for material management related to customer rolls. The roll identification information of a roll set leaving the slitter, that is, the sequence of rolls exiting from the slitter as a group is transmitted for the use of the roll marking equipment and the customer rolls are moved away from the slitter area only via the roll marking equipment and new rolls are prevented from entering the slitter area in any other form except as a new roll set. As a result, the correct identification data for each roll set is continuously available to the marking equipment.
Abstract:
A delay estimation method and a receiver in a radio system. Signals originate from one or several transmitters and propagate along several paths. One path (73-77) is selected at a time for estimation. The least squares minimization between the received signal and the code bank model is solved path by path (73-77) and delay by delay. The delay of only one selected path is changed at a time. Using the minimization results the delays of the other paths (73-77) remain unchanged. The minimization results establish the delay with the minimized result at most equal to the results for other delays. This delay is used as the constant value of the path (73-77) when the delays of the other paths are searched. The method provides the delays of all the paths (73-77) of all users simultaneously without information on user symbols or attenuation coefficients of the channel.
Abstract:
A sorting deck for paper, board, or pulp rolls has a plane (1) for transporting the rolls and controllable stops (2) for holding the rolls in place and releasing them. The stops (2) are positioned to form at least one line (3) in placed consecutively in the longitudinal direction (4) of the plane (1), and at least one row (5), in which the stops (2) are positioned adjacently to each other along the lateral direction (6) of the plane (1). At least some of the stops (2) are a collector (41) and a feeder (42), both of which can be moved freely between the hold and release positions, so that the travel of the rolls over the stop (2) can be optionally prevented, freely permitted, or permitted one roll at a time. The same sorting deck can be used to handle rolls of different widths.
Abstract:
A first grouping of memory space addresses is generated for systematic bits of a received codeword; a second grouping of memory space addresses is generated for a first set of coding bits of the received codeword, wherein the first set of coding bits comprises an ascending order; and a third grouping of memory space addresses is generated for a second set of coding bits of the received codeword, wherein the second set of coding bits comprises an interleaved order. A sub-codeword of the received codeword is decoded in parallel by accessing the first set of coding bits using the addresses in the second grouping of memory spaces. In turn, another sub-codeword of the received codeword is decoded in parallel by accessing the second set of coding bits using the addresses in the third grouping of memory spaces. Apparatus and a memory storing a computer program are also detailed.
Abstract:
A memory bank has a plurality of memories. In an embodiment, a forward unit applies logical memory addresses to the memory bank in a forward twofold access order, a backward unit applies logical memory addresses to the memory bank in a backward twofold access order, and a half butterfly network (at least half, and barrel shifters in 8-tuple embodiments) is disposed between the memory bank and the forward unit and the backward unit. A set of control signals is generated which are applied to the half or more butterfly network (and to the barrel shifters where present) so as to access the memory bank with an n-tuple parallelism in a linear order in a first instance, and a quadratic polynomial order in a second instance, where n=2, 4, 8, 16, 32, . . . . This access is for any n-tuple of the logical addresses, and is without memory access conflict. In this manner memory access may be controlled data decoding.
Abstract:
A first grouping of memory space addresses is generated for systematic bits of a received codeword; a second grouping of memory space addresses is generated for a first set of coding bits of the received codeword, wherein the first set of coding bits comprises an ascending order; and a third grouping of memory space addresses is generated for a second set of coding bits of the received codeword, wherein the second set of coding bits comprises an interleaved order. A sub-codeword of the received codeword is decoded in parallel by accessing the first set of coding bits using the addresses in the second grouping of memory spaces. In turn, another sub-codeword of the received codeword is decoded in parallel by accessing the second set of coding bits using the addresses in the third grouping of memory spaces. Apparatus and a memory storing a computer program are also detailed.
Abstract:
A memory bank has a plurality of memories. In an embodiment, a forward unit applies logical memory addresses to the memory bank in a forward twofold access order, a backward unit applies logical memory addresses to the memory bank in a backward twofold access order, and a half butterfly network (at least half, and barrel shifters in 8-tuple embodiments) is disposed between the memory bank and the forward unit and the backward unit. A set of control signals is generated which are applied to the half or more butterfly network (and to the barrel shifters where present) so as to access the memory bank with an n-tuple parallelism in a linear order in a first instance, and a quadratic polynomial order in a second instance, where n=2, 4, 8, 16, 32, . . . . This access is for any n-tuple of the logical addresses, and is without memory access conflict. In this manner memory access may be controlled data decoding.
Abstract:
The invention relates to trellis code decoder. The decoder comprises a path metrics calculation unit for calculating path metrics over at least two trellis columns in a trellis, and a memory for storing path metrics of the trellis. The decoder further comprises an input multiplexer connected between the read interface of the memory and the input interface of the path metrics calculation unit, and an output multiplexer connected between the output interface of the path metrics calculation unit and the write interface of the memory. The decoder further comprises a control for controlling configuration of the input multiplexer and configuration of the output multiplexer on the basis of states of the trellis, which state of the trellis defines the way the old path metrics and the new path metrics relate to each other, whereby internal configuration of the path metrics calculation unit remains the same for different code constraint lengths.