Maximum Likelihood Criterion Based on Polygon Inequality

§ Chin Min Institute of Technology

Send Message

To: Author

Maximum Likelihood Criterion Based on Polygon Inequality

Article Fingerprint

ReserarchID

CSTLW4KU

Maximum Likelihood Criterion Based on Polygon Inequality Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background

Abstract

This letter proposes a maximum likelihood criterion for soft-decision decoding algorithm of binary linear block codes over AWGN channel based on natural polygon inequality. In that criterion, Hamming weights are computed instead of Euclidean distances. As a result, decoding complexity is reduced in both generating test patterns and computing Euclidean distances.

References

8 Cites in Article
  1. J Wozencraft,I Jacobs (1965). Principles of Communication Engineering.
  2. H Tanaka,K Kakigahara (1983). Simplified correlation decoding by selecting possible codewords using erasure information (Corresp.).
  3. T Kaneko,T Nishijima,H Inazumi,S Hirasawa (1994). An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder.
  4. A Mahran,M Benaissa (2003). Adaptive Chase algorithm for block turbo codes.
  5. C Kuo,H Lai,E Lu (2007). Half-Chase algorithm of non-soft decision decoding based on majority.
  6. E Lu,H Wuu,Y Cheng,P Lu (1995). Fast algorithms for decoding the (23,12) binary Golay code with four-error-correcting capability.
  7. C Hackett (1981). An efficient algorithm for soft -decision decoding of the (24,12) extended Golay code.
  8. D Chase (1972). Class of algorithms for decoding block codes with channel measurement information.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Dr. Hsin-Kun Lai. 1970. "Maximum Likelihood Criterion Based on Polygon Inequality". Global Journal of Computer Science and Technology GJCST Volume 10 (GJCST Volume 10 Issue 7).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Version of record

v1.2

Issue date
September 10, 2010

Language
English
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 5.3K
Total Downloads: 337
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Maximum Likelihood Criterion Based on Polygon Inequality

Dr. Lai
Dr. Lai Chin Min Institute of Technology