Superimposed codes based on punctured convolutional codes
M. Hattori, Yuichi Saitoh
Abstract
M. Hattori, Yuichi Saitoh
Abstract
Punctured convolutional codes of rates k1/n and k2/n are applied to |u|u + v| construction, and then a superimposed code of rate (k1 + k2)/(2n) is constructed. A suboptimal decoding procedure is presented for the superimposed codes, and it reduces the decoding complexity as compared with maximum likelihood decoding for the known convolutional codes.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Punctured convolutional codes of rates k1/n and k2/n are applied to |u|u + v| construction, and then a superimposed code of rate (k1 + k2)/(2n) is constructed. A suboptimal decoding procedure is presented for the superimposed codes, and it reduces the decoding complexity as compared with maximum likelihood decoding for the known convolutional codes.
Key concepts: Convolutional code, Serial concatenated convolutional codes, Decoding methods, Sequential decoding, Concatenated error correction code, Turbo code, Algorithm, Code (set theory)