Error Performance Analysis of the K-best Viterbi Decoding Algorithm
The Viterbi algorithm is widely applied for the decoding of the convolutional codes. But the complexity is increase rapidly in the constraint length. The K-best Viterbi decoding algorithm for the convolutional codes is proposed to reduce its decoding complexity. This is expected to apply for Interne...
Gespeichert in:
| Veröffentlicht in: | 2018 International Symposium on Information Theory and Its Applications (ISITA) S. 257 - 260 |
|---|---|
| 1. Verfasser: | |
| Format: | Tagungsbericht |
| Sprache: | Englisch Japanisch |
| Veröffentlicht: |
IEICE
01.10.2018
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The Viterbi algorithm is widely applied for the decoding of the convolutional codes. But the complexity is increase rapidly in the constraint length. The K-best Viterbi decoding algorithm for the convolutional codes is proposed to reduce its decoding complexity. This is expected to apply for Internet of Things(IoT) devices which are low-scale and low-power hardwares. The author have already shown that the exact bit error performance of Viterbi decoding algorithm for convolutional codes. This analytical technique employs the iterative calculation of probability density function of path metrics. In this paper, the application for error performance analysis for K-best Viterbi decoding algorithm is demonstrated. |
|---|---|
| AbstractList | The Viterbi algorithm is widely applied for the decoding of the convolutional codes. But the complexity is increase rapidly in the constraint length. The K-best Viterbi decoding algorithm for the convolutional codes is proposed to reduce its decoding complexity. This is expected to apply for Internet of Things(IoT) devices which are low-scale and low-power hardwares. The author have already shown that the exact bit error performance of Viterbi decoding algorithm for convolutional codes. This analytical technique employs the iterative calculation of probability density function of path metrics. In this paper, the application for error performance analysis for K-best Viterbi decoding algorithm is demonstrated. |
| Author | Yoshikawa, Hideki |
| Author_xml | – sequence: 1 givenname: Hideki surname: Yoshikawa fullname: Yoshikawa, Hideki organization: Faculty of Engineering, Tohoku Gakuin University, Miyagi, 985-8537, Japan |
| BookMark | eNotz7tOwzAYQGEjwUALT9DFL5Dge5wxCgUiKoHUlrXy5XdrKbGRk6Vvz0Cns33SWaH7lBMgtKGkZryl7cuwHw5dzQjVtVZKcCXv0EpoLSXjVItH1G9LyQV_Qwm5TCY5wF0y43WOM84BLxfAn5WFecE_cYFiI34Fl31MZ9yN51zicpme0EMw4wzPt67R8W176D-q3df70He7KlItl0qAs567pglE-BCkU-C0A0cbT60nXOiGBSs945I0jhkfFJBWSdsy7xVQvkabfzcCwOm3xMmU6-n2xf8A3_hITA |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.23919/ISITA.2018.8664365 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library (IEL) (UW System Shared) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 4885523184 9784885523175 4885523176 9784885523182 |
| EndPage | 260 |
| ExternalDocumentID | 8664365 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i185t-4ecbd3c77f04dff5c6ec8cec17d1bd034872fb5d23507c2adf6e0965b92dd6e13 |
| IEDL.DBID | RIE |
| IngestDate | Thu Jun 29 18:39:00 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English Japanese |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i185t-4ecbd3c77f04dff5c6ec8cec17d1bd034872fb5d23507c2adf6e0965b92dd6e13 |
| PageCount | 4 |
| ParticipantIDs | ieee_primary_8664365 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-10-01 |
| PublicationDateYYYYMMDD | 2018-10-01 |
| PublicationDate_xml | – month: 10 year: 2018 text: 2018-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | 2018 International Symposium on Information Theory and Its Applications (ISITA) |
| PublicationTitleAbbrev | ISITA |
| PublicationYear | 2018 |
| Publisher | IEICE |
| Publisher_xml | – name: IEICE |
| Score | 1.6805689 |
| Snippet | The Viterbi algorithm is widely applied for the decoding of the convolutional codes. But the complexity is increase rapidly in the constraint length. The... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 257 |
| SubjectTerms | binary symmetric channel bit error probability Convolutional codes Decoding Error probability exact analysis Iterative decoding K-best Viterbi decoding algorithm Measurement Probability density function Viterbi algorithm Viterbi decoding |
| Title | Error Performance Analysis of the K-best Viterbi Decoding Algorithm |
| URI | https://ieeexplore.ieee.org/document/8664365 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LawIxEA4qPfTUFi19k0OPje4mm9dRrFIpiFBbvIlJJq3QurLV_v4mu1Yp9NJbCCEhM5CZL_PNDEK3jkPKFZ0Tro0JAMV7oqzIiKZKaWmE9Jktm03I0UhNp3pcQ3e7XBgAKMln0I7DMpbvcruJX2UdJYL9FLyO6lKKKlerKiREmU51Z_g0nHQjW0u1tyt_tUwpLcbg6H9nHaPWPvUOj3dG5QTVYNlEvX5R5AUe70n--KeYCM49Dj4cfiQmvO_4JWYUmwW-D6gyboC77695wP9vHy30POhPeg9k2_2ALIINXZMMrHHMSumTzHnPrQCrLNhUutS4hAWkQb3hjrLg0lk6d15ALOViNHVOQMpOUWOZL-EMYR404soIJdOZyRIjnDHAEwGU2dSKc9SMApitqgIXs-3dL_6evkSHUcYVo-0KNdbFBq7Rgf1aLz6Lm1Ir3_vokNg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEG0QTfSkBozf9uDRhd1u222PBCEQkJCIhhuh7VQ3Udas4O-33UWIiRdvTdO06UzSN9OZeYPQrWEQMUHmAZNKOQfF2kBoTgNJhJCJ4omlumg2kYxGYjqV4wq629TCAECRfAYNPyxi-SbTK_9V1hTc4SdnO2iXUUrCslqrpBIisYxks__Yn7R8vpZorNf-appSYEb38H-nHaH6tvgOjzewcowqsKihdifPsxyPt2n--IdOBGcWOysODwLlXnj87GuKVYrvnV_pN8Ctt5csT5ev73X01O1M2r1g3f8gSB2KLgMKWplYJ4kNqbGWaQ5aaNBRYiJlwtj5GsQqZkjsjDpN5sZy8GQuShJjOETxCaousgWcIsycTkwRo4wlVTRU3CgFLORAYh1pfoZqXgCzj5LiYra--_nf0zdovzd5GM6G_dHgAh14eZf5bZeousxXcIX29Ncy_cyvCw19A7QilB8 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2018+International+Symposium+on+Information+Theory+and+Its+Applications+%28ISITA%29&rft.atitle=Error+Performance+Analysis+of+the+K-best+Viterbi+Decoding+Algorithm&rft.au=Yoshikawa%2C+Hideki&rft.date=2018-10-01&rft.pub=IEICE&rft.spage=257&rft.epage=260&rft_id=info:doi/10.23919%2FISITA.2018.8664365&rft.externalDocID=8664365 |