学术信息网 西电导航 关于 使用说明 搜索 系统首页 登录 控制面板 收藏 慕建君的留言板
学术论文

      近年来在,《IEEE Transactions on Communications《IEEE Communications Letters》、《IEICE Trans.Commun. 》、《Progress in Natural Science》、《ELECTRONICS LETTERS》、《Chinese Journal of Electronics》、《电子学报》和《计算机学报》等国内外核心期刊和国际会议共发表论文40余篇,其中被SCI检索22篇次,EI检索30篇次。

 

2011-2017年

[1]Xiaopeng Jiao,Yucheng He, and Jianjun Mui, “Memory-Reduced Lookup Tables for Efficient ADMM Decoding of LDPC Codes”, IEEE Signal Processing Letters25(1), 110-114, 2018. (SCI检索:    ,EI检索No).

[2] Peng Zhao, Jianjun Mu, Yucheng He, Xiaopeng Jiao. “Multipermutation Codes Correcting a burst of Deletions”. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. vol. E101-A, no.02, pp. ????-????, February, 2018. (SCI检索:    ,EI检索No). 

[3] Peng Zhao, Jianjun Mu, Xiaopeng Jiao. “Multipermutation Codes Correcting a Predetermined Number of Adjacent Deletions”. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. vol. E100-A, no.10, pp. 2176-2179, October, 2017. (SCI检索:    ,EI检索No20174004237316).

[4]Xiaopeng Jiao, Jianjun Mu,Yucheng He, and Chao Chen, Efficient ADMM Decoding of LDPC Codes Using Look-Up Tables,IEEE Transactions on Communications,65(4), 1425-1437, 2017. ( SCI检索:000399749900001源,EI检索No:20172003663391,JCR一区), 2017.

[5]Xiaopeng Jiao, Jianjun Mu, Haoyuan Wei, “Reduced Complexity Node-Wise Scheduling of ADMM Decoding for LDPC Codes”, IEEE Communications Letters, 21(3),472-475,2017. (SCI检索:000398251500007,EI检索No:20171203480397),Jan.2017.

[6]  Biao Wang, Jianjun Mu, Xiaopeng Jiao, Haoyuan Wei,“Improved Penalty Functions of ADMM Penalized Decoder for LDPC Codes”, IEEE Communications Letters, 21(2), 234-237, Feb. 2017. (SCI检索:000395736700004,EI检索No:20171103445198).

[7] Guiping Li, Jianjun Mu and Xiaopeng Jiao, Junjun Guo, Xiaohang Liu. “Enhanced Belief Propagation Decoding of Polar Codes by Parity-Check Matrix Adaptation”, EURASIP Journal on Wireless Communications and Networking, (2017) 2017: 40(1), 2017.DOI 10.1186/s13638-017-0825-3(SCI检索:000395006700001,EI检索No:20171403531954).

[8] Junjun Guo, Jianjun Mu, Xiaopeng Jiao, and Peng Zhao. “Suppressing Fractional Pseudocodewords by Eliminating Small Instantons”. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. vol. E99-A, no.02, pp. 674-677, Feb. 2016(SCI检索:000376162600034,EI检索No:20160701925262).

[9] Xiaopeng Jiao, Jianjun Mu, “Lowering the Error Floor of ADMM Penalized Decoder for LDPC Codes”, CHINA COMMUNICATIONS., vol.13, no.08, pp.125-137, 2016. (SCI检索No.: 000382095500013,EI检索No.: 16286953).

[10] Xiaopeng Jiao, Haoyuan Wei, Jianjun Mu, “Improved ADMM Penalized Decoder for Irregular Low-Density Parity-Check Codes(DOI: 10.1109/LCOMM.2015.2421445)”, IEEE Communications Letters, IEEE Communications Letters.2015(SCI检索:000356164000006,EI检索No:20152600984530).

[11] Haoyuan Wei, Xiaopeng Jiao, Jianjun Mu, “Reduced-Complexity Linear Programming Decoding Based on ADMM for LDPC Codes”, IEEE Communications Letters, 19(6), 909-912, June 2015.(SCI检索:000356164000005,EI检索No:20152600984645).

[12] Junjun Guo,Zhiyong Li, Jianjun Mu, “Collaborative Representation Graph for Semi-supervised Image Classification”. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. vol. E98-A, no.08, pp.1781-1784, 2015.(SCI检索:000359467200043,EI检索No:20153301167137)

[13] Junjun Guo, Jianjun Mu, Xiaopeng Jiao and Guiping Li,“ Finding Small Fundamental Instantons of LDPC Codes by Path Extension”,IEICE Transactions on Fundamentals of Electronics, Communications and Computer SciencesVol.E97-A, No.4  pp.1001-1004, 2014(SCI检索:000342738500013,EI检索No:20141517554957). pdf文档

[14]Xiaopeng Jiao, Jianjun Mu,“Improved Check Node Decomposition for Linear Programming Decoding”,IEEE Communications Letters, IEEE Communications Letters. 17(2), 377-380, Feb., 2013. (SCI检索No.: 000316260700035,EI检索No.: 20131216130436).pdf文档

[15] Xiaopeng Jiao, Jianjun Mu,“ Iterative Decoding for the Davey-MacKay  Construction over IDS-AWGN Channel”,IEICE Transactions on Fundamentals of Electronics, Communications and Computer SciencesVol.E96-A, No.5  pp.1006-1009, 2013(SCI检索No.: 000319085600024).pdf文档

[16]Xiaopeng Jiao, Jianjun Mu, Fan Fang, and Rong Sun, “Lowering Error Floors of Irregular LDPC Codes by  Combining Construction and Decoding”, IEICE Trans.Commun., Vol.E95-B, No.1  pp.271-274, 2012(SCI检索No.: 000299588400034,EI检索No.: 20120114665739 pdf文档.
 

[17] Jianjun Mu, Xiaopeng Jiao, Jianguang LIU, Rong Sun, “Parity-check matrix extension to lower the error floors of  irregular LDPC codes”, IEICE Trans.Commun., Vol.E94-B  No.6 , pp.1725-1727, 2011. (SCI检索号:  00292480500024,EI检索号: 20112314037478).   pdf文档.
[18] Yang Yang, Chao Chen, Jianjun Mu, Jing Wang, Rong Sun, Xinmei Wang. Nonbinary quasi-cyclic LDPC cycle codes with low-density systematic quasi-cyclic generator matrices. IEICE Trans.Commun., vol.E94-B, no.09, pp.2620-2623, 2011.(SCI检索号:000294701700024,EI检索号: 20113614305830)pdf文档

[[19]  郭军军, 慕建君. 一种LDPC码有限字母表迭代译码器选择算法. 西安电子科技大学学报, 第40卷,第6期,pp. 111-115,2013(EI检索No.: 20140117165500 ).

[20]慕建君,赵鹏,焦晓鹏,“一种纠单个闪存单元移位错误码的译码方法”,西安电子科技大学学报,第43卷,第6期,pp.51-55,2016. (EI检索No.: 20165203176177).

[21]张旋,慕建君,焦晓鹏,“一种MLC闪存存储系统的比特翻转译码算法”,西安电子科技大学学报,第44卷,第  期,2017,pp.??-??. (EI检索源).已经录用.

[22]李桂萍,慕建君,焦晓鹏,“极化码串行抵消多比特翻转译码算法”,西安电子科技大学学报,第44卷,第2期,2017,pp.63-68. (EI检索No.: 20172103687734).

[23]  Weinan Xu,Xiaopeng Jiao, Jianjun MuEvaluating the performance of Turbo Equalization with ADMM decoding,2017IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2017), Xiamen, Yunnan, China, p1-5,2017(EI检索No.:).

[24] Xiaopeng Jiao, Jianjun Mu, Junjun Guo, “A Comparison Study of LDPC Decoding Using Accelerated ADMM and Over-relaxed ADMM”, in Proc. of 2016 2nd IEEE International Conference on Computer and Communications,Chengdu, China, Oct. 2016, pp. 191-195. (EI检索No.: 20172303742674)

[25]Xiaopeng Jiao, Jianjun MuProbabilistic Analysis of Cycles in Random Tanner Graphs,2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013), Kunming, Yunnan, China, p1-5,2013(EI检索No.: 20140417228803).

[26]

2001-2010

[1].Jianjun MU, Xiaopeng JIAO, Xinmei WANG, “Exact thresholds for low-density parity-check codes”, Progress in Natural Science,19(7), 897-900, July, 2009. (SCI收录: No.: 000266345100014).  pdf文档.
[2]. MU Jianjun, “Performance Analysis of Regular Low-Density Erasure Codes”, Chinese Journal of Electronics, 17(2),377-380, April, 2008. (SCI收录: No.: 000255103200039, EI收录: No.: 081711220346)
[3]. Mu Jianjun, He Yucheng, Sun Shaohui, and Wang Xinmei, “Design Method of Sequences of Degree Distribution for Low-Density Erasure Codes”, Chinese Journal of Electronics, 11(3), 2002, pp.372-376. (SCI检索No.:000177299000020,EI检索No.:02347055362).
[4]. X.-P. Jiao, J.-J. Mu and L.-H. Zhou, “Eliminating small stopping sets in irregular low-density parity-check codes”,IEEE Communications Letters, 13(6), 435-437, June, 2009. (SCI检索No.: 000267064800023, EI检索No.: 20093012216125).
[5]. X.-P. Jiao, J.-J. Mu and L.-H. Zhou, “Modification of improved decoding algorithm for LDPC codes over BEC,” ELECTRONICS LETTERS, 44(8), 542-543, 2008, April.(SCI检索No.: 000255414900026, EI检索No.: 081711215952).
[6]. Mu Jianjun, and Wang Xinmei,“Analysis of the thresholds for regular low-density erasure codes”, Proceedings-21st International Conference on Advanced Information Networking and Applications, AINA 2007, 2007, pp. 800-804. (EI检索No.: 073910826558. ISTP检索No.: 000247030000107).
[7]. Jian-Jun Mu, “Analysis and proof of the stability condition for low-density erasure codes,” in Proc. of International Conference on Info-tech & Info-net,ICII’2001, Beijing, pp.824-827, Oct. 2001.
[8]. 慕建君,曹训志,王新梅,“右边正则纠删码中二部图的构造算法”,计算机学报,第32卷,第7期,2009,pp. 1331-1336. (EI检索No.: 20093612289583).
[9]. 慕建君,焦晓鹏,曹训志,“数字喷泉码及其应用的研究进展与展望”,电子学报,第37卷,第7期,2009,pp. 1571-1577. (EI检索No.: 20093612285276).
[10]. 慕建君,孙韶辉,王新梅,“关于线性时间复损码的研究”,电子学报,第30卷,第1期,2002,pp.122-125. (EI检索No.: 02397107660).
[11]. 慕建君,王新梅,“基于级联稀疏二部图的右边正则纠删码精确阈值”,自然科学进展,第18卷,第4期,2008,pp.596-600.
[12]. 慕建君,王新梅,“低密度纠删码度分布序列的研究”,电子学报,第31卷,第7期,2003,pp.1066-1 069. (EI检索No.: 03467728539).
[13]. 慕建君,王新梅,“低密度纠删码度分布序列的若干分析性质”, 计算机学报,第26卷,第1期,2003,pp.60-64. (EI检索No.: 03287540866).
[14]. 慕建君,王鹏,王新梅,“基于改进型右边正则度分布序列的低密度纠删码”,计算机学报,第26卷,第12期,2003,pp.1734-1738. (EI检索No.: 04138090535).
[15]. 慕建君,“关于几类线性分组码网格图的复杂度的研究”,通信学报,2001,第22卷,第11期,pp.6-10.
[16]. 慕建君,贺玉成,王新梅,“低密度纠删码稳定收敛条件的证明”,电子学报,第30卷,第4期,2002,pp.530-532. (EI检索No.: 02407123737).
[17]. 慕建君,王鹏,王新梅,“正则低密度纠删码的分析”,西安电子科技大学学报,第30卷,第4期,2003,pp.469-472. (EI检索No.: 03507781589).
[18]. 慕建君,路成业,王新梅,“关于纠删码的研究与进展”,电子信息学报,第24卷,第9期,2002,pp.1276-1281.
[19]. 慕建君,“线性分组码网格图的复杂度”,西安电子科技大学学报,2001,第28卷,第1期,pp.39-42. EI检索(No.: 01416684199).
[20]. 慕建君,贺玉成,“二维乘积码的网格图复杂度”,西安电子科技大学学报,2001,第28卷,第5期,pp.685-688.
[21]. 慕建君,“一种形式化分析安全协议的新模型”,西安电子科技大学学报,2006,第33卷,第3期,pp.381-385.
[22]. 慕建君,焦晓鹏,曹训志,“一类逼近容量LDPC纠删码的二部图构造算法”,西安电子科技大学学报,2010,第37卷,第4期,pp.705-709. (EI检索No.:20103613222037)..
[23]. 贺玉成,慕建君,王新梅,“基于置信传播算法的低密度校验码量化译码设计”, 计算机学报,第26卷,第8期,2003,pp.934-939. (EI检索No.: 03507781403).
[24]. 贺玉成,杨莉,慕建君,王新梅,“LDPC码的不可检测译码错误分析”, 通信学报,第23卷,第1期,2002,pp.1-7.
[25]. 焦晓鹏慕建君,周利华,“基于树结构展开的Tanner图短环计数算法”,西安电子科技大学学报,2010,第37卷,第2期,pp.311-314. (EI检索No.:20102112950282)..
[26]. 孙韶辉,慕建君, “低密度校验码研究及其新进展”,西安电子科技大学学报,第28卷,第3期, 2001, pp.393-397.
[27]. 孙蓉,刘景伟,王新梅,慕建君,“系统规则RA码在BEC信道下的性能界分析”, 西安电子科技大学学报,第35卷,第4期,2008,pp.712-715. (EI检索No.: 083711541262)

版权声明:未经西安电子科技大学以及个人主页教师本人许可不得复制,转载传播本主页内容或用于任何商业用途,如需转载请征得主页所有者同意,并附上主页链接.
西安电子科技大学个人主页 站点地图 | | 慕建君的留言板 | 更新日期 :2017-12-15 | |
Copyright © 2011-2016 西安电子科技大学 版权所有 陕ICP备021284(05016169) Powered by 信息化建设处 & 电院网络中心