會議議程
會議日期：2015年 08月20日08月21日 （兩天）
會議地點：麻布山林
2015年08月20日（星期四）  
時間  演講者  演講主題  主持人  地點  
11:3014:00  報到與午餐  詠山樓  
14:0014:10  開幕致詞  詠山樓 3F 

14:1014:50 
Prof. GuuChang Yang 楊谷章 教授 中興大學 
Design and Analysis of Asynchronous Incoherent OpticalCDMA Systems Using A New CodeShifting Technique
Recently, optical codedivision multiple access (OCDMA) has been attracting interest in fiberoptic and opticalwireless multipleaccess systems and networks because of its various desirable features. In this talk, a novel codeshifting technique, which can be added atop asynchronous incoherent OCDMA systems without complex modifications, is proposed and studied. A novel analytical model is proposed and analyzed to improve the performance of OCDMA systems without changing code parameters or optical codes. It can be also used to formulate to quantify the timing jitters, introduced by environmental changes, in opticalwireless codedivision multiple access systems. The model divides every chip in an optical codeword into g multiple equal intervals, and each pulse in the codeword can be randomly shifted to one of these subchip positions in order to account for the effect of the timing jitters. Although it is found that the periodic crosscorrelation functions are worsened, our theoretical and computersimulation results show an unconventional finding that code performance improves as g increases. Our study shows that the new model can make a good use of the time skew of pulses in optical codewords and unconventionally improve OCDMA performance under a certain condition.

Prof. Yu T. Su 蘇育德 教授 交通大學 

14:5015:30 
Prof. Lawrence Tsai 蔡尚澕 教授 交通大學 
On Quantization of Masked Beamforming Secrecy Systems
In this talk, I will introduce a new quantization scheme for an extensively studied PHYlayer security system, called masked beamforming (MB) system. First, background review for PHYlayer security will be provided. Then MB systems with full channel state information (CSI) and partial CSI will be discussed. In the environments with only partial CSI, we notice that the leaked interference due to quantization dominates the performance of MB systems. The interference can be significantly reduced by a well designed quantization scheme. As a result, the secrecy performance can be greatly improved. I will show the advantages of the proposed quantization scheme by both theoretical analysis and simulation results.


15:3016:00  Discussion & Tea break  詠山樓 1F 亭仔腳 

16:0016:40  Prof. Ihsiang Wang 王奕翔 教授 台灣大學 
Interaction can Increase Degrees of Freedom in Bursty Interference Networks
For interference networks with generic channel coefficients, it is well known that interaction among terminals (such as feedback and inband relay cooperation) does not increase the total number of degrees of freedom (DoF). On the other hand, due to decentralized mediumaccesscontrol mechanism and/or bursty data traffic, interference may not be always present and could be bursty. Exploiting such burstiness can potentially yield significant gains in system capacity. We raised the following question: in such bursty interference networks, can interaction be more useful and provide gains in DoF?
In this talk I will present two case studies that answer the question in the affirmative. The first is a bursty interference channel with feedback. The second is a bursty interference channel with an inband relay. For the first case, we further characterized the approximate capacity region of the symmetric Gaussian bursty interference channel. For the second case, we showed that the total DoF is increased linearly with the number of antennas at the relay until saturation. We also developed sets of necessary conditions and sufficient conditions under which the system attains interferencefree DoF. 
Prof. Yu T. Su 蘇育德 教授 交通大學 
詠山樓 3F 

16:5019:50  IEEE通訊與消息理論領域交流會  富森會所  
14:0016:30  科技部成果發表 I  詠山樓 3F 
2015年08月21日（星期五）  
時間  演講者  演講主題  主持人  地點 
09:0009:40 
Prof.Stanley Liu 劉光浩 教授 成功大學 
Design and Analysis of Cooperative Networks based on Unplugged Relays
In the course of developing future wireless communication systems, achieving high energy efficiency has been considered to be as important as providing highspeed reliable communications. Among numerous potential technologies, cooperative relaying has been recognized as a promising solution, whereby two distant nodes can communicate via the help from intermediate relays without using very large power. Traditional ways of using these relays, referred to as conventional relays, commonly focus on achieving high diversity gain at the cost of extra energy consumption. Conventional relays also rely on fixed power supply or replaceable batteries, increasing the burden of wide deployment.
This talk will discuss the enabling techniques toward unplugged cooperative relays that are free from frequent battery replacement or power cables and do not add extra energy cost to perform tasks. These features are attractive to lowpower sensors or embedded systems and are made possible thanks to the recent advances in energy harvesting (EH) devices. An EH device can harvest energy from ambient sources such as solar, wind, radio frequency (RF), and so on. It intelligently manages itself to perform designated tasks using the harvested energy. While replacing traditional relays with EH relays appears to be attractive, the fundamental difference between EH relays and traditional ones poses new challenges that hinder the immediate application of EH relays in practice. Particularly, two design issues relevant to EH relays based RF energies will be addressed: receiver architectures and relay selection strategies. Some results from featured case studies will be presented to show the role of various system parameters in developing cooperative networks utilizing EH relays. 
Prof. GuuChang Yang 楊谷章 教授 中興大學 
詠山樓 3F 
09:4010:20 
Prof. Jerry Huang 黃昱智 教授 台北大學 
Lattices from codes for harnessing interference: An overview and generalizations
One major challenge that differentiates multiuser communications from its pointtopoint counterpart is that in a multiuser scenario, signals from one node would cause interference to nodes within transmission range. Recently, there has emerged a novel perspective of dealing with interference which tries to harness interference via structured codes. At the heart of such perspective lie lattices constructed from codes. In this talk, using computeandforward (a.k.a. physicallayer network coding) as an example, we aim at providing an overview of lattices and constructions of lattices which possess the right structure for harnessing interference. This includes the famous Construction A and Construction D. After unveiling the algebraic structure behind Construction A, we then discuss some of our recent progresses which include generalizations of Construction A to principal ideal domains (PID) other than integers, to rings of algebraic integers which may not be PID, and to multilevel lattices. This talk is based on collaboration with Dr. Krishna R. Narayanan (Texas A&M University), Dr. Joseph J. Boutros (Texas A&M University at Qatar), and Dr. N. Engin Tunali (Xilinx Inc.).


10:2010:50  Discussion & Tea break  詠山樓 1F 亭仔腳 

10:5011:30 
Prof. DeNian Yang 楊得年 研究員 中央研究院 
Scalability and Traffic Engineering for Multicast in Internet and SoftwareDefined Networks.
Multicast is an efficient technique for pointtomultipoint (P2M) and multipointtomultipoint (M2M) communications because it exploits a tree, instead of disjoint paths, in the routing of group traffic. Current multicast standard on Internet, i.e., PIMSM, employs a shortestpath tree to connect the clients in a multicast group. Traffic engineering is difficult to be supported in a shortestpath tree due to the fixed routing of the tree. With the emergence of SoftwareDefined Networks (SDN), flexible routing for traffic engineering now becomes promising, but at the same time the scalability problem appears to be the major stumbling block during the deployment since the traffic is difficult to be aggregated. In this talk, we will first present the scalability and traffic engineering problems for multicast and then introduce our approximation algorithms to solve the above problems efficiently and effectively. Implementation result on Youtube multicast traffic engineering in SDN will also be presented.

Prof. GuuChang Yang 楊谷章 教授 中興大學 
詠山樓 3F 
11:3012:10 
Prof. Minhsiu Hsieh 謝明修 教授 Univ. of Tech., Sydney 
Distributions with reversible secrecy
In this letter we introduce the problem of secrecy reversibility. This asks when two honest parties can distill secret bits from some tripartite distribution pXYZ and transform secret bits back into pXYZ at equal rates using local operation and public communication (LOPC). This is the classical analog to the wellstudied problem of reversibly concentrating and diluting entanglement in a quantum state. We identify the structure of distributions possessing reversible secrecy when one of the honest parties holds a binary distribution, and it is possible that all reversible distributions have this form. These distributions are more general than what is obtained by simply constructing a classical analog to the family of quantum states known to have reversible entanglement. An indispensable tool used in our analysis is a conditional form of the G\'{a}csK\"{o}rner Common Information.


12:1014:00  午餐  詠山樓 3F 

09:3012:00  科技部成果發表 II  詠山樓 3F 