Modified Reed-Solomon Decoder for UMTS Frame Synchronization

The patent performs preliminary actions by conducting hard decisions and reliability measurements on received symbols before decoding. The system pre-processes the signal by evaluating symbol reliability metrics and identifying potentially erroneous symbols, then applies erasure decoding only to those specific positions. This preliminary identification and marking of unreliable symbols before the actual decoding process resolves the contradiction by preparing the data in advance to prevent symbol errors from propagating through the decoding process.

The patent changes the parameter of symbol reliability assessment by introducing confidence metrics and erasure flags that dynamically mark symbols based on their quality. Instead of treating all symbols uniformly, the system transforms the raw symbol data into a formatted structure with reliability indicators, then uses these changed parameters to guide the erasure decoding process. This parameter transformation resolves the contradiction by enabling the decoder to distinguish between reliable and unreliable symbols, thereby improving code word determination reliability while managing symbol error rates.

The patent extracts and isolates only the unreliable symbols for erasure decoding, rather than processing the entire code word sequence uniformly. By separating the reliable symbols from the potentially erroneous ones and applying specialized decoding only where needed, the system reduces the overall computational burden. This extraction approach resolves the contradiction by focusing processing resources only on the problematic portions of the data, thereby improving processing efficiency while minimizing the memory and computational complexity required for error correction.

The patent applies erasure decoding partially, only to the specific symbols that have been identified as unreliable through preliminary reliability assessment. Instead of applying full erasure decoding to all symbols or using more complex iterative decoding schemes, the system performs the computationally intensive erasure decoding operation selectively and minimally. This partial action approach resolves the contradiction by achieving sufficient error correction performance with reduced computational effort and lower memory requirements compared to comprehensive decoding methods.