Updated on 2023/06/02

写真a

 
HOSOYA, Go
 
Scopus Paper Info  
Paper Count: 36  Citation Count: 95  h-index: 5

Click to view the Scopus page. The data was downloaded from Scopus API in June 01, 2023, via http://api.elsevier.com and http://www.scopus.com .
Affiliation
Affiliated organization, Global Education Center
Job title
Assistant Professor(without tenure)
Degree
2008/12 Waseda University Doctor of Engineering
Homepage URL
http://www.geocities.jp/ghsy1979/index.html

Research Experience

  • 2020.04
    -
    Now

    Waseda University   Global Education Center   Assistant Professor

  • 2017.04
    -
    　

    Tokyo University of Science   Faculty of Engineering Department of Information and Computer Technology   Junior Associate Professor

  • 2016.04
    -
    2017.03

    Tokyo University of Science   Faculty of Engineering Department of Information and Computer Technology   Assistant Professor

  • 2012.04
    -
    2016.03

    Tokyo University of Science   Faculty of Engineering, Division 1, Department of Management Science   Assistant Professor

  • 2008
    -
    2011

    Faculty of Science and Engineering, Waseda University   Research Associate

Education Background

  • 　
    -
    2008

    Waseda University   Graduate School, Division of Science and Engineering   Major in Industrial and Management Systems Engineering  

  • 　
    -
    2004

    Waseda University   Graduate School, Division of Science and Engineering   Major in Industrial and Management Systems Engineering  

  • 　
    -
    2002

    Waseda University   Faculty of Science and Engineering   Department of Industrial and Management System Engineering  

Committee Memberships

  • 2023.06
    -
    2025.06

    電子情報通信学会情報理論研究会  研究専門委員会 (幹事)

  • 2022.07
    -
    2024.11

    2024 International Symposium on Information Theory and its Applications (ISITA2024)  Publication Chair

  • 2020.06
    -
    2024.06

    ESS, IEICE  IEICE Trans. on Fundamentals, Associate Editor

  • 2022.01
    -
    2023.12

    IEEE Information Theory Society Japan Chapter  Secretary

  • 2023.04
    -
    2023.09

    2023 IEEE 34st Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'23)  TPC Member

  • 2018.06
    -
    2023.06

    電子情報通信学会情報理論研究会  研究専門委員

  • 2021.09
    -
    2023.03

    IEICE Engineering Sciences Society  IEICE Trans. on Fundamentals, 2023 Special Section on Information Theory and its Applications, Guest Editor

  • 2021.12
    -
    2022.12

    電子情報通信学会 基礎・境界ソサイエティ 情報理論とその応用サブソサイエティ  第45回情報理論とその応用シンポジウム(SITA2022) プログラム幹事

  • 2022.02
    -
    2022.10

    SITA Sub Society, IEICE ESS  Technical Program Committee, 2022 International Symposium on Information Theory and Its Applications (ISITA2022)

  • 2020.09
    -
    2022.03

    IEICE Trans. on Fundamentals, 2022 Special Section on Information Theory and its Applications  Guest Editor

  • 2021.05
    -
    2021.12

    電子情報通信学会 基礎・境界ソサイエティ 情報理論とその応用サブソサイエティ  第44回情報理論とその応用シンポジウム (SITA2021), プログラム委員

  • 2019.06
    -
    2021.06

    IEICE ESS  Fundamental Review Editional Committee (Web)

  • 2019.06
    -
    2021.05

    電子情報通信学会  基礎境界ソサイエティ運営委員会 電子広報担当幹事

  • 2019.07
    -
    2020.12

    IEICE Trans. on Fundamentals, 2020 Special Section on Information Theory and its Applications  Guest Associate Editor

  • 2019.07
    -
    2020.12

    43rd Symposium on Information Theory and Its Application  Technical Program Committee, Secretary

  • 2020.04
    -
    2020.07

    IEEE Communication Society  2020 IEEE 31st Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'20), TPC Member

  • 2019.07
    -
    2019.11

    42nd Symposium on Information Theory and Its Application  Technical Program Committee

  • 2018.11
    -
    2019.09

    第8回誤り訂正符号のワークショップ  実行委員

  • 2017.11
    -
    2018.12

    第41回情報理論とその応用シンポジウム  実行委員（出版）

  • 2017.11
    -
    2018.09

    第7回誤り訂正符号のワークショップ  実行委員

  • 2016.11
    -
    2017.09

    第6回誤り訂正符号のワークショップ  アドバイザ

  • 2015.11
    -
    2016.09

    第5回誤り訂正符号のワークショップ  実行委員長

  • 2015.04
    -
    2016.03

    Research institute of Signal Processing (RISP)  RISP International Workshop on Nonlinear Circuits and Signal Processing 2016, Conference Committee

  • 2015.04
    -
    2016.03

    信号処理学会  国際会議 NCSP'16実行委員

  • 2015.02
    -
    2015.09

    第4回誤り訂正符号のワークショップ  実行委員

  • 2014.03
    -
    2014.12

    第3回誤り訂正符号のワークショップ  実行委員

  • 2012.04
    -
    2013.03

    Research institute of Signal Processing (RISP)  RISP International Workshop on Nonlinear Circuits and Signal Processing, Conference Committee

  • 2012.04
    -
    2013.03

    信号処理学会  国際会議 NCSP実行委員

  • 2004.04
    -
    2005.06

    The Japan Society for Management Information  Conference Committee

  • 2004.04
    -
    2005.06

    経営情報学会  2005年春季全国研究発表大会 実行委員

▼display all

Professional Memberships

  • 2021.09
    -
    Now

    Information Processing Society of Japan (IPSJ)

  • 2004.07
    -
    Now

    The Institute of Electronics, Information and Communication Engineers (IEICE)

  • 2004
    -
    Now

    Institute of Electrical and Electronics Engineers (IEEE)

Research Areas

  • Theory of informatics

Research Interests

  • Information Theory, Coding Theory

Awards

  • Best Paper Award, IEICE Communications Society, 2021

    2022.06   A Novel Concatenation Scheme of Protograph-Based LDPC Codes and Markers for Recovering Synchronous Errors

    Winner： Ryo SHIBATA, Gou HOSOYA, Hiroyuki YASHIMA

  • Best Paper Award

    2021.10   The 20th International Symposium on Communications and Information Technologies (ISCIT 2021)   Analysis of Delayed Bit-Interleaved Coded Modulation for APSK

    Winner： Gou Hosoya

  • 貢献賞 (ソサイエティ運営)

    2021.09   電子情報通信学会 基礎・境界ソサイエティ  

  • IEICE Best Paper Award 2019

    2020.06   The Institute of Electronics, Information and Communication Engineers   Joint iterative decoding of spatially coupled low-density parity-check codes for position errors in racetrack memories

    Winner： R. Shibata, G. Hosoya, H. Yashima

  • IEEE Information Theory Society Japan Chapter, Travel Support Award for Young Researchers

    2010.10  

  • 2006年度 早稲田大学 大川記念論文賞

    2007.03  

▼display all

 

Papers

  • A reduction of delay for delayed bit-interleaved coded modulation

    G. Hosoya

    Proc. 2022 International Symposium on Information Theory (ISIT2022)     3127 - 3132  2022.06  [Refereed]

    Authorship：Lead author

  • Analysis of Delayed Bit-Interleaved Coded Modulation for APSK

    G. Hosoya

    Proc. of 2021 20th International Symposium on Communications and Information Technologies (ISCIT)     193 - 198  2021.10  [Refereed]

    Authorship：Lead author

  • Concatenated LDPC/trellis codes: Surpassing the symmetric information rate of channels with synchronization errors

    Ryo Shibata, Gou Hosoya, Hiroyuki Yashima

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   103 ( 11 ) 1283 - 1291  2020.11

    　View Summary

    Copyright © 2020 The Institute of Electronics, Information and Communication Engineers. We propose a coding/decoding strategy that surpasses the symmetric information rate of a binary insertion/deletion (ID) channel and approaches the Markov capacity of the channel. The proposed codes comprise inner trellis codes and outer irregular low-density parity-check (LDPC) codes. The trellis codes are designed to mimic the transition probabilities of a Markov input process that achieves a high information rate, whereas the LDPC codes are designed to maximize an iterative decoding threshold in the superchannel (concatenation of the ID channels and trellis codes).

    DOI

    Scopus

    3
    Citation
    (Scopus)

  • Performance of non-binary LDPC codes on two-dimensional array erasure models

    G. Hosoya, T. Niinomi

    2020 International Symposium on Information Theory and its Applications     220 - 224  2020.10  [Refereed]

    Authorship：Lead author

  • Design and construction of irregular LDPC codes for channels with synchronization errors: New aspect of degree profiles

    Ryo Shibata, Gou Hosoya, Hiroyuki Yashima

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E103A ( 10 ) 1237 - 1247  2020.10

    　View Summary

    Copyright © 2020 The Institute of Electronics, Information and Communication Engineers Over the past two decades, irregular low-density parity-check (LDPC) codes have not been able to decode information corrupted by insertion and deletion (ID) errors without markers. In this paper, we bring to light the existence of irregular LDPC codes that approach the symmetric information rates (SIR) of the channel with ID errors, even without markers. These codes have peculiar shapes in their check-node degree distributions. Specifically, the check-node degrees are scattered and there are degree-2 check nodes. We propose a code construction method based on the progressive edge-growth algorithm tailored for the scattered check-node degree distributions, which enables the SIR-approaching codes to progress in the finite-length regime. Moreover, the SIR-approaching codes demonstrate asymptotic and finite-length performance that outperform the existing counterparts, namely, concatenated coding of irregular LDPC codes with markers and spatially coupled LDPC codes.

    DOI

    Scopus

    3
    Citation
    (Scopus)

  • Concatenated LDPC/2-D-Marker Codes and Non-Iterative Detection/Decoding for Recovering Position Errors in Racetrack Memories

    Ryo Shibata, Gou Hosoya, Hiroyuki Yashima

    IEEE Transactions on Magnetics   56 ( 9 )  2020.09

    　View Summary

    © 1965-2012 IEEE. Racetrack memories (RMs) are prone to alignment faults called position errors (PEs), which manifest as insertions and deletions of stored data bits. Conventional coding schemes for PEs demonstrate the promising results by employing low-density parity-check (LDPC) codes with an iterative detection and decoding algorithm. However, the computational complexity of detection is relatively high. In this article, for channels with PEs, we present a new coding scheme that can effectively decode corrupted data, even if the detection is executed only once (i.e., a non-iterative detection and decoding scenario). The proposed code consists of a concatenation of an inner 2-D marker code, which is specialized for PEs to mitigate the effect of insertion and deletion (ID) errors, and an outer irregular LDPC code. We also provide tractable design methodologies for these constituent codes. First, we identify the 2-D-marker code structures that offer higher achievable information rates in a non-iterative scenario and then optimize irregular LDPC codes to ensure good decoding properties. Through asymptotic-performance analysis and finite-length simulation, we confirm the effectiveness of the proposed coding scheme. Ultimately, the proposed coding scheme has the capability to reduce code rate loss and to provide excellent decoding performance under a non-iterative scenario, which also helps in understanding the reliability of RM when a low-complexity decoding algorithm is used to correct ID errors caused by PEs.

    DOI

    Scopus

    4
    Citation
    (Scopus)

  • A novel concatenation scheme of protograph-based LDPC codes and markers for recovering synchronous errors

    Ryo Shibata, Gou Hosoya, Hiroyuki Yashima

    IEICE Transactions on Communications   103 ( 11 ) 1318 - 1330  2020

    　View Summary

    Copyright © 2020 The Institute of Electronics, Information and Communication Engineers. For insertion and deletion channels, there are many coding schemes based on low-density parity-check (LDPC) codes, such as spatially coupled (SC) LDPC codes and concatenated codes of irregular LDPC codes and markers. However, most of the previous works have problems, such as poor finite-length performance and unrealistic settings for codeword lengths and decoding iterations. Moreover, when using markers, the decoder receives log-likelihood (LLR) messages with different statistics depending on code bit position. In this paper, we propose a novel concatenation scheme using protograph-based LDPC code and markers that offers excellent asymptotic/finite-length performance and a structure that controls the irregularity of LLR messages. We also present a density evolution analysis and a simple optimization procedure for the proposed concatenated coding scheme. For two decoding scenarios involving decoding complexity, both asymptotic decoding thresholds and finite-length performance demonstrate that the newly designed concatenated coding scheme outperforms the existing counterparts: the irregular LDPC code with markers, the SC-LDPC code, and the protograph LDPC code, which is optimized for an additive white Gaussian noise channel, with markers.

    DOI

    Scopus

    1
    Citation
    (Scopus)

  • Design of irregular LDPC codes without markers for insertion/deletion channels

    Ryo Shibata, Gou Hosoya, Hiroyuki Yashima

    2019 IEEE Global Communications Conference, GLOBECOM 2019 - Proceedings    2019.12

    　View Summary

    © 2019 IEEE. Over the past two decades, irregular low-density parity-check (LDPC) codes have been hardly able to decode information corrupted by insertion and deletion (ID) errors without markers. Surprisingly, in this paper, we bring to light the existence of irregular LDPC codes that approach the theoretical limit of the channel with ID errors even without markers. These codes contain high fractions of low-degree check nodes that do not appear in irregular codes for other channels. This motivates us to investigate the contribution of low-degree check nodes to correcting ID errors. The investigation provides the following interesting result: degree-2 check nodes are critical to approaching the theoretical limit even without markers, codes with only degree-3, 4, or more check nodes provide moderate decoding performance, and codes with only degree-5 or more check nodes can hardly correct ID errors. Finally, we present simulation results that confirm the excellent decoding performance of the irregular codes without markers.

    DOI

    Scopus

    5
    Citation
    (Scopus)

  • Protograph-based LDPC coded system for position errors in racetrack memories

    R. Shibata, G. Hosoya, H. Yashima

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E102-A ( 10 ) 1340 - 1350  2019.10  [Refereed]

    DOI

    Scopus

    3
    Citation
    (Scopus)

  • Simulation of All-Optical OR Gate Using Quantum-Dot Semiconductor Optical Amplifier

    K. Komatsu, G. Hosoya, H. Yashima

    Proc. 2019 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'19)   2019   197 - 200  2019.03  [Refereed]

  • Ultrafast all-optical digital comparator using quantum-dot semiconductor optical amplifiers

    K.Komatsu, G.Hosoya, H.Yashima

    OPTICAL AND QUANTUM ELECTRONICS   51 ( 39 ) 1 - 16  2019.01  [Refereed]

    DOI

    Scopus

    13
    Citation
    (Scopus)

  • Joint iterative decoding of spatially coupled low-density parity-check codes for position errors in racetrack memories

    R. Shibata, G. Hosoya, H. Yashima

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E101-A ( 12 ) 2055 - 2063  2018.12  [Refereed]

    DOI

    Scopus

    8
    Citation
    (Scopus)

  • Spatially coupled low-density parity-check codes on two-dimensional array erasure channel

    G. Hosoya, H. Yashima

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E101-A ( 12 ) 2008 - 2017  2018.12  [Refereed]

    DOI

    Scopus

    2
    Citation
    (Scopus)

  • Multiple-input all-optical OR gate by cascaded logic gates based on quantum-dot semiconductor optical amplifier

    K. Komatsu, G. Hosoya, H. Yashima

    Proc. Latin America & Optics and Photonics Conference (LAOP-2018)     Th4A.8 - Th4A.8  2018.11  [Refereed]

  • Structured concatenation of protograph LDPC codes and markers for Insertion/Deletion channels

    R. Shibata, G. Hosoya, H. Yashima

    Proc. 2018 International Symposium on Information Theory and its Applications (ISITA2018)     374 - 378  2018.10  [Refereed]

  • Probabilistic shaping for BICM with pseudorandom sequence

    M. Yuri, R. Shibata, G. Hosoya, H. Yashima

    Proc. 2018 International Symposium on Information Theory and its Applications (ISITA2018)     493 - 493  2018.10  [Refereed]

  • Improved LT code degree distribution and its performance evaluation

    T. Ishiyama, R. Shibata, G. Hosoya, H. Yashima

    Proc. 2018 International Symposium on Information Theory and its Applications (ISITA2018)     492 - 492  2018.10  [Refereed]

  • Channel model divided into cylinder for free-space optical links in rain

    K. Futami, G. Hosoya, H. Yashima

    Proc. 2018 International Symposium on Information Theory and its Applications (ISITA2018)     503 - 503  2018.10  [Refereed]

  • All-optical two-bit magnitude comparator using quantum-dot semiconductor optical amplifier

    K. Komatsu, G. Hosoya, H. Yashima

    Proc. Asia Communications and Photonics Conference     122 - 122  2018.10  [Refereed]

  • Performance of all-optical AND gate using photonic-crystal QDSOA at 160 Gb/s

    T. Matsumoto, K. Komatsu, G. Hosoya, H. Yashima

    Electronics Letters   54 ( 9 ) 580 - 582  2018.05  [Refereed]

    　View Summary

    An all-optical AND gate using photonic-crystal quantum dot semiconductor optical amplifiers is designed and its performance is evaluated. The input–output characteristics of the gate are simulated using a rate equation model and it is found that the gate can achieve a maximum of ∼9 dB extinction ratio at 160 Gb/s. The proposed gate is compared with quantum dot semiconductor optical amplifiers AND gate to evaluate its effectiveness with regard to signal quality, device size, and power consumption.

    DOI

    Scopus

    5
    Citation
    (Scopus)

  • Performance analysis of spatially-coupled low-density parity-check codes based on reading ratio in racetrack memory

    R. Shibata, G. Hosoya, H. Yashima

    Proc. 2018 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'18)   2018   643 - 646  2018.03  [Refereed]

  • All-optical logic NOR gate using a single quantum-dot SOA-assisted an optical filter

    K. Komatsu, G. Hosoya, H. Yashima

    Optical and Quantum Electronics   50 ( 3 ) 1 - 18  2018.03  [Refereed]

    　View Summary

    We thoroughly explore the characteristics of an ultrafast all-optical NOR gate for 160 Gb/s return-to-zero Gaussian data signals using a single quantum-dot semiconductor optical amplifier (QD-SOA) and an optical filter (OF). In this proposed scheme, we employ an optical clock signal as a probe in addition to data signals as pumps between which the Boolean NOR function is executed. By conducting numerical simulations, we investigate and evaluate the effects of various critical factors on the extinction ratio and Q2-factor. This enables us to specify the margins of clock wavelength, peak power of data and clock signals, current density, electron relaxation time from the excited state to the ground state, linewidth enhancement factor, small signal gain of QD-SOA, OF bandwidth and order, the permissible extent of arrival time difference between data signals and clock, and the effect of amplified spontaneous emission. Moreover, we demonstrate that the proposed device can be applied to a multiple-input NOR gate. The results show that the proposed NOR gate can be achieved with both logical correctness and high quality when the specified conditions are satisfied.

    DOI

    Scopus

    25
    Citation
    (Scopus)

  • All-optical AND gate with photonic crystal quantum-dot semiconductor optical amplifiers

    T. Matsumoto, G. Hosoya, H. Yashima

    Proc. 2018 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'18)   2018   651 - 654  2018.03  [Refereed]

  • Simulation of all-optical NOR gate using single quantum-Dot SOA and optical filter

    Kosuke Komatsu, Gou Hosoya, Hiroyuki Yashima

    2017 Conference on Lasers and Electro-Optics Pacific Rim, CLEO-PR 2017   2017-   1 - 4  2017.11  [Refereed]

    　View Summary

    We propose an ultrafast all optical NOR gate for 160 Gb/s return-to-zero Gaussian data signals using a single quantum-dot semiconductor optical amplifier (QD-SOA) and optical filter (OF). By conducting numerical simulations, we investigate and evaluate the impacts of probe wavelength and power of the involved signals on the extinction ratio (ER) and Q2-factor. Results show that the proposed NOR gate can be achieved both with logical correctness and high quality when the specified conditions are satisfied.

    DOI

    Scopus

  • Spatially-coupled LDPC codes for two dimensional erasure channel

    G. Hosoya, H. Yashima

    Proc. 2017 IEEE Information Theory Workshop   ( 1570368570 ) 1 - 5  2017.11  [Refereed]

  • Interference suppression in an SSFBG OCDMA using a QD-SOA-based MZI

    M. Nishino, G. Hosoya, H. Yashima

    Proc. 2017 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'17)   2017   349 - 352  2017.03  [Refereed]

  • A novel constellation shaping scheme using pilot bit for bit-interleaved coded modulation

    Y. Taniguchi, G. Hosoya, H. Yashima

    Proc. 2017 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'17)   2017   293 - 296  2017.03  [Refereed]

  • Simulation of All-Optical NOR Gate Using Single Quantum-Dot SOA and Optical Filter

    Kosuke Komatsu, Gou Hosoya, Hiroyuki Yashima

    2017 CONFERENCE ON LASERS AND ELECTRO-OPTICS PACIFIC RIM (CLEO-PR)    2017  [Refereed]

    　View Summary

    We propose an ultrafast all optical NOR gate for 160 Gb/s return-to-zero Gaussian data signals using a single quantum-dot semiconductor optical amplifier (QD-SOA) and optical filter (OF). By conducting numerical simulations, we investigate and evaluate the impacts of probe wavelength and power of the involved signals on the extinction ratio (ER) and Q(2) -factor. Results show that the proposed NOR gate can be achieved both with logical correctness and high quality when the specified conditions are satisfied.

  • Constellation shaping with pilot bit for bit-interleaved coded modulation

    Y. Taniguchi, G. Hosoya, H. Yashima

    Proc. 2016 International Symposium on Information Theory and its Applications (ISITA2016)     548 - 548  2016.10  [Refereed]

  • OCDMAにおけるMAIの持続性を考慮したBERの解析

    寺尾優史, 細谷 剛, 八嶋弘幸

    電子情報通信学会論文誌(A)   J99-A ( 5 ) 185 - 193  2016.05  [Refereed]

  • All-optical NOR gate using XPM and XGM in QD-SOA based MZI

    F. Sato, G. Hosoya, H. Yashima

    Proc. 2016 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'16)   2016   351 - 354  2016.03  [Refereed]

  • All-optical error correcting system using (7,4) Hamming code

    K. Iwamoto, G. Hosoya, H. Yashima

    Proc. 2016 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'16)   2016   558 - 561  2016.03  [Refereed]

  • All Optical error correcting system using horizontal and vertical parity checks

    T. Matsumoto, G. Hosoya, H. Yashima

    Proc. 2016 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'16)   2016   550 - 553  2016.03  [Refereed]

  • All optical CDMA using all optical device

    M. Nishino, G. Hosoya, H. Yashima

    Proc. 2016 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'16)   2016   359 - 362  2016.03  [Refereed]

  • Constellation Shaping for Non-Uniform Signals in Bit-Interleaved Coded Modulation Combined with Multi-Stage Decoding

    Gou Hosoya, Hiroyuki Yashima

    2016 AUSTRALIAN COMMUNICATIONS THEORY WORKSHOP (AUSCTW)     181 - 186  2016  [Refereed]

    　View Summary

    A signal shaping for the bit-interleaved coded modulation (BICM) is considered. Previous work on signal shaped BICM (SBICM) has two problems: (i) It requires an optimization for the linear factors of superposition modulation. The optimization is valid around target SNR. (ii) The binary labeling of signal constellation is not Gray code. To overcome these problems, non-uniform signal labeling for the input signal with Gaussian distribution is considered. We implement the reduction of peakto-average power ratio (PAPR) by clipping for the largest signal points. From the numerical results, we show that achievable rate of the proposed modulation is larger than that of the previous modulation of SBICM for wide range of SNR, while keeping the expansion of PAPR small. Moreover it is quite close to the coded modulation capacity for wide range of SNR, especially in some SNR region, it is larger than the coded modulation capacity.

  • Fixed-Symbols-based Synchronization for Insertion/Deletion/Substitution Channels

    Ryo Shibata, Gou Hosoya, Hiroyuki Yashima

    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016)     686 - 690  2016  [Refereed]

    　View Summary

    We investigate a synchronization method for channels that are impaired by insertion, deletion, and substitution (IDS) errors and include outer low-density parity-check (LDPC) codes with error-correction capabilities and inner marker codes for synchronization. We improve synchronization using fixed-symbols, and evaluate the achievable rate by a specific fixed-symbol assignment. We demonstrate via simulation that the bit error rate of the proposed method over an IDS channel is lower than that of the conventional method.

  • Constellation Shaping for Non-Uniform Signals based on Truncated Gaussian Distribution

    Gou Hosoya, Hiroyuki Yashima

    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016)     557 - 561  2016  [Refereed]

    　View Summary

    We study the signal shaping based on the truncated Gaussian distribution. Since the possibility of reducing peak-to average power ratio (PAPR) by the previous study with clipped Gaussian signal constellation is limited, we study PAPR reduction for one-dimensional signal constellation using the truncated Gaussian distribution. From the numerical results, we show that achievable rate of the truncated Gaussian distribution is larger than that of the clipped Gaussian signal constellation for wide range of SNR, while keeping the expansion of PAPR small. Moreover it is quite close to the uniform signal constellation for high SNR.

  • An improved iterative decoding algorithm of rate-compatible punctured LDPC codes

    Gou Hosoya

    Far East Journal of Electronics and Communications   15 ( 2 ) 133 - 149  2015.12  [Refereed]

    　View Summary

    An improved iterative decoding algorithm of rate-compatible punctured low-density parity-check (RCP-LDPC) codes is developed. This algorithm performs a pre-determined recovering process of punctured bits sums at the beginning of each iteration of the standard belief-propagation (BP) decoding algorithm. By propagating messages of two punctured bits sum, this algorithm can recover much more punctured bits than the standard BP decoding algorithm. It is shown that the proposed algorithm is applicable for RCP-LDPC codes of higher coding rates with little increase of decoding complexity.

    DOI

    Scopus

  • Noise suppression effects on QD-SOA-based MZI --Simulation Results for Ultrafast Optical Signals--

    Y. Furuya, G. Hosoya, H. Yashima

    Proc. 2015 International Workshop on Vision, Communications and Circuits (IWCC'15)     71 - 74  2015.10  [Refereed]

  • Theoretical analysis of OPPM OCDMA with consecutive MAI

    M. Nishino, H. Terao, G. Hosoya, H. Yashima

    Proc. 2015 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'15)   2015   567 - 570  2015.03  [Refereed]

  • OCDMA using code shift keying and interference cancellation

    S. Takeuchi, H. Terao, G. Hosoya, H. Yashima

    Proc. 2015 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'15)   2015   138 - 141  2015.03  [Refereed]

  • Coded modulation with constellation shaping for QAM

    Y. Taniguchi, G. Hosoya, H. Yashima

    Proc. 2015 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'15)   2015   575 - 578  2015.03  [Refereed]

  • All-Optical OFDM receiver using Odd-Even separator based on double Mach-Zender interferometers and optical switching

    H. Harada, M. Yoshida, G. Hosoya, H. Yashima

    Proc. 2015 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'15)   2015   130 - 133  2015.03  [Refereed]

  • All-Optical noise suppression by QD-SOA based MZI

    Y. Furuya, G. Hosoya, H. Yashima

    Proc. 2015 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing (NCSP'15)   2015   122 - 125  2015.03  [Refereed]

  • Box-Plus BP-Based algorithm by linear approximation

    G. Hosoya, H. Yashima

    Proc. 37th Symposium on Information Theory and its Applications (SITA2014)   2014   403 - 408  2014.12  [Refereed]

  • Multiple connected optical hard limiter and optical power equalizer using Quantum-Dot semiconductor

    K. Iwamoto, F. Sato, Y. Furuya, T. Irie, G. Hosoya, H. Yashima

    Proc. 2014 International Symposium on Nonlinear Theory and its Applications (NOLTA2014)   2014   304 - 307  2014.09  [Refereed]

  • All-Optical AND gate using optical hard limiter with QD-SOA based on self-phase modulation

    F. Sato, K. Iwamoto, Y. Furuya, T. Irie, G. Hosoya, H. Yashima

    Proc. 2014 International Symposium on Nonlinear Theory and its Applications (NOLTA2014)   2014   213 - 216  2014.09  [Refereed]

  • 次世代ネットワークを支える暗号，誤り訂正符号，OCDMAおよびUWBと情報通信技術の最近の発展動向

    五十嵐保隆, 大野光平, 寺尾優史, 細谷剛, 八嶋弘幸

    信号処理   18 ( 1 ) 1 - 15  2014.01  [Refereed]

  • An Improvement of Approximate BP Decoding

    Gou Hosoya, Hiroyuki Yashima

    2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA)   2014   186 - 190  2014  [Refereed]

    　View Summary

    In this study, we present new methods for piece-wise linear approximation of Min-Sum (MS) decoding algorithm with good trade-off between performance and complexity. By analysis based on density evolution, the performance of the proposed method is identical to that of the Belief-Propagation decoding algorithm. The increment of the complexity of the proposed algorithm is small compared with the MS decoding algorithm. Moreover simulation result also shows effectiveness of the proposed algorithm.

  • All optical NOR gate using QD-SOA based on cross gain modulation

    K. Ogawa, Y. Furuya, T. Irie, G. Hosoya, H. Yashima

    Optics & Photonics Taiwan, the International Conference 2013    2013.12  [Refereed]

  • 8-input all-optical XOR circuit using QD-SOA-Based MZIs and AOWCs

    T. Irie, G. Hosoya, H. Yashima

    Optics & Photonics Taiwan, the International Conference 2013    2013.12  [Refereed]

  • Rate-compatible punctured LDPC codes with two subgraphs

    G. Hosoya, K. Osada, M. Goto

    Far East Journal of Electronics and Communications   10 ( 2 ) 83 - 104  2013.06  [Refereed]

  • Residual energy and distance-aware clustering protocol in wireless sensor network

    K. Tabata, G. Hosoya, H. Yashima

    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13)    2013.03  [Refereed]

  • Rate-compatible punctured low-density parity-check codes consisting of two subgraphs

    G. Hosoya, K. Osada, M. Goto

    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13)    2013.03  [Refereed]

  • Performance analysis of OCDMA with the bursty effects of multiple user interference

    H. Terao, G. Hosoya, H. Yashima

    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13)    2013.03  [Refereed]

  • MMSE-FDE-STBC with channel frequency response and noise variance estimation for cooperative relay networks

    R. Sasaki, G. Hosoya, H. Yashima

    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13)    2013.03  [Refereed]

  • Convolutional coded optical CDMA using code shift keying

    S. Hata, G. Hosoya, H. Yashima

    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13)    2013.03  [Refereed]

  • Log-Likelihood Ratio Calculation for Iterative Decoding on Rayleigh Fading Channels Using Pade Approximation

    Gou Hosoya, Hiroyuki Yashima

    JOURNAL OF APPLIED MATHEMATICS   2013 ( 970126 ) 1 - 10  2013  [Refereed]

    　View Summary

    Approximate calculation of channel log-likelihood ratio (LLR) for wireless channels using Pade approximation is presented. LLR is used as an input of iterative decoding for powerful error-correcting codes such as low-density parity-check (LDPC) codes or turbo codes. Due to the lack of knowledge of the channel state information of a wireless fading channel, such as uncorrelated fiat Rayleigh fading channels, calculations of exact LLR for these channels are quite complicated for a practical implementation. The previous work, an LLR calculation using the Taylor approximation, quickly becomes inaccurate as the channel output leaves some derivative point. This becomes a big problem when higher order modulation scheme is employed. To overcome this problem, a new LLR approximation using Pade approximation, which expresses the original function by a rational form of two polynomials with the same total number of coefficients of the Taylor series and can accelerate the Taylor approximation, is devised. By applying the proposed approximation to the iterative decoding and the LDPC codes with some modulation schemes, we show the effectiveness of the proposed methods by simulation results and analysis based on the density evolution.

    DOI

    Scopus

    1
    Citation
    (Scopus)

  • Multi-valued document classification based on generalized Bradley-Terry classifiers utilizing accuracy information

    T. Ogiwara, K. Mikawa, G. Hosoya, M. Goto

    13th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS2013)    2012.12  [Refereed]

  • On the capacity of fingerprinting codes against AND, averaging, and related attacks

    G. Hosoya, H. Yagi, M. Kobayashi, S. Hirasawa

    Journal of Information Assurance and Security   7 ( 1 ) 41 - 51  2012.06  [Refereed]

  • LLR Calculation for Iterative Decoding on Fading Channels using Pade Approximation

    Gou Hosoya, Mikio Hasegawa, Hiroyuki Yashima

    2012 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP 2012)    2012  [Refereed]

    　View Summary

    In this paper, approximate calculation of channel log likelihood ratio (LLR) for wireless channels using Pade approximation is devised. Due to the lack of knowledge of the channel state information of a wireless fading channel, such as uncorrelated flat Rayleigh fading channels, calculation of exact LLR for these channels is quite complicated for a practical implementation. The previous work, LLR calculation using the Taylor approximation, quickly becomes inaccurate as the channel output leaves some derivative point. To overcome this problem, we devise a new LLR approximation using Pade approximation, which expresses the original function by rational form of two polynomials with the same total number of coefficients of the Taylor series, accelerates the Taylor approximation, is devised. By applying the proposed approximation to the iterative decoding and the low-density parity-check codes, we show the effectiveness of the proposed methods by simulation results and analysis based on the density evolution.

  • Multivalued document classification by maximization of posterior probability based on relevance vector machine

    R. Odai, G. Kumoi, K. Mikawa, G. Hosoya, M. Goto

    12th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS2012)    2011.10  [Refereed]

  • A study on automatic summarization of customer reviews based on maximum coverage problem

    T. Takemura, M. Kumoi, G. Hosoya, M. Goto

    12th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS2012)    2011.10  [Refereed]

  • On the capacity of fingerprinting codes against unknown size of colluders

    Gou Hosoya, Hideki Yagi, Manabu Kobayashi, Shigeichi Hirasawa

    Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011     234 - 239  2011  [Refereed]

    　View Summary

    In this paper, a new attack model in which the number of colluders are distributed according to a certain probability distribution is introduced. Two classes of collusion attacks which include well-known collusion attacks in the context of multimedia fingerprinting are provided. For these two attack classes, achievable rates for the unknown size of the actual colluders are derived. Based on the derived achievable rates, achieve rates for some particular attacks are investigated. For the AND attack, the bound derived in this paper coincides with the previous known bound, although the attack model in this paper does not assume that the decoder knows the actual number of colluders. Moreover, for the averaging attack, it is clarified that derived achievable rate is larger than previously known bound with random linear codes. © 2011 IEEE.

    DOI

    Scopus

  • An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates

    Gou Hosoya, Hideki Yagi, Manabu Kobayashi

    ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications     394 - 399  2010  [Refereed]

    　View Summary

    An iterative decoding algorithm of rate-compatible punctured low-density parity-check (RCP-LDPC) codes of high coding rates is developed. This algorithm performs a predetermined recovering process of punctured bits sums at the beginning of each iteration of the standard belief-propagation (BP) decoding algorithm. By propagating messages of two punctured bits sum, this algorithm can recover much more punctured bits than the standard BP decoding algorithm. It is shown that the proposed algorithm is applicable for RCP-LDPC codes of higher coding rates with little increase of decoding complexity. © 2010 IEEE.

    DOI

    Scopus

  • Adaptive Decoding Algorithms for Low-Density Parity-Check Codes over the Binary Erasure Channel

    Gou Hosoya, Hideki Yagi, Manabu Kobayashi, Shigeichi Hirasawa

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E92A ( 10 ) 2418 - 2430  2009.10  [Refereed]

    　View Summary

    Two decoding procedures combined with a belief-propagation (BP) decoding algorithm for low-density parity-check codes over the binary erasure channel are presented. These algorithms continue a decoding procedure after the BP decoding algorithm terminates. We derive a condition that our decoding algorithms can correct an erased bit which is uncorrectable by the BP decoding algorithm. We show by simulation results that the performance of our decoding algorithms is enhanced compared with that of the BP decoding algorithm with little increase of the decoding complexity.

    DOI

    Scopus

    2
    Citation
    (Scopus)

  • Construction and performance analysis of irregular low-density parity-check code ensemble for correcting a single solid burst erasure

    G. Hosoya, T. Matsushima, S. Hirasawa

    Pre-ICM International Convention on Mathematical Sciences    2008.12  [Refereed]

  • A Method for Grouping Symbol Nodes of Group Shuffled BP Decoding Algorithm

    Yoshiyuki Sato, Gou Hosoya, Hideki Yagi, Shigeichi Hirasawa

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E91A ( 10 ) 2745 - 2753  2008.10  [Refereed]

    　View Summary

    In this paper, we propose a method for enhancing performance of a sequential version of the belief-propagation (BP) decoding algorithm, the group shuffled BP decoding algorithm for low-density parity-check (LDPC) codes. An improved BP decoding algorithm, called the shuffled BP decoding algorithm, decodes each symbol node in serial at each iteration. To reduce the decoding delay of the shuffled BP decoding algorithm, the group shuffled BP decoding algorithm divides all symbol nodes into several groups. In contrast to the original group shuffled BP, which automatically generates groups according to symbol positions, in this paper we propose a method for grouping symbol nodes which generates groups according to the structure of a Tanner graph of the codes. The proposed method can accelerate the convergence of the group shuffled BP algorithm and obtain a lower error rate in a small number of iterations. We show by simulation results that the decoding performance of the proposed method is improved compared with those of the shuffled BP decoding algorithm and the group shuffled BP decoding algorithm.

    DOI

    Scopus

  • A Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure

    Gou Hosoya, Toshiyasu Matsushima, Shigeichi Hirasawa

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E91A ( 10 ) 2765 - 2778  2008.10  [Refereed]

    　View Summary

    A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we show that the critical minimum span ratio of stopping sets for the proposed code ensemble is better than that of the conventional one with keeping the same critical exponent of stopping ratio for both ensemble. Furthermore from experimental results, we show that the average minimum span of stopping sets for a solid burst erasure of the proposed codes is larger than that of the conventional ones.

    DOI

    Scopus

    1
    Citation
    (Scopus)

  • Performance of low-density parity-check codes for burst erasures

    G. Hosoya, H. Yagi, T. Matsushima, S. Hirasawa

    2006 International Symposium on Information Theory and its Applications     491 - 496  2006.10  [Refereed]

    CiNii

  • A modification method for constructing low-density parity-check codes for burst erasures

    Gou Hosoya, Hideki Yagi, Toshiyasu Matsushima, Shigeichi Hirasawa

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E89A ( 10 ) 2501 - 2509  2006.10  [Refereed]

    　View Summary

    We study a modification method for constructing low-density parity-check (LDPC) codes for solid burst erasures. Our proposed modification method is based on a column permutation technique for a parity-check matrix of the original LDPC codes. It can change the burst erasure correction capabilities without degradation in the performance over random erasure channels. We show by simulation results that the performance of codes permuted by our method are better than that of the original codes, especially with two or more solid burst erasures.

    DOI

    Scopus

    10
    Citation
    (Scopus)

  • Modification method of construction and performance analysis of low-density parity-check codes over the Markov-modulated channel

    G. Hosoya, H. Yagi, S. Hirasawa

    2004 International Symposium on Information Theory and its Applications    2004.10  [Refereed]

▼display all

Books and Other Publications

  • 理工系の基礎 情報工学

    赤倉 貴子, 池口 徹, 谷口 行信, 浜田 知久馬, 古川 利博, 八嶋 弘幸, 池辺 淑子, 塩濱 敬之, 寒水 孝司, 立川 智章, 細谷 剛, 石井 隆稔, 奥野 貴之, 佐藤 寛之, 島田 裕, 高橋 智博, 藤原 寛太郎, 太原 育夫, 宮部 博史, 渡邉 均, 藤沢 匡哉( Part： Contributor)

    丸善出版  2018.04 ISBN: 9784621302859

Presentations

  • A Study on Modulation Scheme Achieving Coded Modulation Capacity

    G. Hosoya

    45th Symposium on Information Theory and Its Applications 

    Presentation date： 2022.11

    Event date：
    2022.11
    -
    2022.12

  • A method of assigning bit labeling for delayed bit-interleaved coded modulation

    G. Hosoya

    Presentation date： 2022.05

    Event date：
    2022.05
    　
    　

  • Performance of non-minary LDPC codes on two-dimensional array erasure models

    G. Hosoya, T. Niinomi

    2020 International Symposium on Information Theory and its Applications 

    Presentation date： 2020.10

  • Construction of Irregular Polar Code with Gaussian Approximation

    Yusuke Oki, Gou Hosoya, Hiroyuki Yashima

    Technical Committee Workshops on Information Theory 

    Presentation date： 2020.01

  • Design of irregular LDPC codes without markers for insertion/deletion channels

    R. Shibata, G. Hosoya, H. Yashima

    2019 IEEE Global Communications Conference 

    Presentation date： 2019.12

  • Performance of Non-binary LDPC Codes for 2D Arrays

    G. Hosoya, T. Niinomi, H. Yashima

    42th Symposium on Information Theory and its Applications 

    Presentation date： 2019.11

  • Concatenated LDPC/trellis codes: Surpassing symmetric information rate of insertion/deletion channels

    R. Shibata, G. Hosoya, H. Yashima

    42th Symposium on Information Theory and its Applications 

    Presentation date： 2019.11

  • Symbol Decomposition Algorithms with a Finite Window and Their Redundancy Analysis

    Y. Hashimoto, R. Shibata, G. Hosoya, H. Yashima

    42th Symposium on Information Theory and its Applications 

    Presentation date： 2019.11

  • Shaping Method for Spatially Coupled LDPC Coded BICM with Pseudorandom Sequence

    M. Yuri, R. Shibata, G. Hosoya, H. Yashima

    42th Symposium on Information Theory and its Applications 

    Presentation date： 2019.10

  • Simulation on application of QD-SOA to some all optical logic gates

    H. Yashima, K. Komatsu, G. Hosoya  [Invited]

    Inter-Photonics 2019 International Conference on Photonics Research 

    Presentation date： 2019.10

  • Modeling of free-space optical links and error rate in rain

    K. Futami, G. Hosoya, H. Yashima

    2019 IEEE International Conference on Space Optical Systems and Applications 

    Presentation date： 2019.10

  • 2-Input/3-Input all-optical switchable AND/NOR logic gate

    A. Nabeyama, K. Komatsu, G. Hosoya, H. Yashima

    OSA Advanced Photonics 2019 

    Presentation date： 2019.07

  • Reduced-complexity list decoding of polar codes using parity check and list-pruning

    Y. Oki, R. Shibata, G. Hosoya, H. Yashima

    Croucher Summer Course in Information Theory 2019 

    Presentation date： 2019.07

  • Reduced-Complexity Successive Cancellation List Decoding of Polar Codes Using Parity Check and List-Pruning

    Y. Oki, R. Shibata, G. Hosoya, H. Yashima

    Technical Committee Workshops on Information Theory 

    Presentation date： 2019.05

  • 豪雨時光無線通信路の光強度減衰特性

    二見 恭平, 細谷 剛, 八嶋弘幸

    2019年電子情報通信学会総合大会  (東京，早稲田大学) 

    Presentation date： 2019.03

  • RZ-BPSK信号を入力とするAND/NOR切替機能付き全光論理回路

    鍋山 昂, 古松 幸輔, 細谷 剛, 八嶋弘幸

    2019年電子情報通信学会総合大会  (東京，早稲田大学) 

    Presentation date： 2019.03

  • 2次元消失モデルにおけるProgressive Edge-Growthアルゴリズムを用いた非正則LDPC符号の構成法性

    鈴木 優太朗, 柴田 凌, 細谷 剛, 八嶋弘幸

    2019年電子情報通信学会総合大会  (東京，早稲田大学) 

    Presentation date： 2019.03

  • Simulation of All-Optical OR Gate Using Quantum-Dot Semiconductor Optical Amplifier

    K. Komatsu, G. Hosoya, H. Yashima

    2019 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing  (Hawaii, U.S.A.) 

    Presentation date： 2019.03

  • 2次元消失モデルにおけるLDPC符号

    細谷 剛

    第3回情報理論と符号理論の応用ワークショップ  (久高島, 沖縄) 

    Presentation date： 2019.02

  • 擬似乱数系列と空間結合LDPC符号を用いたビット置換符号化変調に対するシェーピング

    由利 昌司, 柴田 凌, 細谷 剛, 八嶋弘幸

    第41回情報理論とその応用シンポジウム  (いわき, 福島) 

    Presentation date： 2018.12

  • 二次元消失通信路におけるProgressive Edge-Growthアルゴリズムを用いた非正則LDPC符号の構成法

    鈴木 優太朗, 柴田 凌, 細谷 剛, 八嶋弘幸

    第41回情報理論とその応用シンポジウム  (いわき, 福島) 

    Presentation date： 2018.12

  • レーストラックメモリにおけるスライド窓復号法

    橋本 大輝, 柴田 凌, 細谷 剛, 八嶋弘幸

    第41回情報理論とその応用シンポジウム  (いわき, 福島) 

    Presentation date： 2018.12

  • Joint Optimization of Protograph-Based LDPC Coded System for Position Errors in Racetrack Memories

    R. Shibata, G. Hosoya, H. Yashima

    41th Symposium on Information Theory and its Applications  (Iwaki, Fukushima) 

    Presentation date： 2018.12

  • Expect ripple sizeを考慮したLT符号の次数分布設計

    石山 巧, 柴田 凌, 細谷 剛, 八嶋弘幸

    第41回情報理論とその応用シンポジウム  (いわき, 福島) 

    Presentation date： 2018.12

  • A study on decoding performance of nonbinary LDPC codes on two-dimensional array erasure model

    G. Hosoya

    41th Symposium on Information Theory and its Applications  (Iwaki, Fukushima) 

    Presentation date： 2018.12

  • Multiple-input all-optical OR gate by cascaded logic gates based on quantum-dot semiconductor optical amplifier

    K. Komatsu, G. Hosoya, H. Yashima

    Latin America & Optics and Photonics Conference  (Lima, Peru) 

    Presentation date： 2018.11

  • Structured concatenation of protograph LDPC codes and markers for Insertion/Deletion channels

    R. Shibata, G. Hosoya, H. Yashima

    2018 International Symposium on Information Theory and its Applications  (Singapore, Singapore) 

    Presentation date： 2018.10

  • Probabilistic shaping for BICM with pseudorandom sequence

    M. Yuri, R. Shibata, G. Hosoya, H. Yashima

    2018 International Symposium on Information Theory and its Applications  (Singapore, Singapore) 

    Presentation date： 2018.10

  • Improved LT code degree distribution and its performance evaluation

    T. Ishiyama, R. Shibata, G. Hosoya, H. Yashima

    2018 International Symposium on Information Theory and its Applications  (Singapore, Singapore) 

    Presentation date： 2018.10

  • Channel model divided into cylinder for free-space optical links in rain

    K. Futami, G. Hosoya, H. Yashima

    2018 International Symposium on Information Theory and its Applications  (Singapore, Singapore) 

    Presentation date： 2018.10

  • All-optical two-bit magnitude comparator using quantum-dot semiconductor optical amplifier

    K. Komatsu, G. Hosoya, H. Yashima

    Proc. Asia Communications and Photonics Conference  (Hangzhou, China) 

    Presentation date： 2018.10

  • 連続ポアソン分布を用いた降雨時光無線通信路の光強度減衰特性

    二見 恭平, 細谷 剛, 八嶋弘幸

    2018年電子情報通信学会ソサエティ大会  (金沢，金沢大学) 

    Presentation date： 2018.09

  • 160Gb/sで動作する量子ドット半導体光増幅器を用いた全光ORゲート

    古松 幸輔, 細谷 剛, 八嶋弘幸

    2018年電子情報通信学会ソサエティ大会  (金沢，金沢大学) 

    Presentation date： 2018.09

  • ポジションエラーに対するプロトグラフLDPC符号の設計

    柴田凌, 細谷剛, 八嶋弘幸

    第7回誤り訂正符号のワークショップ  (岩手) 

    Presentation date： 2018.09

  • Codes Correcting Limited-Shift Errors in Racetrack Memories

    細谷剛

    第7回誤り訂正符号のワークショップ  (岩手) 

    Presentation date： 2018.09

  • 次数分布を改良したLT符号の提案と性能評価

    石山 巧, 柴田 凌, 細谷 剛, 八嶋 弘幸

    電子情報通信学会情報理論研究会  (奈良) 

    Presentation date： 2018.07

  • 擬似乱数系列を用いたビット置換符号化変調に対するシェーピング

    由利昌司, 柴田 凌, 細谷 剛, 八嶋 弘幸

    電子情報通信学会情報理論研究会  (奈良) 

    Presentation date： 2018.07

  • Performance analysis of spatially-coupled low-density parity-check codes based on reading ratio in racetrack memory

    R. Shibata, G. Hosoya, H. Yashima

    2018 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing  (Hawaii, U.S.A.) 

    Presentation date： 2018.03

  • All-optical AND gate with photonic crystal quantum-dot semiconductor optical amplifiers

    T. Matsumoto, G. Hosoya, H. Yashima

    2018 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing  (Hawaii, U.S.A.) 

    Presentation date： 2018.03

  • レーストラックメモリにおける空間結合LDPC符号の性能解析

    柴田 凌, 細谷 剛, 八嶋弘幸

    第40回情報理論とその応用シンポジウム  (新発田) 

    Presentation date： 2017.11

  • Analysis of Spatially-Coupled Low-Density Parity-Check Codes on Two-Dimensional Array Erasure Channel

    G. Hosoya, H. Yashima

    40th Symposium on Information Theory and its Applications  (Shibata, Niigata) 

    Presentation date： 2017.11

  • Spatially-coupled LDPC codes for two dimensional erasure channel

    G. Hosoya, H. Yashima

    2017 IEEE Information Theory Workshop  (Kaohsiung, Taiwan) 

    Presentation date： 2017.11

  • IDS通信路における誤り訂正符号化と最近の研究動向

    細谷 剛

    2017年電子情報通信学会ソサイエティ大会  (東京，東京都市大学) 

    Presentation date： 2017.09

  • レーストラックメモリに対する低密度パリティ検査符号の復号法

    柴田 凌, 細谷 剛, 八嶋 弘幸

    電子情報通信学会情報理論研究会  (山口) 

    Presentation date： 2017.09

  • Simulation of all-optical NOR gate

    K. Komatsu, G. Hosoya, H. Yashima

    CLEO PR, OECC & PGC 2017  (Singapore) 

    Presentation date： 2017.07

  • QD-SOA-MZIで構成した光ハードリミッタ

    宇治 佳紀, 細谷 剛, 八嶋弘幸

    2016年電子情報通信学会総合大会  (名古屋，名城大学) 

    Presentation date： 2017.03

  • 1つのQD-SOAと光フィルタを用いた全光NORゲート

    古松 幸輔, 細谷 剛, 八嶋弘幸

    2016年電子情報通信学会総合大会  (名古屋，名城大学) 

    Presentation date： 2017.03

  • Interference suppression in an SSFBG OCDMA using a QD-SOA-based MZI

    M. Nishino, G. Hosoya, H. Yashima

    2017 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing  (Guam, U.S.A.) 

    Presentation date： 2017.02

  • A novel constellation shaping scheme using pilot bit for bit-interleaved coded modulation

    Y. Taniguchi, G. Hosoya, H. Yashima

    2017 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing  (Guam, U.S.A.) 

    Presentation date： 2017.02

  • OCDMAにおけるQD-SOAで構成した干渉抑圧

    西野 真弘, 細谷 剛, 八嶋 弘幸

    電子情報通信学会光通信システム研究会  (福岡) 

    Presentation date： 2017.01

  • Fixed-symbols-based synchronization for insertion/deletion/substitution channels

    R. Shibata, G. Hosoya, H. Yashima

    2016 International Symposium on Information Theory and its Applications  (Monterey, CA, USA) 

    Presentation date： 2016.10

  • Constellation shaping with pilot bit for bit-interleaved coded modulation

    Y. Taniguchi, G. Hosoya, H. Yashima

    2016 International Symposium on Information Theory and its Applications  (Monterey, CA, USA) 

    Presentation date： 2016.10

  • Constellation shaping for non-uniform signals based on truncated Gaussian distribution

    G. Hosoya, H. Yashima

    2016 International Symposium on Information Theory and its Applications  (Monterey, CA, USA) 

    Presentation date： 2016.10

  • SSFBGを用いたOCDMAにおけるQD-SOA-MZIで構成した干渉除去デバイス

    西野 真弘, 細谷 剛, 八嶋弘幸

    2016年電子情報通信学会ソサエティ大会  (札幌，北海道大学) 

    Presentation date： 2016.09

  • ビット置換符号化変調に対するパイロットビットを用いたシェーピング手法の提案

    谷口 裕暉, 細谷 剛, 八嶋 弘幸

    電子情報通信学会情報理論研究会  (佐賀) 

    Presentation date： 2016.09

  • IDS通信路における確定シンボルを用いた同期処理法

    柴田凌, 細谷剛, 八嶋弘幸

    第5回誤り訂正符号のワークショップ  (佐賀) 

    Presentation date： 2016.08

  • Insertion/Deletion/Substitution通信路に対する確定シンボルを用いた同期処理法

    柴田 凌, 細谷 剛, 八嶋 弘幸

    電子情報通信学会情報理論研究会  (東京) 

    Presentation date： 2016.03

  • All-optical NOR gate using XPM and XGM in QD-SOA based MZI

    F. Sato, G. Hosoya, H. Yashima

    2016 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing  (Honolulu, Hawaii) 

    Presentation date： 2016.03

  • All-optical error correcting system using (7,4) Hamming code

    K. Iwamoto, G. Hosoya, H. Yashima

    2016 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing  (Honolulu, Hawaii) 

    Presentation date： 2016.03

  • All Optical error correcting system using horizontal and vertical parity checks

    T. Matsumoto, G. Hosoya, H. Yashima

    2016 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing  (Honolulu, Hawaii) 

    Presentation date： 2016.03

  • All optical CDMA using all optical device

    M. Nishino, G. Hosoya, H. Yashima

    2016 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing  (Honolulu, Hawaii) 

    Presentation date： 2016.03

  • Constellation shaping for non-uniform signals in bit-interleaved coded modulation combined with multi-stage decoding

    G. Hosoya, H. Yashima

    2016 Australian Communications Theory Workshop  (Melbourne, Australia) 

    Presentation date： 2016.01

  • All-Optical OFDM receiver using Odd-Even separator based on double Mach-Zender interferometers and optical switching

    Y. Furuya, G. Hosoya, H. Yashima

    2015 International Workshop on Vision, Communications and Circuits  (Yokohama, Japan) 

    Presentation date： 2015.10

  • 干渉期間をシフトした2つのFSR-MZIを用いる全光OFDM受信機

    吉田光範, 原田裕生, 細谷 剛, 八嶋弘幸

    2015年電子情報通信学会ソサエティ大会  (仙台市，東北大学) 

    Presentation date： 2015.09

  • QD-SOAにおけるXPMとXGMを用いた全光NORゲート

    佐藤文也, 細谷 剛, 八嶋弘幸

    2015年電子情報通信学会ソサエティ大会  (仙台市，東北大学) 

    Presentation date： 2015.09

  • An improvement of approximate BP decoding

    G. Hosoya, H. Yashima

    2014 International Symposium on Information Theory and its Applications  (Melbourne, Australia) 

    Presentation date： 2014.10

  • Multiple connected optical hard limiter and optical power equalizer using Quantum-Dot semiconductor

    K. Iwamoto, F. Sato, Y. Furuya, T. Irie, G. Hosoya, H. Yashima

    2014 International Symposium on Nonlinear Theory and its Applications  (Luzern, Switzerland) 

    Presentation date： 2014.09

  • All-Optical AND gate using optical hard limiter with QD-SOA based on self-phase modulation

    F. Sato, K. Iwamoto, Y. Furuya, T. Irie, G. Hosoya, H. Yashima

    2014 International Symposium on Nonlinear Theory and its Applications  (Luzern, Switzerland) 

    Presentation date： 2014.09

  • All optical NOR gate using QD-SOA based on cross gain modulation

    K. Ogawa, Y. Furuya, T. Irie, G. Hosoya, H. Yashima

    Optics & Photonics Taiwan, the International Conference 2013  (Taipei, R.O.C.) 

    Presentation date： 2013.12

  • 8-input all-optical XOR circuit using QD-SOA-Based MZIs and AOWCs

    T. Irie, G. Hosoya, H. Yashima

    Optics & Photonics Taiwan, the International Conference 2013  (Taipei, R.O.C.) 

    Presentation date： 2013.12

  • 疑似乱数による符号を用いた CDMA システムの BER 特性評価

    寺尾優史, 細谷剛, 八嶋弘幸

    第36回情報理論とその応用シンポジウム  (静岡) 

    Presentation date： 2013.11

  • QD-SOAを用いたXGM型全光NORゲート

    古谷侑茉, 小川顕太郎, 入江孝憲, 細谷剛, 八嶋弘幸

    2013年電子情報通信学会ソサエティ大会  (福岡) 

    Presentation date： 2013.09

  • QD-SOA MZIと全光波長変換器を用いた8入力全光XOR回路

    入江孝憲, 細谷剛, 八嶋弘幸

    2013年電子情報通信学会ソサエティ大会  (福岡) 

    Presentation date： 2013.09

  • Residual energy and distance-aware clustering protocol in wireless sensor network

    K. Tabata, G. Hosoya, H. Yashima

    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13)  (Isrand of Hawaii) 

    Presentation date： 2013.03

  • Rate-compatible punctured low-density parity-check codes consisting of two subgraphs

    G. Hosoya, K. Osada, M. Goto

    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13)  (Isrand of Hawaii) 

    Presentation date： 2013.03

  • Performance analysis of OCDMA with the bursty effects of multiple user interference

    H. Terao, G. Hosoya, M. Hasegawa, H. Yashima

    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13)  (Isrand of Hawaii) 

    Presentation date： 2013.03

  • MMSE-FDE-STBC with channel frequency response and noise variance estimation for cooperative relay networks

    R. Sasaki, G. Hosoya, H. Yashima

    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13)  (Isrand of Hawaii) 

    Presentation date： 2013.03

  • Convolutional coded optical CDMA using code shift keying

    S. Hata, G. Hosoya, H. Yashima

    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13)  (Isrand of Hawaii) 

    Presentation date： 2013.03

  • Log-Likelihood ratio calculation for iterative decoding on Rayleigh fading channels using Padé approximation"

    G. Hosoya, H. Yashima

    35th Symposium on Information Theory and its Application (SITA2012)  (Oita) 

    Presentation date： 2012.12

  • Multi-valued document classification based on generalized Bradley-Terry classifiers utilizing accuracy information"

    T. Ogiwara, K. Mikawa, G. Hosoya, M. Goto

    13th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS2013)  (Phuket) 

    Presentation date： 2012.12

  • LLR calculation for iterative decoding on fading channels using Padé approximation

    G. Hosoya, M. Hasegawa, H. Yashima

    2012 International Conference on Wireless Communications and Signal Processing (WCSP2012)  (Huanshan, China) 

    Presentation date： 2012.10

  • LLR calculation for iterative decoding on Rayleigh fading channels using Padé approximatio"

    G. Hosoya, M. Hasegawa, H. Yashima

    IEICE Technical Report  (Kusatsu) 

    Presentation date： 2012.09

  • On the capacity of fingerprinting codes against unknown size of colluders

    G. Hosoya, H. Yagi, M. Kobayashi, S. Hirasawa

    7th International Conference of Information Assurance and Security  (Malacca, Malaysia) 

    Presentation date： 2011.12

  • The capacity of fingerprinting codes against several attack classes with unknown size of colluders

    G. Hosoya, H. Yagi, M. Kobayashi, S. Hirasawa

    34th Symposium on Information Theory and its Applications (SITA2011)  (Iwate) 

    Presentation date： 2011.11

  • Multivalued document classification by maximization of posterior probability based on relevance vector machine

    R. Odai, G. Kumoi, K. Mikawa, G. Hosoya, M. Goto

    12th Asia Pacitic Industrial Engineering of Management System Conference  (Beijin, China) 

    Presentation date： 2011.10

  • A study on automatic summarization of customer reviews based on maximum coverage problem

    T. Takemura, M. Kumoi, G. Hosoya, M. Goto

    12th Asia Pacitic Industrial Engineering of Management System Conference  (Beijin, China) 

    Presentation date： 2011.10

  • 検査行列の構造を利用したLDPC符号のパンクチャ法に関する一考察

    長田佳史, 細谷剛, 後藤正幸

    第10回情報科学技術フォーラム (FIT2011)  (函館) 

    Presentation date： 2011.09

  • 二元対称消失通信路におけるビット反転復号法の改善

    石橋想太郎, 長田佳史, 細谷剛, 後藤正幸

    第10回情報科学技術フォーラム (FIT2011)  (函館) 

    Presentation date： 2011.09

  • 一般化LDPC符号に対する効率的な符号化法

    寺本 賢一, 細谷 剛, 後藤 正幸, 平澤 茂一

    電子情報通信学会技術研究報告  (奈良) 

    Presentation date： 2011.01

  • An improvement of layered BP decoding algorithm for rate-compatible punctured LDPC codes

    G. Hosoya, H. Yagi, M. Kobayashi

    IEICE Technical Report, vol.110, no.363, IT2010-66, pp.73--78  (Nara) 

    Presentation date： 2011.01

  • 2元系列のメッセージを用いたビット反転復号法の改良

    谷口 祐樹, 細谷 剛, 後藤 正幸, 平澤 茂一

    電子情報通信学会技術研究報告  (奈良) 

    Presentation date： 2011.01

  • Insertion/Deletion/Substitution 通信路に対する LDPC 符号の復号法

    小林 学, 細谷 剛, 八木 秀樹, 平澤 茂一

    第33回情報理論とその応用シンポジウム  (松代) 

    Presentation date： 2010.11

  • An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates

    G. Hosoya, H. Yagi, M. Kobayashi

    2010 International Symposium on Information Theory and its Applications  (Taichung, Taiwan) 

    Presentation date： 2010.10

  • 高符号化率までパンクチャ可能なLDPC符号に関する一考察

    長田 佳史, 寺本 賢一, 細谷 剛, 後藤 正幸

    電子情報通信学会技術研究報告  (東京) 

    Presentation date： 2010.07

  • A note on analysing LDPC codes for correcting a burst erasure

    細谷 剛, 松嶋 敏泰, 平澤 茂一

    IEICE Technical Report, vol.109, no.357, IT2009-52, pp.7--10  (ハワイ大学) 

    Presentation date： 2010.01

  • 符号化率が適応的に可変で確定的に構成したパンクチャド LDPC 符号の性能

    細谷 剛, 松嶋 敏泰, 平澤 茂一

    第32回情報理論とその応用シンポジウム  (山口) 

    Presentation date： 2009.11

  • 一般化LDPC符号に対する部分符号の構造を利用した効率的な符号化法

    寺本 賢一, 細谷 剛, 後藤 正幸, 平澤 茂一

    電子情報通信学会技術研究報告  (東京) 

    Presentation date： 2009.07

  • メッセージ伝播型復号法に効果的な非正則LDPC符号の構成法と復号順序の決定法

    谷口 祐樹, 細谷 剛, 後藤 正幸, 平澤 茂一

    電子情報通信学会技術研究報告  (東京) 

    Presentation date： 2009.07

  • グラフを組み合わせたLDPC符号アンサンブルに対する最小スパンの解析

    石川 祐臣, 佐藤 芳行, 細谷 剛, 平澤 茂一

    電子情報通信学会技術研究報告  (Hakodate) 

    Presentation date： 2009.03

  • Group Shuffled BP復号法に対する非正則LDPC符号の次数分布を考慮した効果的なグループ分割法

    佐藤 芳行, 細谷 剛, 平澤 茂一

    電子情報通信学会技術研究報告  (Hakodate) 

    Presentation date： 2009.03

  • Constructions of Irregular LDPC codes for a burst erasure

    G. Hosoya, T. Matsushima, S. Hirasawa

    IEICE Technical Report, vol.108, no.472, IT2008-111, pp.447--452  (Hakodate) 

    Presentation date： 2009.03

  • Construction and performance analysis of irregular low-density parity-check code ensemble for correcting a single solid burst erasure

    G. Hosoya, T. Matsushima, S. Hirasawa

    Pre-ICM International Convention on Mathematical Sciences  (Delhi, India) 

    Presentation date： 2008.12

  • 次数分布を考慮した非正則LDPC符号に対するReplica Shuffled BP復号法

    佐藤 芳行, 細谷 剛, 八木 秀樹, 平澤 茂一

    第31回情報理論とその応用シンポジウム  (鬼怒川, 栃木) 

    Presentation date： 2008.10

  • ソリッドバースト消失の訂正に適した非正則LDPC 符号の構成について

    細谷 剛, 松嶋 敏泰, 平澤 茂一

    第31回情報理論とその応用シンポジウム  (鬼怒川, 栃木) 

    Presentation date： 2008.10

  • オイラーベクトルの特性を利用した局所的に改変された画像の検出手法

    藤田 雄大, 細谷 剛, 八木 秀樹, 平澤 茂一

    第31回情報理論とその応用シンポジウム  (鬼怒川, 栃木) 

    Presentation date： 2008.10

  • 一般化LDPC符号に対するBF復号法の修正とその性能解析

    金井 貴大, 細谷 剛, 八木 秀樹, 平澤 茂一

    2008年電子情報通信学会ソサエティ大会  (神奈川) 

    Presentation date： 2008.09

  • 元画像との差分ベクトルを特徴量とした学習による改変画像検出

    佐野 利行, 細谷 剛, 八木 秀樹, 平澤 茂一

    電子情報通信学会技術研究報告  (北海道) 

    Presentation date： 2008.02

  • JPEG2000のビットプレーンを用いたテクスチャ画像の検索

    野口 達也, 細谷 剛, 八木 秀樹, 平澤 茂一

    第59回オーディオビジュアル複合情報処理研究発表会  (名古屋) 

    Presentation date： 2007.12

  • Group Shuffled BP 復号法における効果的な分割法

    佐藤 芳行, 細谷 剛, 八木 秀樹, 平澤 茂一

    30th Symposium on Information Theory and its Applications (SITA2007)  (Kashiko-jima Mie) 

    Presentation date： 2007.11

  • A combined matrix ensemble of low-density parity-check codes for a solid burst erasure

    G. Hosoya, T. Matsushima, S. Hirasawa

    30th Symposium on Information Theory and its Applications (SITA2007)  (Kashiko-jima Mie) 

    Presentation date： 2007.11

  • An adaptive decoding algorithm of LDPC codes over the binary erasure channel

    G. Hosoya, H. Yagi, T. Matsushima, S. Hirasawa

    2007 Hawaii and SITA Joint Conference on Information Theory (HISC2007), pp.154--159  (Hawaii, U.S.A) 

    Presentation date： 2007.05

  • Shuffled BP復号法に対する探索的なシンボルノードのグループ分割法

    佐藤 芳行, 細谷 剛, 八木 秀樹, 平澤 茂一

    電子情報通信学会技術研究報告  (米沢) 

    Presentation date： 2007.05

  • 静止画像圧縮における適応型予測木の改良

    小俣 順, 細谷 剛, 平澤 茂一

    29th Symposium on Information Theory and its Applications (SITA2006)  (Hakodate, Hokkaido) 

    Presentation date： 2006.11

  • 信頼度更新を用いたLDPC符号のBit-Flipping復号法の改良

    長谷川 裕, 細谷 剛, 八木 秀樹, 平澤 茂一

    29th Symposium on Information Theory and its Applications (SITA2006)  (Hakodate, Hokkaido) 

    Presentation date： 2006.11

  • カラー成分間の相関を利用したSPIHTアルゴリズムによる静止画像圧縮

    金田 海渡, 細谷 剛, 平澤 茂一

    29th Symposium on Information Theory and its Applications (SITA2006)  (Hakodate, Hokkaido) 

    Presentation date： 2006.11

  • On correctable burst-erasure lengths for LDPC codes with column permuted parity-check matrices

    G. Hosoya, H. Yagi, T. Matsushima, S. Hirasawa

    29th Symposium on Information Theory and its Applications (SITA2006)  (Hakodate, Hokkaido) 

    Presentation date： 2006.11

  • Performance of low-density parity-check codes for burst erasures

    G. Hosoya, H. Yagi, T. Matsushima, S. Hirasawa

    2006 International Symposium on Information Theory and its Applications  (Seoul, Korea) 

    Presentation date： 2006.10

  • A modification method for constructing low-density parity-check codes for burst erasures

    G. Hosoya, H. Yagi, T. Matsushima, S. Hirasawa

    IEICE Technical Report, vol.105, no.662, IT2005-121, pp.153--158  (Nagoya) 

    Presentation date： 2006.03

  • 適合文書から抽出した重要語に基づく文書検索

    松下 大輔, 細谷 剛, 平澤 茂一

    第28回情報理論とその応用シンポジウム  (Okinawa) 

    Presentation date： 2005.11

  • 単語の潜在的意味空間に基づく文書分類

    山岸 英貴, 細谷 剛, 平澤 茂一

    第28回情報理論とその応用シンポジウム  (Okinawa) 

    Presentation date： 2005.11

  • 信頼度更新を用いたLDPC符号のWeighted Bit-Flipping復号法

    佐藤 匡, 細谷 剛, 八木 秀樹, 平澤 茂一

    第28回情報理論とその応用シンポジウム  (Okinawa) 

    Presentation date： 2005.11

  • A decoding algorithm of low-density parity-check codes using decisions of erasure correcting

    G. Hosoya, T. Matsushima, S. Hirasawa

    28th Symposium on Information Theory and its Applications (SITA2005)  (Okinawa) 

    Presentation date： 2005.11

  • LDPC符号の消失訂正と誤り訂正の関係

    細谷 剛, 松嶋 敏泰, 平澤 茂一

    電子情報通信学会技術研究報告, vol.105, no.311, IT2005-53, pp.13--17  (Aizu) 

    Presentation date： 2005.09

  • トレリスの枝削除によるq元ターボ復号の計算量低減

    長谷川 裕, 細谷 剛, 八木 秀樹, 平澤 茂一

    電子情報通信学会技術研究報告  (大阪) 

    Presentation date： 2005.07

  • ドキュメントの特徴を考慮した非階層的クラスタリング

    渡辺 祐介, 細谷 剛, 平澤 茂一

    第27回情報理論とその応用シンポジウム  (下呂，岐阜) 

    Presentation date： 2004.12

  • ソート・マッチング法に基づく軟判定復号アルゴリズムの修正

    贄田 里詩, 細谷 剛, 八木 秀樹, 平澤 茂一

    第27回情報理論とその応用シンポジウム  (下呂，岐阜) 

    Presentation date： 2004.12

  • A decoding method of low-density parity-check codes over the binary erasure channel

    G. Hosoya, T. Matsushima, S. Hirasawa

    27th Symposium on Information Theory and its Applications (SITA2004), pp.263--266  (Gero) 

    Presentation date： 2004.12

  • Modification method of construction and performance analysis of low-density parity-check codes over the Markov-modulated channel

    G. Hosoya, H. Yagi, S. Hirasawa

    2004 International Symposium on Information Theory and its Applications  (Parma, Italy) 

    Presentation date： 2004.10

  • 確率伝播型復号法に適した低密度パリティ検査符号巡回型LDPC符号の短縮化法

    贄田 里詩, 細谷 剛, 八木 秀樹, 平澤 茂一

    電子情報通信学会技術研究報告  (京都) 

    Presentation date： 2003.07

  • バースト誤り通信路に適した低密度パリティ検査符号の構成法

    細谷 剛, 八木 秀樹, 小林 学, 平澤 茂一

    電子情報通信学会技術研究報告, vol.103, no.214, IT2003-20, pp.61--66  (京都) 

    Presentation date： 2003.07

  • 隠れマルコフ型雑音通信路に対する低密度パリティ検査符号の復号に関する一考察

    細谷 剛, 八木 秀樹, 小林 学, 平澤 茂一

    電子情報通信学会技術研究報告, IT2002-23, vol.102, no.198, pp.19--24  (東京) 

    Presentation date： 2002.07

▼display all

Research Projects

  • Development of Coding Schemes for Position Errors

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (C)

    Project Year :

    2019.04
    -
    2022.03
     

  • 線形符号・LDPC符号を用いた判定帰還方式における誤り指数と計算量の削減について

    日本学術振興会  科学研究費助成事業 基盤研究(C)

    Project Year :

    2017.04
    -
    2020.03
     

    新家 稔央, 八木 秀樹, 細谷 剛

    　View Summary

    情報理論（通信路符号化）の分野では，従来，誤り指数(error exponent)によって表現される符号化定理が研究されてきた．誤り指数が導出できれば，同一の情報伝送速度のもとで，復号誤り確率と計算量の関係を明確にすることが可能となる．本研究では帰還通信路を用いた判定帰還（ARQ）方式において，LDPC符号など符号クラス，通信路・復号法・判定帰還方式の判定基準を与え，誤り指数の導出および有限の符号長における誤り確率上界の導出を試みる．そして，精密に誤り確率を評価した結果を踏まえ，帰還通信路を用いることによって可能な復号計算量削減の効果が，従来研究よりも大きくなることを明らかにする．計算量の削減効果は携帯端末の消費電力の低減を評価する意味で重要である．
    2017年度は，Forneyの提案した最適な判定基準を用いた場合の誤り確率の上界式を精密化した．これに対し2018年度は，これを簡略化した準最適な判定基準を用いた場合の誤り確率の上界式に対する精密な評価を与えた．ここで，用いる簡略的な判定基準として[Hashimoto99]の判定基準を利用した．そして，準最適な判定基準を用いた場合についても，[Forney69]の基準と同等の性能が達成できることを，線形符号やLDPC符号の実用的な符号を用いて示すことができた．この結果を国際会議にて発表，ならびに電子情報通信学会英文論文誌Aに投稿した．
    [Hashimoto99] T. Hashimoto, ``Composite scheme LR + Th for decoding with erasures and its effective equivalence to Forney's rule,'' IEEE Trans. Inform. Theory, vol.45, no.1, pp.78--93, Jan. 1999.

  • 干渉抑圧機能とセキュリティ機能を有する全光CDMA

    日本学術振興会  科学研究費助成事業 基盤研究(C)

    Project Year :

    2017.04
    -
    2020.03
     

    八嶋 弘幸, 細谷 剛, 五十嵐 保隆

    　View Summary

    全光通信に向けて電気信号への変換を伴わない全光信号処理や全光信号処理を行う光CDMAが注目されている。光CDMAシステムにおいて，全光デバイスからなる干渉抑圧器を提案した。提案した干渉抑圧器はマッハツェンダー干渉計の両アームに量子ドット光増幅器をそれぞれ配したものであり、波動方程式とレート方程式を数値解析することにより量子ドット光増幅器の動作を解析し、提案する干渉抑圧器が閾値処理機能を有する全光機能デバイスとして動作することを確認した。シミュレーションによりランダムデータを送信し受信信号からアイパターンを求め動作を確認した。また提案デバイスが全光CDMAに適用可能か検証するため、光CDMAのクロックと信号のタイミングのずれの影響も評価した。また、光CDMAの干渉を除去するデバイスとして、全光信号処理の実現のための最も基本的な素子として全光NORゲートがある。本研究では、量子ドット半導体 光増幅器の内部で生じる非線形光学効果を用いた全光NORゲートを構築し、シミュレーションにより性能評価を行った。
    これらに加えて、光CDMA信号の受信後の信号処理デバイスとして、多入力の全光OR回路を提案し、簡単な構成で、かつ高品質で動作することを確認した。このデバイスにより、受信後の光信号処理部において、回路が簡略化することができる。一方、セキュリティ対策として、暗号分野で注目を集めている超軽量暗号に着目し、超軽量ブロック暗号QTL-64の不能差分攻撃耐性の評価を行った。

  • High Efficient Coded Modulation Schemes Using Error Correcting Codes

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Young Scientists (B)

    Project Year :

    2016.04
    -
    2019.03
     

    Hosoya Gou

    　View Summary

    In this program, we first propose a constellation shaping scheme for amplitude phase shift keying (APSK) with Bit-Interleaved Coded Modulation (BICM). We propose two schemes, i.e. using pilot bits and a novel probabilistic shaping scheme with pseudorandom sequence which are concatenated with an input sequence of the encoder. Simulation results show that our proposed schemes can achieve better performance over additive white Gaussian noise (AWGN) channel compared with conventional scheme.
    We also consider a coded modulation for the AWGN channel. Instead of applying Gaussian distribution, we take the truncated Gaussian distribution in the design of signal constellations. We study peak-to-average power ratio (PAPR) reduction for one-dimensional signal constellation. From the numerical results, we show that achievable rate of the proposed modulation is almost identical to the Gaussian constellation, while keeping the expansion of PAPR small.

  • High Security Optical CDMA Using Chaotic sequence codes

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (C)

    Project Year :

    2013.04
    -
    2016.03
     

    Yashima Hiroyuki, HOSOYA Gou

    　View Summary

    We propose new Optical Code-Division-Multiple-Access (OCDMA) systems using Extended Chaotic Binary Codes (ECBCs) obtained easily from the extended Bernoulli map. Unlike conventional sequence codes, ECBCs are composed by the map for every information bit, which means that the sequence code varies bit by bit. Therefore, high security against eavesdroppers is expected. Then, we derive the expression for theoretical BER versus the number of simultaneous users of the proposed system and verify that the proposed system is effective in OCDMA system through numerical results.
    Moreover, we derive BER of OCDMA based on the persistence of MAI, by considering the transition of the interfering users as Markov chain process. From the numerical analysis, the derived BER differs substantially from conventional analysis. We show that the derived BER strongly depends on the initial number of interfering users.

  • Design and Analysis for Rate-Compatible Punctured LDPC Codes

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Young Scientists (B)

    Project Year :

    2013.04
    -
    2016.03
     

    HOSOYA GOU

    　View Summary

    Coding and decoding schemes for rate-compatible punctured low-density parity-check (LDPC) codes have been developed. The main results are as follows: (i) We proposed a new class of LDPC codes which consist of subgraphs. The codes guarantee the number of recoverable punctured bits. We proposed the puncturing schemes for the proposed codes. By performing the Gaussian approximation, we have derived the optimal puncturing distribution for each coding rate and have shown that iterative threshold of the proposed codes are greater than those of the conventional codes. (ii) We proposed a new belief-propagation (BP) decoding algorithm for rate-compatible LDPC codes which enables to calculate more accurate a posterior probability even if the loops of Tanner graph exist.

  • 疎行列に基づく符号化率が可変な誤り訂正符号の設計および解析

    Project Year :

    2009
    -
    　
     

  • Design and analysis of rate-compatible error correcting codes based on sparse matrices

    Project Year :

    2009
    -
    　
     

  • バースト消失通信路に適した低密度パリティ検査符号の構成と解析

    Project Year :

    2008
    -
    2009
     

  • Construction and performance analysis low-density parity-check codes for correcting burst erasure

    Project Year :

    2008
    -
    2009
     

  • Improvement and theoretical analysis of belief-propagation algorithm for information-communication technology

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Young Scientists (Start-up)

    Project Year :

    2008
    -
    2009
     

    HOSOYA Gou

▼display all

Misc

  • 二乗ユークリッド距離の調和平均に基づいた符号化変調容量を達成する変調法

    細谷 剛

    電子情報通信学会技術研究報告   123 ( 14 ) 49 - 54  2023.05

    Authorship：Lead author

    Internal/External technical report, pre-print, etc.  

  • 符号化変調容量を達成する符号化変調法に関する一考察

    細谷 剛

    第45回情報理論とその応用シンポジウム予稿集(SITA2022)     109 - 114  2022.11

    Authorship：Lead author

    Research paper, summary (national, other academic conference)  

  • 遅延型ビット置換符号化変調のラベル付け法

    細谷 剛

    電子情報通信学会技術研究報告   122 ( 25 ) 44 - 49  2022.05

    Authorship：Lead author

    Internal/External technical report, pre-print, etc.  

  • A Study on Delayed Bit-Interleaved Coded Modulation

    G. Hosoya

    Proc. of 44th Symposium on Information Theory and Its Application     264 - 269  2021.12

    Authorship：Lead author

    Research paper, summary (national, other academic conference)  

  • Construction of Irregular Polar Code with Gaussian Approximation

    Yusuke Oki, Gou Hosoya, Hiroyuki Yashima

      119 ( 3766 ) 167 - 172  2020.01

    Research paper, summary (national, other academic conference)  

  • Simulation on application of QD-SOA to some all optical logic gates

    H. Yashima, K. Komatsu, G. Hosoya

    Proc. Inter-Photonics 2019 International Conference on Photonics Research    2019.11  [Refereed]  [Invited]

    Article, review, commentary, editorial, etc. (international conference proceedings)  

  • Concatenated LDPC/trellis codes: Surpassing symmetric information rate of insertion/deletion channels

    R. Shibata, G. Hosoya, H. Yashima

        95 - 100  2019.11

    Research paper, summary (national, other academic conference)  

  • Performance of Non-binary LDPC Codes for 2D Arrays

    G. Hosoya, T. Niinomi, H. Yashima

    42th Symposium on Information Theory and its Applications   42nd   89 - 94  2019.11

    Authorship：Lead author

    Research paper, summary (national, other academic conference)  

    J-GLOBAL

  • Shaping Method for Spatially Coupled LDPC Coded BICM with Pseudorandom Sequence

    M. Yuri, R. Shibata, G. Hosoya, H. Yashima

    42th Symposium on Information Theory and its Applications     603 - 608  2019.11

    Research paper, summary (national, other academic conference)  

  • Symbol Decomposition Algorithms with a Finite Window and Their Redundancy Analysis

    Y. Hashimoto, R. Shibata, G. Hosoya, H. Yashima

    42th Symposium on Information Theory and its Applications     517 - 522  2019.11

    Research paper, summary (national, other academic conference)  

  • Modeling of free-space optical links and error rate in rain

    K. Futami, G. Hosoya, H. Yashima

    2019 IEEE International Conference on Space Optical Systems and Applications    2019.10  [Refereed]

    Research paper, summary (international conference)  

  • 2-Input/3-Input all-optical switchable AND/NOR logic gate

    A. Nabeyama, K. Komatsu, G. Hosoya, H. Yashima

    OSA Advanced Photonics 2019    2019.07  [Refereed]

    Research paper, summary (international conference)  

  • Reduced-Complexity Successive Cancellation List Decoding of Polar Codes Using Parity Check and List-Pruning

    Y. Oki, R. Shibata, G. Hosoya, H. Yashima

      119 ( 47 ) 73 - 78  2019.05

    Research paper, summary (national, other academic conference)  

  • 豪雨時光無線通信路の光強度減衰特性

    二見 恭平, 細谷 剛, 八嶋弘幸

    2019年電子情報通信学会総合大会予稿集   1 ( 1 ) B12-12 - B12-12  2019.03

  • RZ-BPSK信号を入力とするAND/NOR切替機能付き全光論理回

    鍋山 昂, 古松 幸輔, 細谷 剛, 八嶋弘幸

    2019年電子情報通信学会総合大会予稿集   1 ( 1 ) B12-13 - B12-13  2019.03

  • 2次元消失モデルにおけるProgressive Edge-Growthアルゴリズムを用いた非正則LDPC符号の構成法性

    鈴木 優太朗, 柴田 凌, 細谷 剛, 八嶋弘幸

    2019年電子情報通信学会総合大会予稿集   1 ( 1 ) A-2-5 - A-2-5  2019.03

  • 擬似乱数系列と空間結合LDPC符号を用いたビット置換符号化変調に対するシェーピング

    由利 昌司, 柴田 凌, 細谷 剛, 八嶋 弘幸

    第41回情報理論とその応用シンポジウム予稿集     19 - 24  2018.12

  • Joint Optimization of Protograph-Based LDPC Coded System for Position Errors in Racetrack Memories

    R. Shibata, G. Hosoya, H. Yashima

    Proc. of 41th Symposium on Information Theory and its Applications     291 - 296  2018.12

  • A study on decoding performance of nonbinary LDPC codes on two-dimensional array erasure model

    G. Hosoya

    Proc. of 41th Symposium on Information Theory and its Applications     7 - 12  2018.12

  • 連続ポアソン分布を用いた降雨時光無線通信路の光強度減衰特性

    二見 恭平, 細谷 剛, 八嶋弘幸

    2018年電子情報通信学会ソサエティ大会予稿集   1 ( 1 ) B12-1 - B12-1  2018.09

  • 160Gb/sで動作する量子ドット半導体光増幅器を用いた全光ORゲート

    古松 幸輔, 細谷 剛, 八嶋弘幸

    2018年電子情報通信学会ソサエティ大会予稿集   1 ( 1 ) B12-2 - B12-2  2018.09

  • 次数分布を改良したLT符号の提案と性能評価

    石山 巧, 柴田 凌, 細谷 剛, 八嶋 弘幸

    電子情報通信学会技術報告   118 ( 139 ) 51 - 56  2018.07

  • 擬似乱数系列を用いたビット置換符号化変調に対するシェーピング

    由利 昌司, 柴田 凌, 細谷 剛, 八嶋 弘幸

    電子情報通信学会技術報告   118 ( 139 ) 45 - 50  2018.07

  • レーストラックメモリにおける空間結合LDPC符号の性能解析

    柴田 凌, 細谷 剛, 八嶋 弘幸

    第40回情報理論とその応用シンポジウム予稿集     529 - 535  2017.11

  • Analysis of spatially-coupled low-density parity-check codes on two-dimensional array erasure channel

    G. Hosoya, H. Yashima

    Proc. of 40th Symposium on Information Theory and its Applications     511 - 516  2017.11

  • レーストラックメモリに対する低密度パリティ検査符号の復号法

    柴田 凌, 細谷 剛, 八嶋 弘幸

    電子情報通信学会技術報告   117 ( 208 ) 37 - 42  2017.09

  • IDS通信路における誤り訂正符号化と最近の研究動向

    細谷 剛

    2017年電子情報通信学会ソサイエティ大会予稿集     AT-1-4-1 - AT-1-4-4  2017.09

  • QD-SOA-MZIで構成した光ハードリミッタ

    宇治 佳紀, 細谷 剛, 八嶋弘幸

    2016年電子情報通信学会総合大会予稿集   1 ( 1 ) B12-4 - B12-4  2017.03

  • 1つのQD-SOAと光フィルタを用いた全光NORゲート

    古松 幸輔, 細谷 剛, 八嶋弘幸

    2016年電子情報通信学会総合大会予稿集   1 ( 1 ) B12-5 - B12-5  2017.03

  • OCDMAにおけるQD-SOAで構成した干渉抑圧

    西野 真弘, 細谷 剛, 八嶋 弘幸

    電子情報通信学会技術報告   116 ( 402 ) 1 - 4  2017.01

  • ビット置換符号化変調に対するパイロットビットを用いたシェーピング手法の提案

    谷口 裕暉, 細谷 剛, 八嶋 弘幸

    電子情報通信学会技術報告   116 ( 206 ) 1 - 6  2016.09

  • SSFBGを用いたOCDMAにおけるQD-SOA-MZIで構成した干渉除去デバイス

    西野 真弘, 細谷 剛, 八嶋弘幸

    2016年電子情報通信学会ソサエティ大会予稿集   1 ( 1 ) B12-30 - B12-30  2016.09

  • Insertion/Deletion/Substitution通信路に対する確定シンボルを用いた同期処理法

    柴田 凌, 細谷 剛, 八嶋 弘幸

    電子情報通信学会技術報告   115 ( 500 ) 43 - 48  2016.03

  • 干渉期間をシフトした2つのFSR-MZIを用いる全光OFDM受信機

    吉田光範, 原田裕生, 細谷 剛, 八嶋弘幸

    2015年電子情報通信学会ソサエティ大会予稿集   1 ( 1 ) B12-3 - B12-3  2015.09

  • QD-SOAにおけるXPMとXGMを用いた全光NORゲート

    佐藤文也, 細谷 剛, 八嶋弘幸

    2015年電子情報通信学会ソサエティ大会予稿集   1 ( 1 ) B12-2 - B12-2  2015.09

  • B-12-2 All-optical NOR gate using XPM and XGM in QD-SOAs based MZI

    Sato Fumiya, hosoya Gou, Yashima Hiroyuki

    Proceedings of the Society Conference of IEICE   2015 ( 2 ) 260 - 260  2015.08

    CiNii

  • B-12-3 All-optical OFDM receiver using double FSR-MZI with differential delay

    Yoshida Mitsunori, Harada Hiroki, Hosoya Gou, Yashima Hiroyuki

    Proceedings of the Society Conference of IEICE   2015 ( 2 ) 261 - 261  2015.08

    CiNii

  • All Optical NOR Gate Using QD-SOA Based on XGM

    Furuya Yuma, Ogawa Kentarou, Irie Takanori, Hosoya Gou, Yashima Hiroyuki

    Proceedings of the Society Conference of IEICE   2013 ( 2 ) 352 - 352  2013.09

    CiNii

  • 8-input All-Optical XOR Gate Using QD-SOA-MZIs and All-Optical Wavelength Converter

    Irie Takanori, Hosoya Gou, Yasima Hiroyuki

    Proceedings of the Society Conference of IEICE   2013 ( 2 ) 351 - 351  2013.09

    CiNii

  • QD-SOAを用いたXGM型全光NORゲート

    古谷侑茉, 小川顕太郎, 入江孝憲, 細谷剛, 八嶋弘幸

    2013年電子情報通信学会ソサエティ大会予稿集   1 ( 1 ) B12-13 - B12-13  2013.09

  • QD-SOA MZIと全光波長変換器を用いた8入力全光XOR回路

    入江孝憲, 細谷剛, 八嶋弘幸

    2013年電子情報通信学会ソサエティ大会予稿集   1 ( 1 ) B12-12 - B12-12  2013.09

  • Multi-valued document classification based on generalized Bradley-Terry classifiers utilizing accuracy information

    T. Ogiwara, K. Mikawa, G. Hosoya, M. Goto

    Proc. of 13th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS2013)   1 ( 1 ) 253-1 - 253-1  2012.12

  • Log-Likelihood ratio calculation for iterative decoding on Rayleigh fading channels using Padé approximation

    G. Hosoya, H. Yashima

    Proc. of 35th Symposium on Information Theory and its Applications   1 ( 1 ) 90 - 95  2012.12

  • LLR calculation for iterative decoding on Rayleigh fading channels using Padé approximatio

    G. Hosoya, M. Hasegawa, H. Yashima

    電子情報通信学会技術報告   112 ( 215 ) 69 - 74  2012.09

  • The capacity of fingerprinting codes against several attack classes with unknown size of colluders

    G. Hosoya, H. Yagi, M. Kobayashi, S. Hirasawa

    Proc. of 34th Symposium on Information Theory and its Applications   1 ( 1 ) 403 - 408  2011.11

  • A-006 A Note on a Puncturing Method for LDPC Codes Based on the Structure of Parity-Check Matrix

    Osada Keishi, Hosoya Gou, Goto Masayuki

      10 ( 1 ) 141 - 146  2011.09

    CiNii

  • A-007 Improved Bit-flipping Decoding Algorithms over the Binary Symmetric Erasure Channel

    Ishibashi Sotaro, Osada Keishi, Hosoya Gou, Goto Masayuki

      10 ( 1 ) 147 - 148  2011.09

    CiNii

  • 検査行列の構造を利用したLDPC符号のパンクチャ法に関する一考察

    長田佳史, 細谷剛, 後藤正幸

    第10回情報科学技術フォーラム予稿集   1 ( 1 ) A-006 - A-006  2011.09

  • 二元対称消失通信路におけるビット反転復号法の改善

    石橋想太郎, 長田佳史, 細谷剛, 後藤正幸

    第10回情報科学技術フォーラム予稿集   1 ( 1 ) A-007 - A-007  2011.09

  • 一般化LDPC符号に対する効率的な符号化法

    寺本 賢一, 細谷 剛, 後藤 正幸, 平澤 茂一

    電子情報通信学会技術報告   110 ( 363 ) 79 - 84  2011.01

  • An improvement of layered BP decoding algorithm for rate-compatible punctured LDPC codes

    G. Hosoya, H. Yagi, M. Kobayashi

    IEICE Technical Report   110 ( 363 ) 90 - 95  2011.01

  • 2元系列のメッセージを用いたビット反転復号法の改良

    谷口 祐樹, 細谷 剛, 後藤 正幸, 平澤 茂一

    電子情報通信学会技術報告   110 ( 363 ) 61 - 66  2011.01

  • Insertion/Deletion/Substitution 通信路に対する LDPC 符号の復号法

    小林 学, 細谷 剛, 八木 秀樹, 平澤 茂一

    第33回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 432 - 437  2010.11

  • 高符号化率までパンクチャ可能なLDPC符号に関する一考察

    長田 佳史, 寺本 賢一, 細谷 剛, 後藤 正幸

    電子情報通信学会技術報告   110 ( 137 ) 95 - 100  2010.07

  • A note on analysing LDPC codes for correcting a burst erasure

    細谷 剛, 松嶋 敏泰, 平澤 茂一

    IEICE Technical Report   112 ( 215 ) 69 - 74  2010.01

  • 符号化率が適応的に可変で確定的に構成したパンクチャド LDPC 符号の性能

    細谷 剛, 松嶋 敏泰, 平澤 茂一

    第32回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 264 - 269  2009.11

  • 一般化LDPC符号に対する部分符号の構造を利用した効率的な符号化法

    寺本 賢一, 細谷 剛, 後藤 正幸, 平澤 茂一

    電子情報通信学会技術報告   109 ( 143 ) 25 - 30  2009.07

  • Effective Methods of Constructing Irregular LDPC Codes under Message-Passing Decoding and Updating Order for Sequential Decoding

    TANIGUCHI Yuki, HOSOYA Gou, GOTO Masayuki, HIRASAWA Shigeichi

    IEICE technical report   109 ( 143 ) 31 - 36  2009.07

    　View Summary

    The performance of a combination of the irregular low-density parity-check (LDPC) codes and the belief-propagation (BP) decoding algorithm strongly depends on a structure of their parity-check matrixes, and some of the codes exhibit bad performance. In this paper, we propose methods for constructing structured irregular LDPC codes which effectively facilitate for the BP decoding algorithm. We also develop methods for effective updating rules according to the bit node positions for the Shuffled BP decoding algorithm. We also show by simulation results that the decoding performances of the proposed irregular LDPC codes are better than those of the conventional ones.

    CiNii

  • グラフを組み合わせたLDPC符号アンサンブルに対する最小スパンの解析

    石川 祐臣, 佐藤 芳行, 細谷 剛, 平澤 茂一

    電子情報通信学会技術報告   108 ( 472 ) 435 - 440  2009.03

  • Group Shuffled BP復号法に対する非正則LDPC符号の次数分布を考慮した効果的なグループ分割法

    佐藤 芳行, 細谷 剛, 平澤 茂一

    電子情報通信学会技術報告   108 ( 472 ) 421 - 426  2009.03

  • Constructions of Irregular LDPC codes for a burst erasure

    G. Hosoya, T. Matsushima, S. Hirasawa

    IEICE Technical Report   108 ( 472 ) 447 - 452  2009.03

  • 次数分布を考慮した非正則LDPC符号に対するReplica Shuffled BP復号法

    佐藤 芳行, 細谷 剛, 八木 秀樹, 平澤 茂一

    第31回情報理論とその応用シンポジウム   1 ( 1 ) 129 - 134  2008.10

  • ソリッドバースト消失の訂正に適した非正則LDPC 符号の構成について

    細谷 剛, 松嶋 敏泰, 平澤 茂一

    第31回情報理論とその応用シンポジウム   1 ( 1 ) 843 - 848  2008.10

  • オイラーベクトルの特性を利用した局所的に改変された画像の検出手法

    藤田 雄大, 細谷 剛, 八木 秀樹, 平澤 茂一

    第31回情報理論とその応用シンポジウム   1 ( 1 ) 837 - 842  2008.10

  • 一般化LDPC符号に対するBF復号法の修正とその性能解析

    金井 貴大, 細谷 剛, 八木 秀樹, 平澤 茂一

    2008年電子情報通信学会ソサエティ大会予稿集   1 ( 1 ) A-6-6 - A-6-6  2008.09

  • Near Duplicated Image Detection by Learning with Difference Vector to Original Image

    SANO Toshiyuki, HOSOYA Gou, YAGI Hideki, HIRASAWA Shigeichi

    IEICE technical report   107 ( 487 ) 1 - 6  2008.02

    　View Summary

    In this paper, a new pre-trained detection scheme for near-duplicated images is proposed. By using the assumption that the difference vectors between the original image and its near-duplicated image form altered or non-altered spaces independent of the original images. With pre-trained results, we regard features with large values in the difference vectors as the affected features by alteration. To avoid mis-detection, the proposed method codenses similar features together. The proposed method is valid for the original images without pre-training. We show by simulation results that the precision of the proposed method is larger than that of the conventional ones.

    CiNii

  • JPEG2000のビットプレーンを用いたテクスチャ画像の検索

    野口 達也, 細谷 剛, 八木 秀樹, 平澤 茂一

    電子情報通信学会技術報告   107 ( 380 ) 39 - 43  2007.12

  • Group Shuffled BP 復号法における効果的な分割法

    佐藤 芳行, 細谷 剛, 八木 秀樹, 平澤 茂一

    第30回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 18 - 23  2007.11

  • A combined matrix ensemble of low-density parity-check codes for a solid burst erasure

    G. Hosoya, T. Matsushima, S. Hirasawa

    Proc. of 30th Symposium on Information Theory and its Applications   1 ( 1 ) 330 - 335  2007.11

  • Shuffled BP復号法に対する探索的なシンボルノードのグループ分割法

    佐藤 芳行, 細谷 剛, 八木 秀樹, 平澤 茂一

    電子情報通信学会技術報告   107 ( 42 ) 13 - 18  2007.05

  • A Data Hiding Method for SPIHT

    SAKUTA Yutaka, HOSOYA Gou, HIRASAWA Shigeichi

      29 ( 2 ) 529 - 532  2006.11

    CiNii

  • 静止画像圧縮における適応型予測木の改良

    小俣 順, 細谷 剛, 平澤 茂一

    第29回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 537 - 540  2006.11

  • 信頼度更新を用いたLDPC符号のBit-Flipping復号法の改良

    長谷川 裕, 細谷 剛, 八木 秀樹, 平澤 茂一

    第29回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 649 - 652  2006.11

  • カラー成分間の相関を利用したSPIHTアルゴリズムによる静止画像圧縮

    金田 海渡, 細谷 剛, 平澤 茂一

    第29回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 533 - 536  2006.11

  • SPITHアルゴリズムにおけるデータ埋め込み法

    作田 豊, 細谷 剛, 平澤 茂一

    第29回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 529 - 532  2006.11

  • On correctable burst-erasure lengths for LDPC codes with column permuted parity-check matrices

    G. Hosoya, H. Yagi, T. Matsushima, S. Hirasawa

    Proc. of 29th Symposium on Information Theory and its Applications   1 ( 1 ) 645 - 648  2006.11

  • A modification method for constructing low-density parity-check codes for burst erasures

    G. Hosoya, H. Yagi, T. Matsushima, S. Hirasawa

    IEICE Technical Report   105 ( 662 ) 153 - 158  2006.03

    　View Summary

    We study a modification method for constructing low-density parity-cheek (LDPC) codes for solid burst erasures. our proposed modification method is based on a column permutation technique for a parity-check matrix of the original LDPC codes. It can change the burst erasure correction capabilities without degradation in the performance over random erasure channels. We show by simulation results that the performances of codes permuted by our method are better than that of the original codes, especially with two or more solid burst erasures.

    CiNii

  • 適合文書から抽出した重要語に基づく文書検索

    松下 大輔, 細谷 剛, 平澤 茂一

    第28回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 713 - 716  2005.11

  • 単語の潜在的意味空間に基づく文書分類

    山岸 英貴, 細谷 剛, 平澤 茂一

    第28回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 717 - 720  2005.11

  • 信頼度更新を用いたLDPC符号のWeighted Bit-Flipping復号法

    佐藤 匡, 細谷 剛, 八木 秀樹, 平澤 茂一

    第28回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 9 - 12  2005.11

  • A decoding algorithm of low-density parity-check codes using decisions of erasure correcting

    G. Hosoya, T. Matsushima, S. Hirasawa

    Proc. of 28th Symposium on Information Theory and its Applications   1 ( 1 ) 5 - 8  2005.11

  • LDPC符号の消失訂正と誤り訂正の関係

    細谷 剛, 松嶋 敏泰, 平澤 茂一

    電子情報通信学会技術報告   105 ( 311 ) 13 - 17  2005.09

  • トレリスの枝削除によるq元ターボ復号の計算量低減

    長谷川 裕, 細谷 剛, 八木 秀樹, 平澤 茂一

    電子情報通信学会技術報告   105 ( 190 ) 9 - 14  2005.07

  • ドキュメントの特徴を考慮した非階層的クラスタリング

    渡辺 祐介, 細谷 剛, 平澤 茂一

    第27回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 61 - 64  2004.12

  • ソート・マッチング法に基づく軟判定復号アルゴリズムの修正

    贄田 里詩, 細谷 剛, 八木 秀樹, 平澤 茂一

    第27回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 567 - 570  2004.12

  • A decoding method of low-density parity-check codes over the binary erasure channel

    G. Hosoya, T. Matsushima, S. Hirasawa

    Proc. of 27th Symposium on Information Theory and its Applications   1 ( 1 ) 263 - 266  2004.12

  • Analysis of Decoding Performance of Low-Density Parity-Check Codes for Channels with Memory

    HOSOYA Gou, YAGI Hideki, HIRASAWA Shigeichi

      26 ( 1 ) 269 - 272  2003.12

    CiNii

  • 記憶のある通信路における低密度パリティ検査符号の性能解析

    細谷 剛, 八木 秀樹, 平澤 茂一

    第26回情報理論とその応用シンポジウム予稿集   1 ( 1 ) 268 - 271  2003.12

  • Low-Density Parity-Check Codes for Decoding Algorithm based on Belief Propagation : A shortening method for cyclic LDPC codes

    NIEDA Satoshi, HOSOYA Gou, YAGI Hideki, HIRASAWA Shigeichi

    IEICE technical report. Information theory   103 ( 215 ) 51 - 56  2003.07

    　View Summary

    Decoding algorithms based on belief propagation, which iteratively compute a posteriori probability of received symbols, are well-known as decoding methods for Low-Density Parity-Check (LDPC) codes. It is known that decoding algorithms based on belief propargation, such as sum-product algorithm, does not work well when there exist loops of short length in the parity-check matrix. For this problem, several researchers have proposed construction methods of LDPC codes whose parity-check matrices have no loops of length 4. In this paper, we devise a shortening method for cyclic LDPC codes. We show by computer simulations that shortened codes obtained by the devised method have good performances.

    CiNii

  • バースト誤り通信路に適した低密度パリティ検査符号の構成法

    細谷 剛, 八木 秀樹, 小林 学, 平澤 茂一

    電子情報通信学会技術報告   103 ( 214 ) 61 - 66  2003.07

  • Construction method of low-density parity-check codes for burst error channels

    HOSOYA G.

    Technical report of IEICE   2003   61 - 66  2003

    CiNii

  • A Decoding Algorithm of Low Density Parity Check Codes for Hidden Markov Noise Channel : A decoding algorithm for a channel with unknown parameters

    HOSOYA Gou, YAGI Hideki, KOBAYASHI Manabu, HIRASAWA Shigeichi

    IEICE technical report. Information theory   102 ( 198 ) 19 - 24  2002.07

    　View Summary

    Sum-product algorithm, a well-known decoding algorithm of LDPC codes, is based on APP decoding to decode each received symbol. We usually assume that the parameters of channels are known, since a likelihood of channel noise is needed. When we consider applying it to practical channels, it is rarely that the parameters of channels are known. In this paper we propose a decoding algorithm combined with estimating unknown parameters of channels and we show that the bit error probability is as close as that of a decoding algorithm in which the parameters are known.

    CiNii

▼display all

 

Syllabus

▼display all

 

Internal Special Research Projects

  • 通信路容量に迫る遅延型ビット置換符号化変調方式の開発

    2022  

    　View Summary

    本研究は符号化変調方式の限界に迫る新しい変調方式を開発することを目指すものである．変調方式の中でビット置換符号化変調(BICM)に注目し，遅延時間を導入した遅延型BICM(DBICM)に対し，マルチレベル符号化/多段復号(MLC/MSD)と同等の性能を示すように送信方法や信号点のビットラベルの設計方法に変更を加えた．また，低密度パリティ検査符号など誤り訂正符号を組み合わせたときの性能向上を図った．通信路容量を評価指標として提案した通信方式が性能向上することを示し，有効性を明らかにした．

  • 通信路容量に迫る符号を用いた個人情報保護法の開発

    2021  

    　View Summary

    アレー符号は RAID (redundant arrays ofinexpensive disk) などストレージデバイスで用いられている誤り訂正符号であり，Reed-Solomon(RS) 符号のような最大分離距離 (MDS) 符号が古くから知られている．本課題では, 2次元消失通信路に対する非2元低密度パリティ検査符号の性能を評価した．ストレージデバイスの構造に着目し，2つの符号語ビットの配置法を提案し密度発展法による解析方法を示した．配置法の提案にあたって従来の残余グラフでの議論が成り立たないため，変数ノードが故障ストレージに接続される数を考慮した．評価にあたっては，提案する方法は従来の非2元低密度パリティ検査符号および同じ符号長をもつ2元低密度パリティ検査符号より高い性能を示した．

  • 無線通信における符号化変調方式の開発

    2020  

    　View Summary

    本研究では，擬似乱数ビット置換符号化変調（BICM-P) に対する新たなシェーピング手法を提案した．提案する手法では，符号化器に入力される系列に対し新たに擬似乱数系列を追加し，信号点間の距離を大きくするために，電力の小さい信号点と大きい信号点に分割できるように各信号点における擬似乱数ビット位置を考慮した．新たに追加した擬似乱数系列により各信号点の送信確率が不均等となり，ガウス分布を模した入力分布が実現された．次に，提案したシェーピング手法の下でピーク対平均電力比の増加を考慮した信号点配置を提案した．最後に密度発展法による反復閾値及び計算機シミュレーションにより性能を評価し，提案法の有効性を示した．

  • 疎行列に基づく符号化率が可変な誤り訂正符号の設計および解析

    2010  

    　View Summary

    高符号化率のてパンクチャドLDPC符号を用いて事後確率復号を行うと更新ルールの性質から十分な伝搬が行われずに早期に停止することが多く，正しく復号することができない．これはLDPC符号中に存在するループの影響によるものであり，従来1つの確率変数の事前を伝搬させていたことによる．このような問題に対して，ループがある符号のグラフ上で正しく事後確率を計算するためには，複数のパンクチャドビットを結合した確率を伝搬させることで閉路上でも復号が続行できる新しい復号法を提案し，従来の復号法よりも必ず運用可能な符号化率が大きくなることを示した．またパンクチャドビットを復号過程の早期に推定することが重要であるため，直列型BP復号法のような収束が早い復号法によって更新順序を制御することも検討し，収束が早い復号法の提案を行った．これらの改良を加える過程において，符号のレート可変性を保持することが実用上重要であり，本研究でもその保持に努めた．実験結果より様々なLDPC符号に対し，ほぼ1に近い符号化率のパンクチャドLDPCに対しても提案した復号法で訂正することができた．また復号法の直列化を行うことで計算量の増加も極僅かに抑えることができた．設定可能な符号化率の範囲を理論的に導出することは今後の課題として残っている．また2元系列を用いた実行が容易な復号法やLDPC符号より性能の高いGLDPC符号に対する効果的な符号化法の開発にも取り組んだ．信頼度を有効に用いることで，非正則LDPC 符号に対しても実行可能な3 ビットBF 復号法を提案した．シミュレーション及び密度発展法により，提案した復号法はエラーフロア領域における復号性能が向上し，反復閾値が向上することを示した．ランダムに構成されたGLDPC 符号に対して，情報とパリティ系列のラベル付け方法及び符号化法を提案した．提案した符号化法の計算回数の上界を導出し，通常の符号化より大幅に削減できることを示した．

  • 低密度パリティ検査符号を用いたバースト消失訂正における符号構成とその理論的な性能解析に関する研究

    2008  

    　View Summary

    本課題で目指したことは，下記の１，２の項目についてである．これらの報告と，３で今後の方針について示す．１．LR-LDPC符号の解析本課題によって提案されたLR-LDPC 符号は，通常のLDPC符号の部分クラスであり，通常のLDPC符号よりもバースト消失性能が高いことが示された．また，LR-LDPC符号を構成する3つの符号において，それぞれの符号の性能は，疎行列の程度を示す指標である「密度」が決めてであることが判明した．ただし当初の計画とは違い，解析式の中身をさらに解析して性能の差異を明らかにすることは適わなかったが，これらの3つの符号が全て，通常のLDPC符号符号よりも性能が優れていることが性能が向上する条件であることも判明した．また，符号アンサンブルを用いて理論的に性能解析結果からもそのような傾向が明らかになり，同時にランダムに発生する消失に対しては如何なる性能の劣化も生じないことが示された．２．解析式の厳密化従来の解析では，復号が失敗する停止条件であるストッピングセットを用いて解析しているが，解析が容易な反面，得られる下界の厳密性に問題がある．そこで最小ストッピングセットと呼ばれる，ストッピングセットよりも細かく場合分けして計算できる条件を適用し，よりタイトなバースト消失訂正能力の下界を得ることができた．３．今後の計画について概ね，研究成果も得られたが，本質的な部分で明らかにすべきことが残っている．本研究で得られた結果は，正則なLDPC符号を対象としており，よりクラスが広く，性能が優れた非正則LDPC符号へ拡張することも行った．正則の場合と同様に，「密度」と，非正則LDPC符号の性能を決定付ける重要な要素であるタナーグラフ上における「次数2の変数ノード」が性能を左右されていることが判明した．これらの示唆を生かし，今後の研究成果のさらなる発展が期待される．