A novel algorithm is proposed for the interpolation step of the Guruswami-Sudan list decoding algorithm. The proposed method is based on the binary exponentiation algorithm, and can be considered as an extension of th...
详细信息
A novel algorithm is proposed for the interpolation step of the Guruswami-Sudan list decoding algorithm. The proposed method is based on the binary exponentiation algorithm, and can be considered as an extension of the Lee-O'Sullivan method. The algorithm is shown to achieve both asymptotical and practical performance gain compared to the case of iterative interpolation algorithm. Further complexity reduction is achieved by employing the reencoding transformation. The key contribution of the paper, which enables the complexity reduction, is a novel randomized ideal multiplication algorithm.
Algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes can provide substantial coding gain with polynomial complexity. To reduce the complexity of ASD decoders, reencoding and coordinate transformation need...
详细信息
Algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes can provide substantial coding gain with polynomial complexity. To reduce the complexity of ASD decoders, reencoding and coordinate transformation need to be applied, which require a reencoder and an erasure decoder. In the reencoded and transformed ASD decoders, these two blocks take a significant part of the overall decoder area and may limit the achievable throughput. In this brief, the reencoder design based on direct polynomial multiplication is further simplified by reformulating the involved equations. Moreover, two innovative area-reducing methods are proposed for the transformed coordinate computation. Efficient architectures are developed for the proposed schemes, and two reencoders are implemented using 0.18-mu m CMOS technology. For a (255, 239) RS code, both reencoders can achieve throughput of at least 1.77 Gb/s and more than 30% higher efficiency in terms of throughput-over-area ratio than prior work. With minor modifications, the proposed design can also be employed to implement efficient erasure decoding.
Three experiments examined repeated retention testing effects in a contextual interference (CI) protocol. Retention was assessed at 10 min and 24 hr following acquisition or at just 24-hr for the one-test conditions. ...
详细信息
Three experiments examined repeated retention testing effects in a contextual interference (CI) protocol. Retention was assessed at 10 min and 24 hr following acquisition or at just 24-hr for the one-test conditions. Experiments 1 and 2 used speeded-response key-pressing tasks. Dependent measures were total time and errors. Experiment 3 used sequential-timing tasks. Dependent measures were absolute error and absolute constant error. Results revealed CI effects in each experiment. Repeated retention testing effects were not found in Experiments 1 and 3. Experiment 2 revealed superior performance by the two-test condition compared to the one-test condition. This result was qualified by possible practice effects during the 10-min test. It was concluded that repeated retention testing does not present problems for most studies of CI.
暂无评论