Decoding of turbo codes in symmetric alpha-stable noise (Q542685): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
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
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.5402/2011/683972 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987360397 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58689980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistical nature of impulse noise interarrival times in digital subscriber loop systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impulsive noise: A nontraditional approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soft-Decision Metrics for Coded Orthogonal Signaling in Symmetric Alpha-Stable Noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Order Statistics: A Mathematical Framework for the Processing and Characterization of Very Impulsive Signals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:24, 4 July 2024

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
    0 references
    0 references
    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

    Identifiers