Abstract: An initialization method is performed to initialize the states for producing downlink scrambling code for a wideband code division multiple access (WCDMA) mobile device. The initialization method uses an auxiliary linear feedback shift register (x-LFSR) advance the x-initial state to a new initial state that corresponds to a selected downlink scrambling code. The new initial state allows the remaining masks used for generating the downlink scrambling code to be fixed. Memory required to produce the downlink scrambling codes is therefore reduced, as it is no longer dedicated to storing the sets of masks corresponding to each of the possible downlink scrambling codes.

Abstract: Methods and apparatus wherein subsequent permutation and inverse permutation operations provide inputs in correct order for first and second processes. Processes needing inputs in original order and processes needing inputs in permutated order can be distinguished, thereby using one of the processes as reference process. Permutation and inverse permutation operations which can fit into a turbo coding system and in systems applying the turbo coding principle. At least one permutation and one inverse permutation operation can be performed subsequently. Permutation and inverse permutation operations may be altered by scheduling linear writing and reading operation and permutated or inverse permutated writing and reading operations. These methods enable parallel execution of sub-processes, where the processes producing and consuming data can be performed in a parallel way, and the writing and reading operations to and from a memory can be performed in a parallel way.

Abstract: Methods and apparatus are described wherein subsequent permutation and inverse permutation operations provide inputs in correct order for first and second processes. Processes needing inputs in original order and processes needing inputs in permutated order can be distinguished, thereby using one of said processes as reference process. Permutation and inverse permutation operations are described which can fit into a turbo coding system and in systems applying the turbo coding principle. At least one permutation and one inverse permutation operation can be performed subsequently. Permutation and inverse permutation operations may be altered by scheduling linear writing and reading operations and permutated or inverse permutated writing and reading operations. These methods enable parallel execution of sub-processes, where the processes producing and consuming data can be performed in a parallel way, and the writing and the reading operations to and from a memory can be performed in a parallel way.