Decoding of turbo codes in symmetric alpha-stable noise (Q542685): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: This paper investigates the decoding of turbo codes in impulsive symmetric \(\alpha \)-stable (S\(\alpha \)S) noise. Due to the nonexistence of a closed-form expression for the probability density function (pdf) of \(\alpha \)-stable processes, numerical-based S\(\alpha \)S pdf is used to derive branch transition probability (btp) for the maximum a posteriori turbo decoder. Results show that in Gaussian noise, the turbo decoder achieves similar performance using both the conventional and the proposed btps, but in impulsive channels, the turbo decoder with the proposed btp substantially outperforms the turbo decoder utilizing the conventional btp. Results also confirm that the turbo decoder incorporating the proposed btp outperforms the existing Cauchy-based turbo decoder in non-Cauchy impulsive noise, while the two decoders accomplish similar performance in Cauchy noise. | |||
| Property / review text: Summary: This paper investigates the decoding of turbo codes in impulsive symmetric \(\alpha \)-stable (S\(\alpha \)S) noise. Due to the nonexistence of a closed-form expression for the probability density function (pdf) of \(\alpha \)-stable processes, numerical-based S\(\alpha \)S pdf is used to derive branch transition probability (btp) for the maximum a posteriori turbo decoder. Results show that in Gaussian noise, the turbo decoder achieves similar performance using both the conventional and the proposed btps, but in impulsive channels, the turbo decoder with the proposed btp substantially outperforms the turbo decoder utilizing the conventional btp. Results also confirm that the turbo decoder incorporating the proposed btp outperforms the existing Cauchy-based turbo decoder in non-Cauchy impulsive noise, while the two decoders accomplish similar performance in Cauchy noise. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 94B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5907353 / rank | |||
Normal rank | |||
Revision as of 10:38, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decoding of turbo codes in symmetric alpha-stable noise |
scientific article |
Statements
Decoding of turbo codes in symmetric alpha-stable noise (English)
0 references
14 June 2011
0 references
Summary: This paper investigates the decoding of turbo codes in impulsive symmetric \(\alpha \)-stable (S\(\alpha \)S) noise. Due to the nonexistence of a closed-form expression for the probability density function (pdf) of \(\alpha \)-stable processes, numerical-based S\(\alpha \)S pdf is used to derive branch transition probability (btp) for the maximum a posteriori turbo decoder. Results show that in Gaussian noise, the turbo decoder achieves similar performance using both the conventional and the proposed btps, but in impulsive channels, the turbo decoder with the proposed btp substantially outperforms the turbo decoder utilizing the conventional btp. Results also confirm that the turbo decoder incorporating the proposed btp outperforms the existing Cauchy-based turbo decoder in non-Cauchy impulsive noise, while the two decoders accomplish similar performance in Cauchy noise.
0 references
