学生のHASAN, Mohammad Nurさんが2017 IEEE ICCにおいて発表した論文がIEEE名古屋支部国際会議研究発表賞を受賞

 学生のHASAN, Mohammad Nurさん(博士後期課程2年、セキュリティ・ネットワーク領域クルカスキー研究室)が2017 IEEE International Conference on Communications (ICC 2017)において発表した論文がIEEE名古屋支部国際会議研究発表賞を受賞しました。

 "IEEE Nagoya Section International Conference Presentation Award" is the award which the IEEE Nagoya Section selects and gives to university and graduate students who offer presentation at an international conference, which the IEEE hosts abroad. His paper presented at 2017 IEEE International Conference on Communications (ICC 2017), which is the flagship conference of IEEE Communications Society.ICC 2017 was held in Paris, France from 21-25 May 2017. From a total of 3,074 paper submissions for the main conference alone (excluding workshops), only 1,172 papers had been accepted for presentation and publication in the Conference Proceedings, yielding an acceptance rate of 38%. Every paper went through a rigorous review process, in which each paper received at least three expert reviews.
 The presented papers is published in IEEE Xplore and can be downloaded from website(http://ieeexplore.ieee.org/document/7996920/).

参考: http://icc2017.ieee-icc.org http://ieee-nagoya.org/research_grant.html


 Mohammad Nur Hasan, Brian M. Kurkoski

 Practical Compute-and-forward Approaches for the Multiple Access Relay Channel

 We consider a multiple access relay channel (MARC) network consisting of two sources, one relay, and one common destination applying compute-and-forward (CF) strategy. We show that the direct application of CF to the MARC network results in poor error performance bounded by (p+1)^{-1}, the probability of rank deficiency of the coefficient matrix over Fp. To solve this problem, we propose two practical approaches. First, given an optimal coefficient vector at the relay, the destination is restricted to select a coefficient vector ensuring a full rank coefficient matrix. Second, given an optimal coefficient vector at the destination obtained via a small amount of feedback, the relay is restricted to choose a coefficient vector guaranteeing a full rank coefficient matrix. We simulate these CF implementation strategies using self-similar nested E8 lattice codes and confirm that both of the proposed schemes outperform the direct implementation in terms of achievable transmission rate and frame-error-rate performance. Furthermore, we confirm that with a small amount of feedback, the second strategy is better than the first one. In addition, we present in detail a modified Fincke-Pohst algorithm for computing the coefficient candidates and show its efficiency compared to an exhaustive search.

 It is a great honor to receive the IEEE Nagoya Section International Conference Presentation Award. I thank ALLAH for everything and for making this award as a part of my achievements. I would like to convey my deepest gratitude to my supervisor, Prof. Kurkoski, for his guidance, support, and encouragement. And surely, I am grateful to my lovely family and parents for their full support, love, and pray. This award motivates me to achieve more excellent research results in the near future.

award20180327-1.jpg award20180327-2.jpg