Recursive Systematic Convolutional Coder

Description

Recursive Systematic Convolutional (RSC) coder is a forward error correction (FEC) component employed in 3GPP radio access technologies, notably in UMTS (3G) and aspects of LTE. It operates as a convolutional encoder that generates parity bits from input data streams, characterized by its recursive structure and systematic output—meaning the input bits are directly included in the encoded stream alongside parity bits. This design enhances error correction capabilities while maintaining compatibility with iterative decoding algorithms like the Viterbi algorithm or turbo decoding. In 3GPP specifications, RSC is often used within turbo coding schemes, where two RSC encoders work in parallel with an interleaver to produce highly reliable codes.

The architecture of RSC in 3GPP systems involves integration into the physical layer's channel coding chain. For instance, in UMTS as defined in TS 25.212, RSC encoders are part of the turbo code for data channels, processing transport blocks before modulation and transmission. The encoder consists of shift registers and feedback loops, with parameters such as constraint length and generator polynomials specified to optimize performance for varying channel conditions. Key components include the encoder itself, interleavers for scrambling data sequences, and puncturing units to adjust code rates by selectively removing parity bits, thus balancing redundancy and spectral efficiency.

In operation, RSC works by taking a stream of information bits and passing them through linear feedback shift registers. The recursive nature means the encoder's state depends on previous inputs via feedback, which improves distance properties of the code, making it more resilient to errors. The systematic aspect ensures that the original data is transparently available, simplifying decoding. At the receiver, soft-decision decoders exploit this structure to correct bit errors caused by noise, interference, or fading. RSC's role is critical in achieving the high data rates and low latency required for voice, video, and data services, as it minimizes retransmissions and enhances overall link reliability.

Purpose & Motivation

RSC was introduced in 3GPP Release 4 for UMTS to address the need for more efficient error correction compared to non-recursive convolutional codes used in earlier 2G systems. Previous codes, like those in GSM, had limited performance gains and required higher signal-to-noise ratios for acceptable error rates. RSC, particularly when combined in turbo codes, offered near-Shannon-limit performance, enabling reliable communication over hostile radio channels with lower power consumption and improved spectral efficiency.

The creation of RSC was motivated by the increasing demand for high-speed data services in 3G networks, such as video calling and mobile internet. Traditional codes could not support the higher data rates without excessive overhead or degraded quality. RSC's recursive systematic form allowed for better iterative decoding, making it suitable for turbo coding implementations that significantly boosted throughput and coverage. This advancement was crucial for meeting the performance targets of UMTS and later LTE, supporting features like adaptive modulation and coding (AMC) and hybrid ARQ (HARQ).

Furthermore, RSC's adoption enabled more robust mobility and handover scenarios, as it provided consistent error protection across varying channel conditions. Its flexibility in code rate adjustment via puncturing allowed dynamic adaptation to link quality, optimizing resource usage. As 3GPP evolved, RSC continued to be relevant in LTE for certain control channels and legacy support, though newer codes like LDPC and polar codes have since taken prominence in 5G NR for data channels. Nonetheless, RSC remains a foundational technology in the history of cellular error correction.

Key Features

• Recursive structure with feedback for enhanced error correction
• Systematic output includes original data bits alongside parity
• Used as component encoders in turbo coding schemes
• Supports variable code rates via puncturing
• Enables iterative decoding for near-optimal performance
• Integrates with interleavers for robustness against burst errors

Evolution Across Releases

Defining Specifications