Low Complexity SOVA for Turbo Codes

Recently, trimming Soft-output Viterbi algorithm（T-SOVA） has been proposed to reduce the complexity of SOVA for Turbo codes. In its fi rst stage, a dynamic algorithm, lazy Viterbi algorithm, is used to indicate the minimal metric differences which brings obstacle on hardware implementation. This pap...

Full description

Saved in:
Bibliographic Details
Published in:China communications 2017-08, Vol.14 (8), p.33-40
Main Authors: Pei, Ruilin, Wang, Zulin, Huang, Qin, Wang, Jiaqing
Format: Article
Language:English
Subjects:
Complexity theory
Hardware
hardware implementation
local sorting
Measurement
Simulation
Sorting
SOVA
Turbo codes
Turbo码
Viterbi algorithm
仿真结果
动态算法
复杂度分析
最大似然
硬件实现
译码复杂度
软输出维特比算法
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c318t-62e81b7dfc0ab8c44559bd3b30e71d66eb51518d19c1839f0d75458450a2fff23
cites
container_end_page 40
container_issue 8
container_start_page 33
container_title China communications
container_volume 14
creator Pei, Ruilin
Wang, Zulin
Huang, Qin
Wang, Jiaqing
description Recently, trimming Soft-output Viterbi algorithm（T-SOVA） has been proposed to reduce the complexity of SOVA for Turbo codes. In its fi rst stage, a dynamic algorithm, lazy Viterbi algorithm, is used to indicate the minimal metric differences which brings obstacle on hardware implementation. This paper proposes a Viterbi algorithm（VA） based T-SOVA to facilitate hardware implementation. In the first stage of our scheme, a modified VA with regular structure is used to fi nd the maximum likelihood（ML） path and calculate the metric differences. Further, local sorting is introduced to trim the metric differences, which reduces the complexity of trimming operation. Simulation results and complexity analysis show that VA based T-SOVA performs as well as lazy VA based T-SOVA and is easier to be applied to hardware implementation.
doi_str_mv 10.1109/CC.2017.8014345
format article
fullrecord <record><control><sourceid>wanfang_jour_cross</sourceid><recordid>TN_cdi_wanfang_journals_zgtx201708005</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>672886283</cqvip_id><ieee_id>8014345</ieee_id><wanfj_id>zgtx201708005</wanfj_id><sourcerecordid>zgtx201708005</sourcerecordid><originalsourceid>FETCH-LOGICAL-c318t-62e81b7dfc0ab8c44559bd3b30e71d66eb51518d19c1839f0d75458450a2fff23</originalsourceid><addsrcrecordid>eNpFkL1PAkEQxbfQRILUFjYXjeXBzH5fSTZ-JSQUou3mPnbxCNziHgTwr_cIqNNMMb_3XuYRcoMwRIRsZMyQAqqhBuSMiwvSQ6lYKjhXV2TQtgvoRkvJJO2R-0nYJSas1ku3rzeH5G36MU58iMlsG4vQXSrXXpNLny9bNzjvPnl_epyZl3QyfX4140laMtSbVFKnsVCVLyEvdMm5EFlRsYKBU1hJ6QqBAnWFWYmaZR4qJbjQXEBOvfeU9cnDyXeXNz5v5nYRtrHpEu33fLM__gQaQHTc6MSVMbRtdN6uY73K48Ei2GMF1hh7xO25gk5xe1LUzrk_-v96d_b7DM38q-6SfxGpqNaSasZ-AKKCYVg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Low Complexity SOVA for Turbo Codes</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Pei, Ruilin ; Wang, Zulin ; Huang, Qin ; Wang, Jiaqing</creator><creatorcontrib>Pei, Ruilin ; Wang, Zulin ; Huang, Qin ; Wang, Jiaqing</creatorcontrib><description>Recently, trimming Soft-output Viterbi algorithm（T-SOVA） has been proposed to reduce the complexity of SOVA for Turbo codes. In its fi rst stage, a dynamic algorithm, lazy Viterbi algorithm, is used to indicate the minimal metric differences which brings obstacle on hardware implementation. This paper proposes a Viterbi algorithm（VA） based T-SOVA to facilitate hardware implementation. In the first stage of our scheme, a modified VA with regular structure is used to fi nd the maximum likelihood（ML） path and calculate the metric differences. Further, local sorting is introduced to trim the metric differences, which reduces the complexity of trimming operation. Simulation results and complexity analysis show that VA based T-SOVA performs as well as lazy VA based T-SOVA and is easier to be applied to hardware implementation.</description><identifier>ISSN: 1673-5447</identifier><identifier>DOI: 10.1109/CC.2017.8014345</identifier><identifier>CODEN: CCHOBE</identifier><language>eng</language><publisher>China Institute of Communications</publisher><subject>Complexity theory ; Hardware ; hardware implementation ; local sorting ; Measurement ; Simulation ; Sorting ; SOVA ; Turbo codes ; Turbo码 ; Viterbi algorithm ; 仿真结果 ; 动态算法 ; 复杂度分析 ; 最大似然 ; 硬件实现 ; 译码复杂度 ; 软输出维特比算法</subject><ispartof>China communications, 2017-08, Vol.14 (8), p.33-40</ispartof><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c318t-62e81b7dfc0ab8c44559bd3b30e71d66eb51518d19c1839f0d75458450a2fff23</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/89450X/89450X.jpg</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8014345$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,54771</link.rule.ids></links><search><creatorcontrib>Pei, Ruilin</creatorcontrib><creatorcontrib>Wang, Zulin</creatorcontrib><creatorcontrib>Huang, Qin</creatorcontrib><creatorcontrib>Wang, Jiaqing</creatorcontrib><title>Low Complexity SOVA for Turbo Codes</title><title>China communications</title><addtitle>ChinaComm</addtitle><addtitle>China Communications</addtitle><description>Recently, trimming Soft-output Viterbi algorithm（T-SOVA） has been proposed to reduce the complexity of SOVA for Turbo codes. In its fi rst stage, a dynamic algorithm, lazy Viterbi algorithm, is used to indicate the minimal metric differences which brings obstacle on hardware implementation. This paper proposes a Viterbi algorithm（VA） based T-SOVA to facilitate hardware implementation. In the first stage of our scheme, a modified VA with regular structure is used to fi nd the maximum likelihood（ML） path and calculate the metric differences. Further, local sorting is introduced to trim the metric differences, which reduces the complexity of trimming operation. Simulation results and complexity analysis show that VA based T-SOVA performs as well as lazy VA based T-SOVA and is easier to be applied to hardware implementation.</description><subject>Complexity theory</subject><subject>Hardware</subject><subject>hardware implementation</subject><subject>local sorting</subject><subject>Measurement</subject><subject>Simulation</subject><subject>Sorting</subject><subject>SOVA</subject><subject>Turbo codes</subject><subject>Turbo码</subject><subject>Viterbi algorithm</subject><subject>仿真结果</subject><subject>动态算法</subject><subject>复杂度分析</subject><subject>最大似然</subject><subject>硬件实现</subject><subject>译码复杂度</subject><subject>软输出维特比算法</subject><issn>1673-5447</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNpFkL1PAkEQxbfQRILUFjYXjeXBzH5fSTZ-JSQUou3mPnbxCNziHgTwr_cIqNNMMb_3XuYRcoMwRIRsZMyQAqqhBuSMiwvSQ6lYKjhXV2TQtgvoRkvJJO2R-0nYJSas1ku3rzeH5G36MU58iMlsG4vQXSrXXpNLny9bNzjvPnl_epyZl3QyfX4140laMtSbVFKnsVCVLyEvdMm5EFlRsYKBU1hJ6QqBAnWFWYmaZR4qJbjQXEBOvfeU9cnDyXeXNz5v5nYRtrHpEu33fLM__gQaQHTc6MSVMbRtdN6uY73K48Ei2GMF1hh7xO25gk5xe1LUzrk_-v96d_b7DM38q-6SfxGpqNaSasZ-AKKCYVg</recordid><startdate>20170801</startdate><enddate>20170801</enddate><creator>Pei, Ruilin</creator><creator>Wang, Zulin</creator><creator>Huang, Qin</creator><creator>Wang, Jiaqing</creator><general>China Institute of Communications</general><general>Collaborative Innovation Center of Geospatial Technology, Wuhan, 430079, China%State Key Laboratory of Wireless Mobile Communications(CATT), Beijing, 100191, China</general><general>School of Electronic and Information Engineering, Beihang University, Beijing, 100191, China%School of Electronic and Information Engineering, Beihang University, Beijing, 100191, China</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>20170801</creationdate><title>Low Complexity SOVA for Turbo Codes</title><author>Pei, Ruilin ; Wang, Zulin ; Huang, Qin ; Wang, Jiaqing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c318t-62e81b7dfc0ab8c44559bd3b30e71d66eb51518d19c1839f0d75458450a2fff23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Complexity theory</topic><topic>Hardware</topic><topic>hardware implementation</topic><topic>local sorting</topic><topic>Measurement</topic><topic>Simulation</topic><topic>Sorting</topic><topic>SOVA</topic><topic>Turbo codes</topic><topic>Turbo码</topic><topic>Viterbi algorithm</topic><topic>仿真结果</topic><topic>动态算法</topic><topic>复杂度分析</topic><topic>最大似然</topic><topic>硬件实现</topic><topic>译码复杂度</topic><topic>软输出维特比算法</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pei, Ruilin</creatorcontrib><creatorcontrib>Wang, Zulin</creatorcontrib><creatorcontrib>Huang, Qin</creatorcontrib><creatorcontrib>Wang, Jiaqing</creatorcontrib><collection>维普_期刊</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>China communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pei, Ruilin</au><au>Wang, Zulin</au><au>Huang, Qin</au><au>Wang, Jiaqing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Low Complexity SOVA for Turbo Codes</atitle><jtitle>China communications</jtitle><stitle>ChinaComm</stitle><addtitle>China Communications</addtitle><date>2017-08-01</date><risdate>2017</risdate><volume>14</volume><issue>8</issue><spage>33</spage><epage>40</epage><pages>33-40</pages><issn>1673-5447</issn><coden>CCHOBE</coden><abstract>Recently, trimming Soft-output Viterbi algorithm（T-SOVA） has been proposed to reduce the complexity of SOVA for Turbo codes. In its fi rst stage, a dynamic algorithm, lazy Viterbi algorithm, is used to indicate the minimal metric differences which brings obstacle on hardware implementation. This paper proposes a Viterbi algorithm（VA） based T-SOVA to facilitate hardware implementation. In the first stage of our scheme, a modified VA with regular structure is used to fi nd the maximum likelihood（ML） path and calculate the metric differences. Further, local sorting is introduced to trim the metric differences, which reduces the complexity of trimming operation. Simulation results and complexity analysis show that VA based T-SOVA performs as well as lazy VA based T-SOVA and is easier to be applied to hardware implementation.</abstract><pub>China Institute of Communications</pub><doi>10.1109/CC.2017.8014345</doi><tpages>8</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1673-5447
ispartof China communications, 2017-08, Vol.14 (8), p.33-40
issn 1673-5447
language eng
recordid cdi_wanfang_journals_zgtx201708005
source IEEE Electronic Library (IEL) Journals
subjects Complexity theory
Hardware
hardware implementation
local sorting
Measurement
Simulation
Sorting
SOVA
Turbo codes
Turbo码
Viterbi algorithm
仿真结果
动态算法
复杂度分析
最大似然
硬件实现
译码复杂度
软输出维特比算法
title Low Complexity SOVA for Turbo Codes
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T16%3A38%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Low%20Complexity%20SOVA%20for%20Turbo%20Codes&rft.jtitle=China%20communications&rft.au=Pei,%20Ruilin&rft.date=2017-08-01&rft.volume=14&rft.issue=8&rft.spage=33&rft.epage=40&rft.pages=33-40&rft.issn=1673-5447&rft.coden=CCHOBE&rft_id=info:doi/10.1109/CC.2017.8014345&rft_dat=%3Cwanfang_jour_cross%3Ezgtx201708005%3C/wanfang_jour_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c318t-62e81b7dfc0ab8c44559bd3b30e71d66eb51518d19c1839f0d75458450a2fff23%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_cqvip_id=672886283&rft_ieee_id=8014345&rft_wanfj_id=zgtx201708005&rfr_iscdi=true