Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Correction
The coding technique that combines channel estimation and error correction has received attention recently, and has been regarded as a promising approach to counter the effects of multipath fading. It has been shown by simulation that a proper code design that jointly considers channel estimation ca...
Saved in:
Published in | IEEE transactions on information theory Vol. 55; no. 9; pp. 4191 - 4203 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.09.2009
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
ISSN | 0018-9448 1557-9654 |
DOI | 10.1109/TIT.2009.2025548 |
Cover
Abstract | The coding technique that combines channel estimation and error correction has received attention recently, and has been regarded as a promising approach to counter the effects of multipath fading. It has been shown by simulation that a proper code design that jointly considers channel estimation can improve the system performance subject to a fixed code rate as compared to a conventional system which performs channel estimation and error correction separately. Nevertheless, the major obstacle that prevents the practice of such coding technique is that the existing codes are mostly searched by computers, and subsequently exhibit no apparent structure for efficient decoding. Hence, the operation-intensive exhaustive search becomes the only decoding option, and the decoding complexity increases dramatically with codeword length. In this paper, a systematic construction is derived for a class of structured codes that support joint channel estimation and error correction. It is confirmed by simulation that these codes have comparable performance to the best simulated-annealing-based computer-searched codes. Moreover, the systematically constructed codes can now be maximum-likelihoodly decoded with respect to the unknown-channel criterion in terms of a newly derived recursive metric for use by the priority-first search decoding algorithm. Thus, the decoding complexity is significantly reduced as compared with that of an exhaustive decoder. |
---|---|
AbstractList | The coding technique that combines channel estimation and error correction has received attention recently, and has been regarded as a promising approach to counter the effects of multipath fading. It has been shown by simulation that a proper code design that jointly considers channel estimation can improve the system performance subject to a fixed code rate as compared to a conventional system which performs channel estimation and error correction separately. Nevertheless, the major obstacle that prevents the practice of such coding technique is that the existing codes are mostly searched by computers, and subsequently exhibit no apparent structure for efficient decoding. Hence, the operation-intensive exhaustive search becomes the only decoding option, and the decoding complexity increases dramatically with codeword length. In this paper, a systematic construction is derived for a class of structured codes that support joint channel estimation and error correction. It is confirmed by simulation that these codes have comparable performance to the best simulated-annealing-based computer-searched codes. Moreover, the systematically constructed codes can now be maximum-likelihoodly decoded with respect to the unknown-channel criterion in terms of a newly derived recursive metric for use by the priority-first search decoding algorithm. Thus, the decoding complexity is significantly reduced as compared with that of an exhaustive decoder. [PUBLICATION ABSTRACT] The coding technique that combines channel estimation and error correction has received attention recently, and has been regarded as a promising approach to counter the effects of multipath fading. It has been shown by simulation that a proper code design that jointly considers channel estimation can improve the system performance subject to a fixed code rate as compared to a conventional system which performs channel estimation and error correction separately. Nevertheless, the major obstacle that prevents the practice of such coding technique is that the existing codes are mostly searched by computers, and subsequently exhibit no apparent structure for efficient decoding. Hence, the operation-intensive exhaustive search becomes the only decoding option, and the decoding complexity increases dramatically with codeword length. In this paper, a systematic construction is derived for a class of structured codes that support joint channel estimation and error correction. It is confirmed by simulation that these codes have comparable performance to the best simulated-annealing-based computer-searched codes. Moreover, the systematically constructed codes can now be maximum-likelihoodly decoded with respect to the unknown-channel criterion in terms of a newly derived recursive metric for use by the priority-first search decoding algorithm. Thus, the decoding complexity is significantly reduced as compared with that of an exhaustive decoder. |
Author | Han, Y.S. Po-Ning Chen Chia-Lung Wu Ming-Hsin Kuo |
Author_xml | – sequence: 1 surname: Chia-Lung Wu fullname: Chia-Lung Wu organization: Dept. of Commun. Eng., Nat. Chiao-Tung Universtiy, Taiwan – sequence: 2 surname: Po-Ning Chen fullname: Po-Ning Chen organization: Dept. of Commun. Eng., Nat. Chiao-Tung Universtiy, Taiwan – sequence: 3 givenname: Y.S. surname: Han fullname: Han, Y.S. – sequence: 4 surname: Ming-Hsin Kuo fullname: Ming-Hsin Kuo |
BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21960544$$DView record in Pascal Francis |
BookMark | eNp9kc1vEzEQxS3USqQt90pcLCTgtMWfG_uIQgqVgkAiPVuOPVZcdu1ib6T2v8dpAoceerE91u_NaN47QycpJ0DokpIrSon-tL5ZXzFCdDuYlEK9QjMq5bzTvRQnaEYIVZ0WQr1GZ7XetVJIymZo_G4f4rgbu1X8DUPc5uzxzxJzidNjdx1LnfAvsMVt8Rdw2dvNAHiRPVQccmmvcRMTeLzY2pRgwMs6xdFOMSdsk8fLUp6oUsDtPy_QabBDhTfH-xzdXi_Xi2_d6sfXm8XnVee44lO3YVrMJZXcywCEByJBWe7knDirlLLgiGDMMq-dCiAkaA-BeiWsbrQK_Bx9PPS9L_nPDupkxlgdDINNkHfVqF4rIXouGvnhRZJLQqmStIHvnoF3eVdS28JQLTXnYk4a9P4I2ersEIpNLlZzX5op5dEwqnsixX5qf-BcybUWCMbF6cm2qdg4GErMPlTTQjX7UM0x1CYkz4T_er8geXuQRAD4j0tGlGwO_AUayK5_ |
CODEN | IETTAW |
CitedBy_id | crossref_primary_10_1109_TSP_2012_2184098 |
Cites_doi | 10.1109/26.662635 10.1109/18.850681 10.1109/18.923754 10.1109/18.995646 10.1109/4234.673660 10.1109/TWC.2003.814338 10.1109/TVT.2002.800638 10.1109/TCOMM.2005.852847 10.1109/TIT.2007.892779 10.1109/TCOMM.1994.580208 10.1109/26.508303 10.1049/ip-f-2.1991.0048 |
ContentType | Journal Article |
Copyright | 2009 INIST-CNRS Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2009 |
Copyright_xml | – notice: 2009 INIST-CNRS – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2009 |
DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
DOI | 10.1109/TIT.2009.2025548 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
DatabaseTitleList | Technology Research Database Technology Research Database Technology Research Database |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science Applied Sciences |
EISSN | 1557-9654 |
EndPage | 4203 |
ExternalDocumentID | 1844684691 21960544 10_1109_TIT_2009_2025548 5208546 |
Genre | orig-research Feature |
GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYOK AAYXX CITATION RIG IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
ID | FETCH-LOGICAL-c383t-b29475153d5fe03f05e8a3c570ca888aec0422a2d9c8fe45e9def1d84a903f8f3 |
IEDL.DBID | RIE |
ISSN | 0018-9448 |
IngestDate | Sat Sep 27 17:43:57 EDT 2025 Sun Sep 28 04:18:22 EDT 2025 Mon Jun 30 05:35:53 EDT 2025 Mon Jul 21 09:14:23 EDT 2025 Thu Apr 24 22:54:17 EDT 2025 Tue Jul 01 02:34:24 EDT 2025 Tue Aug 26 16:47:33 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 9 |
Keywords | Fading channels Performance evaluation Estimation error Parameter estimation Channel coding Sequential decoding Multipath channels Search algorithm Maximum likelihood decoding Selective fading Frequency selection Simulation frequency-selective fading Channel estimation Algorithm complexity Simulated annealing Recursive method Metric Error correction Maximum likelihood Computer codes |
Language | English |
License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c383t-b29475153d5fe03f05e8a3c570ca888aec0422a2d9c8fe45e9def1d84a903f8f3 |
Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
PQID | 195933470 |
PQPubID | 23500 |
PageCount | 13 |
ParticipantIDs | proquest_miscellaneous_869844634 ieee_primary_5208546 crossref_citationtrail_10_1109_TIT_2009_2025548 crossref_primary_10_1109_TIT_2009_2025548 proquest_miscellaneous_35011851 proquest_journals_195933470 pascalfrancis_primary_21960544 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2009-09-01 |
PublicationDateYYYYMMDD | 2009-09-01 |
PublicationDate_xml | – month: 09 year: 2009 text: 2009-09-01 day: 01 |
PublicationDecade | 2000 |
PublicationPlace | New York, NY |
PublicationPlace_xml | – name: New York, NY – name: New York |
PublicationTitle | IEEE transactions on information theory |
PublicationTitleAbbrev | TIT |
PublicationYear | 2009 |
Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
References | ref13 ref15 ref14 han (ref7) 2002 ref11 ref10 cormen (ref2) 2001 ref1 ref17 ref16 (ref18) 2008 ref3 ref6 crozier (ref4) 1991; 138 ref5 harville (ref8) 2000 pearl (ref12) 1984 lin (ref9) 2004 |
References_xml | – ident: ref10 doi: 10.1109/26.662635 – ident: ref11 doi: 10.1109/18.850681 – ident: ref5 doi: 10.1109/18.923754 – year: 2002 ident: ref7 publication-title: Wiley Encyclopedia of Telecommunications – ident: ref14 doi: 10.1109/18.995646 – ident: ref15 doi: 10.1109/4234.673660 – ident: ref16 doi: 10.1109/TWC.2003.814338 – ident: ref17 doi: 10.1109/TVT.2002.800638 – year: 2004 ident: ref9 publication-title: Error Control Coding – ident: ref3 doi: 10.1109/TCOMM.2005.852847 – ident: ref6 doi: 10.1109/TIT.2007.892779 – year: 2001 ident: ref2 publication-title: Introduction to Algorithms – ident: ref13 doi: 10.1109/TCOMM.1994.580208 – year: 2000 ident: ref8 publication-title: Matrix Algebra from a Statistician's Perspective – year: 2008 ident: ref18 publication-title: Draft Standard for Local and Metropolitan Area Networks Part 16 Air Interface for Broadcast Wireless Access Systems – ident: ref1 doi: 10.1109/26.508303 – year: 1984 ident: ref12 publication-title: Heuristics Intelligent Search Strategies for Computer Problem Solving – volume: 138 start-page: 371 year: 1991 ident: ref4 article-title: least sum of squared errors (lsse) channel estimation publication-title: Radar and Signal Processing IEE Proceedings F doi: 10.1049/ip-f-2.1991.0048 |
SSID | ssj0014512 |
Score | 1.9509524 |
Snippet | The coding technique that combines channel estimation and error correction has received attention recently, and has been regarded as a promising approach to... |
SourceID | proquest pascalfrancis crossref ieee |
SourceType | Aggregation Database Index Database Enrichment Source Publisher |
StartPage | 4191 |
SubjectTerms | Algorithms Applied sciences Channel coding Channel estimation Channels Codes Coding Coding, codes Complexity Computational modeling Computer simulation Construction Counting circuits Decoding Detection, estimation, filtering, equalization, prediction Error correction Error correction codes Estimating techniques Exact sciences and technology Fading fading channels frequency-selective fading Information theory Information, signal and communications theory Maximum likelihood decoding Maximum likelihood estimation Maximum likelihood method MIMO multipath channels Searching sequential decoding Signal and communications theory Signal, noise Simulation System performance Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) |
Title | Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Correction |
URI | https://ieeexplore.ieee.org/document/5208546 https://www.proquest.com/docview/195933470 https://www.proquest.com/docview/35011851 https://www.proquest.com/docview/869844634 |
Volume | 55 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Nb5wwEB0lObWHpk1alaZNfeilUtll1zbgY5XuKq26VQ8bKTdk40FC2YWIXaQqvz5jDCj9VG9IDBIwHjOPmXkP4J2RPDFcm1CijUORFzY0QsqQa8zjRMQ6Me5_x-pbfHklvlzL6wP4MM7CIGLXfIYTd9jV8m2dt-5X2VQ6QUkRH8IhLTM_qzVWDISceWbwGQUwYY6hJBmp6frz2hNTzl0C7ZR-HnyCOk0V1xGpd_RSCq9m8dvG3H1tlsewGu7TN5ncTNq9meR3v1A4_u-DPIUnfdrJPvp18gwOsDqB40HSgfURfgKPH_ATnsJ2pX-U23Ybfi1vcFM6BmT2vSlrJ3gXLktKHJlvV2afCMVaN4XFLmqLO0apMB1tCXajZW6CocINW9B24iclma4sWzRNZ9V0m25dPYer5WJ9cRn2-gxhTrh2H5q5EgnlQ9zKAiNeRBJTzXOZRLkmYE3edgRjem5VnhYoJCqLxcymQiuyTgv-Ao6qusKXwHiH_NAaZQnfWKVzN1Ar58ZibDWqAKaDy7K8Jy93GhqbrAMxkcrIyU5SU2W9kwN4P15x64k7_mF76nw02vXuCeD8p1UxnqddnlCgEAGcDcsk60N_lzm2Hs5FEgXwdjxLMesKMbrCut1lrphLedIsAPYXizRWKQF1Ll79-dbO4JEva7lmt9dwtG9afEPZ0d6cd2FxD03nDaQ |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Nb9NAEB2VcgAOFFoqTKHdAxcknDjZXdt7RCVRCknFIZV6s9besWQ1sZETS4hfz6zXtsqnuFnaseRkdtbzPDPvAbxNJY9SrlNfogl9keXGT4WUPteYhZEIdZTa7x2r63BxIz7dytsDeD_MwiBi23yGI3vZ1vJNlTX2U9lYWkFJET6Ah5JQReymtYaagZATxw0-oRCm9b4oGajx-mrtqCmnNoW2Wj_3XkKtqortidQ7-ltyp2fx29Hcvm_mR7Dqn9S1mdyNmn06yr7_QuL4vz_lGTztEk_2we2U53CA5TEc9aIOrIvxY3hyj6HwBLYr_a3YNlt_WdzhprAcyOxLXVRW8s6fF5Q6MtewzD4SjjV2DotdVgZ3jJJhutoS8EbD7AxDiRs2owPFzUoyXRo2q-vWqm6P3ap8ATfz2fpy4XcKDX5GyHbvp1MlIsqIuJE5BjwPJMaaZzIKMk3QmvxtKcb01KgszlFIVAbziYmFVmQd5_wUDsuqxJfAeIv90KTKEMIxSmd2pFZOU4Oh0ag8GPcuS7KOvtyqaGySFsYEKiEnW1FNlXRO9uDdcMdXR93xD9sT66PBrnOPB-c_7Yphnc55woFCeHDWb5OkC_5dYvl6OBdR4MHFsEpRa0sxusSq2SW2nEuZ0sQD9heLOFQxQXUuXv350S7g0WK9WibLq-vPZ_DYFbls69trONzXDb6hXGmfnrch8gOZBxD3 |
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=Maximum-Likelihood+Priority-First+Search+Decodable+Codes+for+Combined+Channel+Estimation+and+Error+Correction&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Wu%2C+Chia-Lung&rft.au=Chen%2C+Po-Ning&rft.au=Han%2C+Y+S&rft.au=Kuo%2C+Ming-Hsin&rft.date=2009-09-01&rft.issn=0018-9448&rft.volume=55&rft.issue=9&rft_id=info:doi/10.1109%2FTIT.2009.2025548&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |