Curriculum Vitaes

Gou Hosoya

  (細谷 剛)

Profile Information

Affiliation
Associate Professor, Department of Systems Engineering, Faculty of Systems Engineering, Osaka Sangyo University
Degree
Doctor of Engineering(Dec, 2008, Waseda University)

J-GLOBAL ID
200901046693783710
researchmap Member ID
6000009493

External link

Research Interests

 1

Papers

 71
  • T. Irie, G. Hosoya, H. Yashima
    Optics & Photonics Taiwan, the International Conference 2013, Dec, 2013  Peer-reviewed
  • K. Tabata, G. Hosoya, H. Yashima
    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13), Mar, 2013  Peer-reviewed
  • G. Hosoya, K. Osada, M. Goto
    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13), Mar, 2013  Peer-reviewed
  • H. Terao, G. Hosoya, H. Yashima
    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13), Mar, 2013  Peer-reviewed
  • R. Sasaki, G. Hosoya, H. Yashima
    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13), Mar, 2013  Peer-reviewed
  • S. Hata, G. Hosoya, H. Yashima
    2013 RISP International Workshop on Nonlinear Circuits Communications and Signal Processing (NCSP'13), Mar, 2013  Peer-reviewed
  • Gou Hosoya, Hiroyuki Yashima
    JOURNAL OF APPLIED MATHEMATICS, 2013(970126) 1-10, 2013  Peer-reviewed
    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.
  • T. Ogiwara, K. Mikawa, G. Hosoya, M. Goto
    13th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS2013), Dec, 2012  Peer-reviewed
  • G. Hosoya, H. Yagi, M. Kobayashi, S. Hirasawa
    Journal of Information Assurance and Security, 7(1) 41-51, Jun, 2012  Peer-reviewed
  • Gou Hosoya, Mikio Hasegawa, Hiroyuki Yashima
    2012 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP 2012), 2012  Peer-reviewed
    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.
  • R. Odai, G. Kumoi, K. Mikawa, G. Hosoya, M. Goto
    12th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS2012), Oct, 2011  Peer-reviewed
  • T. Takemura, M. Kumoi, G. Hosoya, M. Goto
    12th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS2012), Oct, 2011  Peer-reviewed
  • 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  Peer-reviewed
    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.
  • Gou Hosoya, Hideki Yagi, Manabu Kobayashi
    ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications, 394-399, 2010  Peer-reviewed
    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.
  • Gou Hosoya, Hideki Yagi, Manabu Kobayashi, Shigeichi Hirasawa
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A(10) 2418-2430, Oct, 2009  Peer-reviewed
    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.
  • G. Hosoya, T. Matsushima, S. Hirasawa
    Pre-ICM International Convention on Mathematical Sciences, Dec, 2008  Peer-reviewed
  • Yoshiyuki Sato, Gou Hosoya, Hideki Yagi, Shigeichi Hirasawa
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A(10) 2745-2753, Oct, 2008  Peer-reviewed
    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.
  • Gou Hosoya, Toshiyasu Matsushima, Shigeichi Hirasawa
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A(10) 2765-2778, Oct, 2008  Peer-reviewed
    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.
  • G. Hosoya, H. Yagi, T. Matsushima, S. Hirasawa
    2006 International Symposium on Information Theory and its Applications, 491-496, Oct, 2006  Peer-reviewed
  • Gou Hosoya, Hideki Yagi, Toshiyasu Matsushima, Shigeichi Hirasawa
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A(10) 2501-2509, Oct, 2006  Peer-reviewed
    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.
  • G. Hosoya, H. Yagi, S. Hirasawa
    2004 International Symposium on Information Theory and its Applications, Oct, 2004  Peer-reviewed

Misc.

 92

Books and Other Publications

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

Presentations

 131

Research Projects

 13

研究テーマ

 3
  • 研究テーマ(英語)
    情報通信
    研究期間(開始)(英語)
    2008/04/01
  • 研究テーマ(英語)
    情報学基礎論
    研究期間(開始)(英語)
    2008/04/01
  • 研究テーマ(英語)
    情報理論
    研究期間(開始)(英語)
    2008/04/01