摘要
In Contention Resolution Diversity Slotted ALOHA (CRDSA) and Irregular Repetition Slotted ALOHA (IRSA), iterative decoding is typically assumed to be instantaneous, overlooking the decoding latency encountered in practical systems. This paper proposes a Partially Parallel Decoding ( \textsf PPD) framework that offers a tunable trade-off between latency, complexity, and throughput. The proposed framework supports both CRDSA and IRSA with AWGN and Rayleigh fading by incorporating, in each iteration of the decoding process, a scheduling algorithm that selects target packets based on the number of available decoders, along with a slot selection algorithm that identifies a subset of time slots for the equalization step to manage complexity. Simulation results show that in both AWGN and fading environments, the PPD framework achieves performance close to that of sequential decoding while significantly reducing latency-by up to 64× for CRDSA and 16× for IRSA-with a practical number of decoders.