• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

A theoretical deepening of mean performance optimization in finite Markov decision processes and its application in information theory

Research Project

Project/Area Number 20K11674
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Review Section Basic Section 60010:Theory of informatics-related
Research InstitutionUniversity of Fukui

Principal Investigator

Iwata Ken-ichi  福井大学, 学術研究院工学系部門, 教授 (80284313)

Co-Investigator(Kenkyū-buntansha) 山本 博資  東京大学, 大学院新領域創成科学研究科, 名誉教授 (30136212)
Project Period (FY) 2020-04-01 – 2024-03-31
Project Status Completed (Fiscal Year 2023)
Budget Amount *help
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2022: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2021: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2020: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
Keywords情報理論 / 情報源符号 / 平均符号長 / マルコフ決定過程 / 準瞬時符号 / AIFV符号 / 平均性能最適化 / マルコフ連鎖 / 平均コスト / 繰り返し最適化 / 繰り返しアルゴリズム / 最適化手法
Outline of Research at the Start

有限マルコフ連鎖における平均性能最適化のアルゴリズムの提案を行い,提案するアルゴリズムの理論解析と情報理論における応用として,符号器が状態を有する準瞬時符号の構成法を与える.提案するアルゴリズムでは部分問題最適化を反復する手法であり,その最適性,適応条件,計算量などを評価する.また,提案法の応用例として,情報理論おける準瞬時符号の構成法を検討し,計算機実験で検証する.

Outline of Final Research Achievements

This research considers optimizing performance in Markov chains satisfying conditions (a) and (b), and we apply the optimization to source coding. (a) The performance in each state s_i of the Markov chain is determined by the performance function f_i(t_i), i=0, 1, ... , m-1, and we choose each state's variable t_i. (b) The variable t_i determines the transition probability p_i (s_j | s_i, t_i) from state s_i to state s_j and the pair of variables t = (t_i, i =0, 1, ... , m-1) uniquely determines the stationary distribution Q_i of the states s_i in the Markov chain. The optimizing method for average performance under (a) and (b) was applied to the almost instantaneous source coding.

Academic Significance and Societal Importance of the Research Achievements

無歪み情報源符号(データ圧縮)における準瞬時符号は,2015年の"Almost Instantaneous Fixed-to-Variable Length Codes"により提案された符号である.準瞬時符号のクラスにおいて平均符号長を最小にする符号構成法は未解決であった.本研究はマルコフ決定課程における平均性能最適化を検討し,準瞬時符号のクラスにおいて平均符号長を最小にする符号構成法にある種の一般的な手法を提案した.

Report

(5 results)
  • 2023 Annual Research Report   Final Research Report ( PDF )
  • 2022 Research-status Report
  • 2021 Research-status Report
  • 2020 Research-status Report
  • Research Products

    (14 results)

All 2024 2023 2022 2021 2020

All Journal Article (4 results) (of which Peer Reviewed: 4 results) Presentation (10 results) (of which Int'l Joint Research: 4 results,  Invited: 1 results)

  • [Journal Article] Properties of <i>k</i>-Bit Delay Decodable Codes2024

    • Author(s)
      HASHIMOTO Kengo、IWATA Ken-ichi
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E107.A Issue: 3 Pages: 417-447

    • DOI

      10.1587/transfun.2023TAP0016

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2024-03-01
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Optimality of Huffman Code in the Class of 1-bit Delay Decodable Codes2022

    • Author(s)
      Hashimoto Kengo、Iwata Ken-ichi
    • Journal Title

      IEEE Journal on Selected Areas in Information Theory

      Volume: - Issue: 4 Pages: 616-625

    • DOI

      10.1109/jsait.2022.3230745

    • Related Report
      2022 Research-status Report
    • Peer Reviewed
  • [Journal Article] Enumeration and Coding of Binary AIFV-m Code Trees2022

    • Author(s)
      Genta Onishi, Kengo Hashimoto, Ken-ichi Iwata, Hirosuke Yamamoto
    • Journal Title

      Proceedings of 2022 International Symposium on Information Theory and Its Applications

      Volume: - Pages: 103-107

    • Related Report
      2022 Research-status Report
    • Peer Reviewed
  • [Journal Article] Joint Coding for Discrete Sources and Finite-State Noiseless Channels2022

    • Author(s)
      Iwata Ken-Ichi、Yamamoto Hirosuke
    • Journal Title

      Proceedings of 2022 IEEE International Symposium on Information Theory

      Volume: - Pages: 3327-3332

    • DOI

      10.1109/isit50566.2022.9834437

    • Related Report
      2022 Research-status Report
    • Peer Reviewed
  • [Presentation] 符号ビットのコストを考慮した2ビットの復号遅延を許容するAIFV符号2023

    • Author(s)
      若山貴洋, 橋本健吾, 岩田賢一, 山本博資
    • Organizer
      第46回情報理論とその応用シンポジウム
    • Related Report
      2023 Annual Research Report
  • [Presentation] 2ビット遅延復号可能な無歪み情報源符号のクラスにおけるAIFV符号の最適性2023

    • Author(s)
      橋本健吾, 岩田賢一
    • Organizer
      第46回情報理論とその応用シンポジウム
    • Related Report
      2023 Annual Research Report
  • [Presentation] Nビットの復号遅延を許容するアルファベティック符号の構成法2023

    • Author(s)
      植田大智,岩田賢一,山本博資
    • Organizer
      電子情報通信学会情報理論研究会
    • Related Report
      2022 Research-status Report
  • [Presentation] 3ビットの復号遅延を許容するアルファベティック符号の構成法2022

    • Author(s)
      植田大智,岩田賢一,山本博資
    • Organizer
      第45回情報理論とその応用シンポジウム
    • Related Report
      2022 Research-status Report
  • [Presentation] 1ビット遅延復号可能な無歪み情報源符号のクラスにおけるハフマン符号の最適性2022

    • Author(s)
      橋本健吾,岩田賢一
    • Organizer
      第45回情報理論とその応用シンポジウム
    • Related Report
      2022 Research-status Report
  • [Presentation] Joint Coding for Discrete Sources and Finite-State Noiseless Channels2022

    • Author(s)
      Iwata Ken-ichi, Yamamoto Hirosuke
    • Organizer
      Proceedings of 2022 IEEE International Symposium on Information Theory
    • Related Report
      2021 Research-status Report
    • Int'l Joint Research
  • [Presentation] On the Optimality of Binary AIFV Codes with Two Code Trees2021

    • Author(s)
      Hashimoto Kengo, Iwata Ken-ichi
    • Organizer
      Proceedings of 2021 IEEE International Symposium on Information Theory
    • Related Report
      2021 Research-status Report
    • Int'l Joint Research
  • [Presentation] AIVF Codes Based on Iterative Algorithm and Dynamic Programming2021

    • Author(s)
      Iwata Ken-ichi, Yamamoto Hirosuke
    • Organizer
      Proceedings of 2021 IEEE International Symposium on Information Theory
    • Related Report
      2021 Research-status Report
    • Int'l Joint Research
  • [Presentation] An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes2021

    • Author(s)
      Iwata Ken-ichi、Yamamoto Hirosuke
    • Organizer
      Proceedings of 2020 IEEE Information Theory Workshop (ITW)
    • Related Report
      2021 Research-status Report
    • Int'l Joint Research
  • [Presentation] AIFV符号の構成法および有限マルコフ状態における平均性能の最適化法2020

    • Author(s)
      岩田賢一,藤田龍星,山本博資
    • Organizer
      電子情報通信学会フォトニックネットワーク研究会
    • Related Report
      2020 Research-status Report
    • Invited

URL: 

Published: 2020-04-28   Modified: 2025-01-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi