2015 International Workshop on Information Engineering, UESTC
内容简介
1．韩永祥教授：Efficient Decoding over Unknown Impulsive Noise Channels
It has been known from many researches that communication systems are
susceptible to memoryless impulsive noise characterized by, for instance, the
Bernoulli-Gaussian model. In order to combat this obstacle, channel coding has long
served as an effective tool, especially in the context of moderately frequent
occurrence of impulses, when the statistics of impulsive noise can be realized at the
decoder. In this talk, irrespective of the statistics of impulses, an efficient decoding
scheme is introduced by incorporating clipping-featured technique into the Viterbi
algorithm. As a result, the proposed decoding scheme, while having a complexity at
the same order as that of the Viterbi algorithm, is on a par with its optimal counterpart,
for which statistics of impulses is assumed known at receiver, in terms of bit error
probability. In addition, the Chernoff bounds of the bit error probabilities of the
devised decoding algorithm are derived for both Bernoulli-Gaussian noise model and
Middleton Class-A noise model. Comparisons between the bounds we derived and the
simulated error rates under a variety of settings indicate that the ensuing analysis can
provide critical insights for the efficacy of the proposed decoding approach when
dealing with precarious frequent strong impulses.
2．黄永成教授：Scheduling with Sequences in Advanced Wireless Networks
Sequences have long been an important tool in many engineering systems.
Schedule sequences, such as protocol sequences, have been proposed to address
various problems arising in communication networks by various research groups. In
this talk, we will present some recent research results on protocol sequences and
explain how they can be applied to multiple-packet reception networks, frequency
hoping and successive interference cancellation.
3．范平志教授：Convergence of Computing, Telecommunications and Storage
In this talk, information systems consisting of data transmission, data
computation (processing) and data storage are considered. In the past, the computing,
telecommunications and storage were independently progressed, and each of them has
reached a stage of certain limit. In computing, Moore's Law may run out of steam
soon based on silicon technology; in telecommunications, the Shannon’s classical
capacity limit has almost reached; in storage, although the optical disks and
magneto-optical disks have developed very fast, it seems still a way to meet the rapid
increase of big data. To cope with the impact of big data, it is proposed to integrate the
traditionally individual computing, telecommunications and storage systems, which
are getting inevitably converged. An effective information system capacity is
introduced and discussed, aimed at excavating potentials of information systems
under a new paradigm with more degrees of freedom. In this talk, the convergence of
computing, telecommunications and storage is investigated, and the effectiveness of
data handling capability for a given information system is discussed based on the
proposed effective information system capacity.
4. 李硕彦教授：洗牌魔术与 Interconnection Networks
一副牌有 52 张, 经过 8 次洗牌之后, 就会回复到原始顺序。试问：如果加入
两张 Jokers，是否洗几次牌之后也会回复到原始顺序？答案理论上是 Yes 但实际
上等于是 No，因为需要洗 52 次之多而不能出丝毫差错。
对纸牌魔术师而言，这些不一定是新知识。但是，还有更好玩的技巧他们并
不知道：拿一大叠牌连同两张 Jokers，经过几次洗牌之后，顺序就会完全调转过
来。然后去掉 Jokers，再洗几次就又回复到原始顺序。这个新技巧，暂时取名为
“四十二张经”， 将于本次报告中作首次披露。其实，它的科学原理只是浅显的
代数而已。同样的代数原理也广泛地用于 multistage interconnection networks
(MINs).
A MIN interconnects small switches into a large one and is deployed for such
purposes as routing, sorting, parallel processing, etc. Its structure is characterized by
the interstage exchange patterns, which can be algebraically transformed into an
integer sequence that elucidates the characteristic as well as the use of the MIN. A
folklore theorem claims the equivalence among a wide class of MINs called
banyan-type networks. What is “equivalence” after all? Are there different senses of
it? Elementary algebra demystifies all these thoroughly and rigorously.
5. 缪伟豪副教授：PiCode: a Novel Picture-Embedding Barcode
As 2D barcodes (such as QR code) become more and more popular, their new
applications, like mobile marketing, give a strong motivation for embedding visual
information in them. Information stored on a 2D barcode, being printed on paper or
shown on a display device, can be delivered to people via a camera phone with
suitable decoding software. The barcoding system can be viewed as a display-camera
communication system with key functional modules, including channel coding,
modulation, channel estimation, demodulation and channel decoding. By applying
advanced communications principles, a way to integrate a picture into a 2D barcode
(called PiCode) has been developed by the HKUST Barcode Group. In this seminar,
the background, motivation, research and development, and the potential impact of
PiCode will be presented. A US patent and a Chinese patent have been filed based on
the innovative methods developed for PiCode. Since 2013, PiCode related entries
have won 4 awards in various competitions, including the MobiCom'2013 Best
Mobile App Award and the Gold Award for IoT Concept Revolution of the 2014 Hong
Kong U-21 IoT Awards organized by GS1 Hong Kong (香港货品编码协会). In
addition, the first generation PiCode has recently been adopted by the Office of
Government Chief Information Officer of the Hong Kong S.A.R. Government to
promote the International IT Fest 2015. Visit the demo site www.picode.info for
information about PiCode.
6. 沈颖祺副教授：Lattice Network Codes
Lattice network coding is used two-way relay network. The relay node computes
a linear combination of the source symbols belonging to a finite alphabet with some
algebraic structure. In this talk, we illustrate how to apply lattice in computing a linear
combination of two discrete data symbols via a continuous wireless channel. The
transmitters are not required to know the channel gains, but the relay node is assumed
to have full channel state information. Based on the estimation of the channel gains,
the relay node can choose the coefficients of the linear combination such that the
probability of computing error is minimized. The performance is evaluated in a
two-way relay network with Rayleigh-distributed channel gains.
7. 张颖珺副教授：Towards a Scalable C-RAN PH
Featured by centralized processing and cloud based infrastructure, Cloud Radio
Access Network (C-RAN) is a promising solution to achieve unprecedented system
capacity in future wireless cellular networks. The huge capacity gain comes from the
centralized and coordinated signal processing at the cloud server. However, full-scale
coordination in a large-scale C-RAN requires the processing of very large channel
matrices, leading to high computational complexity and channel estimation overhead.
In this talk, we exploit the near-sparsity of large C-RAN channel matrices, and derive
a unified theoretical framework for clustering and parallel processing. Based on the
framework, we propose a dynamic nested clustering (DNC) algorithm that not only
greatly improves the system scalability in terms of baseband-processing and
channel-estimation complexity, but also is amenable to various parallel processing
strategies for different data center architectures.