马啸
信息理论及其应用,编码理论及其应用,无线通信系统中的编码技术,数字存储系统中的编码技术。
个性化签名
- 姓名:马啸
- 目前身份:
- 担任导师情况:
- 学位:
-
学术头衔:
博士生导师, 教育部“新世纪优秀人才支持计划”入选者
- 职称:-
-
学科领域:
通信技术
- 研究兴趣:信息理论及其应用,编码理论及其应用,无线通信系统中的编码技术,数字存储系统中的编码技术。
马啸,工学博士,中山大学信息科学与技术学院,博士生导师。
教育背景:
2000年,博士,通信与信息系统,西安电子科技大学;
1997年,硕士,通信与电子系统,西安电子科技大学;
1991年,学士,应用数学,哈尔滨船舶工程学院。
工作经历:
2004.7—现在,中山大学信息科学与技术学院,教授/博士生导师;
2007.10—2008.1,新加坡数据存储研究中心,访问教授(Visiting Professor);
2002.9—2004.12,香港城市大学,研究员(Research Fellow);
2000.10—2002.9,哈佛大学,博士后(Postdoctoral Fellow);
2000.6—2000.10,特拉华大学,研究学者(Research Scholar);
1999.3—1999.6,香港城市大学,研究助理(Research Assistant);
1991.9—1994.7,河南焦作大学,教师。
研究兴趣:
信息理论及其应用,编码理论及其应用,无线通信系统中的编码技术,数字存储系统中的编码技术。
获奖和荣誉:
2006年获IEEE通信学会颁发的最佳论文奖(2005 Best Paper Award in Signal Processing and Coding for Data Storage);
2006年获微软亚洲研究院颁发的微软青年教授奖(2006 Microsoft Professorship Award);
2007年入选教育部新世纪优秀人才支持计划。
学术任职:
2007年至今,中国电子学会信息论分会委员;IEEE会员。
科研项目:
主持国家自然科学基金一项;主持国家自然科学基金委-广东省人民政府联合基金一项。
科研论文:
在IEEE Trans. Inform. Theory等国内外杂志和会议上发表论文多篇,为同行引用100余次,其中近五年被SCI他引70余次。
专利申请:
近年来申请专利2项。
-
主页访问
1624
-
关注数
0
-
成果阅读
257
-
成果数
7
【期刊论文】Matched Information Rate Codes forPartial Response Channels
马啸, Aleksandar Kavcic, Xiao Ma and Nedeljko Varnica
,-0001,():
-1年11月30日
In this paper we design capacity-approaching codes for partial response channels. The codesare constructed as concatenations of inner trellis codes and outer low-density parity-check (LDPC)codes. Unlike previous constructions of trellis codes for partial response channels, we disregardany algebraic properties (e.g., the minimum distance or the run-length limit) in our design of thetrellis code. Our design is purely probabilistic in that we construct the inner trellis code to mimicthe transition probabilities of a Markov process that achieves a high (capacity-approaching) informationrate. Hence, we name it a matched information rate (MIR) design. We provide a set of5 design rules for constructions of capacity-approaching MIR inner trellis codes. We optimizethe outer LDPC code using density evolution tools specially modified to fit the superchannelconsisting of the inner MIR trellis code concatenated with the partial response channel. Usingthis strategy, we design degree sequences of irregular LDPC codes whose noise tolerance thresholdsare only fractions of a decibel away from the capacity. Examples of code constructions areshown for channels both with and without spectral nulls.
-
43浏览
-
0点赞
-
0收藏
-
0分享
-
152下载
-
0评论
-
引用
【期刊论文】Coded Modulation Using Superimposed Binary Codes
马啸, Xiao Ma and Li Ping, Member, IEEE
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL.50, NO.12, DECEMBER 2004,-0001,():
-1年11月30日
In this correspondence, we investigate in a comprehensivefashion a one-layer coding/shaping scheme resembling a perfectly cooperatedmultiple-access system. At the transmitter, binary data areencoded by either single-level or multilevel codes. The coded bits are firstrandomly interleaved and then entered into a signal mapper. At each time,the signal mapper accepts as input multiple binary digits and deliversas output an amplitude signal, where the input are first independentlymapped into 2-PAM signals (possibly having different amplitudes) andthen superimposed to form the output. The receiver consists of an iterativedecoding/demapping algorithm with an entropy-based stopping criterion.In the special cases when all the 2-PAM signals have equal amplitudes,based on an irregular trellis, we propose an optimal soft-input–soft-output(SISO) demapping algorithm with quadratic rather than exponentialcomplexity. In the general cases, when multilevel codes are employed,we propose power-allocation strategies to facilitate the iterative decoding/dempaping algorithm. Using the unequal power-allocations andthe Gaussian-approximation-based suboptimal demapping algorithm(with linear complexity), coded modulation with high bandwidth efficiencycan be implemented.
-
61浏览
-
0点赞
-
0收藏
-
0分享
-
105下载
-
0评论
-
引用
【期刊论文】Iterative Detection/Decoding for Two-TrackPartial Response Channels
马啸, Xiao Ma and Li Ping, Member, IEEE
IEEE COMMUNICATIONS LETTERS, VOL.8, NO.7, JULY 2004,-0001,():
-1年11月30日
In this letter, we investigate the iterative detection/decoding algorithms for two-track partial response channels.We first describe the iterative algorithm as an iterative message-passing/processing algorithm over a high-level normal graphand then propose two trellis-based detection algorithms. Thenatural one is based on a joint trellis, which can be implementedfor low-order channels. For moderate-order channels, we proposea separated detection, which is based on two single-track trellises.Compared with the joint detection, the separated detection issimpler in most cases. Simulation results show that, for two-trackEPR4 channels with minor intertrack interferences, the separateddetection causes only marginal degradation in performance.
-
42浏览
-
0点赞
-
0收藏
-
0分享
-
106下载
-
0评论
-
引用
【期刊论文】Power allocations for multilevel codingwith sigma mapping
马啸, X. Ma and L. Ping
ELECTRONICS LETTERS 13th May 2004 Vol.40 No.10,-0001,():
-1年11月30日
A recursive power-allocation method for multilevel coding systemswith sigma mapping is proposed. With the proposed power allocation,it is possible to design iteratively decodable capacity-approachingcodes with high bandwidth efficiency by using binary turbo-likecodes.
-
24浏览
-
0点赞
-
0收藏
-
0分享
-
79下载
-
0评论
-
引用
马啸, Aleksandar Kavcic, Member, IEEE, Xiao Ma, and Michael Mitzenmacher
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL.49, NO.7, JULY 2003,-0001,():
-1年11月30日
We study the limits of performance of Gallager codes(low-density parity-check (LDPC) codes) over binary linear intersymbolinterference (ISI) channels with additive white Gaussiannoise (AWGN). Using the graph representations of the channel,the code, and the sum-product message-passing detector/decoder,we prove two error concentration theorems. Our proofs expandon previous work by handling complications introduced by thechannel memory. We circumvent these problems by consideringnot just linear Gallager codes but also their cosets and by distinguishingbetween different types of message flow neighborhoodsdepending on the actual transmitted symbols. We compute thenoise tolerance threshold using a suitably developed densityevolution algorithm and verify, by simulation, that the thresholdsrepresent accurate predictions of the performance of the iterativesum-product algorithm for finite (but large) block lengths. Wealso demonstrate that for high rates, the thresholds are very closeto the theoretical limit of performance for Gallager codes overISI channels. If C denotes the capacity of a binary ISI channeland if Ci i d denotes the maximal achievable mutual informationrate when the channel inputs are independent and identicallydistributed (i.i.d.) binary random variables (Ci i d C), weprove that the maximum information rate achievable by thesum-product decoder of a Gallager (coset) code is upper-boundedby Ci i d . The last topic investigated is the performance limit ofthe decoder if the trellis portion of the sum-product algorithm isexecuted only once; this demonstrates the potential for tradingoff the computational requirements and the performance of thedecoder.
-
39浏览
-
0点赞
-
0收藏
-
0分享
-
131下载
-
0评论
-
引用
【期刊论文】Path Partitions and Forward-Only TrellisAlgorithms
马啸, Xiao Ma and Aleksandar Kavcic, Member, IEEE
,-0001,():
-1年11月30日
This is a semi-tutorial paper on trellis-based algorithms.We argue that most decoding/detection algorithms describedon trellises can be formulated as path-partitioning algorithms,with proper definitions of mappings from subsets of pathsto metrics of subsets. Thereby, the only two operations neededare path-concatenation and path-collection, which play the roles ofmultiplication and addition, respectively. Furthermore, we showthat the trellis structure permits the path-partitioning algorithmsto be formulated as forward-only algorithms (with structures resemblingthe Viterbi algorithm), thus eliminating the need forbackward computations regardless of what task needs to be performedon the trellis. While all of the actual decoding/detectionalgorithms presented here are rederivations of variations of previouslyknown methods, we believe that the exposition of the algorithmsin a unified manner as forward-only path-partitioningalgorithms is the most intuitive manner in which to generalize theViterbi algorithm. We also believe that this approach may in factinfluence the practical implementation of the algorithms as well asinfluence the construction of other forward-only algorithms (e.g.,byte-wise forward-only detection algorithms).
-
21浏览
-
0点赞
-
0收藏
-
0分享
-
87下载
-
0评论
-
引用
【期刊论文】On the Minimal Interpolation Problem and Decoding RSCodes
马啸, Xiao Ma and Xin-mei Wang, Member, IEEE
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL.46, NO.4, JULY 2000,-0001,():
-1年11月30日
Some properties of the minimal interpolation problemare investigated, from which a simple proof of the validity of theWelch-Berlekamp algorithm is presented. A new key equation is derived,which is closely related to the classical key equation of syndrome-decodingalgorithm and can be solved by the Welch–Berlekamp algorithm.
-
27浏览
-
0点赞
-
0收藏
-
0分享
-
116下载
-
0评论
-
引用