Shin-Lin Shieh

Learn More
—Cyclic redundancy check (CRC) bits that are conventionally used for error detection have recently found a new application in universal mobile telecommunications system standard for message length detection of variable-length message communications. It was anticipated that the CRC bits, when they are coworked with the inner convolutional code, can be used(More)
—Recently, a maximum-likelihood (ML) decoding algorithm with two phases has been proposed for convolutional tail-biting codes [1]. The first phase applies the Viterbi algorithm to obtain the trellis information, and then the second phase employs the algorithm A* to find the ML solution. In this work, we improve the complexity of the algorithm A* by using a(More)
Due to rapid interest on the applications of convolutional tail-biting to communication systems, several suboptimal algorithms have been proposed to achieve near-optimal Word error rate (WER) performances with circular Viterbi decoding approach. Among them, the wrap-around Viterbi algorithm (WAVA) proposed is the one with least decoding complexity. Very(More)
Cyclic redundancy check (CRC) bits that are conventionally used for error detection have recently found a new application in UMTS WCDMA standard (specifically , " blind transport format detection ") for message length detection of variable-length message communications. Co-worked with the inner convolutional code, it was demonstrated that the CRC bits can(More)
Cyclic redundancy check (CRC) bits that are conventionally used for error detection have recently found a new application in UMTS WCDMA standard (specifically, "blind transport format detection") for message length detection of variable-length message communications. Co-worked with the inner convolutional code, it was demonstrated that the CRC bits can(More)
—In this work, we proposed a reliability-based enhancement for the decoding of convolutional tail-biting codes (CTBC) from the observations that the decoding does not have to start from the beginning of the received vector, and that the reliability of the received vector can be used to determine a good starting position of the decoding process. Simulations(More)
Introduction Various detectors for Multiple-In-Multiple-Out (MIMO) technologies have been proposed, yet to achieve best complexity and performance tradeoff still remain a challenge. We proposed a low complexity soft-output sphere decoding called Modified RTS that can achieve good complexity-performance tradeoff and is hardware implementable. We further(More)
In this work, we revisited the priority-first sequential-search decoding algorithm proposed in Han et al. (2002). By adopting a new metric other than the conventional Fano one, the sequential-search decoding in Han et al. guarantees the maximum- likelihood (ML) performance, and hence, was named the maximum-likelihood sequential decoding algorithm (MLSDA).(More)