Simulation-Based Computation of Information Rates for Channels With Memory
The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a forward sum-product recursion on the joint source/channel trellis. This method is extended to compute upp...
Saved in:
| Published in | IEEE transactions on information theory Vol. 52; no. 8; pp. 3498 - 3508 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
IEEE
01.08.2006
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.2006.878110 |
Cover
| Abstract | The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a forward sum-product recursion on the joint source/channel trellis. This method is extended to compute upper and lower bounds on the information rate of very general channels with memory by means of finite-state approximations. Further upper and lower bounds can be computed by reduced-state methods |
|---|---|
| AbstractList | The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a forward sum-product recursion on the joint source/channel trellis. This method is extended to compute upper and lower bounds on the information rate of very general channels with memory by means of finite-state approximations. Further upper and lower bounds can be computed by reduced-state methods. [PUBLICATION ABSTRACT] The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a forward sum-product recursion on the joint source/channel trellis. This method is extended to compute upper and lower bounds on the information rate of very general channels with memory by means of finite-state approximations. Further upper and lower bounds can be computed by reduced-state methods |
| Author | Loeliger, H.-A. Arnold, D.M. Kavcic, A. Wei Zeng Vontobel, P.O. |
| Author_xml | – sequence: 1 givenname: D.M. surname: Arnold fullname: Arnold, D.M. organization: Dept. of Inf. Technol. & Electr. Eng., Eidgenossische Tech. Hochschule, Zurich – sequence: 2 givenname: H.-A. surname: Loeliger fullname: Loeliger, H.-A. – sequence: 3 givenname: P.O. surname: Vontobel fullname: Vontobel, P.O. – sequence: 4 givenname: A. surname: Kavcic fullname: Kavcic, A. – sequence: 5 surname: Wei Zeng fullname: Wei Zeng |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17973809$$DView record in Pascal Francis |
| BookMark | eNp1kc1LxDAQxYMouH6cPXgpguCla6ZpmuSoix8rK4KueAzZNMFIm6xJe_C_t9pFQfA0vOH3HsO8PbTtgzcIHQGeAmBxvpwvpwXG1ZQzPiy20AQoZbmoaLmNJhgDz0VZ8l20l9LbIEsKxQTdPbm2b1Tngs8vVTJ1Ngvtuu--N1mw2dzbENtRPqrOpGzQ2exVeW-alL247jW7N22IHwdox6ommcPN3EfP11fL2W2-eLiZzy4WuSYUulxxxgRVFJiylV4JVjIgAisqCCvqVUEqzbW2pK6ZwjUlTJvCak5rsNbYFSH76GzMXcfw3pvUydYlbZpGeRP6JKFiUAgQHA_oyR_0LfTRD9dJEFQALrEYoNMNpJJWjY3Ka5fkOrpWxQ8JTDDCvzk6cjqGlKKxUrvxT11UrpGA5VcRcihCfhUhxyIG3_kf30_0v47j0eGMMb90VQEnQD4BB1iUKQ |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1109_TCOMM_2011_030411_100546 crossref_primary_10_1109_JLT_2015_2438951 crossref_primary_10_1109_TIT_2011_2173707 crossref_primary_10_1109_TCOMM_2022_3204035 crossref_primary_10_1109_JLT_2019_2901908 crossref_primary_10_1109_TWC_2017_2691318 crossref_primary_10_1109_JLT_2018_2869109 crossref_primary_10_1109_JLT_2020_3029336 crossref_primary_10_1109_LCOMM_2019_2946236 crossref_primary_10_1109_LPT_2011_2164521 crossref_primary_10_1109_TIT_2008_917638 crossref_primary_10_1109_LCOMM_2017_2688451 crossref_primary_10_1587_transfun_2020EAP1004 crossref_primary_10_1109_TCOMM_2013_110813_130385 crossref_primary_10_1109_JLT_2015_2493202 crossref_primary_10_1186_s13638_020_01856_5 crossref_primary_10_1214_08_AAP570 crossref_primary_10_1109_JSAC_2016_2604058 crossref_primary_10_1109_TIT_2011_2173715 crossref_primary_10_1109_TCOMM_2010_04_080683 crossref_primary_10_1109_TIT_2012_2191682 crossref_primary_10_1364_OE_414885 crossref_primary_10_1109_LCOMM_2014_2325818 crossref_primary_10_1364_JOCN_4_001008 crossref_primary_10_1587_transcom_2019EBP3244 crossref_primary_10_1109_TCOMM_2018_2881091 crossref_primary_10_1109_TAES_2013_6621820 crossref_primary_10_1109_JLT_2015_2443876 crossref_primary_10_1186_s13638_018_1071_z crossref_primary_10_1109_TCOMM_2019_2937293 crossref_primary_10_1109_JLT_2023_3276300 crossref_primary_10_1109_TIT_2014_2328584 crossref_primary_10_1587_transfun_E101_A_2064 crossref_primary_10_1109_JLT_2017_2766978 crossref_primary_10_1109_TIT_2008_920243 crossref_primary_10_1109_TWC_2018_2865579 crossref_primary_10_1109_TBC_2015_2470395 crossref_primary_10_1109_TCOMM_2012_020912_110117 crossref_primary_10_1109_OJCOMS_2024_3373333 crossref_primary_10_1007_s11235_022_00949_4 crossref_primary_10_1109_JLT_2017_2671452 crossref_primary_10_1109_TCOMM_2009_10_080200 crossref_primary_10_1587_transfun_2021EAL2013 crossref_primary_10_1109_JLT_2008_917319 crossref_primary_10_1109_TCOMM_2015_2478819 crossref_primary_10_1109_JLT_2022_3172625 crossref_primary_10_1109_JPROC_2018_2848363 crossref_primary_10_1587_transfun_E101_A_2055 crossref_primary_10_1109_TCOMM_2010_093010_080482 crossref_primary_10_1109_TWC_2021_3129975 crossref_primary_10_1109_LSP_2017_2656385 crossref_primary_10_1364_JOCN_9_001074 crossref_primary_10_1109_ACCESS_2019_2892989 crossref_primary_10_1109_ACCESS_2023_3330965 crossref_primary_10_1109_JLT_2015_2409981 crossref_primary_10_1109_MSP_2018_2841410 crossref_primary_10_1109_TIT_2009_2021369 crossref_primary_10_1109_TCOMM_2011_120611_100435 crossref_primary_10_1109_TGCN_2020_2969786 crossref_primary_10_1109_TIT_2007_915709 crossref_primary_10_1121_10_0020272 crossref_primary_10_1109_TCOMM_2024_3454026 crossref_primary_10_1587_transfun_2020EAP1019 crossref_primary_10_1109_JLT_2017_2786351 crossref_primary_10_3390_e24040504 crossref_primary_10_1109_TIT_2007_892778 crossref_primary_10_1109_TCOMM_2023_3331538 crossref_primary_10_3390_s21165534 crossref_primary_10_1109_ACCESS_2019_2907326 crossref_primary_10_1109_TCOMM_2009_07_070638 crossref_primary_10_1109_JLT_2023_3325157 crossref_primary_10_1109_MSP_2008_926683 crossref_primary_10_1007_s11434_014_0595_9 crossref_primary_10_1109_TWC_2009_080679 crossref_primary_10_1109_JLT_2016_2628101 crossref_primary_10_1109_JLT_2017_2664581 crossref_primary_10_1109_TCOMM_2014_2339321 crossref_primary_10_1109_OJCOMS_2021_3094927 crossref_primary_10_1109_TCOMM_2019_2927209 crossref_primary_10_1109_JLT_2012_2187635 crossref_primary_10_1109_MSP_2014_2337391 crossref_primary_10_1109_JSAC_2008_080209 crossref_primary_10_1109_TIT_2010_2069170 crossref_primary_10_1109_TVT_2020_3011711 crossref_primary_10_1142_S0218127413500569 crossref_primary_10_1109_TIT_2011_2169536 crossref_primary_10_1016_j_phycom_2017_01_004 crossref_primary_10_1109_TIFS_2017_2744601 crossref_primary_10_1109_JSAC_2015_2432521 crossref_primary_10_1109_TIT_2023_3304408 crossref_primary_10_1109_TCOMM_2018_2808286 crossref_primary_10_1109_TIT_2015_2504358 crossref_primary_10_1109_JPROC_2018_2795961 crossref_primary_10_1109_TIT_2017_2726070 crossref_primary_10_1109_TWC_2012_120412_120583 crossref_primary_10_1109_JLT_2009_2025145 crossref_primary_10_1109_JLT_2022_3200827 crossref_primary_10_1109_JSTQE_2020_3024843 crossref_primary_10_1109_TWC_2020_3044103 crossref_primary_10_1109_TAES_2019_2902450 crossref_primary_10_1109_JLT_2007_893930 crossref_primary_10_1109_JLT_2022_3148322 crossref_primary_10_1109_LCOMM_2017_2661748 crossref_primary_10_1109_TCOMM_2016_2574847 crossref_primary_10_1109_JLT_2016_2594271 crossref_primary_10_1109_TIT_2012_2201341 crossref_primary_10_1109_TIT_2010_2040861 crossref_primary_10_1109_JLT_2016_2609932 crossref_primary_10_1364_OE_19_026600 crossref_primary_10_1109_JLT_2021_3132863 crossref_primary_10_1109_TCOMM_2022_3219141 crossref_primary_10_1109_JLT_2016_2567479 crossref_primary_10_1109_LPT_2019_2909803 crossref_primary_10_1109_TCOMM_2017_2771334 crossref_primary_10_1109_ACCESS_2019_2897381 crossref_primary_10_1109_TIT_2015_2460252 crossref_primary_10_1109_TIT_2020_2979840 crossref_primary_10_1109_TIT_2009_2039094 crossref_primary_10_1109_TIFS_2019_2916406 crossref_primary_10_1109_TCOMM_2014_012014_130745 crossref_primary_10_1109_ACCESS_2020_2970340 crossref_primary_10_1109_JLT_2016_2620721 crossref_primary_10_1109_TCOMM_2009_0901_060440 crossref_primary_10_1109_TIT_2015_2481878 crossref_primary_10_1109_TVT_2021_3123380 crossref_primary_10_1109_TMAG_2020_3011447 crossref_primary_10_1109_JLT_2015_2510034 crossref_primary_10_1109_TWC_2011_121911_110809 crossref_primary_10_1109_TWC_2023_3293412 crossref_primary_10_1109_TWC_2019_2894120 crossref_primary_10_1049_iet_com_2017_0453 crossref_primary_10_1109_JLT_2013_2288677 crossref_primary_10_1109_JLT_2019_2902961 crossref_primary_10_1364_OE_23_009183 crossref_primary_10_1364_OE_27_015617 crossref_primary_10_1109_JPROC_2007_904444 crossref_primary_10_1109_LCOMM_2012_102612_121929 crossref_primary_10_1109_TIT_2017_2719584 crossref_primary_10_1109_TCOMM_2023_3337254 crossref_primary_10_1109_JLT_2016_2603419 crossref_primary_10_1109_TIT_2008_2009581 crossref_primary_10_1109_TWC_2016_2533378 crossref_primary_10_1109_TMAG_2011_2106506 crossref_primary_10_1109_ACCESS_2021_3075575 crossref_primary_10_1109_TCOMM_2018_2863724 crossref_primary_10_31799_1684_8853_2018_4_73_85 crossref_primary_10_1109_TCOMM_2016_2641445 crossref_primary_10_1109_TCOMM_2010_01_070667 crossref_primary_10_1109_TIT_2023_3295472 crossref_primary_10_1109_TIT_2020_3043117 crossref_primary_10_1109_JLT_2022_3149574 crossref_primary_10_1109_JLT_2022_3188577 crossref_primary_10_23919_CJE_2014_10851996 crossref_primary_10_1109_TIT_2023_3296207 crossref_primary_10_1364_OE_23_016846 crossref_primary_10_1109_LCOMM_2024_3438830 crossref_primary_10_3390_sym12081353 crossref_primary_10_1109_MBITS_2023_3336213 crossref_primary_10_1109_JLT_2007_899156 crossref_primary_10_1002_sat_1036 crossref_primary_10_1109_WCL_2012_112012_120692 crossref_primary_10_1109_JLT_2016_2607798 crossref_primary_10_1109_TCOMM_2017_2723000 crossref_primary_10_1109_TCOMM_2009_02_070293 crossref_primary_10_1364_OE_20_025471 crossref_primary_10_1109_JLT_2023_3317149 crossref_primary_10_1109_JPHOT_2017_2740983 crossref_primary_10_1109_TCOMM_2008_060622 crossref_primary_10_1109_TIT_2012_2201370 crossref_primary_10_1109_TIT_2007_911181 crossref_primary_10_1109_TIT_2015_2403354 crossref_primary_10_1109_JLT_2016_2528550 crossref_primary_10_1109_TIT_2012_2212413 crossref_primary_10_1109_JLT_2022_3228595 crossref_primary_10_1109_TIT_2017_2662698 crossref_primary_10_3390_e22080872 crossref_primary_10_1049_iet_stg_2020_0129 crossref_primary_10_1109_TCOMM_2018_2823331 crossref_primary_10_1109_TCOMM_2023_3256415 crossref_primary_10_1109_TCOMM_2015_2478794 crossref_primary_10_1002_sat_1140 crossref_primary_10_1109_TAES_2017_2693018 crossref_primary_10_1109_TIT_2008_2009832 crossref_primary_10_1109_JSAC_2018_2804078 crossref_primary_10_1587_transfun_E102_A_1340 crossref_primary_10_1109_JSAC_2016_2603722 crossref_primary_10_1109_TCOMM_2017_2749376 crossref_primary_10_1109_TIT_2022_3206527 crossref_primary_10_1109_TWC_2009_071311 crossref_primary_10_1109_JLT_2022_3172247 crossref_primary_10_1109_TIT_2014_2311822 crossref_primary_10_1109_TIT_2005_860467 crossref_primary_10_1109_TIT_2017_2690997 crossref_primary_10_1109_TCOMM_2019_2909201 crossref_primary_10_1109_JLT_2016_2645078 crossref_primary_10_1109_OJVT_2020_2994626 crossref_primary_10_3390_app9091889 crossref_primary_10_1109_JLT_2017_2787340 crossref_primary_10_1109_JLT_2021_3103339 crossref_primary_10_1109_JLT_2022_3169993 crossref_primary_10_1109_TIT_2011_2146350 crossref_primary_10_1109_TIT_2017_2728091 crossref_primary_10_1109_JSAC_2009_090815 crossref_primary_10_1109_TMAG_2015_2483593 crossref_primary_10_1109_ACCESS_2024_3454603 crossref_primary_10_1109_JLT_2021_3053022 crossref_primary_10_1109_LCOMM_2018_2857773 crossref_primary_10_1109_TCOMM_2020_3042265 crossref_primary_10_1088_1742_6596_2833_1_012005 crossref_primary_10_1109_TSP_2015_2441046 crossref_primary_10_1109_TCOMM_2017_2723567 crossref_primary_10_1109_JSAC_2013_130715 crossref_primary_10_1002_sat_1121 crossref_primary_10_1109_LCOMM_2014_2314679 crossref_primary_10_1109_TCOMM_2012_122211_110026 crossref_primary_10_1109_TIT_2017_2653718 crossref_primary_10_1109_LCOMM_2015_2502247 crossref_primary_10_1109_TCOMM_2013_052013_120494 crossref_primary_10_1109_TIT_2010_2050825 crossref_primary_10_1109_TMAG_2006_878127 crossref_primary_10_1109_TCOMM_2015_2465389 crossref_primary_10_1109_TMBMC_2021_3054917 crossref_primary_10_1109_TCOMM_2012_071312_110682 crossref_primary_10_1109_TVT_2014_2337303 crossref_primary_10_1109_JLT_2019_2907311 crossref_primary_10_1038_s41467_018_03428_0 crossref_primary_10_1109_JPHOT_2023_3344184 crossref_primary_10_1109_TMBMC_2016_2537302 crossref_primary_10_1109_TCOMM_2018_2843760 crossref_primary_10_1016_j_optcom_2017_07_039 crossref_primary_10_1049_el_2015_3170 crossref_primary_10_1109_TCOMM_2013_070213_130064 crossref_primary_10_1109_JPROC_2008_2004310 crossref_primary_10_1364_OE_480794 crossref_primary_10_1109_JSAC_2015_2391531 crossref_primary_10_1109_TCOMM_2011_082011_100217 crossref_primary_10_3390_e25050728 crossref_primary_10_1109_TIT_2015_2432094 crossref_primary_10_1002_sat_1006 crossref_primary_10_1109_LCOMM_2015_2489648 crossref_primary_10_1109_TCOMM_2022_3206803 crossref_primary_10_1364_OE_25_003311 |
| Cites_doi | 10.1109/18.910572 10.1109/ISIT.2005.1523562 10.1109/TIT.2006.878230 10.1016/0304-4149(92)90141-C 10.1109/TIT.1972.1054753 10.1109/18.79941 10.1109/ISIT.2003.1228305 10.1109/GLOCOM.2001.965976 10.1109/26.54971 10.1109/MSP.2004.1267047 10.1109/18.2600 10.1109/18.45284 10.1109/ISIT.2005.1523428 10.1109/ISIT.2005.1523561 10.1109/TIT.1974.1055186 10.1109/ISIT.2000.866731 10.1007/978-94-009-9857-5_20 10.1109/18.910573 10.1109/TIT.2003.815809 10.1002/0471200611 10.1109/ITW.2001.955166 10.1109/ISIT.2004.1365215 10.1109/ITW.2003.1216758 10.1109/TMAG.2002.806346 10.1109/ISIT.2002.1023436 10.1109/TMAG.2004.835670 10.1214/aop/1176992813 10.1109/18.532881 10.1109/ISIT.2003.1228133 10.1109/TIT.1972.1054855 10.1109/TCOMM.2004.836449 10.1109/TIT.2002.1003838 10.1109/18.490551 10.1109/ISIT.2001.936146 10.1214/aoms/1177697807 10.1109/18.887846 10.1002/j.1538-7305.1985.tb00439.x 10.1109/ICC.2001.936639 10.1109/18.104314 10.1109/ISIT.2005.1523769 |
| ContentType | Journal Article |
| Copyright | 2006 INIST-CNRS Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2006 |
| Copyright_xml | – notice: 2006 INIST-CNRS – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2006 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TIT.2006.878110 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) - NZ 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 |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) - NZ 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 | 3508 |
| ExternalDocumentID | 1146127091 17973809 10_1109_TIT_2006_878110 1661831 |
| 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 AAYXX CITATION IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c351t-a87795a517af6cb97471390a59372db236c8ccf3dd7a0d537ce2fc85d1ffefb33 |
| IEDL.DBID | RIE |
| ISSN | 0018-9448 |
| IngestDate | Sun Sep 28 02:38:28 EDT 2025 Sun Sep 07 03:31:08 EDT 2025 Mon Jul 21 09:14:23 EDT 2025 Thu Apr 24 22:54:17 EDT 2025 Wed Oct 01 03:15:50 EDT 2025 Tue Aug 26 16:40:38 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 8 |
| Keywords | Channel with memory Parameter estimation sum-product algorithm Channel capacity Probabilistic approach Bounds hidden-Markov models Information rate Algorithm Joint source channel coding Information transmission trellises Simulation Channel estimation Hidden Markov models finite-state models Sampling |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c351t-a87795a517af6cb97471390a59372db236c8ccf3dd7a0d537ce2fc85d1ffefb33 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PQID | 195910409 |
| PQPubID | 36024 |
| PageCount | 11 |
| ParticipantIDs | proquest_miscellaneous_1671291980 crossref_primary_10_1109_TIT_2006_878110 pascalfrancis_primary_17973809 ieee_primary_1661831 crossref_citationtrail_10_1109_TIT_2006_878110 proquest_journals_195910409 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2006-08-01 |
| PublicationDateYYYYMMDD | 2006-08-01 |
| PublicationDate_xml | – month: 08 year: 2006 text: 2006-08-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 | 2006 |
| 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 oppenheim (ref30) 1999 ref11 ref10 ref17 ref16 ref19 ref18 kavi (ref24) 2001 ref46 ref45 ref48 ref47 ref42 ref44 ref49 ref8 ref7 ref9 ref4 ref3 hirt (ref21) 1988 ref40 sharma (ref38) 2001 ref35 ref34 ref37 ref36 ref31 ref33 ref32 vontobel (ref43) 0 ref2 ref1 ref39 cover (ref12) 1991 holliday (ref22) 2002 arnold (ref5) 2003 ref23 ref26 ref25 ref20 ref28 ref27 ref29 arnold (ref6) 2002 topse (ref41) 1967; 2 |
| References_xml | – ident: ref26 doi: 10.1109/18.910572 – ident: ref40 doi: 10.1109/ISIT.2005.1523562 – start-page: 457 year: 2002 ident: ref6 article-title: computation of information rates from finite-state source/channel models publication-title: Proc 40th Annu Allerton Conf Communication Control and Computing – ident: ref23 doi: 10.1109/TIT.2006.878230 – ident: ref27 doi: 10.1016/0304-4149(92)90141-C – ident: ref1 doi: 10.1109/TIT.1972.1054753 – ident: ref20 doi: 10.1109/18.79941 – ident: ref45 doi: 10.1109/ISIT.2003.1228305 – year: 0 ident: ref43 article-title: a generalization of the blahut-arimoto algorithm to finite-state channels publication-title: IEEE Trans Inf Theory – ident: ref32 doi: 10.1109/GLOCOM.2001.965976 – ident: ref35 doi: 10.1109/26.54971 – ident: ref28 doi: 10.1109/MSP.2004.1267047 – ident: ref46 doi: 10.1109/18.2600 – ident: ref29 doi: 10.1109/18.45284 – ident: ref47 doi: 10.1109/ISIT.2005.1523428 – ident: ref33 doi: 10.1109/ISIT.2005.1523561 – start-page: 2997 year: 2001 ident: ref24 article-title: on the capacity of markov sources over noisy channels publication-title: Proc 2001 IEEE GLOBECOM – ident: ref8 doi: 10.1109/TIT.1974.1055186 – ident: ref2 doi: 10.1109/ISIT.2000.866731 – ident: ref15 doi: 10.1007/978-94-009-9857-5_20 – ident: ref16 doi: 10.1109/18.910573 – ident: ref19 doi: 10.1109/18.79941 – ident: ref44 doi: 10.1109/TIT.2003.815809 – year: 1991 ident: ref12 publication-title: Elements of Information Theory doi: 10.1002/0471200611 – ident: ref42 doi: 10.1109/ITW.2001.955166 – ident: ref13 doi: 10.1109/ISIT.2004.1365215 – ident: ref11 doi: 10.1109/ITW.2003.1216758 – ident: ref48 doi: 10.1109/TMAG.2002.806346 – year: 1988 ident: ref21 publication-title: Capacity and information rates of discrete-time channels with memory – ident: ref4 doi: 10.1109/ISIT.2002.1023436 – ident: ref34 doi: 10.1109/TMAG.2004.835670 – ident: ref9 doi: 10.1214/aop/1176992813 – year: 2003 ident: ref5 publication-title: Computing Information Rates of Finite-State Models with Application to Magnetic Recording – ident: ref37 doi: 10.1109/18.532881 – ident: ref7 doi: 10.1109/ISIT.2003.1228133 – ident: ref10 doi: 10.1109/TIT.1972.1054855 – ident: ref49 doi: 10.1109/TCOMM.2004.836449 – volume: 2 start-page: 291 year: 1967 ident: ref41 article-title: an information theoretical identity and a problem involving capacity publication-title: Studia Scientiarum Math Hung – ident: ref14 doi: 10.1109/TIT.2002.1003838 – ident: ref18 doi: 10.1109/18.490551 – start-page: 283 year: 2001 ident: ref38 article-title: entropy and channel capacity in the regenerative setup with applications to markov channels publication-title: Proc 2001 IEEE Int Symp Information Theory doi: 10.1109/ISIT.2001.936146 – ident: ref31 doi: 10.1214/aoms/1177697807 – ident: ref17 doi: 10.1109/18.887846 – start-page: 824 year: 2002 ident: ref22 article-title: entropy and mutual information for markov channels with general inputs publication-title: Proc 40th Annu Allerton Conf Communication Control and Computing – ident: ref25 doi: 10.1002/j.1538-7305.1985.tb00439.x – ident: ref3 doi: 10.1109/ICC.2001.936639 – ident: ref36 doi: 10.1109/18.104314 – year: 1999 ident: ref30 publication-title: Discrete-Time Signal Processing – ident: ref39 doi: 10.1109/ISIT.2005.1523769 |
| SSID | ssj0014512 |
| Score | 2.4335678 |
| Snippet | The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 3498 |
| SubjectTerms | Applied sciences Approximation AWGN Bounds Channel capacity Channels Coding, codes Communication channels Computation Computational modeling Computer simulation Data communications Detection, estimation, filtering, equalization, prediction Estimating techniques Exact sciences and technology finite-state models Hidden Markov models information rate Information rates Information technology Information theory Information, signal and communications theory Intersymbol interference Laboratories Lower bounds Mathematical models Recursion Recursive estimation Sampling Sampling, quantization Signal and communications theory Signal, noise sum-product algorithm Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) trellises |
| Title | Simulation-Based Computation of Information Rates for Channels With Memory |
| URI | https://ieeexplore.ieee.org/document/1661831 https://www.proquest.com/docview/195910409 https://www.proquest.com/docview/1671291980 |
| Volume | 52 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) - NZ customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB6VnuBAoS1i27IyEoceyK69fuYIiKpUWg50V91blDi2qIAsarOH9td3Js5uKQ-JWxzbieOxMzOemW8A3sRaKRsMQV8qnhHkW1blQmfehDIoiWOXFO88_WxO5-psoRdb8HYTCxNC6JzPwoguO1t-vfQrOiobC2QmjoKmH1lnUqzWxmKgtEjI4AI3MOocPYyP4Pl49mmWrA6Owir5Aw7UpVQhh8jyGuckpmQWf_yXO2ZzsgPT9TCTj8m30aqtRv72NwTH__2OZ_C0lzrZu7RMnsNWaHZhZ53RgfUbfBee_AJPuAdn55c_-uxe2XvkdjVLPbo7bBlZH8vUFb-Q0MqwzChgoUGWyy4u269sSq68N_swP_k4-3Ca9bkXMi-1aLPSWZvrUgtbRuMr0jpQVuSlRnFmUlcTabzzPsq6tiWvtbQ-TKJ3uhYxhlhJ-QK2m2UTXgIL5LyonHGBe1XhAxVKPaKKLhdqEqUdwGhNj8L3wOSUH-N70SkoPC-QgJQu0xSJgAM43nT4mTA5_t10j6b_vlma-QEMHxD8vt7mVjqeD-BwvQKKflNfF4TDg9or1b7e1OJuJBNL2YTlCpsYiwKUyB0_-PubD-FxOsQhF8Ij2G6vVuEVijVtNezW8x2orPNe |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT9wwEB4hONAeyqsVWyi4Ug89NIu9tmPnSFHRQlkO7aJyixLHFgjIViV7gF_PTJxdSluk3uLYThyPnZnxzHwD8CFUShmfEvSl4glBviVlJnTiUl94JXHskuKdR6fp8Ewdn-vzBfg0j4Xx3rfOZ75Pl60tv5q4KR2V7QlkJpaCppe0UkrHaK25zUBpEbHBBW5h1Do6IB_Bs73x0TjaHSwFVvInPKhNqkIukcUtzkqI6Sz--jO37OZwBUazgUYvk6v-tCn77v4PDMf__ZJVeNXJnWw_LpQ1WPD1OqzMcjqwbouvw8vfAAo34Pj75U2X3yv5jPyuYrFHe4dNAuuimdriNxJbGZYZhSzUyHTZj8vmgo3ImffuNZwdfhkfDJMu-0LipBZNUlhjMl1oYYqQupL0DpQWeaFRoBlU5UCmzjoXZFWZgldaGucHwVldiRB8KKV8A4v1pPabwDy5LyqbWs-dKvGBCuUeUQabCTUI0vSgP6NH7jpocsqQcZ23KgrPciQgJcxM80jAHnycd_gZUTmeb7pB0__YLM58D3aeEPyx3mRGWp71YGu2AvJuW9_mhMSD-ivVvp_X4n4kI0tR-8kUm6QGRSiRWf7232_eheXheHSSnxydft2CF_FIhxwKt2Gx-TX171DIacqddm0_AImy9qs |
| 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=Simulation-Based+Computation+of+Information+Rates+for+Channels+With+Memory&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Arnold%2C+D+M&rft.au=Loeliger%2C+H-A&rft.au=Vontobel%2C+PO&rft.au=Kavcic%2C+A&rft.date=2006-08-01&rft.issn=0018-9448&rft.volume=52&rft.issue=8&rft_id=info:doi/10.1109%2FTIT.2006.878110&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 |