Bidirectional Viterbi decoding algorithm for OvTDM
Overlapped time domain multiplexing (OvTDM) is an innovative encoding scheme that can obtain high spectral efficiency. However, the intentional inter-symbol interference (ISI) caused by OvTDM will make the decoding process more complex. The computational complexity of maximum likelihood sequence det...
Uloženo v:
| Vydáno v: | China communications Ročník 17; číslo 7; s. 183 - 192 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
China Institute of Communications
01.07.2020
Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| Témata: | |
| ISSN: | 1673-5447 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Overlapped time domain multiplexing (OvTDM) is an innovative encoding scheme that can obtain high spectral efficiency. However, the intentional inter-symbol interference (ISI) caused by OvTDM will make the decoding process more complex. The computational complexity of maximum likelihood sequence detection increases exponentially with the growth of spectral efficiency in OvTDM. As a consequence of high complexity, the decoding effort for a given spectral efficiency may occasionally exceed the physical limitations of the decoder, leading inevitably to buffer overflows and information erasures. In this paper, we propose a bidirectional Viterbi algorithm (BVA) based on the bidirectional sequence decoding for OvTDM. With the BVA, the decoding operation starts simultaneously from the both ends of the corresponding trellis and stops at the middle of trellis. The simulation results show that compared with Viterbi algorithm (VA), the decoding time of BVA can be reduced by about half. And the memory space of two decoders in BVA are about half of that in VA, which means that the BVA has lower memory requirements for decoder. And the decoding performance of BVA is almost the same as VA. |
|---|---|
| AbstractList | Overlapped time domain multi-plexing (OvTDM) is an innovative encoding scheme that can obtain high spectral efficien-cy. However, the intentional inter-symbol in-terference (ISI) caused by OvTDM will make the decoding process more complex. The computational complexity of maximum like-lihood sequence detection increases exponen-tially with the growth of spectral efficiency in OvTDM. As a consequence of high complex-ity, the decoding effort for a given spectral ef-ficiency may occasionally exceed the physical limitations of the decoder, leading inevitably to buffer overflows and information erasures. In this paper, we propose a bidirectional Viter-bi algorithm (BVA) based on the bidirectional sequence decoding for OvTDM. With the BVA, the decoding operation starts simultane-ously from the both ends of the corresponding trellis and stops at the middle of trellis. The simulation results show that compared with Viterbi algorithm (VA), the decoding time of BVA can be reduced by about half. And the memory space of two decoders in BVA are about half of that in VA, which means that the BVA has lower memory requirements for de-coder. And the decoding performance of BVA is almost the same as VA. Overlapped time domain multiplexing (OvTDM) is an innovative encoding scheme that can obtain high spectral efficiency. However, the intentional inter-symbol interference (ISI) caused by OvTDM will make the decoding process more complex. The computational complexity of maximum likelihood sequence detection increases exponentially with the growth of spectral efficiency in OvTDM. As a consequence of high complexity, the decoding effort for a given spectral efficiency may occasionally exceed the physical limitations of the decoder, leading inevitably to buffer overflows and information erasures. In this paper, we propose a bidirectional Viterbi algorithm (BVA) based on the bidirectional sequence decoding for OvTDM. With the BVA, the decoding operation starts simultaneously from the both ends of the corresponding trellis and stops at the middle of trellis. The simulation results show that compared with Viterbi algorithm (VA), the decoding time of BVA can be reduced by about half. And the memory space of two decoders in BVA are about half of that in VA, which means that the BVA has lower memory requirements for decoder. And the decoding performance of BVA is almost the same as VA. |
| Author | Wang, Haocheng Wang, Yafeng Hu, Yue |
| AuthorAffiliation | Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| AuthorAffiliation_xml | – name: Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| Author_xml | – sequence: 1 givenname: Haocheng surname: Wang fullname: Wang, Haocheng organization: Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China – sequence: 2 givenname: Yafeng surname: Wang fullname: Wang, Yafeng organization: Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China – sequence: 3 givenname: Yue surname: Hu fullname: Hu, Yue organization: Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| BookMark | eNo9kD1PwzAQhj0UiVL6AxBLFsaE80fseIRAgaqoS2G1HNsJrtoYOeHz15MSxC23PM_p3vcETdrQOoTOMGSESiwvl1lZZgQIZCAywHSCppgLmuaMiWM077otDFNwTjmZInLtrY_O9D60epc8-97FyifWmWB92yR614To-5d9UoeYrN83N4-n6KjWu87N__YMPS1uN-V9ulrfPZRXq9QQJvq0MLgwtZOslrnQIAthLJWOVJpyh43ljGMM1lYV4WCMsLowxg6QrqocrKQzdDHe_dBtrdtGbcNbHJ7s1HfTfx4SghjyDRweORND10VXq9fo9zp-KQzqtxO1VGWpDoYCoUbnfHS8c-6fl5gJzAj9Ad3ZYLI |
| CODEN | CCHOBE |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 97E RIA RIE AAYXX CITATION 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.23919/J.CC.2020.07.013 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Economics |
| EndPage | 192 |
| ExternalDocumentID | zgtx202007013 10_23919_J_CC_2020_07_013 9147142 |
| Genre | orig-research |
| GroupedDBID | -SI -SJ -S~ 0R~ 29B 4.4 5GY 6IK 92H 92I 97E AAHTB AAJGR AARMG AASAJ AAWTH ABAZT ABJNI ABPEJ ABQJQ ABVLG AENEX AGQYO AGSQL AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV AZLTO BEFXN BFFAM BGNUA BKEBE BPEOZ CAJEI CAJEJ EBS EJD HZ~ IFIPE IPLJI JAVBF M43 O9- OCL Q-- Q-9 RIA RIE RNS TCJ TGT U1G U5S U5T AAYXX CITATION 2B. 4A8 93N PSX RIG |
| ID | FETCH-LOGICAL-c247t-8c18cfe94f957a0987cd39e2ba36e1cd646110ddbb260cc7da8ccd7cdabb50d93 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000551546900014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1673-5447 |
| IngestDate | Thu May 29 03:54:25 EDT 2025 Sat Nov 29 04:28:52 EST 2025 Wed Aug 27 02:17:10 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Keywords | Viterbi algorithm (VA) overlapped time domain multi-plexing (OvTDM) decoding performance bi-directional Viterbi algorithm (BVA) |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c247t-8c18cfe94f957a0987cd39e2ba36e1cd646110ddbb260cc7da8ccd7cdabb50d93 |
| PageCount | 10 |
| ParticipantIDs | wanfang_journals_zgtx202007013 crossref_primary_10_23919_J_CC_2020_07_013 ieee_primary_9147142 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-07-01 |
| PublicationDateYYYYMMDD | 2020-07-01 |
| PublicationDate_xml | – month: 07 year: 2020 text: 2020-07-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | China communications |
| PublicationTitleAbbrev | ChinaComm |
| PublicationTitle_FL | China Communications |
| PublicationYear | 2020 |
| Publisher | China Institute of Communications Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| Publisher_xml | – name: China Institute of Communications – name: Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| SSID | ssj0000866362 |
| Score | 2.1554375 |
| Snippet | Overlapped time domain multiplexing (OvTDM) is an innovative encoding scheme that can obtain high spectral efficiency. However, the intentional inter-symbol... Overlapped time domain multi-plexing (OvTDM) is an innovative encoding scheme that can obtain high spectral efficien-cy. However, the intentional inter-symbol... |
| SourceID | wanfang crossref ieee |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 183 |
| SubjectTerms | bidirectional Viterbi algorithm (BVA) Convolutional codes decoding performance Encoding Maximum likelihood decoding Multiplexing overlapped time domain multiplexing (OvTDM) Spectral efficiency Viterbi algorithm Viterbi algorithm (VA) |
| Title | Bidirectional Viterbi decoding algorithm for OvTDM |
| URI | https://ieeexplore.ieee.org/document/9147142 https://d.wanfangdata.com.cn/periodical/zgtx202007013 |
| Volume | 17 |
| WOSCitedRecordID | wos000551546900014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) issn: 1673-5447 databaseCode: RIE dateStart: 20130101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0000866362 providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LS8MwGA9zCHrxNcX5GD14Eru1Tdo0R60OGTo9zLFbyHMOtJOtG-Jfb5J2Q8GLtx7yQfml_d6_7wPggkWRwhpyH2mJfKMluc8kFr4dFIM1x4i7nZHDB9zvp6MRea6BqzUXRinlms9U2z66Wr6cioVNlXVIaFQpMgp3A-Ok5Gqt8ynGNU-g2x8aJtjW-xEui5gRJCHp9NpZZqLBKHCjOkP4ywy5vSqOtZNrlo9_GJju7v9ebQ_sVI6kd13e_D6oqfwAbK14xvMGiG4mpb1yyT5vaLnGfOJJE29ae-Wxt_F0Nile3z3jt3pPy8Ht4yF46d4Nsnu_2pDgiwjhwk9FmAqtCNIkxiwgKRYSEhVxBhMVCpmgxJh3KTk3YYsQWLJUCHMVknEeB5LAI1DPp7k6Bp7tRo5lbKezY6Q5JEgwhmKRGAEe66AJLleA0Y9yEAY1AYRDl_ZollGLLg0wNeg2QcNCtD5YodMErQpiWv0pc_o1Lj6tpFE9ITz5W-4UbNsjZZfsGagXs4U6B5tiWUzms5b7Dr4BkNKv2Q |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05T8MwFH6qAAkWbkQ5SgYmREoSO3E8QgBxlMJQUDfLV0olSFGbIsSvx3ZCBRILWwY_KfqcvPt7D-CQR5EmORI-zhX2jZYUPldE-nZQDMkFwcLtjHzqkG437ffpQwOOZ1wYrbVrPtNt--hq-WokpzZVdkJDo0qxUbjzMcZRULG1ZhkV45wnyG0QDRNiK_6YVGXMCNGQnty0s8zEg1HghnWG6JchcptVHG-nyHkx-GFiLlf-93KrsFy7kt5pdfdr0NDFOix-M40nGxCdDSuL5dJ93pNlG4uhp0zEaS2Wx18Go_GwfH71jOfq3b_3zu824fHyopdd-fWOBF9GmJR-KsNU5prinMaEBzQlUiGqI8FRokOpEpwYA6-UECZwkZIonkppLkNxIeJAUbQFc8Wo0Nvg2X7kWMV2PjvBuUAUS85xLBMjIOI8aMLRN2DsrRqFwUwI4dBlNyzLmEWXBYQZdJuwYSGaHazRaUKrhpjV_8qEfQ7KDytplE-Idv6WO4DFq95dh3Wuu7e7sGSPVz2zezBXjqd6HxbkezmcjFvum_gC5w-zIA |
| 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%3Ajournal&rft.genre=article&rft.atitle=Bidirectional+Viterbi+decoding+algorithm+for+OvTDM&rft.jtitle=China+communications&rft.au=Wang%2C+Haocheng&rft.au=Wang%2C+Yafeng&rft.au=Hu%2C+Yue&rft.date=2020-07-01&rft.issn=1673-5447&rft.volume=17&rft.issue=7&rft.spage=183&rft.epage=192&rft_id=info:doi/10.23919%2FJ.CC.2020.07.013&rft.externalDBID=n%2Fa&rft.externalDocID=10_23919_J_CC_2020_07_013 |
| thumbnail_s | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fzgtx%2Fzgtx.jpg |