Updated on 2024/04/16

写真a

 
LU Shan
 
Organization
Graduate School of Engineering Information and Communication Engineering 1 Lecturer
Graduate School
Graduate School of Engineering
Undergraduate School
School of Engineering Electrical Engineering, Electronics, and Information Engineering
Title
Lecturer

Research Areas 2

  1. Informatics / Theory of informatics  / 情報理論

  2. Manufacturing Technology (Mechanical Engineering, Electrical and Electronic Engineering, Chemical Engineering) / Communication and network engineering  / 通信路符号化

Research History 3

  1. 名古屋大学 工学研究科 情報・通信工学専攻

    2023.10

  2. 兼任)航空宇宙生産技術開発センター

    2019.6

  3. Gifu University   Faculty of Engineering Department of Electrical, Electronic and Computer Engineering   Assistant Professor

    2016.2 - 2023.9

Education 1

  1. Doshisha University

    2010.4 - 2014.3

Professional Memberships 2

  1. IEICE

  2. Institute of Electrical and Electronics Engineers(IEEE)

Committee Memberships 9

  1.   TPC member, IEEE VTC2024-OWC'24 for 6G workshop  

    2024.3   

      More details

    Committee type:Academic society

  2.   IEICE『Information Theory and Its Applications』 編集委員会 編集委員  

    2023.12   

  3.   IEEE ComSoc Tokyo Joint Chapter Secretary  

    2023.12   

      More details

    Committee type:Academic society

  4.   情報理論とその応用シンポジウム(SITA2024), プログラム委員会 幹事  

    2023.10   

  5.   第46回情報理論とその応用シンポジウム(SITA2023), プログラム委員会 委員  

    2023.4 - 2023.12   

  6. 2021 IEEE Information Theory Workshop (ITW2021)   2021 IEEE Information Theory Workshop (ITW2021)  

    2021.4 - 2021.10   

  7. IEICE 情報理論研究専門委員会   委員  

    2020.4   

      More details

    Committee type:Academic society

  8. 第39回情報理論とその応用シンポジウム(SITA2016)   実行委員会委員  

    2016.7 - 2016.12   

  9. IEEE Kansai Section, Technical Program Committee (TPC)   Secretary  

    2014.1 - 2016.12   

      More details

    Committee type:Academic society

▼display all

Awards 3

  1. Young Researcher Best Paper Award in ISITA 2022

    2022.10   IEEE Information Theory Society Japan Chapter  

  2. Best oral persentation in the 5th World Symposium on Communication Engineering (WSCE 2022)

    2022.9  

  3. 国際留学生奨学生

    2013.4   公益財団法人 岩谷直治記念財団

 

Papers 37

  1. Deep-Learning-Aided Successive Cancellation List Flip Decoding for Polar Codes Invited Reviewed

        2023.12

     More details

    Publishing type:Research paper (scientific journal)  

  2. BNNs- and TISTA- Based Signature Code Design for User Identification and Channel Estimation Over Multiple-Access Channel With Rayleigh Fading Invited Reviewed

    Lantian Wei, Shan Lu, and Hiroshi Kamabe

    2023 IEEE Information Theory Workshop (ITW 2023)     2023.4

     More details

    Publishing type:Research paper (scientific journal)  

  3. Balanced coding with Lehmer code Invited Reviewed

    Hiroshi Kamabe, Takumi Marumo, Shan Lu

    Proc. of 2022 Int. Symposium on Information Theory and Its Applications     2022.10

     More details

    Publishing type:Research paper (scientific journal)  

  4. Improved Survival Probability for Coded Compressed Sensing in Unsourced Random Access Invited Reviewed

    Shan Lu, Hiroshi Kamabe

    Proc. of 2022 Int. Symposium on Information Theory and Its Applications     2022.10

     More details

    Authorship:Lead author   Publishing type:Research paper (scientific journal)  

  5. Loss Function Analysis for DNN Iterative Decoder on Rayleigh Fading Massive Random Access Invited Reviewed

    Shan Lu, Hiroshi Kamabe

    Proc. of the 5th World Symposium on Communication Engineering (WSCE 2022)     2022.9

     More details

    Authorship:Lead author   Publishing type:Research paper (scientific journal)  

  6. User Identification and Channel Estimation by Iterative DNN-Based Decoder on Multiple-Access Fading Channel Invited Reviewed

    Lantian WEI, Shan LU, Hiroshi KAMABE, Jun CHENG

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   Vol. E105.A ( 3 ) page: 417 - 424   2022.3

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:Institute of Electronics, Information and Communications Engineers (IEICE)  

    DOI: 10.1587/transfun.2021tap0008

  7. Access Point Placement for Indoor Wireless LAN Invited Reviewed

    Yuma Narita, Shan Lu, Hiroshi Kamabe

        2021.7

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

  8. Accuracy Evaluation of Indoor Positioning by Received Signal Strength using Deep Learning Invited Reviewed

    Yuma Narita, Shan Lu, Hiroshi Kamabe

    2021 23rd International Conference on Advanced Communication Technology (ICACT)     2021.2

     More details

    Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.23919/icact51234.2021.9370400

  9. User Identification and Channel Estimation by DNN-Based Decoder on Multiple-Access Channel Invited Reviewed

    Lantian Wei, Shan Lu, Hiroshi Kamabe, Jun Cheng

    GLOBECOM 2020 - 2020 IEEE Global Communications Conference     2020.12

     More details

    Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.1109/globecom42002.2020.9322258

  10. Design of ZDF code using uniform shift enumerator Invited Reviewed

    Yuya Naruse, Shan Lu, Hiroshi Kamabe

    2020 International Symposium on Information Theory and Its Applications (ISITA)     page: 126 - 130   2020.10

     More details

    Authorship:Lead author   Publishing type:Research paper (scientific journal)  

  11. Burst Erasure Correction by 2D LDPC Codes Reviewed

    Hiroshi Kamabe, Shan Lu

    2019 IEEE Global Communications Conference (GLOBECOM)     2019.12

     More details

    Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.1109/globecom38437.2019.9013593

  12. Multi-User UD k-Ary Codes Recursively Constructed from Short-Length Multiary Codes for Multiple-Access Adder Channel Reviewed

    Shan Lu, Wei Hou, Jun Cheng, Hiroshi Kamabe

    2019 IEEE International Symposium on Information Theory (ISIT)     2019.7

     More details

    Authorship:Lead author   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.1109/isit.2019.8849304

  13. Unrestricted-rate parallel random input-output codes for multilevel flash memory Reviewed

    S. Lu, H. Kamabe, J. Cheng, A. Yamawaki

    IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences   Vol. E101-A ( 12 ) page: 2135 - 2140   2018.12

     More details

    Authorship:Lead author   Language:English   Publishing type:Research paper (scientific journal)  

    DOI: 10.1587/transfun.E101.A.2135

  14. Construction of parallel random I/O codes using coset coding with Hamming codes Reviewed

    Yamawaki, H. Kamabe, S. Lu

    IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences   Vol. E101-A ( 12 ) page: 2125 - 2134   2018.12

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE  

    DOI: 10.1587/transfun.E101.A.2125

  15. A New Kind of Nonbinary Uniquely Decodable Codes with Arbitrary Code Length for Multiple-Access Adder Channel Reviewed

    Shan Lu, Wei Hou, Jun Cheng, Hiroshi Kamabe

    2018 IEEE Information Theory Workshop (ITW)     2018.11

     More details

    Authorship:Lead author   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.1109/itw.2018.8613495

  16. An Upper Bound on the Generalized Cayley Distance Reviewed

    Akira Yamawaki, Hiroshi Kamabe, Shan Lu

    2018 International Symposium on Information Theory and Its Applications (ISITA)     2018.10

     More details

    Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.23919/isita.2018.8664339

  17. Improving Polar Codes by Spatial Coupling Reviewed

    Kai-Hsin Wang, Wei Hou, Shan Lu, Ping-Yuen Wu, Yeong-Luh Ueng, Jun Cheng

    2018 International Symposium on Information Theory and Its Applications (ISITA)     2018.10

     More details

    Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.23919/isita.2018.8664309

  18. Error Floor Estimation of Spatially-Coupled Irregular LDPC Code Ensembles Reviewed

    Kengo Shibata, Shan Lu, Masakazu Yoshida, Krishna R. Narayanan, Jun Cheng

    2018 International Symposium on Information Theory and Its Applications (ISITA)     2018.10

     More details

    Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.23919/isita.2018.8664369

  19. Recursive Construction of k-Ary Uniquely Decodable Codes for Multiple-Access Adder Channel Reviewed

    Shan Lu, Wei Hou, Jun Cheng, Hiroshi Kamabe

    2018 International Symposium on Information Theory and Its Applications (ISITA)     2018.10

     More details

    Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.23919/isita.2018.8664318

  20. A Study on Spatial Coupling of Polar Codes Reviewed

    Kai-Hsin Wang, Wei Hou, Shan Lu, Ping-Yuen Wu, Yeong-Luh Ueng, Jun Cheng

    Proceeding of IEEE Vehicular Technology Society Asia Pacific Wireless Communications Symposium 2018     2018

     More details

    Publishing type:Research paper (international conference proceedings)  

  21. Worst-case performance of ILIFC with inversion cells Reviewed

    Akira Yamawaki, Hiroshi Kamabe, Shan Lu

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   Vol. E100A ( 12 ) page: 2662 - 2670   2017.12

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:Institute of Electronics, Information and Communication, Engineers, IEICE  

    Index-less Indexed Flash Code (ILIFC) is a coding scheme for flash memories in which one bit of a data sequence is stored in a slice consisting of several cells but the index of the bit is stored implicitly. Although several modified ILIFC schemes have been proposed, inthis research we consider an ILIFC with inversion cells (I-ILIFC). The I-ILIFC reduces the total number of cell level changes at each write request. Computer simulation is used to show that the I-ILIFC improves the average performance of the ILIFC in many cases. This paper presents our derivation of the lower bound on the number of write operations by I-ILIFC and shows that the worst-case performance of the I-ILIFC is better than that of the ILIFC if the code length is sufficiently large. Additionally, we consider another lower bound thereon. The results show that the threshold of the code length that determines whether the I-ILIFC improves the worst-case performance of the ILIFC is lower than that in the first lower bound.

    DOI: 10.1587/transfun.E100.A.2662

    Scopus

  22. Codes for T-user asymmetric multiple-access channel with independent sources Reviewed

    Shan Lu, Hiroshi Kamabe, Jun Cheng

    2017 IEEE Information Theory Workshop (ITW)     2017.11

     More details

    Authorship:Lead author   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.1109/itw.2017.8277982

  23. Construction of parallel RIO codes using coset coding with hamming codes Reviewed

    Akira Yamawaki, Hiroshi Kamabe, Shan Lu

    2017 IEEE Information Theory Workshop (ITW)     2017.11

     More details

    Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.1109/itw.2017.8277956

  24. Lower bounds on the number of write operations by index-less indexed flash code with inversion cells Reviewed

    Akira Yamawaki, Hiroshi Kamabe, Shan Lu

    2017 IEEE International Symposium on Information Theory (ISIT)     2017.6

     More details

    Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.1109/isit.2017.8006976

  25. Construction of unrestricted-rate parallel random input-output code Reviewed

    Shan Lu, Hiroshi Kamabe, Jun Cheng, Akira Yamawaki

    2017 IEEE International Symposium on Information Theory (ISIT)     2017.6

     More details

    Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    DOI: 10.1109/isit.2017.8006604

  26. Rate-compatible spatially coupled LDPC code ensembles based on repeat-accumulate extensions Reviewed

    Wei Hou, Shan Lu, Jun Cheng

    IET COMMUNICATIONS   Vol. 10 ( 17 ) page: 2422 - 2426   2016.11

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:INST ENGINEERING TECHNOLOGY-IET  

    A family of rate-compatible capacity-approaching codes is obtained by spatially coupling multiple identical copies of rate-compatible base codes. The base code consists of a given regular low-density parity-check (LDPC) code and a parameter-adjustable repeat-accumulate (RA) extension. The RA-extension repeatedly accumulates all of the variable nodes of the given LDPC code by q + 1 times to generate q + 1 blocks of accumulated nodes, in which all of the accumulated variable nodes in the first q blocks and the -fractional accumulated variable nodes in the last block are transmitted. The spatially coupled versions of the base codes, called RA-extended spatially coupled LDPC (SC-LDPC) codes, achieve arbitrary rates by simply adjusting parameters q and , and thus they are rate-compatible. The potential thresholds of the base code ensembles are calculated to predict the iterative decoding performance of the proposed RA-extended SC-LDPC codes. Numerical results and simulations show that the authors' proposed rate-compatible codes are capacity-approaching over binary erasure channels.

    DOI: 10.1049/iet-com.2015.1031

    Web of Science

  27. Spatially Coupled Repeater-Combiner-Convolutional Codes Reviewed

    Wei Hou, Shan Lu, Jun Cheng

    IEEE COMMUNICATIONS LETTERS   Vol. 20 ( 1 ) page: 21 - 24   2016.1

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC  

    A form of spatially coupled codes is obtained by coupling multiple identical concatenated codes consisting of a block outer code (a repetition code followed by a single-parity code) concatenated with a convolutional inner code of infinite impulse response. The coupling operation involves only the outer code of the block-convolutional concatenated code. Because of the simple outer code and diverse inner code, the proposed codes have simple encoding implementation and flexible designation space. Extrinsic information functions are used to analyze the belief propagation (BP) thresholds of the proposed codes over an additive white Gaussian noise channel. The numerical results demonstrate that the proposed codes have better BP threshold and error correction performances than conventional spatially coupled repeat-accumulate codes and spatially coupled low-density parity-check codes. In particular, the proposed codes with a rate of about 0.5 and length of 15628 have a bit-error-rate (BER) of 10(-5) at Eb/N0 of 1.13 dB that is less than 1 dB away from the Shannon limit.

    DOI: 10.1109/LCOMM.2015.2497242

    Web of Science

  28. Input-Output Weight Distribution of Terminated RSC Codes with Limited Codelength Reviewed

    Shan Lu, Wei Hou, Jun Cheng

    2016 International Symposium on Information Theory and Its Applications (ISITA)     page: 493 - 497   2016

     More details

    Authorship:Lead author   Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    In this paper, we evaluate the input-parity weight distribution of terminated recursive systematic convolutional (RSC) codes. On the trellis of convolutional codes, the paths are ended at any state of the code after information sequence input. The number of paths ended at the zero-state can be described by the number of error events which can easily be obtained. For the paths at non-zero state of the code after information sequence input, we equivalent the input-parity weight distribution of these paths to input-parity weight distribution of some sets of error events. Using the number of weight distribution that have ended at each of the states, we provide the input-parity weight distribution of terminated RSC codes. Our algorithm provides input-parity weight distributions for all input weights and it is a precise result for terminated RSC codes that is necessary for the performance analysis of code.

    Web of Science

  29. Optimal rate profile for multi-user multi-rate code with hybrid interference cancellation scheme,

    M. He, G. Song, J. Cheng, S. Lu

    Proc. Int. Symposium on Information Theory and Its Applications (ISITA)     page: p. 552,   2016

     More details

    Publishing type:Research paper (scientific journal)  

    2016. (Poster)

  30. A Family of (k+1)-Ary Signature Codes for Noisy Multiple-Access Adder Channel Reviewed

    Shan Lu, Wei Hou, Jun Cheng

    IEEE TRANSACTIONS ON INFORMATION THEORY   Vol. 61 ( 11 ) page: 5848 - 5853   2015.11

     More details

    Authorship:Lead author   Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC  

    A coding scheme of (k + 1)-ary error-correcting signature codes for a noisy multiple-access adder channel is proposed. Given a signature matrix A and a difference matrix D = D+ - D- a priori, a larger signature matrix is obtained by replacing each element in the Hadamard matrix with A, or D+, or D- depending on the values of the elements and their locations in the Hadamard matrix. The set of rows in the proposed matrix gives an error-correcting signature code. Introducing a difference matrix makes it possible to construct an error-correcting signature code whose sum rate is increased with an increase in the order of the Hadamard matrix. Either binary or non-binary signature codes are constructed when the pairs of matrices A and D are given.

    DOI: 10.1109/TIT.2015.2479219

    Web of Science

  31. Rate-compatible spatially coupled LDPC codes via repeat-accumulation extension Reviewed

    Wei Hou, Shan Lu, Jun Cheng

    International Symposium on Turbo Codes and Iterative Information Processing, ISTC     page: 87 - 91   2014.11

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE Computer Society  

    We propose the construction of rate-compatible spatially coupled low-density parity-check (SC-LDPC) codes. For a given high-rate SC-LDPC mother code, a family of low-rate member codes can be obtained by extending the protogragh of the mother code with repeat-accumulation (RA). Rate compatibility is obtained by adjusting the RA-extension parameters. Continuous code rate is achieved without extra cost. Density evolution analysis shows that the iterative decoding thresholds of all the member codes of the rate-compatible family are very close to the Shannon limits over the binary erasure channels.

    DOI: 10.1109/ISTC.2014.6955091

    Scopus

  32. Coding Scheme for T-User Noisy Multiple-Access Adder Channel Reviewed

    Shan Lu, Wei Hou, Jun Cheng

    2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA)     page: 536 - 540   2014

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    A multi-user coding scheme is proposed for a noisy multiple-access adder channel. Given T-a-user delta(a)-decodable k-ary code A and T-d-subset delta(d)-decodable difference set D with its two component sets D+ and D a priori, larger error-correcting multi-user code C is obtained. Introducing difference set D makes the total rate of generated code C higher than that of conventional code.

    Web of Science

  33. Recursive Construction of (k+1)-Ary Error-Correcting Signature Code for Multiple-Access Adder Channel Reviewed

    Shan Lu, Jun Cheng, Yoichiro Watanabe

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Vol. E96A ( 12 ) page: 2368 - 2373   2013.12

     More details

    Authorship:Lead author   Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    A recursive construction of (k+1)-ary error-correcting signature code is proposed to identify users for MAAC, even in the presence of channel noise. The recursion is originally from a trivial signature code. In the (j-1)-th recursion, from a signature code with minimum distance of 2(j-2), a longer and larger signature code with minimum distance of 2(J-1) is obtained. The decoding procedure of signature code is given, which consists of error correction and user identification.

    DOI: 10.1587/transfun.E96.A.2368

    Web of Science

  34. Two-User Turbo Decoding with Simplified Sum Trellis in Two-Way Relay Channel Reviewed

    Shan Lu, Jun Cheng, Ying Li, Yoichiro Watanabe

    IEICE TRANSACTIONS ON COMMUNICATIONS   Vol. E96B ( 1 ) page: 73 - 80   2013.1

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Physical-layer network coding with binary turbo coding in a two-way relay channel is considered. A two-user turbo decoding scheme is proposed with a simplified sum trellis. For two-user iterative decoding at a relay, the component decoder with its simplified sum trellis decodes the superimposed signal to the arithmetic sum of two users' messages. The simplified sum trellis is obtained by removing one of the states in a pair of mutual symmetrical states from a sum trellis. This removal reduces the decoding complexity to half of that with the sum trellis, and does not degrade decoding performance over AWGN channel since two output sequences from the pair of mutual symmetrical states are the same.

    DOI: 10.1587/transcom.E96.B.73

    Web of Science

  35. Construction of error-correcting signature code on Hadamard matrix,

    S. Lu, W. Hou, J. Cheng

    Proc. The Third Int. Symposium on Radio Systems and Space Plasma (ISRSSP),     page: pp. 57-63,   2013

     More details

    Publishing type:Research paper (scientific journal)  

    2013.

  36. Generalized construction of signature code for multiple-access adder channel Reviewed

    Shan Lu, Jun Cheng, Wei Hou, Yoichiro Watanabe

    IEEE International Symposium on Information Theory - Proceedings     page: 1655 - 1659   2013

     More details

    Authorship:Lead author   Language:English   Publishing type:Research paper (international conference proceedings)  

    We propose a generalized construction scheme of error-correcting signature code. We form a signature matrix whose rows become the non-zero codewords of the signature code. In the coding scheme, a signature matrix is obtained from a Hadamard matrix by replacing every element by an initial signature matrix or its associated matrix depending on the element's binary value. The proposed code has longer length, higher decodability, and larger cardinality. In this coding scheme, the initial signature matrix is in a general form and can be a signature matrix of any initial signature code. Different initial matrices provide different error-correcting signature codes, including conventional codes. This general form makes it possible to obtain error-correcting signature codes with a higher sum rate than conventional codes. © 2013 IEEE.

    DOI: 10.1109/ISIT.2013.6620508

    Scopus

  37. Decoding for Non-Binary Signature Code Reviewed

    Shan Lu, Jun Cheng, Yoichiro Watanabe

    2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012)     page: 382 - 386   2012

     More details

    Authorship:Lead author   Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Signature code is for user identification in a T-user multiple-access communication system with multiple-access adder channel. In the system, each user is assigned to two codewords and the common zero codeword is shared among all T users. A decoding rule for a non-binary signature code is proposed. For the non-binary signature code, a matrix is introduced whose product with Hadamard matrix is a block diagonal matrix. The block diagonal matrix guarantees the decoding of the non-binary signature code. The procedure of error correction and user identification is given for the system.

    Web of Science

▼display all

MISC 32

  1. Polar符号のファクターグラフの置換によるBP復号のSGRANDによる性能改善

    吉田昂平, 鎌部 浩, 路姍

    IEICE MRIS2023-29 pp.42-47     2023.12

  2. Conv-GRUを用いた屋内における二次元電波地図予測

    木全 宏旭, 鎌部 浩, 路 姍

    第46回情報理論とその応用シンポジウム(SITA2023)     2023.11

  3. Polar符号のファクターグラフの置換による確率伝播復号の改善

    吉田 昂平, 鎌部 浩, 路 姍

    第46回情報理論とその応用シンポジウム(SITA2023)     2023.11

  4. Polar符号のファクターグラフの置換によるBP復号の性能改善

    吉田昂平, 路 サン, 鎌部 浩

    IEICE IT研究会     2023.8

  5. PAC符号のSCF-Fano復号を用いた性能改善

    小川響生, 鎌部 浩, 路 サン

    IEICE IT2022-118 ISEC2022-97 WBS2022-115 RCC2022-115 pp.319-324     2023.3

  6. 強化学習を用いたLoRaWANの衝突回避のためのユーザ待機時間の制御

    大津佳都, 路 姍, 鎌部 浩

    IEICE IT2022-104 ISEC2022-83 WBS2022-101 RCC2022-101 pp.230-235     2023.3

  7. DNAストレージのための有限状態符号の誤り訂正能力の評価

    鎌部 浩, 丸茂 巧(NTTデータ東海, 路 サン

    IEICE MRIS2022-26 pp.42-47     2022.12

  8. LDPC符号のためのニューラルネットワーク復号器に関する研究

    岡本 佳穂, 路 サン(岐, 鎌部 浩

    第45回情報理論とその応用シンポジウム(SITA2022)     2022.11

  9. BNNs and Trainable ISTA based Signature Code with Channel Estimation for Multiple Access Rayleigh Fading Channel

    Lantian Wei, Shan Lu, Kamabe Hiroshi

    IEICE IT研究会     2022.5

  10. Rate-compatible LDPC Code in Dynamic Environment based on Reinforcement Learning

    Li Zizhen, Shan Lu, Hiroshi Kamabe

    信学技報, vol. 121, no. 327, IT2021-35, pp. 40-44, 2022年1月.     2022.1

  11. フェージングチャネル上のマルチユーザーシステムのための機械学習を用いた信号点配置の設計

    石橋弘也, 路 姍, 鎌部 浩

    信学技報, vol. 121, no. 327, IT2021-36, pp. 45-50, 2022年1月.     2022.1

  12. Signature Code Designed by Binarized Neural Networks

    Lantian Wei, Shan Lu, Hiroshi Kamabe

    信学技報, vol. 121, no. 327, IT2021-34, pp. 34-39, 2022年1月.     2022.1

  13. DNAストレージのための有限状態符号における誤りの検出及び訂正能力に関する研究

    丸茂 巧, 鎌部 浩, 路 姍

    信学技報, vol. 121, no. 291, MRIS2021-13, pp. 11-16, 2021年12月.     2021.12

  14. OMP Algorithm with Prior Information for Identification and Channel Estimation on Multiple Access Fading Channel

    Shan Lu, LianTian Wei, Hiroshi Kamabe

    信学技報, vol. 121, no. 28, IT2021-10, pp. 54-59, 2021年5月.     2021.10

  15. CSE法における再構成可能な部分文字列の十分条件に関する一考察

    田中駿伍, 鎌部 浩, 路 サン

    信学技報, vol. 120, no. 410, IT2020-116, pp. 25-30, 2021年3月.     2021.3

  16. Deep Learningを用いた多重接続通信路における符号の構成

    石橋弘也, 魏 藍天, 路 サン, 鎌部 浩

    信学技報, vol. 120, no. 320, IT2020-90, pp. 148-152, 2021年1月.     2021.1

  17. 分割可能な構造の拡張に基づいた符号化キャッシング

    神野寛和, 鎌部 浩, 路 サン

    信学技報, vol. 120, no. 320, IT2020-109, pp. 259-264, 2021年1月.     2021.1

  18. User Identification and Channel Estimation by DNN-Based Decoder on Multiple-Access Channel

    Lantian Wei, Shan Lu, Hiroshi Kamabe, Jun Cheng

    GLOBECOM 2020 - 2020 IEEE Global Communications Conference     2020.12

     More details

    Publisher:IEEE  

    DOI: 10.1109/globecom42002.2020.9322258

  19. フェージングを考慮した再生系の性能評価

    諫山茉奈, 路 サン, 鎌部 浩

    信学技報, vol. 119, no. 464, MRIS2019-46, pp. 1-5, 2020年3月.     2020.3

  20. User Identification Through Signature Codes over a Fading Channel

    Muhammad Hamad Gul, Hiroshi Kamabe, Shan Lu

    信学技報, vol. 119, no. 376, IT2019-50, pp. 87-91, 2020年1月.     2020.1

  21. シフト演算を利用した噴水符号のシフト量最適化による性能改善

    成瀬雄也, 鎌部 浩, 路 サン

    信学技報, vol. 119, no. 376, IT2019-67, pp. 179-184, 2020年1月.     2020.1

  22. The Recovery of (0,1)-Vector Based on Deep Neural Network

    Lantian Wei, Shan Lu, Hiroshi Kamabe

    信学技報, vol. 119, no. 198, IT2019-28, pp. 13-17, 2019年9月.     2019.9

  23. QC-LDPC符号を用いたJoint Source and Channel符号化法の性能評価

    桑村誓弥, 路 サン, 鎌部 浩

    信学技報, vol. 119, no. 198, IT2019-27, pp. 7-11, 2019年9月.     2019.9

  24. マスキングによる2次元LDPC符号の性能

    鎌部 浩, 路 サン

    信学技報, vol. 118, no. 347, MRIS2018-20, pp. 1-5, 2018年12月.     2018.12

  25. 一般化Cayley距離の上界

    山脇 章, 鎌部 浩, 路 サン

    信学技報, vol. 118, no. 205, IT2018-28, pp. 7-12, 2018年9月.     2018.9

  26. Immink符号化法の拡張について

    信学技報, vol. 117, 2017年12月.     2017.12

  27. Iterative Collision Cancellation for Slotted ALOHA with Link Fading

    Guanghui Song, Shan Lu, Jun Cheng

    信学技報, vol. 117, no. 347, ITS2017-57, pp. 257-261, 2017年12月.     2017.12

  28. ハミング符号を用いたコセット符号化によるParallel RIO符号の構成

    山脇 章, 鎌部 浩, 路 サン

    信学技報, vol. 117, no. 39, IT2017-13, pp. 73-78, 2017年5月.     2017.5

  29. Achieving Multiple-Vehicle Message Exchange by Spatially Coupled Coding

      Vol. 116 ( 479 ) page: 229 - 233   2017.3

     More details

    Language:English  

    CiNii Books

  30. Input-Output Weight Distribution of Terminated recursive systematical convolutional codes

      Vol. 116 ( 163 ) page: 25 - 29   2016.7

     More details

    Authorship:Lead author   Language:English  

    CiNii Books

  31. Signature Code for Multiple-Access Adder Channel

    LU Shan, CHENG Jun, WATANABE Yoichiro

    IEICE technical report. Information theory   Vol. 112 ( 215 ) page: 47 - 52   2012.9

     More details

    Language:English   Publisher:The Institute of Electronics, Information and Communication Engineers  

    We survey error-correcting signature codes for multiple-access adder channel. First, we give the recursive construction of a (k+1)-ary signature code with minimum distance 2^<j-1>. Also we give the decoding rule for the signature code, consisting of error correction and user identification. Second, we give the construction of binary error-correcting signature code. By using a Hadamard matrix of order n, we construct a binary signature code with the minimum distance of n/2. These (k+1)-ary and binary codes are used to identify users through the multiple-access adder channel, even in the presence of channel noise.

    CiNii Books

  32. Decoding Scheme for Non-Binary signature Code

    LU Shan, CHENG Jun, WATANABE Yoichiro

    IEICE technical report. Information theory   Vol. 112 ( 124 ) page: 125 - 129   2012.7

     More details

    Language:English   Publisher:The Institute of Electronics, Information and Communication Engineers  

    Signature code is for user identification in a T-user multiple-access communication system with multiple-access adder channel. In the system, each user is assigned to two codewords and the common zero codeword is shared among all T users. A decoding rule for a non-binary signature code is proposed. For the non-binary signature code, a matrix is introduced whose product with Hadamard matrix is a block diagonal matrix. The block diagonal matrix guarantees the decoding of the non-binary signature code. The procedure of error correction and user identification is given for the system.

    CiNii Books

▼display all

Presentations 19

  1. Multiuser Coding Scheme for Random Access Gaussian Channel

    S. Lu, R. Shibata, H. Kamabe, J. Cheng

    第41回情報理論とその応用シンポジウム  2018 

     More details

    Event date: 2018

  2. 大規模ランダムアクセス通信路のための符号化方式

    路サン, 鎌部浩

    The third workshop on information theory, coding theory and their applications 2019  2019.3 

  3. LEDプロペラの光跡を用いた空対地ドローンイメージセンサー通信

    曹晨宇, 唐正強, 鄭錦星,路姗, 山里敬也

    電子情報通信学会 総合大会, A-9-10  2024.3 

  4. Neural network detection of LDPC-coded random access CDMA systems

    Y. Ichiki, G. Song, K. Cai, S. Lu, J. Cheng

    Proc. 2018 Int. Symposium on Information Theory and Its Applications (ISITA2018)  2018.10.28 

     More details

    Presentation type:Poster presentation  

  5. Multiuser coding by difference matrices for multiple-access adder channel

    S. Lu, W. Hou, J. Cheng

    The Workshop on Error-Correcting Coding, Okinawa, Japan  2013.8 

  6. Construction of signature code for multiple-access adder channel

    実験計画法ならびに情報数理と関連する組合せ構造 2018  2018.11.2 

  7. Construction of Parallel RIO Codes using Coset Coding with Hamming Codes

    A. Yamawaki, H. Kamabe, S. Lu

    Proc. Non-Volatile Memories Workshop (NVMW)  2019.3 

     More details

    Language:English  

    Venue:CA,USA  

  8. Codes for T-User asymmetric multiple-access channel with independent sources

    S. Lu, H. Kamabe, J. Cheng

    The 40th Symposium on Information Theory and its Application (SITA2017)  2017 

  9. 深層学習を用いた受信電波強度による屋内測位の精度評価

    成田悠馬, 路サン,鎌部浩

    電子情報通信学会総合大会  2020.3 

     More details

    Presentation type:Oral presentation (general)  

  10. ファイルサイズが異なる場合のユーザー数に対する符号化キャッシングの性能

    横地章宏, 路サン,鎌部浩

    電子情報通信学会総合大会2020  2020.3 

     More details

    Presentation type:Oral presentation (general)  

  11. Learning-based approach for designing error-correcting codes Invited

    Shan LU

    The 9th workshop of error-correcting codes  2020.8 

     More details

    Presentation type:Oral presentation (invited, special)  

  12. 双方向中継通信路におけるトレリス符号化変調の低演算量復号法

    岩田 健佑, 路 サン,程 俊, 渡辺 陽一郎

    電子情報通信学会総合大会講演論文集  2013.3 

     More details

    Presentation type:Oral presentation (general)  

  13. Unrestricted-Rate Parallel RIO codes

    S. Lu, H. Kamabe, A. Yamawaki, J. Cheng

    Non-Volatile Memories Workshop (NVMW)  2017.3 

  14. 通信範囲拡大のための光無線を統合したハイブリッド型ローカル5Gテストベッド

    鄭錦星,路姍, 山里敬也

    電子情報通信学会 総合大会, A-9-13  2024.3 

  15. 車載ローリングシャッタ方式イメージセンサを用いた路車間可視光通信システムの時速50 km における受信性能評価

    近藤涼太, 路姍, 山里敬也

    電子情報通信学会 総合大会, A-9-14  2024.3 

  16. 複数LEDを用いた受信機移動環境下でのイベントベースビジョンセンサ可視光通信

    江原大貴, 唐正強, 山里敬也, 路姍

    電子情報通信学会 総合大会, A-9-11  2024.3 

  17. 可視光通信信号を用いた協調認識によるスロットカーの優先道路横断デモンストレーション

    中野幸亮, 路姍, 山里敬也

    電子情報通信学会 総合大会, A-13-18  2024.3 

  18. イベントカメラおよびウォルシュ・アダマール変換を用いた受信機周辺の環境認識

    永井日菜, 江原大貴, 路姍, 山里敬也

    電子情報通信学会 総合大会, A-9-12  2024.3 

  19. OMNeT++を用いたNR-V2Xの性能評価シミュレーション

    呉穎毅, 山里敬也, 路姍

    電子情報通信学会 総合大会, A-13-17  2024.3 

▼display all

KAKENHI (Grants-in-Aid for Scientific Research) 7

  1. 大規模ランダムアクセス通信に対する深層学習と情報理論による性能最適化

    2023.4 - 2024.3

    九州大学マス・フォア・インダストリ研究所 

  2. 変動する大規模通信ネットワークでの符号の構成及び割り当て方式の研究

    2022.11 - 2023.10

    越山科学技術振興財団 

  3. 強化学習を利用して大規模マシンタイプ通信におけるマルチユーザー検出に関する研究

    2021.4 - 2022.3

    豊田理化研究所 

      More details

    Authorship:Principal investigator 

  4. 岐阜大学 工学部 若手海外渡航援助経費

    2020.1

  5. Analysis and Construction of Combinatorial Structures with Sparse Incidence Matrices

    Grant number:18H01133  2018.4 - 2023.3

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

  6. Research on Coding for Large-Scale Sensor Networks

    Grant number:18K04132  2018.4 - 2021.3

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

    LU SHAN

      More details

    This research project aims to construct a coding method and decoding algorithm for large-scale sensor networks and evaluate their characteristics.
    For coding methods in multiple access channels, (1) an algebraic coding method and (2) successive interference cancellation-based coding schemes are proposed to obtain a code with a higher transmission rate and performance.
    Furthermore, as a decoding method for the multiple access channel, we proposed (3) an iterative decoding method based on compressed sensing and (4) the iterative decoding method based on neural network learning to improve the decoding performance.

  7. フラッシュメモリための誤り訂正符号の構成

    2017.8

    村田学術振興財団  研究者 海外派遣助成 

▼display all

Industrial property rights 1

  1. Network coding based on turbo decoding

     More details

    Application no:特願CN101674091 

 

Teaching Experience (Off-campus) 5

  1. プログラミング基礎(情報コース)

    2023.10 - 2024.3 Gifu University)

  2. プログラミング応用(情報コース)

    2023.4 - 2023.9 Gifu University)

  3. 通信理論特論

    2017.10 - 2023.9 岐阜大学自然科学技術研究科)

  4. 情報工学実験Ⅱ(応用情報実験Ⅱ)

    2016.10 - 2023.3 工学部(昼))

  5. 初年次セミナー

    2016.4 - 2023.9 岐阜大学工学部電気電子・情報工学科・情報コース)

 

Social Contribution 2

  1. 東ティモールCADEFEST2 遠隔指導

    Role(s):Advisor

    JICA - 国際協力機構  2020.4 - 2022.3

  2. 東ティモール国立大学 工学部能力向上プロジェクト 専門家派遣

    Role(s):Lecturer, Advisor, Informant

    JICA - 国際協力機構  2019.2