| ²é¿´: 914 | »Ø¸´: 0 | |||
yexuqingľ³æÖ®Íõ (ÎÄѧ̩¶·)
Ì«ÑôϵϵÖ÷ÈÎ
|
[½»Á÷]
µ±ÄêÇ廪¡°ÁòËáÆÃÐÜ¡±´óѧÉúÒѳÉÖпÆÔº¸±Ñо¿Ô±
|
|
2002Äê2Ô£¬Ç廪´óѧ»úµçϵ´óѧÉúÁõº£Ñó£¬ÔÚ±±¾©¶¯ÎïÔ°ÓÃÁòËáÆÃÉËÁË5Ö»ÐÜ£¬Òý·¢ÁËÈ«¹ú¹Ø×¢¡£ ÐÕÃû£º Áõº£ÑóÐԱ𣺠ÄÐÖ°³Æ£º ¸±Ñо¿Ô±Ö°Îñ£º ѧÀú£º ²©Ê¿µç»°£º 010-82995611´«Õ棺 µç×ÓÓʼþ£º liuhaiyang@ime.ac.cnËùÊô²¿ÃÅ£º ÐÂÄÜÔ´Æû³µµç×ÓÑз¢ÖÐÐÄͨѶµØÖ·£º ±±¾©Êг¯ÑôÇø±±ÍÁ³ÇÎ÷·3ºÅ ¼ò¡¡¡¡Àú£º ½ÌÓý±³¾° 1998.9-2002.7 Ç廪´óѧ 2004.9-2009.6 Öйú¿ÆÑ§ÔºÎ¢µç×ÓÑо¿Ëù ¹¤×÷¼òÀú 2009.7-ÖÁ½ñ Öйú¿ÆÑ§ÔºÎ¢µç×ÓÑо¿Ëù ÖúÀíÑо¿Ô±/¸±Ñо¿Ô± Æä¼ä 2015.2-2017.4 Ïã¸Û³ÇÊдóѧ ·ÃÎÊÑо¿ Éç»áÈÎÖ°£º IEEE»áÔ± Ñо¿·½Ïò£º ͨÐÅÓëÐźŴ¦ÀíËã·¨¼°ÆäVLSIʵÏÖ ³Ðµ£¿ÆÑÐÏîÄ¿Çé¿ö£º 1. ¼«»¯ÂëµÄÏßÐԹ滮ÒëÂëºÍ×î´óËÆÈ»ÒëÂëÎÊÌâÑо¿. ¹ú¼Ò×ÔÈ»¿ÆÑ§»ù½ðÏîÄ¿. 2019.1-2022.12. ÏîÄ¿¸ºÔðÈË 2. ¸ßÃܶÈнéÖÊ´æ´¢Æ÷ÖеľÀ´í±àÂë¼¼ÊõÑо¿. Öйú¿ÆÑ§ÔºÎ¢µç×ÓÆ÷¼þÓ뼯³É¼¼ÊõʵÑéÊÒ¿ª·Å¿ÎÌâ. 2019.6-2020.5. ÏîÄ¿¸ºÔðÈË 3. ´óMIMOϵͳÖеÄÍøÂç±àÂë.¡°Ïã½Ñ§Õ߼ƻ®¡±ÏîÄ¿. 2015.2-2017.4. ÏîÄ¿¸ºÔðÈË 4. Öйú¿ÆÑ§ÔºÇàÄ괴дٽø»áÏîÄ¿. 2015.1-2018.12. ÏîÄ¿¸ºÔðÈË 5. ¶à½øÖÆLDPCÂëµÄÏßÐԹ滮ÒëÂë·½·¨Ñо¿. ¹ú¼Ò×ÔÈ»¿ÆÑ§»ù½ðÏîÄ¿. 2013.1-2015.12. ÏîÄ¿¸ºÔðÈË 6. »ùÓÚµÍÃÜ¶ÈÆæÅ¼Ð£ÑéÂëµÄѹËõ¸Ð֪ϵͳÉè¼ÆÓëʵÏÖ. ¹ú¼Ò×ÔÈ»¿ÆÑ§»ù½ðÏîÄ¿. 2014.1-2017.12. Ö÷Òª²ÎÓëÕß ´ú±íÂÛÖø£º »áÒéÂÛÎÄ 1. Chen C, Liu H, Bai B. Finite hyperplane codes: minimum distance and majority-logic decoding. Proc. IEEE International Symposium on Information Theory (ISIT), 2018, 2500-2504. 2. Liu H, LI Ping. Low-rate regular concatenated zigzag codes are capacity-approaching over the BEC. Proc. IEEE Information Theory Workshop (ITW), 2017, 111-115. 3. Liu H, Kim D, Li Y, et al. On the separating redundancy of extended Hamming codes. Proc. IEEE International Symposium on Information Theory (ISIT), 2015, 2406-2410. ÆÚ¿¯ÂÛÎÄ 1. Liu H, Jiao X. More on the minimum and stopping distances of RS-LDPC codes. IEEE Communications Letters, 2020, 24(3): 482-485. 2. Kong L, Liu Y, Liu H, et al. Protograph QC-LDPC and rate-adaptive polar codes design for MLC NAND flash memories. IEEE Access, 2019, 7: 37131-37140. 3. Liu H, Ma L, Zhang H. On the minimum distance of some improper array codes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019, E102-A(12): 2021-2026. 4. Liu H, Ma L. Further results on the separating redundancy of binary linear codes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019, E102-A(10): 1420-1425. 5. Liu H, Li Y, Ma L. On the separating redundancy of the duals of first-order generalized Reed-Muller codes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019, E102-A(1): 310-315. 6. Liu H, Li Y, Ma L. On the second separating redundancy of LDPC codes from finite planes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018, E101-A(3): 617-622. 7. Liu H, Zhang H, Ma L. On the spark of binary LDPC measurement matrices from complete protographs. IEEE Signal Processing Letters, 2017, 24(11): 1616-1620. 8. Liu H, Zhang H, Ma L. Further results on the minimum and stopping distances of full-length RS-LDPC codes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2017, E100-A(2): 738-742. 9. Liu H, Ma L. On the minimum distance of full-length RS-LDPC codes. IEEE Communications Letters, 2015, 19(11): 1869-1872. 10. Liu H, Huang Q, Deng G, et al. Quasi-cyclic representation and vector representation of RS-LDPC codes. IEEE Transactions on Communications, 2015, 63(4): 1033-1042. 11. Liu H, Deng G, Chen J. On the minimum-weight codewords of array LDPC codes with column weight 4. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2014, E97-A(11): 2236- 2246. 12. Liu H, Yang S, Deng G, et al. More on the minimum distance of array LDPC codes. IEEE Communications Letters, 2014, 18(9): 1479-1482. 13. Liu H, Li Y, Ma L, et al. On the smallest absorbing sets of LDPC codes from finite planes. IEEE Transactions on Information Theory, 2012, 58(6): 4014-4020. 14. Liu H, He L, Chen J. Further results on the stopping distance of array LDPC matrices. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2012, E95-A(5): 918-926. 15. Liu H, Qu W, Liu B, et al. On the decomposition method for linear programming decoding of LDPC codes. IEEE Transactions on Communications, 2010, 58(12): 3448- 3458. 16. Liu H, Ma L, Chen J. On the number of minimum stopping sets and minimum codewords of array LDPC codes. IEEE Communications Letters, 2010, 14(7): 670-672. 17. Liu H, Qu W, Liu B, et al. Novel modified min-sum decoding algorithm for low-density parity-check codes. The Journal of China Universities of Posts and Telecommunications, 2010, 17(4):1-5. 18. Liu H, Ma L, Chen J. Multistep linear programming approaches for decoding low-density parity-check codes. Tsinghua Science and Technology, 2009, 14(5): 556-560. 19. Liu H, Lin X, Ma L, et al. On the stopping distance and stopping redundancy of finite geometry LDPC codes. IEICE Fundamentals of Electronics, Communications and Computer Sciences, 2008, E91-A(8): 2159-2166. רÀûÉêÇ룺 1. Áõº£Ñó, ÍõÔÆ, °ÍÏþ»ÔµÈ. ÎÀÐǵ¼º½ÓÃBCHÂëÒëÂë·½·¨¡¢ÒëÂëÆ÷¼°ÎÀÐǵ¼º½½ÓÊÕ»ú. 201811405200.X 2. Õų¬ÒÝ, Áõº£Ñó, Àî½ðº£µÈ. GPSµ¼º½µçÎľÀ´íÒëÂëµÄ·½·¨¼°×°ÖÃ. 201810342716.8 3. ÕŶ«, Áõº£Ñó, Õų¬ÒݵÈ. BCHÂëµÄÒëÂë·½·¨. 201610720189.0 »ñ½±¼°ÈÙÓþ£º 2014ÄêÈëÑ¡¡°Ïã½Ñ§Õ߼ƻ®¡± 2015ÄêÈëÑ¡Öйú¿ÆÑ§ÔºÇàÄ괴дٽø»á»áÔ± |
» ²ÂÄãϲ»¶
¸Ð¾õÆÕͨÈËÒѾû°ì·¨ÍæÁË£¬ÌÉÆ½ÊÇΨһµÄ³ö·¡£
ÒѾÓÐ26È˻ظ´
½ËÕÊ¡ÓÅÇàÃż÷
ÒѾÓÐ20È˻ظ´
Ö²ÎïѧÂÛÎÄÈóÉ«/·ÒëÔõôÊÕ·Ñ?
ÒѾÓÐ210È˻ظ´
ÐĺÃÀÛ¡£½ñÄêÎÒÃDz¿ÃÅÌá½»ÁË18¸öÏîÄ¿¡£ÖÐÁË11ÁË£¬¿ÉϧÎÒµÄÓÖ¹ÒÁË
ÒѾÓÐ10È˻ظ´
ÃæÉÏÏîÄ¿¼Æ»®Êé
ÒѾÓÐ7È˻ظ´
ÃæÉÏÏîÄ¿¼Æ»®Ê鸽¼þ
ÒѾÓÐ9È˻ظ´
ÃæÉÏÏîÄ¿¼Æ»®Êéϵͳ״̬
ÒѾÓÐ18È˻ظ´
NSFC-UNEP£¨ÓëÁªºÏ¹ú»·¾³¹æ»®Ê𣩺Ï×÷ÏîÄ¿
ÒѾÓÐ33È˻ظ´
ºÍÒÁÀÊÈ˺Ï×÷
ÒѾÓÐ32È˻ظ´
½ËÕÊ¡×ÔÈ»»ù½ð
ÒѾÓÐ7È˻ظ´
ÉúÃü¿ÆÑ§ÐÂÓ¢ÎÄÆÕ¿¯¡¶INVESTIGATION OF LIFE SCIENCE¡·
ÒѾÓÐ2È˻ظ´














»Ø¸´´ËÂ¥