Iceic 2015

2015 International Conference on Electronics,
Information and Communication
Welcome to ICEIC 2015

International Conference on Electronics,
The 14th International Conference on Electronics, Information, and Communication (ICEIC 2015), will
be held at Singapore from 28th to 31st, 2015. On behalf of the Organizing Committee, we give our hearty
welcome to all participants of ICEIC 2015.
Recently, electronics, information, and communication technologies are under rapid development, especially
in the Asia-Pacific region. In the ICEIC 2015 conference, we are going to provide an opportunity to exchange
new ideas, advances, and technologies, for all participants.
We would like to thank the organizing committee members and the technical committee members for
their tremendous efforts in preparing this conference. We hope that this conference will become a strong
technological and academic community for worldwide engineers, scholars and students in fields of electronics,
information, and communication.
Thank you very much.
General Chair
Byung Gook Park
Seoul National University, Korea
General Co-chair
Sharon Peng
President, IEEE Consumer Electronics Society, USA
Organizing Committee Chair
Seung Woo Seo
Seoul National University, Korea
-i-
ICEIC 2015
Technical Program Overview
On behalf of the Technical Program Committee of the 14th International Conference on Electronics,
Information, and Communication (ICEIC 2015), it is our pleasure to welcome all of you to the conference.
This year, among the papers from 13 countries from all over the world, the Technical Program Committee
selected 302 papers for presentation; 119 papers for oral presentation and 183 papers for poster presentation.
We did not make any distinction in terms of quality between these two presentations. Our committee made
the technical program with 5 parallel tracks, total of 22 oral presentation sessions and 5 poster presentation
sessions. Besides them, the committee arranged two plenary talks and four tutorials.
We would like to express our sincere gratitude to all the authors, the speakers, the reviewers, the chairpersons,
and the members of the Technical Program Committee. We hope that this conference will be valuable and
profitable for all participants.
Thank you very much.
Technical Program Chair

Kwang-Hyun Baek
Chung-Ang University, Korea
Technical Program Co-Chair
Jae Hyun Kim
Ajou University, Korea
Dong Gyu Sim
Kwangwoon University, Korea
Ki Chang Nam
Dongguk University, Korea
Han-You Jeong
Pusan University, Korea
Xiangyu Li
Synopsys, USA
- ii -

Committee
Organizing Committee
Advisory Committee
General Chair
Byung Gook Park (Seoul National University, Korea)
Do Hyun Kim (Kookmin University, Korea)

Hang Gu Bahk (SoamSystel Co., Korea)
General Co-chair
Sharon Peng (IEEE CE Society, USA)
Hong Tae Jeon (Chung-Ang University)
Organizing Committee Chair

Seung Woo Seo (Seoul National University, Korea)
Jaihie Kim (Yonsei University, Korea)
Jae Hong Lee (Seoul National University, Korea)
Jin Koo Rhee (Dongguk University, Korea)
Technical Program Chair

Kwang-Hyun Baek (Chung-Ang University, Korea)
Jong Wha Chong (Hanyang University, Korea)
Technical Program Co-chair

Jae Hyun Kim (Ajou University, Korea)
Dong Gyu Sim (Kwangwoon University, Korea)
Ki Chang Nam (Dongguk University, Korea)
Han-You Jeong (Pusan University, Korea)
Xiangyu Li (Synopsys, USA)
Jung Uck Seo (e-Trade Promotion Committee KITA, Korea)
Symposium Chairs on Intelligent Control and Robotics

Marcelo H. Ang Jr. (National University of Singapore, Singapore)
Hyungbo Shim (Seoul National University, Korea)
Sang Seol Lee (Hanyang University, Korea)
Jung Woong Ra (KAIST, Korea)

Koeng Mo Sung (Seoul National University, Korea)
Kukjin Chun (Seoul National University, Korea)
Moon Key Lee (Yonsei University, Korea)
Seong Dae Kim (KAIST, Korea)

Seung Hong Hong (Inha University, Korea)
Symposium Chairs on Semiconductor and Devices

Tae Hyoung Kim (Nanyang Technological University, Singapore)
Joong Ho Choi (The University of Seoul, Korea)
Soo Joong Kim (Kyungpook University, Korea)

Sung Han Park (Hanyang University, Korea)
Tutorial Chair
Yong Jin Yoon (Nanyang Technological University, Singapore)
Sung Jea Ko (Korea University, Korea)

Tae Won Rhee (Korea University, Korea)
Publicity Chair
Ji-Hoon Yun (Seoul National University of Science and Technology, Korea)
Local Chair
Seong-Woo Kim (Seoul National University, Korea)
Young Shik Moon (Hanyang University, Korea)

Zeungnam Bien (UNIST, Korea)
- iii -
ICEIC 2015
Time Table
January 28 (Wed), 2015
15:00-17:00
Registration (Lobby 2F)
17:30
Welcome Reception (1F)
January 29 (Thurs), 2015

Time
Salon 1
Salon 2
Salon 5
08:30-15:00
Salon 6
Grand Salon 1
Grand Salon 2 (Poster)
09:15-10:45
Totorial 1 (Salon 1)
Totorial 2 (Salon 2)
11:00-11:15
Opening Ceremony (Grand Salon)
11:15-12:30
Plenary Talk (Grand Salon)
12:30-13:30
Lunch (Gallery 1F)
TO-2-1
Special Symposium
13:30-15:00 on Intelligent Control
and Robotics I
TO-2-2
System and
Control
TO-2-3
Communication
System and Wireless
Networking I
15:00-15:30
TO-2-4
Access Networks
and Systems I
TO-2-5
Emerging
Technologies
TO-3-4
ICT Convergence
TO-3-5
Low-Power and
High-Performance
Circuits and Systems
P-2
Special Symposium on
Semiconductor and Device,
System and Control
Grand Salon 1
Grand Salon 2 (Poster)
Coffee Break
TO-3-3
Sensors and
Images
TO-3-1
Special Symposium
15:30-17:00 on Intelligent Control
and Robotics II
14:00
P-1
Semiconductor and Device
January 30 (Fri), 2015

Time
Salon 1
Salon 2
Salon 5
08:30-15:00
09:15-10:45
Salon 6

Tutorial 3 (Salon 1)
Tutorial 4 (Salon 2)
10:45-11:00
FO-1-1
Intelligent
11:00-12:30
Control and
Robotics
(Lab-to-Lab) I
Coffee Break
FO-1-2
Signal
Processing I
FO-1-3
Computer and
Information I
FO-2-2
Signal
Processing II
FO-2-3
Computer and
Information II
FO-1-4
FO-1-5
P-3
Communication Special Symposium on Computer and Information,
Software, Services, Semiconductor and
Emerging Technologies,
and Applications
Device I
Signal Processing
12:30-14:00
FO-2-1
Intelligent
14:00-15:30
Control and
Robotics
(Lab-to-Lab) II
15:30-15:45
15:45-17:15
Lunch
FO-2-4
Access Networks
and Systems II
FO-2-5
Semiconductor and
Device II
P-4
Telecommunications
FO-3-5
Special Symposium
on Semiconductor
and Device III
P-5
Signal Processing
Coffee Break
FO-3-3
Access Networks
and Systems III
FO-3-4
Communication
System and Wireless
Networking II
18:00
Banquet (Gallery 1F)
10:00-12:00
ICEIC 2015 Group Discussion and Wrap-up
January 31 (Sat), 2015
- iv -

Level 2
Floor Map
-v-
ICEIC 2015
General Information
Official Language
The official language of the conference is English.
Registration Desk
The registration desk hours:
Wednesday, January 28, 2015
15:00-17:00
Thursday, January 29, 2015
08:30-15:00
Friday, January 30, 2015
08:3015:00
Oral Presentation
Please meet a session chair in your session at least 10 minutes before the session
starts. Bring unzipped PPT presentation file on USB memory and check the file with
AV staff in order to confirm that it is working properly. This is very important to pay
attention to this time frame. The visual equipment provided is only LCD projector.
Time assignment including discussion is as follow:
Tutorial: 90 minutes
Plenary: 90 minutes
Regular: 15 minutes
Poster Presentation
The dimensions of the poster board are 90cm (width) X 180cm (length). You need to attach
your poster on the poster board in your session room at least 10 minutes before the session
starts, and then remove your poster from the poster board after the session finishes.
- vi -

Social Program
Welcome Reception
Time: 17:30 ~
Date: Wednesday, January 28, 2015
The welcome reception will be held at the Grand Hyatt, Singapore. An invitation to the welcome
reception is extended to all participants including registered students.
Lunch
Time: 12:30 ~ 13:30
Date: Thursday, January 29, 2015
Place: Gallery
Banquet
Time: 18:00 ~
Date: Friday, January 30, 2015
Place: Gallery
We hope this banquet will offer you a good opportunity to promote friendship with
participants. Delicious food will be offered at the banquet. A banquet ticket is included
in the Regular Registration. Student Registration does not include the banquet.
ICEIC 2015 Group Discussion and Wrap-up

Time: 10:00 ~ 12:00
Date : Saturday, January 31, 2015
- vii -
ICEIC 2015
CONTENT
Oral Session
TO-2-1 Special Symposium on Intelligent Control and Robotics I
Design and Control of Prosthetic Robot Hand for Dexterous Manipulation2
Seok Hwan Jeong1, Pyungkang Kim2, Young June Shin2, Kyung-Soo Kim1
(1KAIST, 2Agency for Defense Development, Korea)
Yet another tutorial of disturbance observer in view of robust stabilization and robust transient response4
Hyungbo Shim
(Seoul National University, Korea)
Soft Elastomeric Actuators for Wearable Hand Exoskeleton5

Hong Kai Yap1,2, James Cho Hong Goh2, Raye Chen-Hua Yeow2,3
(1NUS Graduate School for Integrative Sciences and Engineering, 2National University of Singapore,
3
SINAPSE-Advanced Robotics Center)
Posture Synchronization for a Tele-presence Robotic system7

Zhongjian Li1,2, Mingming Li1, Shuzhi Sam Ge1
(1National University of Singapore, Singapore, 2Northwestern Polytechnical University, China)
Integrated Design of a Flexure-Based Actuator Using GKYP Lemma9

Haiyue Zhu1,2, Chee Khiang Pang1, Tat Joo Teo2
(1National University of Singapore, 2Singapore Institute of Manufacturing Technology, Singapore)
TO-2-2
System and Control
The Synchronization Control Strategy for Hydraulic Press Machines12

Seong Jin Cho, Seung Hyun Yun, Jae Wook Jeon*
(Sungkyunkwan University, Korea)
A 12b 1.25MS/s SAR ADC for DMPPT Control for Photovoltaic System14
In-Su Cho, Min-Ki Kim, Sung-Chan Rho, Shin-Il Lim
(SeoKyeong University, Korea)
Wearable Controller using Electro Myography with Biofeedback16

Rishabh Berlia, Shubham Kandoi, Sarthak Dubey, Theja Ram Pingali
(R.V. College of Engineering, India)
- viii -
A Mobility-Aware Heading Reference Selection (MAHRS) for Computing Vehicle Heading in

the Android-Platform Smartphone20
Aditya Bhawiyuga1, Rachmad Nafisholeh2, Han-You Jeong2
(1Brawijaya University, Indonesia, 2Pusan National University, Korea)
Synchronization of a Certain Family of Automata22

Yong He, Zhenhe Cui, Fenfang Xiao
(Hunan University of Science and Technology, China)
PLL-based Charging Control Circuits28

Byung Joo Oh, Ji Hoon Hwang Member, Jae Hoon Shim, Member, IEEE
(Kyungpook National University, Korea)
A Decentralized Formation Control of Multiple Mobile Robots with Collision Avoidance30

Hyun-Su Kim1, Young-Ho Lee1, Jong-Koo Park1, Tae-Yong Kuc1, Sang-Hoon Ji2, Sang-Moo Lee2,
Nak-Yong Ko3, Young-Seon Moon4, Young-Jo Cho5
(SungKyunKwan University1, KITECH2, Chosun University3, Sunchon National University4,
Electronics Telecommunication Research Institute5)
TO-2-3
Communication System and Wireless Networking I
Aligned Dynamic Point Blanking in Small Cell Networks33

Kwonjong Lee*, Yosub Park, Jihaeng Heo, Hyunsoo Kim, Takki Yu, Hano Wang, Daesik Hong**
(Yonsei University, Korea)
Energy Efficient Cross Layer Design Protocols using Distributed Method of Information
sharing in Wireless Sensor Networks-A review35
Prathibhavani P. M1, T. G. Basavaraju2
(Acharya Institute of Technology1, Govt. SKSJTI, Bangalore2)
A Rectangular Micro-strip Patch Antenna for UWB Applications45

Deepak Bhatia1, Vardhman Hada2
(Rajasthan Technical University1, SRM University2, INDIA)
TO-2-4
Access Networks and Systems I
Relay Selection for Cooperative Jamming in Amplify-and-Forward Relay Network with Eavesdropper52
Yongyun Choi, Jae Hong Lee
Power and Resource Allocation Scheme for Device-to-Device Communications Underlaying Uplink Cellular
Networks54
Gil-Mo Kang, Oh-Soon Shin
(Soogsil University, Korea)
Polling MAC Scheme for Wireless Passive Sensor Networks56

Phil-Seong Ghang1, Insoo Jun2, Heewon Seo3, Jin Kyung Park3, Cheon Won Choi3
(Alcatel-Lucent, USA1, Jet Propulsion Laboratory, USA2, Dankook University, Korea3)
- ix -
Matched Filter and Zero-Forcing precoding over Rayleigh Channels58

Jae-Hong Kwon, Ji-Ho Lee, Myeong-Jin Kim, Young-Chai Ko
(Korea University, Korea)
TO-2-5
Emerging Technologies
Removing Motion Artifact of Bio-Impedance Heart Rate Measurement System

Using Independent Component Analysis (ICA)61
J. Alexander Bae, Yookwang Kim, SeongHwan Cho
(KAIST, Korea)
(Na,K)NbO3-based Lead-Free Piezoelectric Ceramic for Renewable Energy harvesters65

Jinhwan Kim, Jung-Hyuk Koh*
(Chung-Ang University, Korea)
Biometric Data Store Methodology suitable for Mobile Device67

Nakhyun Kim, Jaesung Kim, Haeryoung Park, MoonSeog Jun
(Soong-sil University, Korea)
Synthetic Generation of Hourly Solar Irradiance Using a Multi-State Markov Model72

Vinay Chamola, Biplab Sikdar
(National University of Singapore, Singapore)
Semiautomatic classification of ECG signal with Extreme Learning Machine77

Mohamad Mahmoud Al Rahhal, Yakoub Bazi, Naif Alajlan Mansour Abdulaziz Al zauir, Saad Haj Bakry
(King Saud University, Saudi Arabia)
Diagnosing COPD Using Mobile Phones83

Haya Hasan, Basel Safieh, Fadi Aloul, Assim Sagahyroon
(American University of Sharjah, UAE)
TO-3-1
Special Symposium on Intelligent Control and Robotics II
Dynamics and Control Problems related to Aerial Manipulation using Quadrotors87

Hai-Nguyen Nguyen, Hyunsoo Yang, Dongjun Lee
Application of adaptive control for visual servoing of multirotor flying robots89

Suseong Kim, H. Jin Kim
Urban Post-Disaster Search and Rescue Solutions with Unmanned Aircraft Systems 91
Swee King Phang, Jinqiang Cui, Z. Y. Kevin Ang, Fei Wang, Xiangxu Dong, Yijie Ke, Shupeng Lai,
Kun Li, Xiang Li, Feng Lin, Jing Lin, Peidong Liu, Tao Pang, Biao Wang, Kangli Wang, Zhaolin Yang, Ben M. Chen*
(National University of Singapore)
-x-
TO-3-3
Sensors and Images
Video Completion Using Frame-Updated Video Panorama94

Semi Jeon, Eunjung Chae, Eunsung Lee, Inhye Yoon, Joonki Paik
Fast Up-scaling Method for UHD Imaging System Using Combined Directional Interpolation and Local
Self-similarity96
Soohwan Yu, Wonseok Kang, Joonki Paik
Robust Feature Extraction Algorithm for Out-of-Focus Images under Low Illumination97
Jinbeum Jang1, Yoonjong Yoo1, Jongheon Kim2, Joonki Paik1
(Chung-Ang University1, SK Hynix2, Korea)
Fast Semantic Place Recognition Using Bag of Features and Support Vector Machine98
Semi Jeon, Eunjung Chae, Eunsung Lee, Inhye Yoon, Joonki Paik
Exact Asymmetric Point Spread Function Estimation for Image Restoration100

Minseo Kim, Seonhee Park, Eunjung Chae, Eunsung Lee, Inhye Yoon, Joonki Paik
A Dual-Exposure In-Pixel Charge Subtraction CTIA CMOS Image Sensor for Centroid
Measurement in Star Trackers102
Xinyuan Qian1, Menghan Guo1, Hang Yu1, Shoushun Chen2, Kay Soon Low1
(Satellite Research Center1, Nanyang Technological University2, Singapore)
Incident Light Angle Detection Technique Using Polarization Pixels106

Vigil Varghese, Shoushun Chen
(Nanyang Technological University, Singapore)
Low-Power Column-Parallel ADC for CMOS Image Sensor by Leveraging

Spatial Likelihood in Natural Scene110
Lifen Liu, Hang Yu, Shoushun Chen
TO-3-4
ICT Convergence
An Energy-Saving BBU-RRH Reconfiguration Scheme for Cloud Radio Access Networks115

Yuh-Shyan Chen1, Chih-Shun Hsu2, Tong-Ying Juang1, Kuang-Wei Su1
(National Taipei University1, Shih Hsin University2, ROC)
Optimal Power Allocation for Full Duplex Decode and Forward Relay Systems121
Taehoon Kwon, Joon Woo Lee*
(KISTI, Korea)
The Design of a Data Gathering Protocol for Cognitive Wireless Sensor Networks123
Chih-Shun Hsu, Pin-Jie Wang
(Shih Hsin University, Taiwan)
- xi -
Testbed and Discussion for PEP in Satellite Communications 128

Nathnael Gebregziabher W., Kyu-Hwan Lee, Young-June Choi, Jae-Hyun Kim
(Ajou University, Korea)
Flexible Metamaterial Absorber using Inkjet-Printing Technology130

Hyung Ki Kim, Kenyu Ling, Kyeongseob Kim, Sungjoon Lim
TO-3-5
Low-Power and High-Performance Circuits and Systems
Low Power, Energy Efficient Radix-22 Feedforward Fast Fourier Transform132

Ngoc Le Ba, Tony T. Kim
An Ultra-low Power Start-up Circuit with Automatic Deactivation for

Thermoelectric Energy Harvesting Systems134
Abhik Das, Neel Narasimman, Tony T. Kim
Ultra-low Power 12T Dual Port SRAM for Hardware Accelerators136

Bo Wang, Ngoc Le Ba, Tony T. Kim
An Ultra-low Voltage VCO-based ADC with Digital Background Calibration138

Neelakantan Narasimman, Tony T. Kim
Energy-efficient DAC with floating and charge averaging switching for differential type SAR ADCs140
Ju Eon Kim1, Taegeun Yoo1, Dong-Kyu Jung1, Hong Chang Yeoh2, Kwang-Hyun Baek2
(Chung-Ang University, Korea1, Analog Devices Inc., USA2)
A SIMO DC-DC Buck Converter using Output Voltage-Related Charge Control Scheme142
Ngoc-Son Pham, WonJune Hwang, JuEon Kim, DongHyun Yoon, Kwang-Hyun Baek
Maximum Power Point Tracking algorithm for a Distributed PV System144

Yohan Hong, Son N. Pham, Won-June Hwang, Kwang-Hyun Baek
FO-1-1
Special Symposium on Intelligent Control and Robotics(Lab-to-Lab) I
A Multi-UGV Testbed for Autonomous Vehicle Cooperative Driving147

Gi-Poong Gwon, Eun-Dong Lee, Seung-Nam Kang, Mid-Eum Choi, Myung-Ok Shin,
Seung-Tak Choi, In-Sub Yoo, Bo-Kyung Seo, Doo-San Baek, Seong-Woo Kim
Cooperative Target Detection using UGV-UAV Platform with a Docking System149

DooSan Baek, Gi-poong Gwon, Gyumin Oh, In-Sub Yoo, Seong-Woo Kim
- xii -
Obstacle Avoidance for Autonomous Driving in Clustered Pedestrian Environment: Framework and
Experimental Evaluation151
Wei Liu1, Seong-Woo Kim2, Marcelo H. Ang Jr.1
(National University of Singapore, Singapore1, Seoul National University, Korea2)
A track boundary detection method by utilizing temporary local coordinate153

Myungok Shin, Mid-Eum Choi, Gi-Poong Gwon, Seung-Tak Choi, In-Sub Yoo, Bokyung Seo,
Gyumin Oh, DooSan Baek, Seong-Woo Kim
(Seoul National University)
Building a Precise Roadway Map for Autonomous Vehicle Driving155

Gi-Poong Gwon, Seong-Woo Kim
FO-1-2
Signal Processing I
Fingerprint Liveness Detection Using SVM-based Ensemble Classifier158

Wonjune Lee1, Heeseung Choi2, Jaihie Kim1
(Yonsei University1, Korea Institute of Science of Technology2, Korea)
Lattice Sphere Detection Techniques with Special Channel Matrices for Wireless Communication Systems160
Mahmoud A. M. Albreem
(University Malaysia Perlis, Malaysia)
A Vision-based Automatic Detection Algorithm for Dairy Cows in Free-stall Barns166

Suthasinee Nopparit, Nattapon Pantuwong, Kitsuchart Pasupa
(King Mongkuts Institute of Technology Ladkrabang Bangkok, Thailand)
Flickering Artifact Reduction Method in Video Contrast Enhancement168

Jin Wook Park, Hyeon Seok Yang, Young Shik Moon
(Hanyang University, Korea)
Bag-of-Audio-Words Feature Representation Using GMM Clustering for Sound Event Classification170
Hyungjun Lim, Myung Jong Kim, Hoirin Kim
(KAIST)
Reduction of the Computational Redundancy in Integer Motion Estimation using

a Modified Test Zone Search Algorithm in HEVC176
Sunil Roe1,2, Soonwoo Choi1, Woosuk Jung1 Student Member, IEEE, Soo-Ik Chae1
(Seoul National University1, Samsung Electronics Co. Ltd.2, Korea)
FO-1-3
Computer and Information I
Reversible Data Hiding Using Enhanced Prediction for Progressive Image Transmission180
Hsiang-Cheh Huang1, Feng-Cheng Chang2, Wai-Chi Fang3, Ting-Hsuan Wang1
(National University of Kaohsiung1, Tamkang University2, National Chiao-Tung University3, ROC)
- xiii -
DEX2C: Translation of Dalvik Bytecodes into C Code182

Minseong Kim1, Youngsun Han2, Myeongjin Cho1, Chanhyun Park1, Seon Wook Kim1
(Korea University1, Kyungil University2, Korea)
Thread-aware Scheduling Method for Improving Utilization of VM184

Chungmu Oh, Doohwan Oh, Won Woo Ro
Enhanced ATM Security System using Visual Cryptography to Biometric Authentication187

Ajish S
(College of Engineering, India)
FO-1-4
Communication Software, Services, and Applications
A Massive MIMO Architecture for Highly Efficient mm-Wave Communications with Saturated Amplifiers194
Rui Dinis1,2, Paulo Montezuma1,2,3, Pedro Bento1,4, Marco Gomes1,4, Vitor Silva1,4
(Instituto de Telecomunicaes (IT)1, FCT Universidade Nova de Lisboa2, Instituto de Desenvolvimento de
Novas Tecnologias3, University of Coimbra4, Portugal)
Reflectance Properties of One Dimensional Photonic Crystals199

Firdaus Akbar, Ary Syahriar
(University of Al Azhar Indonesia)
Smartphone-based Train Tracking Information Systems for Awareness and Safety Enhancement202
Adhitya Bhawiyuga
(University of Brawijaya)
Effects of Close Eigenvalues in Communication Performance in

MIMO Eigenbeam Space Division Multiplexing204
Yusuke DOHI, Tetsushi IKEGAMI
(Meiji University)
The Sub Optimal Number of Duplicated Packets Determining Method for Improving QoS in
High- Functional Node Network206
Akihiro Terashima, Katsunori Yamaoka
(Tokyo Institute of Technology, Japan)
Efficient Packet Classification by Improving Filter Categorization213

Hsin-Jou Yu, Hsin-Tsung Lin, Pi-Chung Wang
(National Chung Hsing University)
FO-1-5
Special Symposium on Semiconductor and Device I
Experimental Study of Negative Capacitance to Implement Sub-60 mV/decade CMOS Devices223

Jaesung Jo, Changhwan Shin*
(University of Seoul, Korea)
- xiv -
2-string AC-powered LED driver with current regulation reduction based on simple circuit225
Kilsoo Seo, Kihyun Kim, Hyungwoo Kim, Kyungho Lee, Jonghyun Kim
(KERI, Korea)
A Capacitive-type MEMS Acoustic Sensor with a Diaphragm of Al/Si3N4/Al Based on

a Polyimide Sacrificial layer228
J. Lee1,2,*, C.H. Je1, Y.-G. Kim1, S.Q. Lee1, W.S. Yang1, S.-G. Lee2
(Nano Sensor Lab.1, Korea Advanced Institute of Science and Technology2, Korea)
A 3.1-V 21-mW 1.5-Bit Fourth-Order Double-Sampled ADC with 92-dB Dynamic Range230
Young-Ouk Kim, Gil-Cho Ahn
(Sogang University, Korea)
A Serializer for Converting Parallel Data with Various Data Rates to Serial Data232
Keun-Seon Ahn1, Chang-Hyun Bae1,2, Changsik Yoo1
(Hanyang University1, Samsung Electronics2, Korea)
Investigation of the effect of gate space length variation on the retention characteristics in NAND flash array234
Joo Yun Seo, Dae Woong Kwon, Sang-Ho Lee, Byung-Gook Park
FO-2-1
Special Symposium on Intelligent Control and Robotics(Lab-to-Lab) II
Large actuation of an acrylic-based dielectric elastomer actuator in tubular configuration237

Ying Shi Teh, Yu Feng Goh, Soo Jin Adrian Koh
Functional Hip and Knee Joint Assistive Torque Controller for Gait Training242
Jinfu Li, Bingquan Shen, Chee-Meng Chew
Design and Evaluation a Novel Portable Knee-Ankle-Foot Robot244

Gong Chen, Haoyong Yu, Member, IEEE
Accurate Odometry for Autonomous Vehicles Using in-car Sensors246

Xiaotong Shen, Scott Pendleton, Marcelo H. Ang Jr.
Development of an Autonomous Vehicle : Baby In Car249

Dong-Kyoung Kye, Myungok Shin, Gi-Poong Gwon, Seung-Tak Choi, In-Sub Yoo, Bo-Kyung Seo,
Soomok Lee, Hanseul Lee, Yeonjun Lee, Gyumin Oh, Seong-Woo Kim
FO-2-2
Signal Processing II
Phase Error Compensation of Chirp Signal Generator Implemented on Direct Digital Synthesizer252
Heein Yang, Jae-Hyun Kim
- xv -
A compressed domain fast motion and no motion detection for multiple channel
IP video surveillance system254
Young-Woong Kim1, Yong-Jo Ahn1, Jae-Jin Lee2, Kyung-Jin Byun2, Dong-Gyu Sim1
(Kwangwoon University1, ETRI2, Korea)
The DVS Technique Based on Clipped LMS Filter for MPEG-2 Application257
Dongwan Kim, Sunshin An
Modified Transform Skip Signaling Method for HEVC Screen Content Coding260
Dahee Lee, Seungha Yang, Hiuk Jae Shim, Byeungwoo Jeon
A FPGA-Based Real-Time Binocular Stereo Vision System using Adaptive Support-Weight262

Liang Zhang1, Fei Qiao2, Kunzhi Xie1, Li Luo1, Huazhong Yang2
(Beijing Jiaotong University1, Tsinghua University2)
Generation of Neighborhood Euclidean Distance Maps for Rapid GrowCut264

Kyungjae Lee, Eungyeol Song, Taejae Jeon, Sangyoun Lee
FO-2-3
Computer and Information II
Time Period Identification of Prosaic Texts in Modern Mongolian Language268

Zolboo Damiran, Khuder Altangerel
(MUST-SICT)
Optimal Frequency Scaling for Multi-Core Processor with Soft-Fault272

Seungwon Lee, Min Su Kim, Won Woo Ro
Performance Improvement of a Mobile Processor Depending on the Cache Configuration274

Ki Yeop Kim, Chang Min Eun, Hyun Hak Cho, Ok Hyun Jeong
An Optimization Model For Computer Networks Monitoring276

Alquliyev Rasim Mahammad1, Shikhaliyev Ramiz Huseyn1, Seung-Woo Seo2
(Institute of Information Technology Azerbaijan National Academy of Sciences Baku1, Seoul National University Seoul2, Korea)
Wavelet Based Advanced Encryption Standard Algorithm for Image Encryption279

Ajish Sreedharan
(College of Engineering, India)
FO-2-4
Access Networks and Systems II
An Inter-Cell Channel Scheduling Algorithm for Efficient RF Energy

Harvesting in LTE Asynchronous Network285
Kyunghoon Lee, Won Jun Hwang, Hyung-Jin Choi
- xvi -
Performance Evaluation of Emergency Vehicle Travel Support System Based on V2V Communications287
Hiroaki Minami, Atsushi Kinoshita, Yumi Takaki, Chikara Ohta, Hisashi Tamaki
(Kobe University, Japan)
Priority Code Scheme for Flexible Scheduling in HTS289

Lilian del Consuelo Hernandez Ruiz Gaytan, Jiang Liu, Shigeru Shimamoto
(Waseda University, Japan)
Characteristics of Asymmetry and Symmetry Curved Slab Waveguide294

Indah Juningtiaz Devayani, Ary Syahriar
(University of Al Azhar Indonesia)
Generation of Discrete Multi-Tone Channel Using HNLF297

M. Irfan Anis
(Iqra University, Pakistan)
Dynamic Interference Forwarding in Interference Limited Cellular Networks299

Jun-pyo Hong, Hojin Song, Wan Choi
(KAIST, Korea)
FO-2-5
Special Symposium on Semiconductor and Device II
An RF G -Cm Low-pass Filter Adopting Transconductor Linearization Technique305

Chihoon Choi1, Kuduck Kwon2, Ilku Nam1
Pusan National University1, Kangwon National University2, Korea)
Low-frequency noise characteristics of Bi2Mg2/3Nb4/3O7 (BMN) temperature sensor with annealing

temperature variation307
Il Hwan Cho*, Seongjae Cho, Jong-Ho Lee, Byung-Gook Park
(University of California, USA1, Gachon University, Korea2, Seoul National University, Korea3)
A new multiple frequency out of DLL with Glitch Elimination and Phase Interpolator for DDR4310
Wei-Bin Yang1, Chi-Hsiung Wang1, Kuo-Hsiang Hsu1, Han-Hsien Wang1, Yu-Yao Lin1, Horng-Yuan Shih1, Yu-Lung Lo2
(Tamkang University1, National Kaohsiung Normal University2, Taiwan)
Extraction of Sub-Bandgap Trap Profile of Poly-Si/SiO2 interface in 3-D Stacked

NAND Flash Memory cells314
Nag Yong Choi, Ho-Jung Kang, Jong-Ho Lee
Modeling and Simulation of a Pair-Wise Serial ROIC for Uncooled Microbolometer Array316
Syed Irtaza Haider, Sohaib Majzoub, Mohammed Alturaigi, Mohamed Abdel-Rahman
(King Saud University)
Passivation Effects in Tin Oxide Thin-Film Transistors321

Young-Joon Han1, Yong-Jin Choi1, Sang-Hun Song1, Hong Chang Yeoh2, Hyuck-In Kwon1,*
(Chung-Ang University, Korea1, Analog Devices Inc. USA2)
- xvii -
FO-3-3
Access Networks and Systems III
Interference Mitigation in HetNets using Power Control and Beam Forming324

Konjeti Viswanadh, Garimella Rama Murthy
(International Institute of Information Technology, Hyderabad)
Sensors Network Deployment under Irregular Conditions327

Imen Arfaoui1, Noureddine Boudriga1, Khalifa Trimche2
(University of Carthage1, Tunisia, Faculty of Science of Tunis2, Tunisia)
Temperature Effect on Uniform Fiber Bragg Gratings based on Thermo-optic coefficients334

Rumadi, Ary Syahriar, Dwi Astharini
(University of Al Azhar Indonesia, Jakarta)
Train Arrival Information at Railway Crossing Area Using Zigbee Networks339

Octarina Nur Samijayani, Fadjar Iftikhar
(Al Azhar University of Indonesia)
Simulation and FPGA Implementation of a Matched Filter for Cognitive Radio342

Christy A. Caete, Alberto S. Baacia
(University of San Carlos- Talamban Campus)
FO-3-4
Communication System and Wireless Networking II
Optimal Relay Design for MIMO Relay Networks Using Gradient Projection349
Apriana Toding
(Universitas Kristen Indonesia Paulus, Indonesia)
Miniaturized Circular Polarized TE10-Mode Substrate-Integrated-Waveguide Antenna354

Kyeongseob Kim, Sungjoon Lim
The Analysis of Prophet on IBR-DTN for Digital Information Sharing System in Rural Area355
Magdalena Trie P.1, Eko Sakti P.2, Achmad Basuki3
(Brawijaya University)
Towards Fault Tolerance in Border Surveillance Wireless Sensor Networks363

Walid Abdallah1, Noureddine Boudriga1, Sunshin An2
(University of Carthage, Tunisia1, Korea University, Korea)
Faster Spectrum Sensing in Cognitive Radio using Hadoop YARN371

Srikanth Munjuluri, Garimella Rama Murthy
(SPCRC)
- xviii -
FO-3-5
Special Symposium on Semiconductor and Device III
Design of Electrically Injected Photonic Crystal Laser with Oxide Current Guiding Layers374
Seonghyun Paik1, Seongjae Cho2, Byung-Gook Park3, James S. Harris, Jr.1
(Stanford University, USA1, Gachon University, Korea2, Seoul National University, Korea3)
Improvement of On-Off Current Ratio in Vertical Electron-Hole Bilayer Tunnel Field-Effect Transistors
(V-EHBTFETs)376
Sang Wan Kim1, Seongjae Cho2, Jang Hyun Kim3, Byung-Gook Park3, Woo Young Choi4
(University of California, Berkeley, USA1, Gachon University, Korea2, Seoul National University, Korea3, Sogang University, Korea4)
A Practical Solution to Ringing Error Problems with Lucy-Richardson Deconvolution for Spatiotemporal SRAM
Margin Variation Effect Analyses378
Hiroyuki Yamauchi, Worawit Somha
(Fukuoka Institute of Technology, Japan)
FinFETs Source/Drain Resistance Modeling under Low Contact Resistivity Conditions382

JungHun Kim, SoYoung Kim
Ge/SiGe Quantum-Well Diode Modulator for On-Chip Optical Interconnect386

Xiaochi Chen1, Yijie Huo1, Seongjae Cho2, Byung-Gook Park3,*, James S. Harris, Jr.1
(Stanford University, USA1, Gachon University, Korea2, Seoul National University, Korea3)
- xix -
Poster Session
PS-1
Special Symposium on Semiconductor and Device
A low power, wide frequency range LO Generator for RF Transceiver389

Truong Thi Kim Nga, Joo-Young Chun, Dong-Soo Lee, Kang-Yoon Lee
A Wide Output Range Step-Up DC-DC Converter with Maximum 92.5% Power Efficiency for High Voltage
Application391
Joo-Young Chun, Young-Jun Park, Juri Lee, Kang-Yoon Lee
Controlling hole transfer by WO3/MoO3 nanoparticles in organic solar cells393

Eung-Kyu Park, Ji-Hwan Kim, Jae-Hyoung Kim, Yong-Sang Kim*
Trapped Electron Retention Depending on Erase States in SONOS Type NAND Flash Memory395
Do-Bin Kim, Dae Woong Kwon, Byung-Gook Park
AlGaN/GaN MISFET Gas Sensor Having a Horizontal Floating Gate397

Chang-Hee Kim1, Chul-Heung Kim1, Yoonki Hong1, Jongmin Shin1, Kyu-Bong Choi1, In-Tak Cho1,
Chul-Ho Won2, Do-Kywn Kim2, Jung-Hee Lee2, Jong-Ho Lee1
(Seoul National University, Korea1, Kyungpook National University, Korea2)
A Design of 1-GHz Sub-Harmonically Injection-Locked PLL399

Sung-Yong Cho, Deog-Kyoon Jeong
An RF Amplifier with Transcoductor Linearization Technique in a Deep nwell CMOS Technology401

Chihoon Choi1, Kuduck Kwon2, Seungjun Baek1, Ockgoo Lee1, Ilku Nam1
(Pusan National University1, Kangwon National University2)
Wide Range Driver Amp with linearity for TVWS403

Juri Lee, Hyung Gu Park, Joo young Chun, Kang-Yoon Lee
Germanium-Source Vertical Tunnel Field-Effect Transistor405

Hyunjae Lee, Changhwan Shin*
The Fast Switching LED Driver Using Current Peaking and Carrier Sweep Out Techniques407
for High Speed Visual Light Communication System
Chang Kyu Lee1,2, Seong Jin Oh2, Kang Yoon Lee2
(Samsung Electronics CO., Ltd., Korea1, Sungkyunkwan University, Korea2)
A 60GHz Dual-Injection Locked Frequency Divider with current re-injection409

Se-Il Oh1,2, Dong-Soo Lee1, Kang-Yoon Lee1
- xx -
(Samsung Electronics CO., Ltd., Korea1, Sungkyunkwan University, Korea2)
Fast-Locked Duty-Cycle Corrector with 2-Step Operation411

Kwang Won Kim1,2, In Seong Kim1, Kang Yoon Lee1
Samsung Electronics CO., Ltd., Korea1, Sungkyunkwan University, Korea2)
4W GaAs Power Amplifier MMIC for Ku-band Applications413

Keun-Kwan Ryu, Ki-Bum Ahn, Sung-Chan Kim
(Hanbat National University, Korea)
Positive Bias Temperature Instability in Solution Processed InGaZn Oxide Thin Film Transistors415
Ji-Hwan Kim, Eung-Kyu Park, Min-Ho Park, Dong-Hoon Lee, Dawoon Han, Yong-Sang Kim*
PET detector with APD pixel array using Edge detection417

Jinwoo Kim, Dongha Lee, Jinwook Burm
A 1.8-6 Gb/s Clock and data recovery circuit (CDR) with pre-locking loop419
Dongha Lee, Jongyeon Lee, Jinwook Burm
A 0.18 m CMOS 12-bit 1500S/sSAR ADC for Temperature Sensor421

Jinyoon Jang, Jinwoo Kim, Jinwook Burm
A 12bit 50MS/s Pipelined ADC with High Performance S/H for CMOS Image Sensors423
Jongyeon Lee, Jinyoon Jang, Jinwook Burm
Effects of Miller Capacitance on AC switching characteristics of tunnel fieldeffect transistor (TFET)425

Dae Woong Kwon, Hyun Woo Kim, Jang Hyun Kim, Byung-Gook Park
(Seoul National University)
Stability enhancement of IZO thin film transistor using SU-8 passivation layer427
Sang-jo Kim, Ji-hoon Shin, Yong-jin Im, Seung-soo Ha, Chan-hee Park, Moonsuk Yi
(Pusan National University, Korea)
Small Headroom Current Mirror with High Accuracy429

Ho-Joon Kim, Jae-Koo Park, Kee-Won Kwon
Investigation of bias-stress-induced instability in graphene field-effect transistor using

new polymer-free transfer method431
Hamin Park*, Ick-Joon Park*, Sung-Yool Choi
(KAIST, Korea)
A CMOS Quadrature LMV with a Series LC Resonator433

Nam-Jin Oh
(Korea National University of Transportation, Korea)
A Proximity-Based Motion Gesture Sensor with a single LED for Thin Mobile Devices435
Jeong Seok Kim, Yong Sin Kim
- xxi -
(School of Electrical Engineering Korea University)
Sensitivity Analysis for Random Dopant Fluctuation in DG MOSFET using Regression Model437
Yong Hyeon Shin, Edward Namkyu Cho, Ilgu Yun
Static and Dynamic analysis of Split-gate Nitride Resurf Stepped Oxide (SNRSO) MOSFETs
for 100V applications439
Doohyung Cho1,2, Kwanhoon Song1, Sanggi Kim2, Kwangsoo Kim1
(Sogang University, Korea1, Electonics and Telecommunications Research Institute (ETRI), Korea2)
Silicon-based Synaptic Transistor with Nitride Charge Trapping Layer441

Hyungjin Kim, Jungjin Park, Min-Woo Kwon, Byung-Gook Park
Effects of Trap Density in GeSbTe material for Phase-Change Memory443

Jun Yeong Lim, Yong Hyeon Shin, Ilgu Yun*
Geometry-dependent Variability Analysis of Amorphous InGaZnO TFT by Parameter

Extraction using Capacitance- Voltage Measurements445
Edward Namkyu Cho, Jung Han Kang, Suehye Park, Ilgu Yun*
Power-Efficient Refresh Control for Cross-Point ReRAM447

Sang-Yun Kim, Jong-Min Baek, Wen-Liang Ma, Kee-Won Kwon
Low-Frequency Noise in Hysteresis-Free Multilayer MoS2 FETs449

Chan Hak Yu*, Choong Ki Kim*, Jae Hur, Yang-Kyu Choi, Sung-Yool Choi
(KAIST, Korea)
Improved Reverse Recovery Characteristic for 50V Power MOSFET with Integrated Schottky Body Diode451
Byunghwa Lee, Doohyung Cho, Kwangsoo Kim
An Improved 4H-SiC Trench MOS Barrier Schottky (TMBS) Rectifier Made with High-k Material Layer453
Seulgi Sim, Kwangsoo Kim
A design of new voltage-to current converters with high linearity and wide tuning range455
Min-Hyeong Cho, Won-Ho Lee, Hi-Seok Kim, ,Hyeong-Woo Cha
(Cheongju University, Korea)
A Layout Technique for the Efficient Matching of an Input TTL Signal457

Ji-Hak Yu*, Seung-Baek Park, Soo-Won Kim
(Samsung Electronics co, Ltd and Korea University)
A BGA Ball Minimization Technique for the SoC Package Design Process459
Baekseok Ko1, Joowon Kim2, Jaemin Rwoo2, Chulsoon Hwang2, Jeong Cho1, Soo-Won Kim1
(Korea University, Korea1, Samsung Electronics co. Ltd., Korea2)
A Squelch Detection Circuit for Serial Link Applications461

- xxii -
Chang-Hyun Bae1,2, Min-Ki Jeon2, Dong-Ho Choi2, Changsik Yoo2

(Samsung Electronics, Korea1, Hanyang University, Korea2)
A 6-bit Current-Steering DAC for High Speed Current Mode SAR ADC463
Wen-Liang Ma, Jae-Koo Park, Se-Jin Baik, Sang-Yun Kim, Jong-Min Baek, Kee-Won Kwon
An Improved Linearity Drive Amplifier for S-band Satellite Communication465

Jun-Young Park, Ji-Young Lee, Tae-Yeoul Yun
PS-2
Special Symposium on Semiconductor and Device, System and Control
Enhancement of polarization conversion efficiency using slotted optical waveguides with

surface plasmon polariton for compact optical polarization rotator468
Hong-Seung Kim1, Tae-Kyeong Lee1, Tae-Ryong Kim1, Doo-Gun Kim2, Young-Wan Choi1
(Chung-Ang University, Korea1, Photonics-Bio Research Center, Korea2)
Extinction ratio enhancement of triangular resonator with surface plasmon resonance mirror470
Tae-Ryong Kim1, Hong-Seung Kim1, Guem-Yoon Oh1, Doo-Gun Kim2, Young-Wan Choi1,*
(Chung-Ang University, Korea1, Photonics Bio Research Center, Korea2)
Analysis on the low VGS/high VDS stress-induced instability in amorphous

indium-gallium-zinc-oxide thin-film transistors472
Jun Tae Jang, Hara Kang, Jonghwa Kim, Sung-Jin Choi, Dong Myong Kim, Dae Hwan Kim*
(Kookmin University, Korea)
Frequency-dependent C-V Based Extraction of Interface Trap Density in Normally-off

Gate-recessed AlGaN/GaN Field-effect Transistors475
Sungju Choi1, Youngjin Kang2, Jonghwa Kim1, Sung-Jin Choi1, Dong Myong Kim1, Ho-Young Cha2,
Hyungtak Kim2, Dae Hwan Kim1,*
(Kookmin University, Korea1, Hongik University, Korea2)
Development of Microwave Band-Pass Filter Employing Aerosol-Deposited Al2O3-PTFE

Composite Thick Films477
Ji-Won Lee, Jung-Hyuk Koh*
The Study for the Performance Analysis of the Stereo Radiation Detector479
Young-Gwan Hwang, Nam-Ho Lee, Jong-Yeol Kim, Sang-Hun Jeong
(Korea Atomic Energy Research Institute)
Analysis for optimal operational amplifier of trans-impedance amplifier481

Chang-In Park, Kwang-Jin Kim, Chang-Gun Kim, Byung-Hee Son, Jun Yin, Young-Wan Choi
Position Estimation Method Using Magnetic Field Map and INS483

Han-Sol Kim, Hyo-Jun Son, Kwang-Il Han, Kwang-Ryul Baek
- xxiii -
Application of relay-feedback to air-foil bearing BLDCM 485

Yeon-Keun Jeong, Han-Sol Kim, Dong-seok Lim, Kwang-Ryul Baek
An improved adaptive on-time control scheme for reducing switching frequency variation in
valley current mode buck converters487
Hyeok-Kyu Kwon, Dong Keon Lee, Suncheol Yang, Raehong Kim, Hang-Geun Jeong
(Chonbuk National University, Korea)
Implementation of Fully Digitalized Switch-mode DC-DC Converter without ADCs and

Its Application to LED Driver491
Jae-Hyoun Park*, Hyung-Do Yoon
(Korea Electronics Technology Institute)
A Parametric Study of Pulsed Gamma-ray Detectors Based on Si Epi-Wafer493

Namho Lee, Sanghoon Jung, Younggwan Hwang
A 6-b 1-GS/s Adaptive Input Dynamic Range ADC Using Double Reference-Level for Radar System495
Hye-In Lee1, You-Sun Won1, Chung-Hwan Kim2, Sang-Gug Lee1
(KAI S T, Korea1, Wooriro Optical Telecom Co., LTD., Korea2)
Design of Smart Driving Service using by Mobile Second Platform497

Jonghwa Kim, Songyi Kim, Yesool Cha, Byoungha Park, Youngchoong Park, Kwang-Mo Jung, Seong-Dong Kim
(Korea Electronics Technology Institute, Korea)
Buck-Converter using DT-MOS Switch with Short Circuit Protection499

Han-hee Cho, Dae-yeol Yoo, Chung-kwang Lee, Hyun-young Kim, Yong-seo Koo*
(Dankook University, Korea)
A Study on On-Board Energy Storage system for Energy Regenerated from Electric Train501
Hanmin Lee
(Korea Railroad research Institute)
A 9-bit CMOS DDFS with Area and Power Efficient Architecture507

Taegeun Yoo1, Yohan Hong1, Dong-Kyu Jung1, Dong-Hyun Yoon1, Hong Chang Yeoh2, Kwang-Hyun Baek1
(Chung-Ang University, Korea1, Analog Devices Inc., USA2)
Temperature Sensor Fabrication on CVD Grown Thick graphene509

Kyuhyun Kwack, Wonha Jeon, Yumee Kim, Kukjin Chun
A Design of 4-Gb/s, 380-W Low-Power Optical Receiver Front-End in 65-nm CMOS Technology511
Haram Ju, Gyu-Seob Jeong, Woorham Bae, Deog-Kyoon Jeong
Experimental Model of Wireless Optical Communication System for Automotive

Media Oriented Environment513
Sangyub Lee, Chouljun Kang, Jaejin Ko
(Korea Electronics Technology Institute)
- xxiv -
Architecture of the service control based on voice recognition517

Hyun Soon Nam, Tae Joong Kim
Sw-SoC Open Platform Team
(ETRI, Korea)
Autonomous Navigation of the Mobile Robot using the Exterior Penalty Function Method519
Young-Jong Jung, Gon-Woo Kim
(Chungbuk Natl University, Korea)
An Efficiency Analysis of Buck Converter in PWM /PFM Mode521

Jin Hwan Kim1,2, Young Min lm2, Ji Hoon Kang2, Kang-Yoon Lee2
(Samsung Electro-Mechanics CO., Ltd., Korea1, Sungkyunkwan University, Korea2)
Clock-Less 8-bit Pipeline-Like Novel A/D Converter523

Sang-Hoon Lee, Jin-Tae Kim, Jae-Roul Park, Jong-Cheol Lee, Jang-Kyoo Shin, Pyung Choi
Human Detection and Tracking System using IR-UWB Radar526

Ha-Jun Kim, Beom-Hun Kim, Hui-Seon Gang, Suk-seung Hwang, Goo-Rak Kwon, Jae-Young Pyun
(Chosun University, Korea)
The development of Multiple Encoder Interface SoC for Industrial control system528
The OpenMP Implementation for ROS-based manipulation algorithms530

The development of Multi-Axis Hydraulic Controller based on EtherCAT532

Development of radiation-induced-latchup-conformation techniques for bipolar ICs534

Nam-ho Lee, Sang-hoon Jung, Young-gwan Hwang
Design of High Voltage Gate Driver in DMPPT Control for Photovoltaic System536
Byung-Hun Yoon, Min-Ki Kim, Hee-Jin Kang, Shin-Il Lim
(Seokyeong University, Korea)
A 30ps-LSB 1.63mW Time-to-Digital Converter Using an 8-bit SAR ADC538

Kyoung-Tae Kim, Young-Ouk Kim, Yong Choi, Gil-Cho Ahn
Failure-rate Prediction in Design Phase for SMPS540

Jemin Kim1, Taegu Lee2, Kwanhun Lee1
(KETI1, PIOLINK Inc.2)
Frequency Characteristic Analysis to Reduce the False Alarm by Using Electronic Security
Fence of Friction Electricity Sensor544
SeokJin Yun1, Seoyeon Won1, Hiesik Kim1, Youngcheol Lee2, Wooyoung Jang2
(University of Seoul, Korea1, GES Co., Ltd., Korea2)
- xxv -
PS-3
Computer and Information, Emerging Technologies, Signal Processing
PCI Express Gen3 Switch Card Development by Using High-Speed Signal Integrity Analysis547
Won-ok Kwon, Young Woo Kim, Hagyoung Kim
(Cloud Computing Research Department Electronics and Telecommunications Research Institute, Korea)
Development of Recommendation System for Leisure Kayak Model Design551

Jong-Dae Park, Joong-Duk Oh, Chan-Hong Park, Byeong-Ho Park, Hyeon-Kyeong Seong
(Sangji University, Korea)
A Performance Study of Asymmetric Octa-Core Digital Signal Processor Architectures554

Jongbok Lee
(Hansung University, Korea)
A Practical Video Fragment Identification Approach556

Xun Jin, Jongweon Kim
(Sangmyung University, Korea)
Outlier Detection in Wireless Sensor Networks Using Trend Pattern558

Kwangsoo Kim1, Marie Kim1, Seong-Il Jin2,*
(Electronics and Telecommunication Research Institute1, Chungnam National University2)
KVM-Based Virtual Machine Cache using I/O Access Pattern560

Taehoon Kim, Jaechun No*
(Sejong University)
NeoESPA-A New Evaluation System for Programming Assignments562

Xiao Liu, Yeoneo Kim, Hwan-Gue Cho, Gyun Woo
A Roofline Model of Consumer Preference in Embedded systems564

An FPGA-based String Matching using Automatic HDL Code Generation566

HyunJin Kim1, Kang-Il Choi2
(Dankook University, Korea1, Advanced Communications Research Lab., Korea2)
Paper Calculator using Depth Information by a Kinect568

Jaeho Lim1, Sung Woong Shin1, Jong Won Park2
(ETRI1, CNU2)
The Development of Mobile Telepresence based on Distributed Telepresence570

Seunghan Choi, Kim Do-Young, Kim Yeong-Jin
(ETRI, Korea)
An Innovative Diagnosis Mechanism for Rule Anomalies among Firewalls572

Chi-Shih Chao
(Feng Chia University, ROC)
Distance Measurement to Specific Object by Extraction of Geometrical Feature Change in

the Zooming Images574
- xxvi -
Seung Ho Han*, Hiesik Kim, Ki Doo Kim, Jae Hong Joo

Pharmaceutical Drug Management System Implemen-tation based on EPCIS Event Data576

Beomjin Kim, Sunshin An
Knowledge based Self-Assessment System for Sports Event Management578

Yong Kuk Park, Min Goo Lee, Kyung Kwon Jung
(Korea Electronics Technology Institute, Korea)
Stacked Piezo-Energy Harvesters by the Tape Casting Process580

Dong-Jin Shin, Jung-Hyuk Koh*
Harvesting Piezoelectric Energy using (1-x)(Bi, Na)TiO3-x(Bi, K) TiO3 Lead-free Ceramics582

Gun-Hyun Lee, Young-Hoon Kwon, Jung-Hyuk Koh*
Sintering Temperature Effects of (Bi, Na)TiO3-based Composites for Piezoelectric Energy Harvester584
Young-Hoon Kwon, Gun-Hyun Lee, Jung-Hyuk Koh*
Effects of BaTiO3 on Piezoelectric Properties of (1-x)(Bi0.5Na0.5TiO3)-x(BaTiO3)

Lead Free Ceramics for Energy Harvesting586
Woo-Seok Kang, Jung-Hyuk Koh*
Experimental results on 3-D respiratory motion prediction with EKF-GPR algorithm588

Waqas Bukhari, Sun-Mog Hong
A Wearable Brain-Machine Interface System for Real-time Driver Drowsiness Detection590

Gang Li, Boon Leng Lee, Wan-Young Chung
(Pukyong National University, Korea)
Energy Transmission for Wireless Sensor Network using Power forming592

Cheolung Cha1, Young Chul Noh2
(Korea Electronics Technology Institute1, Doosan Infracore2)
Energy-Saving Scheduling Algorithm for Smart Vending Machine594

Min Goo Lee1, Yong Kuk Park1, Kyung Kwon Jung1, Sung Il Hwang2, Dong Ki Lee2
(Korea Electronics Technology Institute1, Maxfor Technology Inc.2)
Analysis of Digital Development Process (DDP) for Intravascular Ultrasound (IVUS) Image596
Seon Mi Ji1, Sung Min Kim1, Soo Chan Kim2, Jong Seob Jeong1,*
(Dongguk University, Korea1, Hankyong National University, Korea2)
Pulse Compression Technique for Calibration Curve to Derive Accurate Temperature

Variation in Therapeutic Ultrasound598
Su A Lee, Jong Seob Jeong*
(Dongguk University, Korea)
- xxvii -
A Study of Inversion Layer Ultrasonic Transducers with Different Active Materials600

Jin Ho Sung, Chan Yuk Park, Sung Min Kim, Jong Seob Jeong*
(Dongguk University, Korea)
Development of a Dementia-screening Application using Urine Test and Depression Check in a Smartphone602
Myeon-gyun Cho
(Semyung University, Korea)
Nondestructive Hybrid Sensing Method Based on Optoacoustic Waves for Internal

Feature Extraction and Interface Analysis605
Jae-Ho Han*, Seung-Beom Yu, Chang Shi, Seungbae Ji
Automatic Flower Image Segmentation Using Color Similarity and Watershed Algorithm in
Natural Background Image607
Hosung Lee, Hyo-Haeng Lee, Kwang-Seok Hong
Copy-Rotate-Move Detection Using Compensation of Pixel Shift by Rotation609

Jong Ju Jeon, Sang Ho Park, Il Kyu Eom
Detection of Leukocyte Motions in a Microvessel611

Eung-Kyeu Kim1, Hoon-Kyeu Lee2
(Hanbat Natl University1, Trismed Co., Ltd.2)
Resource reduction method using modified integral image613

Daeha Lee, Chunsu Park, Minsu Jang, Jaehong Kim
(ETRI, Korea)
Stretchy Multivariate Polynomial Regression615

Kar-Ann Toh
PS-4
Telecommunications
A Study on Capacity Enhancement Factors in Ultra Dense Networks618

ByungCheol Lee1, Hoon Kim1, Chanho Yoon2
(Incheon National University1, Electronics and Telecommunications Research Institute2)
Design of optical delay line architecture for automotive radar test system621
Byung-Hee Son, Kwang-Jin Kim, Ye Li, Young-Wan Choi
Content aware video transmission scheme based on JPEG compression623

Artem Lenskiy, Soonuk Seol
(KOREATECH, Korea)
Micromachined Composite Right/Left-Handed Unit Cell using Gold-Coated Silicon for V-band Applications625
Kyeongseob Kim, Ik-Jae Hyeon, Chang-Wook Baek, Sungjoon Lim
- xxviii -
Delay Performance Analysis of Cross-layer Retrans-mission Schemes for Real-time Services626

Kwang-Chun Go1, Hye-Rim Cheon1, Mi-Jeong Hoh2, Jae-Hyun Kim1
(Ajou University1, Agency for Defense Development2)
Hybrid Transport Method on the Multipath Communication 628

Ji-Su Kim, Jin-Ki Kim, Jae-Hyun Kim
Electronically Switchable Metasurface for Absorption and Reflection Modes630

Minyeong Yoo, Sungjoon Lim
Performance Analysis of Reliable AL-FEC Mechanism for SOTM systems in DVB-RCS Networks631
Kyu-Hwan Lee1, Hyun-Ki Jung1, Mi-Jeong Hoh2, Jae-Hyun Kim1
(Ajou University1, Agency for Defense Development2)
Novel Inter-Cell Interference Coordination Scheme Using Normalized Intended Energy

Distribution Index with Low Computational Complexity633
Yeon-Jea Cho, Hyeong-Guen Yu, Dong-Jo Park
(Korea Advanced Institute of Science and Technology, Korea)
Efficient Location-based Routing Protocol for Border Surveillance Wireless Sensor Networks635
Jaekeun Yun1, Daehee Kim1, Noureddine Boudriga2, Sunshin An1
(Korea University, Korea1, Communication Networks and Security Research Lab., University of Carthage, Tunisia2)
New Control Method between Smart Devices Using High Frequencies637

MyoungBeom Chung, Hyunseung Choo
Securing an Infrastructure for Wireless Sensor Networks639

Daehee Kim, Jaekeun Yun, Sunshin An
Delay Measurements in Optical Code Division Multiple Access Encoder/

Decoder Based on Polymer Waveguides641
Y. Y. Ko, H. S. Kim, H. S. Moon, J. S. Kim, Youngchul Chung*
(Department of Electronics and Communications Engineering, Korea)
An Efficient ARQ Mechanism for MMT (MPEG Media Transport)643

Chang-Ki Kim1, Hongrae Lee2, Kwang-deok Seo2, JeongJu Yoo1, Byung-Gyu Kim3
(ETRI, Korea1, Yonsei University, Korea2, SunMoon University, Korea3)
An Outlier-based Heavy User Detection and Penalization Algorithm for the Fair Bandwidth
Allocation in the Internet645
Young-Min Kim, Hak-Suh Kim, Hea-Sook Park
(Electronics and Telecommunications Research Institute)
A Relay Selection Method for Relaying Systems with Simultaneous Wireless

Information and Power Transfer647
Sumaila Mahama, Kyoung-Jae Lee
- xxix -
A Relay Selection Method Based on Ergodic Capacity For Amplify-and-Forward MIMO Relays650
Roger K. Ahiadormey, Kyoung-Jae Lee
QoS Performance Analysis of Resource Allocation Scheme in WLP/WUSB/DRD Devices653

Seung Beom Lee1, Min A Jeong1, Jong-sang Back1, Joo-Seong Oh1, Yun Hee Kim2
(Mokpo National University, Korea1, Kyung Hee University, Korea2)
Binomial Filters for Spectrum Sensing in Cognitive Radio659

Seong Ro Lee1, Jinsuk Seong1, Hwan-jong Jeong1, Beom-mu Kim1, Iickho Song2
(Mokpo National University1, Korea Advanced Institute of Science and Technology2)
RF Output-Threshold Maximal-Ratio Combining for Massive MIMO Systems664

Sung-Kyung Jo, Kyung-Tae Jo, Young-Chai Ko
Effect of Line-of-Sight Wave on Performance of Simple Matched Filter in Massive MIMO Systems666
Ji-Ho Lee, Young-Jun Kim, Young-Chai Ko
A vertical handover management scheme based on decision modeling in heterogeneous wireless networks668
Murad Khan, Junhyung Kim, Jeongbae Yun, Keuchul Cho, Paul Chiedozie Uzoh, Cao Zhenbo, Kijun Han*
Cross-Layered Packet Length Aware Sleep Algorithm for the Efficient Video Streaming Service674
Taewook Chung, Chulho Chung, Jaesoek Kim
Dual-Embedded Dual-Loop Perturbation for Switchable Circularly Polarized Square

Loop Microstrip Antenna676
D.-H. Lee1, E. Lim2, D. Choi2, H.-M. Yang1, D.-W. Chung1, S. Pyo2
(KARI1, Hanbat National University2)
Design of High-Efficiency Co-Designed Load Modulation Power Amplifier Using

Tunable Matching Network678
Taeyeop Kwon, Jinho Jeong
A Quality Estimation Model for UHD Video Service in IP Lossy Network680

Jaehyung Bae1, Hong-Shik Park2
(Information and Communications Engineering1, KAIST2)
Characterization of computer generated hologram for use of LCoS-based wavelength selective switch682
Yong-Min Lee1, EunSang Jang2
(Sun Moon University, Korea1, East Photonics, Korea2)
ALBMesh+: A proposal of Load Balancing Routing Algorithm based on Ant Colony684

Optimization for 802.11 based Multi-Channel Multi-Radio Wireless Mesh Networks
Eun-Jung Lee1, Young-Min Kim2, Hong-Shik Park1
(Korea Advanced Institute of Science and Technology1, Electronics and Telecommunications Research Institute2)
- xxx -
A Dual-Band Printed Antenna for WBAN Smart Wristband Applications686

Wonseok Lee, Jaehoon Choi
Using an Injection-Locked Fabry-Perot Laser Diode688

Seung-Min Yang, Sang-Min Jung, Sang-Kook Han*
OFDMA Receiver of ISDBT based on Cooperative Reception Diversity690

Dal-Hwan Yoon, Xiang Zhao, Suck-Chang Yoon, Jong-Hwa Yoon, Jong-Uk Yoon
(Semyung University, Korea Polytechnic University, Sogang University)
An Efficient Method for the Recognition of ISAR Images694

Sang-Hong Park1, In-O Choi2, Yong-Hee Lee2, Joo-Ho Jung2, Kyung-Tae Kim2
(Pukyong National University, Korea1, Pohang University of Science and Technology, Korea2)
Design of a Dipole Antenna for WBAN Applications696

Do-Gu Kang, Jaehoon Choi
Generation of Correlated Underwater Acoustic MISO Channel Signal and Its Ergodic Channel Capacity698
Joonsuk Kim1, Il-Suek Koh2, Yongshik Lee1
(Yonsei University, Korea1, Inha University Korea2)
A Dual-Polarized Antenna for MIMO Communication700

Jungje Ha, Yongshik Lee
Miniaturization of Transmission Line Using Shunt Capacitors with Minimized Bandwidth Shrinkage702
Taejun Lim, Yongshik Lee
An Optimal LED Module Intelligent Systems for Smart Emotional-Lighting Control704

Eun-ja Jo, Su-Jeong Yun, Jun-young Jang, Chi-Ho Lin
A New Vehicle Image Compensation Enhancement Algorithm based on

An Efficient Shaking Elimination of Image706
Eun-Ja Jo, Su-Yeon Song, Sung-IL Hong, Chi-Ho Lin
PS-5
Signal Processing
Fast Intra Coding Method with Reduced RDO Complexity Using Regional Edge Information in HEVC709
Byungjin Chung, Changhoon Yim
(Konkuk University, Korea)
Tool-Mediated Haptic Surface Recognition711

Jun-Yong Lee, Qing-Fu Han, Hyoung-Gook Kim
(Kwangwoon University, Korea)
- xxxi -
Pedestrian Detection Algorithm using GFB and Census Transform712

Sewon Lee, Jin-won Jang, Hyo-Jun Son, Kwang-Ryul Baek
Formant refinement algorithm using K-means clustering for HMM-based speech synthesis714
Sunghee Jung, Sangjun Park, Keunseok Cho, Minsoo Hahn
(KAIST, Korea)
Robust Audio Fingerprint Generation Based on Local Peak-Pairs716

Hye-Seung Cho, Qingfu Han, Hyoung-Gook Kim
Restricted Intra Block Copy Search for Fast Encoding of HEVC Screen Content Coding717
Jonghyun Ma, Xiangjian Wu, Youngwoong Kim, Donggyu Sim
Automatic Clustering of Speech Data Using MLLR Adaptation Technique720

Sung Min Ban1, Bo Kyung Choi1, Ga Hui Lee1, Young Ho Choi1, Byung Ok Kang2, Hyung Soon Kim1
(Pusan National University1, ETRI2)
Weight-Based Classification of Road Surface Type Using Clustering722

Hyungmin Kim, Joongseok Song, Jong-Il Park
A Contrast Enhancement Algorithm Using Adaptive Threshold in Infrared Image Environment726

Sun-Mi Oh, Joongseok Song, Jong-Il Park
An Efficient Skin Color Conversion for Face Replacement729

Joongseok Song, Hyungmin Kim*, Jong-Il Park
Skin color segmentation using training set partitioning and multiple elliptical Gaussian models731
Young-Ji Yoon, Oh-Yeol Kwon, Sung-Il Chien
Color Filter Array Interpolation using Guided Filter735

Yonghoon Kim, Dokyung Lee, Ung Hwang, Jechang Jeong
Analysis of Micro Doppler Detection algorithms for Human Motion Gesture in Software Defined Radar739
Jung S. Jung1, Myeong S. Park2, In S. Woo1, Young K. Kwag1
(Korea Aerospace University1, Korea Aerospace University Radar Research Institute2)
Scene Boundary Detection in video741

Ruichen Jin, Jongweon Kim
(Sangmyung University, Korea)
Noise Power Scheduling for Online Secondary Path Modeling in Multi-channel Feedback ANC Systems743
J.B. Seo, S.W. Nam
- xxxii -
A Least Square Fitting Method for Surgical Tool Tip Calibration745

K. Y. Shin1, S. O. Jin1, K. C. Nam2, S. K. Yoo3
(Korea Electrotechnology Research Institute1, Dongguk University2, Queens University Belfast3)
A Speed-up Method of HOG Computation Algorithm for Real-time Pedestrian Detection747

Yun-Gu Lee, Jae-Heung Lee
A Real-Time Viola-Jones Object Detector using PSO with Tracking Method749

Byeong-Ju Park, Jae-Heung Lee
Iterative Reconstruction of a Signal from its Aliased Fourier Transform Magnitudes751

Wooshik Kim
(Sejong University, Korea)
An Adaptive Error Compensation Method for Thumbnail Generation in H.264/AVC Bitstreams756

Kyung-Jun Lee, Won-Jin Lee, Je-Chang Jeong
Combining Edge-aware Disparity Propagation and Iterative Voting for Stereo matching758
Eunah Choi, Min Choi , Changkyoung Eem, Hyunki Hong
Vision-based Gesture Recognition with RGB-D Sensors for Physiotherapy Exercises760

Young-Sook Lee, Wan-Young Chung*
(Pukyong National University, Korea)
Image Reconstruction Using Multiple Adaptive Regulari-zation in Electrical Impedance Tomography762

Min Ho Jeon, Bong Seok Kim, Suk In Kang, Kyung Youn Kim
(Jeju National University, Korea)
Pedestrian detection Using individual feature information from multiple pedestrian tracking process764
Jeong-Muk Kim, Ramesh Kumar Lama, Dibash Basukala, Suk-seung Hwang, Jae-Young Pyun, Goo-Rak Kwon
(Chosun University, Korea)
A Real-Time Eye Gaze Correction Method based on Head Pose Estimation in a Calibrated Environment766
Chia-Wei Lim, Moonsoo Ra, Whoi-Yul Kim
Development of a Red Apple Counting Algorithm Based on Apple Tree Recognition770

Donggi Kim, Hongchul Choi, Jaehoon Choi, Seong Joon Yoo, Dongil Han*
(Sejong University, Korea)
Fast Stream Switch Method for Real-time Transfer Protocol772

Daehyun Pak, Seongwan Kim, Kyungmin Lim, Changhyun Park, Sangyoun Lee
Depth Reliability Measurement for Vehicle Stereo Vision774

Jaesung Kim, Changhyun Park, Junghyun Kim, Sangyoun Lee
- xxxiii -
Palmprint Recognition for Mobile Devices776

Jin Su Kim, Jaihie Kim
(Yonsei University, Biometrics Engineering Research Center)
Multi Feature Concatenation for Human Face Recognition778

Jaesung Choi, Yuseok Ban, Hanbyeol Bae, Minkyu Lee, Sangyoun Lee
Online Gesture Recognition Using Template Matching Method with Particle Swarm Movement780
Clementine Nyirarugira, Tae Yong Kim
Real-Time Video Monitoring System with Motion Detection782

Seulkee Jung, Jihye Kim, Seongsoo Lee
(Soongsil University, Korea)
Entropy Based Enhancement of Low Luminance Image785

Se Eun Kim1, Yong Ho Moon2, Il Kyu Eom1
(Pusan National University1, Gyeongsang National University2)
Video Quality Assessment Method between DVD-Quality movie and Cam-Quality

movie using Noise Detection787
Hyungkwan Son, Yongseok Seo, Wonyoung Yoo
(Contents Protection Lab, Electronics and Telecommunications Research Institute)
Penalty Added DTW Gesture Recognition Based on Velocity Orientation789

Hyo-Rim Choi, Clementine Nyirarugira, TaeYong Kim
Color Modification Detection Using CFA Pattern Decomposition791

Jun Ryung Seo, Il Kyu Eom
Performance Comparison of Precoding Schemes for Full Duplex Communication in

Full Duplex Two User MIMO Downlink Channel793
Hyunjong Na, Chungyong Lee
Image Restoration of Number Plate to Correspond to Moving Vehicles and Low

Illumination (ICEIC 2015)795
Young-Min Jang, Ji-Geun Kim, Chang-Hee Park, Sang-Bock Cho
(University of Ulsan, Korea)
A direct power measure method for LDO regulator of power management IC797
Young-Min Lim1,2, Dong-Soo Lee1, Ji-Hoon Kang1, Dam Yoon1, Jung-Woo Ha2, Kang-Yoon Lee1
(Sungkyunkwan University, Korea1, Samsung Electronics, Korea2)
Remote Inspection of Injected Sealant on Car Body Assembly by Using Small Camera799
Jae Hong Joo*, Hie Sik Kim, Gi Doo Kim, Seung Jae Lee, Seung Ho Han
- xxxiv -
ICEIC 2015

Oral Session
TO-2-1
Special Symposium on Intelligent
Control and Robotics I
TO-2-1-1
'HVLJQDQG&RQWURORI3URVWKHWLF5RERW+DQGIRU'H[WHURXV0DQLSXODWLRQ

6HRN+ZDQ-HRQJ3\XQJNDQJ.LP<RXQJ-XQH6KLQDQG.\XQJ6RR.LP

'HSDUWPHQWRI0HFKDQLFDO(QJLQHHULQJ.$,675HSRI.25($

$JHQF\IRU'HIHQVH'HYHORSPHQW5HSRI.25($
N\XQJVRRNLP#NDLVWDFNU.6.LP

$EVWUDFW

,QWKHSDSHUDURERWKDQGLVGHVLJQHGIRUSURVWKHVLV,Q
RUGHUWRDFKLHYHWKHOLJKWZHLJKWEXWKLJKJUDVSLQJ IRUFH
ZH SUHVHQW WKH UHFHQW UHVXOWV RQ WKH GLVWULEXWHG DFWXDWLRQ
SULQFLSOHDQGWKHWZLVWHGVWULQJDFWXDWLRQZLWKGXDOPRGHV
$OVRWKHSUHOLPLQDU\ZRUNVIRULQWHUIDFLQJWKHURERWKDQGV
WRKXPDQZLOOEHSUHVHQWHG

.H\ZRUGV5RERWKDQGSURVWKHVLVDFWXDWLRQPHFKDQLVP
,QWURGXFWLRQ

7KHUHKDYHEHHQPDQ\DSSURDFKHVWRGHYHORSWKHURERW
KDQGVLQYDULRXVSXUSRVHV)RUH[DPSOHDKXPDQRLGURERW
QHHGVURERWKDQGVIRUUHDOL]LQJWKHKXPDQKDQGIXQFWLRQV
$OVR D JULSSHU IRU LQGXVWULDO URERWV PD\ EH YLHZHG DV D
URERW KDQG 7KHVH NLQGV RI URERW KDQGV IRU URERWLF
RSHUDWLRQ DUH DOORZHG WR EH UHODWLYHO\ KHDY\ WR VRPH
H[WHQWDQGRSHUDWHZLWKVLPSOHIXQFWLRQVVXFKDVJULSSLQJ
+RZHYHU LQ WHUPV RI SURVWKHVLV WKH URERWLF KDQG GHVLJQ
EHFRPHVYHU\WRXJKLWVKRXOGEHOLJKWKDYHODUJHJUDVSLQJ
IRUFH HJ D KXPDQ URERW ILQJHU ZKLFK LV PHUHO\ OLJKWHU
WKDQJFDQJHQHUDWHXSWR1DQGEHGH[WHURXV$QG
PRUHRYHU WKH SURVWKHWLF URERW KDQG VKRXOG KDYH WKH
PRELOLW\DQGUHODWLYHO\ORQJWHUPXVH&RQVLGHULQJDOOWKHVH
WKH FRQYHQWLRQDO DSSURDFKHV PD\ QRW EH HIIHFWLYH WR WKH
SURVWKHWLF URERW KDQG GHVLJQ 7KURXJK WKH SDSHU ZH
SUHVHQW WKH UHFHQW UHVXOWV RQ WKH GLVWULEXWHG DFWXDWLRQ
SULQFLSOHWKHWZLVWHGVWULQJDFWXDWLRQZLWKGXDOPRGHVDQG
WKHGHYHORSHGURERWKDQG$OVRWKHSUHOLPLQDU\ZRUNVIRU
LQWHUIDFLQJWKHURERWKDQGVWRKXPDQZLOOEHSUHVHQWHG
%DVHG RQ WKLV FKDUDFWHULVWLF RI WKH KXPDQ ILQJHU ZH

SURSRVHG D URERW ILQJHU XVLQJ GLVWULEXWHGDFWXDWLRQ
PHFKDQLVP>@8OWUDVRQLFPRWRUV860ZKLFKJHQHUDWHG
OLQHDU PRWLRQ DUH LQVWDOOHG LQ HDFK OLQNV DQG DSSO\
WKUXVWLQJIRUFHWRHQGRIWKHFRQQHFWLQJURGIRUFLQJSRLQW
7KHUHIRUHGLVWULEXWHGDFWXDWLRQPHFKDQLVPKDVUHGXQGDQF\
RI ILQJHU SRVWXUH DQG IRUFHGLVWULEXWHG HIIHFW IURP WKH
VOLGLQJ DFWXDWLRQ 7KRVH IHDWXUHV PD[LPL]H ILQJHUWLS IRUFH
E\RSWLPL]LQJWKHILQJHUSRVWXUHDQGORFDWLRQVRIWKHDFWLQJ
IRUFHVZLWKRXWFKDQJLQJILQJHUSRVWXUH>@
+RZHYHU LW LV VWLOO GLIILFXOW WR DFKLHYH SHUIRUPDQFH RI
WKH KXPDQ KDQG 7KHUHIRUH ZH SURSRVHG D QHZ W\SH RI
SRZHUWUDQVPLVVLRQV\VWHPZKLFKFDQJHQHUDWHODUJHIRUFH
DQG IDVW VSHHG EDVHG RQ WZLVWHG VWULQJ DFWXDWLRQ >@
UHIHUUHG WRDV GXDOPRGH DFWXDWLRQ )LJ 7KH SURSRVHG
PHFKDQLVP KDV WZR RSHUDWLRQ PRGHV 6SHHG 0RGH DQG
)RUFH0RGH,QWKH6SHHG0RGHWKHVWULQJVDUHZRXQGLQ
3DUW , SURGXFLQJ IDVW JUDVSLQJ PRWLRQ 7KHQ DV UHDFWLRQ
IRUFHIURPWKHREMHFWLQFUHDVHVWKHVWULQJLQ3DUW,,EHJLQV
WR EH ZRXQG DQG FRQWUDFW ZKLFK HYHQWXDOO\ LQFUHDVHV WKH
JUDVSLQJIRUFH>@
)LQDOO\ ZH GHYHORSHG DQ DQWKURSRPRUSKLF URERW KDQG
ZLWK WKH SURSRVHG GXDOPRGH DFWXDWLRQ )LJ 7KH
ILQJHUWLS IRUFH RI WKLV URERW KDQG FDQ EH JHQHUDWHG XS WR
1DQGWKHEHQGLQJVSHHGRIWKHURERWILQJHUFDQUHDFK

1HZDFWXDWLRQPHFKDQLVPV

$FFRUGLQJ WR WKH PXVFOHDQGMRLQW DUFKLWHFWXUH RI WKH
KXPDQ ILQJHUV VLPSOH EHQGLQJ RU H[WHQGLQJ PRWLRQV DUH
REWDLQHG QRW E\ WKH OXPSHG DFWXDWLRQ EXW E\ WKH VSDWLDOO\
GLVWULEXWHGDFWXDWLRQRIDQXPEHURIPXVFOHVRYHUDILQJHU
-2-
)LJ&RQFHSWRIDGXDOPRGHURERWILQJHU>@
)LQJHUWLS)RUFHNJI
ICEIC 2015
,QGH[)LQJHU
0LGGOH)LQJHU
(VWLPDWHG,QGH[
(VWLPDWHG0LGGOH

7LPHV

)LJ)LQJHUWLSIRUFHHVWLPDWLRQUHVXOWE\DSURSRVHG
PRGHOXVLQJVXUIDFH(0*V

)LJ7KHURERWKDQGZLWKWKHGXDOPRGHDFWXDWLRQ>@
)LJ&RQFHSWRIDFWLYHGXDOPRGHDFWXDWLRQ

XSWRGHJUHHVLQHDFKPRGH>@
+RZHYHULWLVGLIILFXOWWRXVHWKHGXDOPRGHDFWXDWLRQLQ
UHDO HQYLURQPHQW EHFDXVH RI LQFRQVLVWHQW FRQGLWLRQ RI
PRGHFKDQJHDQGFRPSOH[H[WHQGLQJSURFHGXUHFDXVHGE\
WKH SDVVLYH EUDNH 7R VROYH WKHVH SUREOHPV DFWLYH GXDO
PRGHDFWXDWLRQKDVEHHQQHZO\SURSRVHGDVVKRZQLQ)LJ
8VLQJ D ORZ SRZHU PLQLDWXUH '& PRWRU LQVWHDG RI WKH
SDVVLYH EUDNH WKH DFWLYH GXDOPRGH UHDOL]HV DFWLYH PRGH
FKDQJH DQG VLPSOH H[WHQGLQJ SURFHGXUH 7KURXJK WKLV
PHFKDQLVPFRPSDFWDQGDFWLYHSRZHUWUDQVPLVVLRQV\VWHP
FDQEHUHDOL]HG
,QWHUIDFLQJWR+XPDQ

(OHFWURP\RJUDSK\ (0* LV D UHODWLYHO\ VWURQJ DQG
GLUHFWVLJQDORIKXPDQLQWHQVLRQIRUSURVWKHVHVFRQWURO,Q
WKH SDVW WKUHH GHFDGHV FODVVLILFDWLRQ EDVHG DSSURDFKHV
KDYHDFKLHYHGTXLWHKLJKDFFXUDFLHVIRUGLVFUHWHQXPEHURI
JHVWXUHV >@ +RZHYHU IRU DQ LQWXLWLYH DQG VLPXOWDQHRXV
FRQWURO RI VHYHUDO ILQJHUV WKLV PHWKRG LV QRW VXLWDEOH
EHFDXVHLWFDQFRQWURORQO\RQHGHJUHHRIIUHHGRPDWDWLPH
,QVWHDG ZH SURSRVH D PXVFXORVNHOHWDO PRGHO ZKLFK
SUHGLFWV D ILQJHUWLS IRUFH ZLWK VXUIDFH (0*V 7KH PRGHO
FRQWDLQV D FRQFHSW RI PXVFOH SK\VLRORJ\ DQG H[SODLQV
QRQOLQHDULW\ RI PXVFOHWRIRUFH UHODWLRQVKLS DQG FRXSOLQJ
EHWZHHQILQJHUV,QWKHH[SHULPHQWIRUDQDEOHERGLHGZLWK
VXUIDFH (0* VHQVRUV WKH PRGHO SUHGLFWHG LQGH[ DQG
PLGGOH ILQJHUWLS IRUFHV SURSRUWLRQDOO\ DQG VLPXOWDQHRXVO\
)LJ)RUWKLVVXEMHFW3HDUVRQVFRUUHODWLRQFRHIILFLHQWV
IRULQGH[DQGPLGGOHDUHDQGUHVSHFWLYHO\
-3-
&RQFOXGLQJ5HPDUNV

,Q WKLV SDSHU ZH KDYH SURSRVHG QRYHO FRQFHSWV RI
DFWXDWLRQ PHFKDQLVP IRU SURVWKHWLF URERW KDQG IRU
DFKLHYLQJWKHIDVWEHQGLQJVSHHGDQGODUJHJUDVSLQJIRUFH
,Q DGGLWLRQ DQ V(0*EDVHG KXPDQURERWLQWHUIDFH LV
VXJJHVWHG ZKLFK DOORZV WKH DFFXUDWH HVWLPDWLRQ RI WKH
LQGH[DQGPLGGOHILQJHUWLSIRUFHV7KURXJKWKHVHUHVXOWVLW
LVH[SHFWHGWKDWWKHSURSRVHGURERWKDQGFDQEHFRQWUROOHG
E\DQRSHUDWRUEDVHGRQKLVKHUPRWLRQLQWHQWLRQLQWXLWLYHO\
$FNQRZOHGJPHQW

7KLVUHVHDUFKZDVVXSSRUWHGE\%DVLF6FLHQFH5HVHDUFK
3URJUDP WKURXJK WKH 1DWLRQDO 5HVHDUFK )RXQGDWLRQ RI
.RUHD15)IXQGHGE\WKH0LQLVWU\RI(GXFDWLRQ5HSRI
.RUHD
5HIHUHQFHV

>@<-6KLQDQG.6.LP'LVWULEXWHG$FWXDWLRQ0HFKDQLVP
IRU D )LQJHUW\SH 0DQLSXODWRU 7KHRU\ ([SHULPHQWV ,(((
7UDQVDFWLRQVRQ5RERWLFVSS-XQH

>@ 7 :XUW] & 0D\ % +RO] & 1DWDOH * 3DOOL DQG &
0HOFKLRUUL 7KHWZLVWHGVWULQJDFWXDWLRQV\VWHP0RGHOLQJDQG
FRQWURO ,((($60( ,QWHUQDWLRQDO &RQIHUHQFH RQ $GYDQFHG
,QWHOOLJHQW0HFKDWURQLFVSS-XO\

>@<-6KLQ+-OHH.6.LPDQG6.LP$5RERW)LQJHU
'HVLJQ XVLQJ D 'XDO0RGH 7ZLVWLQJ 0HFKDQLVP WR $FKLHYH
+LJK6SHHG 0RWLRQ DQG /DUJH *UDVSLQJ )RUFH ,(((
7UDQVDFWLRQVRQ5RERWLFVSS'HFHPEHU

>@<-6KLQ.+5HZ.6.LPDQG6.LP'HYHORSPHQW
RI $QWKURSRPRUSKLF 5RERW KDQG ZLWK 'XDOPRGH 7ZLVWLQJ
$FWXDWLRQDQG(OHFWURPDJQHWLF-RLQW/RFNLQJ0HFKDQLVP,(((
,QWHUQDWLRQDO&RQIHUHQFHRQ5RERWLFVDQG$XWRPDWLRQSS
0D\

>@ ( 6FKHPH DQG . (QJOHKDUW (OHFWURP\RJUDP SDWWHUQ
UHFRJQLWLRQ IRU FRQWURO RI SRZHUHG XSSHUOLPE SURVWKHVHV VWDWH
RI WKH DUW DQG FKDOOHQJHV IRU FOLQLFDO XVH -RXUQDO RI
UHKDELOLWDWLRQUHVHDUFKDQGGHYHORSPHQWSS6HSWHPEHU

TO-2-1-2
Yet another tutorial of disturbance observer in view of robust stabilization

and robust transient response
Hyungbo Shim
ASRI, Department of Electrical and Computer Engineering,
Seoul National University, Seoul, Korea
hshim@snu.ac.kr
we may not tune all the controllers in a massproduction of control systems one-by-one. Rather, we
need another inner-loop controller, whose role is just to
make the real plant under external disturbance become
a nominal plant without disturbance. If this task is
achieved at least approximately, then the outer-loop
controller that is designed just for the nominal plant
will work well in the real closed-loop system, showing
the nominal transient as well as steady-state
performance.
Abstract
In this presentation, recent findings on disturbance
observer are briefly reviewed, and we discuss how to
use the disturbance observer as a tool for robust
control; in particular, for robust transient behavior
and robust stabilization.
keywords: disturbance observer, robust transient
behavior, robust control
This is the underlying idea of the disturbance-observerbased robust control, and Ill discuss what has been
done in the past few years in this direction of research.
While there are many robust control techniques in the

literature, there are few control methods that can deal
with robust transient behavior. By robust transient
behavior, I mean that the output of the real plant (that
contain parametric uncertainty and external
disturbances) exhibits the nominal output time
trajectory, at least approximately. Here, the nominal
output time trajectory is the output of the (virtual)
nominal plant that are under the control of a preexisting output feedback controller (that we will call
the outer-loop controller in this paper), and the initial
condition of this nominal closed-loop system,
consisting of the nominal plant and the outer-loop
controller, is supposed to be the same as the real plant
and the outer-loop controller.
This work was supported by the National Research

Foundation of Korea grant funded by the Ministry of Science,
ICT & Future Planning (No. 2009-0083495).
Robust transient behavior is in particular important in

some industrial applications. For example, when a
robust arm is painting, controlling the tip position from
the beginning to the end of the trajectory (i.e., not just
for the steady-state) is rather important. In general,
once a controller for a nominal plant is designed such
that the closed-loop has satisfactory rising time, settling
time, and overshoot, it is usually desired that the same
transient performance is guaranteed in real closed-loop
which is under uncertainty and disturbance.
A good transient behavior may be obtained if the
control engineers tune the controller. The problem is,
-4-
TO-2-1-3
Soft Elastomeric Actuators for Wearable Hand Exoskeleton

Hong Kai Yap1, 2, James Cho Hong Goh2, Raye Chen-Hua Yeow2, 3
1
NUS Graduate School for Integrative Sciences and Engineering
2
Department of Biomedical Engineering, National University of Singapore
3
SINAPSE-Advanced Robotics Center
hongkai@u.nus.edu, biehead@nus.edu.sg, bieych@nus.edu.sg
Abstract
Conventional actuators have been used for a long time
in biomedical application. However, the rigid nature of
the actuators has a lot of drawbacks when it comes in
contact with human body especially for rehabilitation
applications. Recently, soft elastomeric actuators are
drawing attention due to their high compliance and
customizability. In this paper, a soft elastomeric
actuator and its actuation characteristics such as bend
radius and force output will be presented. This work
serves as a guideline for designing soft elastomeric
actuators with application-specific requirements such
as soft exoskeleton for rehabilitation. The
rehabilitation application of the actuators will also be
demonstrated in this work.
Keywords:
Exoskeleton
Soft
Actuators,
Wearable,
Figure 1. Illustration of the soft elastomeric actuator

before and after actuation.
Combined with appropriate design considerations such

as desired range of motion and force, a soft actuator is
able to fulfill specific tasks and applications that
require compliant actuation. When the soft actuator is
not actuated, it is soft and compliant. It deforms from
straight to curve upon pressurization and provides
force and bending movement. This characteristic
inspires us to develop a wearable hand exoskeleton for
rehabilitation, which is flexible and wearable when it is
not actuated; and is able to provide substantial forces to
actuate the finger joints and hand when it is actuated.
Hand
1. Introduction
Soft robotics is an emerging field that seeks to
replace traditional rigid robots, particularly in
applications where complex and expensive hard robots
are deemed unsuitable [1-3]. Compared to hard robots
that require a complex mechanical structure, soft
robots involve very simple design and control to
generate desired actuation. Complex motion can be
integrated into a simple and soft structure, to achieve a
range of actuation from a single degree-of-freedom
movement to robot with multiple modes of gait [2-4].
This paper aims to identify the various design

parameters for soft actuator such as material, bend
radius and force output. We presented the
characteristics of the actuator such as the force output
and bend radius at different pressures, which was
measured by a customized characterization setup.
Finally, we demonstrated the rehabilitation application
of the soft actuator, i.e. a wearable hand exoskeleton
that actuates the finger joints.
Soft elastomeric actuator is one of the broad

classifications of soft robotics. Its low inherent
stiffness and high compliance makes it suitable for
biomedical applications that involve physical
interaction with body parts, where the impedance is
required to be sufficiently low and does not interfere
with the natural movement of the joints [1].
2. Fabrication of Actuators
The soft elastomeric actuator was fabricated using
two different types of silicone rubber (Table 1). The
actuator was embedded with air chambers that inflate
-5-
ICEIC 2015
upon pressurization. In order to attain a bending
motion, a layer of strain-limiting fabric was attached to
the bottom surface of the actuator. Upon
pressurization, the top surface of the actuator expands
due to the inflation of the embedded air chambers,
while the elongation of bottom surface remained
unchanged (Fig 1). As a result, bending movement
and torque were produced during actuation.
Figure 4. Prototype of soft wearable exoskeleton with soft
actuator a) Front View b) During Actuation
Table 1: List of different types of silicon rubber

Material
Ecoflex 00-30
Dragon Skin 20
Shore Hardness
00-30
A-20
4. Hand Exoskeleton Application

Figure 4 illustrates a wearable hand exoskeleton
with soft elastomeric actuators for patients with
neurological diseases such as stroke and spinal cord
injury. This prototype can be donned comfortably onto
patients, with minimal interference with the natural
movement of the finger joints. The soft actuator is able
to actuate finger joints. To improve on the design of
the hand exoskeleton, several design considerations
have been made. Firstly, in order to actuate the fingers
of patients, the bending actuator must be able to
generate substantial force. This is often a challenge in
force-required applications as the force output of soft
actuator is limited. This is particularly so for the hand
rehabilitation application where the stiffness of the
joint plays a main part. Secondly, the bending actuator
as well as the hand exoskeleton must have high
customizability as the geometry and stiffness of the
hand and fingers differ in different patients due to the
complications of their diseases.
3. Actuator Characterization
3.1 Bend radius - Pressure
Figure 2 shows the relationship between bend
radius of the bending actuator and input pressure. For
Ecoflex 00-30, the minimum bend radius achieved was
12mm at 26kPa; For Dragon Skin 20, the minimum
bend radius was 30mm at 210kPa. The actuator
responded faster at first and slowly reached its steady
state. When the bend radius reached the steady state,
further increase in input pressure did not result in much
changes of the bend radius.
3.2 Force - Pressure

The relationship between the input pressure and the
force output was shown in Figure 3. The maximum
force output of Ecoflex 00-30 was 9.625N at 30kPa;
while for Dragon Skin 20, the maximum force output
was 10.35N at 225kPa.
5. Conclusion
This work characterizes few design parameters such
as bend radius and force output of the soft elastomeric
actuator. Preliminary results have proved the feasibility
of developing application such as wearable hand
exoskeleton using soft elastomeric actuator.
References
Figure 2. Comparison of the Ecoflex 00-30 and Dragon

Skin 20 actuators: Relationship of bend radius versus
input pressure.
[1] Ilievski, F., et al., Soft Robotics for Chemists.

Angewandte Chemie International Edition, 2011. 50(8):
p. 1890-1895.
[2] Martinez, R.V., et al., Elastomeric Origami:
Programmable Paper-Elastomer Composites as
Pneumatic Actuators. Advanced Functional Materials,
2012. 22(7): p. 1376-1384.
[3] Shepherd, R.F., et al., Multigait soft robot. Proceedings
of the National Academy of Sciences, 2011.
Figure 3. Comparison of the Ecoflex 00-30 and Dragon

Skin 20 bending actuators: Relationship of force output
versus input pressure.
[4] Martinez, R.V., et al., Robotic Tentacles with ThreeDimensional Mobility Based on Flexible Elastomers.
Advanced Materials, 2013. 25(2): p. 205-212.
-6-
TO-2-1-4
Posture Synchronization for a Tele-presence Robotic system

Zhongjian Li1,2, Mingming Li1, Shuzhi Sam Ge1
1
Department of Electrical and Computer Engineering, and Social Robotics Laboratory,
Interactive Digital Media Institute, National University of Singapore, Singapore 117576
2
School of Automation, Northwestern Polytechnical University, Xi'an 710072, China
samge@nus.edu.sg
In this paper, a tele-presence robotic system is
developed to further improve the interactivity between
a user and his remote communicator by synchronizing
the upper body posture of the remote communicator
onto the humanoid social robot Adam (as shown in Fig.
1). The advantages of Adam is that it has a similar
upper body structure to human and therefore is capable
of reproducing human-like posture that conveys
nonverbal information generated from the humans
posture as demonstrated in [3] .
Abstract
In this paper, we propose a tele-presence robotic
system which integrates human robot synchronization
and audio-video conferencing technology. By using the
motion sensing input device, the social robot Adam is
able to reproduce a persons dynamic upper body
posture that represents his nonverbal behavior, thus
creating a feeling of presence for his communicator.
The proposed system can provide with users a
multimodal communication experience and enhance
the level of interaction between local user and his
remote communicator. Experiments show that the
system can increase the interactivity and the
effectiveness of communications between humans.
Keywords: Social Robot, Gesture Mapping, Telepresence, Kinect
1. Introduction
Fig. 1. Social robot Adam (the red arrows

demonstrate the 6 DOFs)
There has been a growing trend for robots to emerge

in peoples daily life. In particular, these robots can
provide various forms of support and service to humans,
including care and education for children, health care
for the elderly and rehabilitation therapy for the
patients. These kinds of robots are categorized as social
robots as they are autonomous and capable of socially
interacting with humans [1-3].
The concept and application of tele-presence
technology originate from humans physical limitation
that he cannot be present simultaneously in two
different places. This limitation has been well
addressed by audio-video conferencing technology.
The nonverbal behavior is also fundamental in
expressing the affective states, attitudes, and social
dynamics of the communicators. An appropriate
nonverbal posture is important for helping
communicate intent, instruct, lead, and build rapport.
2. System Configuration
The proposed tele-presence robotic system consists
of three parts, namely the audio-video conferencing
software, the skeleton analysis module and the social
robot Adam. The audio-video conferencing software is
a mature and convenient tool to transmit video and
voice signal for verbal communication between users.
The skeleton analysis module is responsible for
analyzing the 3D skeleton point coordinates that are
extracted from the images of the remote users upper
body captured by Kinect sensor. The social robot
Adam will synchronize the remote users upper body
posture according to result of joint angle computation
in the skeleton analysis module.
-7-
ICEIC 2015
joint positions so as to realize human robot posture
synchronization.
In the skeleton analysis module, Kinect sensor is

used to capture 3D human skeleton coordinates of the
user, which are used to describe the 3D spatial position
of humans head, shoulders, elbows, and wrists. It then
transmits the coordinates to the Skeletal Viewer
program so that the data are used for sketching the
skeletal outline of the user. To detect human body
motion, the skeleton coordinates are sampled at 15Hz
and smooth functions are incorporated to eliminate
noise and undesired shake of the extracted skeleton. An
example of skeleton detection result is illustrated in Fig.
2.
y
z
RS2
RS
Direction of the
Kinect Sensor
RS1
R1
n1
RE
Fig. 3. Decomposition of spatial vector R1
3. Experiment and Results

An experiment is conducted to evaluate the
feasibility of the proposed system. 50 participants were
invited to participate in a study on Posture
Synchronization for a Tele-presence Robotic system.
From the perspectives of these volunteers, the telepresence robot gives users the feeling that their
communication partners were actually present in front
of them, improving the quality of communication, and
64% of them feel that the system is convenient to use.
Fig. 2. Result of skeleton detection

As shown in Fig. 2, the human upper body skeleton
contains 7 skeleton points, namely, the head (H), left
and right shoulders (LS and RS), left and right elbows
(LE and RE), and left and right wrist (LW and RW).
Each of the skeleton points is uniquely defined by a set
of 3D position coordinate (x, y, z). Then, the
directional spatial vectors are computed as L1 = LE
LS, L2 = LW LE, R1 = RE RS, and R2 = RW RE.
For the joint angles of Adams elbows, they can be
directly determined as
LE arccos
L1 L2
L1 L2
RE arccos
R1 R 2
R1 R 2
4. Conclusions and Future Work

In conclusion, the feasibility of our proposed system
has been proven, with 74% of the volunteers agreeing
that the robotic system can enhance the quality of
communication. In the future, the tele-presence robots
would be developed to be more expressive so as to
reproduce complicated human posture quickly and
accurately without lagging behind in speed and further
enhance the feeling of presence when using the robot
as a communication medium.
References
As for the joint angles of Adams shoulders, let us

firstly consider the two joint angles of right shoulder as
shown in Fig. 3.
To calculate the joint angles RS1 andRS2, we first
obtain the spatial vector n1 by projecting R1 onto the
zoy plane. Then, we have
RS 1 arccos
RS 2 arccos
[1] S. S. Ge, C. F. Liew, Y. Li, and J. Yang, System design

and hardware integration of social robot Nancy, in
IEEE/SICE International Symposium on System Integration
(SII), 2011, pp. 336341, 2011.
[2] S. S. Ge, J.-J. Cabibihan, Z. Zhang, Y. Li, C. Meng, H.
He, M. Safizadeh, Y. Li, and J. Yang, Design and
development of Nancy, a social robot, in 8th International
Conference on Ubiquitous Robots and Ambient Intelligence
(URAI), 2011, pp. 568573, 2011.
n1 R 1
n1 R 1
ny R 1
ny R 1
where ny = (0, 100, 0) denotes the normal vector

along the direction of axis y. For the joint angles of left
shoulder, they can be determined via similar method.
Then, the 6 joint angles will be sent to the servo
controller and the servo motors will move to the same
[3] J. Cabibihan, W.-C. So, and S. Pramanik, Humanrecognizable robotic gestures, IEEE Transactions on
Autonomous Mental Development, vol. 4, no. 4, pp. 305
314, 2012.
-8-
TO-2-1-5
,QWHJUDWHG'HVLJQRID)OH[XUH%DVHG$FWXDWRU8VLQJ*.<3/HPPD

+DL\XH=KX&KHH.KLDQJ3DQJDQG7DW-RR7HR
1
Department of Electrical and Computer Engineering, National University of Singapore
2
Singapore Institute of Manufacturing Technology, A*STAR, Singapore
E-mail {a0094169, justinpang}@nus.edu.sg tjteo@SIMTech.a-star.edu.sg

GHQRPLQDWRU SRO\QRPLDOV e.g dp(p) ZKHUH p GHQRWHV D
YHFWRURIGHVLJQSDUDPHWHUVWREHGHWHUPLQHG$FFRUGLQJO\
DVWDQGDUGQHJDWLYHIHHGEDFNFRQWUROOHUKLVIRUPXODWHGDV
nk Ok
K

dk
ZKHUHkUHSUHVHQWVWKHGHVLJQSDUDPHWHUVLQWKHFRQWUROOHU
7KH VHQVLWLYLW\ DQG FRPSOHPHQWDU\ VHQVLWLYLW\ WUDQVIHU
IXQFWLRQRIWKHFORVHGORRSV\VWHPDUHH[SUHVVHGDV
d p O p d k
S
n p nk Ok d p O p d k

n p nk Ok
T
$EVWUDFW
This paper presents an integrated design framework that
systematically design closed-loop flexure-based actuator
considering the control performance. By creating and
solving an optimization formulated by the specified control
specifications, the design parameters in both the plant and
controller are obtained simultaneously.
.H\ZRUGVMechatronics design, integrated design,
optimization, linear matrix inequality.
,QWURGXFWLRQ

0HFKDWURQLFV GHVLJQ RIWHQ JR WKURXJK D F\FOLFDO
SURFHVV WUDGLWLRQDOO\ >@ WKDW OLPLW LWV SHUIRUPDQFH DQG
LQFUHDVHWKHFRVW5HFHQWO\PHWKRGVWKDWLQWHJUDWHGGHVLJQ
ERWKSODQWDQGFRQWUROOHUDUHSURSRVHG>@,QWKLVSDSHUDQ
LQWHJUDWHG GHVLJQ IUDPHZRUN LV SURSRVHG WR GHVLJQ WKH
PHFKDWURQLFV V\VWHPDWLFDOO\ WKDW FRQVLGHULQJ FORVHGORRS
FRQWURO SHUIRUPDQFH 7KH GHVLJQ IUDPHZRUN LV FRQGXFWHG
E\ FUHDWLQJ DQ RSWLPL]DWLRQ SUREOHP ZKHUH WKH FORVHG
ORRS FRQWURO VSHFLILFDWLRQV DUH IRUPXODWHG DV WKH
FRQVWUDLQWV YLD OLQHDU PDWUL[ LQHTXDOLW\ DQG ERWK WKH
SDUDPHWHUVLQSODQWDQGFRQWUROOHUDUHDIILQHO\ORFDWHG%\
VROYLQJWKHRSWLPL]DWLRQSUREOHPWKHGHVLJQSDUDPHWHUVLQ
ERWKWKHSODQWDQGFRQWUROOHU DUHREWDLQHGVLPXOWDQHRXVO\
ZKLFK IXOILO WKH GHVLUHG VSHFLILFDWLRQV $Q H[DPSOH LV
SUHVHQWHGWRGHVLJQDIOH[XUHEDVHGHOHFWURPDJQHWLFOLQHDU
DFWXDWRU
3UREOHP)RUPXODWLRQ

7KHPHFKDQLFDOSODQWLVUHSUHVHQWHGE\D6LQJOH,QSXW
6LQJOH2XWSXW 6,62 V\VWHP ZLWK WKH GHVLJQ SDUDPHWHUV
DV
np

P
dp
ZKHUH np DQG dp DUH WKH QXPHUDWRU DQG GHQRPLQDWRU
SRO\QRPLDOV RI WKH SODQW UHVSHFWLYHO\ 7R LQWHJUDWHG
GHVLJQ WKH PHFKDQLFDO SODQW WKH GHVLJQ SDUDPHWHUV DUH
DIILQHO\ ORFDWHG LQ HLWKHU SODQW QXPHUDWRU SRO\QRPLDOV RU
-9-
7KH LQWHJUDWHG VHUYRPHFKDQLFDO GHVLJQ DSSURDFK LV

SHUIRUPHG RQ WKH REMHFWLYHV WR DFKLHYH GHVLUHG
SHUIRUPDQFH RI WKH FORVHGORRS V\VWHP E\ FDUU\LQJ RXW D
FRQYH[ RSWLPL]DWLRQ SUREOHP WKURXJK /LQHU 0DWUL[
,QHTXDOLW\/0,7KHRSWLPL]DWLRQLVIRUPXODWHGDV

PLQ J stspecifications
O p Ok
ZKHUHLVSHUIRUPDQFHLQGH[DLPLQJWREHRSWLPL]HGDQG
WKHVSHFLILFDWLRQVGHQRWHWKHGHVLUHGSHUIRUPDQFHVSHFLILHG
RQWKHFORVHGORRSV\VWHPYLD/0,FRQVWUDLQWVZKLFKZLOO
EHVWXGLHGLQGHWDLOLQ6HFWLRQ
3HUIRUPDQFH6SHFLILFDWLRQV
$ 6WDELOLW\
)RUFRQWUROV\VWHPVWKHVWDELOLW\LVWKH PRVWLPSRUWDQW
LVVXH WR EH FRQVLGHUHG WKH VWDELOLW\ FRQGLWLRQ RI WKH
FORVHGORRSV\VWHPFDQH[SUHVVHGE\WKHIROORZLQJ

D s
ZKHUHDsLVDFKRVHQVWDEOHFHQWUDOSRO\QRPLDODQG LV
WKHVHWRISRVLWLYHUHDOWUDQVIHUIXQFWLRQ
% 'LVWXUEDQFH5HMHFWLRQ
7R DFKLHYH WKH GHVLUHG GLVWXUEDQFH DWWHQXDWLRQ
FDSDELOLW\ WKH PDJQLWXGH RI FORVHGORRS VHQVLWLYLW\
IXQFWLRQ S VKRXOG EH GHVLJQHG DV VPDOOHU DV SRVVLEOH RU
EHORZ VRPH VSHFLILHG YDOXHV LQ WKHVH IUHTXHQF\ LQWHUYDOV
7KLVFRQGLWLRQLVH[SUHVVHGDV
ICEIC 2015

S
d p O p d k
J dr Z : dr

%RGH'LDJUDP

0DJQLWXGHG%
ZKHUH dr LV VHW RI VSHFLILHG IUHTXHQF\ UDQJHV DQG dr LV
SHUIRUPDQFH LQGH[ TXDQWLI\LQJ WKH GLVWXUEDQFH UHMHFWLRQ
FDSDELOLW\
7KHSURSRVHGGHVLJQ IUDPHZRUN LVXWLOL]HG WR GHVLJQD

IOH[XUHEDVHG HOHFWURPDJQHWLF OLQHDU DFWXDWRU ZKHUH WKH
DFWXDWRU LV GULYHQ E\ FXUUHQW LQSXW DQG WKH FXVWRPL]HG
GHVLJQHG FRPSOLDQW PHFKDQLVP SURYLGHV IULFWLRQOHVV
EDFNODVKOHVV PRWLRQ JXLGDQFH IRU WKH PRYLQJ SDUW RI WKH
DFWXDWRU 7KH KLJK VWLIIQHVV RI IOH[XUH DOVR KHOSV WR
LPSURYH WKH SUHFLVLRQ RI WKH DFWXDWRU LQ KXQGUHG
QDQRPHWHUOHYHOZLWKDVWURNHRIPP
7KH GHVLJQ SDUDPHWHUV LQ SODQW DUH VHOHFWHG DV WKH
GDPSLQJVWLIIQHVVRIWKHDFWXDWRUZKHUHWKHPDVVLVIL[HG
DV NQRZQ FRQGLWLRQ $QG D IL[HG RUGHU FRQWUROOHU LV
HPSOR\HGIRUWKHV\VWHPZKHUHLWVQRPLQDWRUSRO\QRPLDO
DUHFKRVHQDVXQNQRZQSDUDPHWHUVWREHGHVLJQHG
7KHVSHFLILFDWLRQVWRDFKLHYHIRUWKHFORVHGORRSV\VWHP
DUH VSHFLILHG LQ WKH GHVLJQ DOJRULWKP QDPHO\ VWDELOLW\
ILQLWH IUHTXHQF\ GLVWXUEDQFH UHMHFWLRQ DELOLW\ LQ IUHTXHQF\
UDQJH RI +] DQG D UROORII FRQGLWLRQ LQ IUHTXHQF\
DERYH +] %\ IRUPXODWLQJ WKH RSWLPL]DWLRQ DQG
VROYH WKH /0,V ERWK WKH SDUDPHWHUV DUH REWDLQHG
VLPXOWDQHRXVO\7KHSODQWDQGFRQWUROOHUDUHVKRZQLQ)LJ
$Q IOH[XUH PHFKDQLVP LV GHVLJQHG WR LPSOHPHQW WKH
GHVLJQ SODQW DQG )($ VLPXODWLRQ )LJ VKRZV WKDW LW
IXOILOWKHGHVLJQVSHFLILFDWLRQVDVGHVLUHGWKDWLWVVWLIIQHVV
LVFORVHWRRXUUHTXLUHGVWLIIQHVV
3KDVHGHJ

)LJ'HVLJQUHVXOWVRISODQWFRQWUROOHUDQGWKHLURSHQ
ORRSWUDQVIHUIXQFWLRQ
)UHTXHQF\+]
' +LJK)UHTXHQF\5ROORII
7KH FRPSOHPHQWDU\ VHQVLWLYLW\ IXQFWLRQ T VKRXOG EH
GHVLJQHGWRUROORIILQKLJKIUHTXHQF\LQRUGHUWRDYRLGWKH
H[FLWDWLRQ RI XQPRGHOHG KLJK IUHTXHQF\ UHVRQDQW PRGHV
7KLVUROORIIFRQGLWLRQLQKLJKIUHTXHQF\LVH[SUHVVHGE\
T MZ :MZ Z Zh f

3ODQW
&RQWUROOHU
2SHQORRS

ZKHUHbLVWKHVSHFLILHGEDQGZLGWKWREHDFKLHYHG
'HVLJQ([DPSOH

& %DQGZLGWK
7KH EDQGZLGWK VSHFLILFDWLRQ FDQ EH HQVXUHG E\ WKH
IROORZLQJFRQGLWLRQ
d p O p d k
S
G% Z Zb
7R IRUPXODWH WKH RSWLPL]DWLRQ DV D /0, SUREOHP WKH

SRVLWLYH UHDOQHVV FRQGLWLRQ FDQ EH UHH[SUHVVHG XVLQJ
3RVLWLYH 5HDOQHVV /HPPD >@ DQG WKH ILQLWH IUHTXHQF\
ERXQGHGUHDOQHVVFRQGLWLRQDQGFDQEHHQVXUHG
E\*.<3OHPPDV>@%\VROYLQJRSWLPL]DWLRQLQERWK
SDUDPHWHUV LQ WKH SODQW DQG FRQWUROOHU FDQ EH REWDLQHG
ZKLFKIXOILOWKHGHVLJQVSHFLILFDWLRQV

)LJ)($6LPXODWLRQ
&RQFOXVLRQ

,QWKLVSDSHUDQLQWHJUDWHGGHVLJQIUDPHZRUNLVSURSRVHG
WR GHVLJQ PHFKDQLFDO V\VWHP DQG LWV FRQWUROOHU E\
FRQVLGHULQJJLYHQVSHFLILFDWLRQV7KHDOJRULWKPLVXVHGWR
GHVLJQ D IOH[XUHEDVHG HOHFWURPDJQHWLF OLQHDU DFWXDWRU
ZKHUHWKHGDPSLQJDQGVWLIIQHVVLVWKHGHVLJQYDULDEOHV
$FNQRZOHGJPHQW
7KH DXWKRUV DFNQRZOHGJH WKH VXSSRUW IURP WKH
&ROODERUDWLYH 5HVHDUFK 3URMHFW XQGHU WKH 6,07HFK186
-RLQW/DERUDWRU\3UHFLVLRQ0RWLRQ6\VWHPV5HI85
-/ DQG WKLV ZRUN ZDV DOVR VXSSRUWHG E\ 6LQJDSRUH
02($F5)7LHU*UDQW5$
5HIHUHQFHV
>@ < = 7DQ & . 3DQJ ) +RQJ DQG 7 + /HH
,QWHJUDWHG VHUYRPHFKDQLFDO GHVLJQ RI KLJKSHUIRUPDQFH
PHFKDWURQLFV XVLQJ JHQHUDOL]HG .<3 OHPPD
Microsystem Technologies9RO1RVSS
6HSWHPEHU
>@.+LUDPRWR.0*ULJRULDGLV,QWHJUDWHGGHVLJQRI
VWUXFWXUDO DQG FRQWURO V\VWHPV ZLWK D KRPRWRS\ OLNH
LWHUDWLYH PHWKRG International Journal of Control 9RO
1RSS
>@ 7 ,ZDVDNL DQG 6 +DUD *HQHUDOL]HG .<3 /HPPD
8QLILHG )UHTXHQF\ 'RPDLQ ,QHTXDOLWLHV ZLWK 'HVLJQ
$SSOLFDWLRQV IEEE Transactions on Automatic Control
9RO1RSS-DQXDU\
- 10 -
ICEIC 2015

Oral Session
TO-2-2
System and Control
TO-2-2-1
The Synchronization Control Strategy for Hydraulic Press Machines

Seong Jin Cho, Seung Hyun Yun, and Jae Wook Jeon*
The college of Information and Communication Engineering,
Sungkyunkwan University, Suwon, 440746, Korea
*Corresponding author: (Email: jwjeon@yurim.skku.ac.kr)
denoted as A1 and A2 , and the corresponding pressures
Abstract
Many industrial motion systems use electronic
motors. However, for systems that make automobile
frames, roll blending machines and many other
machines that exert large forces cannot use electric
motors because of the relatively small force they
produce. Hydraulic press machines usually require
over 100 axes to produce precisely shaped large size
frames. As such, in this paper we focus on a
synchronization strategy for press machines and
discuss the results.
in the two chambers are P1 and P2 .

x fb
Cld1
A2
A1
P1
u
P2
m
Fl (t )
Amplifier
card
Vlv1
PS
PR
Pump
Tank
Keywords: Hydraulic machine, Synchronization

control, position control
Figure 1: Schematic diagram of electrohydraulic

actuator with load.
1. Introduction
The synchronization performance of multi-axis

press machines is very important. Figure 2 shows the
proposed software structure of the synchronization
hydraulic controller
Hydraulic actuated systems are currently used in a

wide range of industrial applications, and they continue
to be popular and relatively inexpensive power sources.
The press machines used with hydraulic systems make
frames or metal products. In the cases we are interested
in they require a synchronization controller for systems
that have less than 16 axes. In addition, the large sizes
of ship and car frames usually require synchronization
controllers that have over 1000 axes. Thus, systems
that have less than 16 axes use local synchronization
control methods and systems that have over 1000 axes
use the extended synchronization control methods
based on real-time communication. In efforts to control
the synchronization of hydraulic machines Huayong et
al. [1] applied their method to a tunneling machine, Li
et al. [2] applied their method to hydraulic elevators. In
this paper, we focused on the synchronization strategy
of the press machines by considering hydraulic
characterization [3, 4].
Figure 2: Block diagram of synchronization control

Each axis includes a position controller. This
controllers block diagram is shown in Figure 3. One
axis becomes the master axis and others become the
slave axes that follow the master axis. To reduce
synchronization errors, PI is set as the controller. The P
controller is described as follows:
2. Synchronization control strategy

Figure 1 shows an electrohydraulic actuator. There
is a main cylinder Cld1 and a load ( m ). The effective
Psync =
U sync Volt
x Unit
(1)
where x is multiplied by the gain Psync and added to

the output value of the relevant axis as the output value
area of the two sides of the piston of cylinder Cld1 are
- 12 -
ICEIC 2015
part Usync. The gain Psync of the synchronization
controller is thus the ratio of Usync to the
synchronization error.
Figure 5: Electrohydraulic simulator and

controller board in operation
Figure 3: Position control block diagram of each
axis
The difference between the actual position values of
the master and slave axes, taking into account the offset
value, is the monitoring criterion:
(2)
=
x X Master (t ) X Slave (t ) Offset
where xMaster represents the actual position value
of the master axis, and xSlave is the actual position
value of the slave axis. Figure 4 depicts the
synchronization flow chart between each axis.
Figure 6: The graphical result of actual data.
4. Conclusions
We proposed a synchronization control method for a
hydraulic press machine. To precisely control the
machine we used a position and pressure controller
with an adjustment algorithm and fine positioning
block, due to the characterization of the press machine.
Acknowledgement
This work was supported by Industrial Technology
Innovation Program(Advance Technology Center
Program) funded by the Ministry of Trade, Industry
and Energy (MOTIE, Korea) (No. 10048277)
References
[1] Huayong, Y. Hu, S. Guofang, G. and Guoliang, H.,
Electro-hydraulic proportional control of thrust system for
shield tunneling machine, Automation in Construction, Vol.
18, pp. 950 - 956, 2009
[2] Li, K., M.A. Mannan, M. Xu, and Z. Xiao, Electrohydraulic proportional control of twin-cylinder hydraulic
elevators, Control Engineering Practice, 2001, 9, 367 - 373
[3] Ferreira J. A., P. Sun and J.J. Gracio, Design and control
of a hydraulic press, Computer Aided Control System
Design, 4-6 Oct. 2006 pp. 814-819
[4] H.M. Chen, J.C. Renn, and J.P. Su, Sliding mode
control with varying boundary layers for an electro-hydraulic
position servo system, The International Journal of
Advanced Manufacturing Technology, Springer-Verlag,
2005, 26, 117-123
Figure 4: The synchronization controller algorithm
3. Experimental Results
We considered the overall the experimental system
shown in Figure 5. We used a PC only for acquiring
experimental data sent from the controller board via
RS232 communication. Figure 6 shows the result of the
synchronization performance using the monitor
program. It shows that the position control error is
1mm, and the synchronization error is only 400um.
- 13 -
TO-2-2-2

!

$"# % !
"'& * '()) % "
+ , ,% +
* '"& -
+. , ! $"# "'& ,
/ '"& " '"& %
* 0 %.
1 % ,
"'& $2'# * 3/34 5. $6'#
* 87!85. 295 ** * *
10 ,
4- *+% * !4(:;
77< % 6( * *
7!08*=>

" $#!"#%$$ &&

%) ''('
!
%#&

! &%
%
)) %
)!

)&*(+,

!-'/.)
+
&0- ''(.&))*

& "#% $ $
''(
-)%) ''(.1"2*3"
&

! * $ ) ''(
)
*$)'/)%

'(&)*#(
- 14 -
! ) ) )

* (
)
$ !)
) ! )

'/
''( * ( )

&&&

5142
))*$))
)
5
1#2))*
+#

3 #
&
%0 ) ) "#%
$$ *
)$
)%0*

'(&+
*#(

3 4
&
) $ &

) )
5 1#2* )
) %

$ )
%

* $ *
) ) $
) /6 )
$
) / /6* $

7 !
))%

)!
$
) $ * (

5 % )

%
)
! )
) % ) $ &

'/*
))
)
5 &
&

5142))
&
3 8* ) &
%& /( ) /7
1#2182

5&
%&/()/
) )
%

* (
% % ))
5 &

&
5* (

&
)
!
&
3 8* (

5 ) &

)
! $ $ 1#2182*
ICEIC 2015
9

5 & "#% $
$ &
":%$ *$)
$ !
;%
)8%%*
! 4*4/* (

3 4#*;?DC!

*(
,)(%*

'(&3
+ &0$+#1

&
'(&,(
-
&
(
"#%$$ &)) ''(

! * (
) $ & ))
&

)$ &
!

*7%
& &

5 )
)
5 & "#% $
$ &
":%$ ))&
*

'(&-$(.&,
*$#(
,& &#/ &

(
33( &

"8*4<,
"*#= <,
& 3* =*
(
) $
!
6 >:*>=)7

3?4*#?)7)
6@7""*8;%*
(

& ) %
)

)! -"::8A::A. ) %
() ) ) ) %

'- ( E 3 '.
)
( - (

.
-6'$#:"8<:4:""8"::?.!)%

6'$-6()'$.*

'(&''&&0-243+1
(

& ) &
:*4= 7 @

* (

& 3* ;
;::BA4=*= &
)* (
&
""=9
5 "*#= <, )

- 15 -
1"2* *
**
**D*F**<*
G$
) ''('
!H@
6!%*#:"4
1#27
IFIFD*I6J
I<D
F*G$$$ &

))!$ H * $#::A*A>#A>=
142*$6G$&35
)&
(
5$$ H
)K+7!;"=*#A8#A?
#:"8
1827*'*M%)$*'*
)0L$

$
$ !9
!
$ L'*** )#::=!*"
*"?8"?>*
TO-2-2-3
Wearable Controller using Electro Myography with

Biofeedback
Rishabh Berlia1, Shubham Kandoi2, Sarthak Dubey3, Theja Ram Pingali 4
1,2,3,4 th
7 Semester, Instrumentation Technology Department,

R.V. College of Engineering,
Bangalore, India
1
rberlia@gmail.com
kandoi.shubham@gmail.com
3
sarthak93.22@gmail.com
4
pingali.t@gmail.com
In the recent past, the old are often subjected to being

alone, helpless and dependant. In case of an emergency
where an old person experiences uneasyness or unknown
pain they being less tech-savy restricts them to use
smartphones to call. Or in cases where a natural/man-made
disaster requires a robot to either investigate or control
certain parameters, their activity is often restricted to a set
axis of movement and their inablity to adopt to the dynamic
situation. In either cases our paper aims at helping them to
make emergency calls by just using certain hand gestures or
help professionals use the device to mimic their actions
onto the robot.
In the past studies, there have been techniques such as
image procession and speech recognition in order to carry
out a similar activity. These techniques have a certain
drawback ex: in image, processing the resolution of the
camera and its field of view play an important role in
deciphering the gesture. Audio processing usually involves
a complex signal conditioning circuits in order to eliminate
the ambient noise.
Our design aims at reducing these drawbacks as it uses
muscle signals and since the sensor/transducer is present
very close to the signal source, it is easy to reduce noise and
improve the flexibility of the device. This also reduces the
cost and size of the device.
Several designs have been developed but they use an
expensive and complicated modules that lack the intelligene
and awareness of the required environment. This paper
proposes a modular wrist band that can be easily worn
around the organ eminating the gesture. A set of sensors
around the band acquire the signal and process it using the
on-board signal conditioning module and micro-controller.
Abstract - Electromyography (EMG) is a technique for

evaluating and recording the electrical activity produced by
skeletal
muscles. An
Electromyograph
signal
potential
generated by muscle cells when these cells are electrically or

neurologically activated. These signals can be analyzed to
detect the biomechanics of human or animal movement.
Measured EMG potentials range in microvolts, depending on
the muscle under observation.
Through this paper we have aimed at developing a
controller that uses muscle action to control the devices or
gadgets that can help ease work of people (mostly aged adults)
as well as provide feedback to the muscles for improving
health and performance. As a proof of concept we are working
at deveoping a device that can run a robot. A specific
movement of the arms can lead to varied voltage levels that
can correspond to specific activities, which forms the basis of
this project. The signals generated from the muscle are signal
conditioned, filtered and sent to a micro-controller which
compares it to an algorithm stored on-board. It is then
wirelessly transmitted to the required device. This conditioned
signal is further used as biofeedback.
Keywords: Electromyography, Controller, Feedback
I. INTRODUCTION
EMG or electromyography is a technique of obtaining
signals from muscles by recording the electric potential
generated due to the elctrical ot neurological excietation of
the muscle cells. Being the easiest bio-medical signal that
can be obtained along with ECG signals, it reduces the
complexity of the signal conditioning module inturn
reducing the size and cost of our device.
- 16 -
ICEIC 2015
A wireless module can then transmit the signals to the
required device.
The unified conditioned signal is then sent to the cloud
where it is stored at frequent invervals of time and a user
report is generated. A predefined algorithm compares the
data with the standards and any anomalies, immidiately
sens out a warning signal to a local doctor registered with
the user who is informed of the sitution. It also generates a
forum for doctors across the globe to provide feedback and
alternative medical suggestions about the persons
treatment for physiological parameters such as muscle tone
(or resistance).
This project can be expanded to carry out basic tasks
such as switching on TV, finding objects without being
dependant on others for help and help professionals monitor
their health. It can also be used as a device that can act as a
single unique medium for all their identity cards, driving
licence and as a tracking device to improve safety of
women.
III. DESIGN AND IMPLEMENTATION

This paper presents a BAND that collects the EMG signal
corresponding to the gestures and converts it to a specific
activity.
The system architecture has four major parts:
(2.1) Signal acquisition
(2.2) Conditioning
(2.3) Microcontroller
(2.4) Wireless module
(2.5) Response device
Fig. 1 shows the proposed system architecture, and
these major parts are illustrated as follows.
EMG
SOURCE
SENSOR/
TRANSDUCE
MICROCONTROLLE
WIRELESS
MODULE
II. LITERATURE REVIEW

Alijanpour, N et. Al. [1] suggests hand gesture
recognition for device control using inner distance feature.
That method consists of three phases - Hand segmentation
and state identification, Hand tracking, and gesture
recognition. In tracking phase new method based on hand
center of gravity tracking is presented and in recognition
phase, correlation coefficient for state matching is used.
Jung Soo Kim et. Al. [5] suggests a user interface
that resolves the complications of using numerous remote
controls for domestic appliances. Based on one unified set
of hand gestures, this system interprets the user hand
gestures into pre-defined commands to control one or many
devices simultaneously. It uses a webcam, which captures
the gesture, and then the signal is processed to provide the
required control signal. The system has been tested and
verified under both incandescent and fluorescent lighting
conditions.
Posada-Gomez, R. et. Al. [2] proposed the
development of a wheelchair controlled by an intuitive
interface, where the instructions are given by hand gesture
instructions. The advances are presented in the realization
of the control software using a Webcam and some distances
and presence sensors controlled by a PIC microcontroller
that establishes the communication with a program
developed in LabVIEW.
Drawbacks of such systems is the use of webcams
where lack of high resolution cameras can lead to failure of
systems to detect gestures in varying lighting conditions.
Also as the resolution increases the cost and complexity of
the device increases.
SIGNAL
CONDITIONI
RESPONSE
DEVICE
Fig. 1: System Architecture
2.1 Signal Source

The EMG is generated when a motor neuron
action potential from the spinal cord arrives at a motor end
plate. Its arrival causes a release of ACh (Acetylcholine) at
the synaptic cleft, which causes a depolarization (Action
Potential). This action potential electrically travels
downward from the surface in a transverse tubule. This in
turn causes a release of Ca++, causing cross-bridge binding
and the sarcomere of the muscle to contract.
Fig. 2: Generation of EMG
- 17 -
ICEIC 2015
Fig. 3: Signal acqusition
An electromyography (EMG) is a measurement of

the electrical activity in muscles as a by-product of
contraction. An EMG is the summation of action potentials
from the muscle fibers under the electrodes placed on the
skin. The more number of muscles that fire, the greater the
amount of action potentials are recorded and the greater is
the EMG reading.
2.2 Signal Acquisition
2.2.1 EMG signal decomposition
EMG signals are essentially made up of
superimposed motor unit action potentials (MUAPs) from
several motor units. For a thorough analysis, the measured
EMG signals can be decomposed into their constituent
MUAPs. MUAPs from different motor units tend to have
different characteristic shapes, while MUAPs recorded by
the same electrode from the same motor unit are typically
similar. Notably MUAP size and shape depend on where
the electrode is located with respect to the fibers and so can
appear to be different if the electrode moves position. EMG
decomposition is non-trivial, although many methods have
been proposed.
Fig. 4: sample signal
2.3 Signal Conditioning

The raw EMG signal is processed by generating an
EMG linear envelope. This in turn is a combination of a
full-wave rectifier (taking the absolute value) and a lowpass filter. This gives a useful result for analysis.
This stage is split into 3 sub-stages:
1. Amplification
2. Rectification
3. Smoothing + amplification
2.2.2 Surface electrode

A small device is attached to the skin that
measures electrical activity in the tissue under it. Surface
electrodes may be used to look for problems with muscles
and nerves.
2.3.1 Amplification
In this phase, were aim at taking the minute micro
level signals measured in the SIGNAL ACQUISITION
phase and amplify them. An inverting amplifier does
exactly what we desire. It amplifies the signal and also
inverts it. We first build an inverting amplifier with a gain
of -15.
We then add a capacitor to AC couple the signal. AC
coupling is useful in removing DC error offset in a signal
we are going to add an active high pass filter to get rid of
any DC offset and low frequency noise.
2.2.3 EMG Recording

The EMG is recorded by using an electrode placed
on the muscle. The electrical activity measured by each
muscle electrode and the ground electrodes are sent to an
amplifier. The amplifier eliminates random voltages caused
by electrical noise by subtracting the signal from the ground
electrode from the muscle electrode, producing the raw
EMG.
2.3.2 Rectification
In this phase, we will be rectifying the signal using an
active full-wave rectifier. The rectifier will take the
negative portion of our signal and turn it positive so the
entire signal falls within the positive voltage region. This
coupled with a low pass filter turns our AC signal into a DC
voltage; ready to send the signal to a microcontroller.
2.3.3 Smoothening and Amplification
In this last phase of circuit assembly, we will be using a
n active low-pass filter to filter out the humps of our signal
to produce a smooth signal for our microcontroller.Thats th
e end of the filter circuit.
However, since this is an active filter, there is a side effe
- 18 -
ICEIC 2015
ct of inverting the signal. We will need to invert the signal o
ne more time (and have the ability to amplify it more if desi
red) using another inverting amplifier circuit with a trimmer
configured as a variable resistor.
FIRST STAGE CONDITIONED SIGNAL

SIGNAL RANGE mv
PERSON
ACTION
P1
LEFT
(-2.0) (-2.6)
RIGHT
P2
2.4 Microcontroller
Microcontroller used is open source Arduino hard
ware. It takes in inputs from the sensors and develops a logi
c corresponding to the algorithm written onto it. Here, EM
G electrodes act as inputs to the micro-controller and it pro
vides an input signal to the wireless module based on the ac
tion developed by the algorithm.
LEFT
RIGHT
(+1.5) (+2.0)
(-1.3) (-2.0)
(+1.1) (+1.7)
Table 1: First stage signal conditioning output
V. FUTURE SCOPE
We propose to complete the development of the de
vice and make it small scaled and an aesthetically pleasing
device. Also we aim at extending the device functionality a
s an universal controller. Using the electrical activity in you
r muscles to wirelessly control your computer, phone, and o
ther favourite digital technologies. We wish to transform ho
w you interact with your digital world. Just with a wave o
f your hand.
VI. CONCLUSION
This paper presents a method of pre-fixed motion
based EMG control using a surface electrode. User
commands for the device control is obtained from the
different actions or gestures of the hand. The extracted
commands are processed through the intelligence algorithm
that also takes into account ambient errors and interrupts to
generate improved error free motion control. This device is
designed to be an intuitive and cost effective control
method.
Fig. 5: Prototype Circuitary
2.5 Wireless module and Response device

A zigbee module is integrated into the device for
transmitting the signal that correspond to a specific set of
activities to the response device. The response device may
be any kind of device ranging from a simple switch to a
complex system.
Also, the wireless module sends the signal information
to the cloud through which the signal is frequently stored
and analysed. It also compares it to a certified standard and
a user report is generated. Any abnormalities in the
readings of the vitals causes the device to send out a signal
to the registered doctor who then decides on the users
treatment, also the report is shared on a forum where
doctors from across the globe can analyse the condition and
suggest further actions.
Here the prototype is developed using a robot that
follows the orders sent by the user due to various actions of
the muscle system and the information is shared on the
cloud through the app created by us!
VII. REFERENCES
Inner distance based hand gesture recognition for
devices control - Alijanpour, N. ; Tabriz ;
Ebrahimnezhad, H. ; Ebrahimi, A.; Electrical
Engineering Department Sahand University of
Technology.
[2] A Hands Gesture System Of Control For An Intelligent
Wheelchair - Posada-Gomez, R. ; Inst. Tecnologico de
Orizaba, Veracruz ; Sanchez-Medel, L.H. ; Hernandez,
G.A. ; Martinez-Sibaja, A.
[3] A real-time system for hand gesture controlled
operation of in-car devices - Zobl, M. ; Instrumentation
for Human-Machine Communication department,
Munich Universiy of Technology, Munchen, Germany.
[4] Consumer electronics control system based on hand
gesture moment invariants Prashan Premaratne
University of Wollongong, prashan@uow.edu.au, Q.
Nguyen Australian National University.
[5] The Gesture Watch: An alternate gesture based
interface for remote control of devices- Gaurav Gupta
; Jung Soo Kim ; Georgia inst of Tech, Atlanta, USA.
[1]
IV. EXPERIMENTAL TEST RESULTS

On implementing the design and testing it for vari
ous gestures, we were successful in achieveing a distinguish
ed level of signals. As seen from the below table, it can be
implied that a simple left and right gesture have a signal dif
ference from negative to positive voltages which can help ta
ke different actions.
- 19 -
TO-2-2-4
A Mobility-Aware Heading Reference Selection (MAHRS) for Computing

Vehicle Heading in the Android-Platform Smartphone
Aditya Bhawiyuga1, Rachmad Nafisholeh2, and Han-You Jeong2
1
Program of Information Technology and Computer Science, Brawijaya University, Malang, Indonesia
Networked Smart Systems Laboratory, Department of Electrical Engineering, Pusan National University, Busan, Republic of Korea
adhitya.bhawiyuga@googlemail.com, rachmadnafisholeh@gmail.com, hyjeong@pusan.ac.kr
angle of a magnet interacting with the earths magnetic

field. However, the estimated heading strongly depends
on the orientation of the smartphone mounted on the
vehicle, which may result in a high bias in its
measurement. On the other hand, the GPS and the
gyroscope is not affected by the orientation of the
smartphone. Consequently, we focus on these two
sensors as a reference of vehicle heading.
In this paper, we present the mobility-aware heading
reference selection (MAHRS) scheme to select a highly
accurate heading reference between the GPS and the
gyroscope in the android-platform smartphone. The rest
of this paper is organized as follows: In section 2, we
address the basic characteristics of the GPS and the
gyroscope. We present the details of the MAHRS
scheme in section 3. Finally, the numerical results are
presented and discussed in section 4.
Abstract
A vehicle heading is an important component of
vehicle states which must be periodically broadcast to
neighbor vehicles. While GPS heading suffers from high
fluctuation at low vehicle speeds, gyroscope heading
drifts from its true value due to the accumulated errors.
To obtain a precise vehicle heading, we attempt to
present a mobility-aware heading reference selection
(MAHRS) scheme that selects either GPS or gyroscope
in the android-platform smartphone. The MAHRS
scheme detects the fluctuation of the GPS sensor, and
then switches its heading reference to the gyroscope
sensor until the GPS heading is stabilized again. The
numerical results obtained from the real experiments
show an improved heading accuracy.
Keywords: Heading, vehicle mobility, GPS,
gyroscope, smartphone.
2. Characteristics of GPS and Gyroscope

The GPS sensor is designed to estimates its position
on the surface of the earth using the multi-lateration of
the catched satellite signals. It can also estimate the
indirect vehicle states, such as speed and heading, by
incorporating the most recent vehicle position estimates.
However, at low vehicle speeds, the GPS heading
suffers from high fluctuation due to the GPS position
errors. When the vehicle fully stops, the GPS heading
becomes purely random. For example, in our
experiments, there is a measurement where the angular
speed of GPS heading exceeds 90 degree/sec when the
vehicle is fully stopped at the intersection.
The gyroscope sensor is widely used in the inertial
navigation systems in order to estimate the angular
speed of vehicle when the GPS is not available. If the
gyroscope collects k samples per second, the vehicle
heading () at time n (sec) can be estimated by
1. Introduction
In recent years, the need for driver assistance systems
has been increasing due to the road accident as well as
the traffic congestion [1]. In the meantime, smartphone
has penetrated to almost all individuals, including
vehicle drivers, thanks to its versatilities. As a result,
there is an increasing effort to utilize the smartphone as
a key device 1) to obtain the vehicle state information,
2) to communicate with the on-board unit of a vehicle,
and 3) to provide multi-media interface to the driver [2].
In this paper, we focus on the generation of the vehicle
state information using the smartphone sensors.
In WAVE/DSRC standards, each vehicle must
periodically broadcast its state information including
latitude, longitude, altitude, speed, and heading [1]. One
promising solution to estimate the state information is to
exploit smartphones multi-sensors, such as GPS,
accelerometer, gyroscope, magnetic, etc. The main
interest of this paper is how to collect a vehicle heading
from these smartphone sensors.
We consider three sources of vehicle heading
information: a magnetic compass, a GPS and a
gyroscope. The magnetic compass measures the relative
( 1) +
,
() = {
=1
(),
0
= 0
(1)
where is the i-th angular speed sampled at gyroscope.

In (1), the gyroscope heading error may accumulate, if
it is not calibrated by the external GPS heading ()
- 20 -
ICEIC 2015
results in good approximation with the vehicles true

heading.
over long time ( ). This accumulation may lead to

a significant deviation from the true heading value.
In this paper, we focus on the fusion approach taking
into account the characteristics of both sensors, which
will be addressed in the next section.
3.
Mobility-Aware Heading Reference

Selection (MAHRS) Scheme
The basic idea of the MAHRS scheme is 1) to use

the GPS as the heading reference while it is stable, and
2) to use the gyroscope heading until the GPS becomes
stabilized again. Then, the key problems of the MAHRS
scheme are 1) how to detect the fluctuation of the GPS
heading, and 2) how to detect the stabilization of the
GPS heading.
To resolve the first key problem, the MAHRS
scheme must distinguish the heading change of the
normal driving maneuver from the fluctuation of GPS
heading. The work in [3] reported the statistical
measurement results that the mobility of a vehicle on a
road strongly depends on its curvature 1/ . The
MAHRS scheme decides the GPS heading fluctuation if
the current vehicle speed exceeds the upper bound of
vehicle speed for the given road curvature, i.e.,
20.15
126.25
1/ 0.038
= {
(2)
20.15
138.24
1/ > 0.038
To resolve the second key problem, the MAHRS
scheme must check the following two conditions to set
the GPS as the heading reference: 1) The vehicle speed
must enter the valid region of driving maneuver, i.e.
, and 2) the difference of two heading
converges to a fixed threshold , i.e.,
| () ()|
(3)
Finally, the MAHRS scheme should also determine
the period of gyroscope heading update using stable
GPS heading in (1). Once the GPS heading is not stable,
the MAHRS scheme consecutively checks it until it
becomes stabilized again.
Fig. 1: Experimental results
Fig. 1 (d) plots the heading estimates of three

schemes against the time indexes on the rural route
shown in Fig. 1 (b). We observe that all three heading
estimates approximates well with the vehicles true
heading. We also see that the MAHRS scheme shows
the best performance among the three schemes.
To summarize, the MAHRS scheme achieves a
highly accurate vehicle heading while it is also robust to
the perturbation of the sensing values regardless of the
vehicles states.
Acknowledgement
This research was supported by Global Frontier Program
through the National Research Foundation of Korea(NRF)
funded by the Ministry of Science, ICT & Future Plannig
(2011-0031863).
4. Numerical Results and Discussions

To validate the performance of the MAHRS scheme,
we ran our vehicle on the urban route in the Busan and
on the rural route around the Kyongju, while the vehicle
states are gathered by the smartphone sensors. With the
parameters = 120 sec and = 5 deg, we compare
the MAHRS scheme with other two schemes: GPS-only
scheme and gyroscope-only scheme.
Fig. 1 (c) shows the heading estimates of three
schems against the time indexes on the urban route
shown in Fig. 1. (a). We can observe that there is a high
fluctuation in the GPS-only scheme (blue plus marks)
while the MAHRS and the gyroscope-only scheme
References
[1] Rola Naja et al., Wireless vehicular networks for car
collision avoidance, Springer, 2013.
[2] T. A. Suramardhana and H.-Y. Jeong, A driver-centric
green light optimal speed advisory (DC-GLOSA) for
improving road traffic congestion at urban intersection,
APWiMob14, Bali, Indonesia, Aug. 2014.
[3] S. Cafiso, and G. Cerni, New approach to defining
continuous speed profile models for two-lane rural roads, J.
of Transport. Res. Board, vol. 2309, pp. 157-167, Jan. 2013.
- 21 -
TO-2-2-5
Synchronization of a Certain Family of Automata

Yong He, Zhenhe Cui, Fenfang Xiao
School of Computer Science and Engineering, Hunan University of Science and Technology,
Xiangtan, Hunan, 411201, China
ynghe@263.net, 492708778@qq.com, 2857727938@qq.com
Abstract
Let n be an integer greater than 1. After
introducing the automaton Cn,i for each integer i n ,
the synchronizing ones in the family {Cn,i |0 i n }
of automata as well as their shortest synchronizing
words are determined. Moreover, in aids of the so
called transition consumption functions of automata
and the weighted average consumptions of words, the
advantages of such synchronizing automata in some
typical applications are analyzed.
Keywords: Synchronizing automaton, the automaton
Cn,i, the shortest synchronizing word, transition consumption function, weighted average consumption.
1. Introduction
Recall that an automaton is a triple A=(Q,A,)
consisting of a finite set Q of states, a non-empty finite
set A of inputs, and a state transition function from A
to the transformation monoid T(Q) of Q. Observe that
can be uniquely extended to a homomorphism of
monoids from the free monoid A* on the alphabet A to
T(Q). It is convenient to identify each word w A* to
its image under , and write the action of w on a state
q Q as qw. The automaton A is said to be circular if
some input in A is a circular permutation on Q. For
other terminologies and notations without explanation,
the reader is referred to Howie [5].
An automaton (Q,A,) is called synchronizing if it
has a synchronizing word, i.e., a word w A* such
that |Qw|=1. The consideration on synchronizing
automata was initiated by ern [1] who constructed
an n-state automaton Cn for each integer n 1 and
proved that Cn has a shortest synchronizing word
which is of length (n-1)2. Natarajan [7] re-invented
synchronizing automata and found their applications
on robotics. Eppstein [4] re-defined the synchronizing
- 22 -
automaton Cn and provided an algorithm consuming

O(|Q|3+|Q|2 |A|) time to test the synchronization of an
automaton (Q,A,) and, when it is synchronizing, find
a synchronizing word of such an automaton. At
present, synchronizing automata are frequently
applied in model-based testing of reactive systems,
part handling problems in industrial automation, and
even in DNA computing. Volkov [9] presented a
wonderful survey on the researches and applications of
synchronizing automata.
Most theoretical researches on synchronizing
automata are focused on the shortest synchronizing
words, especially on the following conjecture raised by
ern in 1970: the length of the shortest
synchronizing words of an n-state synchronizing
automaton is at most (n-1)2. Such a conjecture
currently known as ern Conjecture is still open
except for several special classes of automata such as
circular automata [2, 3] and one-cluster automata with
prime length cycle [8]. The shortest synchronizing
words of synchronizing automata are also of practical
significance since they usually mean shorter inputorders and less operations. In general, it is a difficult
work to find the shortest synchronizing words of a
synchronizing automaton --- Martyugin [6] proved
that this work is NP-hard even for synchronizing
circular automata. Accordingly, it is meaningful for
applications to build, for each integer n greater than 1,
a non-empty family of n-state synchronizing automata
of which the shortest synchronizing words are
determined. In Section 2, this work is made a progress
with a family Cn of n-state synchronizing automata
introduced.
Sometimes, according to the requirements of
practical
applications,
the performances of
synchronizing automata such as consumption and
efficiency are needed to be considered. In Section 3, a
model for describing the performances of
synchronizing automata is advised. Moreover, by
ICEIC 2015
using such a model, the advantages of the members in

the family Cn are analyzed.
2. A family of synchronizing automata

In what follows, n is always an integer greater than
1. The set of non-negative integers less than n is
denoted by Zn, while denote the set of the integers in
Zn coprime to n is denoted by Z n . That is to say,
Z n {0,1, , n 1} ,
Z n {k Z n | (k , n) 1} .
system (modulo n) if
k k Z n
mk ikZ
0a bi a
an integer. Then {h mk }kZ n is a residue system if

and only if so does {mk }k Z n .
an integer. Then {hmk }k Z n is a residue system if and

only if h Z n and {mk }k Z n is a residue system .
k if k n 1,
ka
0 if k n 1.
For each i Zn , build an automaton Cn,i =(Zn,{a,b},)

as below: for any k Z n ,
k if k i,
ka
0 if k i.
n 2
a a bi a
n 2
n 2
0 ia bi a
mi ab mib
i
The synchronization of Cn,i is described as follows.

Theorem 3. The automaton Cn,i is synchronizing if
and only if i Z n . Moreover, if this is the case, the
- 23 -
(2)
n2
1 i wi . (3)
(m 1)i .
Together with Equality (2) and the evident equality
wi abi
n m
a bi a
m2
this implies that
m i w
mi abi
n m
a bi a
m2
0a b i a
m2
0 . (4)
As a consequece of Equalities (1), (3) and (4), one has

Z n wi {mk i}k Z n wi 0 .
Therefore Cn,i is indeed a synchronizing automaton

with wi as a synchronizing word.
Step 2: to show that i Z n if Cn,i is synchronizing.
Let Cn,i be a synchronizing automaton of which u is an
arbitrary shortest synchronizing word. It is clear that
u a* b* , and thus u is of the form
t
It is evident that Cn,i is circular and Cn=Cn,n-1. For the

sake of convenience, let
m and m 1 are distinct to 1, so that both of mi and

( m 1)i are distinct to i, and hence
Recall that the automaton Cn advised in [1, 4] is the

triple (Zn,{a,b},) of which the state transition
function is defined by, for any k Z n ,
0 ia b i a
For any m Z n with m 2 , it is certain that both of
Lemma 2. Let {mk }k Z n be a set of integers and h
wi ab i
(1)
Lemma 1. Let {mk }k Z n be a set of integers and h
kb k 1 ,
Zn .
This leads to the equality
0 iw 0ab a
Zn .
The elementary properties of the residue systems given

in the following Lemma 1 and Lemma 2 are wellknown:
kb k 1 ,
It is easy to see that, for any non-negative integer k,
Then the residue m of an integer m modulo n lies in

Zn. A set {mk }k Z n of integers is known as a residue
word wi is the unique shortest synchronizing word of

the synchronizing automaton Cn,i .
Proof. Suppose that n 3 since the case of n=2 is
trivial. The required result deponds on the following
three steps.
Step 1: to show that Cn,i is synchronizing if i Z n .
Assume that i Z n . Then, by Lemma 2,
2 g ,
u b t1 a s1 b t 2 a s2 b g a
sg
0 t1 , s g , 1 s1 , t 2 , s 2 , , s g 1 , t g .
Moreover, since mak=ma and mbk mb k for any

integer k 1 and m Z n , u is of the form
2 g ,
u bt1 ab t 2 a b
t g 1
ab g a
sg
0 t1 , 0 s g 1, 1 t 2 , t3 , , t g n 1 .
ICEIC 2015
Since b is a permutation on Z n , if t1 0 , then

Z n abt 2 a b
Z nb
t1
ab
t2
t g 1
ab g a
a b
t g 1
This implies by induction that

g
sg
0 mu m
tg
ab a
m
t
Z n b t1 abt 2 a b
t g 1
Z nb t1 abt 2 a b
t g 1
ab
tg
Z nu
1,
t
so that b t1 abt 2 a b g 1 a is a synchronizing word of

Cn,i shorter than u. Therefore t1=0 and s g 0 , and
hence u has to be of the form
u b t1 abt 2 a b
t g 1
ab g a
Consequently, by Lemma 1 and Lemma 2, {d m i}mZ n

is a residue system and then i Z n as required.
Step 3: to show that wi is the unique shortest
synchronizing word of Cn,i when Cn,i is synchronizing.
Let Cn,i be a synchronizing automaton. Then it follows
from the above discussions i Z n and hence wi is a
synchronizing word of Cn,i. Furthermore, an arbitrary
shortest synchronizing word u of Cn,i has to be of the
form (5) and, for the non-negative integers dms
(m Zn) defined in (6), the set {d m i}mZ n of integers is
a residue system. Let
d max{d m }mZ n .
0 t1 , 1 t2 , t3 , , t g n 1 .
(5)
t2
Then it is certain that d g . Moreover, by Lemma 2,

{d m }mZ n is also a residue system, so that n 1 d .
Thus
1 if k 0 and mb ab a b i,
km
0 otherwise,
t1
n 1 d g .
tk
exist exactly d integers g1 , g 2 , , g d with

0 g1 g 2 g d g
m
k
(7)
Suppose that m0 Z n such that d m0 d . Then there
and define a non-negative integer d m as below:

dm
d mi .
k 1
sg
For any m Z n and non-negative integer k g , let
(6)
such that
k 0
{g1 , g 2 , , g d } {k | km 0 i, 1 k g} .
Furthermore, let
if k 0,
m
q km t1 t2
tk
mb ab ab a if k 0.
Then, for each r 1,2, , d 1 ,

i m0bt1 abt 2 a b
It is easy to see that, for any k g ,

mb ab a b ab
t1
t2
mb ab
mb ab
t k 1
t1
t2
a b ab
t1
t2
a b a t k 1
t k 1
km1i
t k 1
t gr
m0b t1 abt 2 a b
iab
mbt1 ab t 2 a b t abt k 1 a
so that abt 2 a b g 1 ab g a g is a synchronizing word of

Cn,i shorter than u; if s g 0 , then
qkm
d mi ,
1,
qkm1
so that
Z nu
2 g ,
t
k 1
sg
0b
m
k 1i
t gr 1
t g r 1
ab
t
t gr 2
ab g r 1 ab g r 2 a b
t gr
ab
ab
ab g r 2 a b
t gr 1
t gr 1
t g r 1
t g r 1 t g r 2 t g r 1 .
km1i
This yields that
- 24 -
ab
t gr 2
t gr 1
a b
t gr 1
ICEIC 2015
g r 1
s
s g r 1
3. Analysis of advantages in applications
t g r 1 t g r 2 t g r 1 i ,
Let A=(Q,A,) be a non-empty automaton. The

real-valued functions on the set QA are called the
transition consumption functions of A. Let
so that
g
|u | g
: (q, x) xq
k 1
g t1
g d 1
g r 1
s
r 1 s g r 1
(8)
g t1 ( d 1)i .
Since wi is a synchronizing word of Cn,i and u is a

shortest synchronizing word of Cn,i, it is certain that
| u | | wi | .
(9)
Observe that t1 0 and
be a transition consumption function of A. The consumption of acting a word w on a state q with respect
to is inductively defined by
if w is the empty word,

0
wq q
qu
*
u x if w ux for some u A and x A.
Suppose that w x1 x2 x|w| where x1 , x2 , x| w| A ,
and suppose that the path from q with label w is
x
| wi | (i 1)(n 2) 1 ( n 1) [(n 1) 1]i .
Then
It follows from Inequalities (7) and (8) that Inequality

(9) holds precisely when
g1 1,
g n 1 d ,
g 1 g
(r 1,2, , d 1) ,
r 1
r
g r 1
ts i
(r 1,2, , d 1) .
s g r 1
wq
m 1
k 0
qk
x k 1
The average consumption of a word w with respect to

is defined by
or equivalently u=wi . That is to say, an arbitrary

shortest synchronizing word u of Cn,i has to coinside
with wi , and thus wi is necessarily the unique shortest
synchronizing word of Cn,i . This completes the proof.
Cn Cn,i | i Z n ,
1
wq ,
| Q | qQ
If the set Q of state of A is endowed with a probability

distribution function : q q , then the weighted
average consumption of a word w A* with respect to
a transition consumption function is defined by
Remark 4. Denote the set of all synchronizing

ones in the automata Cn,i 's (i Zn) by Cn . Then it
follows from Theorem 3 that
|w|
1
2
q q0
q1
q m 1
q| w| qw ,
wq .
qQ
Clearly, w w when A is uniformly distributed.
which is a non-empty family of n-state synchronizing

automata. Moreover, it is explored by Theorem 3 that
Cn equips with the following properties which may be
meaningful in applications:
(i) For each i Zn, in the aids of Euclid's GCD
algorithm, it is easy to check that wether Cn,i Cn .
(ii) The cardinality of the set Cn is exactly the Euler
function of n. Moreover, Cn contains at least two
members Cn,1 and Cn,n-1 when n 2 .
(iii) The word w1 is the shortest one in all words
that is a synchronizing word of some automaton in Cn .
- 25 -
Theorem 5. For any i Z n , define a transition

consumption function of the automaton Cn, i by
xm
s if x b,
r if m i and x a,
t if m i and x a,
(9)
where r, s, t are non-negative real parameters. Then

if r s t ,
| wi | r
wi 1
2 ( 2n 4)is ( n 1)t if r 0.
(10)
ICEIC 2015
Moreover, if the triple (r , s, t ) is substituted to one of

the triples (1,1,1), (0,1,1) and (0,1,n-i), then
wi
1
wm
n mZ i
n
w1 min{ wi }iZ n .
(11)
1
cm
n mZ wi
Proof. If r s t , it is evident that
1
[(n 2)is ( n 1 m)t ]
n mZ
wi | wi | r .
Let us now consider the case of r 0 . Since 1, i Z n

and {m}mZ n Z n , it follows from Lemma 1 and
1
n( n 2)is
( mt )
n
mZ n
1
n(n 1)t
n( n 2)is
n
2
( 2n 4)is (n 1)t
.
2
Lemma 2 that both of {i m}mZ n and {mi}mZ n are

residue systems. Consequently, for each m Z n , there
exists a unique cm Z n such that
mi i cm ,
mi cm i .
Thus Equality (10) is also true when r 0 .

Let i be an arbitrary member of Z n . It is certain
that i 1 . If (r , s, t ) (1,1,1) , then
For any m Z n distinct to n-1, it is routine to see that
wi | wi || w1 | w1 .
i.e.,
m
wc m (cab
i m
) a (b i a ) n 2 m
If (r , s, t ) (0,1,1) , then
c m ( ab
m
(cab
i m a
)
i m
i m
) a
(cbmi a( ab
) n 2m
wi
i
0
m
(cab
i m a (b i a ) n 2 m
)
(2n 4)is ( n 1)t 3n 5
w1 .
2
2
In the case that (r , s, t ) (0,1, n 1) , if n=2, then
mis t ( n 2 m)(is t )
Z n {1} ; if n=3, then Z n {1,2} and
( n 2) is ( n 1 m) t ;
w1 3 w2 ;
moreover, it is certain that
cn 1 abi
if n 3 , then
mi cn 1 i ,
(2n 4)i (n 1)(n i )

2
( n 3)i n( n 1)
2
(n 3) n( n 1)
2
w1 .
wi
so that
wc ni1
n3
c n1 ( ab i ) m
a
m0
n 3
m 0
bcin 1 ( ab
i m
) a
c n 1 ( ab i ) n 2
a
c n1 ( ab i ) m a
0
bi
Therefore Equality (11) always holds if the triple

(r , s, t ) is substituted to one of the triples (1,1,1),
(0,1,1) and (0,1,n-i). This completes the proof.
(n 2) is
(n 2) is [(n 1) (n 1)] t .
This yields that, for any m Z n ,
Remark 6. Consider the reset of electronic devices.

Assume that a certain electronic device D equips with
n-states labelled by the members of Z n , respectively,
in which 0 is the initial state. Sometimes, D is needed
to be reset to the state 0 when it is on an unknown
state. A considerable reset scheme is to take some
i Z n and then design two inputs a,b which transfers
wc mi ( n 2) is (n 1 m) t ,
and then it follows from the fact Z n {cm }mZ n that
- 26 -
ICEIC 2015
the state of D according to the automaton Cn,i. Then it

follows from Theorem 1 that, at any time, D can be
reset to the state 0 under the action of the order wi .
Let : ( m, x) xm be the transition consumption
function of Cn,i defined as in (9). Let m be an arbitrary
state of D, and let
x
| wi |
1
2
m q0
q1
qm 1
q| wi | 0
be the path from m with label wi . If (r , s, t ) (1,1,1) ,

then wmi is exactly the length of the rest-order, i.e.,
Let : m m be the probability distribution

function on the set Zn defined by the rule that, for any
m Zn, m is the probability that m is the initial
orientation, and let : ( m, x) xm be the transition
consumption function of Cn,i defined as in (9). If Zn is
uniformly distributed and O can only be turned
clockwise, then wi is exactly the average steps that O
is turned in the procession of orientation. Hence, in
this case, it follows from Theorem 5 that Cn,1 is the
best one in the control algorithms in Cn.
If (r , s, t ) (0,1,1) , then wmi is exactly the times that
Acknowledgment. This work is supported by

Natural Science Foundation of China (No.61272196)
and Project of Science and Technology Program of
Hunan Province (No.2013FJ4047).
the state is changed in the procession of reset from the

state m, i.e.,
References
wmi | wi | .
wmi
k | qk
qk 1 , 0 k | wi | 1 .
For any state m Zn, let m be the probability that

mw=0 for a random word w. This leads to a probability
distribution function : m m on the set Zn. It is
reasonable to consider m as the probability that m is
the state acted by the reset-order wi . If Zn is uniformly
distributed, then it follows from Remark 4 and
Theorem 5 that Cn,1 is in general the best one in the
reset algorithms in Cn since it means the shortest
reset-order and the least average times that the state is
changed in the process of reset. It is a routine matter
to construct examples to illustrate that the case may be
different when Zn is not uniformly distributed.
To explain how synchronizing automata arise in
industrial automation, Volkov [9] presented an
example which illustrates the idea to orient an object
with four possible orientations to the required
orientation independently of its initiation. Let us now
consider a certain generalization of such an example.
Remark 7. An object O has n possible orientations
labelled by the members of Zn, respectively, which are
uniformly distributed on a circle in clockwise order. If
O is needed to be turned to the orientation 0 in a given
rule independently of the initial orientation, a
considerable scheme is to take some i Z n and then
design two mechanisms a, b which control the transformation of the orientation of O according to the
automaton Cn,i Cn. Then it follows from Theorem 1
that, at any time, O can be orented to the orientation 0
under the action of the order wi .
- 27 -
[1] J. ern, Poznam k akhomogenym eksperimentom s

konechnymi automatami, Matematicko-fyzikalny Casopis
SAV, Vol. 14 (3), pp. 208-215, July 1964.
[2] L. Dubuc, Les automates circulaires biaiss vrifient la
conjecture de ern, RAIRO Informatique thorique et
Applications, Vol. 30 (6), pp. 495-505, June 1996.
[3] L. Dubuc, Sur les automates circulaires et la conjecture
ern, RAIRO Informatique thorique et Applications, Vol.
32 (1-3), pp. 21-34, January 1998.
[4] D. Eppstein, Reset sequences for monotonic automata,
SIAM J. Comput., Vol. 19, pp. 500-510, December 1990.
[5] J. M. Howie, Automata and Languages, Clarendon Press,
Oxford, November 1991.
[6] P. Martyugin, Complexity of problems concerning reset
words for cyclic and Eulerian automata, Theoret. Computer
Sci., Vol. 450 (7), pp. 3-9, July 2012.
[7] B. Natarajan, Some paradigms for the automated design
of part feeders, Internat. J. Robotics Research, Vol. 8 (6), pp.
89-109, November 1989.
[8] B. Steinberg, The ern conjecture for one-cluster
automata with prime length cycle, Theoretical Computer
Science, Vol. 412 (9), pp. 5487-5491, November 2011.
[9] M. V. Volkov, Synchronizing automata and the Cerny
conjecture, Lect. Notes Comput. Sci., Vol. 5196, pp. 11-27,
March 2008.
TO-2-2-6
PLL-based Charging Control Circuits

Byung Joo Oh, Ji Hoon Hwang Member, Jae Hoon Shim, Member, IEEE
School of Electronics Engineering, Kyungpook National University, Daegu, Republic of Korea
Email : ohbang87@knu.ac.kr
Abstract--Charging circuits for secondary batteries typically
employ the CC-CV (Constant-Current and Constant-Voltage)
charging profile, which requires sophisticated circuits to control
the charging process. PLL circuits can be alternatively used to
implement the CC-CV profile, but they are prone to overcharging problems. This paper presents two techniques to prevent
overcharging in PLL-based charging-control circuits. It is shown
that the proposed charging-control circuits designed in 0.18um
CMOS technology relax the overcharging problem significantly.
Fig. 2 The linear model of PLL-based charging circuit

T (s) =
I. INTRODUCTION
Lithium-ion batteries are widely used in portable electronic
devices because they have a long lifetime and high storage
stability. The CC-CV (Constant-Current Constant-Voltage)
profile has been typically used in charging circuits for Li-Ion
batteries. In general, the CC-CV method requires a complicated circuit for controlling the charging process. Alternatively, a
simple PLL-based charging circuit can be used to realize the
CC-CV charging profile [1]. However, a straightforward implementation of the PLL-based charging-control circuit may
give rise to overcharging. We present two techniques to prevent the overcharging problem.
Vo ( s )
s 2 rc c b K + sK
,
= 3
Pi ( s ) s c b f + s 2 c b + sc b K f + K f
where K = K pc Kvc , K f = K pc Kvc Kvco . K pc is the gain of

the PFD; K vc is the voltage-to-current conversion ratio; K vco
is the gain of the VCO; rc is the internal resistance of the
battery; cb is equivalent capacitor of the battery;
f is time
constant in the PFD. If all the poles were real, the step
response of the PLL would be over-damped. The condition of
over-damped step response is given by
rc K f cb > 2
II. A PLL-BASED CHARGING CIRCUIT
A. The PLL-based charging circuit
(1)
(2)
C. Overcharging problems
The PLL-based charging circuit is shown in Fig. 1. The target voltage and the actual battery voltage are converted to frequency by means of two VCOs. The feedback system tries to
equalize the two frequencies. In the meantime, the batterycharging current is varied according to the frequency difference between the two VCOs mimicking the CC-CV profile.
When the frequency difference is large, the charging current is
constant; when the frequency difference is below a certain
threshold, the charging current gradually decreases.
The PLL-based charging circuit in Fig. 1 takes only the UP

signal from the PFD for charging the battery. It is seemingly
all right to use only the UP signal since the PLL has the overdamped step responses. However, even when the PLL is
locked, the UP pulses are continually generated resulting in
the reference spurs because of the non-zero delay in the PFD
reset path. These periodic UP pulses might cause overcharging
because there is no way to remove the additional charge delivered to the battery. We propose two techniques to address this
overcharging problem.
III. PROPOSED ARCHITECTURE
A. Use of a modified PFD
Fig. 1 Proposed PLL-based charging - control circuit
B. PLL loop design

In order to avoid overcharging, the PLL should have overdamped step responses. For the linear model of the PLL-based
charging circuit shown in Fig. 2, the closed-loop transfer function is given by
The conventional tri-state PFD creates UP and DOWN

pulses with the same width when the PLL is in lock. Since the
charge pump of a PLL typically makes use of both UP and
DOWN pulses, their effects are canceled out. In the PLLbased charging circuit in Fig. 1, however, only the UP pulses
are used and therefore the perpetual UP pulses add a small
amount of charge to the battery incessantly. As a remedy for
this problem, an additional NOR gate can be employed as
shown in Fig. 3. Due to the NOR gate, the final output of the
PFD contains only the portion of the UP pulse where the
DOWN pulse is not asserted (Fig. 4), alleviating the over-
- 28 -
ICEIC 2015
charging speed is slight slow when DOWN pulses are used
probably because they reduce the amount of charge delivered
to the battery. However, the intermittent discharging current
might rather increase the charging speed by balancing the ion
concentration [3], which is not modeled in the simulations.
charging problem.
4.4
Fig. 3 PFD: (a) conventional
(b) modified
4.2
4.208
4.206
3.8
Battery Voltage(V)
Battery Voltage(V)
3.6
3.4
Conventional
Slope = 0.2V/s
4.204
4.202
4.2
4.198
Modified PFD
Slope = 0.02V/s
UP/DOW N
Slope = 0.01V/s
4.196
3.2
0.014 0.0145 0.015 0.0155 0.016 0.0165 0.017 0.0175 0.018 0.0185
time(s)
Convention PFD
Modified PFD
UP/DOWN
3
2.8
0
0.002 0.004 0.006 0.008
0.01
0.012 0.014 0.016 0.018
0.02
time(s)
Fig. 6 The Voltage of simulation results

Fig. 4 PFD:
(a) conventional
1.8
(b) modified
1.6
B. Use of both UP and DOWN Pulses the from PFD

Battery Current(A)
1.4
Fig. 5 shows the alternative PLL-based charging-control

circuit. The architecture is similar to the aforementioned PLLbased charging circuit except that it simply makes use of both
UP and DOWN signals from the PFD. Since the DOWN pulses should be translated into discharging currents, the charge
pump part is more complicated. However, the use of DOWN
pulses negates the undesirable effect of UP pulses in lock condition. Furthermore, it is more robust because it is capable of
eliminating the unwanted charge delivered to the battery due
to PVT variation or other unknown reasons.
1.2
1
Convention PFD
Modified PFD
UP/DOWN
0.8
0.6
0.4
0.2
0
-0.2
0
0.002 0.004 0.006 0.008
0.01
0.012 0.014 0.016 0.018
0.02
time(s)
Fig. 7 The Current of simulation result

V. CONCLUSION
Two techniques to prevent overcharging in the PLL-based
charging circuits have been proposed. The simulation results
showed that the modified charging circuits successfully suppress the overcharging problem. The proposed PLL-based
charging circuits can be used to simply realize the CC-CV
profile while preventing battery overcharging.
ACKNOWLEDGMENT
This work was supported by Ministry Of Trade, Industry &
Energy (MOTIE) and IDEC Platform center (IPC).
Fig. 5 Waveforms when the two frequencies are equal

REFERENCE
IV. SIMULATION RESULTS
The proposed PLL-based charging circuits were designed in
a standard 0.18um CMOS technology. The batteries were
simply modeled as a combination of capacitor, resistor and dc
voltage source as outlined in [2]. Fig. 6-7 show the output
waveforms of three PLL-based charging circuits. Even after
the batteries are almost fully charged, the battery voltages are
increasing slightly. The slope of voltage increase is about
0.2V/s for the conventional circuit while those of the proposed
ones are 0.02V/s and 0.01V/s, respectively. Note that these
slopes are exaggerated at least by the order of 5 because small
capacitances were used for fast simulations; other PLL parameters were also adjusted to keep the PLL dynamics intact. The
[1] L.
Cheng,
et
al.,
"Current-Pumped
Battery
Charger," IEEE Trans Electron., Vol. 55, No. 6, pp. 24822488, June, 2008
[2] L. Chen et al., "Improving phase-locked battery charger
speed by using resistance-compensated technique," IEEE
Trans. Electron., Vol. 56, No.4, pp. 1205-1211, April,
2009
[3] R. Cope et al., The Art of Battery Charging, Proc. 14th
Annu. Battery Conf. Appl. Advances, pp. 233-235, Jan.
1999
- 29 -
TO-2-2-7
A Decentralized Formation Control of Multiple Mobile Robots with Collision

Avoidance
1
Hyun-Su Kim, Young-Ho Lee, Jong-Koo Park, Tae-Yong Kuc, Sang-Hoon Ji, Sang-Moo Lee,
Nak-Yong Ko, Young-Seon Moon, and Young-Jo Cho
School of Electrical and Electronics Engineering, SungKyunKwan University
The Robot Convergence Research Center, KITECH
Department of Control, Instrumentation and Robot Engineering, Chosun University
Department of Electrical Engineering, Sunchon National University
Electronics Telecommunication Research Institute
hskimz@skku.edu, yhohoho@skku.edu, pjk@skku.ac.kr, tykuc@skku.edu,
robot91@kitech.re.kr, lsm@kitech.re.kr, nyko@chosun.ac.kr,
moon@sunchon.ac.kr, youngjo@etri.re.kr
2
1, 2, 3, 4
5, 6
Abstract
This paper presents a decentralized controller design
for formation and traction control of multiple robots
with collision avoidance. A series of simulation results
verifies the feasibility and effectiveness of the distributed
controller for multi-robot coordination problem.
Keywords: Multiple Mobile Robots, Kinematic Control,
Distributed Control, Formation Control, Traction Control,
Collision Avoidance, Finite Potential Function, Virtual Leader
1. Introduction
The kinematics of mobile robot is modeled as

p i = J i ui i = 1,2,, n .
(2)
Where robot velocity vector and Jacobian matrix are
defined as p = xi , J = J ( ) cos i h sin i
i
y i
sin i
h cos i
h is the distance between the center of gravity and

the axis of wheels.
Problem Statement: Find a distributed kinematic controller
u i = dvi ( pi , p jCV ) with which the initial formation graph
G(0) converges to the desired formation graph without
collision. That is,
i) lim G(t ) = G *
ii) pi (t ) p j (t ) 0, t 0 (i j )
i
Since late 1980s, several researchers studied

distributed controller for autonomous movement of robots
in formation [1], [2], providing a variety of methods for
formation control design [3], [4], [6].
This paper is aiming at designing a unified distributed
robot controller which consists of formation control for
the desired robot formation and traction control for
autonomous navigation of formation robots along the
desired trajectory. A potential function is devised to
encode a distributed control rule for the desired robot
formation and collision avoidance.
2. Problem Formulation
Consider a set of n mobile robots with 2 DOF
differential motor drivers.
(1)
R = {Ri ( p i )}i =1, 2 ,, n
pi = [xi
T
yi ] is the position of i-th robot in the global
coordinate. Then, the formation of multiple n robots can

be represented by using formation graph as in [3], [5].
Definition 1: Formation graph G = {V , E , C} is defined as a
weighted graph which models the deployment of n robots.
V = {v i ( p i )}i =1,2 ,, n : The set of vertices for robot positions
E ={eij (vi ,vj )}i, j=1,2,,n : The set of lines connecting two vertices
C = {cij (eij ) | cij = pi p j foreij E}i, j=1,2,,n : The set of weight
vectors for relative position of two robots
- 30 -
where G * = G{V * , E * , C * } is the target formation graph and

c ij* = p i* p *j . In general, from the geometry of formation
graph, it becomes
1
pi =
mi
(p
+ c ij )
jCVi
where CVi is the set of vertices connected to vertex i

and mi is the number of vertices in the set CVi .
3. Distributed Control Design

To begin with, define the formation error and center
of formation graph as
1 n
1 n
eij = pi p j cij* , pc= pi= (p j+c*ij )
n i=1
n j=1
.
Then, the attractive and repulsive potential functions
are respectively defined for robot Ri as follows.
(Attractive potential function),
V a (t ) =
V a (t )
i
ij
jCVi
V i r (t ) =
r
ij (t )
(Finite repulsive potential function)
jCVi
Vija (t )
1
= eij
2
d ij wi2
1
, if wi1 < d ij < wi 2
, Vijr (t ) = 4 2 2
(d w ) +

ij
i1
, otherwise
d ij = pi p j : distance between Ri and R j
ICEIC 2015
i : Positive tuning parameter for potential function
{wi1 , wi 2 } : Radii of safety region and detection area
satisfying wi 2 + w j 2 || c ij* || .
The formation controller generates a velocity input for
system (2) which consists of the negative gradient of
attractive potential and the scaled sum of negative gradients
of repulsive potentials within the detection area of robot.
u i = J i1 [(1 ) i1 (eij ) + i2 ( eij )]
(3)
1 if wi1 < d ij < wi 2

=
,
otherwise
0
X
Fig. 2 Error Profile (
Y
)
of
Formation
Control
eij
jCVi
Vijr
.
, 2 (eij ) = 1 (eij )
ij pi i
jCVi
jCVi
{ i = diag ( i1 , i 2 ), ij } : Control gain parameters
1 (eij ) =
Vi a
pi
i : Auxiliary input
i = io
*
ij
(4)
jCVi
Fig. 3 Steering of Formation Robots
4. Traction Control of Robot Formation

Assigning and controlling a virtual robot model located
at the center of gravity of robot formation, it is possible
for robots to follow the desired trajectory.
p c = c
(5)
where p c
1
n
, c is the virtual velocity control input.
i =1
The distributed robot controller which achieves

formation and traction control of multiple robots
simultaneously can be derived as in the following.
(6)
u i = J i1 [ oi
eij + p d + ~
pc ]
jCVi
oi : Positive control gain matrix

{ p d , p d } : Desired position and velocity trajectories of
Future direction of our research on distributed robot

control design includes accommodation of disturbance
corrupted sensor data in each feedback controller,
handling measurement time delay, communication time
delay in mutual data acquisition, avoidance of control
input saturation to improve the performance and
robustness of distributed control system for multiple
mobile robots. This enlarges the scope of application of
our control design method to a wider class of cooperative
coordination problems.
Acknowledgements. This work was supported in part by
Knowledge and Economics Department of Korea
Government through Original Industrial Technology
Development Project for Collective Intelligence Robot.
(KM-14-0002)
virtual robot
: Positive control gain

~
p c = p d p c : Tracking error
References
[1] T. Arai, H. Ogata, and T. Suzuki, Collision avoidance among
multiple robots using virtual impedance, IROS Proceedings,
pp.479-485, 1989.
[2] P. K. C. Wang, Navigation strategies for multiple autonomous
mobile robots", IROS Proceedings, pp.486-493, 1989
[3] F. Chen, Z. Chen, Z. Liu, L. Xiang, Z. Yuan, Decentralized
formation control of mobile agents: A unified framework,
Physica A 387, pp.4917-4926, Elsvier, 2008.
[4] L.E. Parker, Current State of the Art in Distributed
Autonomous Mobile 3 Robotics, L.E. Parker et.al.(eds.)
Distributed Autonomous Robotic Systems 4, pp.3-12, SpringerVerlag Tokyo, 2000.
[5] E.G. Hernandez-Martinez and E. Aranda-Bricaire,
Convergence and Collision Avoidance in Formation Control: A
Survey of the Artificial Potential Functions Approach, MultiAgent Systems-Modeling, Control, Programming, Simulation and
Applications, pp.103-126, 2011.
[6] W. Ren, R.W. Beard, and E.M. Atkins, A Survey of
Consensus Problem in Multi-agent Coordination, 2005 American
Control Conferences, pp.1859-1864, June 8-10, Portland, OR,
USA, 2005
5. Simulation Results and Conclusion

In order to validate the theoretical results, illustrative
examples are given with the proposed distributed
controller for formation and traction control of multiple
mobile robots.
Fig. 1 Convergence of Robot Formation
- 31 -
ICEIC 2015

Oral Session
TO-2-3
Communication System and
Wireless Networking I
TO-2-3-1
Aligned Dynamic Point Blanking

in Small Cell Networks
Kwonjong Lee, , Yosub Park, Jihaeng Heo, Hyunsoo Kim, Takki Yu, Hano Wang, and Daesik Hong
Information Telecommunication Lab.(B715), School of Electrical and Electronic Engin., Yonsei Univ.,
134 Shinchondong Seodaemungu, Seoul, Korea, 120-749.
Phone: +82-2-2123-3558, Fax: +82-2-312-4887, Homepage: http://mirinae.yonsei.ac.kr
E-mail: leekwjo@yonsei.ac.kr and daesikh@yonsei.ac.kr
AbstractIn dense small cell networks, edge users are exposed

to severe interference because of the increasing number of
interfering small cells. To solve this problem, we propose a
procedure called aligned dynamic point blanking (ADPB), where
selected base stations mute to lessen the interference to other
cell edge users. System level simulation results show that the
5%-ile user throughput and system throughput are improved
compared to conventional joint transmission.
I. I NTRODUCTION
Small cell densication has been introduced as one of
the potentially effective solutions to the critically increasing
data trafc demand. The greater the number of small cells
deployed, the greater the amount of achievable resources
[1], [2]. However, this scenario exposes users to more interference. Specically, the interference degrades the signal
to interference and noise ratio (SINR) of the edge users [3].
Improving cell edge user performance will require effective
management of edge user interference.
The coordinated multi-point (CoMP) approach has come
under consideration as a way to properly eliminate this
interference in the Long Term Evolution (LTE) and LTEAdvanced system [4]. In this scheme, several base stations
(BSs), small BSs (s-BSs) or macro BSs (m-BSs), cooperate,
much like a single BS with multiple antennas [4], [5]. Joint
transmission (JT) is a CoMP scheme where the cooperating
BSs transmit the same signal to a target user, thus resulting
in improvement of edge-user SINR performance. However,
employing JT in dense small cell networks is not optimal
because JT helps only the target edge users SINR, whereas
it does not consider the interference to the other BSs users.
Thus JT is an efcient scheme for cooperation between two
BSs, but is inefcient in dense small cell networks.
In this paper, we propose aligned dynamic point blanking
(ADPB) as an approach to efciently manage interference. In
ADPB, selected BSs mute their resources in order to reduce
the interference to the other BSs users.
The remainder of this paper is organized as follows: Section
II describes the LTE small cell environment and introduces the
proposed ADPB algorithms. Section III evaluates the ADPB
by system level simulations and discusses the simulation
results. Finally, our conclusions are presented in Section IV.
This work was supported in part by SK Telecom Co., Ltd., Korea, and in
part by the National Research Foundation of Korea (NRF) grant funded by
the Korea government (MEST) (No. 2012R1A2A1A05026315).
II.
S YSTEM MODELS AND P ROPOSED ADPB
A. System models
Let us consider a small cell network with an LTE system as
depicted in Figure 1. In this gure, for the sake of simplicity,
we limit the scope to one macro cell area with Ns s-BSs,
and Nu users with a single antenna. The m-BS B0 and sBSs Bi (i = 1, 2, ..., Ns ) are connected to each other by
ideal backhaul [4]. It is assumed that the users are uniformly
distributed and associated with one BS that has a maximum
reference signal received power (RSRP). The user
in the i-th
BS is denoted by Ui,j (j = 1, 2, ..., Nui ), where Nui = Nu
i
and Nui represents the number of users in the i-th BS.

B. Proposed Aligned Dynamic Point Blanking
In dense small cell networks, the edge users have a significantly lower SINR. In order to improve the SINR of the cell
edge users, we propose ADPB where the selected s-BSs or
m-BSs mute for edge users. The blanking BSs are selected
based on the interference the edge users are experiencing.
Specically, muting should be applied to those BSs that cause
interference to a large number of edge users. As the selected
BSs mute their resources, the other BSs allocate these muted
resources to users who are experiencing severe interference.
Consequently, the SINR of the edge users is enhanced by
eliminating the dominant interference.
As mentioned above, in ADPB, each BS judges whether it
should transmit a signal or not based on a blanking vector on
time slot t, C[t] = {c0 , c1 , c2 , ..., cNs }, where ci = 1 if Bi
1,1
Small BS
0,1
Backhaul
Macro BS
Macro Cell Area
Fig. 1. Small cell networks consisting of a m-BS and s-BSs. Each BS is

linked to the others by a backhaul connection. The solid line indicates the
coverage of each BS. The dashed line represents the backhaul connection
between each BS.
- 33 -
ICEIC 2015
A LIGNED DYNAMIC P OINT B LANKING A LGORITHM
65
Initialization:
Set D1 = {0, 0, ..., 0, 1}, D2 = {0, 0, ..., 0, 1}, ...,
D2Ns +1 = {1, 1, ..., 1, 1}, = 0
System Throughput [Mbps]
60
Start aligned-DPB:
Form = 1 : 2Ns +1
set C[t] Dm
For i = 0 : Ns
Calculate i,j (C[t]) &Ri,j (C[t])
End
Ns

Calculate
i (C[t])
if <
i=0
set
End
i (C[t])
Ns
i=0
i (C[t]) & C [t] C[t]
N
s+1
k=1
0.22
0.2
50
0.18
45
0.16
40
0.14
35
0.12
30
0.1
Number of Small Cells
0.08
4
Fig. 2. 5%-ile user throughput versus the number of small cells for the
ADPB and JT. (Inter-site distance: 500m)
transmit data, otherwise ci = 0. The SINR of Ui,j is given

by
i,j (C[t]) =
55
25
i=0
Ns
0.24
Aligned DPB System Throughput

JT System Throughput
Aligned DPB 5%-ile User Throughput
JT 5%-ile User Throughput
5 %-ile User Throughput [Mbps]
TABLE I.
ci Gii,j Pi
ck Gki,j Pk
ci Gii,j Pi
(1)
+ N0
where Gki,j denotes the channel between Bk and Ui,j . Gki,j

incorporates the effects of large-scale path loss, shadowing,
and multi-path fading. N0 and Pk denote the additive Gaussian noise and transmission power of the k-th BS. In addition,
the achievable throughput of Ui,j is represented as
Ri,j (C[t]) = wlog2 (1 + i,j (C[t])) ,
(2)
where w is a system bandwidth. The blanking vector can be

obtained as
Ns

i (C[t]),
C [t] = arg max
(3)
i=0
C[t]
i (C[t]) = max Ri,j (C[t])/Ti,j [t],
j
where Ti,j [t] denotes the total received throughput of Ui,k . In

addition, i (C[t]) is a metric to guarantee the fairness.
The detailed algorithm employed by ADPB is represented
in Table I. In this algorithm, the BSs mute only if there is
no degeneration in system throughput. Therefore, the ADPB
does not degrade the system throughput that is the summation
of all users throughput in the macro cell area.
III. P ERFORMANCE E VALUATION
In this section, we present system level simulation results
to evaluate the performance of ADPB in small cell networks.
The system level simulator components are constructed based
on the 3GPP small cell enhancement scenario described in [6].
A number of s-BSs are deployed randomly in each macro cell
area. The number of s-BSs in each macro cell area varies
from 0 to 4. The other system parameters are same as the
parameters used in [7] .
Figure 2 shows the 5%-ile user throughput and total cell
throughput according to the number of s-BSs. As the number
of s-BSs in a m-BS area increases, the proposed ADPB
delivers performance that is superior to the conventional JT.

The reason for this is that the JT improves the SINR of the
target users more than ADPB does, while ADPB helps more
users than JT. Because the number of users experiencing
severe interference increases in dense small cell networks,
improving overall performance is more efcient than simply
improving the SINR of specic target users. In other words,
ADPB can achieve additional gain over JT in dense small cell
environments.
IV. C ONCLUSION
This paper proposed ADPB to improve the 5%-ile user
throughput. When ADPB is applied, several BSs mute some
resources for other cell users who are exposed to severe
interference from the blanking BSs. When the blank resources
are allocated to other cell users by the remaining BSs, the
interference from the blocked BS can be eliminated, thus
improving the throughput of the other cell users. Numerical
results from system level simulation show that the proposed
ADPB provides edge throughput improvement compared to
the conventional JT.
R EFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
- 34 -
I. Hwang, B. Song, and S. Soliman, A holistic view on hyper-dense

heterogeneous and small cell networks, IEEE Commun. Mag., vol. 51,
no. 6, pp. 2027, 2013.
Vasudevan, S. and Pupala, R.N. and Sivanesan, K., Dynamic eICIC - A
Proactive Strategy for Improving Spectral Efciencies of Heterogeneous
LTE Cellular Networks by Leveraging User Mobility and Trafc
Dynamics, IEEE Trans. Wireless Commun., vol. 12, no. 10, pp. 4956
4969, October 2013.
T. Akbudak and A. Czylwik, CoMP in heterogeneous networks:
Linear transceiver design using the minimum weighted geometric-MSE
criterion, in Wireless Communications and Networking Conference
Workshops (WCNCW), 2012 IEEE. IEEE, 2012, pp. 126131.
3GPP, TR 36.819 V11.2.0, Coordinated multi-point operation for LTE
physical layer aspects, TSG RAN WG1, 2013.
T. Nakamura, S. Nagata, A. Benjebbour, Y. Kishiyama, T. Hai, S. Xiaodong, Y. Ning, and L. Nan, Trends in small cell enhancements in
LTE advanced, IEEE Commun. Mag., vol. 51, no. 2, pp. 98105, 2013.
3GPP, TR 36.814 V9.0.0, Evolved universal terrestrial radio access
(E-UTRA); further advancements for E-UTRA physical layer aspects,
TSG RAN WG1, 2010.
Y. Park, J. Heo, H. Kim, H. Wang, S. Choi, T. Yu, and D. Hong,
Effective Small Cell Deployment with Interference and Trafc Consideration, in Vehicular Technology Conference (VTC Fall), 2014 IEEE
80th. IEEE, 2014, pp. 15.
TO-2-3-2
- 35 -
ICEIC 2015
- 36 -
ICEIC 2015
- 37 -
ICEIC 2015
- 38 -
ICEIC 2015
- 39 -
ICEIC 2015
- 40 -
ICEIC 2015
- 41 -
ICEIC 2015
- 42 -
ICEIC 2015
- 43 -
ICEIC 2015
- 44 -
TO-2-3-3
A Rectangular Micro-strip Patch Antenna for UWB Applications
Deepak Bhatia1, Vardhman Hada2

1
Assistant Professor
Department of Electronics Engineering
Rajasthan Technical University, Kota, INDIA
email- keshav_eck26@yahoo.com
2
Graduate student
Department of Information and Telecommunication
SRM University,Chennai, INDIA
email- hada.vardhman@gmail.com
10.6 GHz. The proposed antenna has simple structure

with overall size of 28*29*1.6 (mm) along x y z axis.
Four equal sorts are cut on the rectangular patch to
improve return loss and achieve higher gain. To achieve
larger operating bandwidth feed line is optimized. The
simulation results shows the larger operating bandwidth
of the antenna. The minimum workable return loss of 10
dB is achieved with improved return loss and gain.
Abstract
This paper presents enhancement of a rectangular patch
antenna for Ultra Wide Band (UWB) applications. The
antenna performance can be improved in terms of its
return loss, operating bandwidth and gain for whole
operating frequency band. It requires to satisfy a wide
range of application within the frequency range of 3.1Keywords- return loss, gain, feed line, bandwidth
I.
response should be linear with respect to frequency.

Ideally for any direction of emission, as mobility
considerations require UWB antennas to be as isotropic
as possible. Both frequency and time domain responses
must be considered during the design. The dispersion that
can be observed on radiated pulses reveals the antenna
time behavior. Integration and production of UWB
mobile transceivers imply an additional task that consists
in building a minimum-size low-cost antenna [3]. The
applications have been broadly classified into 6 groups
namely Ad-hoc Networking, Wireless sensor networks,
Radio Frequency Identification (RFID), Consumer
Electronics, Locating and Medical application. UWB
communication is based on the transmission of very short
pulses with relatively low energy. UWB technique has a
fine time resolution which makes it a technology
appropriate for accurate ranging. The huge bandwidth of
UWB help waves to attain good material penetration
capability.
[4]
INTRODUCTION
Microstrip patch antenna are particularly alluring
nowadays due to their smaller size, light weight, low
cost, and ease of fabrication[1]. They are compatible with
wireless communication integrated circuit, due to their
compact and elementary feeding techniques especially
microstrip-line and coplanar waveguide feeds. The main
shortcoming in patch antennas is their narrow bandwidth
[2]. The size of the patch is altered to rectify the problem
of narrow bandwidth. Antenna to work for UWB
applications, it should transmit information spread over a
large bandwidth which should be greater than or equal to
500 MHz or 20 % of centre frequency. (UWB) radio has
drawn attention since the frequency band from 3.1 to
10.6 GHz is released to UWB applications by Federal
communications commission (FCC)[1].Power matching
should be realized continuously on the whole 7.5 GHz
wide frequency band. Moreover, the phase transfer
- 45 -
ICEIC 2015
II.
For a given resonant frequency fo, the effective length is

given as:
DESIGN EQUATIONS
The electric field lines reside in the substrate and parts of

some lines in air. Effective dielectric constant (reff)
should be obtained in order to account for the fringing
and the wave propagation in the line. The value of reff is
slightly less then r because the fringing fields around the
periphery of the patch are not confined in the dielectric
substrate but are also spread in the air [5-6]. The
expression
for
reff
is
given
as:
2 f
(4)
re ff
(5)
=
2 f
h 12
reff =
+
1
+
12
(1)
2
2
W
+ 1
2
III.
ANTENNA DESIGN
The proposed antenna based on the rectangular patch
antenna. The antenna is planar rectangular patch antenna
fed by micro-strip line with a characteristic impedance of
50 . FR4 substrate is used with dielectric constant (r)
4.65, loss tangent (tan ) 0.02 and 1.6 mm of thickness
(h). The substrate is made up of FR-4 epoxy material.
FR-4 epoxy is a fire redundant dielectric which is cheap,
easily available and rugged. Its width is 29 mm and
length is 28 mm with a thickness of 1.6mm. Ground
plane is partial which is made up of a rectangular part
with a width of 29 mm, length of 10.4 mm and a small
notch in between the plane, which is parallel to the feed
line at the front side with width of 2 mm. Partial ground
plane is made for better impedance matching. The patch
of the antenna is equally cropped along the four edges
with 2 mm of a slot each. The patch has length of 8.5 mm
and a width of 8 mm. The feed line has simple structure
with length as 11.5 mm and width as 2 mm.
reff= effective dielectric
r=Dielectric constant
h= height of dielectric substrate
w=Width of the patch
The fringing fields along the width can be modeled as
radiating slots and electrically the patch of the microstrip
antenna looks greater than its physical dimensions [5-6].
The dimensions of the patch along its length have now
been extended on each end by a distance L, which is
given empirically by:
+0.264
reff +0.3) h
(
(2)
L=0.412
(reff 0.258) W+0.8
The effective length of the patch is:

L e ff = L + 2 L
For efficient radiation the width of the patch is given as:
r +1 r 1
Where
constant
e ff
(3)
- 46 -
ICEIC 2015
Fig.1. Dimensions of front view
Fig.2. Dimensions of back view.
TABLE.1 DESIGN PARAMETERS

S.No.
1
2
3
4
5
6
7
8
9
IV.
PARAMETERS
Ls
WS
SL
L
W
S
LG
WG
SG
DIMENSIONS (mm)
(substrate length)
(substrate width)
(strip length)
(patch)
(patch)
(slot size)
(length ground)
(width ground)
(strip width)
28
29
11.5
8.5
8
1
10.4
2
2
SIMULATION RESULTS
The results shown here are simulated on CST software.
Return loss gives us amount of power being reflected by
the input port [6]. For UWB antenna, return loss below 10 dB is considered to be quite efficient [7]. For this
antenna design return loss is less than -10 dB in

frequency range 3.1-10.6 GHz and achieving a maximum
gain
of
10.3
DB.
- 47 -
ICEIC 2015
Fig.3. Simulation results of return loss of rectangular patch antenna.
The E-plane is defined as the plane containing the

electric field vector and the directions of maximum
radiation while the H plane is the plane containing the
magnetic field vector and the direction of maximum
radiation [8]. For the proposed antenna, two principle
planes are selected to present the radiation pattern. These

are referred to as the xy plane (Eplane) and the yz
plane (Hplane) and the absolute value at the central
frequency
(6.65GHZ).
Fig.4. Simulated absolute value radiation patterns for the proposed antenna at central frequency 6.65 GHZ.
- 48 -
ICEIC 2015
Fig.5. Simulated E-plane radiation patterns for the proposed antenna at central frequency 6.65 GHZ.
Fig.6. Simulated H-plane radiation patterns for the proposed antenna at central frequency 6.65 GHZ.
- 49 -
ICEIC 2015
V.
REFERENCES
CONCLUSION
A compact UWB micro-strip antenna is presented. The

operating bandwidth of the antenna at a minimum
workable return loss of 10 dB was achieved at 3.1 GHz
to 10.6 GHz (frequency centered at 6.65 GHZ). The
antenna exhibited a stable radiation patterns and a
maximum gain of 10.3 DBI over most of the UWB
frequency range. Due to its very wide bandwidth, the
antenna can be considered as a potential candidate for
cost effective UWB applications. The proposed design of
the antenna can be used for a variety of UWB
applications including high speed data transfers, wireless
connectivity between UWB-enabled devices and a
variety of medical applications.
- 50 -
[1]
FCC 1st Report and Order on Ultra-Wideband Technology,

Feb. 2002.
[2]
C.K.Chakrabarty, L.C.Ping and B.Kasi, A Compact Microstrip Antenna for Ultra Wideband Applications European
Journal of Scientific Research,Vol.67, No.1, 2011, pp. 4551.
[3]
A.Diet, A.Azoulay, A. Joisel and B. Duchene A UWB

micro-strip antenna design and simulation Proceedings
of the 36th European Microwave Conference, Manchester
,UK ,2006, pp.1694-1697.
[4]
H.Nikookar, R.Prasad Introduction to Ultra Wideband

for Wireless Communications Springer Science and
Business Media B.V. 2009
[5]
Md. M.Ahamed, K.Bhowmik and Abdulla Al Suman,

Analysis and Design of Rectangular Micro-strip Patch
Antenna on Different Resonant Frequencies for Pervasive
Wireless Communication International Journal of
scientific and technology research Vol.1, issue 5, June
2012, pp.108-111.
[6]
R.Rana and C.Vishnu Vardhana Reddy Design of

linearity polarized rectangular microstrip patch antenna
using IE3D/PSO Thesis of M Tech at the National Institute
of Technology, Rourkela, pp. 24-27 .
[7]
S. Satthamsakul, N. Anantrasirichai, C. Benjangkaprasert

and T.Wakabayashi Rectangular Patch Antenna with
Inset Feed and Modified Ground-Plane for Wideband
Antenna, SICE Annual Conference,August 20-22, 2008,
Japan pp. 3400-3403.
[8]
Anand Sharma, Rajesh K.Vishwakarma Microstrip

antenna with Swastik slot for UWB applications
Proceedings of the 2014 International Conference on
Electronic Systems, Signal Processing and Computer
Technologies,Computer Society Washington DC, USA
,2014, pp.79-83.
ICEIC 2015

Oral Session
TO-2-4
Access Networks and Systems I
TO-2-4-1
Relay Selection for Cooperative Jamming in Amplify-and-Forward

Relay Network with Eavesdropper
Yongyun Choi and Jae Hong Lee
Department of Electrical and Computer Engineering and INMC, Seoul National University
E-mail : {yongyun, jhlee}@snu.ac.kr
Abstract
circularly symmetric complex Gaussian random

variable with variance 2 . Assume that all channels
are reciprocal and have an additive white Gaussian
noise (AWGN) with zero mean and variance N 0 .
Assume that there is no direct link between the
source and the destination, while there is a direct link
between the source and the eavesdropper. The source
transmits its signal to the destination in two phases [4].
In phase 1, the source transmits signal x with
power PS(1) and the destination transmits a jamming
In this paper, the relay selection criteria and

secrecy rate performance are investigated for an
amplify-and-forward relay network with an
eavesdropper. The source and destination transmit
jamming signals to confuse the eavesdropper.
Simulation results show secrecy rates of optimal and
suboptimal relay selection criteria.
Keywords: Relay selection, amplify-and-forward,
cooperative jamming, eavesdropper, secrecy rate.
signal z D with power PD to degrade the signal quality

at the eavesdropper. The received signal at relay k is
given by
yRk =hSRk x + hDRk z D + nRk
(1)
1. Introduction
In relay networks with eavesdropper, secrecy rate is

where nRk is an AWGN. The received signal at the
improved by cooperative jamming [1], [2]. In
eavesdropper is given by
cooperative jamming, a node in relay network transmits
(2)
yE(1) =hSE x + hDE z D + nE(1)
a jamming signal to confuse the eavesdropper.
(1)
Recently, only a few works are researched on
where nE is an AWGN.
cooperative jamming by the destination or the source
In phase 2, relay k amplifies and forwards the
[3]. However, these works have not considered
received signal with power PRk . The received signal at
amplify-and-forward (AF) relay networks with
the destination is given by
cooperative jamming.
In this paper, we formulate relay selection=
criteria in
(3)
yD hRk D g Rk ( hSRk x + hDRk z D + nRk ) + nD
AF relay network with eavesdropper. A cooperative
where g Rk is an amplification factor at relay k and nD
jamming is used at the source and destination. The
secrecy rates of the proposed relay selection criteria are
is an AWGN. Assume that the destination perfectly
shown by computer simulations.
cancels its own jamming noise z D . Then yD becomes
(4)
y D = hRk D g Rk hSRk x + hRk D g Rk nRk + nD .
2. System model
During the relay transmission, the source transmits a

jamming signal zS with power PS(2) . Hence, the
Consider a two-hop relay network which consists of
received signal at the eavesdropper is given by
a source, S , K amplify-and-forward (AF) relays, Rk ,
=
yE(2) hRk E g Rk ( hSRk x + hDRk z D + nRk ) + hSE zS + nE(2) (5)
k = 1, 2, , K , a destination, D , and an eavesdropper, E . Assume that each node has a single
antenna and operates in half-duplex mode. Assume that
the channel coefficient between node A and node B ,
hAB , A, B {S , Rk , D, E}, is an independent zero-mean
where nE(2) is an AWGN.
- 52 -
ICEIC 2015
Let
P=
P=
P, PS(1)
= PS(2)
= P 2. Then the
R
D
received signal-to-noise ratio (SNR) at the destination
is given by
D =
SR
where AB = P hAB
SR R D
+ 2 ( 2 R D + 1)
k
secrecy rate performance is improved by using the

proposed relay selection criterion. It is also shown that
the secrecy rate of suboptimal relay selection criterion
is almost same as that of optimal relay selection
criterion.
(6)
N 0 . Suppose that the eaves-
dropper uses selection combining. The received SNR at

the eavesdropper is max { E(1) , E(2) } , where
E(1) =
and
E(2) =
SE
,
2 ( DE + 1)
(7)
SR R E
1
2
DRk ( Rk E + 1) + SE + 1 SRk + R D + 1
k
2
2
The secrecy rate of this network is given by

1
1
R = log 2 (1 + D ) log 2 (1 + E )
2
2
. (8)
(9)
Fig. 1. Secrecy rate versus Average SNR.
where [ x ] = max {0, x} .

+
Acknowledge
3. Relay selection criteria

Foundation of Korea (NRF) grant funded by the Korea
government (MSIP) (No. 2009-0083495, 20110017437).
When the CSI of all channels are available, an

optimal relay selection criterion which maximize the
secrecy rate is formulated as
(10)
k * = arg max R.
References
When the CSI of the eavesdropper channels are not

available, a suboptimal relay selection criterion which
maximizes the SNR at the destination is formulated as
(11)
k * = arg max D .
[1] L. Dong, Z. Han, A. P. Petropulu, and H. V. Poor,

Improving wireless physical layer security via cooperating
relays, IEEE Trans. Signal Process., vol. 58, no. 3, pp.
18751888, Mar. 2010.
4. Simulation results
[2] A. D. Wyner, The wire-tap channel, Bell Syst. Tech. J.,

vol. 54, no. 8, pp. 1355-1387, Oct. 1975.
Suppose that the number of relays K = 3 and the

variance of the channel 2 = 1.
Fig. 1 shows the secrecy rate versus average SNR. It
is shown that, as the average SNR increases, the
secrecy rate is improved in all selection criteria. It is
also shown that the performance gap between the
optimal relay selection criterion and the suboptimal
relay selection criterion is small.
[3] J. Huang and A. L. Swindlehurst, Cooperative jamming

for secure communications in MIMO relay networks, IEEE
Trans. Signal Process., vol. 59, no. 10, pp. 4871-4884, Oct.
2011.
[4] D. Lee and J. H. Lee, Outage probability for dual-hop

relaying systems with multiple interferers over Rayleigh
fading channels, IEEE Trans. Veh. Technol., vol. 60, no. 1,
pp. 333-338, Jan. 2011.
5. Conclusion
In this paper, we consider an AF relay network with
cooperative jamming in the presence of an
eavesdropper. We propose optimal and suboptimal
relay selection criteria. Simulation results show that the
- 53 -
TO-2-4-2
Power and Resource Allocation Scheme for Device-to-Device

Communications Underlaying Uplink Cellular Networks
Gil-Mo Kang and Oh-Soon Shin
School of Electronic Engineering, Soogsil University
{gilmokang, osshin}@ssu.ac.kr
D2D Communications Resource Block
Abstract
We propose an optimal power and resource
allocation scheme that maximizes the spectral
efficiency and achievable rate of device-to-device
(D2D) communications underlaying uplink of a
cellular network. We first derive an optimal resource
allocation for each D2D link so as to reuse the radio
resources allocated to cellular links. Then an optimal
set of D2D links is formed to maximize spectral
efficiency. Finally, we develop an iterative algorithm
for computing the optimal power allocation. The
performance of the proposed power and resource
allocation scheme is verified through numerical results.
Keywords: Device-to-device (D2D), power allocation,
resource allocation, spectral efficiency.
1. Introduction
Recently, the use of device-to-device (D2D)
communications underlaying a cellular network has
attracted substantial interest due to its capability of
improving the spectral efficiency as well as enabling
new proximity-based applications. Especially, the reuse
of resources allocated to the cellular uplink is accepted
as a viable approach to D2D communications. Since
the cellular and D2D links may interference with each
other, however, it is necessary to manage the potential
interference through effective resource and power
allocation algorithms [1].
In this paper, we consider a scenario where D2D
links can primarily use exclusive resources allocated
for only D2D communications. D2D links are also
allowed to reuse the cellular resources in an
opportunistic manner. Under these assumptions, we
develop an optimal resource allocation scheme that
maximizes the spectral efficiency while limiting the
mutual interference between D2D links and the
interference from D2D links to cellular links. We also
derive an optimal power allocation for the D2D links.
EX : Exclusive Resource for

D2D Set
SH : Sharing Resource with

Cellular
Interference from D2D Set
Interference from CUE
N : Number of subcarriers
N : Number of subcarriers
Figure 1: Proposed framework of D2D resource

allocation
2. Proposed resource and power allocations

The proposed framework of D2D resource
allocation is illustrated in Fig 1. Each D2D link can use
exclusive (EX) resources as well as sharing (SH)
resources. In the EX resources, more than one D2D
links are allowed to use the same resources and so
interference between D2D links may exist. In the SH
resources, the D2D links will interfere with the cellular
links. The proposed resource and power allocation
scheme to be described below is designed to handle
such interferences.
2.1 Optimal SH resource allocations
A D2D link may be able to reuse the subchannels
allocated to cellular links, unless it causes severe
interference to the cellular link. In order to limit the
performance degradation of the cellular link, we need
to limit the transmit power of the D2D transmitter. Let
m in (1) denote the average signal-to-noise ratio (SNR)
of the m-th subchannel for the cellular link, then the
maximum allowed transmit power m of the D2D
transmitter for the m-th subchannel is given as (2):
m =
1
Ns
pocue( m )
=
h
N o(m)
cb
hsh
( m, n )
n =1
cb
sh ( m , n )
n =1
pocue( m ) ,
2
N
s 2 n =1 hshdb( m , n ) .
(1)
(2)
Using (2), optimal SH resource that can be used for a

D2D link is found as
This work was partly supported by ICT R&D program of

MSIP/IITP (No. 12-911-01-107), and in part by the National
m*
=
Research Foundation of Korea (NRF) grant funded by the Korea
government (MSIP) (No. 2013R1A2A2A01011222).
- 54 -
2
N
hshd 2( md , n ) (dm2)d
=
n
1
. (3)
arg max log 1 + N
2 cue
m
cd
2
+
s
h
p
N
n =1 sh ( m, n ) sh ( m )
ICEIC 2015
Table 2: Simulation parameters
Table 1: Iterative power allocation algorithm

for 1 m M
Compute m * using (2) and (3)
end
for 1 k K (K: number of D2D users)
Compute the initial power po using (1)
Find s * using (4)
end
for 1 s Ns *
Put po into (6) and (7)
Compute [ pex , psh ] using iterative water filling
algorithm [2]
end
Parameter
Value
Cell radius
500m
Number of SH
subchannels
Number of
subcarriers per
subchannel (N)
Subcarrier
bandwidth
Parameter
Distance between
D2D Tx and Rx
Number of EX
subchannels
47
Value
50m
1
12
PSD of AWGN
-174
dBm/Hz
15kHz
Target SNR of
CUE
20dB
1.4
N =1
Spectral efficiency (bps/Hz/cell)
2.2 Optimal EX resource allocations

To maximize the spectral efficiency, the EX
resources need to be shared among different D2D links.
If the average SNR of the D2D link is the same as (1),
optimal set s * of D2D links that shall use the same
resources is found as
2
N
h d 2 d pexd 2(ds )
n =1 ex ( s , n )
*
s arg max d s log 1 + N
=
. (4)
2 i 2d
s
s
i 2d
2
i =1 hex (i , n ) pex (i ) + Ns
is
1.2
N =2
S
N =4
Nr : 3 , Nn rdtrd rodbsrtl
1
Nr : 1 , Nn rdtrd rodbsrtl
0.8
0.6
0.4
Nn rds, Nn rdtrd rodbsrtl
0.2
0
-50
-40
-30
-20
-10
10
20
D2D Transmit power (dBm)
Figure 2: spectral efficiency of the proposed scheme
3. Numerical results
2.3 Optimal power allocation
An optimal power allocation problem of the D2D
link can be expressed as
2
N s* N
hexd 2(sd, n ) pex ( s , n )
Maximize log 2 1 +
2
N
=
s 1=
n 1
ii =s1s* hexi 2(di ,n ) pex (i ,n ) + s 2
hshd 2( sd, n ) psh ( s , n )

,
+ log 2 1 +
2
cd
cue
2
+
h
p
s
sh ( s , n )
sh ( s , n )
s. t.
p
n =1
ex ( s , n )
+ psh ( s , n ) Pmax , p[ ex , sh ]( s , n ) 0,
sh ( s , n )
s .
p
n =1
Figure 1 presents the spectral efficiency per cell for

the proposed scheme. Parameters used in the
simulation are listed in Table 2. The parameter Ns
denotes the number of D2D users that use the same EX
subchannels. The dotted curves correspond to the case
where D2D users use only EX resources, whereas the
solid curves correspond to the case where D2D users
use SH resources as well as EX resources. We can
observe significant gains due to reuse between cellular
and D2D users and due to reused between D2D users.
(5)
4. Conclusion
We have proposed an optimal power and resource
allocation scheme for D2D communications that
maximizes the spectral efficiency by using both
exclusive and shared resources. Numerical results have
been presented to validate the performance of the
proposed scheme.
The solution of this problem can be computed as

+
2
N
ii =1s hexi 2(di , n ) pexi 2(di ) + s 2

1
1
,
2
2
N s*
i 2d
hexd 2(sd, n )
ln 2 i =1 Cex (i , n ) hex (i , n ) + ls
is
s*
Pex* ( s , n )
z =s*1 R( pex , psh )

N
where
N s*
i =1
is
Cex (i , n ) hexi 2(di , n ) =
zs
2
cd
cue
2
1
hsh ( s , n ) psh ( s , n ) + s
1
*
=
Psh ( s , n )
2
ln 2 ls + us
hshd 2( sd, n )
References
, (6)
pex
[1]
(7)
[2]
An algorithm that computes (6) and (7) is given in

Table 1.
- 55 -
G.-M. Kang and O.-S. Shin, Mode selection and resource

allocation for device-to-device communications in cellular
networks, Information, vol. 17, no. 6(A), pp. 2423-2436, June
2014.
K. Kim, Y. Han, and S. Kim, Joint subcarrier and power
allocation in uplink OFDMA systems, IEEE Commun. Lett.,
vol. 9, no. 6, June 2005.
TO-2-4-3
Polling MAC Scheme for Wireless Passive Sensor Networks

Phil-Seong Ghang(1), Insoo Jun(2), Heewon Seo(3), Jin Kyung Park(3), Cheon Won Choi(3)
Alcatel-Lucent, U.S.A.(1), Jet Propulsion Laboratory, U.S.A.(2), Dankook University, Korea(3)
cchoi@dku.edu
sink node. In section 3, we evaluate the throughput

performance of the proposed MAC scheme by use of a
simulation method.
Abstract
A wireless passive sensor network is a network of
sensor nodes which operate while consuming RF
energy transferred by external RF sources.
Theoretically, abundant energy can be continuously
transferred to a sensor node. In practice, however,
energy is scarce if the sensor node is apart from the
RF source by only a few tens of meters. Perceiving
such a scarcity of energy, we propose a polling MAC
scheme in which a directional antenna cyclically
radiates RF waves in many directions - for sensor
nodes to deliver packets to a sink node. Simulation
results show that there is an optimal radiating time
which maximizes the network-wide throughput.
2. Polling MAC Scheme

Consider a wireless passive sensor network in which
a single sink node is co-located with an RF source and
sensor nodes are scattered around the sink node.
Intending to enlarge the coverage of the network and
achieve a certain level of throughput as well, we
propose a polling-based MAC scheme for sensor nodes
to deliver packets to the sink node. The behavior of the
proposed MAC scheme is as follows:
(1) The RF source changes the direction of the
directional antenna by a prescribed angle.
(2) Using the directional antenna, the RF source
radiates RF waves for a prescribed period.
(3) A sensor node, if it detects RF waves radiated by
the RF source, charges internal capacitors with
converting RF energy to direct current (DC).
(4) As the radiating period to given direction is over,
the RF source changes again the direction of the
directional antenna by a prescribed angle and radiates
RF waves for the prescribed period.
(5) As the radiating period is finished, the sensor
node collects raw data and encapsulates them into a
packet.
(6) The sensor node takes a random backing-off
time.
(7) The sensor node transmits the packet to the sink
node.
Keywords: wireless passive sensor networks, scarcity

of energy, polling MAC, throughput
1. Introduction
sensor nodes which operate while consuming radio
frequency (RF) energy transferred by external RF
sources [1]. Theoretically, abundant energy can be
continuously transferred to a sensor node. In practice,
however, energy is scarce if the sensor node is apart
from the RF source by only a few tens of meters [2].
For example, suppose that a sensor node stands 10 m
away from an RF source. Also, assume that sensor
node and RF source are equipped with omni-directional
antennas with 8 dBi and 15 dBi gains, respectively [1].
Then, the Friis transmission equation says only 0.79
mW to be induced on the sensor nodes antenna.
Perceiving such a scarcity of energy, we propose a
polling medium access control (MAC) scheme [3] in
which a directional antenna cyclically radiates RF
waves in many directions - for sensor nodes to deliver
packets to a sink node.
In section 2, we propose and describe a polling
MAC scheme for sensor nodes to deliver packets to a
3. Performance
To investigate the performance of the proposed
MAC scheme, we use a simulation method. The
following is the simulation environment:
(1) Time is slotted.
(2) The beam width of the directional antenna at the
RF source is 30. The RF source cyclically radiates RF
- 56 -
ICEIC 2015
waves at each of 12 directions for an integer-multiple
of slots (denoted by ).
(3) It takes 2 slots for a sensor node to collect raw
data and encapsulate them into a packet.
(4) The backing-off time is uniformly distributed in
.
(5) A packet transmitted by a sensor node
experiences a path loss, which is modeled as
the RF source or the capacitance of the internal

capacitor.
References
[1] O. Akan, M. Isik and B. Baykal, Wireless Passive
Sensor Networks, IEEE Communications Magazine, vol. 47,
no. 8, pp. 92-99, August 2009.
[2] C. Mikeka and H. Arai, Design Issues in Radio
Frequency Energy Harvesting System, A Sustainable
Energy Harvesting Technologies Past, Present, Future,
InTech, 2011.
where is the power received by the sink node, is

the power radiated by the sensor node, is path loss
constant, is the reference distance, is the distance
between sink and sensor nodes, and is the path loss
exponent. The path loss exponent is set to 2.
(6) The sink node correctly receives a packet if the
signal-to-interference ratio (SIR) is higher than or
equal to a threshold.
[3] H. Takagi, Queueing Analysis of Polling Models, ACM

Computing Surveys, vol. 20, no. 1, pp. 5-28, March 1988.
Figure 1: Throughput vs. radiating time.

Figure 1 shows the network-wide throughput with
respect to the radiating time. In this figure, we observe
that there is a non-trivial value of radiating time which
maximizes the throughput. Such a phenomenon results
from the throughput trade-off caused by a decrease in
collision probability and an increase in wasted resource
as the radiating time increases.
4. Conclusions
sensor nodes which operate while consuming RF
energy transferred by external RF sources. While
abundant energy can be continuously transferred to a
sensor node in theory, energy is scarce in practice.
Perceiving such a scarcity of energy, we propose a
polling MAC scheme. From simulation results, we
confirmed that the network-wide throughput can be
maximized by controlling either the power radiated by
- 57 -
TO-2-4-4
Effect of Pilot Contamination in Massive MIMO Systems

with Matched Filter and Zero-Forcing precoding over Rayleigh Channels
Jae-Hong Kwon, Ji-Ho Lee, Myeong-Jin Kim, and Young-Chai Ko
School of Electrical Engineering, Korea University
<hugokwon, arnoldjiho, smjkmj1004, koyc@korea.ac.kr>
Abstract
In this paper we provide the simulation results to see
the effect of pilot contamination using two different
precoding schemes such as matched filter and zeroforcing on the channel estimation in massive multiple
input multiple output (MIMO) systems, which are
regarded as one of very promising enabling
technologies for the 5th generation cellular systems. In
particular, we consider the multi-cell environment and
the interfering users located at the worst distance, that
is, at the cell edge, to see the intuitive effect of
performance degradation. We can see from our
simulations that the pilot contamination is non
negligible and needs to be overcome for massive MIMO
to be deployed.
Fig.1 Cellular model with adjacent 6 cells. Each base stations (BS) is equipped
with massive number of antennas.
Keywords: Massive MIMO, pilot contamination,

matched filter, and zero forcing.
1. Introduction
Massive multiple input multiple output (MIMO) is
considered to be one of very promising scheme for the
next generation, so called, 5G, cellular systems. There
are many benefits in massive MIMO. It increases
spectral efficiency to meet the demand of high data rate
for the 5G cellular service although the user has single
antenna. Moreover massive MIMO provides high
energy efficiency compared to many other cellcooperative technologies [1]. Note that the network
energy consumption has been one of main design issues
for the future wireless systems due to the interest in
energy saving, and massive MIMO has been shown to
increase the network energy efficiency. In addition,
using massive number of antennas generates the quasiorthogonal channels among users which makes the
simple matched filter precoding possible [2].
However, using many antennas needs the same
number of orthogonal pilot signal as the number of
antennas and thus the orthogonality among the users in
different cells is not guaranteed which is called pilot
contamination.
In [3], the pilot contamination is the main limiting
factor on the performance and needs to be overcome for
massive MIMO to be deployed. In this paper, we study
the effect of pilot contamination on channel estimation
by simulations using two different precoding schemes
such as matched filter (MF) and zero forcing (ZF).
In particular, we consider that users who have the same

pilot signal are located at the cell edge to see the
performance degradation in the worst case like Fig.1.
2. System and Signal Models

The cellular model that we consider is depicted in
Fig.1, where we assume a cellular system with
frequency reuse factor one. Since massive MIMO is
employed, we also assume that the macro-cell with the
radius of 5km and the large number of array antennas is
located at the center of hexagonal cell. For co-channel
interference we only consider one tier of cluster which
is practical due to the macro-cell assumption. As such
there are 6 surrounding co-channel cells around a
serving cell of a certain user, , and in each adjacent
cells there is one user using the same pilot signal and
thus the orthogonality among pilot signals is not kept.
Then, the received pilot signal at the over the
uplink channel is given as

(1)

where is the large-scale fading with the path loss
exponent, For simplification, we assume that a
distance between BS and the users , , is set to
2.5km and the other users are located in the cell edge
(d=5km). Throughout this paper, all users have 2
antennas so that where is
- 58 -
ICEIC 2015
Fig.2 the precoding leakage on PC with MF. N is the number of users who
has same pilot with desired user, Path loss exponent is 3.
Fig.3 the precoding leakage on PC with MF, ZF, and MF without PC.
3.
the small scale fading vector from the -th users -th
antenna to the is the channel matrix from -th user
to the . is the pilot sequence matrix. is the
noise vector with SNR = 10dB fixed.
2.1 Matched filter precoding

Under the assumption of perfect channel estimation
(PCE) in (1), MF precoding matrix, , is given by

(2)
However, due to the channel estimation error by pilot
contamination (PC), MF precoding matrix with PC,
, can be expressed as

(3)

where is the estimated channel matrix of with PC

in the j-th BS.
2.2 Zero-forcing precoding

ZF precoding matrix with PCE, , is described as

(4)
whereas ZF precoding matrix with PC, , is

represented as

(5)
2.3 Imperfection of the precoding matrix

In a ideal PCE case, we notice that

and
(6)
where is the number of BS antennas, since the

Massive MIMO has a property of quasi-orthogonality.
But, with PC case, (6) is no longer valid. Therefore, to
evaluate the imperfect precoding matrix due to the
channel estimation error, we consider the following
metrics which are given by

(7)

which are defined as the precoding leakage.
(8)
3. Simulation Results
In this section, we present simulation results to validate
the precoding leakage of MF and ZF precodings. Fig.2
shows that the growth of the number of PC causes a
degradation of performance. In Fig.3, assuming that 2
surrounding co-channel cells have the same pilots
(N=2), we show the performance of MF without PC, MF
with PC, and ZF with PC. The number of BS antennas,
, is varied from 10 to 250. It can be observed in Fig.2
that the performance of MF is near-optimal to ZF and is
improved as the number of BS antennas increases.
Futhermore, when , the performance of MF is
superior to ZF since (5) is more affected by PC than (3).
We recognize that, in Massive MIMO system ,the
pilot contamination is non-negligible since the
probability of destroying the orthogonality among pilot
signals increases with the number of BS antennas.
4. Conclusions
In this work, we investigated the effect of pilot
contamination in massive MIMO. We considered
matched filter and zero-forcing precodings to see the
effect of pilot contamination. From the simulation
results, we verified that the pilot contamination
deteriorates the system performance. Therefore, it
seems necessary to find a method of eliminating the
pilot contamination.
ACKNOWLDEGEMENT
This work was supported by the Basic Science
Research program through the National Research
Foundation of Korea (NPF) funded by the Ministry of
Education, Science and Technology under Grant NRF2012R1A1A2004494.
References
[1] H.Q. Ngo, E.G. Larsson and T. L. Marzetta, "Energy and
Spectral Efficiency of Very Large Multiuser MIMO Systems,"
IEEE Trans. Comm.., vol.61, no. 4, pp. 1436-1449,April 2013
[2] J. Hoydis, S. T. Brink, and M. Debbah, Massive MIMO
in UL/DL of Cellular Networks: How Many Antennas Do We
Need?, IEEE J. Sel. Areas. Comm., vol. 31, o 2, pp. 160-171,
Feb.2013
[3] T. L. Marzetta, "Noncooperative cellular wireless with
unlimited numbers of base station antennas," IEEE Trans.
Wireless Comm., vol.9, no. 11, pp. 3590-3600, Nov.2010
- 59 -
ICEIC 2015

Oral Session
TO-2-5
Emerging Technologies
TO-2-5-1
Removing Motion Artifact of Bio-Impedance Heart Rate Measurement System

Using Independent Component Analysis (ICA)
1,2,3
J. Alexander Bae1, Yookwang Kim2, and SeongHwan Cho3

Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST)
KAIST 291 Daehak-ro, Yuseong-gu, Daejeon, Republic of Korea
1
alexbae93@kaist.ac.kr
3
chosta@kaist.ac.kr
Abstract
Bio-impedance measurement (BIM) is a promising

technique to measure heart rate but it is extremely susceptible
to motion artifact. In this study, removing certain motion
artifact by independent component analysis (ICA) is suggested.
By processing ICA with two signals acquired from front and
back of the wrist, heart rate signal was recovered from mixed
signal. Identical number of peaks, heart beats, with PPG
reference signal could be detected in the distorted signal with
motion artifact.
Keywords Bio-impedance, Heart rate, Motion artifact,
Removing artifact, ICA, Peak, PPG
I. INTRODUCTION
motion like moving fingers. In order to compensate this

drawback, independent component analysis (ICA) is proposed
as a solution to remove certain motion artifact, grip and release,
of the system. In this study, bio-impedance signal is acquired
from two different points, front and back of the wrist and
separates the heart rate signal from mixed signal with motion
noise using independent component analysis.
II. METHODOLOGY
A. Implementation
Bio-impedance measurement (BIM) system suggested in
[3,5] was used in this experiment. Since we need to acquire
heart beat signal from two points in order to get rid of motion
artifact, we built two identical systems separately. However,
only one current source was used to flow current.
PPG (Reference)
According to World Health Organization, cardiovascular

diseases are primary causes of death causing more casualties
than any other diseases[1]. Therefore, cardiovascular disease is
a significant issue in healthcare industry. In order to prevent
cardiovascular diseases, continuous and accurate monitoring of
heart rate is the most basic step that needs to be done. Therefore,
there are many systems that measure heart rate information
which can explain several symptoms of heart diseases[2]. For
example, arrhythmia, abnormal beating of heart, can be easily
diagnosed by analyzing the heart rate of a patient. Moreover,
atherosclerosis can also be diagnosed by monitoring of heart
beat which can be crucial for preventing sudden heart attack[2].
Currently, various heart beat monitoring systems have been
developed. Electrocardiography (ECG) is an established
method that is being utilized in industry for a long time now.
Also, photoplethysmogram (PPG), an optical technique, is also
being used in the field[6]. These techniques are reliable systems
that are already proven and many signal processing techniques
have been suggested to complement these heart monitoring
systems. In addition to these systems, measuring heart rate by
bio-impedance measurement (BIM) is also proposed[3][5].
Unlike existing techniques, BIM system is very simple to
implement, cheap in cost, and a non-invasive technique.
Moreover, these qualities make this method attractive to
implement in mobile devices.
However, the greatest weak point of BIM method is that it
is extremely vulnerable to movement. If the subject stays still,
BIM method is stable and gives out correct data for heart rate.
Nevertheless, the signal is seriously distorted even with a minor
Front
Back
Fig. 1 Full experiment set-up with all 6 electrodes and PPG

sensor(left) / configuration of electrodes (right)
On the front side of the wrist, 4 electrodes, 2 for flowing
current and 2 for detecting variation of bio-impedance, were
placed analogous to regular bio-impedance measurement
system[3,5]. For this experiment, 2 additional electrodes for
detecting variation of bio-impedance were placed on the back
side of the wrist. Bio-impedance can be measured using current
on the front side so electrodes for flowing current are not
necessary on the back side. Consequently, total of 6 electrodes
were placed on the left wrist for this research (Fig. 1). The
signal was measured for 10 seconds with oscilloscope and
motion artifact was given by grip and release movement of left
hand. PPG method was used to acquire the reference signal
because it provides stable heart rate signal even with motion
artifact. For measuring PPG, Vascular Autonomic Nerve Scan
(VAS) from Intermed was used. PPG information was
measured with separate equipment so the reference signal and
- 61 -
ICEIC 2015
BIM signals were not measured on the same time axis.

Therefore, using real clock as the reference, the period when
BIM signals were acquired was recorded while measuring PPG
signal for 3~5 minutes. Then, the signal measured during the
recorded time was clipped out from the whole data.
B. Independent Component Analysis
Independent component analysis (ICA) use statistical latent
variables system. It uses below model to identify the signals[4].

Thus, set of signals can be expressed in vector form as below.

For ICA, is the only vector we know while no information is
given for and . The purpose of ICA is to estimate coefficient
matrix because independent component vector can be
acquired from this estimation[4].

When predicting , the non-gaussianity value is taken into
account to guess most accurately. It is known that the sum of
independent random variables is more gaussian than the single
independent random variable. Therefore, if the elements of
is estimated closely, the trend will be less gaussian than before.
Consequently, can be determined by maximizing the nongaussianity[4]. More detailed information of deciding nongaussianity can be found in [4].
Before heading into ICA technique, few pre-processing
steps need to be done. First of all, the data should be centered
at zero by subtracting the mean of the data set from each
element[4].

Next, sphering should be done in order to make the signals
uncorrelated[4]. These pre-processing steps make calculations
easier for actual ICA process.

For this research, BIM signals from front and back side of
the wrist were assumed to be composed of two identical
component, heart rate signal and motion. Following the ICA
model defined in [4], can be expressed as below.

Before processing through ICA, data centering, centered at
point 0, and sphering, making signals uncorrelated, need to be
done[4]. This was done via MATLAB. Then, fast ICA
estimation was taken into account for this research. ICA

by maximizing the
estimates coefficient matrix (

non-gaussianity[4]. Fast ICA package provided by Independent
Component Analysis (ICA) and Blind Source Separation (BSS)
Group of Aalto University was adopted for processing ICA.
and were analyzed through ICA because
this method gave most distinguishing outcomes.
C. Calibration
Electrodes on front and back side were not aligned
symmetrically so resulting peaks of two signals did not occur
at the same position. Therefore, we defined variable k to shift
to be in appropriate position to give out effective
outcome for ICA processing.
In addition, in most cases, except for trial 4, region without
motion artifact was marginal in magnitude so this region was
multiplied by proper constant to make its magnitude
commensurate with the magnitude of the part containing
motion artifact. To achieve this goal, threshold was set to detect
area where motion artifact is not added. Then, proper constant,
3 or 5 depending on the magnitude of the noisy part, was
multiplied. Nonetheless, the beginning and last part of section
with motion artifact can also be included in this threshold so
this part was reduced back to original magnitude afterwards.
For PPG reference signal, in order to see peaks more clearly,
PPG signal was converted to second derivative PPG (SDPPG).
As a result, peaks were more obvious than PPG signal which
made it more convenient to compare the location of peaks.
III. RESULTS
* Boxed area indicates the region with motion artifact.
1) Trial 1
Front
ICA
Back
Fig. 2 Raw BIM signals (left) and separated components
after ICA (right) Trial 1
Fig. 3 Calibrated output signal (above) with PPG reference

signal (below) Trial 1
- 62 -
ICEIC 2015
11 peaks were detected in the calibrated signal which is
exactly same with the number of peaks in PPG reference signal
(Fig. 3). 4 peaks that were vague in the raw signal due to motion
artifact were found. Spacing between peaks was matching with
the reference signal.
2) Trial 2
Front
ICA
Back

In Fig. 7, 11 peaks were found for both calibrated BIM
signal and reference signal. In this trial, 3 new peaks, peak 4, 5,
and 6, not shown in the raw signal were found in the calibrated
output signal. Peak 6 was slightly mismatching but other than
that, intervals between peaks were similar with intervals of the
reference signal.
4) Trial 4
Front
ICA
Back

11 peaks were detected in the output signal which matches
with the number of peaks in PPG reference signal (Fig. 5). As
it can be seen in the boxed area of Fig. 5, 3 peaks that were
hidden in the motion noise could be found as a result of ICA.
Peak 5 was slightly mismatching with the reference signal but
overall, peaks appeared in similar locations.

3) Trial 3
Front
ICA
Back

- 63 -
ICEIC 2015
In Fig. 9, 11 peaks were measured for both the output signal
and the reference signal. 3 peaks that were concealed in the
motion artifact could be detected. Peak 4 was slightly
mismatching but overall, peaks appeared in similar positions
with the reference signal.
Since PPG data was exported from separate apparatus, the

time axis did not perfectly match with BIM signal time axis so
each peaks position did not correspond ideally. Nevertheless,
the difference is negligible so it does not affect the validity of
the results.
IV. CONCLUSIONS
5) Trial 5
Front
ICA
Back
In this paper, removing motion artifact using independent

component analysis (ICA) is proposed. Two signals were
acquired from front and back of the wrist. Then, the subtraction
of two signals and signal from the front side of the wrist were
analyzed by ICA. Consequently, veiled peaks in the motion
noise were able to be found resulting in corresponding result
with the PPG reference signal. Same number of peaks appeared
for both output signal and PPG signal in similar locations. Even
though the new peaks found as a result of our research are not
distinctive like peaks in the unaffected region, this result has
proved the existence of peaks in the distorted signal due to
motion artifact. The number of peaks per unit time refers to
heart rate; thus, heart rate information can be gathered if peaks
can be detected correctly. In conclusion, certain motion artifact
was able to be removed by ICA analysis engendering
successful measurement of heart rate. Furthermore, since this
research only investigated limited motion artifact, grip and
release, solutions to other random motion artifacts need to be
studied.
ACKNOWLEDGMENT
This research was supported by the Basic Science Research
Program from the NRF of Korea funded by the Ministry of
Education (NRF-2013R1A2A1A01014872).
REFERENCES
Fig. 11 Calibrated output signal (above) with PPG
reference signal (below) Trial 5
As shown in Fig. 11, 10 peaks were found in this trial. The
number of peaks in two signals were identical like it was in
previous trials. 2 additional peaks were discovered in the output
signal. The intervals between peaks were same with the
intervals of the reference signal.
[1]
[2]
[3]
[4]
[5]
Total of 5 trials were held. As seen in the raw signal, grip

and release movement distorts the signal harshly that original
heart rate cannot be found. After processing through ICA, the
hidden peaks in the distorted signal could be detected. The
number of peaks of the output signal was identical with the
number of peaks of the PPG reference signal for all 5 trials.
However, one peak was slightly mismatching with the
reference signal in few cases. Overall, the intervals between
adjacent peaks were similar with the intervals of the reference
signal for all 5 trials. In the section where motion artifact was
given, the peaks were not clearly distinguishing like in the
section without motion artifact but new peaks that did not exist
in the original signal due to motion artifact clearly emerged in
the output signal.
[6]
- 64 -
"Cardiovascular Diseases (CVDs)." WHO. N.p., Mar. 2013. Web.

"What Is Cardiovascular Disease?" American Heart Association. N.p.,
28 Dec. 2011. Web.
M.-C. Cho, J.-Y. Kim, and S. Cho, A bio-impedance Measurement
System for Portable Monitoring of Heart Rate and Pulse Wave
Velocity Using Small Body Area, in IEEE International Symposium
on Circuits and Systems, May 2009, pp. 31063109.
Hyvrinen, A., and E. Oja. "Independent Component Analysis:
Algorithms and Applications." Neural Networks 13.4-5 (2000): 411-30.
Web.
W. Lee, and S.H. Cho, "An Integrated Pulse Wave Velocity Sensor
using
Bio-impedance
and Noise-shaped
Body
Channel
Communication," IEEE Symposium on VLSI Circuits, 2013.
Allen, John. "Photoplethysmography and its application in clinical
physiological measurement." Physiological measurement 28.3 (2007):
R1.
TO-2-5-2
(Na,K)NbO3-based Lead-Free Piezoelectric Ceramic for Renewable Energy

harvesters
Jinhwan Kim1, Jung-Hyuk Koh 1,

School of Electrical and Electronics Engineering, Chung-Ang University, Seoul,156-756,
Korea
kjh2203kjh@naver.com, jhkoh@cau.ac.kr
In this research, piezoelectric composites of NKN and
BNT were considered for the advanced piezoelectric
ceramics with higher piezoelectric constants and
electromechanical coupling coefficient. To apply
piezoelectric energy harvester applications, improved
piezoelectric materials and properties were inevitable.
0.97(Na0.5K0.5)NbO3-0.03(Bi0.5Na0.5)TiO3
(NKN-BNT)
ceramic has orthorhombic and tetragonal phase in room
temperature. As a result, if BNT can be added into NKN
ceramics, we can expect that NKN-BNT show the high
piezoelectric properties. For these reasons, small quantity
(3 mole %) of BNT was added into NKN for making leadfree piezoelectric ceramics. In this work, we will
investigate 0.97NKN-0.03BNT ceramics, focusing on the
influence of sintering temperature on their piezoelectric
properties for energy harvesting.
Abstract
Different types of energy harvesters have been
intensively investigated for the renewable energy
applications. Especially piezoelectric energy harvesters
have been attracted attentions for their versatile
applications and high reliability. Both of (Na0.5K0.5)NbO3
(NKN) and the (Bi0.5Na0.5)TiO3 (BNT) piezoelectric
material are representative of the lead-free piezoelectric
ceramics. In this work, the (0.97)(Na0.5K0.5)NbO30.03(Bi0.5Na0.5)TiO3 ceramics were prepared by varying
the sintering temperature to improve the its ceramics
characteristics by complementary each other for using the
energy harvesters. We expect that optimized sintering
temperature can improve the piezoelectric and
ferroelectric
properties
of
(0.97)(Na0.5K0.5)NbO30.03(Bi0.5Na0.5)TiO3 ceramics for energy harvesting.
2. Experimental
Keywords: Energy harverter, (Na0.5K0.5)NbO3 (NKN),

(Bi0.5Na0.5)TiO3 (BNT), Sintering temperature.
The 0.97NKN-0.03BNT ceramics were prepared using

conventional mixed oxide sintering process. Oxide and
carbonate powders of K2CO3(99.0 %), Na2CO3(99.0 %),
Bi2O3(99.9 %), Nb2O5(99.9 %) and TiO2(99.9 %) were
used as starting materials. Before weighing, these powders
were separately dried in an oven at 120 C for 24 hrs. The
weighed powders (K2CO3, Na2CO3, Nb2O5) according to
the chemical formula were milled for 24 hrs using ball
milling with zirconia ball and then calcined at 950 C for 2
hrs. Also. The weighed powders (Bi2O3, Na2CO3, TiO2)
were milled for 24 hrs using ball milling with zirconia ball
and then calcined at 800 C for 2 hrs. These powders were
ball milled again for 24 hrs, dried and pressed into disks 12
mm-diameter and 1mm in thickness under 294 MPa using a
poly vinyl alcohol (PVA) as a binder. After burning off
PVA (600 C, 1 hr) the pellets were sintered from 1080 to
1160 C for 2 hrs in air. The obtained specimens were cut
and polished. The samples were poled in 60 C silicon oil
by applying a DC electric eld of 3.5 kV/mm for 30 min.,
and the specimens were cooled to room temperature.
1. Introduction
Recently, many intensive researches have been
investigated on the lead-free perovskite piezoelectric
ceramics such as (Na0.5K0.5)NbO3 (NKN) and
(Bi0.5Na0.5)TiO3 (BNT) materials due to their relatively
high piezoelectric and ferroelectric properties. NKN based
ceramics have been reported a piezoelectric constant (d33)
of 80 pC/N and a planar electromechanical coupling factor
(kp) of 40 %. BNT can be considered as one of the best
candidate among the additives for lead-free piezoelectric
ceramics because of its rhombohedral structure and similar
lattice parameters a = 3.98 with high ferroelectric
properties, Curie temperature (320 oC), and a relatively
large remnant polarization of 38 C/cm2 at room
temperature.
- 65 -
ICEIC 2015
3. Results and Discussion

50
0.8
Power (nW)
NKN-BNT
Pure NKN
0.7
Capacitance (nF)
NKN-BNT at 700N, 1Hz

Pure NKN at 700N, 1Hz
NKN-BNT
pure NKN
0.6
0.5
3.0
2.5
40
2.0
30
1.5
20
1.0
10
0.5
0.4
0
0.3
1080
1100
1120
1140
1120
1140
1160
0.0
Figure 2. Generated powers and load impedances of the

0.97(Na0.5K0.5)NbO3-0.03(Bi0.5Na0.5)TiO3
ceramics
sintered at various temperatures and the pure
(Na0.5K0.5)NbO3 sintered at 1100 C.
Figure 1. Capacitance of the 0.97(Na0.5K0.5)NbO30.03(Bi0.5Na0.5)TiO3 ceramics sintered at various

temperatures and the pure (Na0.5K0.5)NbO3 sintered at
1100 C.
E = 1/2CV2
(1)
(C : the capacitance, V : the generated output voltage) The
measured generated output power value of the 0.97NKN0.03BNT sintered at 1140 C was about 37.91 nW.
According to the maximum power transfer theorem, the
maximum power delivered to a load by a source is attained
when the load impedance is equal to the Tehevenin
resistance of the source [3]. So, as the load impedance is
lower, the generated output power is higher.
Figure 1 showed the capacitance of the NKN- BNT

sintered at various temperatures and pure NKN. At the
sintering temperature of 1140 C, the measured
capacitance value was 0.65 nF that was the highest value
among the specimens. While, the pure NKN showed the
lowest capacitance value of 0.3 nF. That is because the
relative dielectric constant of the NKN-BNT is higher than
the pure NKN[1].
4. Conclusion
Table 1: Output voltage of the 0.97(Na0.5K0.5)NbO30.03(Bi0.5Na0.5)TiO3 ceramics sintered at various

temperatures
Sintering Temperature ( C)
1080 oC
1100 oC
1120 oC
1140 oC
1160 oC
1100
Sintering Temperature (oC)
1160
Sintering Temperature (oC)
1080
Load Impedance (G)
60
In summary, 0.97NKN-0.03BNT ceramics were

prepared by different sintering temperatures from 1080 to
1160 C. The measured generated maximum output power
values of the 0.97NKN-0.03BNT sintered at 1140 C was
approximately 37.91 nW. Due to these outstanding energy
harvesters, lead-free 0.97NKN-0.03BNT piezoelectric
ceramics can be used as an alternative lead free
piezoelectric material.
Voltage (V)
2.95
3.33
8.38
10.80
4.16
The output voltage of the 0.97NKN-0.03BNT sintered

from 1080 to 1160 oC and pure NKN were shown in table
1. The output voltage was increased as the sintering
temperature increased up to 1140 C. The external
compression force was 650 N that applied by the frequency
of 1 Hz. The measured output voltage of the 0.97NKN0.03BNT sintered at 1140 C was 10.80 V that was higher
than the output voltage value of the pure NKN.
[1] H. Du, W. Zhou, D. Zhu, L. Fa, S. Qu, Y. Li, and Z. Pei,

Sintering Characteristic, Microstructure, and Dielectric Relaxor
Behavior
of
(K0.5Na0.5)NbO3-(Bi0.5Na0.5)TiO3
Lead-Free
Ceramics, J. Am. Ceram. Soc. 91 [9], pp. 2903-2909, July 2008.
Figure 2 showed generated powers and load impedances

of the NKN-BNT and the pure NKN. The generated power
of the NKN-BNT increased as the sintering temperature
increased up to 1140 C. The total generated energy can be
calculated as [2]:
[3] R. C. Dorf and J. A. Svoboda, Introduction to Electric

circuits, 7th ed, John Wiley & Sons, Inc., pp. 174-179, 2006.
References
[2] C. J. Mistral, S. Basrour, and J. J. Chaillout, Comparison of

electroactive polymers for energy scavenging applications,
Smart Mater. Struct. 19, pp. 085012-085026, July 2010.
- 66 -
TO-2-5-3
Biometric Data Store Methodology suitable for Mobile Device

Nakhyun Kim, Jaesung Kim, Haeryoung Park, MoonSeog Jun
Korea Internet & Security Agency, Soong-sil University
{knh, jskim, hrpark}@kisa.or.kr, mjun@ssu.ac.kr
functionality and describe security vulnerabilities for
each method in Section 3. In Section 4, we propose
secure biometric data store methodologies to
countermeasure and analyze those methodologies
security in Section 5. Finally, we conclude this work in
Section 6.
Abstract
Recently,
biometric
based
identification/
authentication has begun to receive attention due to
its convenience and this trend stands out in mobile
environment. However, biometric based identification
/authentication has characteristics that biometric data
cannot be renewed, so that data should be stored and
managed through secure manners. In this paper, we
examine architecture of biometric matching system and
analyze vulnerabilities which can be occurred. On the
basis of this, we describe secure biometric data store
methodologies to store and manage biometric data
securely.
2. Architecture of biometric matching

system
The size of the manuscript must be Letter or A4 and
it should be typed in two columns with single spacing.
The following margins are recommended.
The architecture of biometric matching system
which is described in ISO/IEC 24787(Identification
cards On-card biometric comparison) falls into fourcategories,
off-card
/on-card/work-sharing
oncard/system-on-card
comparison,
according
to
configuration of its components(capture, processing,
comparison, storage, decision, authorization)[1].
Off-card comparison means the biometric
Keywords: Mobile Biometric, Vulnerabilities
1. Introduction
Traditional identification/authentication is based on
something you know such as password mainly. Besides
this method, something you have(e.g., drivers license,
passport), something you are(e.g., biometric) also can
be used to identify/authenticate users identity. Among
these mechanisms, for convenience, biometric based
identification/authentication method have been
received attention. Recently, biometric based method
begin to make a mark in mobile environment.
There are many characteristics for each measure, but
one of the most difference is that biometric data cannot
be renewed when that data is leaked or stolen unlike
password or passport, etc. For this reason, biometric
data should be stored and managed securely more than
the other measures. Especially, it is the subject of
intensive consideration which store and manage
biometric data in mobile device because mobile device
is easy to lose due to its small size.
The remainder of this paper is organized as follows:
In section 2, we examine architecture of biometric
matching system which is categorized in four methods
according to allocating the biometric matching
Figure 1 Architecture for off-card comparison

verification is performed on the biometric verification
system side. The card acts as a storage device to store
the biometric reference(s) of the user. Figure 1
provides a schematic of the various process steps.
To perform verification, the biometric verification
system will obtain access to the ICC and read the user's
biometric reference. The role of the biometric
- 67 -
ICEIC 2015
In order to protect the communication between the
biometric verification system and the card, a secure and
trusted channel is recommended (using Secure
Messaging according to ISO/IEC 7816 and
mechanisms defined by ISO/IEC 24761 for distributed
comparison verification).
Work-sharing on-card comparison is similar to oncard comparison except for the comparison procedure.
The process is schematically represented in Figure 3.
This type of comparison is designed for an ICC that
does not have sufficient processing capability to
execute the biometric data comparison. In this case,
certain activities that are computationally intensive, for
example, a mathematical transformation, are sent to the
biometric verification system to perform the calculation.
The result of the computation is sent back to the ICC so
that the final determination of the matching score is
calculated on the card. During the pre-comparison
calculation, communication takes place between the
card and the biometric verification system. A secure
and trusted channel is used to protect the
communication between the terminal and the card
unless the need for such protection is explicitly not
required for a particular operational environment. The
final comparison shall be performed in the card.
verification system is to capture the biometric sample

and to perform biometric verification. If the biometric
verification is successful, the biometric verification
system will change its security status. This may include
downloading further information from the card for a
subsequent transaction. If unsuccessful, further access
will be denied.
Cryptography is usually used to mutually
authenticate the card and the biometric verification
system. To protect the communication between the
biometric verification system and the card, a secure
channel should be established prior to the transfer of
any template or data.
Figure 2 Architecture for on-card comparison
On-card comparison means the biometric sample

verification is performed in the card. The process is
schematically represented in Figure 2. The ICC CPU
should have sufficient processing power to perform the
matching. The enrolment process is the same as or
similar to that for off-card matching.
To perform on-card comparison, the biometric
verification system captures the biometric sample and
extracts biometric data. The created biometric data is
then uploaded to the card for verification. The
verification process is executed on-card. If the
biometric verification is successful the cards security
state is updated and an appropriate signal sent to the
back-end system.
Figure 4 Architecture for system-on-card

comparison
System-on-card comparison means the whole

biometric sample verification process is performed on
the card. The process is schematically represented in
Figure 4. To perform sensor-on-card comparison, a
sensor that is built into the card captures the biometric
sample and extracts biometric data. The created
biometric data is then used for verification. The
verification process is executed on-card. The cards
security state is updated once the card finishes the
verification. No biometric sample or reference data is
transferred to or from the card.
Figure 3 Architecture for work-sharing on-card
comparison
- 68 -
ICEIC 2015
Therefore, biometric data should be stored and
managed securely in mobile environment.
Table 1 Comparison with biometric matching

system
Off-card
External to ICC
Capture, Processing,
Comparison,
Decision,
Authorization
On-card
Capture, Processing
Worksharing
Comparison
Systemon-card
Internal to ICC
3. Security vulnerabilities in biometric

system
Reference Data
Various vulnerabilities exits in biometric system and

these vulnerabilities can be classified under ten heads
as shown in figure 5[2].
These vulnerabilities can be grouped in direct and
indirect attack as flows.
Comparison,
Reference data,
Decision,
Authorization
Comparison,
Reference data,
Decision,
Authorization
Comparison,
Reference data,
Decision,
Authorization
Table 2 Threat of biometric system

Threat
No.
T1
T2
T3
T4
Table 1 shows categorization of the above

architecture for biometric matching system according
to belonging component.
Among the above four-categories, except for
system-on-card comparison, data capture is performed
on the outside of IC Card and, in off-card and worksharing on-card comparison, comparison operation is
also performed on the outside of IC Card. Because data
capture or/and comparison operation is performed on
the outside of IC Card, it has possibilities that
biometric data can be leaked to outward during data
transmission.
Biometric data cannot be canceled or reissued, so
leaking biometric data to outward has effect on users
T5
T6
T7
T8
T9
T10
Description of attack point

Attack on the biometric input device
Attack of the raw biometric data is to be
transmitted
Attack on the signal processing
Attack of the extracted biometric template is
transferred to the Comparison Entity
Attack on the Comparison Entity
Attack on the biometric Storage Entity
Attack of the stored biometric template is
transferred to the Comparison Entity
Attack of the determination result is sent to
the application system
Attack of the determination result is sent to
Decision Entity from Comparison Entity
Attack on the Decision Entity
Table 3 Vulnerabilities of biometric system

Threat
No.
T1
T2
Figure 5 Vulnerabilities of biometric system
privacy seriously. Especially, mobile device is handheld size and easy to lose so that the possibility of
biometric data leakage is higher than any other device.
T3
- 69 -
Vulnerabilities
- Manipulated biometric data that can be
entered through an unauthorized device
- Can be forged input biometric data
- Can be acquired due to the malfunction of
the device is incorrect biometric data
- Manipulated by the attacker or interrupted
during transmission in the signal processing
step of raw biometric data can be used for
illegal purposes
- Raw biometric data can be damaged, it may
be a transmission error unintentional reasons
of aging of the device, aging of the
transmission line.
- Acquiring equipment despite having a realtime detection function, inputted real-time
data can be intercepted during a transmission
and may be replaced by forged biometric
ICEIC 2015
data. Forged biometric data to be inputted to
the signal processing stage
- Degrade the performance due to the low
quality of Acquired raw data
- If does not delete the captured data, the data
can be leaked and illegally stored and used by
an attacker
- An attacker can be intercept biometric data
during a transmission, and it can be changed
and used for illegal purposes
T4
- Can be damaged due to transmission errors
of the unit on the unintended processing
biometric data
- If the changed biometric template, occurs an
incorrect comparison
T5
- Use of the leaked biometric template in the
comparison process, will be successful
comparison
- Exposure by the storage device trespass can
be leaked destruction, and loss
- If not encrypted biometric data, which can
T6
be exploited by an external attacker
- Biometric templates cant be erased
completely
- The processed biometric data may be
intercepted for the purpose of illegal use or
changed by an external attacker when it is sent
T7
to the comparing step
- Biometric data may be damaged due to
unintentional transmission errors
- Transmitted from the decision step results
may be modified or intercepted during
transmission in the decision step by the
T8
external malicious party
- Transmitted from the decision step results
can be damaged due to unintentional
transmission error
- May be replaced or intercepted by the
malicious attacker during the transfer to the
value of the comparison result from the
T9
comparison step
- The comparison results from the comparison
step can be damaged due to unintentional
transmission errors
- The threshold value of decision step can be
T10
changed by malicious attacker
Among these vulnerabilities, we focus on
vulnerabilities related to capture and storage in this
paper. For example, leakage for the reference data,
leakage templates through the loss of mobile device
correspond to those vulnerabilities. To store and
manage biometric data securely in mobile environment,
proper countermeasures should be established.
4. Biometric data store methodologies for

mobile device
In this section, we describe biometric data store
methodologies for mobile device. Methodologies can
be divided into 2 categorized.
The first way to store data securely is based on
encryption method. By encrypting biometric data,
biometric data can be stored securely in any storage
medium. However, most of the mobile device use flash
memory based storage and storing/managing method
suitable for flash memory should be considered
because flash memory has its specific characteristics
that an erase operation can be performed about
104~106 times on each block[3]. [4] has proposed a
secure deletion method for flash memory which cannot
recover the deleted data. By using this method, even
though user lose his mobile device that biometric data
is stored, he can delete his biometric data securely so
that third party which acquired the lost device cannot
acquire owners biometric data. Although third party
try to recover the deleted biometric data, he cannot
recover the deleted biometric data because that data is
deleted securely. However, there are also some
disadvantages related to key management. For example,
if user encrypt his biometric data, the encrypted
biometric data is stored on storage medium securely,
but encryption key should also be managed like the
below.
Encrypts the encryption key
Stores the encryption key in secure area
First method is encrypting the encryption key.
Windows
DAPI(Data
Protection
API)[5],
EFS(Encrypting File Systems)[6] is similar to the first
method. Through this method, encrypted key is stored
at any area, but it has similar problem which is
mentioned the above. In other words, another key
management also needs for encryption key.
The second way is storing biometric data in secure
area such as SE(Secure Element)[7]. Access to data
stored in SE is limited so that only authorized programs
and applications can access the SE. Furthermore, by
adopting MoC(Match-on-Card), comparison with
biometric data is performed within media and security
of the stored data can be more enhanced. In [9], the
author developed mobile biometric system which stores
critical information(e.g. biometric data) on SE area
included in microSD and comparison is performed
within micro SD. Therefore, the proposed system[9]
- 70 -
ICEIC 2015
[2] J. G. Herrero, Vulnerabilities and Attack Protection in
Security Systems based on Biometric Recognition,
Universidad de Cantabria, 2009.
can prevent data or algorithms from leaking to the

other and secure biometric service can be provided.
5. Security analysis
[3] M. Breeuwsma, M. de Jongh, C. Klaver, R. van der

Knijff, and M. Roeloffs, Forensic data recovery from flash
memory, Small Scale Digital Device Forensics Journal, Vol.
1, pp. 1-17, 2007
Encryption based method has advantages such as

interoperability and storing in secure area method dont
need to manage encryption/decryption key. However,
each method has its disadvantage as below.
Table 1 Security analysis of each store methodology
Advantages
Encryption
based
method
- can use any

storage
mediums
Secure area
based
method
- do not need
key management
performed
comparison
within medium
Disadvantages
need
key
management
- need an additional
operation(such
as
encryption/decrypti
on)
- need a specific
medium
which
supports SE
[4] B. H. Lee, K. H. Son, D. H Won and S. J. Kim, Secure

Data Deletion for USB Flash Memory, Journal of
Information Science and Engineering, Vol. 27, No. 3, pp.
933-952, May, 2011.
[5]
NAI
Labs,
Windows
data
protection,
http://msdn.microsoft.comen-us/library/ms995355.aspx,
2001.
[6] Best Practices for the Encrypting File System,
http://support.microsoft.com/kb/223316/EN-US/, 2009.
[7] GlobalPlatform, GlobalPlatform Card Secure Element
Configuration v1.0, October, 2012.
[8] J. Nilsson and M. Harris, Match-on-Card for Java
Cards, Precise Biometrics, 2004
[9] Y. W. Ju and B. H. Lee, The Implementation of Secure
Mobile Biometric System, International Journal of BioScience and Bio-Technology, Vol. 5, No. 4, pp. 53-59,
August, 2013.
6. Conclusions
As increasing the usage of mobile device, mobile
biometric system that biometric technology is applied
to mobile device also attracts public attention.
However, biometric data cannot be renewed when that
data is leaked or stolen unlike password based or token
based authentication. Especially it is the subject of
intensive consideration which store and manage
biometric data in mobile device because mobile device
is easy to lose due to its small size.
To address these problems, we examine architecture
of biometric matching system and describe security
vulnerabilities. On the basis of these description, we
describe secure biometric data store methodologies to
countermeasure and analyze those methodologies
security.
[10] ITU-T, A guideline to technical and operational

countermeasures for telebiometric applications using mobile
devices(X.tam), ITU-T SG17 Q.9, Fifth draft 2014.
7. Acknowledgements
This research was supported by the ICT
Standardization program of MISP(The Ministry of
Science, ICT & Future Planning)
References
[1] ISO/IEC, Identification cards On-card biometric
comparison, ISO/IEC JTC1 SC17, 2010.
- 71 -
TO-2-5-4
Synthetic Generation of Hourly Solar Irradiance

Using a Multi-State Markov Model
Vinay Chamola and Biplab Sikdar
Department of Electrical and Computer Engineering
National University of Singapore, Singapore
AbstractSolar irradiance data is a key factor in dimensioning
photovoltaic (PV) panel size and energy storage for solar powered
systems. Unfortunately, long term solar irradiance data is not
available for many locations, thereby affecting the accuracy
and effectiveness of dimensioning efforts. To address this issue,
this paper presents a model for generating accurate, synthetic
traces of arbitrary length for hourly solar irradiance. The
proposed model is based on an approach that combines daily
correlations in weather conditions affecting the solar irradiance
with finer-grained, hourly transitions in solar irradiance levels.
The proposed model has been evaluated by comparing various
statistical parameters of hourly solar irradiance against real data.
I. I NTRODUCTION
With the increase in global carbon emissions and the
increasing awareness of government agencies and industries,
green energy solutions have emerged as a viable solution and
active area of research in many domains such as transportation,
communications, electrification etc. The primary objectives
of solar powered systems are to either provide electricity
based services in areas without grid power or to reduce the
dependence on traditional energy sources and their associated
environmental impact. Solar energy based systems are further
motivated by the increasing prices of conventional energy
sources and sharp decreases in the prices of PV panels
for harvesting solar energy. The greater popularity of solar
energy is also because it is more readily available than other
renewable resources, is more reliable and designing systems
based on it is simpler as compared to others. For example,
90% of the cellular base stations powered by green energy in
the world are powered by solar energy [1].
A solar powered system typically consists of solar panels (for harvesting solar energy), batteries (to store energy
for nights and weather periods), and an inverter (to covert
AC/DC). The problem of dimensioning such systems involves
estimating the required solar panel size and the number of
batteries in order to satisfy the systems operational requirements. Inaccuracies in the estimated dimensions may lead to
degraded or unacceptable performance as well as higher costs
[2]. Also, in the specific case of off-grid applications, any
errors in the estimation of the dimensions may cause very
unreliable performance and much higher outages than what
the system was designed for. A critical input that determines
the accuracy of the dimensioning results is the solar irradiance data. While historical long-term solar irradiance data is
available for certain places, such data is usually not available
for much of the developing world where the lack of reliable
grid power makes solar powered systems more important. To

address this issue, this paper develops a simple model for
generating synthetic, long-term traces of location-specific solar
irradiance.
Existing approaches to model the daily/hourly solar irradiance include Markov models [3], [4], autoregressive moving
average (ARMA) models [5] - [7], and models based on artificial neural network [8], [9]. The Markovian approach assumes
the solar irradiance at a given time (either day or hour) to
be dependent only on the solar irradiance at the last time
unit. Further, daily or hourly transition statistics are derived
to characterize the transition from one solar irradiance level
to other. The ARMA approach uses autocorrelation between
consecutive days to capture the nature of the solar radiation.
The artificial neural network method for characterizing solar
irradiance has been developed in the recent past [9]. However,
their applicability is for the prediction of solar irradiance based
on past observations, and they require long term solar data
for training. It has been shown that Markov models perform
better than ARMA models [10], [11]. While most Markov
models focus on daily irradiance levels, some models exist
for modeling the hourly solar irradiance [10]. However, they
lack accuracy since they do not consider the day to day
correlations in the solar irradiance. To address this issue, this
paper proposes a Markov model which captures the solar
irradiance characteristics both on an hourly as well as on a
daily scale.
This paper proposes a model to generate synthetic traces of
hourly solar irradiance values for any given site. The proposed
model is based on combining two Markov models. The first
model captures the day to day correlations in the weather that
affects the solar irradiance levels over a day. The second model
captures the hourly variations in the solar irradiance levels. The
proposed model only requires a years data for training and its
effectiveness is compared against real data for two different
locations. Our results show that the proposed model generates
solar irradiance traces that match real data in terms of multiple
statistical parameters.
It is to be noted that this paper uses the Global Horizontal
Irradiance (GHI) as the solar irradiance. GHI is the total
amount of solar irradiance received from above by a surface
which is horizontal to the ground. It includes both Direct
Normal Irradiance (DNI) and Diffuse Horizontal Irradiance
(DHI). DNI is the solar radiation that comes in a straight line
from the direction of the sun at its current position in the
- 72 -
ICEIC 2015
pgb
irradiance level. The overall state of the process representing

the solar irradiance at any hour is denoted by
x {1, 2, , 24}, y {1, 2, 3, 4}
(2)
where B and G correspond to bad and good weather days
respectively, x denotes the hour of the day and y denotes
the state of the solar irradiance in that hour. We denote the
expected value of the solar irradiance in each state by ESt and
it can be obtained by taking the average of the solar irradiance
in that particular state (using the empirical data). Examples of
the four states for each hour of good and bad weather days are
shown in Figures 2 and 3 respectively. The methodology for
determining the values of ESt and the other parameters used in
our model is described in Section II-A. It should be noted that
though one can use more than four states for characterizing
the solar irradiance in any hour of the day, our experimental
results show that there is only a marginal improvement in the
accuracy by including additional states. Thus the addition of
extra states at the cost of increased complexity is not justified.
St : St {Bx,y , Gx,y },
Good
Bad
pbb
pbg
Fig. 1. State diagram for transitions between good and bad days.
sky whereas DHI is the solar radiation that does not arrive
on a direct path from the sun, but has been scattered by the
molecules and particles in atmosphere and comes equally from
all directions [12].
The rest of the paper is organized as follows. Section II
presents the proposed model for generating solar irradiance
data. Section III presents the validation results while Section
IV concludes the paper.
II. P ROPOSED M ODEL
In this section we describe the proposed framework to
model the location-specific solar irradiance on an hourly basis.
The proposed model combines a Markov model for capturing
the day to day correlations in the weather patterns with
another model that captures the hourly variations in the solar
irradiance.
In existing literature, it has been shown that the solar irradiance levels for a given location are well modeled by a Markov
process [10]. In this paper, we refine the existing models to
propose a multi-state Markov model for characterizing the
solar irradiance. In the proposed model, we classify any given
day as either a bad or good weather day based on the
daily solar irradiance of that particular day. Intuitively one
can think of the sunny days to be good days and those with
clouds for a major portion of the day as bad days. From the
complete set of days, we then select % of the days as bad
days. Given a bad or a good day, the next day may be either
bad or good day. In order to capture occurrence of consecutive
bad or good weather days, we model this transition as a twostate Markov process. The transition probability matrix of this
Markov process is given by

pbb pbg
T=
(1)
pgb pgg
where pbb (resp. pgg ) is the probability of transition from a bad
day (good day) to a bad day (good day), and pbg = 1 pbb
(resp. pgb = 1pgg ) is the probability of transition from a bad
day (good day) to a good day (bad day). The state transitions
between the good and bad days are shown in Figure 1.
Now, in order to capture the hourly variations of the solar
irradiance, each hour is categorized into one of the four
possible categories. The four categories for bad and good days
are different and each category is characterized by its solar
Based on the Markovian assumption for the hourly solar

irradiance, the state of solar irradiance at a given hour depends
only on the state of solar irradiance in the previous hour and
the transition probability of going from the previous state to
the current state. This may be expressed as
P [St |St1 , St2 , ...S0 ] = P [St |St1 ].
(3)
Given that the solar irradiance is currently in a given state, the

state may transition to any of the four states in the next hour
(for both good and bad weather days). For a bad weather day,
the transition probability matrix can be given as
b(1,1)(1,1) b(1,1)(24,4)
..
..
..
(4)
B=
.
.
.
b(24,4)(1,1)
b(24,4)(24,4)
1
min/max
cutoffs
average
0.9
State 4
0.8
Solar irradiance (kW/m2)
pgg
0.7
State 3
0.6
0.5
State 2
0.4
0.3
State 1
0.2
0.1
0
0
10
12
14
16
18
20
22
Hour of the day
Fig. 2. An example of the demarcation of states and their expected solar

irradiance for good days.
- 73 -
ICEIC 2015
A. Parameter Estimation
1
min/max
cutoffs
average
In this section we describe the methodology for obtaining

the parameters described in the previous section. For the
parameter estimation we use historical data of solar irradiance,
0.7
like that provided by the National Renewable Energy LaboraState 4
0.6
tory (NREL), USA [13]. For any given location, we consider
0.5
State 3
the solar irradiance data for one year and use the monthly
0.4
data to extract the model parameters for each month. For each
State 2
0.3
day of the month, we first calculate the total solar irradiance
State 1
0.2
received over the day. The days are then sorted based on the
received solar irradiance, and a fraction of the days with
0.1
the lowest solar irradiance are marked as bad weather days
0
0
2
4
6
8
10
12
14
16
18
20
22
while the rest of the days are marked as good weather days.
Hour of the day
This data is then used to calculate the transition probability of
going from a bad day to bad day, and good day to good day
Fig. 3. An example of the demarcation of states and their expected solar
irradiance for bad days.
so as to obtain the transition probabilities pgg , pgb , pbb and
pbg for Eqn. (1).
Further, in order to obtain the average solar irradiance values
with
in each of the four possible states in each hour, we first analyze
(
r(i,j)(k,l) k = (i+1) mod 24; j, l {1, 2, 3, 4} the hourly solar irradiance data to record the hourly maximum
b(i,j)(k,l) =
and minimum values of solar irradiance received for both bad
0
otherwise
and good weather days. The region between the maximum and
(5)
minimum solar irradiance values for each hour is divided by
where b(i,j)(k,l) is the probability of transition from the j-th
defining cutoffs which uniformly partition the region into four
state in the i-th hour to the l-th state in k-th hour on a bad
sub-regions. Each of the four sub-region specifies the state
weather day. Note that in a given hour, from a particular state,
of solar irradiance at that hour. Using the empirical data, we
the solar irradiance can only go to one of the states in the
obtain the average hourly irradiance values for each of those
next hour. The numerical value of the transition probability is
states.
denoted by r(i,j)(k,l) and it satisfies
0.9
0.8
4
X
r(i,j)(k,l) = 1,
III. R ESULTS
k = (i + 1) mod 24, j {1, 2, 3, 4}.
l=1
(6)
We can similarly define the the transition probability matrix
for a good weather day. The hourly state transitions for a bad
day are shown in Figure 4.
In this section we evaluate the proposed model for generating the solar irradiance data by comparing its results with
empirical data. To validate the methodology presented in this
paper, we consider two locations: Kolkata (India) and San
Diego (USA) and for both locations, our model used = 0.2.
The solar irradiance data for these locations was obtained from
the NREL database.
1.1
1.1
0.9
0.9
0.8
0.7
0.6
0.5
0.4
0.8
0.7
0.6
0.5
0.4
0.3
0.3
0.2
0.2
0.1
0.1
Fig. 4. Markov state diagram showing transition from a state in an hour to

state in next hour
Synthetic
1.2
Solar Irradiance (kW/m2)
Empirical
1.2
2000
4000
Hour
6000
8000
2000
4000
6000
8000
Hour
Fig. 5. Empirical vs synthetic solar irradiance data for Kolkata (2009).
- 74 -
ICEIC 2015
Synthetic
10
1.1
1.1
0.9
0.9
0.8
0.7
0.6
0.5
0.4
1.2
Solar Irradiance(kW/m2)
Empirical
1.2
0.8
0.7
0.6
0.5
0.4
7
6
5
4
3
0.3
0.3
0.2
0.2
0.1
0.1
2000
4000
6000
Hour
8000
0
Jan
2000
4000
6000
Hour
Empirical: Daily mean

Model: Daily mean
Empirical: Daily variance
Model: Daily variance
Feb
Mar
Apr
May
Jun
8000
July Aug Sept
Oct
Nov
Dec
Month
Fig. 6. Empirical vs synthetic solar irradiance data for San Diego (2009).
Fig. 8. Comparison of the mean and variance of the daily solar irradiance
values, empirical vs model generated data: San Diego (2009)
7
Empirical: Daily mean
1
Empirical: Hourly mean
Model: Hourly mean
Empirical: Hourly variance
Model: Hourly variance
Model: Daily mean
0.9
Empirical: Daily variance
0.8
Model: Daily variance
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
Jan
Feb
Mar
Apr
May
Jun
July Aug Sept
Oct
Nov
Dec
0
1
Month
11
13
15
17
19
21
23
Hour
Fig. 7. Comparison of the mean and variance of the daily solar irradiance
values, empirical vs model generated data: Kolkata (2009)
A. Yearly Solar Irradiance

To ascertain the accuracy of the proposed model, we first
consider the solar irradiance trace for an entire year, as
generated by our model and compare it against real data.
Figures 5 and 6 show the hourly trace of solar irradiance
for the two locations for the year 2009. We note the close
match between the overall trends and values of the data for
the synthetic and empirical traces.
B. Mean and Variance of Irradiance Levels
To get a more detailed look at the performance of the
proposed model, next we consider the mean and variance of
the daily solar irradiance values. It is to be noted that for
our model, long duration synthetic data was generated for
comparing the mean and variance values. Figures 7 and 8 show
the mean and variance of the daily solar irradiance values,
calculated on a monthly basis for the year 2009. Again we
see that the results from the proposed model match well with
those from empirical data.
From Figure 7 and 8, we observe that the month of June for
Kolkata and the month of May for San Diego have the highest
variance in the daily solar irradiance values. This indicates
Fig. 9. Comparison of the mean and variance of the hourly solar irradiance
values, empirical vs model generated data: Kolkata (June 2009)
that these are the months in the respective locations which

exhibited maximum variability in terms of solar irradiance,
for the year 2009. Thus we focus on these months to further
validate the performance of the proposed model.
To get a finer look at the performance of the proposed
model, next we compare the mean and variance of the solar
irradiance values in each hour of the day for these two
locations for the month with maximum variability. Figure
9 and 10 show these results for Kolkata and San Diego,
respectively. It can be seen that the hourly mean and variance
of the synthetic trace generated by our model matches closely
with that of empirical data.
C. Irradiance State Statistics
While the hourly mean and variance results provide an
indication of the overall accuracy of the proposed model, a
more finer look at the match with empirical data is obtained
by considering the statistics related to the hourly irradiance
values. For this comparison we generate a month long synthetic trace for both these months. The solar irradiance from
0 to 1000 W/m2 is divided into 10 bins. For the months of
June for Kolkata and May for San Diego in the year 2009, for
- 75 -
ICEIC 2015
1.1
Empirical: Hourly mean
Model: Hourly mean
Empirical: Hourly variance
Model: Hourly variance
0.9
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
11
13
Hour
15
17
19
21
23
Fig. 10. Comparison of the mean and variance of the hourly solar irradiance
values, empirical vs model generated data: San Diego (May 2009)
Fig. 12. Comparison of number of hours in a particular irradiance slot,

empirical vs model generated data: San Diego (May 2009)
R EFERENCES
Fig. 11. Comparison of number of hours in a particular irradiance slot,

empirical vs model generated data: Kolkata (June 2009)
both the empirical and synthetic data, we count the number of

occurrences of the hourly solar irradiance being in a particular
irradiance level. The comparison is shown in Figures 11 and
12. It can again be observed that there is a close match between
the number of hours in a given irradiance level for the model
generated synthetic trace and that obtained from empirical
data.
IV. C ONCLUSION
This paper presented a framework for generating synthetic
traces of hourly solar irradiance for the purposes of dimensioning solar-powered systems. The proposed framework is based
on combining Markov models for the daily changes in weather
patterns with one for an hourly variation in the solar irradiance
levels. The proposed model has been validated by comparing
it against empirical data from geographically diverse regions.
[1] http://www.gsma.com/mobilefordevelopment/programmes/green-powerfor-mobile/tracker, Last accessed: August 23, 2014.

[2] Zhou, Wei, et al. Current status of research on optimum sizing of standalone hybrid solarwind power generation systems, Applied Energy 87.2
(2010), pp. 380-389.
[3] Knight, K. M., S. A. Klein, and J. A. Duffie. A methodology for the
synthesis of hourly weather data, Solar Energy 46.2 (1991), pp. 109120.
[4] A. Maafi and A. Adane, Analysis of the performances of the first-order
two-state Markov model using solar radiation properties, Renewable
Energy, vol. 13, no. 2, pp. 175-193, 1998.
[5] Festa, R., S. Jain, and C. F. Ratto. Stochastic modelling of daily global
irradiation, Renewable energy 2.1 (1992), pp. 23-34.
[6] Hokoi, S., M. Matsumoto, and M. Kagawa. Stochastic models of
solar radiation and outdoor temperature, ASHRAE Transactions (American Society of Heating, Refrigerating and Air-Conditioning Engineers);(United States) (1990), pp. 245-252
[7] Mora-Lopez, L. L., and M. Sidrach-de-Cardona. Multiplicative ARMA
models to generate hourly series of global irradiation, Solar Energy
63.5 (1998), pp. 283-291.
[8] Dorvlo, Atsu SS, Joseph A. Jervase, and Ali Al-Lawati. Solar radiation
estimation using artificial neural networks, Applied Energy 71.4 (2002),
pp. 307-319.
[9] Rehman, Shafiqur, and Mohamed Mohandes. Artificial neural network
estimation of global solar radiation using air temperature and relative
humidity, Energy Policy 36.2 (2008), pp. 571-576.
[10] Kamal, Lalarukh, and Yasmin Zahra Jafri.Stochastic modeling and
generation of synthetic sequences of hourly global solar irradiation at
Quetta, Pakistan, Renewable energy 18.4 (1999), pp. 565-572.
[11] Aguiar, R. J., M. Collares-Pereira, and J. P. Conde. Simple procedure
for generating sequences of daily radiation values using a library of
Markov transition matrices, Solar Energy 40.3 (1988), pp. 269-279.
[12] http://www.3tier.com/en/support/solar-prospecting-tools/, Last accessed:
August 23, 2014.
[13] http://www.nrel.gov/rredc/solar_data.html, Last accessed: August 23, 2014.
- 76 -
TO-2-5-5
Semiautomatic classification of ECG signal with Extreme Learning Machine

Mohamad Mahmoud Al Rahhal, Yakoub Bazi, Naif Alajlan Mansour Abdulaziz Al zauir,
Saad Haj Bakry
Computer engineering department
King Saud University
Riyadh, Riyadh, Saudi Arabia
malrahhal@ksu.edu.sa, ybazi@ksu.edu.sa, najlan@ksu.edu.sa, zauir@ksu.edu.sa,
shb@ksu.edu.sa
Abstract
Cardiovascular disease is the main leading cause
behind global mortality in the world. It is the single
leading cause of death in both developed and
developing countries. In this article, we propose
Interactive Ensemble Method for the Classification of
Electrocardiogram Signals, temporal feature and
morphological feature have been used. The proposed
classification system achieves average accuracies,
sensitivity and positive productivity better than the
current state of the art algorithms in the term of AAMI
norm, the global accuracies , sensitivity and positive
productivity after 20 iteration are 99.7%, 95.8% and
98.2%, and our result for detection of ventricular
ectopic beat(VEB) and Supra-VEBs(SVEBs) achieved
better than state of the art, after 20 iteration for VEB
(OA=100, Se=99.7 and Pp=99.9) and for
SVEB(OA=99.9, Se=94.3 and Pp=96.7).
Keywords: Semiautomatic, ECG, ELM.
1. Introduction
The analysis of the ECG signal provides a
comprehensive and inexpensive technique that help in
diagnoses Cardiac disease conditions by identifying
abnormal heartbeats in the ECG signal through
analyzing the heart function for different cardiac
conditions. The classification of heartbeats is one of the
most important analysis performed in the ECG, which
is very Significant for the study of arrhythmias. A
careful inspection is required for detection and
diagnosis infrequent or subtle arrhythmias of long-term
recordings. Some types of arrhythmias may represent a
long-term threat without a proper treatment while other
types represent life threat in the short term. Therefore,
Using an automatic algorithms represents an important
that allows cardiologists to improve their diagnostics [1].
- 77 -
In the past decade many algorithms for ECG

classification were developed [1] - [17] the results
comparison across most of these works could not be
performed fairly because of the lack of standardization
in the development and evaluation criteria. Some
methodological aspects were followed in the recent
works in order to overcome this problem [9]. The most
relevant key-points are as follows:
1) Public and standard databases has been used, eg.
physionet [10]. 2) Association for the Advancement of
Medical Instrumentation AAMI recommendations for
class labeling and results presentation [18].
Limited work has been followed the AAMI standard
[1], [3], [6], [8][10], [18][24]. According to AAMI
standard, there are five designated classes (named: N, V,
S, F and Q), many feature has been used in these
proposed paper, such as morphological features, which
are features used to represent the morphology of the
ECG signals by dividing it into many groups. The major
distinction between the groups is the method used for
sampling the signals [10]. Temporal features is another
feature that consider QRS complex duration; the RR
interval; and the RR interval averaged over the ten last
beats [3], [6][8], [10]. Wavelet transform that allows to
capture the information from ECG at different
resolution levels have been used in [ [10]. High-order
statistics (HOS) that allows to generate embedded
hidden features from the QRS complex [7], [8].
Different classifier has been used According to
AAMI standard, Support Vector Machine (SVM)
classifier is one of among available classifiers, it
introduced recently for ECG classification proved to be
a promising tool [3], [10]. This is mainly explained by
its robustness against the curse of dimensionality (i.e.,
the Hughes effect) compared to standard classifiers.
Linear Discriminant Analysis (LDA) is another
classifier, and has been used by researchers in [4], [6] .
LDA easily handles the case where the within-class
frequencies are unequal and its performances have been
ICEIC 2015
Let
= {( , )}
a training set from X
composed of N training feature vectors of dimension
d and {1, , } are class labels. P represents the
number of classes. The ith output of a multiclass ELM
classifier with P-output nodes is given by:
() = () , = 1, ,
(1)
Where is the vector of the output weights
between the hidden layer of L nodes and the jth output
node. In the case of binary classification, the ELM is
characterized by one output node. () is the
(row) output vector of the hidden layer with respect to
the input . It maps the input data from the ddimensional space to the L-dimensional ELM feature
space. This feature mapping could be known such as in
standard neural networks classifiers or done in the
kernel space by applying Mercer's conditions on ELM.
The optimization problem associated with ELM is
given as follows:
examined on randomly generated test data. Besides

these classifiers one can find also solutions based on the
k-nearest neighbor [8].
An automatic heartbeat classification approach has
been proposed in [3]. The proposed approach used
combination of dynamic and morphological features.
SVM is utilized for the classification of heartbeats into
one of 16 classes using these concatenating features.
Two types of evaluation approaches has been
investigated in the proposed approach, namely, subjectoriented and class-oriented.
Unsupervised feature relevance analysis applied to
improve ECG heartbeat clustering has been stated in [9].
The work presented in [10] proposed a supervised
graph based pattern recognition technique, an
Optimum-Path Forest (OPF) classifier has been used in
the proposed technique. It is the first time that OPF
classifier is used to the ECG heartbeat signal
classification task. The OPF classifier gave better
accuracy performance comparing by performance
yielded by other classifiers such as MLP (abbreviation
of what) and SVM.
An NN method based on mixture-of-experts concept
[25] distinguishes VEB from non-VEB beats.
! " #$: &'()*+
1
1
= . + 0 12 3
2
2

456$78 89: ( ) = :; 2; = 1, , = (2)
Where C is a regularization parameter. : =

[? , , ?' ]; and 2 = [A , , A' ]; are the target and
training error vectors of the P-output nodes with respect
to the training sample . The target vector : has all its
values set to 0 except the entry matching the class label
, which is set to 1. Based on the KKT theorem, the
determination of the weights training an ELM is
equivalent to solving the following dual optimization
problem:

.
&BC*+ = . + 0
2
2. Description of the Proposed Interactive

Methods
Let us consider a segmented ECG heart beat space X
of size Md, where M and d represent the number of
heart beats and features dimension respectively. Let set
= {( , )} a training set from X composed of n
training feature vectors of dimension d and
{ , , } is the corresponding class label. As feature
vector, we consider morphological as well as temporal
features. Each class m (m=1,,T) has nm training
samples and T represent the number of classes. Given
this training set , we aim to classify an incoming
records of patients using interactive classification
schemes .
We construct the ensemble using Extreme Learning
Machine (ELM) classifier fed with different training
samples. Here training samples can be constructed by
either random sampling or clustering techniques. In the
case of clustering, K-means clustering is used which
will give us the advantage of having diversity on data.
Then the classification results are fused using the
weighted majority voting rule. Because, automatic
classification methods are not able to provide high
detection results, we propose here a semiautomatic
approach by integrating expert opinion in the decision
process. To this end, the expert will label of set of
informative samples extracted with different strategies.
A classification with ELM

E F( ) ? + A G
H
(3)
Here = [ , , ' ] is the composed of the vector

weights linking the hidden layer to the jth output node.
It can be shown that by taking the KKT optimal
conditions, the optimal vector of weights can be
given by the following compact matrix form [107]:
L
= J K + JJ N :
(4)
M
where H is the hidden layer output matrix and it is
defined as follows:
( ) ( )
( )
R
J = P R = P
(5)
( ) ( )
( )
: is a matrix of size NP built from the target output

vector : :
? ?'
:
R
:=P R=P
(6)

?
?
:

'
- 78 -
ICEIC 2015
The 2 main parameters of the classifiers (C and ) are

selected according to a 3-fold cross-validation (CV)
procedure ELM, C belong to rang [25 50 100 150 200
500 1000] and belong to rang [0.25 0.5 0.75 1 2 3 4 5].
The performance is calculated from the confusion
matrix after performing classification experiment in
terms of the class sensitivity , class positive predictive
value , global accuracy A, global sensitivity , and
global positive predictive value P+ as suggested in [18].
U() = () = ()J K + JJ N :

(7)
M
During the prediction phase, a test sample V will be
assigned to the index of the output node which has the
highest value. In other words, if we let U() =
[ (V ), ' (V )] then the predicted class label for a
test sample V is:
(8)
= XYZ "X[ (V )
{,,'}
In the kernel space, the prediction associated with a

test sample V is given in the following compact form:
\ ( , )
O
L
U( ) = P
R K + ](, )N :
(9)
M
\ ( , )
A. Results on MIT-BIH database

In this paper, we present the results obtaining on
MIT-BIH database using the norm AAMI and adding 10
samples on each iteration. The results obtained using
three types of selection schemes: 1) Random selection,
2) Break and Tie (BT) and 3) entropy. Considering the,
Figure2. Presents the global results, overall accuracy,
sensitivity and positive predictive for 20 iterations for
all records of DS2. The automatic classification start by
small values (OA = 69.66%, Se = 45.6 % and Pp =
40.41%). After adding 80 samples (8 iterations), all the
accuracies for the BT selection become superior to 90%
(OA = 99.27%, Se = 91.97% and Pp = 94.96%),
meanwhile, Entropy selection need 10 iteration to give
such values (OA = 99.09%, Se = 92.12% and Pp =
90.02%). For the RAND selection, and even the results
was better than the 2 other methods on the first 3
iterations, but after that, the increasing of accuracies
become slower and the results obtained after 20
iterations are (OA = 98.83%, Se = 87.12% and Pp =
91.96%)
The first term of (9) is a vector of length N and

represents, the kernel between a particular test point and
the training samples. In this case, the number of hidden
neurons L need not be given as the kernel matrix ^ =
__ is only related to the training samples.
See [26] for a detailed description of the ELM and its
comparison with other classifiers.
3. Experiments setup and Performance

evaluation
100
100
90
90
80
%OA
80
70
60
10
15
Queries
20
70
60
ENTROPY
BT
RAND
ENTROPY
BT
RAND
50
40
25
(a)
10
15
Queries
20
25
(b)
100
90
80
%Se
Features extracted in our work are based on simple

features which are morphological and temporal features.
The first one correspond to the morphology form of the
ECG signal whereas the temporal feature used are: PreRR interval, Post-RR interval, Average RR-interval and
Local avg.RR-interval. It worth to note that only lead II
is used in all the experiments and every records is
resampled at 300Hz.
Recall The classification module is designed to
discriminate between AAMI standard four classes: 1)
Normal (N), 2) Supraventricular (S), 3) ventricular (V)
and 4) Fusion (F). In all experiment, we will assume that
the training is constructed from MIT-BIH database,
precisely from DS1, and all other databases, including
DS2, are considered as test. Table (1) shows the number
of samples for each dataset.
Training ensemble is created based on ELM and
SVM classifiers. The training set is constructed from
DS1 by clustering with K-means and selecting the
centroid of each cluster. By choosing K=50, the number
of training samples for each class will be 50, the total
number of samples on the training set will be then 200
samples. Recall, our aim is not to obtain good results on
automatic classification, but rather to use this training to
boost the classifiers on the semi-automatic classification
and also to not burden the classifies by choosing a huge
number of data on the training set.
%Pp
and I is an identity matrix of size NN.

Hence, the output function of ELM is:
70
60
ENTROPY
BT
RAND
50
40
10
15
Queries
20
25
(c)
Figure 2: MIT_BIH Classification Accuracy
obtained for global: (a) Overall Accuracy, (b)
Average positive productivity (c) Average sensitivity.
- 79 -
ICEIC 2015
(1 iteration) all the accuracies for the BT selection
become superior to 90% (Se=93.17%, Pp=92.54,
Sp=99.63 and OA=99.32), after adding 100 sample per
record (10 iterations) the result will be (Se =99.12%,
Pp=99.17%, Sp=99.96% and OA= 99.92%). The
performance results for SVEB detection based in 14
common testing records, the automated system results
are (Se =44.83%, Pp=3.02%, Sp=91.24%and
OA=90.98%), after adding 140 samples per records the
result will be (Se =90.34%, Pp=95.9%, Sp=99.98% and
OA= 99.92% ), the result stable after adding 200
samples per records (20 iteration) (Se =94.27%,
Pp=96.71%, Sp=99.98% and OA=99.95%) table (4).
system are (Se=73.56%, Pp=68.84%, Sp=97.43%
and OA=95.77%). after adding 20 samples per records
the convergence of the result become clearly high, the
result will be (Se=95.73, Pp=91.39%, Sp=99.32% and
OA=99.07%), after adding 200 sample per record the
result will be (Se=99.55%, Pp=99.62%, Sp=99.97% and
OA=99.94%) table (4).
Compares our results with state-of-the-art methods.
We observe clearly that the newly proposed scheme
performs better in terms of accuracy sensitivity
specificity and positive productivity in VEB and SVEB
detection.
We can conclude from this analysis that BT and

Entropy selection methods provide better classification
results than RAND selection method, but the first one
(BT) converge to higher results faster than Entropy
method. To this end, we will keep the BT selection
method for the part of comparison with state of the art
techniques.
B.
Result Comparison with stat of the art
Table (3) shows AAMI Classification performance

of proposed method and comparison with state-of-theart methods. Recall, our aim is not to obtain good results
on automatic classification our automatic classification
result start with low accuracies comparing with state of
the art values (OA = 69.66%, Se = 45.60 % and Pp =
40.41%) After adding 80 samples (8 iterations), the
result of (OA = 99.27%, Se = 91.97% and Pp = 95.68%).
After adding 200 samples (20 iterations), overall
accuracies become (OA = 99.71%, Se = 95.83% and Pp
= 98.26%)
We observe clearly that the newly proposed scheme
performs better in terms of accuracy sensitivity and
positive productivity.
Table 1 AAMI Classification performance of
proposed method and comparison with the literature.
Method
DE Chzal et al.
[18]
Mariano et al.
[1]
Zhang et
al.[28]
Can Ye et
al.[3]
PROPOSED
Assisted
Table 2 SVEB Classification performance of

proposed method and comparison with the
literature.
Average
OA
Se
Pp
86
83
57
78
83
58
88.34
86.82
60.63
86.4
62.58
53.85
0
50
100
150
200
69.72.38
97.10.20
99.50.01
99.60.01
99.70.02
45.64.93
77.11.59
93.80.75
94.30.87
95.80.56
40.43.09
91.42.46
95.90.27
97.50.66
98.20.25
For VEB and SVEB detection the result of the

classification experiments compared with three
algorithms in [18], [20], [22][24]. For comparison the
performance result, the problem of SVEB and VEB
detection is considered individually. The proposed
technique can achieved average accuracy, sensitivity,
specificity and positive productivity better than the
existing algorithms for classification of heartbeat
pattern according to AAMI standards as shown in the
table (4).The performance results for VEB detection
based in 11 common testing records [20], (Se, Pp, SP
and OA) for automated system are (35.17%, 43.84%,
97.33%, 94.41%). After adding 10 samples per records
Method
Assisted
Chazal et
al [22]
Alexander
et al.[6]
Hu et al
[23]
Chazal et
al [18]
Ince et al
[20]
Jaing et
al[24]
Proposed
- 80 -
VEB
Se
Pp
Sp
OA
0
50
200
500
75.9
87.4
87.1
87.7
38.5
49.1
50.6
47
N/A
N/A
N/A
N/A
94.6
96.2
96.4
95.9
500
86.19
56.68
97.45
N/A
300
N/A
N/A
N/A
N/A
76.4
38.7
93.2
92.4
300
81.8
63.4
98.5
96.1
300
74.9
78.8
98.8
97.5
0
50
100
150
200
44.88.27
72.13.19
84.01.67
91.23.29
94.31.84
3.00.85
85.21.80
93.81.61
95.52.51
96.72.06
91.22.98
99.90.01
100.00.01
100.00.01
100.00.01
91.02.93
99.80.02
99.90.01
99.90.01
99.90.01
ICEIC 2015
Assistance, IEEE Trans. Biomed. Eng., vol. 59, no. 8, pp.
23122320, 2012.
Table 3: VEB Classification performance of

proposed method and comparison with the
literature.
Method
Assisted
Se
Pp
Sp
OA
Chazal et
al [22]
0
50
200
500
77.7
86.2
89.2
94.3
81.9
93.8
94.2
96.2
N/A
N/A
N/A
N/A
97.4
98.7
98.9
99.4
500
92.43
94.82
99.6
N/A
300
78.9
75.8
96.8
94.8
94.3
95.8
99.4
96.4
300
90.3
92.2
98.8
97.9
300
94.3
95.8
99.4
98.8
Alexander
et al.[6]
Hu et al
(1)[23]
Chazal et
al[18]
Ince et
al[20]
Jaing et
al[24]
Proposed
[5] M. Llamedo, A. Khawaja, and J. P. Martinez, CrossDatabase Evaluation of a Multilead Heartbeat Classifier,
IEEE Trans. Inf. Technol. Biomed., vol. 16, no. 4, pp. 658
664, Jul. 2012.
VEB
0
50
100
150
200
[6] A. S. Alvarado, C. Lakshminarayan, and J. C. Principe,

Time-Based Compression and Classification of Heartbeats,
IEEE Trans. Biomed. Eng., vol. 59, no. 6, pp. 16411648, Jun.
2012.
[7] G. de Lannoy, D. Francois, J. Delbeke, and M. Verleysen,
Weighted Conditional Random Fields for Supervised
Interpatient Heartbeat Classification, IEEE Trans. Biomed.
Eng., vol. 59, no. 1, pp. 241247, 2012.
35.213.77 43.816.43 97.31.59 94.41.25

97.80.21 97.50.32
99.9.02 99.80.02
99.10.14 99.20.27 100.00.01 99.90.01
99.50.07 99.80.15 100.00.01 100.00.01
99.70.07 99.90.04 1000.00 1000.00
4. Conclusion
In this paper we proposed Interactive Ensemble
Method for the Classification of Electrocardiogram
Signals, temporal feature and morphological feature
have been used. The obtained result showed that our
classification system achieves better than the current
state of the art algorithms in the term of AAMI norm.
[8] Y. Kutlu and D. Kuntalp, Feature extraction for ECG

heartbeats using higher order statistics of WPD coefficients,
Comput. Methods Programs Biomed., vol. 105, no. 3, pp. 257
267, 2012.
[9] J. L. Rodrguez-Sotelo, D. Peluffo-Ordoez, D. CuestaFrau, and G. Castellanos-Domnguez, Unsupervised feature
relevance analysis applied to improve ECG heartbeat
clustering, Comput. Methods Programs Biomed., vol. 108,
no. 1, pp. 250261, 2012.
[10] E. J. da S. Luz, T. M. Nunes, V. H. C. de Albuquerque, J.
P. Papa, and D. Menotti, ECG arrhythmia classification based
on optimum-path forest, Expert Syst. Appl., vol. 40, no. 9,
pp. 35613573, 2013.
[11] C. Kamath, ECG beat classification using features
extracted from teager energy functions in time and frequency
domains, IET Signal Process., vol. 5, no. 6, pp. 575581, Sep.
2011.
ACKNOWLEDGEMENT
This work was supported by Advanced Lab
Intelligent systems Research, CCIS, King Saud
University.
[12] C. Bruser, J. Diesel, M. D. H. Zink, S. Winter, P.

Schauerte, and S. Leonhardt, Automatic Detection of Atrial
Fibrillation in Cardiac Vibration Signals, IEEE J. Biomed.
Health Inform., vol. 17, no. 1, pp. 162171, 2013.
References
[1] M. Llamedo and J. P. Martinez, Heartbeat Classification
Using Feature Selection Driven by Database Generalization
Criteria, IEEE Trans. Biomed. Eng., vol. 58, no. 3, pp. 616
625, Mar. 2011.
[13] J. Behar, J. Oster, Q. Li, and G. D. Clifford, ECG Signal

Quality During Arrhythmia and Its Application to False Alarm
Reduction, IEEE Trans. Biomed. Eng., vol. 60, no. 6, pp.
16601666, Jun. 2013.
[2] T. Mar, S. Zaunseder, J. P. Martnez, M. Llamedo, and R.

Poll, Optimization of ECG Classification by Means of
Feature Selection, IEEE Trans. Biomed. Eng., vol. 58, no. 8,
pp. 21682177, 2011.
[14] E. Gil, P. Laguna, J. P. Martinez, O. Barquero-Perez, A.

Garcia-Alberola, and L. Sornmo, Heart Rate Turbulence
Analysis Based on Photoplethysmography, IEEE Trans.
Biomed. Eng., vol. 60, no. 11, pp. 31493155, 2013.
[3] C. Ye, B. V. K. V. Kumar, and M. T. Coimbra, Heartbeat

Classification Using Morphological and Dynamic Features of
ECG Signals, IEEE Trans. Biomed. Eng., vol. 59, no. 10, pp.
29302941, 2012.
[15] P. P. San, S. H. Ling, and H. T. Nguyen, Industrial

Application of Evolvable Block-Based Neural Network to
Hypoglycemia Monitoring System, IEEE Trans. Ind.
Electron., vol. 60, no. 12, pp. 58925901, 2013.
[4] M. Llamedo and J. P. Martinez, An Automatic PatientAdapted ECG Heartbeat Classifier Allowing Expert
[16] R. Vullings, M. Mischi, S. G. Oei, and J. W. M.

Bergmans, Novel Bayesian vectorcardiographic loop
- 81 -
ICEIC 2015
alignment for improved monitoring of ECG and fetal
movement, IEEE Trans. Biomed. Eng., vol. 60, no. 6, pp.
15801588, Jun. 2013.
[17] S.-M. Dima, C. Panagiotou, E. B. Mazomenos, J. A.
Rosengarten, K. Maharatna, J. V. Gialelis, N. Curzen, and J.
Morgan, On the Detection of Myocadial Scar Based on
ECG/VCG Analysis, IEEE Trans. Biomed. Eng., vol. 60, no.
12, pp. 33993409, 2013.
[18] P. De Chazal, M. ODwyer, and R. B. Reilly, Automatic
classification of heartbeats using ECG morphology and
heartbeat interval features, IEEE Trans. Biomed. Eng., vol.
51, no. 7, pp. 11961206, Jul. 2004.
[19] Z. Zhang, J. Dong, X. Luo, K.-S. Choi, and X. Wu,
Heartbeat classification using disease-specific feature
selection, Comput. Biol. Med., vol. 46, pp. 7989, 2014.
[20] T. Ince, S. Kiranyaz, and M. Gabbouj, A Generic and
Robust System for Automated Patient-Specific Classification
of ECG Signals, IEEE Trans. Biomed. Eng., vol. 56, no. 5,
pp. 14151426, 2009.
[21] M. M. Haque, L. B. Holder, M. K. Skinner, and D. J.
Cook, Generalized Query-Based Active Learning to Identify
Differentially Methylated Regions in DNA, IEEE/ACM
Trans. Comput. Biol. Bioinform., vol. 10, no. 3, pp. 632644,
2013.
[22] P. De Chazal and R. B. Reilly, A Patient-Adapting
Heartbeat Classifier Using ECG Morphology and Heartbeat
Interval Features, IEEE Trans. Biomed. Eng., vol. 53, no. 12,
pp. 25352543, 2006.
[23] Y.-H. Hu, S. Palreddy, and W. J. Tompkins, A patientadaptable ECG beat classifier using a mixture of experts
approach, IEEE Trans. Biomed. Eng., vol. 44, no. 9, pp. 891
900, Sep. 1997.
[24] W. Jiang and S. G. Kong, Block-Based Neural Networks
for Personalized ECG Signal Classification, IEEE Trans.
Neural Netw., vol. 18, no. 6, pp. 17501761, 2007.
[25] Y.-H. Hu, S. Palreddy, and W. J. Tompkins, A patientadaptable ECG beat classifier using a mixture of experts
approach, IEEE Trans. Biomed. Eng., vol. 44, no. 9, pp. 891
900, Sep. 1997.
[26] G.-B. Huang, H. Zhou, X. Ding, and R. Zhang, Extreme
Learning Machine for Regression and Multiclass
Classification, IEEE Trans. Syst. Man Cybern. Part B
Cybern., vol. 42, no. 2, pp. 513529, Apr. 2012.
- 82 -
TO-2-5-6
Diagnosing COPD Using Mobile Phones

Haya Hasan, Basel Safieh, Fadi Aloul, Assim Sagahyroon
American University of Sharjah, UAE
AbstractChronic Obstructive Pulmonary Disease (COPD) is
common progressive lung disease that causes difficulty in
breathing. The paper presents the design and implementation of
a user-friendly mobile phone application developed on an
Android platform that examines the lung functionality using the
phones built-in sensors. It allows the user to get a sense of
whether they have COPD or not from home before visiting a
specialized clinic and performing advanced medical tests. The
proposed system will make use of the phones microphone to
record exhalations. By means of advanced signal processing
techniques, the application will be able to mimic the medical
spirometer and determine certain lung measurements that are
used to assess the lungs well-being and diagnose COPD.
Furthermore, the application will allow the users to share test
results with doctors who can directly assess the disease
progression and give advice accordingly. The application was
successfully tested among a number of users. Experimental data
show promising results which can enhance the quality of life for
COPD patients.
I. INTRODUCTION
Chronic Obstructive Pulmonary Disease (COPD) is one of the
most common lung diseases. It causes poor airflow in the lungs
which leads to shortness of breath, coughing, wheezing, chest
tightness, and sputum production. Although the disease can be
manageable if diagnosed early, it is often left undiagnosed which
could lead to the destruction of the lungs over time and hence
increases the rates of motility and morbidity. A typical case would be
reported only after losing 50% to 60% of normal lung functionality.
Furthermore, unlike Asthma, the lung functionality in a COPD
patient doesnt improve significantly with medication.
According to the World Health Organization [1], COPD was the
3rd leading cause of death worldwide affecting 329 million people or
5% of the worlds population. More than 3 million people were killed
in 2012 because of COPD, which suggests that one person was killed
every 10 seconds by the disease.
Tobacco smoking is considered one of the main causes of COPD.
Other causes include air pollution, inhalation of chemicals and dust
as well as second hand smoke and genetics.
Patients with COPD suffer on a daily basis when performing
routine activities. They cannot withstand simple physical activities
such as going up the stairs or having a walk. A COPD patient would
feel exactly as a person doing aerobics when doing simple life
activities.
COPD is typically diagnosed by measuring the amount of air flow
in the lungs using a traditional spirometer that is available in medical
clinics. Affordable portable home spirometers are available today,
but are limited in terms of measurement options, processing power
and memory. Furthermore, they dont provide feedback from
specialized doctors.
Recently, the utilization of hand held devices such as mobile
phones in health-related applications have been on the rise. The rich
features that todays mobile phones are equipped with provide
industry and researchers with a valuable opportunity to continue
improving human life by developing applications that address a wide
spectrum of issues.
This paper presents the design and implementation of a mobile
phone application that utilizes its built-in microphone to record the
users exhalation. The recording is then analysed on the phone using
advanced algorithms to assess the lungs functionality and the

possibility that a user might be suffering from COPD. The
application is free as it doesnt require anything but the mobile phone
and its built-in sensors. The application allows for the data to be
shared with specialized doctors for feedback and advice.
The rest of the paper is organized as follows. Section II provides a
background of COPD and discusses related work. Section III
describes the proposed system hardware and software architecture.
The testing and implementation results are reported in Section IV.
Finally, the conclusion is presented in Section V.
II. BACKGROUND & RELATED WORK

Lung diseases are divided into two main parts: obstructive and
restrictive pulmonary diseases. Both types of diseases make the
patient suffer from shortness of breath specifically referred as
Dyspnoea in medical terms. Dyspnoea is a medical condition which
is considered as a common symptom between obstructive and
restrictive lung diseases which varies in intensity based on the
severity of the disease. Diseases that are considered under the
obstructive category include COPD, Asthma, Cystic Fibrosis and
Bronchiectasis. Obstructive diseases make exhalation of air difficult
and slow. The air is exhaled slowly which may result in a large
amount of air lingering in the lungs even after a full exhalation.
However, restrictive diseases are related to causes that make the
lungs stiff or hard. Therefore, the lungs cannot expand fully. This
might be caused by obesity or Muscular Dystrophy.
Most people with COPD have a combination of chronic bronchitis
and/or emphysema. Chronic bronchitis is a condition which causes
the obstruction and inflammation of the air pipes and passages. This
makes them narrower and unable to carry the regular amount of air to
and from the lungs. Furthermore, it also leads to an increase in mucus
production and coughing. On the other hand, emphysema is another
condition which leads to the walls between the air sacks in the lungs
known medically as alveoli to break down and get damaged. As a
result, there is less space for air exchange and the oxygen intake
becomes less which leaves the user in state of dyspnoea.
A user suffering from COPD needs to continuously monitor the
progression of the disease to avoid the worsening of the symptoms
and permanently damaging the lungs. COPD symptoms typically
consists of the following: (1) Chronic Cough with a wheezing sound,
(2) dyspnoea which progresses and becomes persistent, and (3) heavy
mucus production and cough with sputum.
COPD is typically diagnosed using spirometry which consists of
measuring the volume of air exhaled after a maximum inhalation.
The procedure is also used for diagnosing other pulmonary diseases
such as Asthma. A patient performing spirometry is supposed to
inhale the most amount of air they can and then forcefully exhale into
a pipe or tube. The spirometry test is usually performed using a
mouth piece that a person uses when exhaling and a nose clip. The
nose clip is used to make sure that all the air is exhaled through the
mouth. Furthermore, patients are usually given verbal instructions to
exhale hard and as much as possible during the test. The test records
two values: (1) FVC Forced Vital Capacity which represents the
total volume of air exhaled in one breath and (2) FEV1 Forced
Expiratory Volume in One Second which represents the volume of air
exhaled in one second. A healthy user typically exhales 75-80% of
the FVC in the first breath and has a FEV1/FVC ratio higher than
70% [2, 3]. According to the National Institute of Clinical
Excellence, a COPD user would have an FEV1 value less than 80%
- 83 -
ICEIC 2015
of the predicted value [4]. The predicted value is typically computed
based on the age, sex, height, weight, and ethnic group of the user.
Table 1 below shows the different lung measurements expected in
order to diagnose COPD and its severity based on the GOLD
standards [5].
TABLE I. GOLD Guidelines for Diagnosing COPD. The FEV1/FVC
result is assumed to be below 70% in all cases below.
COPD Severity
Mild
Moderate
Severe
Very Severe
FEV1 Results
FEV1 >= 80% predicted

50% <= FEV1 < 80% predicted
30% <= FEV1 < 50% predicted
FEV1 < 30% predicted
Several studies have been conducted that experiment with the use
of computers and mobile phones to diagnose COPD. Abushakra and
Faezipour experimented with 20 users to inhale and exhale forcefully
into a microphone connected to a computer [6]. Based on the energy
of the signal, the volume of the lung (FVC) was calculated. The
analysis was performed using Voice Activity Detection (VAD)
which was done using MATLAB. The procedure was tested on 20
users at the same location to provide uniformity. Their procedure
yielded an overall accuracy of 86.42% when compared to the clinical
spirometer results.
Xu et al. [7] designed and developed a mobile phone application
to diagnose COPD. The application, referred to as mCOPD, requires
the user to blow into the phones microphone and does the analysis
on the phone. The procedure was tested on 40 users and yielded
results that were within 3.9% - 6.5% from the clinical spirometer
results.
Larson et al. [8] developed an iPhone mobile application, known
as SpiroSmart. Unlike mCOPD, the application sends the recorded
exhalation into an external server for analysis. The procedure was
tested on 52 users and showed a mean error of 5.1% when compared
to clinical spirometers.
Stein [9] proposed another Android mobile application to detect
COPD. The phone is placed at a distance of 30 cm from the user and
does the calculations on the phone. The application was tested on two
patients and showed relatively good results. However, further testing
is needed to confirm the effectiveness of the application.
III. SYSTEM ARCHITECTURE

The proposed solution consists of the development of an Android
mobile phone application that uses voice recording software and the
phones built-in microphone to record the users breathing patterns.
One of the contributions of the proposed solution is the use of the
proximity sensor in the phone to identify how close the phone should
be placed to the users face during the exhalation. The distance
between the phone and the user varied from one user to another, and
even among multiple trials for the same user, when performing the
test in previous research implementations. Consequently, by utilizing
the proximity sensor, the distance is fixed among all tests performed
using the application which improves the accuracy and consistency
of the system. A proximity sensor, unlike other sensors, is an
interrupt based sensor, which gives only two values; 1 or 0. It
responds to a change that is more than 5 cm away from the users
face. So if the mobile phone is placed at a distance less than or equal
to 5 cm from the users face, no readings will be taken. As the phone
moves away from the users face for more than 5 cm, the sensor gets
triggered to indicate to the user to hold the phone at that distance
from the face and start the exhaling process. Unlike previous
approaches, no rulers or measurement items are needed to measure
the distance between the phone and the users face.
As shown in Figure 1, after the exhalation is recorded locally on
the phone, it is analysed and the COPD diagnosis is assessed. The
data is also securely sent to a remote server using Wi-Fi or 3G
connection and stored in the servers database. The database is

accessed via a web server by doctors, with privileged access to the
users records, to provide medical feedback and advice.
The Android mobile application is developed in JAVA using
Eclipse IDE with the Android Development Tools (ADT) plugin.
The phone used an SQLite database as a local database to store the
records of the user. The local database allows the users to see their
results offline. A website is implemented which allows both patients
and doctors to access their records. The website has an authentication
system and a database that stores the records posted by the users and
doctors.
Figure 1. COPD Diagnosis System Overview.
In order to diagnose COPD from the users exhalations, the

loudest frequencies need to be computed. This is because the air
blown to the microphone produces the loudest frequency. To assess
the correctness of the mobile phone application, the spirometry
algorithm was (1) written using MATLAB and tested on a computer
and (2) written using JAVA and tested on a Samsung SIII mobile
phone. The results from the computer and phone were compared for
correctness. The algorithm performs as follows: the exhalations are
recorded at a sampling rate of 44.1 kHz using the built in microphone
of the phone and then analysed by dividing the signal into windows
of size 0.1 seconds with a 50% overlap. Discrete Fourier Transform
(DFT) is performed on each window to find the power density
spectrum. The peak magnitude of each window is plotted which
represents the flow of air exhaled in L/s. The recorded signal
typically produces the shape as shown in Figure 2(a). The results of
the air flow obtained are shown in Figure 2(b).
Figure 2. (a) Recorded signal of the exhalation and (b) its corresponding
air flow result.
A clinical spirometer is used to obtain a typical breathing signal of

a user. The clinical spirometer plays a major role in evaluating the
accuracy of the mobile phones spirometry algorithm. The signal in
Figure 3 is obtained after the person is instructed to breath in and out
normally and then forcefully inhale and exhale followed by breathing
normally again. The Y-axis is the air volume and the X-axis is N
- 84 -
ICEIC 2015
(array indices). The positive Y-axis values represent inhaling,
therefore, the lungs has air in it, whereas the negative values
represent the exhalation, therefore, it is negative.
Figure 3. Sample spirometry signal.
Since the mobile application is only concerned with the forceful

exhalation, the signal that is imported will consist of the forceful
breath only. The signal will then be inverted and all the exhalations
will be extracted. The inversion of the signal is necessary in order to
make the exhalations as positive values rather than negative values
which ease the analysis process. The exhalations are extracted by
finding the peaks and troughs of the inverted original breath signal.
Each exhalation will be from one trough to the next peak and so on.
The ratio of FEV1/FVC is then calculated for each exhalation by
finding the volume of air exhaled at one second to the total volume
exhaled.
IV. SYSTEM TESTING AND IMPLEMENTATION RESULTS

Several experiments were conducted to evaluate the proposed
application. The first experiment evaluated the precision of the
application, since precision plays an important role in the spirometry
test. Therefore, it was decided to know how close the values are from
each other in the same controlled environment. In order to perform
the test, two users, a male and a female, took the test in a quiet room
individually. Each user performed the spirometry test 100 times. The
standard deviation was computed for each volunteers results. The
standard deviation results for the female and male users were 0.0462
and 0.0301, respectively.
The second experiment evaluated the accuracy of the application.
This was achieved by comparing the mobile phone application results
with the clinical spirometer results. 27 users took the accuracy test on
both the clinical spirometer and the phone application. The users
were required to take the test at least three times on each device.
They were also encouraged to try to take the test as much as they
possibly can. The users were instructed on how to use the clinical
spirometer and mobile application. All users had to use the
mouthpiece and the nose clip when doing the test. The test required
the users to start by breathing normally for three times and then
forcefully. Since the users could possibly feel dizzy after the test,
they were instructed to inform the person supervising the test of any
mishaps and to stay seated till feeling normal again.
After the user has completed the test on the clinical spirometer
device, the testing on the mobile phone takes place. Since the users
provided various number of samples, the highest three samples from
both the clinical spirometer and the mobile phone were chosen for
analysis. The mean of the highest three FEV1/FVC ratios from the
exhalations were computed for the clinical spirometer and the mobile
phone. The percentage difference between both readings was
calculated for each user. The mean difference was found out to be
5.56% among all samples.
The third experiment evaluated the correctness of the approach
and if the clinical spirometer and mobile phone application were
diagnosing the COPD patients correctly. In order to evaluate that,
several samples representing healthy users were tested. The ratio of
FVC/FEV1 was computed for each sample. Out of the 134 healthy
samples, the mobile phone application identified 18.66% samples as
possible COPD patients. While for the clinical spirometer, out of 271
healthy samples, 16.97% samples were identified as possible COPD
patients.
False positive diagnosis is expected in both the smartphone
application as well as the clinical spirometer device if the test is not
performed correctly. Both tests require training first before taking the
readings. The user is usually instructed verbally on how to perform
the test. However, it was noticed that users needed to at least try the
spirometry test on the application twice to perform the test correctly.
It was also observed that if the test was first practised in front of the
user, there is a better chance that the user will perform the test
correctly. Finally, exhaling into a phone microphone is safer as
opposed to blowing into a clinical spirometer tube due to hygiene
reasons.
Finally, a user suffering from asthma was also used to test the
system. The user provided 31 samples using the mobile phone, out of
which 90.32% indicated that the user suffers from COPD. The user
also provided 29 samples using the clinical spirometer, out of which
69.23% indicated that the user suffers from COPD.
V. CONCLUSION
A new efficient, user-friendly approach for diagnosing COPD
using mobile phones is proposed. The approach takes advantage of
the built-in microphone and proximity sensor in correctly recording
the users exhalation. The processing is done on the phone and
doesnt require external servers. The data is also securely shared with
an external server to be checked by specialized doctors. The
spirometry results on the phone are compared to the clinical
spirometer results. The results suggest that about 95% of the time the
results of the phone matched the clinical spirometer results. The
developed application is not intended to replace clinical spirometers,
but can replace portable home spirometers. The application is
expected to enhance the lives of COPD patients and to help diagnose
patients at an earlier stage.
REFERENCES
[1] The 10 leading causes of death in the world, 2000 and 2011, World
Health Organization, July 2013.
[2] A. Qaseem, T. Wilt, S. Weinberger, N. Hanania, G. Criner, T. van der
Molen, D. Marciniuk, T. Denberg, H. Schnemann, W. Wedzicha, R.
MacDonald, and P. Shekelle, Diagnosis and management of stable
chronic obstructive pulmonary disease: a clinical practice guideline
update from the American College of Physicians, American College of
Chest Physicians, American Thoracic Society, and European Respiratory
Society, in Annals of Internal Medicine, 155 (3), 17991, August 2011.
[3] V. Young, Blueprints Medicine, 5th ed. Philadelphia: Wolters Kluwer
Health/Lippincott William & Wilkins. 69, 2010.
[4] Clinical guideline 101: Chronic Obstructive Pulmonary Disease,
National Institute for Health and Clinical Excellence, London, June 2010.
[5] J. Vestbo, Diagnosis and Assessment in Global Strategy for the
Diagnosis, Management, and Prevention of Chronic Obstructive
Pulmonary Disease in Global Initiative for Chronic Obstructive Lung
Disease, 917, 2013.
[6] A. Abushakra and M. Faezipour, Lung capacity estimation through
acoustic signal of breath, in Proc. of the IEEE Intl Conference on
Bioinformatics & Bioengineering (BIBE), 386-391, 2012.
[7] W. Xu, M. Huang, J. Liu, F. Ren, X. Shen, X. Liu, and M. Sarrafzadeh,
mCOPD: mobile phone based lung function diagnosis and exercise
system for COPD, in Proc. of the Intl Conference on Pervasive
Technologies Related to Assistive Environments (PETRA), no. 45, 2013.
[8] E. Larson, M. Goel, G. Boriello, S. Heltshe, M. Rosenfeld, and S. Patel,
SpiroSmart: using a microphone to measure lung function on a mobile
phone, in Proc. of the ACM Conference on Ubiquitous Computing, 280289, 2012.
[9] B. Stein, A Mobile Smart Care Platform Home spirometry by using the
smart phone microphone, Masters Thesis, Leiden Institute of Advanced
Computer Science, Leiden University, The Netherlands, August 2013.
- 85 -
ICEIC 2015

Oral Session
TO-3-1
Control and Robotics II
TO-3-1-1
Dynamics and Control Problems related to Aerial Manipulation using

Quadrotors
Hai-Nguyen Nguyen, Hyunsoo Yang and Dongjun Lee
Department of Mechanical & Aerospace Engineering,
Seoul National University, Seoul, Republic of Korea
{hainguyen,yangssoo,djlee}@snu.ac.kr
Abstract
Quadrotors have recently received substantial
attention from researchers and general public alike,
due to their affordability and ease to control. Its usage,
yet, has been mostly limited to such passive tasks as
monitoring, surveying, photographing and payload
transport. In this work, we present our two recent
results to enable the quadrotors to perform
manipulation tasks, where they are physically
engaging with exogenous environments/objects by
actively/intentionally controlling their mechanical
interaction. In particular, we will present results on
the dynamics and control of the two problems: 1)
quadrotor tool operation; and 2) quadrotormanipulator operation.
Keywords: Quadrotors, aerial manipulation, dynamics,
control, tool operation, manipulator.
1. Introduction
Quadrotors are versatile robotic platforms to enable
many useful tasks in the 3D environments, for which
typical conventional robots (e.g., manipulators,
wheeled robots) cannot be utilized.
Aerial
photography, movie shooting, surveillance and
reconnaissance are some of the most representative
applications. Many strong results have been proposed
for this motion control of quadrotors, with numerous
fun-to-watch videos and demonstrations in and out of
research laboratories. Yet, just for the case of robotic
manipulators, to be truly useful, on top of this rather
passive moving ability, quadrotors should possess
ability to physically interact with environment/object,
and eventually, capability of dexterous and robust
aerial manipulation.
In this work, two recent results [1,2] on quadrotor
aerial manipulation are summarized: 1) for the aerial
manipulation using a rigid-tool attached on the
quadrotor, where should (or should not) we put the tool

and what is the ramification of this tool location on the
dynamics and control of the quadrotor [1]; and 2) for
the quadrotor equipped with multi-degree-of-freedom
(DOF) arm, what is the underlying structure of their
seemingly complicated/coupled/nonlinear dynamics
and how can we exploit it to design their dexterous
manipulation control [2]. The discussion of this work
is in fact based on our previous conference publications
[1] and [2], to which we refer readers for more
technical details.
2. Quadrotor Tool Operation

In [1], we consider the problem where a simple/unactuated tool (e.g., screw-driver, contact inspection
probe, etc.) is attached on the quadrotor and the
quadrotor itself is controlled as an actuator to operate
that tool. See Fig. 1. This quadrotor-tool system is
particularly promising, given that its payload is in
general fairly limited due to the limited capacity of
currently available batteries.
Figure 1: Quadrotor-tool operation system [1].
The control problem of this quadrotor-tool

operation system is much more challenging than that of
the quadrotor (center-of-mass) motion control, as, for
instance, the tool-tip position control requires
simultaneous and integrated control of both the
quadrotors orientation and translation, yet, the
- 87 -
ICEIC 2015
quadrotor is under-actuated only with 4 rotors. This
under-actuation, in fact, gives a rise to the issue of
internal dynamics, which turns out to be necessarily
unstable if the tool is attached above the center-of-mass
of the quadrotor, and even can exhibit finite-time
escape behavior. See Fig. 2 for hybrid position/force
control results, that were obtained in [1].
dynamics in fact is composed of: 1) the center-of-mass

translation dynamics, which has the standard form of
under-actuated quadrotors with gravity effect, thus,
easy to control; and 2) the internal rotation dynamics of
the quadrotors rotation and the manipulators
configuration, which has the standard form of fullyactuated passive robotic manipulator dynamics with no
gravity effect at all, thus, again, easy to control. These
two dynamics are completely decoupled (i.e., no
coupling via acceleration or Coriolis terms) and the
gravity showing up only in the former, thereby, extend
the
rigid-body
translation/rotation
dynamics
decomposition to the general floating vehiclemanipulator dynamics. See Fig. 4 for end-effector
control of this quadrotor-manipulator system presented
in [2].
Figure 2: Hybrid position/force control of quadrotor-tool system [1].
3. Quadrotor-Manipulator System Control

As shown in [1], although able to perform many
useful tasks, the quadrotor-tool operation system (Fig.
1) is inherently limited for dexterous manipulation due
to its lack of enough actuations. One of ultimate
solutions for this would be to equip the quadrotor with
many-DOF robotic arm see Fig. 3.
Figure 4: Quadrotor-manipulator end-effector control using coarse

platform control and fine manipulator control [2].
References
[1] H-N. Nguyen and D. J. Lee, "Hybrid force/motion control
and internal dynamics of quadrotors for tool operation", Proc.
IEEE/RSJ Int'l Conf. on Intelligent Robots & Systems, pp.
3458-3464, 2013.
[2] H. Yang and D. J. Lee, "Dynamics and control of
quadrotor with robotic manipulator", Proc. IEEE Int'l
Conference on Robotics & Automation, pp. 55445549,
2014.
Figure 3: Quadrotor-manipulator system [2]
The dynamics of this quadrotor-manipulator system,

yet, is typically very complex, coupled, and nonlinear,
and also with under-actuation and high-DOF, thus,
standard robot control techniques are difficult to
directly apply. For this quadrotor-manipulator systems,
in [2], we elucidate the underlying geometric structure
of this seemingly complicated quadrotor-manipulator
dynamics. More specifically, in [2], we show that the
seemingly complicated/coupling quadrotor-manipulator
- 88 -
TO-3-1-2
Application of adaptive control for visual servoing of multirotor flying robots

Suseong Kim and H. Jin Kim
Mechanical and Aerospace Engineering
Seoul National University, Seoul, Korea
E-mail : mer911tb@gmail.com, hjinkim@snu.ac.kr
surface or wall, during which ground effects due to
downwash can deteriorate the reliability. Adaptive
neural networks can improve the robustness against
disturbance or uncertainty in these situations. Similar
ideas can allow a team of multirotors to transport an
object or a multirotor combined with a robotic arm to
manipulate an object of unknown mass or inertia.
Abstract
This paper will present how ideas taken from
adaptive control can be combined with the visual
servoing framework and help improve the
performance of small unmanned aerial vehicles
in various aspects. In particular, experimental
results on multirotor platforms will be reported.
2. Multirotor platform for visual servoing

research
Keywords: visual servoing, unmanned aerial vehicle,

multirotor.
Figure 1 shows the multirotor platform used in this

research, similar to the one reported in [5]. The
multirotor is equipped with a robotic arm underneath
the main body, intended for particular tasks such as
close-up inspection of a certain structure or graspingtype operations of an object. For such tasks, it is
natural to aim at achieving a specific pose that allows
to put the target point in three-dimensional space at the
center of the camera view. This idea leads to imagebased visual servoing, whose objective is to accomplish
desired image through visual guidance of a robotic
platform [1,2,3,4,6].
In this work, we installed a camera in the center of
the robotic hand so that the robotic hand will try to
grab an object when the desired image is obtained.
However, uncertainty in the modeling process of the
entire platform will cause imperfect control of the end
effector of the robotic arm. Thus, the modeling process
should consider the combined effects from the platform,
robotic arm, and the object to be grabbed. Even then,
the uncertainty will remain due to various reasons such
as vibration, sensor noise, or ground effects. Especially,
close-up inspection or grabbing will be performed near
an existing structure, which will make the abovementioned issues non-negligible.
1. Introduction
Unmanned aerial vehicles, which are commonly
referred to as drones, have been attracting huge
interests for the past two decades. They offer promising
platforms in various applications ranging from
monitoring, surveillance, security, and defense. This
potential has led to research activities in sensing,
planning, and control techniques for UAVs. In
particular, small vertical-takeoff-and-landing (VTOL)
UAV platforms with multiple rotors have been
receiving unprecedented popularity both from public
and research communities, due to their simple physical
structure enabling various exciting demonstrations.
This talk will present how ideas taken from
adaptive control can be combined with the visual
servoing framework and help improve the performance
of small unmanned aerial vehicles in various aspects.
Experimental results reported in this talk have been
obtained by applying such ideas mostly to multirotors.
In visual-information-based control, or visual servoing,
a multirotor platform is controlled to its desired states
using visual feedback obtained from a camera mounted
onboard the multirotor. Adaptive visual servoing can
improve the robustness in visually tracking an object
with unknown dynamics. Multirotors may be required
to land autonomously or perform operations near a
- 89 -
ICEIC 2015
Figure 1. A multirotor with a robotic arm, on which

a camera is installed for visual servoing
Acknowledgement
This research has been supported in part by
Ministry of Science, ICT and Future Planning through
the grant 2014-023406.
References
[1] T. Hamel, and R. Mahony, Visual serving of an underactuated dynamic rigid body system: an image based
approach, IEEE transaction on Robotics and Automation,
Vol. 18, No. 2, pp. 187-198, 2002.
[2] F. Chaumette and S. Hutchinson, Visual Servo Control
Part1: Basic Approaches, IEEE Robotics and Automation
Magazine, Vol. 13, No. 4, pp. 82-90, 2006.
[3] D. Lee, H. Lim, H.J. Kim, Y. Kim and K. Seong,
Adaptive image based visual serving for an under actuated
quad rotor system, AIAA Journal of Guidance, Control, and
Dynamics, Vol. 35, No. 4, pp. 1335-1353, 2012.
[4] D. Lee, R. Tyler, and H.J. Kim, Autonomous landing of
a VTOL UAV on an moving platform using image-based
visual servoing, IEEE International Conference on Robotics
and Automation, pp. 971-976, St. Paul, Minnesota, May
2012.
[5] S. Kim, S. Choi and H.J.Kim, Aerial manipulation using
a quad rotor with a two DOF robotic arm, IEEE/RSJ
International Conference on Intelligent Robots and Systems,
pp. 4990-4995, Tokyo, Japan, 2013.
[6] J. Thomas, G. Loianno, K. Sreenath, and V. Kumar,
Toward Image Based Visual Servoing for Aerial Grasping
and Perching, IEEE International Conference on Robotics
and Automation, pp. 2113-2118, Hong Kong, China, June
2014.
- 90 -
TO-3-1-3
Urban Post-Disaster Search and Rescue Solutions with Unmanned Aircraft

Systems
Swee King Phang, Jinqiang Cui, Z. Y. Kevin Ang, Fei Wang, Xiangxu Dong,
Yijie Ke, Shupeng Lai, Kun Li, Xiang Li, Feng Lin, Jing Lin, Peidong Liu, Tao Pang,
Biao Wang, Kangli Wang, Zhaolin Yang, Ben M. Chen*
Unmanned Systems Research Group, National University of Singapore
*bmchen@nus.edu.sg
identify the house numbers and victims in the houses.
Third mission element comprises indoor navigation in a
2-storeys building. The MAVs are required to navigate
from room to room while the ground operator will
identify objects in each room. The last mission element
requires the MAVs to land on the rooftop of the
building and to observe a panel displaying digits on the
opposite building.
This manuscript describes the method and algorithm
used by the team from the National University of
Singapore (NUS) in participating and winning the
iMAV 2014 competition. In addition to the four
mission elements in the competition, a standalone
MAV carrying high gain wireless router is introduced
by the team to act as the data and video link relay to all
the MAVs used in the four missions. The manuscript is
divided into 6 sections. Introduction of the iMAV
competition is made in this section. Solutions to each
of the mission elements using MAVs are described in
Section 2, 3, 4 and 5 respectively. Concluding remarks
are made in Section 6.
Abstract
This manuscript proposes solutions to the problems
given in an international competition (iMAV2014),
which involves micro air vehicles in urban postdisaster search and rescue missions. Solutions to all
four mission elements of the competition which include
real-time map stitching, low altitude navigation,
indoor navigation and roof-top perching are described
in this manuscript. The proposed solutions are tested
and realized in the competition with actual flights.
Keywords: Search and rescue, unmanned aircraft
systems, flight control
1. Introduction
In the recent years, unmanned aerial vehicles
(UAVs) play major roles in many military and civilian
applications, especially in aerial reconnaissance, search
and rescue, and area exploration. While sensors and
processors are getting smarter and smaller in size,
micro-UAVs, or more commonly known as MAVs, are
introduced to replace the large scale UAVs. These
MAVs are more suitable for short missions such as
indoor surveillance [1, 2].
In September 2014, the Mavlab from TU Delft has
organized the International Micro Air Vehicle (iMAV)
competition, which was held in Delft, the Netherlands.
The competition consists of a single mission that
combines both outdoor and indoor mission elements.
The first mission element requires the MAVs to
survey a village and then build an aerial map based on
the images taken by the MAVs. Several obstacles on
the major roads of the village are then identified on the
aerial map. Second mission element requires the MAVs
to navigate from houses to houses in the village, and to
2. Real-Time Map Stitching

The first mission element requires the MAV to fly
above the post-disaster village, at the same time to take
high resolution aerial photos. The photos are then
stitched together to form a complete map of the village.
A downward facing camera is installed on the MAV.
To realize fully automatous flight and onboard image
stitching, two on-board processor layers are designed.
One is used for automatic flight control which includes
take-off, GPS waypoint tracking and landing. The other
processor is used for the vision algorithm captures and
stores onboard images at 5 Hz speed. Given the village
area to be covered in the competition, a sweep pattern
path is generated online automatically from the GPS
- 91 -
ICEIC 2015
coordinates to maximize the image coverage. Once the
designated flight path has completed the last waypoint,
the flight control processor will trigger the vision
processor to start the image stitching process with the
recorded on-board images. With such intelligence, the
image stitching task can be done in-flight and the result
is ready to be rendered to the ground control station
once the MAV returns home
indoor navigation. A real-time path generation

algorithm is implemented, which updates the MAV
trajectory reference based on the targeted waypoint and
obstacles detected by the Lidar sensor.
5. Vision Guided Rooftop Landing

The final mission element of the competition
requires the MAV to perch on a roof-top, while video
survey a number panel placed opposite the building.
To tackle this task, two color cameras were installed
to the MAV. One of the color cameras is used for the
land point detection and poses estimation while another
one is used for surveillance. The algorithm for roof-top
landing employs the vision guidance mechanism. The
relative distance between the MAV and a pre-defined
marker is used to guide the MAV for precise landing.
The marker consists of several cascaded shapes. As
long as at least one shape is detected, the vision
algorithm will use perspective-n-point (PnP) algorithm
to calculate the relative distance and relative poses
between the marker and the MAV. An adaptive
threshold algorithm is developed to handle the changes
in light intensities for outdoor environment.
3. Optical Flow Aided Outdoor Navigation

The second mission element requires a quick
inspection of houses to check whether there are
possible trapped victims. The MAV is required to
navigate to each house, take pictures and recognize
house numbers.
In order to complete the tasks, the MAV is set to
operate below rooftop height to obtain better images of
the house. This renders the GPS signal not consistently
available. To solve the problem, a specific navigation
solution is proposed. Optical flow is used as the main
state estimation method while GPS signal is utilized as
the waypoint guidance. The velocity estimated with
optical flow is transformed to global frame and then
fused with the acceleration measurement in a Kalman
filter [3]. As this conventional method of position
estimation is prone to drifting, the absolute GPS
position is used to guide the MAV to the desired
location. With this method, the MAV is able to fly to
the absolute waypoints eventually.
6. Conclusions
Solutions to the mission elements in the iMAV
competition are proposed in this manuscript. Our team
from the NUS has taken part in the competition and
realized our solutions on actual flights. All mission
elements are carried out in fully autonomous mode,
where no human interference occurs during the
missions. The overall result places the NUS team as the
champion of the competition.
4. Lidar-Based Indoor Navigation

In this mission element, the MAV is required to
penetrate and navigate in a building with unknown
structure and obstacles, at the same time to observe and
identify objects inside the building.
One of the main challenges in this task is to obtain
the MAV ego-motion in an environment where GPS is
totally unavailable. To solve this problem, a 30-meter
scanning laser range finder (Lidar) is utilized, where
the motion of the MAV is estimated based on feature
matching between consecutive Lidar scans. Corners,
lines and end points of line segments are extracted by
the split-and-merge algorithm to be treated as
distinctive geometric features which favor the
matching. An orthogonal structure of the indoor
environment is assumed, which decouples rotational
motion estimation from translational motion. This leads
to a more accurate result and faster processing, where it
can be run on-board at 25 Hz.
Besides motion estimation, an obstacle detection
and avoidance algorithm is realized for robust and safe
References
[1] M. Achtelik, A. Bachrach, R. He, S. Prentice and N.
Roy, Autonomous navigation and exploration of a
quadrotor helicopter in GPS-denied indoor environments,
IEEE Int. Conf. Robotics and Automation, Kobe, 2009.
[2] S. Bouabdallah, P. Murrieri and R. Siegwart, Design
and control of an indoor micro quadrotor, IEEE Int. Conf.
Robotics and Automation, New Orleans, LA, USA, pp.
43934398, 2004.
[3] F. Wang, J. Q. Cui, B. M. Chen and T. H. Lee, A
comprehensive UAV indoor navigation system based on
vision optical flow and laser FastSLAM, Acta Automatica
Sinica, Vol. 39, No. 11, pp. 1889-1900, November 2013.
- 92 -
ICEIC 2015

Oral Session
TO-3-3
Sensors and Images
TO-3-3-1
Video Completion Using Frame-Updated Video Panorama

Semi Jeon1, Eunjung Chae2, Eunsung Lee2, Inhye Yoon2, and Joonki Paik2
1
School of Integrative Engineering, Chung-Ang University
2
Department of Image, Graduate School of Advanced Imaging Science, Multimedia, and Film,
Chung-Ang University
semi2530@gmail.com, nia38@cau.ac.kr, lessel7@cau.ac.kr, inhyey@gmail.com,
paikj@cau.ac.kr
Abstract
This paper presents a video completion algorithm to
fill-in the missing boundary of a stabilized video. For a
seamless completion of video boundaries, the proposed
algorithm first generates a video panorama, and
provides each frame without missing boundaries.
Keywords: Video stabilization, video completion.
1. Introduction
Video completion is an important post-processing of
video stabilization to reconstruct missing boundaries
that are lost in the process of frame registration [1].
Traditional video stabilization method enlarges the
center region of each video frame to cover the missing
boundaries, but recently video completion can
reconstruct those boundaries without enlarging the
frames [2].
As shown in Fig. 1, the upper-left four control

points define the first rectangular patch. In the next
adjacent from those motion vectors of the four corner
points are estimated. The pair of sets of four corner
points in the current and the next frames characterizes
the projective transformation between two patches.
Likewise projective transformation of the rest patches
are estimated. Since each projective transformation are
performed based on four corner points, the patch-based
transformed version of the next frame can cover any
type motions and distortions using a sufficiently large
number of control points.
3. Generation of Video Panorama

The resulting video panorama is shown in Fig. 2.
Since the generated video panorama has a sufficiently
large size, any stabilized video frame inside this area
can be displayed without missing boundaries.
2. Projective Transformation of Multiply

Divided Patches
In generating a video panorama, registration of
adjacent video frames involves a general camera
motion, randomly moving objects, and threedimensional distortion. In order to deal with all of these
problems in a single registration framework, we divide
the image into multiple patches by assigning a prespecified number of control points as shown in Fig. 1.
Fig. 2: The generated video panorama using 35 frames.
4. Conclusion
Fig. 1: Sixteen control points that divide the image into

nine patches
- 94 -
The proposed video completion algorithm generates

video panorama based on the projective transformation
of multiply divided patches in each frame. By choosing
an appropriate number of patches, the proposed
algorithm covers general motion of a camera in the
process of generating the panorama. As a result, the
full-frame video stabilization is possible without
enlarging the center part of each frame.
ICEIC 2015
Acknowledgment
This work was supported by the ICT R&D program of
MSIP/IITP [14-824-09-002, Development of global
multi-target
tracking
and
event
prediction
techniques based on real-time large-scale video
analysis], by the MSIP(Ministry of Science,
ICT&Future
Planning),
Korea,
under
the
ITRC(Information Technology Research Center)
support
program
(NIPA-2014-H0301-14-1044)
supervised by the NIPA(National ICT Industry
Promotion Agency), and by the Technology Innovation
Program (Development of Smart Video/Audio
Surveillance SoC & Core Component for Onsite
Decision Security System) under Grant 10047788.
References
[1] Y. Wexler, E. Shechtman, and M. Irani, Space-Time
Video Completion, Proc. IEEE Computer Vision, Pattern
Recognition, 2004.
[2] Y Matsushita, et al., Full-Frame Video Stabilization
with Motion Inpainting, IEEE Trans. Pattern Analysis,
Manchine Intelligence, vol. 28, no. 7, July 2006.
- 95 -
TO-3-3-2
Fast Up-scaling Method for UHD Imaging System Using Combined

Directional Interpolation and Local Self-similarity
Soohwan Yu, Wonseok Kang, and Joonki Paik
Department of Image, Chung-Ang University, Seoul, Korea
shyu4184@gmail.com, ipis.kang@gmail.com, paikj@cau.ac.kr
by adding the estimated high-frequency components to
the initially estimated HR image x 0.
Abstract
This paper presents a novel up-scaling method
using combined directional interpolation and local
self-similarity method. The proposed method magnifies
the FHD to the UHD image without blurring and
jagging artifacts compared to the conventional upscaling methods.
Keywords: up-scaling, super-resolution.
(a)
(b)
(c)
Fig. 1. Four times up-scaling results from the FHD image: (a)
the input FHD image, (b) Freemans method [3], (c) the
proposed method.
1. Introduction
The conventional up-scaling methods generate the
blurring and jagging artifacts around edge regions in
the magnified image. To solve this problem, this paper
presents the up-scaling method from the FHD to UHD
image using combined directional interpolation [1] and
local self-similarity [2].
4. Conclusion
The experimental results show that the proposed
method magnifies the FHD to UHD image without
blurring and jagging artifacts compared with the
advanced up-scaling method.
2. Proposed method
The degradation model of LR (low-resolution) to
HR (high-resolution) image is given by
y = (x B) #d :
(1)
where, y denotes the FHD image as LR image, x
denotes the UHD image as the restored HR image, #d
is a down-sampling operation, is a convolution
operator, and B is the blur kernel.
For the initially estimated HR image x 0 , the LR
image y is magnified using directional up-scaling
method [1] without jagging artifacts in the edge regions.
The lost high-frequency components in the up-scaling
process are compensated from the estimated highfrequency using the local self-similarity [2] method and
logarithmic transform.
The lost high-frequency components in the
convolution with blur kernel B are estimated using
local self-similarity between the LR image y and
initially estimated HR image x 0 in the logarithmic
transform domain. Finally, the HR image x^ is restored
- 96 -
Acknowledgement
This work was supported by the ICT R&D program
of MSIP/IITP. [14-824-09-002, Development of global
multi-target
tracking
and
event
prediction
analysis], by the Ministry of Culture, Sports and
Tourism(MCST) and Korea Creative Content
Agency(KOCCA) in the Culture Technology(CT)
Research & Development Program
References
[1] W. Kang, J. Jeon, E. Lee, C. Cho, J. Jung, T. Kim, A.
Katsaggelos, and J. Paik, Real-time super-resolution for
digital zooming using finite kernel-based edge orientation
estimation and truncated image restoration, Int. Conf. Image
Processing, IEEE, pp. 1311-1315. September 2013.
[2] G. Freedman and R. Fattal, "Image and video upscaling
from local self-examples," Trans. on Graphics, ACM, vol. 30,
no. 2, pp. 111, April 2011.
[3] W. T. Freeman, T. R. Jones, and E. C. Pasztor,
Example-based super resolution, Computer Graphics and
Applications, IEEE, pp. 1222-1239, November 2001.
TO-3-3-3

!

"
#
!$%&
)('*((!

/-
"',. + .+01

, +./
+0,0+. 0/,. + .+0

/ " . % /

&,
$)&. /

- % . % / . % /

#

% .
)
)
)
-.-
1

+ #

)
% .

-

. .
.
-
) )

.
& 2&3 )
-
. . )1 .
+
!

!
"
#"

#$

" %
&
' """

%

&
. % / ) . % /
. % / &

*) . % /
2) . % /3+ 0&1

. /
" !

) . % / "
-

% (!
) . % / &
4

"
"

"" )

. % 5
5
/ 5
0 0

.7/
6 & ./

0
6 & ./

80 %&
./
./
"#(

&

#'
)

%"&

*"+

. % / . % 5
5
/ 5
0 0

' ""

(!
) "

* +& ,
(! $
- "

2) . % /3
2) . % /3
) &
6 $

. % /

$
$"

) . % /

9 "
""

$
&
,

' ""$;:$ ,&< $

=;" '
.<=;'/= %
=9$.>==9/ ='$.='/
# ?(%"

&

./
* +(& @ A( % ,

6
;
,% $" B,
"%
%&C0 ""&D 0008&
- 97 -
TO-3-3-4
Fast Semantic Place Recognition Using Bag of Features and Support Vector
Machine
Semi Jeon1, Eunjung Chae2, Eunsung Lee2, Inhye Yoon2, and Joonki Paik2
1School of Integrative Engineering, Chung-Ang University
2Department of Image, Graduate School of Advanced Imaging Science, Multimedia, and Film,
semi2530@gmail.com, nia38@cau.ac.kr, lessel7@cau.ac.kr, inhyey@gmail.com,
paikj@cau.ac.kr
Abstract
This paper presents a Semantic Place Recognition
algorithm using bag-of-features and support vector
machine. The proposed place recognition method is
suitable for input images and can be applied for robot
vision, medical imaging, and navigation systems.
Keywords: place recognition, bag of feature, support
vector machine
1. Introduction
One of the main research challenges in mobile robotics
is to provide robots the capability to move autonomously
in real world unconstrained scenarios [1]. Therefore over
the past few decades, many place recognition method have
been proposed. The conventional place recognition method
used nearest classification [2]. But, these method occur
wrong results because include the outliers.
2. Learning based Place recognition

The block diagram of the conventional place recognition
is shown in Fig.1.
Fig. 1: the convention place recognition algorithm

The proposed method consists of three steps: i) creating
visual word using features, ii) learning training and test
image, and iii) estimation of place using support vector
machine with visual cue.
It is based on the popular bag of features. First, Visual
word is created using dense scale-invariant feature
transform and k-mean clustering. The SIFT descriptor
computes a gradient orientation histogram within the
support region. For each of 8 orientation planes, the
gradient image is sampled over a 4x4 grid of locations,
thus resulting in a 4x4x8=128-dimentional features vector for
each region. A Gaussian window function is used to assign
a weight to the magnitude of each sample point. This
- 98 -
makes the descriptor less sensitive to the small changes in

the position of the support region and puts more emphasis
on the gradients that are near the center of the region.
And then, the visual word is computed by using k-mean
clustering as
(1)
where represents the mean of -th cluster, the points,
learning of training and test image is repeated.
Finally, we estimate the place by using support vector
machine. For classification, a decision function for a test
sample has the following as

(1)
where represents the class label of , the learned
weight of the training sample, and the learned threshold
parameter, the value of a kernel function for the
training sample and the test sample .
Performing of these procedure, the finally place
estimation is obtained by finding a max values.
For evaluating quantities, we training set 15 categories.
Table I shows mean of accuracy values and the confidence
matrix of different algorithm. The result of nearest method
had a lower accuracy values better than the proposed
method. Experimental results of place recognition are
shown in Table II.
TABLE I. ACCURACY VALUES AND
CONFIDENCE MATIRX
Nearest Method
Proposed Method
0.531
0.659
ICEIC 2015
TABLE II. RESULT OF PLACE RECOGNITION
Category
name
Accuracy
office
0.760
suburb
0.860
Forest
0.950
Sample training
images
Sample true
positives
4. Conclusion
In this paper, we proposed place recognition by using
bag of features and support vector machine. Traditional
place recognition methods refer nearest pixel so it had a
lower accuracy of the place recognition. As a result,
experimental results showed that the proposed place
recognition algorithm is suitable for input images and can
recognize place with high accuracy and fast computation
by using bag-of-features. The proposed place recognition
algorithm can be applied for not only robot vision but also
medical image processing and computer vision.
Acknowledgment
MSIP/IITP [14-824-09-002, Development of global multitarget tracking and event prediction techniques based on
real-time
large-scale
video
analysis],
by the
MSIP(Ministry of Science, ICT&Future Planning), Korea,
under the ITRC(Information Technology Research Center)
support program (NIPA-2014-H0301-14-1044) supervised
by the NIPA(National ICT Industry Promotion Agency),
and by the Technology Innovation Program (Development
of Smart Video/Audio Surveillance SoC & Core
Component for Onsite Decision Security System) under
Grant 10047788.
References
[1] G. Costante, T. A. Ciarfuglia, P. Valigi, and E. Ricci, A
Transfer learning approach for multi-cue semantic place
recognition, IEEE/RSJ International Conference on Intelligent
Robots and Systems, pp. 2122-2129, November 2013.
[2] J. Luo, A. Pronobis, and B. Caputo, SVM-based transfer of
visual knowledge across robotic platforms, Proceedings of the
5thInternational Conference on Computer Vision Systems, pp.112, November 2006.
- 99 -
TO-3-3-5
Exact Asymmetric Point Spread Function Estimation for Image Restoration

Minseo Kim1, Seonhee Park1, Eunjung Chae2, Eunsung Lee2, Inhye Yoon2, and Joonki Paik2
1
School of Integrative Engineering, Chung-Ang University
2
Department of Image, Graduate School of Advanced Imaging Science, Multimedia, and Film,
kmse706@cau.ac.kr, tjsgml1463@hanmail.net, nia38@cau.ac.kr, lessel7@cau.ac.kr,
inhyey@gmail.com, paikj@cau.ac.kr
1
1
Dh = - y (i -1, j ) + 0 y (i, j ) + y (i + 1, j ),
2
2
(4)
1
1
Dv = - y (i, j -1) + 0 y (i, j ) + y (i, j + 1),
2
2
Abstract
This paper presents an exact asymmetric point
spread function (PSF) estimation. For estimation of
exact asymmetric PSF, we first analyze step responses
by using edge profile in horizontal and vertical
directions, and then correct PSF error using the PSF
data set.
Keywords: Asymmetric point spread function, image
restoration, PSF data set.
1. Introduction
In spite of the improvement in image processing,
image degradation still cannot be avoided because of
sensor characteristics and atmospheric environment.
Moreover, the degraded images have asymmetric point
spread function (PSF), and the performance of image
restoration is reduced in a symmetric blurring model
[1].
To overcome these problems, we propose
estimation of exact asymmetric PSF. The proposed
algorithm consists of two steps; (i) an initial PSF
estimation using directional step responses and (ii)
error correction using PSF data set.
The edge directions which are vertical and

horizontal direction compute 1D step response using
computed the edge pattern [3]. After computing step
response, we estimate 1D PSF of two directions using
the differential of 1D step responses. A real PSF,
however, is different to the initial PSF.
To correct error, we use the PSF data set. Each PSF
of data set is applied to the initial PSF, and for
searching an optimal corrected PSF, we use an image
restoration and PSF quality estimation.
2. Exact Asymmetric PSF Estimation

The proposed algorithm consists of two steps; (i) an
initial PSF estimation using directional step responses
and (ii) error correction using PSF data set.
For computing PSF, we estimate the initial PSF by
using two directional PSFs and then the dictionary
PSFs correct the initial PSF for accurate PSF
estimation. To compute the initial PSF, edges should
be detected, where Canny edge detector is employed
[2]. And the edge direction in the detected edge
region are computed as
= arctan( Dv , Dh ),
(3)
where arctan() is the arctangent. And Dv and Dh are
(a)
(b)
(c)
(d)
Fig 1. The proposed asymmetric PSF estimation; (a)
the test edge target image, (b) the degraded image,
(c) the original PSF, and (d) the estimated PSF
using the proposed method
- 100 -
ICEIC 2015
We first evaluated the proposed algorithm using
synthetic edge target, as shown in Fig. 1(a). Fig. 1(b) is
a degraded image with 5x11 Gaussian PSF and
assumed noise free. Fig. 1(c) and (d) respectively show
original and estimated PSFs, and the estimated PSF is
similar to original PSF. As shown in Fig. 1, the
proposed algorithm successfully estimated asymmetric
PSF.
4. Conclusion
In this paper, we introduced an asymmetric PSF
estimation using directional step response and PSF data
set. The proposed method could estimate asymmetric
PSF exactly because of directional PSF error correction
and the performance of restoration methods is
improved. As a result experimental results show that
effectiveness of our method for asymmetric PSF
estimation.
Acknowledgment
MSIP/IITP [14-824-09-002, Development of global
multi-target
tracking
and
event
prediction
analysis], by the MSIP(Ministry of Science,
ICT&Future
Planning),
Korea,
under
the
ITRC(Information Technology Research Center)
support
program
(NIPA-2014-H0301-14-1044)
supervised by the NIPA(National ICT Industry
Promotion Agency), and by the Technology Innovation
Program (Development of Smart Video/Audio
Surveillance SoC & Core Component for Onsite
Decision Security System) under Grant 10047788.
References
[1] A. Matakos, S. Ramani, and J. Fessler, Image restoration
using non-circulant shift-invariant system models, in
Proc. Int. Conf. Image Process. IEEE, 2012, pp. 3061
3064.
[1] J. Canny, A computational approach to edge detection,
IEEE Trans. Pattern Anal. Mach. Intell, no. 6, pp. 679
698, November 1986.
[2] V. Maik, D. Cho, J. Shin, and J. Paik, Regularized
restoration using image fusion for digital auto-focusing,
IEEE Trans. Circuits Syst. Video Technol. vol. 17, no. 10,
pp. 13601369, October 2007.
- 101 -
TO-3-3-6
A Dual-Exposure In-Pixel Charge Subtraction CTIA

CMOS Image Sensor for Centroid Measurement in
Star Trackers
Xinyuan Qian1 , Menghan Guo1 , Hang Yu1 , Shoushun Chen2 and Kay Soon Low1
1
Satellite Research Center, 2 VIRTUS IC Design Center of Excellence,

Nanyang Technological University, Singapore
AbstractIn this work, we present a CMOS image sensor

for star centroid measurement in star trackers. The analysis
of the star tracker system shows that long integration will
cause tail effect in the star image. It significantly reduces
the signal magnitude, which in turn increases the centroiding
errors. In order to capture limited photons generated from
dim stars within shortened integration time, we propose a new
capacitive transimpedance amplifier (CTIA) pixel architecture
with a small integration capacitor. On the other hand, bright stars
can easily saturate the pixels, which can also induce significant
measurement errors. To avoid pixel saturation, the pixel is able
to perform in-pixel charge subtraction based on photocurrent
thresholding. In order to validate the pixel design, we have
fabricated a test chip consisting of a 44 pixel array using Global
Foundry 65 nm mixed signal CMOS process.
Lens
star
catalog
star
centroiding
star pattern
recognization
CMOS
Image Sensor
Fig. 1.
Block diagram of a typical star tracker.
pixel circuits. Section IV describes the sensor implementation

and measurement results. Conclusions are drawn in Section V.
II. S YSTEM A NALYSIS
I. I NTRODUCTION
A star tracker is an optical-electronic device to produce the
3-axis attitude information of a spacecraft by observation of
the star field. It can achieve an angular accuracy in the range
of arcseconds [1] and currently is the most accurate among
all existing attitude sensors. Fig. 1 illustrates the diagram of a
typical star tracker, which is composed of an image sensor and
associated signal processing electronics. The image sensor first
captures a star field. Centroids of the stars are then computed
to build a star pattern. After that, the pattern is passed to a
recognition algorithm to determine the attitude [2].
The recognition accuracy has a strong dependance on the
precision of the star centroids. Due to satellite orbit, a short
exposure time is preferred to achieve the desired accuracy.
However, shorter exposure time implies higher requirement on
the sensitivity and signal to noise ratio. High dynamic range is
equally important in this application. A typical star tracker has
can detect six visual magnitude levels, which means a dynamic
range of more than 90 dB with acceptable SNR. High dynamic
range allows to capture both very bright and dark stars in the
same scene.
In this work, we propose a CMOS image sensor for star
tracker. The effects of the pixel sensitivity and dynamic range
on the measurement of star centroid are discussed. We propose
a new pixel architecture that is capable of provide both high
sensitivity and high dynamic range. The rest of the paper is organized as follows: Section II introduces system analysis of the
sensor design. Section III describes the sensor architecture and
Stars generate limited number of photons on the focal plane.

Using the Sun (MV =-26.76 and solar flux of 1.3 kW/m2 ) as
reference, we can derive any other stars luminance. By taking
into such factors as luminance spectral distribution, photodetectors quantum efficiency (QE) and lens point spread
function (PSF), it is possible to estimate the number of
generated photons received by the sensor. For a star tracker
with 3 cm lens aperture, 85% lens transmission efficiency, 1
pixel PSF, and 50 ms exposure time, a MV =6 star can only
generate about 300 photoelectrons at the center pixel of the star
[3]. This is challenging for CMOS image sensor, in particular,
under space radiation environment.
However, increasing the integration time is not helpful in
star tracker. In fact, longer exposure time leads to systematic
error due to the satellite orbiting, which is shown in Fig. 2. The
orbital movement of the satellite causes the star image to drift
in reverse direction on the focal plane. The shift distance(L)
can be expressed as:
L=
Npix Tint
(pixels)
2 tan(F OV /2)
(1)
where Npix is the pixel number in one dimension of the pixel

array, is the angular rate, Tint is the integration time and
F OV is the field of view of the star tracker. A low-earth orbit
(LEO) satellite at the altitude of 600 km has an angular rate
of 0.06 deg/s. For a CMOS image sensor with 1000 pixels in
one dimension and 20 deg F OV , 100 ms integration time can
produce a shift of 0.3 pixel. The center of the star will shift
to other pixels and the incident photons will spread over more
- 102 -
ICEIC 2015
=0.06deg/s
lens
= tint
FOV/2
F = Npixdpix/2tan(FOV/2)
dpix
focal plane
Npix
L = F /dpix (pixels)
Fig. 2. Systematic error due to satellite orbit: stars travel on the focal plane.
The travel distance L is expressed in pixels in one dimension, where dpixel
is the pixel pitch.
Pixel Value (DN)
Star center
A'
200
150
which again causes centroiding error. The extension of dynamic range is thus required. As a result, the solution to all
the contradictions is a CMOS image sensor with both high
sensitivity and high dynamic range. We propose a new sensor
architecture based on CTIA pixel [5][6][7] for high sensitivity.
High dynamic range is achieved by a dual-exposure in-pixel
charge subtraction scheme. The first exposure measures the
light intensity with a saturation threshold and if saturation is
found, a packet of charges is subtracted from the integration
results during the second exposure. The resulting effective well
capacity is increased and a wider range of photocurrent can
be quantized. As shown in Fig.4, the scheme differs from the
conventional method in that there is no readout time in two
exposures, which would otherwise be long due to large pixel
array. This will minimizes the systematic error and is better
suited for this application.
100
50
III. I MAGE S ENSOR D ESIGN
0
0
10
15
20
25
Pixels on AA
A. Pixel Circuit
Star shift
B'
Pixel Value (DN)
(a)
200
Star energy is spread

over more pixels
150
100
50
0
0
10
15
20
25
Pixels on BB
(b)
Fig. 3. (a) shows simulated star images and its pixel responses along A-A
with no shift distance, respectively. (b) shows simulated star images and its
pixel responses along B-B with shift distance, respectively. They are captured
with the same integration time. Tail effect is obvious which reduces the signal
magnitude significantly.
pixels when integration time is further increased. This forms

the tail effect. Fig. 3 shows the simulated star images under
both static and dynamic condition. In dynamic condition, the
shift causes the star energy to spread over more pixels but is
not beneficial for increasing signal magnitude.
Therefore, for improved centroiding accuracy, the image
sensor should be a global shutter. It is necessary to increase
the sensitivity against the shortened exposure time. Although,
high sensitivity can easily cause bright stars to saturate [4],
Long readout time between exposures
causes large systematic error
1st exposure
2nd exposure
readout
readout
t
(a)
1st exposure 2nd exposure
readout
(b)
Fig. 4. Global-shutter timing difference between (a) conventional and (b)

proposed dual-exposure high dynamic range method. In conventional method,
there is a frame readout between two exposures. The readout time can be
several milliseconds long. For example, 100 ms is expected if we assume an
array of 2M pixels with 20MHz clock frequency. It causes a shift of 0.3 pixels
on focal plane between two exposures, which adds to the centroiding error.
The schematic of the pixel circuits is shown in Fig.5.

Fig.5 (a) illustrates the functional block diagram of the pixel
architecture. The pixel has an integrator to accumulate the
photocurrent. The output of the integrator (Vo ) of the first
exposure is compared with a threshold reference to denote
whether the pixel is saturated. Its result is latched in the DFF
and used to decide whether to apply charge subtraction in
the consecutive second exposure. If the pixel is saturated, an
externally-produced voltage (Vsub ) is subtracted from Vo .
The pixel consists of a photodiode, an operational transconductance amplifier (OTA), a reset switch, switched-capacitor
circuits, a comparator with latch and a clamp circuit followed
by a source follower for readout. The photodiode, the OTA,
the reset switch and the integration capacitor Cint , forms
the fundamental CTIA pixel, whereas the OTA, Cint and
Csub constitutes the circuit for charge subtraction. The clamp
circuit is used for in-pixel Correlated Double Sampling (CDS).
The source follower drives the column bus when the row is
selected.
In CTIA pixel, the photodiode voltage is held at a constant
value by the OTA so the photocurrent(Iph ) will flow to
discharge the integration capacitor. The output follows:
Z
1
Vo
Iph dt
(2)
Cint
The schematic of the OTA (Fig. 5(b)) is a single-ended
cascode common-source amplifier. The reset switch (Fig. 5(c))
consists of three NMOS transistors and an inverter instead
of one simple NMOS transistor. During integration, the node
between M 1 and M 2 is tied to an externally-produced bias
voltage (Vim ) close to Vi . So the leakage path from Vo to Vi is
eliminated when Vo builds up. The comparator (Fig. 5(d)) is a
five-transistor OTA used in open-loop configuration followed
by a digital buffer.
- 103 -
ICEIC 2015
RST
Vi
Vramp
M1
M2
M3
RST
Vsub 0
SC
amplifier
Vramp
Compare and latch the result in

DFF during 1st exposure
Vo
Apply charge subtraction
during 2nd exposure based
on DFF value
(c)
1 0
If DFF=1, Vsub is selected and
subtracted from Vo during 2nd
exposure
Vim
VDD
SUB
NSUB
RST
Csub
Vi
Vbp
-A
Ccds
SH
CDS
(b)
Vo
Vo
DFF
Vref
NSUB
CDS &
Readout
(a)
VDD
Vcds
Vpix
Vo
RSL
VDD
Vclamp
Vcp
Pixel circuit
Vcn
iph
Vref
Cint
VDD
FLAG/SUB
D
Vo
Vi
COL
VREF
(d)
Fig. 5. The schematic of the pixel circuit. (a) Pixel functional block diagram, (b) the schematic of the OTA, (c) the reset switch and (d) the comparator are
shown respectively.
integration result does not reach the voltage threshold defined

by Vref , as the case in Fig. 6(a), the comparator will not toggle
and trigger the D-type register. Hence, both exposures have the
same response. The photocurrent can be simply expressed as:
Dark Pixel
V
No saturation
Vref
Vo
Rst
Rst
1st Exposure
2nd Exposure
Readout
Iph =
(a)
DFF is triggered (D=1) and

configures the SC circuits to
subtract charges during 2nd
exposure.
Bright Pixel
Saturation
Equivalent
Vsub=Csub/CintdVramp
Vref
Vramp
Rst
1st Exposure
Vo
Rst
2nd Exposure
dVramp
Readout
Apply Vramp
Iph =
Pixel operation timing diagram.
(3)
Once integration result reaches the voltage threshold and

comparator toggles, as the case in Fig. 6(b), the outputs of
the register are used to reconfigure the switches associated
with Csub . It connects Csub to a column bus driven by a ramp
signal (Vramp ). During the second integration period, the ramp
signal starts to rise as the integration starts. The photocurrent
can then be expressed as:
(b)
Fig. 6.
Cint Vo
Tint
Cint Vo + Csub dVramp

Tint
(4)
Since the DFF stores the information whether the pixel conducts charge subtraction, the pixel outputs both analog voltage
(Vo ) and one-bit digital signal for image reconstruction.
B. Pixel Operation
Fig. 6 shows the timing diagram of the pixel circuit. The
pixel operation features two identical-length exposure and
the scheme of charge subtraction based on the photocurrent
evaluation in the first one. The pixel can be self-configured
based on the photocurrent thresholding result. The details of
the pixel operation is described as follows.
The pixel is reset before each exposure. At the same time,
the transistor controlled by CDS is turned on. After that, it is
turned off a short delay after reset switch is turned off. In this
manner, the reset level of the OTA, including negative charge
injection of reset switch, the reset noise and OTA offset is
clamped onto Ccds .
During the first exposure, if the photocurrent is small and the
IV. P ROTOTYPE C HIP AND M EASUREMENT R ESULTS

Fig. 7(a) shows the test setup with the prototype chip. The
sensor is illuminated by back-lit point sources in a dark room.
Fig. 7(b) and (c) shows the prototype chip and pixel layout
implemented using 3.3 V devices with Global Foundries 65 nm
CMOS mixed-signal process, respectively. The array contains
44 pixels, which is sufficient to evaluate its accuracy in star
centroid measurement. The peripheral circuits include a row
scanner, a column scanner and a global analog buffer (not
shown). The pixel is 2222 m2 and uses a 10.8 m5.9
m N-well/P-sub photodiode with a parasitic capacitance of
about 40fF. All in-pixel capacitors are MIM capacitors. Cint
and Csub are equally designed to be about 10 fF, which gives
- 104 -
ICEIC 2015
Global Foundry 65 nm mixed-signal CMOS

2222 m2 (Fill Factor: 14%)
16 V/e160mV - 1.4V
3.8 V/luxs
48 fA
980 V (61 e-)
0.57%
77500 e- (265000 e- with charge subtraction)
62 dB (74 dB with charge subtraction)
a CTIA gain of about four. In order to improve inter-capacitor

matching, Csub and Cint are placed next to each other and
active devices are placed away from the capacitors. The value
of Ccds is selected to be 28 fF.
Fig. 8 shows the measured photocurrent with regard to
incident light intensity. With 1 ms integration time, the pixel
saturates at about 300 lux. After performing charge subtraction, the pixel saturates at around 1100 lux. This amounts
to approximately 12 dB increase of the dynamic range. The
sensitivity is 3.8 V/luxs with conversion gain of 16 V/e-.
The readout noise seen at the output is about 0.98 mVrms .
Chip characteristics are summarized in Table. I.
Point sources are used to simulate star signals. We apply
centroiding algorithm in [3] to assess the centroiding accuracy.
The point sources are projected onto the centers of the pixel
A, B and C alternatively, as shown in Fig. 7(b). The three
centroids are calculated and their measured distance AB
and AC are compared. Fig. 9 shows this measured distance
error at different integration time. The centroiding accuracy
increases with exposure time since the accuracy benefits from
the increased signal magnitude and its SNR. After about 80
ms exposure in this test, the star pixels begin to saturate
gradually. No further obvious improvement on centroiding
accuracy is observed since the photocurrent measurement
is distorted. But with the charge subtraction, the pixel still
can quantize the photocurrent until about 120 ms and the
centroiding accuracy continues increasing.
V. C ONCLUSION
The design of a centroid measurement CMOS image sensor
for star trackers is described. For accurate starlight measurement in shortened integration time, a new CTIA pixel
architecture is proposed. In order to increase the centroiding
22 m
Row Scanner
Back-lit
point source
Pixel Array
NW/P-sub
Photodiode
Csub
OTA
Cint
RST
Ccds
Dark room
SF
Comparator with Latch
Sensor & FPGA

Column Scanner
(a)
Fig. 7.
layout.
(b)
10
DR~62dB
4
10
DR~74dB
10
with charge
subtraction
10
saturation at
300lux
10
1
10
10
10
10
10
10
Input Light Intensity (lux)
(c)
(a) Test setup, (b) prototype chip microphotograph and (c) pixel
Fig. 8. Measured photocurrent with regard to incident light intensity. The

pixel saturates at around 300 lux. With charge subtraction, the dynamic range
increases by approximately 12dB and saturates at around 1100 lux.
Distance (ABAC) Error (pixels)
Technology
Pixel Size
Conversion Gain
Signal Swing
Sensitivity
Dark Current
Temporal Noise
Linearity
Well Capacity
Dynamic Range
Reconstructed Photocurrent (fA)
TABLE I
P ERFORMANCE S UMMARY OF THE S ENSOR
0.3
0.25
0.2
0.15
0.1
without charge subtraction
with charge subtraction
0.05
20
40
60
80
100
120
Integration Time (ms)
Fig. 9. Measured AB AC distance error at different integration times.

Saturation occurs in stars after about 80 ms. But with charge subtraction,
centroiding accuracy improves much better compared with saturated one.
accuracy of bright stars that can easily cause saturation, the

pixel features a scheme of pixel-level charge subtraction. It
allows the pixel to conduct charge subtraction decided by
photocurrent thresholding in two consecutive exposures. A
proof-of-concept chip consisting of a 44 pixel array is
fabricated in Global Foundry 65 nm mixed-signal CMOS
process.
VI. ACKNOWLEDGEMENT
This work is supported by ACRF Project(M4020153.040).
R EFERENCES
[1] C. Liebe, L. Alkalai, G. Domingo, B. Hancock, D. Hunter, J. Mellstrom,
I. Ruiz, C. Sepulveda, and B. Pain, Micro APS based star tracker,
in 2002. IEEE Aerospace Conference Proceedings, vol. 5, 2002, pp. 5
228552299 vol.5.
[2] M. Pham, K.-S. Low, and S. Chen, An Autonomous Star Recognition
Algorithm with Optimized Database, IEEE Transactions on Aerospace
and Electronic Systems, vol. 49, no. 3, pp. 14671475, 2013.
[3] C. Liebe, Accuracy Performance of Star Trackers - A Tutorial, IEEE
Transactions on Aerospace and Electronic Systems, vol. 38, no. 2, pp.
587 599, apr 2002.
[4] X. Qian, H. Yu, S. Chen, and K. Low, An Adaptive Integration Time
CMOS Image Sensor With Multiple Readout Channels, IEEE Sensors
Journal, vol. 13, no. 12, pp. 49314939, 2013.
[5] S. Kavusi, K. Ghosh, and A. El Gamal, A Per-Pixel Pulse-FM Background Subtraction Circuit with 175ppm Accuracy for Imaging Applications, in IEEE International Solid-State Circuits Conference, 2007.
ISSCC 2007. Digest of Technical Papers., 2007, pp. 504618.
[6] K. Murari, R. Etienne-Cummings, N. Thakor, and G. Cauwenberghs,
A CMOS In-Pixel CTIA High-Sensitivity Fluorescence Imager, IEEE
Transactions on Biomedical Circuits and Systems, vol. 5, no. 5, pp. 449
458, 2011.
[7] R. Xu, B. Liu, and J. Yuan, A 1500 fps Highly Sensitive 256 X 256
CMOS Imaging Sensor With In-Pixel Calibration, IEEE Journal of SolidState Circuits, vol. 47, no. 6, pp. 14081418, 2012.
- 105 -
TO-3-3-7
Incident Light Angle Detection Technique Using

Polarization Pixels
Vigil Varghese, Shoushun Chen
VIRTUS IC Design Centre of Excellence, School of Electrical and Electronic Engineering
AbstractIn this paper we present the design and analysis

of a CMOS image sensor pixel capable of detecting the angle of
incident light. Determining the angle is of paramount importance
in reconstructing the 3D information of the imaged scene. These
pixels achieve this by including polarization gratings on top
of the photodiodes in each pixel. Three different pixels, each
with different grating orientation produce enough information
to determine the local incidence angle. Because of the symmetric
nature of the response for positive and negative angles, another
set of pixels, called the linear quadrature pixel cluster has
been included to break the symmetry and provide greater angle
resolution. We present the simulation results as well as the design,
which is targeted towards GlobalFoundries 65 nm CMOS mixedsignal process.
Index TermsPolarization detection; linear quadrature pixel
cluster; angle estimation; CMOS image sensor.
The polarization angle detection technique that we present

here is generic, in the sense that, along with angle detection
we can use the sensor for a variety of applications that depend
on polarization information contained in light captured by the
sensor. This paper mainly deals with angle detection, which is
a pressing problem that has to be solved in order to accurately
reconstruct a 3D imaged scene. Integrated solutions such as
the Talbot pixels have serious limitations in terms of pixel
resolution and sensitivity. The easiest approach to increase the
sensitivity is to increase the size of the photodiode. But this
leads to lower pixel resolution. The technique that is presented
here requires far fewer number of pixels for achieving a wide
angle resolution compared to the Talbot pixels, resulting in
angle and pixel resolution that are superior to any integrated
approach that has been demonstrated so far.
I. I NTRODUCTION
3D image capture is considered as the next revolutionary
step in the field of image sensors. Research is currently
focused on the many methods for capturing 3D images like
Time-of-Flight (ToF) [1] and multi-aperture [2] to name a
few. These methods either require an active light source or a
number of pixels working in cohesion to achieve the objective.
Although highly accurate results were demonstrated using
some of these methods, they have serious limitations in terms
of power consumption, chip area, highly complicated setup and
requirement of specialized components. These factors limit
their wide scale commercial adaptation.
Recently an on-chip method - one that uses diffraction
related Talbot effect to determine the local incidence angle was
proposed and demonstrated [3]. Although the results were far
from satisfactory and involved complex data processing, the
method showed an alternative way for capturing 3D data. It has
been demonstrated that by capturing the local incidence angle
and intensity of the incoming light, complete 3D information
of the imaged scene can be reconstructed. Keeping in line with
this latest trend we present yet another alternative method for
capturing the 3D data - one that uses polarization.
Polarization imaging has been around for decades and
many applications of the technique have been successfully
demonstrated. Typical wide scale use of polarization imaging
has been limited to applications like reducing the glare of
captured image in outdoor settings (notably involving water
or hazy atmosphere) [4] and to classify materials based on
their reflectivity for applications involving object recognition
[5].
II. BACKGROUND I NFORMATION

Light is a transverse electromagnetic wave in which the
electric field, magnetic field and the direction of propagation
are all orthogonal to each other. Polarization is a phenomenon
associated with transverse electromagnetic waves in which
the electric field (or magnetic field) of an EM wave shows
preference for vibration along a particular direction. If the
polarization direction is completely random, then such waves
are said to be unpolarized waves or randomly polarized waves.
Majority of the naturally available light sources and a large
number of manmade light sources are randomly polarized.
Polarization is a hidden phenomenon as far as humans are
concerned. The human eye is incapable of detecting polarization in light, unlike intensity (which manifests as brightness)
and wavelength (which manifests as color).
When introduced to a wire gird polarizer, light with any arbitrary polarization becomes linearly polarized. Earlier, external polarizers (PVA polymers or aluminium nano wires) were
placed on top of the photodiodes to capture the polarization
component of light. This required careful alignment and calibration of polarizers on top of the pixel array. The results were
prone to errors arising out of misalignment between polarizer
and pixel array, and optical crosstalk between adjacent pixels
because of thick polarizer layer on top of them. Because of
the advancement in technology, wire grid polarizers can now
be fabricated on-chip, right above the photodiodes using any
of the routing metal layers. Although this alleviates some of
the problems, low light transmittance onto the photodiode and
low extinction ratios are still a concern.
- 106 -
ICEIC 2015
Light Source
Light Source
Pixel A
Y
Pixel C
Pixel B
Metal block
Pixel D
Vertical Polarizer
N-well
N-well
P - substrate
Horizontal Polarizer
Diagonal Polarizer
N-well
N-well
P - substrate
Fig. 1. Physical structure of a quadrature pixel cluster.
Fig. 2. Physical structure of a group of polarization pixels with different

polarizer orientations.
Wire grid polarizers absorb EM wave components that have

the same orientation as the wire grid. EM wave components
that are orthogonal to the wire grid orientation passes through.
For the wire gird polarizer to work efficiently, the pitch d, of
the wire grid should be lesser than the lowest wavelength,
, that has to be detected, i.e., d</2 [6]. The visible
spectrum range is roughly from 300 nm to 700 nm. Modern
CMOS fabrication processes are capable of having smaller
metal pitches that make detecting light at the lower end of the
visible spectrum feasible. In 65 nm CMOS process the lowest
width of metal 1 is 90 nm. For 50% duty cycle, using metal
1 for constructing the wire grid polarizer, we could achieve a
minimum pitch of 180 nm.
III. A NGLE DETECTION
Earlier work related to Talbot effect based pixels showed
that the response produced by diffraction grating is sensitive
to changes in the incidence angle. Because of the inherent
periodicity of the response produced by such pixels, large
number of pixels were required to unambiguously determine
incident light angles. Furthermore, the range of angles that
could be detected were quite small. Our previous work [7]
attempted to solve some of these problems by introducing
additional set of pixels, called the quadrature pixel cluster
(QPC), which was based on the metal-shading principle. The
QPC produced a coarse linear response proportional to the
angle variations. Although the combination produces fairly
accurate results, it requires a fair bit of post processing to
estimate angles because of multiple Talbot response periods
within any given angle range.
In this work we extend our previous approach, that is, we
combine the linear quadrature pixel cluster response along
with the response produced by the polarization pixels to
accurately determine the angles. The response produced by
polarization pixel is sensitive to the incidence angle, but it
exhibits a symmetry around 0 . That is, the positive and negative angles produce the same response. We use the pixels of
linear quadrature pixel cluster to break the symmetry thereby
allowing unambiguous resolution of positive and negative
angles.
Fig. 1 shows the physical structure of a quadrature pixel
cluster. The QPC consists of four photodiodes with a metal
block on top of it. The shadow produced by the metal block
on photodiodes vary based on the incidence angle, producing
a change in the pixel response. Pair of adjacent pixels could be
used for determining the angle variation along a particular direction. For example, in order to determine the angle variations
along the horizontal direction (x-axis) the difference response

produced by either pixels A, B or C, D could be used. The
response produced by these kind of pixels are linear (within
a range), but have low sensitivity making detection of very
closely spaced angles difficult.
Fig. 2 shows the physical structure of a group of polarization
pixels along with an intensity pixel without any polarizer on
top of it. The three polarization pixels have horizontal, vertical
and diagonal polarizer orientation on top of the photodiode.
In ideal situations, if the light is completely unpolarized,
the response produced by a polarizer with arbitrary grating
orientation would suffice for estimating the angle. But if the
light is polarized with the same orientation as the grating, very
little light passes through the grating making the detection
process difficult. A solution to this is to have two pixels with
their gratings aligned orthogonal to each other (For example,
horizontal and vertical polarization pixels in Fig. 2). In this
case if the input light has a polarization component with the
same orientation as one of the gratings, the other pixel with the
orthogonal grating captures enough information so as to make
angle detection feasible. By averaging the output response of
both these pixels we can capture angle information for light
polarized in any arbitrary direction.
IV. P IXEL D ESIGN
The polarization pixels considered for analysis in this work
consist of polarizers with pitch, d = 200 nm, duty cycle =
50% and are made up of metal 1. The QPC on the other
hand makes use of metal 5 as the shadow inducing layer.
Three different polarizer orientations have been implemented
- 0 , 45 and 90 . Only two of these polarizers (0 and 90 )
are sufficient for angle detection. The third polarizer (45 )
could be used for calculating Stokes parameters that come in
handy while determining the polarization information for some
special applications.
Fig.3 shows the pixel-unit-cell comprising of an intensity
pixel, three polarization pixels and a quadrature pixel cluster
(which in turn comprises of four pixels). The figure shows the
pixel schematic along with the physical photodiode structure.
Each pixel is made up of five transistors and a photodiode.
Out of the five transistors, 1 is for pixel reset, 2 for the source
follower stage and 2 more for a transmission gate, which aids
in pixel selection. The photodiode is made up of n-well/psub depletion region and has two guard rings surrounding it
- one p+ guard ring for isolation against stray holes and one
n+ guard ring for isolation against stray electrons. Signal from
pixels pass through a switched capacitor amplifier and a global
- 107 -
ICEIC 2015
Polarization Pixel with
Horizontal Grating
Intensity Pixel
VDD
QPC A
VDD
VDD
PIX_SEL_1
PIX_RST
PIX_SEL_2
PIX_RST
PIX_OUT_1
VDD
PIX_SEL_1
PIX_RST
PIX_OUT_2
PIX_SEL_2

Vertical Grating
Photodiode

Diagonal Grating
VDD
QPC D
VDD
PIX_SEL_4
PIX_RST
PIX_OUT_3
VDD
PIX_SEL_3
PIX_RST
PIX_OUT_4
VBIAS
PIX_SEL_4
PIX_SEL_3
Photodiode
PIX_OUT_8
VBIAS
VBIAS
PIX_SEL_3
PIX_SEL_4
PIX_RST
PIX_OUT_7
VBIAS
Photodiode
Photodiode
QPC C
VDD
PIX_SEL_3
PIX_SEL_2
PIX_SEL_1
Photodiode
Photodiode
PIX_OUT_6
VBIAS
VBIAS
PIX_SEL_1
PIX_SEL_2
PIX_RST
PIX_OUT_5
VBIAS
VBIAS
PIX_RST
QPC B
Photodiode
PIX_SEL_4
Photodiode
Fig. 3. Pixel-unit-cell comprising of an intensity pixel, three polarization pixels and a quadrature pixel cluster.
Intensity
pixel
PIX_OUT_1
Switched Capacitor
Amplifier
PIX_OUT_2
PIX_OUT_3
PIX_OUT_4
Global
Buffer
00 polarizer
pixel
QPC
SEL_A
8:1
MUX
SEL_A
OUTPUT
PAD
2C
PIX_OUT_5
SEL_B
VREF
900 polarizer 450 polarizer

pixel
pixel
VIN_REF
PIX_OUT_6
PIX_OUT_7
Metal
block
Fig. 5. Microphotograph of the pixel array along with the layout of

polarization and QPC pixels.
SEL[2:0]
PIX_OUT_8
Fig. 4. Figure illustrating signal data path to the output pad.
buffer before reaching the output pad (Fig.4). The SC amplifier

amplifies signals at its input by a factor of 2. The signal at
the output is given by:
2C
(1)
(VIN REF VPIXEL VAL )
C
Fig.5 shows the microphotograph of the pixel array along
with the layout of polarization and QPC pixels.
VOUT = VREF
V. R ESULTS AND D ISCUSSION

Simulations were performed using a commercially available
software that performs finite difference time domain (FDTD)
simulations. All simulations were performed at a wavelength
of 500 nm.
Fig. 6(a) and Fig. 6(b) show the response produced by
vertical (90 ) and horizontal (0 ) polarization pixels as a
function of incidence angle. As can be seen from both the

plots, the response produced by both the pixels are similar
in case of unpolarized light, whereas when light is polarized
along a particular orientation, the orthogonal counterpart of the
pixel produces a strong response. Hence the average response
of both the pixels have to be considered for unambiguously
determining the angles.
Fig. 6(c) shows the plot of Talbot effect based pixel response
[3] along with the QPC response. As can be seen, in order to
achieve a desirable angle resolution (say from -65 to +65 ) a
number of Talbot response periods have to be considered. This
increases the constraints on the QPC response and requires it
to have high sensitivity. Sensitivity primarily depends on the
area of the photodiode used in the QPC along with a number
of other minor parameters. Hence, in order to achieve good
sensitivity, a QPC with a large photodiode area is desirable.
Add to this a number of Talbot pixel groups with different
grating orientation and grating offsets. This reduces the overall
pixel resolution for simultaneous intensity and angle detection.
QPC response is linear only in the range from -65 to +65 and
this limits the total angle range. To increase linearity beyond
- 108 -
ICEIC 2015
(a)
(b)
(c)
(d)
Fig. 6. Simulation results. (a) Vertical polarization pixel response as a function of incidence angle for different polarization states of light source. (b) Horizontal
polarization pixel response as a function of incidence angle for different polarization states of light source. (c) Talbot pixel response and QPC response as
a function of incidence angle for an unpolarized light source. (d) Polarization pixel response and QPC response as a function of incidence angle for an
unpolarized light source.
this limit, bigger photodiodes and large separation between

adjacent photodiodes is required.
Fig. 6(d) shows the response of one of the polarization
pixels along with QPC response. An unpolarized light source
was considered for this illustration. Based on the plot, angles
anywhere in the range from -65 to +65 can be unambiguously determined. The main limitation here is the linearity of
the QPC response.
VI. C ONCLUSION
The paper presented a new technique for determining the
angle of incident light. The technique can unambiguously
determine angles in the range from -65 to +65 . This range
is primarily limited by the linearity of quadrature pixel cluster
response which has been used in conjunction with the polarization pixels to break the inherent symmetry in the polarization
pixel response. Compared to the conventional Talbot pixel
response, the response produced by the polarization pixels
are stronger, enabling the use of low sensitivity photodiodes.
Also, the number of pixels required to simultaneously resolve
incidence angles and intensity is way lower than that required
by the Talbot pixels. We hope that by adopting this technique,
the angle detection process will become simpler, enabling high
resolution 3D image capture. We will report further results

once the chip is tested with real imaging scenes.
ACKNOWLEDGEMENT
This work was supported by ACRF Project grant
(M4020153.040).
R EFERENCES
[1] S.-J. Kim, S.-W. Han, B. Kang, K. Lee, J. D. K. Kim, and C.-Y. Kim, A
Three-Dimensional Time-of-Flight CMOS Image Sensor With PinnedPhotodiode Pixel Structure, Electron Device Letters, IEEE, vol. 31,
no. 11, pp. 12721274, 2010.
[2] K. Fife, A. El Gamal, and H.-S. Wong, A Multi-Aperture Image Sensor
With 0.7m Pixels in 0.11m CMOS Technology, Solid-State Circuits,
IEEE Journal of, vol. 43, no. 12, pp. 29903005, 2008.
[3] A. Wang and A. Molnar, A Light-Field Image Sensor in 180 nm CMOS,
Solid-State Circuits, IEEE Journal of, vol. 47, no. 1, pp. 257271, 2012.
[4] Y. Schechner, S. Narasimhan, and S. Nayar, Instant dehazing of images
using polarization, in Computer Vision and Pattern Recognition, 2001.
CVPR 2001. Proceedings of the 2001 IEEE Computer Society Conference
on, vol. 1, 2001, pp. I325I332 vol.1.
[5] L. Wolff, Polarization-based material classification from specular reflection, Pattern Analysis and Machine Intelligence, IEEE Transactions on,
vol. 12, no. 11, pp. 10591071, 1990.
[6] E. Hecht, Optics, 4th ed. Addison Wesley, 2002.
[7] V. Varghese, X. Qian, S. Chen, S. ZeXiang, T. Jin, L. Guozhen, and
Q. J. Wang, Track-and-Tune Light Field Image Sensor, Sensors Journal,
IEEE, vol. PP, no. 99, p. 1, 2014.
- 109 -
TO-3-3-8
Low-Power Column-Parallel ADC for CMOS Image

Sensor by Leveraging Spatial Likelihood in Natural
Scene
Lifen Liu, Hang Yu and Shoushun Chen
VIRTUS IC Design Center of Excellence, School of EEE

AbstractThis paper presents the architecture, algorithm

and implementation of a low-power column-parallel analog-todigital converter (ADC) for CMOS image sensor. The analysis
of most natural scenes shows that neighbor pixels have strong
correlations. In this paper, a prediction scheme was proposed
based on this spatial likelihood in natural scenes. The scheme
predicts the MSBs of the selected pixel using previous-row pixel
A/D conversion data, which enables signicant reduction of A/D
conversions steps on MSBs and the power consumption. The
simulation results show that up to 20%-30% power saving can
be achieved for most natural scenes. A prototype CMOS image
sensor (CIS) chip, including a 9898 pixel array and a 9-bit
column-parallel successive approximation register (SAR) ADC
array, was fabricated using 0.35m CIS technology. The silicon
size is 3.51.8 mm2 .
KeywordsCMOS image sensor, low-power, SAR ADC, common MSBs, prediction scheme
I.
I NTRODUCTION
The concept of smart cameras has evolved from simple

devices to todays complex vision systems over the past
decades. The broad range of applications has been realized in
many different markets, including sensor networks, consumer
electronics, digital surveillance, biomedical imaging and star
trackers[1][2].
Integration of column-parallel analog-to-digital (ADC)
technology on the CMOS image sensor has become a norm,
in particular for consumer electronics. The expansion of this
markets has continuously driven the design technologies toward higher performance but low-power consumption. Readout
circuits, in particular column-parallel ADC, play a key role in
the total power consumption of a CMOS image sensor. In an
image sensor, traditional A/D conversions operate in the same
manner, repeating across row to row, column to column, and
frame to frame, regardless the property of the scene[3][4][5].
In this paper, a prediction scheme is proposed that leverages
the spatial likelihood of natural scenes to achieve a low-power
column-parallel ADC system. For the selected-row pixels in
a frame, their most signicant bits (MSBs) are predicted by
previous-row pixels, where the A/D conversion steps originally
applied for the predicted MSBs are disabled. This enables
signicant savings on the total A/D conversion steps and power
consumption of the column-parallel ADC system.
The rest of this paper is organized as follows: Section II
introduces the algorithm for this prediction scheme. Section
III illustrates the image sensor architecture and ADC circuitry.
3L[HO5DWHUDWLR

'LIIHUHQFHRI1HLJKERU5RZ3L[HO9DOXHV
Fig. 1. Distribution graph of neighbor-row-pixel difference for an image

(Lena 512512). The difference is mainly located in the range from -50 to
50 within [-255,255] full scale. The graph of blue-color bar is the distribution
ratio of pixels in total pixels of a frame, and red-color curve is the enveloped
Gaussian curve.
Section IV describes the simulation and experimental results.

Finally, conclusions are drawn in Section V.
II.
A LGORITHM C ONSIDERATION
Considering the property of spatial likelihood in natural

scenes, hundreds of natural images were simulated to calculate
the differences in neighbor-row pixels through the Matlab
program. The high similarity of neighbor-pixel values was
realized, as a group of pixels are occupied by the same object
in a scene. And the differences distribute around a value of
0. The simulation result of one example (Lena 512512) is
shown in Fig. 1, where the pixel differences mainly locate at
[-50,50] range with a full-scale value from -255 to 255. This
means that the differences are mainly contributed by the least
signicant bits (LSBs) in terms of digital expression of pixel
values.
The algorithm proposed in this paper is a prediction
scheme, which is based on the strong correlation between
consecutive rows in the natural scenes. In an image sensor
system, the prediction scheme operates row by row, and the
MSBs of each row are predicted by the previous row. In terms
of one selected pixel, its MSBs are predicted by using its
neighbor pixels in the previous row, which is illustrated in
Fig 2(a). The pixel D is the selected pixel, and pixel A, B and
- 110 -
ICEIC 2015
W
W
ZKt
W
D $'& FRQYHUVLRQ RI 3L[HO ' LV EDVHG RQ

SUHYLRXVURZ 3L[HO $ % & UHVXOWV
W
W
KEdZK>>Z
Fig. 2. (a) Operating principle of using previous-row pixel data to predict

MSBs for a selected pixel. (b) Methodology of generating predicted MSBs
for a selected pixel.
s
Z^d
dy
Z^>
dW/y>
^^,
W

D^
y y y y y

WD^ y y y y y y

&RPPRQ06% RI SL[HO $ % & LV
HVWLPDWHG DV UHIHUHQFH YROWDJH OHYHO

W
^Z
DD
^,
^

^Z'
DD
^dZd
s
'
D^
D^

W
W
W
ZKt^EEZ
ZKt
D^
s

^KE
z>
sss>^
Fig. 4.
s
z^
s
d/D
EK
KhdWhdd
Block Diagram of the CMOS image sensor with prediction scheme.
>^
s
E 6$5 FRQYHUVLRQ VWDUWV DW % LQ WHUPV RI D E $'&
Fig. 3. (a) Operating algorithm of the ADC system based on the prediction
scheme. (b) The detail 9-bit SAR ADC conversion steps with predicted MSBs
(101XXXXXX).
C are the neighbor pixels in the previous row.

As the differences of neighbor-row pixels are mainly contributed by LSBs, the common MSBs of neighbor pixels in
the previous row can be assigned as the predicted MSBs for
the selected pixel. In order to increase the accuracy of this
prediction scheme, one bit less of the common MSBs are
assigned as the predicted MSBs. As shown in Fig 2(b), the
predicted MSBs (101XXXXXX ) for pixel D are one bit less
than common MSBs (1010XXXXX) of pixel A, B and C.
The operating principle of this prediction scheme is illustrated in Fig. 3. According to the operating algorithm as
shown in Fig. 3(a), for a selected pixel, its MSBs are rst
estimated and preset into the ADC. Later the conventional A/D
conversion steps are used to derive its left LSBs. At the end,
the correctness of the prediction is evaluated, by checking the
difference of the corresponding analog value of the complete
ADC output including the predicated MSBs (VADC ), and
the analog input (Vin ). If the prediction is successful, their
difference shall be smaller than the corresponding analog
value of one LSB (VLSB ). As stated above, in most natural
scenes, the pixel difference between neighbor rows is small and

therefore in most cases the predication is correct and no further
A/D conversion steps are needed for the MSBs. In the case of
failure, however, the ADC should start over and run a complete
(MSBs+LSBs)-bit conversion steps. Two examples are shown
in Fig. 3(b), two analog inputs namely Vin1 and Vin2 , starting
from the same predicted MSBs, 101XXXXXX. After last bit
conversion, Vin1 s MSBs were found to be predicted corrected,
while Vin2 has to discard the predicted MSBs as incorrect
prediction.
For a selected row, each pixel has different predicted MSBs
and its starting point of A/D conversion for the left LSBs is
also different. That means the architecture of ADC required in
this application should be able to start A/D conversion from
different reference level, without affecting the ADC resolution.
Successive approximation register (SAR) ADC will be the
best choice for this proposed prediction scheme comparing
with other architectures, as its operating algorithm is based on
binary search trees [6].
III.
I MAGE S ENSOR A RCHITECTURE
Fig. 4 shows the block diagram and the signal path of a

CMOS image sensor with the proposed algorithm. It consists
of a 9898 pixel array (4-T APS), a correlated double sampling (CDS) and sample-hold (S/H) circuitry, a column-parallel
SAR ADC array and two sets of memories. One memory is
used to store the A/D conversion data for readout, the other
one is used for the prediction scheme. The row scanner and
controller provide all the control signals to the whole image
sensor system.
A. Architecture of SAR ADC
Fig. 5(a) shows the simplied block diagram of a SAR
ADC system with the proposed prediction scheme. Only
- 111 -
ICEIC 2015
5HVHW
5HVHW
9LQ
D^
' 06%>P@
^,

9VK
^Z

>
9GDF

'>Q@
6>Q@

s

s>
s,

^
s>
3UHVHW WKH P ELWV FRPPRQ06% LQWR '$&

6XFFHVVLYH $SSUR[LPDWLRQ &RQYHUVLRQ
,I WKHUH DUH E FRPPRQ 06%V SUHVHW LQWR '$& WKHQ RQO\ 7 WR
7 DUH XVHG DQG $'& XVH WKH E FRPPRQ06% GXULQJ 7 WR 7
7
'HWHUPLQH WKH FRUUHFWQHVV RI SUHGLFWLRQ VFKHPH

,I 6BGXP KDV VDPH YDOXH DV 6 LW LV ZURQJ HVWLPDWLRQ
RWKHUZLVH LW LV FRUUHFW HVWLPDWLRQ 5HIHU WR )LJ
77 $QRWKHU 6XFFHVVLYH $SSUR[LPDWLRQ &RQYHUVLRQ

,I LW LV ZURQJ HVWLPDWLRQ 7 WR 7 DUH XVHG IRU DQRWKHU $'
FRQYHUVLRQ F\FOH RWKHUZLVH 7 WR 7 DUH QRW XVHG
7
77

s>
Fig. 6. Conversion-step sequence of the SAR ADC with control logic for
proposed algorithm.
Process technology
Pixel size/Fill Factor
Sensitivity
Dark current
Dynamic range
FPN
Power supply
Power consumption
ADC resolution
ADC input range
ADC clock frequency
Data rate
ADC DNL/INL
ADC SNR
two function blocks, the Com-MSB Generator and CorrectEstimation Detector, are added inside the SAR ADC architecture. They are used to generate the predicted MSBs and
determine the correctness of predicted scheme respectively.
The predicted MSBs are generated before the operation of the
SAR ADC system, and the correctness of prediction scheme
is checked after the operation of SAR ADC system. Even
for the triggered second A/D conversion, both of them will
be disabled. As such, they will have minimum effect on the
original SAR ADC system, like linearity, resolution, effective
number of bits (ENOB), etc.
Fig. 5(b) presents the circuit architecture of the digitalto-analog (DAC) in the proposed SAR ADC system. It is a
split-capacitor DAC, and has 48.05 unit capacitors (C) in total
for 9-bit resolution. The maximum equivalent load capacitor
observed between the top and bottom plate capacitor array is
32 C. Therefore, the power consumption for the SAR DAC and
silicon array is greatly reduced compared with a conventional
DAC architecture. In addition, the capacitor array here is split
into 5-bit/4-bit arrays, with digital control bits from S9 to S1.
The extra bit (S0) is used for checking the correctness of the
predicted MSBs, without affecting the ADC resolution, since
it is not treated as a quantization output of the ADC.
B. Timing Diagram of SAR ADC

The timing diagram of the proposed SAR A/D conversion
is illustrated in Fig. 6. The rst cycle T0 is used to generate
common-MSBs of the previous row, and (m-1) bits of them
are assigned as predicted MSBs for the selected row. T1 to
T9 are 9-bit SAR ADC conversion cycles, and only T5-T9 are
used for A/D conversion if 4-bit predicted MSBs are assigned
inside. T10 is used for extra-bit conversion (S0 in Fig. 5(b)),
which is used to check the correctness of the predicted MSBs.
If prediction is incorrect, another 9 cycles (T11 to T19) will
be required for a new SAR A/D conversion to generate the
accurate quantization results. Otherwise, T11 to T19 will not
be used, and the digital data with predicted MSBs will be
stored into memory for readout and the next prediction cycle.
P ERFORMANCE S UMMARY OF THE I MAGE
TABLE I.
Fig. 5. (a) Block diagrams of a column-parallel SAR ADC with proposed

algorithm. (b) Circuit architecture of the SAR DAC with comparator.
IV.
0.35m AMS CIS (2P4M)

3.51.8 mm2 / 35%
0.33A/W
11mV/s
44.12dB
1.24%
3.3V
42.3mV
9 bits
2V
20MHz
20Mp/s
(+0.55,-0.91)/(+1.34,-1.8)
49dB
S IMULATION R ESULTS
A. Power Consumption Analysis

For analysis of the power consumption of the SAR ADC
with the proposed algorithm, the capacitor switching power
of the DAC block should be discussed as it contributes the
most to total power consumption [7]. The switching energy
for each bit is illustrated in Table II, which shows that the
switching power is mainly contributed by A/D conversion steps
on MSBs. For the proposed algorithm, the total A/D conversion
steps are saved signicantly, and the MSBs conversion steps
are saved the most. As such, the capacitor switching power
saved for one frame is also signicant.
Therefore, several groups of natural scenes were simulated
by Matlab based on the proposed algorithm. The power consumption and A/D conversion steps saved are shown in Fig.
7. Up to 20% to 30% savings on conversion steps, and 20%
to 35% power saving had achieved for most of the pictures.
- 112 -
TABLE II.
Switched Step
Switching Power
(CVref 2 )
Switched Step
Switching Power
(CVref 2 )
S WITCHING P OWER OF E ACH B IT

S9
S8
S7
S6
S5
1/2
1/8
1/32
S4
S3
S2
S1
1/64
1/128
1/256
1/512
ICEIC 2015
6WDQGDUG 7HVW ,PDJH

LPDJHV
5HIHUHQFH
/
/
ZZZLPDJHSURFHVVLQJSODFHF
RPURRWBILOHVB9
LPDJHBGDWDEDVHVKWP
$YHUDJH
$YHUDJH
$YHUDJH
$YHUDJH
$YHUDJH
$YHUDJH
&RQYHUVLRQ 6ZLWFKLQJ &RQYHUVLRQ 6ZLWFKLQJ
&RQYHUVLRQ 6ZLWFKLQJ &RQYHUVLRQ 6ZLWFKLQJ &RQYHUVLRQ 6ZLWFKLQJ
6WHSV 6DYHG 3RZHU 6DYHG 6WHSV 6DYHG 3RZHU 6DYHG
6WHSV 6DYHG 3RZHU 6DYHG 6WHSV 6DYHG 3RZHU 6DYHG 6WHSV 6DYHG 3RZHU 6DYHG

Fig. 7. Conversion cycles and switching power saved based on prediction scheme compared with traditional SAR ADC operation (a N-bit SAR ADC has N
A/D conversion steps in traditional way). Image folder 1 contains 62 photos taken at Singapore Zoo, image folder 2 contains 47 images taken at Venice.
W^
Fig. 8.
V.
A CMOS image sensor with the proposed prediction

scheme that leverages spatial likelihood in natural scenes is
presented in this paper. This proposed algorithm is implemented in a compact 9-bit column-parallel SAR ADC system,
where a redundant bit was introduced inside to check the correctness of this prediction scheme. The simulation results show
that it can achieve 20%-30% savings in total A/D conversion
cycles and 20%-35% savings in switching power of the SAR
DAC. Furthermore, the experiment results showed that total
power consumption is reduced by up to 22% compared to an
image system without the prediction scheme.
W
^
^EEZ
/^
/Zh/d
C ONCLUSION
K>hDE DD
^Z
KEdZK>>Z
Chip microphotograph. Die size is 3.5 1.8 mm2 .

W
VI.
ACKNOWLEDGEMENT
This work was supported by ACRF Project grant

(M4020153.040).
R EFERENCES
[1]
[2]
[3]
Fig. 9. Sample image taken by the prototype CMOS image sensor. Conversion
steps saved is 18.57%, and switching power saved is 22.36%.
B. Experimental Results
[4]
[5]
A CMOS image sensor with the column-parallel SAR ADC

system for this prediction scheme was implemented with 0.35
m AMS CIS (2P4M) technology. The die micrograph of
the fabricated sensor chip is shown in Fig. 8. The sample
image taken by this fabricated image sensor is shown in Fig.
9. The power consumption for this image is saved up to
22.36% compared to a traditional design without this prediction scheme. The measured performance of the implemented
sensor is summarized in Table I.
[6]
[7]
- 113 -
J. Furtler, E. Bodenstorfer, M. Rubik, K. J. Mayer, J. Brodersen, and

C. Eckel, High-Performance Smart Cameras. Springer, 2010.
X. Qian, H. Yu, S. Chen, and K. S. Low, An adaptive integration time
cmos image sensor with multiple readout channels for star trackers, in
Solid-State Circuits Conference (A-SSCC), 2013 IEEE Asian. IEEE,
2013, pp. 101104.
D. G. Chen, F. Tang, and A. Bermak, A low-power pilot-dac based
column parallel 8b sar adc with forward error correction for cmos image
sensors, Circuits and Systems I: Regular Papers, IEEE Transactions on,
vol. 60, no. 10, pp. 25722583, 2013.
M. F. Snoeij, A. J. Theuwissen, K. A. Makinwa, and J. H. Huijsing,
Multiple-ramp column-parallel adc architectures for cmos image sensors, Solid-State Circuits, IEEE Journal of, vol. 42, no. 12, pp. 2968
2977, 2007.
T. Randall, I. Mahbub, and S. K. Islam, A low power auto-recongurable
pipelined adc for implantable biomedical applications, in Sensors, 2013
IEEE. IEEE, 2013, pp. 14.
W.-S. Liew, L. Yao, and Y. Lian, A moving binary search sar-adc for
low power biomedical data acquisition system, in Circuits and Systems,
2008. APCCAS 2008. IEEE Asia Pacic Conference on. IEEE, 2008,
pp. 646649.
B. P. Ginsburg, Energy-efcient analog-to-digital conversion for ultrawideband radio, Ph.D. dissertation, Massachusetts Institute of Technology, 2007.
ICEIC 2015

Oral Session
TO-3-4
ICT Convergence
TO-3-4-1
$Q(QHUJ\6DYLQJ%%855+5HFRQILJXUDWLRQ6FKHPHIRU&ORXG5DGLR
$FFHVV1HWZRUNV

<XK6K\DQ&KHQ &KLK6KXQ+VX 7RQJ<LQJ-XDQJ.XDQJ:HL6X

'HSDUWPHQWRI&RPSXWHU6FLHQFHDQG,QIRUPDWLRQ(QJLQHHULQJ
1DWLRQDO7DLSHL8QLYHUVLW\7DLSHL7DLZDQ52&

'HSDUWPHQWRI,QIRUPDWLRQ0DQDJHPHQW
6KLK+VLQ8QLYHUVLW\7DLSHL7DLZDQ52&
\VFKHQ#PDLOQWSXHGXWZFVKVX#FFVKXHGXWZMXDQJ#JPQWSXHGXWZDOODQVX#JPDLOFRP

WUDQVPLWUDGLRVLJQDOVWRXVHUV>@7KHUHVRXUFHVRIWKH
$EVWUDFW

(QHUJ\ VDYLQJ LV DQ LPSRUWDQW LVVXH LQ FORXG UDGLR
DFFHVV QHWZRUNV &5$1 ([LVWLQJ HQHUJ\VDYLQJ
VFKHPHLQ&5$1VDYHVHQHUJ\E\WXUQLQJRIIWKHEDVH
EDQG XQLW %%8 ZKRVH XWLOL]DWLRQ UDWLR LV ORZHU WKDQ
WKH WKUHVKROG 7R LPSURYH H[LVWLQJ ZRUNV ZH SURSRVH
DQ HQHUJ\VDYLQJ VFKHPH ZKLFK VDYHV HQHUJ\ E\
WXUQLQJ RII WKH %%8 ZKRVH HQHUJ\ FRQVXPSWLRQ UDWLR
(&5LVKLJKHUWKDQWKH WKUHVKROG (&5LVGHILQHGDV
WKH WRWDO SRZHU FRQVXPSWLRQ GLYLGHG E\ WKH WRWDO
QXPEHU RI RFFXSLHG SK\VLFDO UHVRXUFH EORFN 35%
VXEIUDPHV 7KH +LJK (&5 LQGLFDWHV WKH ORZ HQHUJ\
HIILFLHQF\:KHQDOOWKHUDGLRKHDGV55+VRIWKH%%8
ZLWK KLJK (&5 LV UHDVVLJQHG WR RWKHU %%8V ZLWK ORZ
(&5WKH%%8ZLWKKLJK(&5FDQEHWXUQHGRII7KH
SURFHVV SURFHHGV XQWLO DOO WKH %%8V ZLWK KLJK (&5
KDYH EHHQ UHFRQILJXUHG DQG WXUQHG RII 6LPXODWLRQ
UHVXOWV MXVWLI\ WKH HQHUJ\ HIILFLHQF\ RI WKH SURSRVHG
VFKHPH

.H\ZRUGV&ORXGUDGLRDFFHVVQHWZRUNV&5$1
HQHUJ\VDYLQJUHFRQILJXUDWLRQ
,QWURGXFWLRQ

0RELOH GDWD WUDIILF KDV EHHQ JURZWK RYHU WKH SDVW
IHZ \HDUV GXH WR WKH ULVH RI ERWK WDEOHWV DQG VPDUW
SKRQHV 7R DFFRPPRGDWH ZLWK VXFK D KXJH WUDIILF LQ
FHOOXODUV\VWHPVFORXGUDGLRDFFHVVQHWZRUNV&5$1
KDV EHHQ SURSRVHG >@ &5$1 SURYLGHV D SRZHUIXO
DQGFHQWUDOL]HGQHWZRUNVDUFKLWHFWXUHIRUIXWXUHVPDOO
FHOO ZLUHOHVV DFFHVV V\VWHPV 7KH FHQWUDOL]HG SURFHVV
LQJ SRZHU HQDEOHV HIILFLHQW QHWZRUN FRRUGLQDWLRQ DQG
PDQDJHPHQW $EDVH VWDWLRQ LVVHSDUDWHGLQWRWKHEDVH
EDQG XQLW %%8 DQG UHPRWH UDGLR KHDGV 55+V $
%%8FDQFRQQHFWWRVHYHUDO55+V6HYHUDO%%8VFDQ
EH FRPELQHG LQWR D %%8 SRRO 7KH %%8 SHUIRUPV
VLJQDOSURFHVVLQJIXQFWLRQVLQWKHFORXGDQGWKH55+V
FHQWUDOL]HG %%8V FDQ EH G\QDPLFDOO\ DOORFDWHG WR WKH

UHPRWH UDGLR KHDGV 55+V GHSHQGLQJ RQ WKH WUDIILF
ORDG
7KH H[LVWLQJ PDSSLQJ VFKHPH RQO\ FRQVLGHUV WKH
SK\VLFDOUHVRXUFHEORFNXWLOL]DWLRQHIILFLHQF\RI55+V
ODFNLQJ RI FRQVLGHULQJ WKH HQHUJ\ H[SHQGLWXUH IDFWRUV
7RLPSURYH WKH H[LVWLQJ ZRUNVD UHFRQILJXUDWLRQ ZLWK
WKHPLQLPXPH[SHFWHGSRZHUFRQVXPSWLRQLVSURSRVHG
LQ WKLV SDSHU 6LPXODWLRQ UHVXOWV LOOXVWUDWH WKDW WKH
SURSRVHG %%855+ UHFRQILJXUDWLRQ VFKHPH FDQ
UHGXFH WKH WRWDO SRZHU FRQVXPSWLRQ DQG HQKDQFH WKH
WKURXJKSXW
7KH UHVW RI WKH SDSHU LV RUJDQL]HG DV IROORZV
3UHOLPLQDULHV DUH VKRZQ LQ 6HFWLRQ 6HFWLRQ
GHVFULEHV WKH SURSRVHG %%855+ UHFRQILJXUDWLRQ
VFKHPH LQ &5$1 6LPXODWLRQ UHVXOWV DUH VKRZQ LQ
6HFWLRQV6HFWLRQFRQFOXGHVWKLVSDSHU
3UHOLPLQDULHV

6\VWHP0RGHO

7KHV\VWHPPRGHORIWKHSURSRVHGVFKHPHLVVKRZQ
LQ)LJXUH7KHUHLVD%%8SRROLQWKHFRUHQHWZRUNRI
WKH &5$17KH%%8SRROFRQWDLQVVHYHUDO %%8V$
%%8 LV FDSDEOH RI VXSSRUWLQJ PXOWLSOH 55+V ZKHUH
55+V DUH PRXQWHG DW SK\VLFDO ORFDWLRQV FORVHU WR WKH
DQWHQQDV\VWHPWRWDNHWKHDGYDQWDJHRIOHVVIHHGHUORVV
&HQWUDOL]HG VLJQDO SURFHVVLQJ RI WKH %%8 JUHDWO\
UHGXFHV WKH HTXLSPHQW DW VLWHV QHHGHG WR FRYHU WKH
VDPH DUHDV 7KXV WKH SRZHU FRQVXPHG E\ DLU
FRQGLWLRQLQJ DQG RWKHU VLWH VXSSRUW HTXLSPHQW FDQ EH
UHGXFHG VLJQLILFDQWO\ 0RUHRYHU WKH FRQQHFWLRQV
EHWZHHQ %%8V DQG 55+V FDQ FKDQJH G\QDPLFDOO\
ZKLOHDOORZLQJD%%8WRFRQQHFWWRRQHRUPRUH55+V
%\ DVVLJQLQJ SURSHU QXPEHU RI 55+V WR D %%8
DFFRUGLQJWRWKHWUDIILFORDGFRVWFDQEHUHGXFHGGXHWR
WKH UHGXFWLRQ RI WKH QXPEHU RI DFWLYH %%8V DQG WKH
- 115 -
ICEIC 2015
HIIHFWLYH XWLOL]DWLRQ RI WKH EDVHEDQG UHVRXUFHV 2XU

JRDO LV WR PLQLPL]H WKH SRZHU FRQVXPSWLRQ RI WKH &
5$13&5$17KH3&5$1LVGHILQHGDV
ZKHUH LV WKH SRZHU FRQVXPSWLRQ RI %%8L

LV WKH SRZHU FRQVXPSWLRQ RI 55+M 1 LV WKH
QXPEHU RI %%8V LQ WKH &5$1 0L LV WKH QXPEHU RI
55+VFRQWUROOHGE\%%8L
ZLWKLQ DQ\ JLYHQ WLPH LQWHUYDO ,Q WKH DGDSWLYH %%8

55+ VFKHPH FRQQHFWLRQV EHWZHHQ %%8V DQG 55+V
DUH UHH[DPLQHG DW WLPH LQWHUYDOV GHSHQGLQJ RQ %%8
UHVRXUFH XVDJHV =KX HW DO >@ LQWURGXFH D G\QDPLF
%%8558 PDSSLQJ VFKHPH 7KH ORJLFDO FRQQHFWLRQV
EHWZHHQ %%8V DQG 558V DUH G\QDPLFDOO\ DGMXVWHG
DFFRUGLQJ WR WKH DV\PPHWULF '/8/ UHVRXUFH
DOORFDWLRQ DQG WUDIILF FRQGLWLRQ 7KLV PDSSLQJ VFKHPH
GHVLJQHG XQGHU WKH FRQVLGHUDWLRQ RI WKH SUREDELOLW\ RI
WKHDYHUDJH35%XWLOL]DWLRQUDWHRIDOOFHOOVPDQDJHGE\
WKHFRUUHVSRQGLQJ%%8LQG\QDPLF7''V\VWHPV

0RWLYDWLRQV

([LVWLQJHQHUJ\VDYLQJVFKHPHLQ&5$1VDYHVHQHUJ\
E\ WXUQLQJ RII WKH EDVH EDQG XQLW %%8 ZKRVH
XWLOL]DWLRQ UDWLR LV ORZHU WKDQ WKH WKUHVKROG +RZHYHU
WKH %%8 ZLWK ORZ XWLOL]DWLRQ UDWLR GRHV QRW LQGLFDWH
WKDW LW LV QRW HQHUJ\ HIILFLHQW 7R LPSURYH H[LVWLQJ
ZRUNV ZH SURSRVH DQ HQHUJ\ HIILFLHQW VFKHPH ZKLFK
VDYHV HQHUJ\ E\ WXUQLQJ RII WKH %%8 ZKRVH HQHUJ\
FRQVXPSWLRQUDWLR(&5LVKLJKHUWKDQWKHWKUHVKROG
7KH%%855+5HFRQILJXUDWLRQ6FKHPH

)LJXUH6\VWHPPRGHO

5HODWHG:RUNV

6RPHVWXGLHVDGGUHVVWKHHQHUJ\FRQVXPSWLRQLVVXH
RI WKH &5$1 >@>@>@>@ VRPH ZRUNV FRQVLGHUV WKH
VZLWFKLQJ SUREOHP RI WKH 55+V >@>@>@ 7KH
FRRUGLQDWLRQ RI WKH UHVRXUFH DOORFDWLRQ DQG
FRQVROLGDWLRQLVSURSRVHGLQ>@7KLVZRUNDGMXVWVWKH
GRZQOLQNXSOLQN UHFRQILJXUDWLRQ WR UHGXFH WKH SRZHU
FRQVXPSWLRQ RI %%8V DQG 558V &KHFNR HW DO >@
SUHVHQW D PRGHO RI VWDWLVWLFDO PXOWLSOH[LQJ JDLQ
DFFRUGLQJWRXVHUPRELOLW\LQ&5$17KLVWUDIILFIORZ
PRGHOFDQSUHGLFWVKRZPDQ\%%8VZLOOEHQHHGHGLQ
&5$1 *XSWD HW DO >@ SURSRVH DQ DOJRULWKP WR GHDO
ZLWK PXOWLSOH LQSXW DQG RXWSXW EDVHG GLVFRQWLQXRXV
WUDQVPLVVLRQVVRDVWRLPSURYHWKHHQHUJ\SHUIRUPDQFH
IRU &5$1 V\VWHPV <DQJ HW DO >@ LQYHVWLJDWHV WKH
EDVHVWDWLRQSRZHUFRQVXPSWLRQIRUILYHGLIIHUHQW5R)
WUDQVPLVVLRQ VFKHPHV 7KH UHVXOWV VKRZ WKDW DQDORJ
5),)RYHUILEHU LV WKH PRVW HQHUJ\HIILFLHQW VFKHPH
/LXHWDO>@SURSRVHDEDFNKDXODUFKLWHFWXUHZKLFKFDQ
UHFRQILJXUH WKH PDSSLQJ EHWZHHQ 5$8V DQG %%8V
6KLQREX HW DO >@ SURSRVH WZR %%855+ VZLWFKLQJ
VFKHPHV IRU &5$1 2QH LV D VHPLVWDWLF VFKHPH DQG
DQRWKHULVDQDGDSWLYHVFKHPH7KHVHPLVWDWLFVFKHPH
GHWHUPLQHV WKH FRPELQDWLRQV RI %%8V WR 55+V WR
DFFRPPRGDWH SHDN KRXU WUDIILF ORDGV IRU DOO 55+V
7KHUH DUH WKUHH SKDVHV LQ WKH SURSRVHG VFKHPH

LQFOXGLQJ WKH HQHUJ\ FRQVXPSWLRQ UDWLR (&5
FDOFXODWLRQSKDVHWKH55+UHFRQILJXUDWLRQSKDVHDQG
WKH%%8WXUQRIISKDVH7KHSURSRVHGVFKHPHLVEDVHG
RQ D JUHHG\ DSSURDFK VXFK WKDW WKH %%8 ZLWK WKH
KLJKHVW (&5 LV UHFRQILJXUHG ILUVW DQG WKH 55+ LQ WKLV
%%8ZLWKWKHKLJKHVW(&5LVUHDVVLJQHGWRWKHQHDUHVW
%%8 ZLWK WKH ORZHVW (&5 7KH GHWDLOV RI WKH WKUHH
SKDVHVDUHGHVFULEHGLQWKHIROORZLQJVXEVHFWLRQV

(&5&DOFXODWLRQ3KDVH

7KH DOJRULWKP RI WKH (&5 FDOFXODWLRQ SKDVH LV
VKRZQDVIROORZV

$OJRULWKP(&5FDOFXODWLRQ
1QXPEHURI%%8VWKUHVKROGRI(&5
IRUL WR1GR
FDOFXODWHWKH(&5RI%%8L
HQGIRU
6RUWHDFK%%8DFFRUGLQJWR(&5LQDVFHQGLQJRUGHU
IRUL WR1GR
LI !WKHQ
FDOO55+UHFRQJXUDWLRQ
HQGLI
HQGIRU

7KH(&5RIWKH%%8LLVFDOFXODWHGDFFRUGLQJWRWKH
IROORZLQJHTXDWLRQ
- 116 -
ICEIC 2015
ZKHUH0LLVWKHQXPEHURI55+VFRQWUROOHGE\%%8 L
LV DQ HVWLPDWHG GHYLDWLRQ YDOXH RI (&5 LV WKH
WRWDOQXPEHURIGRZQOLQNVXEIUDPHVRFFXSLHGE\55+M
LV WKH WRWDO QXPEHU RI XSOLQN VXEIUDPH RFFXSLHG
E\55+M
LVWKHQXPEHURIDFWXDOO\RFFXSLHG35%V
LQGRZQOLQNVXEIUDPHPRI55+M
LVWKHQXPEHURI
DFWXDOO\RFFXSLHG35%VLQXSOLQNVXEIUDPHQRI55+M
LVFDOFXODWHGDFFRUGLQJWRWKHIROORZLQJHTXDWLRQ
ZKHUH LV WKH DYHUDJH GLHUHQFH RI

LQNUHFHQWO\VDPSOLQJDQG LVWKHVWDQGDUG
GHYLDWLRQRI LVDGGHGWRWKH(&5RIWKH%%8LVR
DVWRDYRLGWKHSLQJSRQJHIIHFW
)LJXUHVKRZVDQH[DPSOHRIWKH(&5FDOFXODWLRQ
SKDVH $IWHU FDOFXODWLQJ WKH (&5 RI HDFK %%8 WKH
(&5V RI %%8V IURP KLJK WR ORZ DUH
DQG 7KH (&5 RI %%8
LVKLJKHUWKDQWKHWKUHVKROG DQGKHQFHLWQHHGVWREH
UHFRQILJXUHG
)LJXUH(&5FDOFXODWLRQSKDVH
6RUW HDFK 55+ FRQWUROOHG E\ %%8L DFFRUGLQJ WR (&5

LQDVFHQGLQJRUGHU
M
ZKLOHM0LGR
K
ZKLOHKKPD[GR
6HDUFK IRU KKRS QHLJKERULQJ %%8[ ZLWK WKH
PLQLPXP(&5ZKHUH
LI(&5RI%%8[55+MWKHQ
$VVLJQ55+MWR%%8[
M M
HOVH LI WKHUH LV RWKHU KKRS QHLJKERULQJ %%8[
ZKRVH(&5DQG(&5RI%%8[55+M
WKHQ
$VVLJQ55+MWR%%8[
M M
HOVH
K K
HQGLI
HQGZKLOH
HQGZKLOH

7KH(&5RIWKH55+MLVFDOFXODWHGDFFRUGLQJWRWKH
IROORZLQJHTXDWLRQ
)LJXUH VKRZV DQ H[DPSOH RI WKH 55+

UHFRQILJXUDWLRQ SKDVH $IWHU FDOFXODWLQJ WKH (&5 RI
HDFK 55+ FRQWUROOHG E\ %%8 WKH (&5V RI 55+V
IURPKLJKWRORZDUH DQG
+HQFH55+LVUHDVVLJQHGWR%%8ILUVWIROORZHGE\
WKHUHDVVLJQPHQWRI55+WR%%8DQG55+WR%%8

55+5HFRQILJXUDWLRQ3KDVH

7KHDOJRULWKPRIWKH 55+UHFRQILJXUDWLRQSKDVHLV
VKRZQDVIROORZV

$OJRULWKP55+UHFRQILJXUDWLRQ
0LQXPEHURI55+FRQWUROOHGE\%%8L
ORZHUERXQGRIWKH(&5
IRUM WR0LGR
FDOFXODWHWKH(&5RI55+MFRQWUROOHGE\%%8L
HQGIRU
)LJXUH55+UHFRQILJXUDWLRQSKDVH

%%87XUQRII3KDVH
- 117 -
ICEIC 2015
$IWHU DOO WKH 55+V FRQWUROOHG E\ WKH %%8 ZKRVH

(&5!KDYHEHHQUHDVVLJQHGWKH%%8FDQEHWXUQHG
RII DQG WKH SURWRFRO JRHV EDFN WR WKH ILUVW SKDVH XQWLO
HDFKRIWKH%%8ZKRVH(&5!KDVEHHQUHFRQILJXUHG
DQGWXUQHGRII
)LJXUH VKRZV DQ H[DPSOH RI WKH %%8 WXUQRII
SKDVH$IWHUDOOWKH55+VFRQWUROOHGE\WKH%%8KDYH
EHHQUHDVVLJQHG%%8LVWXUQHGRII7KHIORZFKDUWRI
WKH SURSRVHG UHFRQILJXUDWLRQ VFKHPH LV VKRZQ LQ
)LJXUH
)LJXUH%%8WXUQRIISKDVH
FRPSDULVRQ RI WKH (&5 (&5DQG &&6 XQGHU WKH

VDPH FRQGLWLRQV WKH SDUDPHWHUV DUH VHW DV WKH RQHV LQ
>@ 7DEOH VKRZV WKH SDUDPHWHUV RI WKH VLPXODWLRQV
7KHSHUIRUPDQFHPHWULFVWREHREVHUYHGDUH
z 3RZHU FRQVXPSWLRQ RI %%8 3&%%8 LV WKH WRWDO
SRZHUFRQVXPSWLRQRI%%8V
z 7KURXJKSXW 73 LV WRWDO QXPEHU RI GDWD SDFNHWV
ZKLFK FDQ EH WUDQVPLWWHG DQG UHFHLYHG EHWZHHQ
55+VDQG8(V
z (QHUJ\FRQVXPSWLRQUDWLR(&5LVWKHWRWDOSRZHU
FRQVXPSWLRQ GLYLGHG E\ WKH WRWDO QXPEHU RI
RFFXSLHG35%VXEIUDPHV

7DEOH6LPXODWLRQSDUDPHWHUV
3DUDPHWHUV
9DOXH
3URSRUWLRQRI%%8WR55+

KPD[

D

)LJXUH)ORZFKDUWRIWKHSURSRVHGUHFRQILJXUDWLRQ
VFKHPH
6LPXODWLRQ5HVXOWV

7RHYDOXDWHWKHSHUIRUPDQFHRIWKHSURSRVHG(&5
EDVHG SURWRFRO GHQRWHG DV (&5 ZH FRPSDUH LW ZLWK
WKHFURVVVXEIUDPHFRRUGLQDWHGVFKHGXOLQJGHQRWHGDV
&&6 SURWRFRO >@ 7KH SURSRVHG SURWRFRO ZLWK WKH
HVWLPDWHGGHYLDWLRQYDOXHRI(&5LVGHQRWHGDV(&5
7KH VLPXODWRU XVHG LQ WKH H[SHULPHQWV LV WKH
1HWZRUN 6LPXODWRU 16 ,Q RUGHU WR PDNH WKH

E
)LJXUH D 3RZHU FRQVXPSWLRQ RI %%8 YV
QXPEHURI55+VE3RZHUFRQVXPSWLRQRI%%8YV
35%XWLOL]DWLRQUDWLR

3RZHU&RQVXPSWLRQRI%%83&%%8
- 118 -
ICEIC 2015
)LJXUH VKRZV WKH 3&%%8 E\ WXQLQJ WKH QXPEHU

RI 55+V UDQJLQJ IURP WR DQG 35% XWLOL]DWLRQ
UDWLRUDQJLQJIURPa)LJXUHDLOOXVWUDWHV
WKDWWKH3&%%8RIRXUVFKHPHLVORZHUWKDQWKDWRIWKH
&&%VFKHPHEHFDXVHRXUVFKHPHVDUH(&5EDVHGWKDW
RQO\WKHLQHIILFLHQW%%8VZLOOEHWXUQHGRII,QJHQHUDO
DV WKH QXPEHU RI 55+V LQFUHDVHV WKH 3&%%8 DOVR
LQFUHDVHVEHFDXVHODUJHUQXPEHURI55+VLQFXUVKLJKHU
EXUGHQWRHDFK%%8DQGWKXVOHVV%%8VFDQEHWXUQHG
RIIDQGLQFUHDVHVWKHSRZHUFRQVXPSWLRQRIWKH%%8V
)LJXUH E VKRZV WKH 3&%%8 XQGHU YDULRXV UDWLR RI
XWLOL]DWLRQ WKH 3&%%8 RI RXU VFKHPHV LV ORZHU WKDQ
WKDWRIWKH&&%VFKHPHEHFDXVHRXUVFKHPHVZLOOWXUQ
RIIWKHLQHFLHQF\%%8VDQGWKXVSHUIRUPVEHWWHUWKDQ
WKH &&% VFKHPH ,Q JHQHUDO DV WKH 35% XWLOL]DWLRQ
UDWLR LQFUHDVHV WKH 3&%%8 DOVR LQFUHDVHV EHFDXVH
KLJKHU 35% XWLOL]DWLRQ UDWLR LQFXUV KLJKHU EXUGHQ WR
HDFK55+DQGWKXVOHVV%%8VFDQEHUHFRQILJXUHGDQG
LQFUHDVHV WKH SRZHU FRQVXPSWLRQ RI WKH %%8V 7KH
(&5VFKHPHSHUIRUPVEHWWHUWKDQWKH(&5VFKHPH
EHFDXVH LW FDQ DYRLG WKH SLQJ SRQJ HIIHFW DQG WKXV LW
FDQDYRLGVXQQHFHVVDU\UHFRQILJXUDWLRQV
D
7KURXJKSXW73

)LJXUH VKRZV WKH 73 E\ WXQLQJ WKH QXPEHU RI
55+V UDQJLQJ IURP WR DQG SDFNHW DUULYDO UDWH
UDQJLQJIURPaSDFNHWVHF)LJXUHDLOOXVWUDWHV
WKDW WKH 73 RI RXU VFKHPHV LV KLJKHU WKDQ WKDW RI WKH
&&%VFKHPHEHFDXVHRXUVFKHPHVDUH(&5EDVHGWKDW
RQO\WKH%%8ZLWKORZWUDQVPLVVLRQHIILFLHQF\ZLOOEH
WXUQ RII DQG WKXV RXU VFKHPHV FDQ DFKLHYH KLJKHU 73
,QJHQHUDOWKHQXPEHURI55+VDOVRLQFUHDVHVWKH73
DOVR LQFUHDVHV EHFDXVH ODUJHU QXPEHU RI 55+V LQFXUV
KLJKHU WUDIILF DQG WKXV WKH 73 EHFRPHV KLJKHU )LJXUH
E VKRZV WKH 73 XQGHU YDULRXV SDFNHW DUULYDO UDWHV
WKH 73 RI RXU VFKHPHV LV ORZHU WKDQ WKDW RI WKH &&%
VFKHPH EHFDXVH RXU VFKHPHV FDQ DFKLHYH KLJKHU
WUDQVPLVVLRQHIILFLHQF\ WKDQWKH&&%VFKHPHGRHV,Q
JHQHUDODVWKHSDFNHWDUULYDOUDWHLQFUHDVHVWKH73DOVR
LQFUHDVHV EHFDXVH KLJKHU SDFNHW DUULYDO UDWH LQFXUV
KLJKHU WUDIILF ORDG +RZHYHU ZKHQ SDFNHW DUULYDO UDWH
LV KLJKHU WKDQ SDFNHWVVHF WKH 73 GURSV EHFDXVH WKH
WUDIILF ORDG LV WRR KLJK WKDW WKH QHWZRUN LV FRQJHVWHG
7KH (&5 VFKHPH SHUIRUPV EHWWHU WKDQ WKH (&5
VFKHPHEHFDXVHLWFDQDYRLGWKHSLQJSRQJHIIHF

D

E
)LJXUH D 7KURXJKSXW YV QXPEHU RI 55+V E
7KURXJKSXWYVSDFNHWDUULYDOUDWH

E
)LJXUHD(&5YVQXPEHURI55+VE(&5YV
35%XWLOL]DWLRQUDWLR
- 119 -
ICEIC 2015

(QHUJ\&RQVXPSWLRQ5DWLR(&5

)LJXUH VKRZV WKH (&5 E\ WXQLQJ WKH QXPEHU RI
55+VUDQJLQJIURPWRDQG35%XWLOL]DWLRQUDWLR
UDQJLQJ IURP a )LJXUH D LOOXVWUDWHV WKDW
WKH (5 RI RXU VFKHPH LV ORZHU WKDQ WKDW RI WKH &&%
VFKHPH EHFDXVH RXU VFKHPHV DUH (&5EDVHG ,Q
JHQHUDODVWKHQXPEHURI55+VLQFUHDVHVWKH3&%%8
DOVR LQFUHDVHV EHFDXVH ODUJHU QXPEHU RI 55+V LQFXUV
KLJKHU WUDIILF DQG KLJKHU SRZHU FRQVXPSWLRQ DQG WKXV
WKH (&5 EHFRPHV KLJKHU )LJXUH E VKRZV WKH (&5
XQGHU YDULRXV UDWLR RI XWLOL]DWLRQ WKH (&8 RI RXU
VFKHPHVLVORZHUWKDQWKDWRIWKH&&%VFKHPHEHFDXVH
RXU VFKHPHV FRQVLGHUV (&5 DV WKH PRVW LPSRUWDQW
IDFWRU,QJHQHUDODVWKH35%XWLOL]DWLRQUDWLRLQFUHDVHV
WKH(&5DOVRLQFUHDVHVEHFDXVHKLJKHU35%XWLOL]DWLRQ
UDWLR LQFXUV KLJKHU EXUGHQ WR HDFK 55+ DQG WKXV
LQFUHDVHV WKH SRZHU FRQVXPSWLRQ RI WKH 55+V 7KH
(&5VFKHPHSHUIRUPVEHWWHUWKDQWKH(&5VFKHPH
EHFDXVH LW FDQ DYRLG WKH SLQJ SRQJ HIIHFW DQG WKXV LW
FDQDYRLGVXQQHFHVVDU\SRZHUFRQVXPSWLRQV

&RQFOXVLRQV

,QWKLVSDSHUZHSUHVHQWDQHZUHFRQILJXUDWLRQVFKHPH
LQ &5$1V 7KH %%8 ZLWK WKH KLJKHVW (&5 LV
UHFRQILJXUHG ILUVW WKDW WKH 55+ RI WKLV %%8 ZLWK WKH
KLJKHVW(&5LVUHDVVLJQHGWRWKHQHDUHVW%%8ZLWKWKH
ORZHVW (&5 7KH SURFHVV SURFHHGV XQWLO DOO WKH %%8V
ZLWKKLJK(&5KDYHEHHQUHFRQILJXUHGDQGWXUQHGRII
6LPXODWLRQUHVXOWVLOOXVWUDWHWKDWWKHSURSRVHG(5EDVHG
UHFRQILJXUDWLRQ VFKHPH FDQ UHGXFH WKH WRWDO SRZHU
FRQVXPSWLRQRI%%8VDQGHQKDQFHWKHWKURXJKSXW

$FNQRZOHGJPHQW

7KLVUHVHDUFKZDVVXSSRUWHGE\WKH0LQLVWU\RI6FLHQFH
DQG7HFKQRORJ\RIWKH52&XQGHU*UDQWV0267
(0<

5HIHUHQFHV

>@ &KLQD 0RELOH 5HVHDUFK ,QVWLWXWH &5$1 7KH
5RDG7RZDUGV*UHHQ5$1:KLWH3DSHU9HUVLRQ
-XQ

>@ < <DQJ & /LP DQG $ 1LUPDODWKDV &RORQ\
5$1 $UFKLWHFWXUH IRU )XWXUH &HOOXODU 1HWZRUN LQ
3URFHHGLQJV RI )XWXUH 1HWZRUN 0RELOH 6XPPLW
)XWXUH1HWZ SS %HUOLQ *HUPDQ\ -XO\

>@'=KXDQG0/HL7UDIILFDGDSWDWLRQDQGHQHUJ\
VDYLQJ SRWHQWLDO RI FHQWUDOL]HG UDGLR DFFHVV QHWZRUNV
ZLWKFRRUGLQDWHGUHVRXUFHDOORFDWLRQDQGFRQVROLGDWLRQ
LQ 3URFHHGLQJV RI WK ,QWHUQDWLRQDO &RQIHUHQFH RQ
&RPPXQLFDWLRQV DQG 1HWZRUNLQJ LQ &KLQD
&+,1$&20SS*XLOLQ$XJ

>@ $ &KHFNR + &KULVWLDQVHQ DQG 0 6 %HUJHU
(YDOXDWLRQ RI (QHUJ\ DQG &RVW 6DYLQJV LQ 0RELOH
&ORXG5$1LQ3URFHHGLQJVRI231(7:25.
SS:DVKLQJWRQ86$$XJ

>@ $ &KHFNR + &KULVWLDQVHQ DQG 0 6 %HUJHU
(QHUJ\ (IILFLHQW MRLQW '7; DQG 0,02 LQ &ORXG
5DGLR $FFHVV 1HWZRUNV LQ 3URFHHGLQJV RI ,((( VW
,QWHUQDWLRQDO &RQIHUHQFH RQ &ORXG 1HWZRUNLQJ
&/28'1(7SS3DULV)UDQFH1RY

>@<<DQJ&/LPDQG$1LUPDODWKDV5DGLRRYHU
)LEHU DV WKH (QHUJ\ (IILFLHQW %DFNKDXO 2SWLRQ IRU
0RELOH%DVH6WDWLRQVLQ3URFHHGLQJVRI,QWHUQDWLRQDO
7RSLFDO 0HHWLQJ RQ 0LFURZDYH 3KRWRQLFV &RQIHUHQFH
SS6LQJDSRUH2FW

>@ & /LX . 6XQGDUHVDQ 0 -LDQJ 6 5DQJDUDMDQ
DQG * . &KDQJ 7KH &DVH IRU 5HFRQILJXUDEOH
%DFNKDXOLQ&ORXG5$1EDVHG6PDOO&HOO1HWZRUNV
LQ 3URFHHGLQJV RI ,((( ,QWHUQDWLRQDO &RQIHUHQFH RQ
FRPSXWHU &RPPXQLFDWLRQV ,1)2&20 SS
7XULQ&KLQD$SU

>@ 6 1DPED 7 :DUDELQR DQG 6 .DQHNR %%8
55+ VZLWFKLQJ VFKHPHV IRU FHQWUDOL]HG 5$1 LQ
3URFHHGLQJV RI WK ,QWHUQDWLRQDO &RQIHUHQFH RQ
&RPPXQLFDWLRQV DQG 1HWZRUNLQJ LQ &KLQD
&+,1$&20 SS .XQ 0LQJ $XJ

>@'=KXDQG0/HL7UDIILFDQGLQWHUIHUHQFHDZDUH
G\QDPLF %%8558 PDSSLQJ LQ &5$1 7'' ZLWK
FURVVVXEIUDPH FRRUGLQDWHG VFKHGXOLQJEHDPIRUPLQJ
LQ 3URFHHGLQJV RI ,((( ,QWHUQDWLRQDO &RQIHUHQFH RQ
&RPPXQLFDWLRQV:RUNVKRSV,&&SS
%XGDSHVW-XQ
- 120 -
TO-3-4-2
Optimal Power Allocation for Full Duplex Decode and Forward Relay
Systems
Taehoon Kwon and Joon Woo Lee*
Korea Institute of Science and Technology Information (KISTI),
66 Heogi-ro, Dongdeamoon-gu, Seoul, Korea 130-741.
kth78@kisti.re.kr and jwlee@kisti.re.kr*
which is re-encoded based on the prior received signal,
to the destination.
Abstract
This paper deals with an optimal power allocation for
full duplex decode and forward relay systems. First, an
optimal power allocation is derived to minimize the
outage probability under Rayleigh fading channel.
Then, the practical method is considered to acquire
parameters for the proposed power allocation.
Keywords: power allocation, full duplex, relay system.
Figure 1. FDR system model
1. Introduction
Relay system can be categorized into two methods by
duplex mode. One is half duplex relay (HDR) system
in which the relay receives and retransmits on
orthogonal channels. The other is full duplex relay
(FDR) system in which the relay receives and
retransmits concurrently on the same channel [1]-[5].
Contrary to HDR where the maximum power of relay
is optimal, determining an optimal power is an
important factor to maximize the gain of FDR. For
example, if the transmission power of the relay is too
high, the connection reliability between the source and
the relay is decreased due to the increased selfinterference. On the contrary, if the transmission power
of the relay is too low, the connection reliability
between the relay and the destination is decreased due
to the decreased signal power.
In this paper, the optimal power allocation is proposed
to minimize the outage probability of FDR together
with a practical consideration for acquiring parameters.
3. Optimal power allocation for FDR

A. Optimal power allocation for FDR
The maximum transmission power is optimal in HDR
since it maximizes the signal to noise ratio (SNR). In
contrast, since the transmitted signal acts as
interference to the receiver of the relay, the maximum
transmission power is not optimal in FDR. Therefore,
we will determine an optimal power to minimize the
outage probability of FDR. The optimization problem
can be formulated as:
min ( , ) , subject to 0 , (1)
where is the maximum power of relay.

Under the assumption that the source and the
destination is too far for the interference to be
considered, the outage probability of FDR can be
expressed by the similar method in [4] as follows:
( , ) =
1
2. System model of FDR

Using the similar system model in [4], FDR system
consists of a source (S), a relay (R) and a destination
(D) as depicted in Figure 1. The source sends its
information to the destination and the relay receives
that signal and retransmits the signal concurrently,
1
1+ (2 1)
1
1
+
)(2 1)

, (2)
where is the target rate.

In order to find a solution of (1), we must find the
( , )
extreme point, which corresponds to =0.
Because should be greater than zero, the optimal

power is derived as follows:
- 121 -
ICEIC 2015
4
(2 1)+ +(2 1)2
(3)
Since the outage probability is not guaranteed to be
convex with respect to , we need to prove that

of (3) satisfies the minimum outage probability in the
given range 0< .
1) When 0 < , it is easily shown that

( , )
< 0 since , , , (2
1) and
are positive. It means that ( , ) is decreasing

function in this range. In addition, if approaches to
zero, the outage probability also approaches one and
( , )< ( , 0) . Thus,
is a local
minimizer of ( , ) in the range of 0 < .
2) When , it is easily shown that

( , )
> 0 since , , , (2
1) and
are positive. It means that ( , ) is increasing

function in this range. In addition, it is easily shown
that ( , ) ( , ) since .
Thus, is a local minimizer of ( , ) in the
range of .
Therefore, we can conclude that

minimizes
( , ) in the range of 0< .

B. Practical consideration for the required parameter
acquisition
The energy detection can be considered to acquire
parameters for the optimal power allocation. In
practical communication systems, reference signals are
used for channel estimation or synchronization with a
constant power which is known to receiver. The result
of the energy detection can be obtained in the reference
signal region as follows:
1
= | + |2 (2 ) (2 ) + (2 )
=1
= ( + 1) 2 , x {, , },
(4)
where N, hx , rx , n, x , and 2 expresses the
number of energy detection samples, channel,
reference signal, noise, CNR, the power of reference
signals of each link x {, , } and noise
variance. E() means an expectation operator.
The noise variance can also be obtained by the energy
detection with no transmission region.
1
2
2
2
=
(5)
=1|| ( ) = .
Figure 2 shows the superiority of the proposed power

allocation with respect to CNR of S-D link. The relay
is assumed to be positioned at 2/3 from S to D with
pathloss exponent 4. This result shows that the
proposed optimal power allocation minimizes the
outage probability of FDR well.
4. Conclusions
The optimal power allocation is derived to minimize
the outage probability of FDR. Next, the practical
method is considered to acquire parameters for the
proposed power allocation. The simulation result
shows the superiority of the proposed power allocation.
References
[1] H. Ju, E. Oh, and D. Hong, Improving Efficiency of
Resource Usage in Two-Hop Full Duplex Relay Systems
based on Resource Sharing and Interference Cancellation,
IEEE Trans. on Wireless Commun., Vol. 8, Issue. 8, pp.
3933-3938, Aug. 2009
[2] D. W. Bliss, P. A. Parger, and A. R. Margetts,
Simultaneous transmission and reception for improved
wireless network performances, in Proc. IEEE Int.
Workshop on Statistical Signal Processing, pp. 472-478, Aug.
2007.
[3] H. Ju, E. Oh, and D. Hong, Catching resource-devouring
worms in next-generation wireless relay systems: two-way
relay and full-duplex relay, IEEE Communications
Magazine, Vol. 47, Issue 9, pp. 58-65, Sept. 2009.
[4] T. Kwon, S. Lim, S. Choi and D. Hong, "Optimal Duplex
Mode for DF Relay in Terms of the Outage Probability,"
IEEE Trans. on Vehicular Technology, Vol. 59, No.7, pp.
3628-3634, Sept. 2010.
[5] T. Kwon and D. Hong, "Bit Error Probability
Performance Analysis of Full Duplex Relay System", in Proc.
Int. Conference on Electronics, Information, and
Communication (ICEIC) 2010, pp.609-610, June 2010.
0.14
FDR (Max Power, : 10 dB)
FDR(Optimal Power, : 10 dB)
FDR (Max Power, : 5 dB)
FDR(Optimal Power, : 5 dB)
FDR (Max Power, : 2.5 dB)
FDR(Optimal Power, : 2.5 dB)
0.12
0.1
Outage Prob.
0.08
0.06
Optimal Power
Gain
0.04
0.02
CNR of each link can be calculated as follows:

=
( 1)
, x {, , }.
(6)
Note that the receiver can calculate easily since it

knows the reference signal.
8
10
12
14
CNR of S-D link ( ,dB)
16
18
20
Figure 2. Outage probability with respect to CNR of

2 4
S-D link ( = ( )
3
= 1, = 0.1 /)
- 122 -
1 4
, = ( )
3
, =
TO-3-4-3
7KH'HVLJQRID'DWD*DWKHULQJ3URWRFROIRU&RJQLWLYH:LUHOHVV6HQVRU
1HWZRUNV

&KLK6KXQ+VXDQG3LQ-LH:DQJ
'HSDUWPHQWRI,QIRUPDWLRQ0DQDJHPHQW6KLK+VLQ8QLYHUVLW\7DLSHL7DLZDQ
FVKVX#FFVKXHGXWZOHYLV#KRWPDLOFRP

$EVWUDFW

'DWD JDWKHULQJ LV DQ LPSRUWDQW RSHUDWLRQ LQ
ZLUHOHVV VHQVRU QHWZRUNV +RZHYHU :LUHOHVV VHQVRU
QHWZRUNVPD\IDFHWKHSUREOHPVRIVSHFWUXPVKRUWDJH
DQG RYHUORDGHG WUDIILF 7KXV ZH XVH WKH FRPELQDWLRQ
RIFRJQLWLYHUDGLRDQGZLUHOHVVVHQVLQJWHFKQRORJLHVWR
GHVLJQ D QHZ GDWD JDWKHULQJ SURWRFROV VR DV WR
PLWLJDWH WKH SUREOHP RI FRQWHQWLRQV DQG FRQJHVWLRQV
7KHFOXVWHUEDVHGGDWDJDWKHULQJVWUXFWXUHDQGWKHWUHH
EDVHG GDWD JDWKHULQJ VWUXFWXUH DUH DGRSWHG LQ WKH
SURSRVHG SURWRFRO 7KH VHQVHG LQIRUPDWLRQ LQ WKH
ZLUHOHVVVHQVRUQHWZRUNLVILUVWJDWKHUHGWRWKHFOXVWHU
KHDGNQRZQDVDJJUHJDWLRQZKLFKFDQKHOSWRUHGXFH
WKH DPRXQW DQG HQHUJ\ QHHGHG WR WUDQVPLW JDWKHUHG
GDWD WR SDUHQW QRGHV 3DUHQW QRGHV SHUIRUP WKH
VSHFWUXP DOORFDWLRQ DQG WUDQVPLVVLRQ VFKHGXOLQJ IRU
FKLOG QRGHV VR DV WR UHGXFH WKH GHOD\V DQG H[FHVVLYH
FRPSHWLWLRQFDXVHGE\EXUVWLQJWUDIILFV7KHVLPXODWLRQ
UHVXOWV GHPRQVWUDWH WKDW WKH SURSRVHG GDWD JDWKHULQJ
SURWRFRORXWSHUIRUPVWKHH[LVWLQJSURWRFROVLQWHUPVRI
GDWDJDWKHULQJGHOD\

.H\ZRUGV&RJQLWLYHUDGLRGDWDDJJUHJDWLRQZLUHOHVV
VHQVRUQHWZRUN
,QWURGXFWLRQ

8VXDOO\ WKH ZLUHOHVV VHQVRU QRGHV DUH GHQVHO\
GHSOR\HG KHQFH WKH FRPPXQLFDWLRQV EHWZHHQ VHQVRU
QRGHV DUH HDV\ WR EH LQWHUIHUHG RU FROOLGHG ZLWK HDFK
RWKHU%HVLGHVWKHVSHFWUXPXVHGE\=LJ%HHLVDOUHDG\
RYHUFURZGHG WKDW FRQWHQWLRQV DQG FRQJHVWLRQV PD\
RFFXUZKHQVRPHHYHQWVRFFXUDQGORWVRIGDWDQHHGVWR
EHWUDQVPLWWHGDQGJDWKHUHG7RHQKDQFHWKHTXDOLW\RI
FRPPXQLFDWLRQ VSHFWUXP DQG UDLVH WKH XVDJH UDWH RI
VSHFWUXP FRJQLWLYH UDGLR VHQVRU QHWZRUNV &561
ZKLFKFDQVFDQIUHHVSHFWUXPIRUXVDJHKDYHDWWUDFWHG
DORWRIDWWHQWLRQUHFHQWO\>@
'DWD JDWKHULQJ LV DQ LPSRUWDQW SURWRFRO LQ ZLUHOHVV
VHQVRU QHWZRUN VR DV WR JDWKHU VHQVHG LQIRUPDWLRQ WR
WKH VLQN LQ WLPH 6HYHUDO GDWD JDWKHULQJ VFKHPHV KDYH

EHHQ SURSRVHG >@>@>@>@>@>@ +RZHYHU LQ
FRJQLWLYHUDGLRVHQVRUQHWZRUNVWKHDYDLODEOHVSHFWUXP
RI HDFK VHQVRU PD\ EH GLIIHUHQW DQG UHOLDELOLW\ DQG
TXDOLW\RIWKHDYDLODEOHVSHFWUXPPD\DOVREHGLIIHUHQW
KHQFHWKHGDWDJDWKHULQJSURWRFROVRIWKHFRQYHQWLRQDO
ZLUHOHVV VHQVRU QHWZRUNV :61V FDQQRW ZRUN
SURSHUO\LQFRJQLWLYHUDGLRVHQVRUQHWZRUNV
6HYHUDO URXWLQJ SURWRFRO IRU FRJQLWLYH UDGLR
QHWZRUNV KDYH EHHQ SURSRVHG >@>@ +RZHYHU WKHVH
SURWRFROV GR QRW FRQVLGHU SRZHU VDYLQJ DQG DUH QRW
HIILFLHQWIRUGDWDJDWKHULQJLQDWUHHEDVHGVWUXFWXUHDQG
WKXV DUH QRW VXLWDEOH IRU GDWD JDWKHULQJ LQ ZLUHOHVV
VHQVRUQHWZRUNV
,Q WKLV SDSHU D GDWD JDWKHULQJ SURWRFRO ZKLFK
FRPELQHV WKH FOXVWHUEDVHG DQG WUHHEDVHG VWUXFWXUH LV
GHVLJQHGIRU&561V%HVLGHVWKHUHVLGXDOSRZHURIWKH
VHQVRU QRGHV WKH DYDLODEOH FKDQQHO LV DOVR FRQVLGHUHG
ZKLOH HOHFWLQJ WKH FOXVWHU KHDG DQG FRQVWUXFWLQJ WKH
JDWKHULQJ WUHH :KHQ WKH DYDLODEOH FKDQQHO LV
RFFXSLHGE\WKHSULPDU\XVHURURWKHUVHFRQGDU\XVHUD
PDLQWDLQLQJ VFKHPH LV SURSRVHG 6LPXODWLRQ UHVXOWV
MXVWLI\WKHHIILFLHQF\RIWKHSURSRVHGSURWRFRO
3UHOLPLQDULHV DUH VKRZQ LQ 6HFWLRQ 6HFWLRQ
GHVFULEHV WKH SURSRVHG GDWD JDWKHULQJ VFKHPH
6LPXODWLRQUHVXOWVDUHSUHVHQWHGLQ6HFWLRQV 6HFWLRQ
FRQFOXGHVWKLVSDSHU
3UHOLPLQDULHV

6\VWHP0RGHODQG$VVXPSWLRQV
7KH SURSRVHG GDWD JDWKHULQJ SURWRFRO LV GHVLJQHG
IRUD&561ZKRVHV\VWHPPRGHOLVVKRZQDV)LJXUH
7KHUH DUH D VLQN VRPH EDVH VWDWLRQV VRPH SULPDU\
XVHUV 38V DQG ORWV RI VHFRQGDU\ XVHUV 68V LQ WKH
&561 (DFK ZLUHOHVV VHQVRU QRGH SHUIRUPV DV D
VHFRQGDU\ XVHU 68 (DFK VHQVRU QRGH LV UDQGRPO\
GHSOR\HGDQGLVHTXLSSHGZLWKDWUDQVFHLYHU7KHUHLVD
FRPPRQFRQWUROFKDQQHODQG1GDWDFKDQQHOVIRUHDFK
VHQVRU QRGH +RZHYHU WKH GDWD FKDQQHO PD\ EH
- 123 -
ICEIC 2015
RFFXSLHG E\ WKH SULPDU\ XVHUV 38V DQG KHQFH HDFK

VHQVRUQRGHKDVWKHDELOLW\WRVHQVHWKHVSHFWUXPVRDV
WRDYRLGLQWHUIHULQJZLWKWKH38V
FDQ EDODQFH WKH SRZHU FRQVXPSWLRQ RI HDFK VHQVRU

QRGH EXW LW LQFXUV D ORQJ GDWD JDWKHULQJ GHOD\ 7R
LPSURYH 3(*$6,6 D FKDLQEDVHG FOXVWHULQJ URXWLQJ
SURWRFROLVSURSRVHGLQ>@
6HYHUDO URXWLQJ SURWRFRO IRU FRJQLWLYH UDGLR
QHWZRUNVKDYHEHHQSURSRVHG>@>@$VSHFWUXPDZDUH
URXWLQJ SURWRFRO 6$53 LV SURSRVHG LQ >@ 6$53
FRQWDLQV WZR IXQFWLRQV WKH PXOWLLQWHUIDFH VHOHFWLRQ
IXQFWLRQ 0,6) DQG WKH PXOWLSDWK VHOHFWLRQ IXQFWLRQ
036) 0,6) VHOHFWV LQWHUIDFH DFFRUGLQJ WR WKH
TXHXHLQJGHOD\ZKLOH036)VHOHFWVSDWKDFFRUGLQJWR
WKH WKURXJKSXW LQFUHPHQW 6SHFWUXP$ZDUH &OXVWHU
EDVHG 5RXWLQJ 3URWRFRO 6&53 IRU FRJQLWLYH UDGLR
QHWZRUN LV SURSRVHG LQ >@ :KHQ WKH DYDLODEOH
VSHFWUXP LV FKDQJHG RU GLVDSSHDUHG 6&53 XVHV WKH
VSHFWUXP KDQGRYHU DQG URXWH UHEXLOW WR UHFRYHU WKH
)LJXUH6\VWHPPRGHORIWKH&561
EURNHQ URXWH 7KH DQDO\VLV RI LQIRUPDWLRQ WKHRUHWLFDO
RSWLPL]DWLRQ JDLQV IRU HQHUJ\ DGDSWLYH GDWD JDWKHULQJ
5HODWHG:RUNV
DQG UHOD\LQJ LQ FRJQLWLYH UDGLR VHQVRU QHWZRUNV LV
6HYHUDO GDWD JDWKHULQJ SURWRFROV IRU :61V KDYH
SURSRVHG LQ >@ +RZHYHU WKH V\VWHP PRGHO RI WKLV
EHHQ SURSRVHG $Q HQHUJ\ HIILFLHQW FOXVWHU EDVHG GDWD
SDSHULVQRWSUDFWLFDO
DJJUHJDWLRQ(&%'$SURWRFROLVSURSRVHGLQ>@7KH

ZLUHOHVVVHQVRUQRGHVDUHGLYLGHGLQWRVHYHUDOFOXVWHUV
0RWLYDWLRQV
7KH VHQVRU QRGH ZLWK WKH KLJKHVW UHVLGXDO HQHUJ\ LV
7KH H[LVWLQJ GDWD JDWKHULQJ SURWRFROV IRU :61V
HOHFWHG DV WKH FOXVWHU KHDG &+ :KHQ WKH UHVLGXDO
RQO\FRQVLGHUVWKHUHVLGXDOHQHUJ\RIWKHVHQVRUQRGHWR
HQHUJ\RIWKH&+LVEHORZWKHWKUHVKROGDQHZ&+ZLOO
FKRRVH WKH UHOD\ QRGH 7KH DYDLODEOH FKDQQHO DQG WKH
EH HOHFWHG 7KH &+ DJJUHJDWHV WKH VHQVHG GDWD RI LWV
FKDQQHO FRQGLWLRQ DUH QRW FRQVLGHUHG DQG KHQFH WKH
PHPEHUVDQGWKHQWKHDJJUHJDWHGGDWDLVIRUZDUGHGWR
GDWDJDWKHULQJSURWRFROVRIWKHFRQYHQWLRQDO:61VDUH
WKH VLQN 0XOWLKRS /($&+ ORZHQHUJ\ DGDSWLYH
QRWVXLWDEOHIRU&561V7KHGHVLJQJRDORIWKHURXWLQJ
FOXVWHULQJKLHUDUFK\LVSURSRVHGLQ>@7RUHGXFHWKH
SURWRFROVIRUFRJQLWLYHUDGLRQHWZRUNVLVWRHQKDQFHWKH
HQHUJ\FRQVXPSWLRQWKHVHQVHGGDWDLVVHQWWRWKH&+
QHWZRUN WKURXJKSXW 7KH HQHUJ\ FRQVXPSWLRQ DQG
ILUVWDQGWKHQWKH&+IRUZDUGVWKHJDWKHUHGGDWDWRWKH
EDODQFHRIPRELOHQRGHVDUHQRWFRQVLGHUHGDQGKHQFH
VLQNLQDPXOWLKRSPDQQHU(66&67$(QHUJ\(IILFLHQW
WKHVHURXWLQJSURWRFROVDUHDOVRQRWVXLWDEOHIRU&561V
6OHHS 6FKHGXOHG &OXVWHULQJ 6SDQQLQJ 7UHH %DVHG 'DWD
7KHUHIRUH LQ WKLV SDSHU ZH GHVLJQ DQ HIILFLHQW GDWD
$JJUHJDWLRQ >@ LV D GDWD JDWKHULQJ SURWRFRO LPSURYHG
JDWKHULQJ SURWRFRO IRU &561V ZKLFK FDQ EDODQFH DQG
IURP/($&+7KHFOXVWHUKHDGLVHOHFWHGDFFRUGLQJWR
UHGXFHWKHHQHUJ\FRQVXPSWLRQRIVHQVRUQRGHV,WFDQ
WKHUHVLGXDOHQHUJ\DQGGDWDFRUUHODWLRQV7KHJDWKHULQJ
DOVR UHGXFH FRQWHQWLRQV FROOLVLRQV DQG GHOD\ RI GDWD
GDWD LV DJJUHJDWHG LQ WKH FOXVWHU DQG WKHQ VHQW WR WKH
JDWKHULQJ
VLQN E\ PXOWLKRS IRUZDUGLQJ '*66 'DWD *DWKHULQJ

6OHHS 6FKHPH >@ LV D WUHHEDVHG GDWD JDWKHULQJ
7KH3URSRVHG'DWD*DWKHULQJ6FKHPH
SURWRFRO ZLWK VOHHSLQJ PHFKDQLVP %HIRUH JDWKHULQJ

GDWD WKH VLQN EURDGFDVWV D +HOOR PHVVDJH WKH :61
7KH FRQVWUXFWLRQ RI WKH JDWKHULQJ VWUXFWXUH LV
WR ZDNH XS DOO WKH VHQVRU QRGHV DQG FRQVWUXFW D GDWD
GHVFULEHG
ILUVW IROORZHG E\ WKH PDLQWHQDQFH RI WKH
JDWKHULQJ WUHH 7KH VHQVHG GDWD LV IRUZDUGHG E\ WKH
JDWKHULQJVWUXFWXUH
OHDYHV ILUVW $IWHU IRUZDUGLQJ WKH VHQVHG GDWD WKH
7KHDOJRULWKPWRFRQVWUXFWWKHJDWKHULQJVWUXFWXUHLV
VHQVRUQRGHFDQJRWRVOHHSLQJPRGH$IWHU WKHSDUHQW
VKRZQDVIROORZV
QRGHJDWKHUVDOOWKHGDWD IURPLWVFKLOGUHQLWIRUZDUGV
6(DFKVHQVRUQRGHXVHVWKHFRPPRQFRQWUROFKDQQHO
WKH JDWKHUHG GDWD WR LWV SDUHQW 3(*$6,6 3RZHU
WR H[FKDQJH WKH UHVLGXDO HQHUJ\ WKH DYDLODEOH
(IILFLHQW*DWKHULQJLQ6HQVRU,QIRUPDWLRQ6\VWHPV>@
FKDQQHOV DQG FKDQQHO TXDOLW\ ZLWK QHLJKERULQJ
XVHVDFKDLQEDVHGVWUXFWXUHWRJDWKHUVHQVHGGDWDVRDV
QRGHVWKURXJKEHDFRQSDFNHWV
WRH[WHQGWKHOLIHWLPHRI:61$OOWKHVHQVRUQRGHVDUH
67KH
VHQVRU QRGH ZKRVH UHVLGXDO HQHUJ\ LV KLJKHU
FRQQHFWHG DV D FKDLQ 7KH VHQVHG GDWD LV IRUZDUGHG
WKDQ
WKH WKUHVKROG DQG KDV WKH PRVW FRPPRQ
IURP WKH FKDLQ WDLO WR WKH FKDLQ KHDG DQG WKHQ
IRUZDUGHG IURP WKH FKDLQ KHDG WR WKH VLQN 3(*$6,6
- 124 -
ICEIC 2015
FKDQQHOV ZLWK LWV QHLJKERUV DQG FRYHUV WKH PRVW

QXPEHURIQHLJKERUVLVHOHFWHGDVWKHFOXVWHUKHDG
67KH VHQVRU QRGH MRLQV WKH FOXVWHU ZKRVH FOXVWHU
KHDGKDVWKHPRVWFRPPRQ DYDLODEOH FKDQQHOV ZLWK
LWDQGKDVWKHOHDVWPHPEHUV
6,IDVHQVRUQRGHFDQQRWMRLQDQ\FOXVWHULWZLOOIRUP
DQHZFOXVWHUDQGEHFRPHWKHFOXVWHUKHDG
6:KHQ WKH FOXVWHUV DUH IRUPHG WKH FOXVWHU KHDG
FKRRVH WKH QHLJKERULQJ FOXVWHU ZKLFK KDV FRPPRQ
DYDLODEOH FKDQQHOV DQG LV FORVHU WR WKH VLQN DV LWV
SDUHQWFOXVWHU
67KHFOXVWHUKHDGVFKHGXOHWKHWUDQVPLVVLRQRIDOOLWV
PHPEHUV DQG FKLOGUHQ DFFRUGLQJ WR WKHLU FRPPRQ
DYDLODEOH FKDQQHOV 7R DYRLG IUHTXHQWO\ FKDQQHO
VZLWFKLQJWKHQRGHVZLWKWKHVDPHGDWDFKDQQHODUH
VFKHGXOHG LQ D FRQVHFXWLYH RUGHU 7KH WUDQVPLVVLRQ
LVVFKHGXOHGLQDERWWRPXSRUGHU
)LJXUH)RUPLQJRIWKHFOXVWHUV

)LJXUH VKRZV DQ H[DPSOH RI WKH IRUPLQJ RI WKH
FOXVWHUV 7KH QXPEHUV EHVLGH WKH QRGH LG DUH WKH
DYDLODEOH FKDQQHOV RI WKH VHQVRU QRGH $IWHU WKH
H[FKDQJHRIEHDFRQSDFNHWVQRGHV&*-.4DQG6
DUHHOHFWHGDVWKHFOXVWHUKHDG1RGHV$%DQG)MRLQ
FOXVWHU KHDG & DQG IRUP D FOXVWHU QRGHV ' + DQG ,
MRLQFOXVWHUKHDG*DQGIRUPDFOXVWHUQRGHV(DQG/
MRLQFOXVWHUKHDG-DQGIRUPDFOXVWHUQRGHV70DQG
1MRLQFOXVWHUKHDG.DQGIRUP D FOXVWHU QRGHV 2 3
DQG 5 MRLQ FOXVWHU KHDG 4 DQG IRUP D FOXVWHU QRGH 8
MRLQVFOXVWHUKHDG6DQGIRUPDFOXVWHU
UHVSHFWLYHO\ $V WKH JDWKHUHG GDWD LV IRUZDUGHG IURP

WKH FOXVWHU KHDG WR WKH JDWHZD\ WKH JDWKHUHG GDWD LV
WKHQIRUZDUGHGWRWKHQRGHZKLFKLVFORVHUWRWKHVLQN
&OXVWHU KHDGV 4 DQG 6 DUH QHLJKERUV RI WKH VLQN DQG
KHQFH WKH JDWKHUHG GDWD LV IRUZDUGHG WR WKH VLQN
GLUHFWO\ )LJXUH VKRZV WKH FRQVWUXFWLRQ RI WKH
JDWKHULQJVWUXFWXUHLQD&561
$VWKHJDWKHULQJVWUXFWXUHLVFRQVWUXFWHGWKHGDWDLV
DJJUHJDWHG DW WKH FOXVWHU ILUVW DQG WKHQ IRUZDUGHG WR
WKHVLQNDORQJWKHJDWKHULQJVWUXFWXUH7KHDOJRULWKPWR
PDLQWDLQWKHJDWKHULQJVWUXFWXUHLVVKRZQDVIROORZV
6%HIRUH D VHQVRU QRGH IRUZDUG WKH JDWKHUHG GDWD LW
VKRXOG VHQVH WKH GDWD FKDQQHO ILUVW ,I WKH GDWD
FKDQQHO LV RFFXSLHG WKH VHQGHU FDQ VZLWFK WR WKH
EDFNXS FKDQQHO UHVFKHGXOH WKH WUDQVPLVVLRQ DQG
QRWLI\WKHUHFHLYHUE\WKHFRPPRQFRQWUROFKDQQHO
6,IDOOWKHFRPPRQGDWDFKDQQHOVRIWKHFOXVWHUKHDG
DQGDPHPEHUDUHRFFXSLHGRUWKHUHVLGXDOHQHUJ\RI
WKHFOXVWHUKHDGLVEHORZWKHWKUHVKROGWKHPHPEHU
VKRXOGFKRRVHRWKHUQHLJKERULQJFOXVWHUKHDGZKLFK
KDVFRPPRQGDWDFKDQQHOVZLWKLWDVLWVQHZSDUHQW
DQG QRWLILHV ERWK WKH QHZ DQG ROG SDUHQWV E\ WKH
FRPPRQFRQWUROFKDQQHO
6,IDOOWKHFRPPRQFKDQQHOVRIWKHFOXVWHUKHDGDQG
DOOLWVPHPEHUVDUHRFFXSLHGWKHFOXVWHUKHDGVKRXOG
EHUHHOHFWHGDQGWKHFOXVWHUVKRXOGEHUHIRUPHG
6,IDOOWKHFRPPRQFKDQQHOVRIWKHFOXVWHUKHDGDQG
LWV SDUHQWV DUH RFFXSLHG WKH FOXVWHU KHDG VKRXOG
FKRRVH WKH RWKHU QHLJKERULQJ FOXVWHU ZKLFK KDV
FRPPRQDYDLODEOHGDWDFKDQQHOVDQGLVFORVHUWRWKH
VLQNDV LWV QHZ SDUHQW FOXVWHU DQG QRWLILHV ERWK WKH
QHZDQGROGSDUHQWVE\WKHFRPPRQFRQWUROFKDQQHO
)LJXUH&RQVWUXFWLRQRIWKHJDWKHULQJVWUXFWXUH
$IWHU IRUPLQJ WKH FOXVWHUV FOXVWHU KHDGV & * -

DQG.FKRRVH QRGHV()/DQG/ DV WKHLU JDWHZD\V
)LJXUH0DLQWDLQLQJWKHJDWKHULQJVWUXFWXUH
)LJXUH VKRZV DQ H[DPSOH RI WKH PDLQWHQDQFH RI

WKHJDWKHULQJVWUXFWXUH2ULJLQDOO\QRGH&XVHVFKDQQHO
WRIRUZDUGWKHJDWKHUHGGDWDWRQRGH(+RZHYHUDV
FKDQQHO LV RFFXSLHG E\ 38 QRGH & FDQ QR ORQJHU
XVH FKDQQHOWRIRUZDUGWKH JDWKHUHGGDWD WR QRGH (
6LQFH QRGH ) DQG QRGH & KDV WZR FRPPRQ GDWD
FKDQQHOVFKDQQHOVDQGQRGH&FKRRVHVQRGH)DV
LWV QHZ SDUHQW DQG XVHV FKDQQHO WR IRUZDUG WKH
JDWKHUHG GDWD WR QRGH ) 6LPLODUO\ DV FKDQQHO LV
- 125 -
ICEIC 2015
RFFXSLHG E\ 38 QRGHV - DQG . FDQ QR ORQJHU XVH

FKDQQHO WR IRUZDUG WKH JDWKHUHG GDWD WR QRGH /
)RUWXQDWHO\QRGHV-DQG.FDQVZLWFKWRFKDQQHOWR
IRUZDUGWKHJDWKHUHGGDWDWRQRGH /DQGWKH JDWKHULQJ
VWUXFWXUHGRHVQRWQHHGWREHDGMXVWHG+RZHYHUVLQFH
QRGH 1 FDQ QR ORQJHU XVH FKDQQHO WR IRUZDUG WKH
JDWKHUHGGDWDWRQRGH.DQGWKH\KDVQRFRPPRQGDWD
FKDQQHO QRGH 1 FKRRVHV QRGH 6 DV LWV QHZ SDUHQW
EHFDXVHWKH\KDVDFRPPRQGDWDFKDQQHOFKDQQHO
SURSHUGDWDFKDQQHOWRWUDQVPLWJDWKHUHGGDWDDWSURSHU
WLPH DQG WKXV LQFXUV OHVV FRQJHVWLRQV DQG FRQWHQWLRQV
6LPXODWLRQ5HVXOWV
7DEOH6LPXODWLRQSDUDPHWHUV
1HWZRUNVL]H
[
P
'DWDUDWH
.ESV
&RPPXQLFDWL
RQUDQJH68
P
3DFNHWVL]H
E\WHV
6SHFWUXP
VHQVLQJWLPH
3RZHU
FRQVXPSWLRQ
RIGDWD
DJJUHJDWLRQ
1XPEHURI
QRGHV68
1XPEHURI
FKDQQHOV
&RPPXQLFDWLRQ
UDQJH38
3UREDELOLW\RI
FKDQQHO
RFFXSLHGE\38
)LJXUH3DFNHWORVVUDWH
a

P
a
PV
,QLWLDOSRZHU
a-
Q-ELW
3RZHU
FRQVXPSWLRQRI
GDWD
WUDQVPLVVLRQ
Q-ELW
7R HYDOXDWH WKH SHUIRUPDQFH RI WKH SURSRVHG

SURWRFRO ZH FRPSDUH LW ZLWK WKH (66&67$ >@ 7KH
VLPXODWLRQ SDUDPHWHUV DUH VKRZQ LQ 7DEOH 7KH
SHUIRUPDQFH PHWULFV REVHUYHG LQ WKH VLPXODWLRQV DUH
SDFNHW ORVV UDWH QHWZRUN WKURXJKSXW GDWD JDWKHULQJ
GHOD\DQGSRZHUFRQVXPSWLRQ

3DFNHW/RVV5DWH
)LJXUHVKRZVWKHSDFNHWORVVUDWHRIWKHSURSRVHG
SURWRFRODQG(66&67$7KHQXPEHUVRIWKHVHFRQGDU\
XVHU68LVWXQHEHWZHHQDQGDQGWKHFKDQQHO
RFFXSLHG SUREDELOLW\ LV WXQH EHWZHHQ DQG
GHQRWHG DV 38a38 $V WKH QXPEHU RI 68
LQFUHDVHV WKH SDFNHW ORVV UDWH RI WKH (66&67$ DOVR
LQFUHDVHV EHFDXVH WKHUH DUH PRUH FRQJHVWLRQV
FRQWHQWLRQV DQG FROOLVLRQV GXULQJ WKH WUDQVPLVVLRQ RI
JDWKHUHG GDWD 7KH SDFNHW ORVV UDWHV RI WKH SURSRVHG
SURWRFRODUHQRWVHQVLWLYHWRWKHQXPEHURI68EHFDXVH
WKH SURSRVHG SURWRFRO FDQ FKRRVH SURSHU FKDQQHO WR
WUDQVPLW JDWKHUHG GDWD DW SURSHU PRPHQW $V WKH
FKDQQHO RFFXSLHG SUREDELOLW\ LQFUHDVHV WKH SDFNHW ORVV
UDWH DOVR LQFUHDVHV EHFDXVH KLJKHU FKDQQHO RFFXSLHG
SUREDELOLW\ FDXVHV OHVV DYDLODEOH GDWD FKDQQHO IRU WKH
68DQGWKXVLQFXUVPRUHFRQJHVWLRQV DQG FRQWHQWLRQV
7KHSDFNHWORVVUDWHRIWKHSURSRVHGSURWRFROLVORZHU
WKDQ (66&67$ EHFDXVH RXU SURWRFRO FDQ VFKHGXOH
1HWZRUN7KURXJKSXW
)LJXUH VKRZV WKH QHWZRUN WKURXJKSXW RI WKH
SURSRVHG SURWRFRO DQG (66&67$ $V WKH QXPEHU RI
68 LQFUHDVHV WKH QHWZRUN WKURXJKSXW DOVR LQFUHDVHV
EHFDXVHWKHUHDUHPRUHJDWKHUHGGDWDWREHWUDQVPLWWHG
$V WKH FKDQQHO RFFXSLHG SUREDELOLW\ LQFUHDVHV WKH
QHWZRUN WKURXJKSXW GHFUHDVHV EHFDXVH KLJKHU FKDQQHO
RFFXSLHGSUREDELOLW\FDXVHVOHVVDYDLODEOHGDWDFKDQQHO
IRU WKH 68 DQG WKXV LQFXUV PRUH FRQJHVWLRQV
FRQWHQWLRQV FROOLVLRQV DQG SDFNHW ORVV UDWH 7KH
QHWZRUN WKURXJKSXW RI WKH SURSRVHG SURWRFRO LV PXFK
WKDQ (66&67$ EHFDXVH RXU SURWRFRO FDQ VFKHGXOH
SURSHUGDWDFKDQQHOWRWUDQVPLWJDWKHUHGGDWDDWSURSHU
WLPH DQG WKXV FDXVHV OHVV FRQJHVWLRQV FRQWHQWLRQV
FROOLVLRQV DQG SDFNHW ORVV UDWH DQG LQFXUV KLJKHU
WKURXJKSXW

)LJXUH1HWZRUNWKURXJKSXW
$YHUDJH'DWD*DWKHULQJ'HOD\
)LJXUHVKRZVWKHDYHUDJHGDWDJDWKHULQJGHOD\RI
WKH SURSRVHG SURWRFRO DQG (66&67$ $V WKH QXPEHU
RI 68 LQFUHDVHV WKH DYHUDJH GDWD JDWKHULQJ GHOD\ DOVR
LQFUHDVHV EHFDXVH PRUH VHQVHG GDWD QHHGHG WR EH
JDWKHUHGDWWKHFOXVWHUKHDGVDQGIRUZDUGHGWRWKHVLQN
$V WKH FKDQQHO RFFXSLHG SUREDELOLW\ LQFUHDVHV WKH
DYHUDJH GHOD\ DOVR LQFUHDVHV EHFDXVH KLJKHU FKDQQHO
RFFXSLHG SUREDELOLW\ LQFXUV KLJKHU PDLQWDLQLQJ DQG
UHVFKHGXOLQJ FRVW RI WKH JDWKHULQJ VWUXFWXUH 7KH
DYHUDJH GDWD JDWKHULQJ GHOD\ RI WKH SURSRVHG SURWRFRO
- 126 -
ICEIC 2015
LV ORZHU WKDQ (66&67$ EHFDXVH RXU SURWRFRO LQFXUV

OHVVFRQJHVWLRQVFRQWHQWLRQVDQGFROOLVLRQV
QHWZRUNWKURXJKSXWDYHUDJHGDWD JDWKHULQJGHOD\DQG
SRZHUFRQVXPSWLRQ
$FNQRZOHGJHPHQW

7KLVUHVHDUFKZDVVXSSRUWHGE\WKH0LQLVWU\RI6FLHQFH
DQG 7HFKQRORJ\ RI WKH 52& XQGHU *UDQWV 16&
(
5HIHUHQFHV

)LJXUH$YHUDJHGDWDJDWKHULQJGHOD\
3RZHU&RQVXPSWLRQ

)LJXUH VKRZV WKH SRZHU FRQVXPSWLRQ RI WKH
SURSRVHG SURWRFRO DQG (66&67$ $V WKH QXPEHU RI
68 LQFUHDVHV WKH SRZHU FRQVXPSWLRQ DOVR LQFUHDVHV
EHFDXVHWKHUHDUHPRUHGDWDQHHGHGWREHJDWKHUHG$V
WKH FKDQQHO RFFXSLHG SUREDELOLW\ LQFUHDVHV WKH SRZHU
FRQVXPSWLRQ DOVR LQFUHDVHV EHFDXVH KLJKHU FKDQQHO
RFFXSLHG SUREDELOLW\ LQFXUV KLJKHU PDLQWDLQLQJ DQG
UHVFKHGXOLQJ FRVW RI WKH JDWKHULQJ VWUXFWXUH ,W DOVR
FDXVHVOHVVDYDLODEOHGDWDFKDQQHOIRUWKH 68DQGWKXV
LQFXUV PRUH FRQJHVWLRQV FRQWHQWLRQV DQG FROOLVLRQV
7KH SRZHU FRQVXPSWLRQ RI WKH SURSRVHG SURWRFRO LV
ORZHUWKDQ(66&67$EHFDXVHRXUSURWRFROLQFXUVOHVV
FRQJHVWLRQVFRQWHQWLRQVDQGFROOLVLRQV

>@2$NDQ2.DUOLDQG2(UJXO&RJQLWLYHUDGLRVHQVRU
QHWZRUNV,(((1HWZRUN9RO,VVXHSS-XO\
$XJXVW
>@ 5DQMDQL 66 .ULVKQDQ 65 DQG 7KDQJDUDM &
(QHUJ\HIILFLHQW &OXVWHU %DVHG 'DWD $JJUHJDWLRQ IRU
:LUHOHVV 6HQVRU 1HWZRUNV ,QWHUQDWLRQDO &RQIHUHQFH RQ
5HFHQW $GYDQFHV LQ &RPSXWLQJ DQG 6RIWZDUH 6\VWHPV
5$&66SS
>@$VODP0-DYDLG15DKLP$1D]LU8%LEL$DQG
.KDQ=$6XUYH\RI([WHQGHG/($&+%DVHG&OXVWHULQJ
5RXWLQJ3URWRFROVIRU:LUHOHVV6HQVRU1HWZRUNV,(((WK
,QWHUQDWLRQDO &RQIHUHQFH RQ +LJK 3HUIRUPDQFH &RPSXWLQJ
DQG&RPPXQLFDWLRQVSS
>@5&KDXKDQ9*XSWD(QHUJ\(IILFLHQW6OHHS6FKHGXOHG
&OXVWHULQJ 6SDQQLQJ 7UHH %DVHG 'DWD $JJUHJDWLRQ LQ
:LUHOHVV 6HQVRU 1HWZRUN &RQIHUHQFH RQ 5HFHQW $GYDQFHV
LQ,QIRUPDWLRQ7HFKQRORJ\SS
>@ 7DR =KHQJ 5DGKDNULVKQDQ 6 DQG 6DUDQJDQ 9 $
URXWLQJ OD\HU VOHHS VFKHPH IRU GDWD JDWKHULQJ LQ ZLUHOHVV
VHQVRU QHWZRUNV ,((( ,QWHUQDWLRQDO &RQIHUHQFH RQ
&RPPXQLFDWLRQV,&&SS
>@/LQGVH\6DQG5DJKDYHQGUD&6 3(*$6,63RZHU
(IILFLHQW *DWKHULQJ LQ 6HQVRU ,QIRUPDWLRQ 6\VWHPV ,(((
$HURVSDFH&RQIHUHQFH3URFHHGLQJVSS

)LJXUH3RZHUFRQVXPSWLRQ
>@ -DH 'XFN <X .\XQJ 7DH .LP %R <OH -XQJ DQG +HH
<RQJ <RXQ $Q (QHUJ\ (IILFLHQW &KDLQ%DVHG &OXVWHULQJ
5RXWLQJ 3URWRFRO IRU :LUHOHVV 6HQVRU 1HWZRUNV
,QWHUQDWLRQDO &RQIHUHQFH RQ $GYDQFHG ,QIRUPDWLRQ
1HWZRUNLQJ DQG $SSOLFDWLRQV :RUNVKRSV SS
0D\
>@ 6X\DQJ -X DQG -RVHSK % (YDQV 6SHFWUXP$ZDUH
5RXWLQJ 3URWRFRO IRU &RJQLWLYH $G+RF 1HWZRUNV ,(((
*OREDO7HOHFRPPXQLFDWLRQV&RQIHUHQFHSS
&RQFOXVLRQV

,Q WKLV SDSHU ZH KDYH SURSRVHG D GDWD JDWKHULQJ
SURWRFRO IRU &561V 7KH DOJRULWKPV IRU WKH
FRQVWUXFWLRQDQGPDLQWHQDQFHRIWKHJDWKHULQJVWUXFWXUH
DUHSURSRVHG$VWKHJDWKHULQJVWUXFWXUHLVFRQVWUXFWHG
WKH JDWKHUHG GDWD LV IRUZDUGHG WR WKH VLQN DORQJ WKH
JDWKHULQJ VWUXFWXUH DFFRUGLQJ WR WKH FKDQQHO DQG WLPH
VFKHGXOLQJRIWKHFOXVWHUKHDGV6LPXODWLRQUHVXOWVKDYH
VKRZQWKDWWKHSURSRVHGSURWRFROSHUIRUPVEHWWHUWKDQ
WKH H[LVWLQJ SURWRFRO LQ WHUPV RI SDFNHW ORVV UDWH
>@:-LDQJ+&XLDQG-&KHQ6SHFWUXPDZDUH&OXVWHU
EDVHG URXWLQJ SURWRFRO IRU PXOWLSOHKRS FRJQLWLYH ZLUHOHVV
QHWZRUN
,(((
,QWHUQDWLRQDO
&RQIHUHQFH
RQ
&RPPXQLFDWLRQV7HFKQRORJ\DQG$SSOLFDWLRQVSS

>@% *XOEDKDU DQG 2 % $NDQ ,QIRUPDWLRQ 7KHRUHWLFDO
2SWLPL]DWLRQ*DLQVLQ (QHUJ\ $GDSWLYH 'DWD *DWKHULQJ DQG
5HOD\LQJ LQ &RJQLWLYH 5DGLR 6HQVRU 1HWZRUNV ,(((
7UDQVDFWLRQV RQ :LUHOHVV &RPPXQLFDWLRQV 9RO 1R
SS0D\
- 127 -
TO-3-4-4
Testbed and Discussion for PEP in Satellite Communications

Nathnael Gebregziabher W., Kyu-Hwan Lee, Young-June Choi, and Jae-Hyun Kim
Department of Electrical and Computer Engineering, Ajou University, Korea
{nathnael2013, lovejiyoon7, choiyj, jkim}@ajou.ac.kr
Abstract
In satellite communications, most Internet
applications run over the TCP/IP protocol to deliver
data to destinations over large propagation delay and
wireless channel. Due to long round-trip time (RTT)
and high packet error rate (PER) over satellite links
creates an environment that seriously degrades the
performance of TCP. A well-known solution to mitigate
these issues is performance enhancing proxy (PEP)
based TCP splitting. We implement PEP testbed to
evaluate and discuss the issues of satellite links.
According the result even though PEP improves fair
throughput in presence of wired links and random
packet losses, it worsens its performance in higher
PER.
Keywords: PEP, PER, Satellite, TCP- splitting, E2E
1. Introduction
Satellite communications represent a viable
solution for Internet access for wide areas. Currently,
most internet applications are running over the TCP/IP
protocol stack. TCP operates to achieve a reliable endto-end (E2E) connection for data delivery. However a
link based on a geostationary earth orbit (GEO)
satellite induces long propagation delay due to the
satellite altitude (about 36,000 km). Furthermore,
compared to terrestrial links, satellite links show high
packet error rate (PER) due to random packet loss on
the wireless channel. In particular, transport protocols
performance over satellite networks is impaired by the
characteristics of the satellite radio link, specifically by
the long propagation delay and the possible presence
of segment losses due to physical channel errors [1 - 4].
A well-known solution to those problems is in
splitting the E2E TCP connection on the satellite link
at the ground station [1, 5]. Performance enhancing
proxy (PEP) based on connection-splitting in satellite
network allows to optimize the performance of TCP by
splitting the native TCP connection into satellite and
Fig. 1. Distributed PEP architecture.

terrestrial segments. This uses to address the effect of
satellite delay and packet loss problems over satellite
links.
In this work, we implement a PEP testbed for a
satellite link to test and evaluate the PEP performance
comparing with E2E TCP variants. In addition, we
point out our further work to improve throughput in
satellite communications.
2. Performance Enhancing Proxies (PEP)

PEP based TCP-splitting is a common method
used to increase performance over satellite links [1].
A TCP flow is generally terminated at the gateway to
the satellite link, and a new TCP session is setup on the
other side of the satellite link to complete the
connection. Distributed PEP splits the E2E connection
in three (two terrestrial and one satellite) segments, by
isolating the satellite link between two PEP agents.
The architecture that considered here is shown in Fig.1.
The terrestrial segments have short RTT and error free,
and can apply standard TCP versions and satellite
segment is long RTT and error-prone. Therefore, this
link can be optimized independent of the terrestrial
connection.
3. Testbed Architecture and Evaluation

The PEP test-bed architecture which is
implemented for our experiment is shown in Fig. 2. It
contains five boxes to test PEP and E2E TCP variants
- 128 -
ICEIC 2015
Table 1: PEP and E2E TCP throughput

(RTT = 500ms).
TCP Throughput (Mbps)
TCP
Version PER = 0% = 0.1% = 1%
=10%
Reno
13.969
0.3370 0.0989 0.0045
Cubic
22.197
0.9720 0.2520 0.0132
CTCP
0.6930
0.4920 0.1580 0.0378
PEP
22.300
5.3100 1.5000 0.0559
DummyNet
Server
PEPsal #1
PEPsal #2
Gateway
Sat. Terminal
Client
Fig. 2. PEP testbed architecture.

in satellite communications. PEPSal is open source
software for linux OS under the GNU GPL License [7].
We use it as PEP to split the connection at both
gateway and satellite terminal boxes. It acts as the TCP
receiver with the source, by acknowledging the
incoming packets, while at the same time it sets up a
new TCP connection towards the other side. It uses
Netfilter to intercept incoming segments and copies
them into a queue and the queuer annotates the
information (IP addresses and TCP ports) on the two
endpoints (here client and server). The satellite
segment is emulated using DummyNet[8] in FreeBSD
that simulates delay, packet loss and bandwidth.
In our experiment, we test Reno and Cubic [2] as
E2E TCP variants on Linux OS. In addition, we
evaluate compound TCP (CTCP) [6] as E2E protocol
on Windows OS. As TCP splitting is transparent to the
end users, we can use the TCP variants (default) on
client and server. To get improved performance, we set
Hybla[3] on PEPSal nodes. With this settings, we can
have the benefits of TCP/splitting in both directions,
from the server to the receiver (forward) and from the
client to the server (reverse). To measure throughput in
our experiment, we install iperf in both end boxes.
Standard TCP does not distinguish the origin of
packet losses. Link errors cause spurious interference
on the congestion control mechanism. This behavior is
apparent by examining the performance of TCP
variants as shown in Table 1. By contrast, the benefit
provided by PEP is entirely to be ascribed to the
adoption of TCP Hybla in the satellite segment, which
is much more efficient of TCP standard in reopening
the congestion window after the spurious reductions
caused by random losses. However, the higher PER
induces a general performance worsening for all the
protocols including the PEP.
to make the satellite link robust and exploit the channel

resources in high packet loss rate.
5. Conclusions and Future Works

We implemented PEP testbed using PEPsal as TCP
splitter and DummyNet as satellite emulator. In our
experiment, we test and evaluate PEP at satellites
RTT and random lost packets. It performs well by
removing the impairments that degrade the fair
throughput. However, in erratic channel, it decreases
its transmission rate that causes to degrade overall
performance due to under-utilized resources on
prolonged periods of time. In our future work, we are
looking to incorporate network coding into TCPsplitting satellite network.
Acknowledgments
This research was supported by NSL (National Space Lab)
program through the National Research Foundation of Korea funded
by the Ministry of Education, Science and Technology (20120009092) and the National Research Foundation of Korea (NRF)
grant funded by the Korea government (MSIP) (No. NRF2014R1A2A2A01002321).
References
[1]
[2]
[3]
[4]
[5]
4. Discussion
PEP, by splitting the E2E satellite connection,
removes impairments due to the simultaneous presence
of both congestion on a link shared with wired
connections and random losses on the satellite channel
that causes to penalize the throughput. However, TCP
splitting is not enough to achieve desirable throughput
in erasure satellite channel. Here, therefore, it requires
[6]
[7]
[8]
- 129 -
A. Pirovano and F. Garcia, A New survey on improving TCP

performances over Geostationary Satellite Link, Network and
CommunicationTechnologies, vol. 2, no. 1, Jan. 2013.
Ha, I. Rhee, and L. Xu, CUBIC: A New TCP-Friendly HighSpeed TCP Variant, SIGOPS Oper. Syst. Rev., vol. 42, no. 5,
pp.6474.Jul. 2008.
C. Caini and R. Firrincieli, TCP Hybla: A TCP Enhancement
for Heterogeneous Networks, International Journal of Satellite
Communications and Networking, vol. 22, no. 5, 2004.
M. Allman, Enhancing TCP over Satellite Channels using
Standard Mechanisms, RFC 2488, Jan. 1999.
C. Caini.; Firrincieli, R.; Lacamera, D., PEPsal: a Performance
Enhancing
Proxy
designed
for
TCP
satellite
connections Vehicular Technology Conference, 2006. VTC
2006-Spring. IEEE 63rd , vol.6, pp.2607,2611, 7-10 May 2006
Tan. Kun; Jingmin Song; Qian Zhang; Sridharan, M., "A
Compound TCP Approach for High-Speed and Long Distance
Networks," INFOCOM 2006. 25th IEEE International
Conference on Computer Communications. Proceedings, pp.1,
12, April 2006.
PEPsal source code, available at:
http://www.sourceforge.net/projects/pepsal/
DummyNet, available at:
http://info.iet.unipi.it/~luigi/dummynet/
TO-3-4-5
Flexible Metamaterial Absorber using Inkjet-Printing Technology

Hyung Ki Kim, Kenyu Ling, Kyeongseob Kim, and Sungjoon Lim
School of Electrical and Electronics Engineering, College of Engineering,
Chung-Ang University, Seoul, Republic of Korea
muechu@naver.com, sungjoon@cau.ac.kr
transmission EM wave. Fig. 1 (a) shows the fabricated
sample MA prototype.
Abstract
In this paper, a flexible inkjet-printed metamaterial
absorber (MA) is proposed. The unit cell of MA is inkjetprinted with a silver nanoparticle ink on a flexible polymer
film. It shows over 99% at 9.21 GHz for both flat and
cylindrical surfaces.
Keywords: flexible metamaterial, absorber, inkjet-printing
(a)
(b)
Figure 1. (a) Fabricated sample absorber and (b)
coated on cylindrical object.
1. Introduction
Electromagnetic (EM) absorbers can minimize the
transmitted and reflected EM waves. Recently,
metamaterials were introduced to design a thin and lowcost EM absorber by N. Landy et al [1]. Metamaterialbased absorbers (MAs) show almost perfect absorptivity in
spite of its low profile. Most MAs have been realized on
hard substrates such as FR4 materials. These materials are
inflexible, so they are limited to a planar surface. Therefore,
a flexible MAs were previously proposed on a polyimide
substrate by using a traditional mask contact lithography
and e-beam evaporation. In this work, we propose the
flexible MA on a polymer film and conductive patterns are
inkjet-printed by silver nanoparticle inks. Compared with
the lithography fabrication process, inkjet-printing process
is very fast, easy, and cheap because a home printer can be
used. In addition, there are no chemical waste so post
processing is not necessarily and additional cost does not
occur.
2. Design and Experimental Results
In order to verify its flexibility and absorption

performances, the sample absorber is coated on the
cylindrical object as shown in Fig. 1 (b). The simulation
and measurement results are plotted in Fig. 2. It shows that
over 99% absorption rate is achieved at 9.21GHz for both
flat and cylindrical surfaces.
Figure 2. Numerical simulation and measured results

for vertical polarized wave.
Acknowledgement
The unit cell of the proposed MA is designed with the

modified Jerusalem-Cross ring resonator and inkjet-printed
with a silver nanoparticle ink on a flexible polymer film.
All fabrication process is performed by using a commercial
home printer, EPSON WF-7011. The bottom layer of the
unit cell is fully covered with a copper sheet to prevent
This work was supported by Samsung Research Funding

Center of Samsung Electronics under Project Number
SRFC-IT1301-03.
References
[1] N. Landy, S. Sajuyigbe, J. Mock, D. Smith, and W. Padilla,
Perfect Metammaterial Absorber, Phys. Rev. Lett, Vol. 100, No.
20, May 2008
- 130 -
ICEIC 2015

Oral Session
TO-3-5
Low-Power and High-Performance
Circuits and Systems
TO-3-5-1
Low Power, Energy Efficient Radix-22 Feedforward Fast Fourier Transform

Ngoc Le Ba and Tony T. Kim
VIRTUS, School of EEE, Nanyang Technological University, Singapore
thkim@ntu.edu.sg
Abstract
Keywords: FFT; radix 22; ultra-low power;
Introduction
FFT has been widely used to analyze signal
spectrum in signal processing, image processing. Many
algorithms for calculating FFT have been reported in
which radix-22 sigle delay feedback [1-3] is the most
popular technique to achieve minimum hardware
consumpition in term of memory and multiplier. This
technique is also suitable for ultra low power, low
voltage implementation as a result of its minimum
hardware requirements. However, low throughput is
the most drawback of this topology. In this work, we
propose using Radi-22 feedforward topology to obtain
higher throughput, low hardware cost and better energy
efficiency.
Proposed FFT Architecture

A. Feedforward Architecture
16
R2
R2
X
R2
X
16
BFI
R/W
Ctrl
SRAM
128
R/W
Ctrl
Commutator 3
SRAM
256
Commutator 2
Figure 1. Schematic of traditional MDC architecture.

Commutator 1
Conventional Fast Fourier Transform (FFT) using

Radix-22 brought a significant improvement in FFT
implementation to reduce circuit complexity and
computational power. The most famous architecture in
Radix-22 is Single-path Delay Feedback (SDF) which
requires the smallest amount of memory however low
throughput due to single data line is its major
drawback. In paper, Radix-22 Multiple-path Delay
Commutator (MDC) was proposed to achieve much
higher throughput and reduce energy per conversion.
In addition, a new input scheduling algorithm,
parallel-pipelined architecture together with ultra-low
power SRAM technique are employed to increase the
speed and minimize the total power consumption. A
512-point high speed, ultra-low power Fast Fourier
Transform (FFT) was fabricated using STM 65nm
technology. The chip consumes 2.8nJ/FFT with clock
frequency of 33MHz at 0.4V supply and it is able to
operate up to 500MHz at Vdd=1V with 36.8 mW power
dissipated.
BFII
SRAM
128
SRAM
64
R/W
Ctrl
...
SRAM
64
kn
WN
Figure 2. Schematic of the proposed feedforward architecture.
Traditional Multiple Delay Commutator (MDC) [4]

architecture shown in Fig. 1 suffers from large
dynamic energy to shift data along the delay lines
using shift registers. Every clock cycle, all the data
stored in registers will be shifted hence dissipate a
large amount of power.
To reduce power, SRAMs based commutator is
proposed. Fig 2 explains our proposed architecture
using SRAM with special read/write algorithm to
arrange the input for butterflies. Incoming data will be
written and read out from the SRAM with correct
distance for FFTs algorithm. SRAM based design
offers reduction in power consumption as data are not
shifted every clock cycle as well as smaller layout area
in compared with register based design.
B. Input Scheduling Algorithm
SRAMs require special reading and writing algorithm
to arrange the data with correct distance. The proposed
algorithm is explained in Fig. 3 using input from In1
and In2. In Phase I, data are read in the first half of the
clock from the two SRAMs, in the second half of the
clock data from input stream 1 is written into the first
SRAM when input stream 2 goes into the second
SRAM. This procedure continues until both SRAMs
are full. Then for the next m clocks in Phase II, output
1 is taken from the first SRAM and output 2 is
obtained directly from input stream 1. Content in the
second SRAM remains unchanged while the first
SRAM is updated with data from input stream 2. After
these m clocks both SRAMs are filled and operation
repeat itself. It is shown that outputs shall be available
- 132 -
ICEIC 2015
PROCESSING CORE
ROM ARRAYS
MEMORY
INPUT
CE I
1
CE II
1
CE I
2
CE II
2
CE I
3
CE II
3
CE I
4
CE II
4
CE I
5
COMM
1
COMM
2
COMM
3
COMM
4
COMM
5
COMM
6
COMM
7
COMM
8
COMM
9
SRAM
256
SRAM
128
SRAM
64
SRAM
32
SRAM
16
SRAM
8
SRAM
4
SRAM
2
SRAM
1
OUTPUT
Figure 4. The proposed Input Scheduling Algorithm
Figure 5. Layout of the proposed FFTs core
Figure 3. Proposed Input Scheduling Algorithm
after m clocks and there are 3N/2-1 memory are

needed in this configuration. In comparison with
conventional design, the proposed algorithm helps to
eliminate delay circuit and reduce switching power as
only the data which will be read and written will
change its value during one clock cycle by Read/Write
circuit using a simple counter to generate data
addresses. The completed architecture is shown in Fig.
4 using proposed commutator which is implemented
by SRAMs with input scheduling algorithm in section
A and B.
Test Chip Implementation

A 512-point Radix-22MDC is designed and fabricated
using ST Micro 65nm process. The processor occupies
an area of 1.2x0.8 mm as shown in Fig. 5
Conclusions
A 512-point Radix-22 MDC Fast Fourier
Transform Processor and DSP design for hand gesture
recognition were presented. Radix-22 MDC structure
proposed in this report is the first SOC Radix-22 feed
forward architecture which was implemented at wafer
level. Using proposed input scheduling algorithm with

new architecture, the core can work at high frequency
while consumes least energy per conversion. For ultralow power application the processor consumes only
2.3nJ/FFT at 400 mV supply and working frequency of
33 MHz. For high performance requirements, the
processor is able to run at frequency of 500 MHz with
1V supply and consumes 36.8 W. The design was
simulated successfully and be able to outperform the
current state-of-art.
References
[1] N. Li and N. P. V. D. Meijs, "A Radix 2 2 Based Parallel
Pipeline FFT Processor for MB-OFDM UWB system,"
presented at the IEEE International SOC Conference,
2009.
[2] G. Bi and G. Li, "Pipelined Structure Based on Radix-22
FFT Algorithm," presented at the IEEE Conference on
Industrial Electronics and Applications, 2011.
[3] G. Bi and E. V. Jones, "A pipelined FFT processor for
word-sequential data," in IEEE Trans. Acoust, Speech,
Signal Processing, 1989, pp. 1982-1985.
[4] D. Jeon, M. Seok, Chaitali Chakrabarti, D. Blaauw, and
D. Sylvester, "A Super-Pipelined Energy Efficient
Subthreshold 240 MS/s FFT Core in 65 nm CMOS,"
IEEE Journal of Solid-State Circuits, vol. 47, January
2012.
- 133 -
TO-3-5-2
An Ultra-low Power Start-up Circuit with Automatic Deactivation for

Thermoelectric Energy Harvesting Systems
Abhik Das, Neel Narasimman and Tony T. Kim

thkim@ntu.edu.sg
Abstract
This letter presents a start-up circuit based upon
output voltage feedback for thermoelectric (TE) energy
harvesting systems. The proposed start-up circuit
shows the remarkably improved start-up time of 35 s
at the input voltage of 300 mV. The start-up circuit is
automatically disabled after the main boost converter
and the controller are started. The proposed start-up
circuit consumes 3.2 nW during the steady state, which
achieves the boost converter efficiency of 77% at the
input voltage of 300 mV.
Keywords: Energy harvesting, start-up
1. Introduction
Various state-of-the-art approaches have been
reported to harvest the energy using thermoelectric
generators (TEGs) [1-6]. Low start-up voltages have
been achieved by utilizing MEMS switches, transistor
threshold voltage trimming, off-chip transformers and
auxiliary LC oscillators to kick-start the boost
converter operation. However, the mechanical motionactivated switch [3] requires external vibrational force
that may not be ubiquitously available in the ambient
condition. Other fully electrical start-up techniques
have also been reported [4-6].
In [4], transistor threshold voltage trimming through
post-processing has been employed, which increases
the testing cost. In [6], the start-up operation uses a
large off-chip transformer, leading to a large system
size. In addition, the start-up block in these designs are
not disabled when the conversion circuit is in the
steady state, thus leading to unnecessary power leakage.
In this paper, a start-up circuit with automatic
disabling function is presented for low input voltage
and high conversion efficiency. The feedback from the
output generates a reset signal to turn on and off the
switch to kick-start the auxiliary boost converter. The
proposed harvester achieves the minimum start-up
voltage of 300 mV, and can generate the output voltage

of 1 V with the start-up time of 35 s.
2. Proposed energy harvester

The block diagram of the proposed energy harvester
system is illustrated in Fig. 1. The proposed harvester
consists of three main units, namely, a Starter, a Main
Control Unit, and a Boost Converter Core. The Starter
comprises a CMOS inverter-based switch (INV-SW), a
charge-pump-based doubler (DOUBLER), and a ring
oscillator. The Boost converter core consists of the
power transistors NM0, NM1, and PM, along with an
off-chip inductor and an on-chip capacitor. During the
start-up phase, NM0 is active instead of NM1 and
forms the auxiliary boost converter with L, COUT and
PM. During the steady-state, NM0 is disabled while
NM1 in the Boost Converter Core is controlled by the
Main Control Unit.
The switch INV-SW acts as an one-time reset for
the power switch NM0, turning it on and off, thus
enabling the inductor L to discharge the stored energy
and charge COUT during the second clock half-cycle.
The VDD is directly fed back to the gates of the
transistors in INV-SW. The power supply for INV-SW
is supplied by the charge-pump-based DOUBLER
output, which doubles the input voltage. This is
necessary to increase the voltage swing at INV so that
it can turn on NM0 even if the available input voltage
is in the sub-threshold region. The clock signals for the
DOUBLER are provided by the 7-staged ring oscillator,
whose power is only from the input source (VIN)
without any external supply sources. The sizing of the
transistors in INV-SW is adjusted in a manner that the
switching point of INV is much lower than the half of
the voltage at CP. This ensures that NM0 is turned on
at a much lower VDD level, and does not require VDD
to cross the device threshold voltage. Since higher
input voltage is not necessary, the start-up operation
occurs earlier, resulting in a smaller start-up time.
- 134 -
ICEIC 2015
r
1.2 @VTEG=300mV
Boost Converter Core
ing
VDD
INVSW
NM0 NM1
0
COMP
`
DOUBLER
CLK1
CLK1
CP
VDD
CLK2
Ring Osc
VDIV
Voltage
Divider
VREF
7-staged Ring Osc.
CLK2
VDD
Reset
IN
1V
INV
>500mV
0
T=0
VIN
75
150
Gen). VREF is 0.7 V when VDD is 1 V and above.

The comparator output is directly fed to the gate of
NM1. When VDD falls below 1 V, VDIV falls below
VREF (0.7 V) and the comparator output follows
CLK2. This makes the main boost converter operate in
the steady-state to raise VDD up to 1 V and above. If
VDD is above 1 V, the comparator output turns off
NM1 until VDD falls below 1 V.
The proposed harvester circuit is designed in
standard 65-nm CMOS technology. The active area
including the on-chip capacitor is 0.072 mm2. The
value of the on-chip capacitor implemented is 650 pF,
and the inductance of the off-chip inductor is 1 mH. Fig.
3 shows the simulated waveforms of the start-up
operation at the input voltages of 300 mV. The
harvester output is 1 V at the input voltage of 300 mV.
The start-up time is 35 s. The start-up time becomes
30 s at the input voltage 550 mV.
Ref-Gen
MAIN CONTROL UNIT
Steady-state
(a)
Time (s)
Fig. 3 Transient start-up waveforms at VTEG = 300 mV.
Fig. 1 Block diagram of the proposed thermoelectric energy

harvesting circuit
Start-up
VDD
Start-up time = 35s
0.6
PM
COUT
INV
DRAIN
LOAD
VIN
STARTER
Charg
VDD (V)
VIN
VTEG
280mV
0
Fig. 2 Timing diagram showing Operation Sequences
Unlike the start-up operation in [3] which relies on

an external ambient vibration source to turn on a
MEMS switch, the proposed starter generates the onetime pulse necessary to turn the NMOS switch on and
off without any external sources. Initially, when COUT
is in discharged state, INV turns on NM0 and charges
L. During this on-time of NM0, some charges also leak
through PM and raises VDD gradually. When VDD
rises beyond the switching point of INV-SW, INV
turns NM0 off, thereby boosting the node VDD from
the stored energy present in the inductor. The feedback
from the raised VDD trips INV and turns NM0 off.
This feedback also ensures that NM0 will remain
inactive until VDD is held at the steady state. The
automatic reset and starter disabling enhances the
efficiency during the steady-state. Fig. 2 shows the
timing diagram explaining the start-up operation.
After the circuit is kick-started and the starter block
is disabled, the main control unit is activated by VDD
without using any other external power source, and
NM0 is replaced by NM1 to activate the main boost
converter. The level of VDD is regulated to be held at
1 V or beyond by the clocked comparator (clocked by
CLK2) with two inputs, VDIV and VREF. VDIV is the
output of the voltage divider. It is 0.7 V at VDD of 1 V.
VREF is the output of the reference generator (Ref-
3. Conclusions
A low input voltage start-up technique for
thermoelectric energy harvesting circuits is proposed.
The proposed start-up utilizes the output voltage as
feedback to generate a reset signal from the input
voltage of 300 mV. The start-up circuit is deactivated
during the steady state for better conversion efficiency.
The measured peak efficiency is 77% and the quiescent
power of the start-up circuit is 3.2 nW at 300 mV.
References
[1] Glynne-Jones, et al., Sensor Review, 2001, 21, pp. 91-97
[2] Vullers, et. al. IEEE Solid-State Circuits Magazine, 2010,
pp. 29-38
[3] Ramadass, et al., IEEE ISSCC Dig. Tech. Papers, Feb
2010, pp. 486-487
[4] Chen, P. et al., IEEE ISSCC Dig. Tech. Papers, Feb
2011, pp. 216-217
[5] Tang, Hao-Yen et. al., Symp. on VLSI Circuits, June
2012, pp. 196- 197
[6] Im, J.-P. et al., IEEE ISSCC Dig. Tech. Papers, Feb.
2012, pp. 104-106
- 135 -
TO-3-5-3
Ultra-low Power 12T Dual Port SRAM for Hardware Accelerators

Bo Wang, Ngoc Le Ba, and Tony T. Kim
thkim@ntu.edu.sg
Abstract
WLA
VDD
This paper presents a low voltage 12T dual-port

SRAM for biomedical hardware accelerators. The
proposed dual-port SRAM cell -decreases the
disturbance of the common-row-access mode for
improving the worst case stability issue and realizing
ultra-low voltage operation. A 16 Kb 12T dual-port
SRAM was fabricated in a 65nm CMOS process
technology and showed successful dual-port SRAM
operation down to 0.4 V in the common-row-access
mode.
BLA
/BLA
QB
BLB
/BLB
WLB
over-sized transistors
Figure 1. Schematic of conventional 8T dual-port SRAM cell.

WWLA
VDD
/WBLA
WBLA
Keywords: Ultra-low power, dual-port SRAM

RWLB
RWLA
Q
1. Introduction
QB
M3
Contemporary computing platforms with big data

enable unprecedented interaction between human and
computational resources. The ubiquitous computing
necessitates high computing power with multi-core
processing units and multi-port SRAMs. Dual-port
SRAMs are also highly demanded and embedded even
by energy-constraint ICs, whose low power dissipation
mainly attributes to ultra-low voltage operation [1]-[5].
Hardware accelerators have been widely employed in
various emerging ultra-low voltage computing circuits
such as wireless sensor nodes, biomedical SoCs, etc.
Multi-port memories operating at near-/sub-threshold
regime are highly required in various hardware
accelerators for achieving higher energy efficiency.
Proposed 12T Dual-port SRAM

A. 12T Dual-port SRAM cell
Dual-port SRAMs boost computation performance
and throughput by doubling the number of
simultaneous memory access. Fig. 1 depicts the
conventional 8T DP SRAM cell. Port A and B are
accessed by exclusive address and operation instruction.
Each port consists of their corresponding wordline
(WL) and a pair of bitlines (BL and /BL). In the
common-row-access mode, the selected cell is
RBLB
M1
M4
QB
WBLB
M2
RBLA
/WBLB
VGNDB
VGNDA
WWLB
Figure 2. Schematic of the proposed 12T dual-port SRAM cell.
inevitably disturbed through the second activated WL.

Thus, the width of the 2 NMOS drive transistors has to
be further expanded (e.g. 2.7) to maintain cell
stability, which is much larger than that in the 6T SP
SRAM cell.
Fig. 2 portrays the proposed 12T DP SRAM cell.
The proposed cell decouples read paths from write path
in each port. RWLA and RWLB control the access to
read paths while WWLA and WWLB activate data
writing. The conditional discharging of the read bitlines
(RBLA and RBLB) is manipulated by VGND
employed to suppress leakage. During read, the voltage
level of RBLB represents the opposite value of node Q,
hence it is connected to a global bitline via a PMOS
transistor for inversion. By separating the read paths
from the write paths, the amount of read-write
disturbance is significantly relaxed and various design
metrics such as stability and read/write margins are
improved. The proposed cell eliminates the necessity of
over-sizing of the pull down devices while still
maintaining performance. Therefore, similar layout
area (e.g. 1) can be achieved in the SRAM cell design.
- 136 -
ICEIC 2015
Port A Read
ON
ON
Idist.
1 to 0
1
1
Iread
398 m
Figure 5. Microphotograph of the proposed DP SRAM.
Port A Write
1
Iwrite
Array
Ctrl.
SA. & Drivers A
A
Figure 3. Worst case read disturbance in the proposed DP SRAM

cell. Note that the cell is accessed for read through port A while port
B is under the half-selected condition.
ON
TABLE I. SUMMARY OF TEST CHIP
ON
Technology
65nm CMOS
Chip Size
439.9 x 437.2 m2
Cell Size
1
ON
Ctrl.
B
Decoder B
ON
SA. & Drivers B
OFF
OFF
OFF
Decoder A
385 m
ON
Idist.1
Figure 4. Worst case write disturbance in the proposed DP SRAM

cell. Note that the cell is accessed for write through port A while port
B is under the half-selected condition.
B. Read Disturb Suppression

When the 8T DP cell [5] is replaced by the proposed
12T cell, the read-disturb is ameliorated in two ways.
First, since the read and the write are separated, the
proposed DP SRAM cell undergoes the same amount
of the disturbance in the conventional 6T SRAM cell
(Fig. 3). This improves the read SNM (SNM1) of the
proposed DP SRAM cell compared to the conventional
8T DP SRAM cell. Second, when two simultaneous
read operations are executed in the same row, they are
interference-free due to the decoupled read ports. The
read SNM (SNM2) in this condition is equal to the hold
SNM.
C. Write Disturb Suppression
The worst case write disturbance in the proposed DP
cell is depicted in Fig. 4. The worst write disturbance
occurs when a cell is accessed for write operation
through a port and the other port is in the half-selected
condition. In the conventional 8T DP cell, a
simultaneous operation from the other port brings in
additional disturbance which prevents the node 1
from quickly being discharged and could result in write
failure [4]. In the proposed DP cell, the probability of
the worst case write disturbance is diminished since the
worst case disturbance is generated only when two
write operations are executed in one selected row. If a
write operation is executed through port A and a read
operation is executed through port B, RWLB is
enabled instead of WWLB, where no disturb current
flows from port B.
3.82 x 0.72 m2
(logic design rule)
VDD min.
0.4 V @ 256 rows
Read Access Time
580 ns @ 0.4 V
Leakage Current
63 A @ 1.2V
Experimental Result
The microphotograph of the proposed DP SRAM is
illustrated in Fig. 5. The proposed DP SRAM was
fabricated in 65nm CMOS technology. Note that each
port has dedicated peripheral circuits such as control
logic, decoders, read-out circuits, I/Os, etc. The 16Kb
array is configured by 256 rows 64 columns. The test
chip occupies the area of 398 m 385 m. Table 1
summarizes the performance of the proposed dual-port
SRAM.
Conclusions
Dual-port SRAMs are substantial in various
applications. This paper explains an ultra-low power
near-threshold dual-port SRAM. Decoupled SRAM
structures were proposed for improving read and write
disturbance..
References
[1] M. Yabuuchi, et al., ISSCC, 2014, pp. 234-236.
[2] K. Nii, et al., JSSC, vol. 44, no. 3, pp. 977986, Mar.
2009.
[3] Y. Ishii, et al., VLSI Circuit Symp., 2010, pp. 99-100.
[4] L. Chang, et al., VLSI Circuits Symp., 2007, pp. 250253.
[5] Y. Ishii, et al., A-SSCC, 2010, pp. 1-4.
- 137 -
TO-3-5-4
An Ultra-low Voltage VCO-based ADC with Digital Background Calibration

Neelakantan Narasimman and Tony T. Kim
thkim@ntu.edu.sg
Keywords: VCO-based ADC; ultra-low voltage; ultralow power
1. Introduction
Ultra-low
voltage
operation
is
widely
recommended in circuits, which run on strict power
budgets. While digital circuits can work at low
voltages, analog circuits have lot of challenges because
of non-idealities and second order effects associated
with it. Analog to Digital Converter (ADC) is an
inevitable part of sensor interface systems and high
performance communication circuits used in various
biomedical and portable computing applications.
ADCs, which normally have significant analog
circuitry, form a bottleneck to implement such ultralow voltage systems.
VCO-based ADC is a
promising solution to address this problem since
continuous scaling in CMOS technology aids their
highly digital nature and time-based architectures [1-3].
Proposed Digital Background Calibration

A. Introduction to Calibration Scheme
A sinusoid input when given to a non-linear FDSM
produces a nonlinear output.
The two main
nonlinearities at the output are second order and third
order nonlinearities. While second order nonlinearity
can be easily corrected using pseudo-differential
architecture, third order nonlinearity is difficult to
+x(t)
LOOKUP
TABLE
CLK
Dout(n)
VCO-FDSM
Data
-x(t)
VCO-FDSM
Address
Abstract
An ultra low voltage VCO-based ADC for ultra low
power applications is introduced. We propose novel
circuits and calibration scheme to address the
challenges for achieving ultra-low power targets, such
as small voltage margin, noise, oversampling ratio and
nonlinearity. An open loop VCO-based ADC and
calibration algorithm were implemented and simulated
using commercial 65nm CMOS technology. The
simulation results confirm the effectiveness of the
calibration scheme at 0.4V. The ADC could give
approximately 10 bit resolution for a bandwidth of 10
KHz with power consumption as low as 5uW.
Background Nonlinearity Calibration
Figure 1. Abstract view of proposed calibration algorithm
separate or correct. Hence, the main objective of our

calibration is to estimate and correct the third order
nonlinearity. Since the characteristics as well as
nonlinearity of the VCO can change over time due to
temperature and other variations, a background
calibration scheme is proposed. The abstract view of
calibration architecture is as shown in Fig. 1. Our
calibration algorithm employs a replica VCO path
similar to [1, 3]. Thus, the calibration algorithm is
executed periodically in the replica path and the
nonlinearity of the replica VCO is estimated. The
signal VCO and replica VCO are designed to be
identical and hence nonlinearity in the signal path
could be corrected using the estimation. Correction is
done by updating a lookup table in the signal path.
B. Calibration Algorithm
Consider a setup as shown in the Fig. 2 below, in
which two different sinusoids are input to two identical
non-linear systems. Then the outputs of FDSMs are
added together. As we can see, the summation result
contains inter-modulation sinusoids, and
resulting from the term
, the amplitude of which contains the measure
of third order nonlinearity, k2. If the inter-modulation
product is separated and amplitude is measured, we can
estimate the value of k2. In order to estimate the value
of k2 the experimental setup shown in Fig. 3 is used.
+x(t)/-x(t) are two differential sinusoids, of frequency
f1 and amplitude A1. These inputs are generated onchip from differential square waves of the same
frequency using second order low pass filter of cut-off
frequency f1. Fd(t) is a square wave, of frequency fd
- 138 -
ICEIC 2015
Test Chip Simulation Results

F(x) = Fc + kx + k1x2 + k2x3
FDSM1
Cos A -Cos B
+
+
6k2CosA.Cos2B
The Schematic for proposed calibration algorithm was

designed using Commercial 65nm library. The target
design specifications are 10KHz bandwidth, for
general sensor interfaces and effective resolution of
around 10bits. The FFT plot of the simulated output is
in fig. 4. The detailed specifications of ADC are in
Table I.
F(x) = Fc + kx + k1x2 + k2x3

FDSM2
Figure 2. Background Calibration Basic Principle.

+x(t)
FDSM1
+
Fd(t)
-x(t)
+
100
+
+
FDSM2
d(n)
d(n) calib(n)
16
With Calibration
80
Fd(n)
Magnitude (dB)
Figure 3. Calibration algorithm architecture
and amplitude A2. As we know, square wave is

composed of primary frequency and its odd harmonics.
Frequency Fs/4 is chosen for the square wave, so that
third order harmonic 3/4*Fs and other higher order
harmonics lie outside the Nyquist frequency, where Fs
is the sampling frequency. Since VCO-based ADCs
have inherent anti-aliasing features, inputs frequencies
higher than Nyquist frequency do not cause any
aliasing problems [3]. Thus, Fs/4 Square wave acts as
Fs/4 Sine wave in the ADC spectrum. The resultant
signal is a digital signal and contains the intermodulation product of frequency fd+/-2f1. This is same
as a low frequency sinusoid 2f1, frequency modulated
by a high frequency sinusoid fd. To separate intermodulation product, the output is multiplied with fd in
digital domain, analogous to the demodulation in
super-heterodyne receivers. fd in digital domain is a
square wave with frequency Fs/4 and values -1/+1. The
multiplication results in a frequency shift for all the
signal components. The inter-modulation product
could be seen as a low frequency component with
frequency 2f1 and an array of higher frequencies. A
16-point moving average filter is used for smoothening
the output and thereby removing the high frequency
components. The amplitude of smoothened signal is
Amplitude of Calib(n) = - (1)
Where N is the number of VCO stages, k2 is the third
order non-linearity to be corrected, A1 and A2 are
amplitudes of sinusoids given to the calibration
algorithm and FS is the sampling frequency used. Since
the values of A1, A2, N and FS are known, k2 can be
calculated. k2 is used to fill up the lookup table in
signal path with corrected values.
SNDR = 60.7dB
SFDR 64.8dB
Cos A + Cos B
60
40
Without Calibration
SNDR = 42.4dB
20
-20
1.E+02
1.E+03
1.E+04
1.E+06
1.E+05
Frequency (Hz)
Figure 4. FFT plot of ADC output before and after calibration
TABLE I. SPECIFICATIONS OF ADC

Parameter
Value
Operating voltage
0.4V
Bandwidth
10KHz
Sampling Frequency
1.28MHz
SFDR
64.8dB
SNDR
60.7dB
ENOB
9.79
Power Consumption
5uW
FoM
0.28 pJ/Conv
Conclusion
VCO-based ADCs are promising candidates for
achieving ultra-low power consumption at ultra-low
voltages. We have proposed a novel calibration
algorithm suitable for non-linearity correction in VCObased ADCs ultra low voltage operation. The SNDR
and SFDR improved considerably after the calibration
cycle.
References
[1] R. Sachin, et al., VLSI Circuits Symp., pp. 68-69, 2013.
[2] M. Z. Straayer, et al., JSSC, vol. 43, pp. 805-814, 2008.
[3] G. Taylor, et al., JSSC, vol. 45, pp. 2634-2646, 2010.
- 139 -
TO-3-5-5
Energy-efficient DAC with floating and charge averaging switching for

differential type SAR ADCs
Ju Eon Kim1, Taegeun Yoo1, Dong-Kyu Jung1, Hong Chang Yeoh2, and Kwang-Hyun Baek
1
Chung-Ang University, Seoul, Korea, 2Analog Devices Inc., San Jose, CA, USA
kbaek@cau.ac.kr
2. Proposed CASFC DAC scheme
Abstract
An energy-efficient capacitor switching digital-toanalog converter (DAC) is proposed for successiveapproximation register analog-to-digital converters
(SAR ADCs). The proposed charge-average switching
with floating capacitors (CASFC) DAC disconnects the
most significant bit (MSB) capacitors from the
capacitor array after determining the MSB. The
switching energy of the proposed CASFC DAC is
lower than that of the recently published DAC, because
the charge-average switching (CAS) technique is only
employed in the CASFC DAC while both the
traditional and CAS methods are used in the previous
DAC depending upon inputs. The CASFC DAC
reduces the switching energy by 64.4%, compared to
the aforementioned previous DAC.
Keywords: digital-analog conversion, analog-digital
conversion, data conversion.
1. Introduction
Recently, successive-approximation register analogto-digital converters (SAR ADCs) have been preferred
for low-power applications. In SAR ADC, the
capacitor digital-to-analogue converter (CDAC) is the
most power-hungry block. Thus, efforts to reduce the
switching energy of the CDAC have led to the
development of various switching schemes [1-2].
The previous DAC [1] averages the charges in the
bottom plates of two differential capacitors in CDAC,
which is named charge-average switching (CAS)
scheme. However, the CAS in [1] should be used in
combination with the traditional switching method
because the voltage changes in a CDAC are decreased
by half when CAS is applied. In this letter, a chargeaverage switching with floating capacitors (CASFC)
DAC is proposed to further reduce the switching
energy by using only CAS scheme.
The CASFC DAC has additional switches to float the

most significant bit (MSB) capacitors after determining
the MSB. Fig. 1 shows an example of the effect of a
floating capacitor of the single-ended type.
V
C0 C0
C
4C
*V
ref
2C0
C0 C0
(a)
Vref
ref
4
2C0
V
C0
C0
*V
2C
ref
V ref
2
2C0
C0
(b)
C0
2C0
Vref
Fig. 1: Change in the voltage (V) of the CDAC

output when the bottom of C0 is switched from
ground to Vref (a) before floating the MSB capacitor
and (b) after floating the MSB capacitor
C0 is the capacitance of a unit capacitor. The floating
MSB capacitor doubles V when other capacitors are
switched, as shown in Fig. 1, which cancels out the
decrease in V caused by CAS. Therefore, CAS can be
only applied after floating MSB capacitor, which
reduces the switching energy compared to the previous
DAC [1].
Fig. 2 shows an example of CASFC switching and
energy consumption at 4-bit configuration.
Fig. 2: Switching energy of the proposed CASFC

Because V and the energy consumption (E) are
symmetrical, only the case of VP < VN when
- 140 -
ICEIC 2015
Fig. 3 shows a 10-bit CDAC configuration of the

proposed CASFC scheme.
3. Simulated results
Fig. 5 compares the switching energy of the proposed
CASFC with recently developed methods according to
digital output codes. The average switching energy of
CAS [1] and detect-and-skip & aligned switching
(DAS&AS) [2] are 88.6C0Vref2 and 69.8C0Vref2,
respectively. The average switching energy of CASFC
is reduced by 37.5% compared with CAS, which is
55.4C0Vref2.
2
Switching
Switching Energy(C
Energy
0Vref )
determining the MSB is shown for simplicity. Because

the input signal is sampled at the top plates of the
capacitors, the switching energy is zero during the
sampling phase. After the first comparison to determine
the MSB, the bottom plates of the MSB capacitors
(2C0) are switched, which consumes the switching
energy of C0Vref2. After floating MSB capacitors, the
bottom plates of the rest of the capacitors are switched
by using CAS. Although CAS is used for the C0
capacitors, V is Vref/8 with a switching energy of 1/8C0Vref2.
150
[2]
DAS&AS[5]
[1]
CAS[1]
This work
100
50
0
0
128
256
384 512 640

Output
Code
Output
Code
768
896
1024
Fig. 5: Switching energy versus output code
4. Conclusion
Fig. 3: CDAC of the CASFC scheme with a 10-bit
SAR ADC
In this 10-bit capacitor array, the proposed CASFC is
applied to only MSB sides (from 128C0 to 8C0) for the
fair comparisons with [1]. In CASFC, 64C0 to 8C0 are
switched by using charge-average scheme. To reduce
the total, half-LSB switching (HLS) is used, as shown
at Fig. 4. As previously mentioned, only the case of VP
< VN is shown for simplicity because the voltage
transition is symmetrical. First, the switch of
C0averages the charge as in CASFC according to the
comparator output. After a change in the voltage of
Vref/2(N-2), the C0 capacitors are floated, and one
capacitor on each side is returned to the original
reference, making the voltage transition Vref/2(N-1).
Finally, the dummy capacitor switching changes the
CDAC output by Vref/2(N-1).
Fig. 4: HLS for dummy capacitors
A charge-average switching DAC with floating

capacitors is proposed in this letter. By floating the
MSB capacitors from the output node of the CDAC,
the weights of the capacitors are doubled, and the
binary weighted voltage ratio is maintained. The
average switching energy of the proposed CASFC is
decreased by 64.4% compared to previous DAC.
Acknowledgement
of MSIP/IITP, Republic of Korea (no. 2014-911-05002)
References
[1] Liou, C. and Hsieh, C.: A 2.4-to-5.2fJ/conversionstep 10b 0.5-to-4MS/s SAR ADC with Charge-Average
Switching DAC in 90nm CMOS, IEEE ISSCC Dig.
Tech. Papers, San Francisco, CA, Feb. 2013, pp. 280
281
[2] Tai, H., Hu, Y., Chen, H. and Chen, H.: A
0.85fJ/conversion-step 10b 200kS/s Subranging SAR
ADC in 40nm CMOS, IEEE ISSCC Dig. Tech. Papers,
San Francisco, CA, Feb. 2014, pp. 196 197
- 141 -
TO-3-5-6
A SIMO DC-DC Buck Converter using Output Voltage-Related Charge

Control Scheme
Ngoc-Son Pham, WonJune Hwang, JuEon Kim, DongHyun Yoon, Kwang-Hyun Baek
Chung-Ang University, Seoul, Korea
kbaek@cau.ac.kr
Abstract
This paper proposes Output Voltage-Related Charge
Control (OVRCC) method using for SIMO (Single
InductorMultipleOutput) Buck Converter. It has
advantages like working in both CCM and DCM mode,
excluding the need for freewheeling switch, thus improving
power efficiency, and minimizing cross-regulation. The
converter was designed to regulate five buck outputs: 1.2V,
1.5V, 1.8V, 2V and 2.4V from input voltage of 3.3V. The
peak power efficiency of 91% was measured. Maximum
cross-regulation of 7 mV occurs at the fifth output when
output current of the first output steps from 50mA to 300mA.
The chip size is 2.352 .
indicate that outputs power. The main switch is then

controlled to deliver an amount of power equal to the total
power needed by all output channels. By applying this
control method, the freewheeling switch is removed, and no
cross-regulation is still guaranteed. Inheriting from common
charge control method, the converter can operates in both
CCM and DCM modes.
2. Proposed Control Scheme

L=2.2 H
Chip Boundary
VG
IL
MP
VP VN
MS1
IO1
4.7 F
MS2
Current
Sensor
Keywords: SIMO Buck Converter, Output VoltageRelated Charge Control.
VOUT1~4
ILSEN1 Charge
Control
ILSEN1
VS1~4
D[1~6]
Gain
ILSEN2
VREF1~5
Control Block
VOUT1~5
VP
VN
Analog
Adder
VOUT2
IO2
VS2
4.7 F
MS3
VC
VOUT3
IO3
VS3
4.7 F
VC1~5
Charge-Based
Output Switch
Controller
6-bits SAR-ADC
1. Introduction
Charge distributive control [1-4] is commonly used in
recent years for controlling SIMO converter, due to its
ability for regulating many outputs and wide power range at
low output voltage ripple. However, cross-regulation is still
the worst obstacle when designing charge distributive
control. To solve this issue, much effort has been recorded
in the literature. Using freewheeling switch is a
straightforward method [1,3], since it decouples the output
channels between each switching period, and acts as a
preserved charge buffer to compensate for the charge
disturbance at the output channels. However owing to the
non-zero resistance of freewheeling switch, dissipated
power is unavertable. [2,4] apply PLL control to exclude the
need for freewheeling switch. Due to fast response speed of
PLL control, the cross-regulation is remarkably improved.
However, the converters using this control method only can
work in CCM mode, meaning that this control method is not
suitable for low power applications. From above mentions,
this paper proposed Output Voltage-Related Charge Control
(OVRCC) method. Unlike the normal charge control
method [3,5], when multiplying the charge delivered for one
output and its output voltage, the information achieved can
VOUT1
VS1
MN
MS4
VOUT4
IO4
VS4
4.7 F
VS1~5
MS5
VOUT5
IO5
VS5
4.7 F
Fig. 1. Overall architecture of the SIMO five-output

buck converter
Fig. 1. shows the overall architecture of the proposed
five-output DC-DC buck converter including major blocks.
Four NMOS devices (MS1 to MS4 ) and one PMOS device
(MS5 ) are selected for time-sharing inductor current. Fig. 2.
provides a closer look on the Control Bock, and its related
timing waveforms are shown in Fig. 3.
As seen in Fig. 2. outputs VOUT1 to VOUT4 are
independently controlled by their own charge-mode
feedback control loop. Thus these output channels are
always stable when disturbance occurs at any other outputs.
The last output controlled by the main charge loop control,
has function to compensate the power change in other
outputs. OVRCC prevents the last output from crossregulation.
- 142 -
ICEIC 2015
VREF1
VOUT1
ILSEN2
VOUT1~4
VC4
VQ4
EA
ILSEN2 VS4
VG
VD4
C
64/1
32/1
64/1
1/1
ILSEN2
Induoctor
Current
Sensor
(Gain A)
ILSEN1
VREF5
VOUT5
VC1
VC2
VC3
VC4
VC5
Voltage-related
current sensor
VC5
EA
VTOT
VQ_TOT
VOUT5
VS3
VOUT4
VS4
VOUT3
VS5
VOUT2
VOUT1
VN
Fig. 4. Post-simulation results

Fig. 4. shows the scenery when load current of output 1st
changes from 50mA to 300mA and reversed, the maximum
cross-regulation of 7mV is measured at output 5th, while
output channels 2nd to 4th are not impacted. The performance
summary is shown in Table 1.
ILSEN1
ILSEN2
VQ1
VS1
Table 1: Performance summary

CMOS
Topology
Switching Frequency
Output Inductor and Capacitor
Voltage Ripple [mV]
Operating Mode
Free-Wheeling Switch
Cross-Regulation [mV/mA]
Max. Efficiency [%]
Max. Output Power [W]
t
D1T
VC1
t
VQ2
VS2
D2T
VC2
t
VS5
VQ_TOT
t
VC_TOT VP
D5T
VC5
t
DT
250mA
VDT
IL
500mA
IL
ILSEN1
IL
I LSEN2
1.8V
1.2V
VP
Fig. 2. Block diagram of the control circuit
2.0V
1.5V
ILSEN1
7mV
VS2
Logic Control & Gate Driver
VD3
VREF4
VOUT4
2.4V
VS1
6-bits SAR-ADC
VG
VD1
VD2
VS1~4
D[1~6]
VG
VC1
VQ1
EA
VS1
0.18 m
5 buck outputs
1 MHz
2.2 H/4.7 F
<27
CCM/DCM
No
0.028
91
2.31
Fig. 3. Operation timing waveforms

Due to voltage-related current sensor, the power
delivered for output channel first to forth in one switching
cycle can be calculated by equation (1). Equation (2) is
obtained as a result of charge control. Extracted from (1)
and (2), equation (3) shows that VCi can be used to indicate
the transferred power Pi . Similarly, the total transferred
power PTOT in one period is expressed as equation (4).
Equation (5) is obtained by the analog adder suggesting that
any power change Pi happened at output channel ith , the
total delivered power changes with the same amount. This
makes the last output stable while transient occurs at other
output channels.
Di T
Di T
Pi = IL VOUTi dt =
0
VG
AI
V
dt = Di TVG AILSEN2 (1)
VOUTi LSEN2 OUTi
Q i = Di TILSEN2 = CVCi
(2)
Pi = AVG CVCi
(3)
PTOT = AVG CVC_TOT
(4)
VTOT =
i=1
VCi
(5)
Acknowledgement
This work was supported by the MCTD(Materials & Components
Technology Development Program), 10043660 funded By the
Ministry of Trade, industry & Energy(MI, Korea)
References
[1] Y-J. Woo, H-P. Le, G-H. Cho, et al., Load-Independent
Control of Switching DC-DC Converters with Freewheeling
Current Feedback, ISSCC Dig. Tech. Papers, pp. 446-447,
February 2008.
[2] K-C. Lee, C-S. Chae, G-H. Cho, et al., A PLL-Based HighStability Single-Inductor 6-channel Output DC-DC Buck
Converter, ISSCC Dig. Tech. Papers, pp.
200-201, February 2010.
[3] C.-W. Kuan and H.-C. Lin, Near-Independently Regulated 5Output Single-Inductor DC-DC Buck Converter Delivering
1.2W/mm2in 65nm CMOS, ISSCC Dig. Tech. Papers, pp.274275, February 2012.
[4] D-Z. Lu, Y. Qian, Z-L. Hong, An 87%-peak-efficiency DVScapable single-inductor 4-output DC-DC buck converter with
ripple-based adaptive off-time control ISSCC Dig. Tech. Papers,
pp. 82 83, February 2014.
[5] W. Tang, F-C. Lee, R. B. Ridley, et al., Charge Control:
Modeling, Analysis, and Design, IEEE Trans. Power Electronics,
vol. 8, no. 4, pp. 396-403, October 1993.
- 143 -
TO-3-5-7
Maximum Power Point Tracking algorithm for a Distributed PV System

Yohan Hong, Son N. Pham, Won-June Hwang, and Kwang-Hyun Baek
Chung-Ang University, Seoul, Korea
kbaek@cau.ac.kr
Abstract
This paper proposes a fast and efficient MPPT
technique that minimizes the power loss with the
adaptively binary-weighted step (ABWS) followed by
the monotonically decreased step (MDS) without
causing output power fluctuation or requiring
additional ad hoc parameter. The proposed MPPT
system for a PV module is implemented by a boost
converter with a micro-controller unit. The
experimental results based on a distributed PV systems
demonstrate that the proposed MPPT technique is
superior to the conventional P&O technique, which
reduces the tracking time and the overall power loss by
up to 82.95%, 91.51% and 82.46%, 97.71% for two
PV modules, respectively.
Keywords: Photovoltaic system, distributed system,
maximum power point, environmental conditions,
binary-weighted step.
parameter for enhancing the tracking speed. However,

the ad hoc parameters used for the multivariable P&O
MPPT, the variable step size INC (VSSINC) MPPT,
and the modified adaptive hill climbing (MAHC)
MPPT may not be universal and thereby exhibit PV
module dependency in a distributed PV systems. In
addition, the problem of output power fluctuation is yet
to be resolved.
This paper presents an MPPT algorithm based on the
adaptively binary-weighted step (ABWS) and the
monotonically decreased step (MDS). The proposed
MPPT technique detects the MPP quickly without
fluctuation or an additional ad hoc parameter by using
LSB first operation, which allows for superior
performance compared to others in the tracking and the
power loss not only under the steady state (normal
operation) but also under the dynamic state (tracking
operation).
2. Implementation of the proposed

algorithm using ABWS and MDS
1. Introduction
A maximum power point tracking (MPPT) controller
in a distributed PV system uses the IV characteristics
of a PV module for tracking the maximum power point
(MPP) of its own module. Various MPPT techniques
have been researched, and they can be categorized into
three types: single step, multivariable step. Previously
described simple single step techniques include perturb
and observe (P&O), P&O based on a PI controller, dPP&O in [1], incremental conductance (INC), and the
improved particle swarm optimization method. The
main drawback of the single step algorithms is their
relatively slow tracking speed. Moreover, the operating
point fluctuates around the MPP at the steady state,
which may cause a large amount of available energy to
be wasted.
The multivariable-step algorithms in [2] adopt a
coarse-to-fine step at the expense of an ad hoc
The proposed algorithm can be divided into two

operations: steady-state and tracking operations. In the
iteration 0, the maximum power available is unchanged
as the current input power Pn equals to the maximum
power PMax. Thus, it still falls into the steady-state
operation. In this stage, the proposed algorithm simply
continues to sense the input power as indicated in
branch (A) in Fig. 4. In the iteration 1, the maximum
power of a PV module moves to a higher voltage than
the previous one. In other words, Pn differs from PMax
due to environmental condition change. Then, the
variable Status changes to Tracking as branch (B).
The proposed algorithm starts tracking a new
maximum power PMPP by using the ABWS algorithm.
If the change of the operating voltage through branch
(B) increases the power, the voltage step is
continuously increased in the same direction D by the
ABWS until it passes the MPP. Since the operating
- 144 -
ICEIC 2015
Start
Sense Vn & In
Calculate Pn=VnIn
500mV
N
Status=Tracking
Pn=PMax
Y
Y
Y
Passing MPP
N
N
D=-D
Y
m=0
N
m=m-1
Vn+1=Vn+D 2m+D
Pn=Pn-1
Passing MPP=Y
Which way=known
Pn>Pn-1
Y
Vn>Vn-1
D=1
m>1
Y
Pn>Pn-1
Fig. 3. The flowchart of the proposed algorithm using ABWS and

MDS.
Status=
Steady-state
Vn+1=Vn+D m
If (m>1) m=m-1
Which way=
unknown
(E)
Y
P&O
D=-D
Vn+1=Vn+D
Which way=
known
(B)
Which way
=known
N
Vn+1=Vn+D 2m
m=m+1
Pn>PMax
Pn=PMax N
(F)
PV module dependency.
3. Experimental results
(D)
PMax=Pn
Return
Fig. 1. The flowchart of the proposed algorithm using ABWS and

MDS.
P
Present
PMPP
ABWS
MDS
Previous
PMPP
Present
VMPP
Previous
VMPP
m 0
D 1
Iteration 0
Branch A
2s
Proposed
Status=Tracking,
Passing MPP=N,
m=0, PMax=0, Pn-1=0
D=-1
(C)
N (A)
-1
3
1
2
1
-1
0
A
1
B
2
B
3
B
4
B
5
C
6
D
7
E
8
D
9
D
10
D
11
D
12
F
The proposed MPPT system is implemented with a

boost converter. The specifications of the PV modules
(JSM100-36-01) are VMPP = 17.64 V and IMPP = 5.70 A,
under the standard testing condition (1000 W/m2 and
25C). The tracking time of the proposed MPPT is
reduced by up to 82.95% for the PV modules JSM10036-01. The proposed MPPT reduces the power loss up
to 91.51% compared with the P&O MPPT. The
experimental results confirm that the proposed MPPT
algorithm is superior to the conventional P&O
algorithm in regard to the tracking time and the overall
power loss.
4. Conclusion
Fig. 2. MPP tracking procedure in the normal case.
voltage at the iteration 4 causes reduction in the output

power compared to the previous iteration, the direction
of the change in the operating voltage is reversed and
the operating voltage is decreased back to the
operating voltage of the previous iteration plus D
through branch (C) at iteration 5. Then, the MDS
algorithm runs through branch (D) to reduce the
operating voltage monotonically until it becomes to the
unit step . The initial value of m in the MDS is
obtained from the value of m set by the ABWS, and
the operating voltage from the PV module is changed
by Dm at iteration 6. The proposed algorithm
operates until it finds the MPP with when m is
equal to 1. For each MDS operation, the correct
direction D of the change in the operating voltage is
checked through the branch (E) at iteration 7 and 9. At
the iteration 11, the MPP can be detected if the present
power PN equals to the temporary maximum power
PMax through branch (F). Finally, the proposed
algorithm stops by setting the variable Status to a
Steady-state. Therefore, the proposed MPPT
algorithm tracks the MPP fast without an ad hoc, which
reduces the power loss of PV modules without causing
This paper proposes an MPPT technique for a

distributed PV system, in order to track the MPP
quickly without fluctuation. The proposed MPPT
techniques, the ABWS and the MDS, minimize the
power loss under rapidly changing environmental
conditions without an additional ad hoc parameter.
Even though the proposed MPPT system is
implemented by using a boost converter, it can also be
applied to any type of DC-DC converter.
Acknowledgement
This work was supported by the MCTD(Material &

Components Technology Development Program),
10043660 funded by the Ministry of Trade, industry &
Energy (MI, Korea).
References
[1] E. Koutroulis and K. Kalaitrakis, Development of a
Microcontroller- Based Photovoltaic Maximum Power Point
Tracking Control System, IEEE Trans. Power Electron., pp.46-54,
Jan. 2001.
[2] G. Petrone, G. Spagnuolo, and M. Vitelli, A Multivariable
Perturb-and-Observe Maximum Power Point Tracking Technique
Applied to a Single-Stage Photovoltaic Inverter, IEEE Trans. Ind.
Electron., pp.76-84, Jan. 2011.
- 145 -
ICEIC 2015

Oral Session
FO-1-1
Control and Robotics(Lab-to-Lab) I
FO-1-1-1
A Multi-UGV Testbed for Autonomous Vehicle Cooperative Driving

Gi-Poong Gwon, Eun-Dong Lee, Seung-Nam Kang, Mid-Eum Choi, Myung-Ok Shin,
Seung-Tak Choi, In-Sub Yoo, Bo-Kyung Seo, Doo-San Baek and Seong-Woo Kim
Department of Electrical and Computer Engineering, Seoul National University, Korea
gpgwon, snkang, mechoi, moshin, stchoi, isyoo, bkseo, dsbaek @ cnslab.snu.ac.kr, sinabrlo@snu.ac.kr
Abstract
This paper introduces a multi-unmanned ground
vehicle (Multi-UGV) testbed for autonomous vehicle
cooperative driving test. Hardware architecture of an
UGV and basic intelligent perception and control
functions that the UGV equips are presented. To
demonstrate the usefulness of the testbed, a cooperative driving algorithm is realized and evaluated
through the testbed.
Keywords: UGV testbed, cooperative driving
1. Introduction
Since the development of vehicles, despite efforts to
make safer car and more efficient transportation
systems have continued, the traffic accidents and traffic
jam remain problems that are not perfectly settled yet.
One of the main reason is that human is behind the
wheel of the car. Not only most of traffic accident is
caused by mistake or carelessness of drivers, but also
traffic flow is deteriorated by the selfish behaviors of
drivers. The fundamental solution to alleviate or
eliminate the problems caused by human is to let
drivers take their hands off the wheel. In other words, if
an errorless and non-selfish intelligent system
substitutes the human driver, then the problems can be
resolved.
Recently, many efforts to develop autonomous
vehicles have been made. However, the present
researches do not properly consider the possibilities of
autonomous vehicle in the perspective of safety and
traffic efficiency. The goal of currently developed
autonomous vehicle is just substituting the human
driver. The autonomous vehicle will be of help to
prevent the accidents that have been caused by human
errors. However, it will not be able to achieve the zeroaccident or maximum traffic flow, since vehicles will
still drive for the profit of themselves.
Figure 1. Multi-UGV Testbed.

We argue that the zero-accident and maximum
traffic flow can be achieved when autonomous vehicles
drive cooperatively with a pre-agreed protocol by
excluding selfishness of each vehicle. There have been
some researches to develop cooperative systems. The
vehicle platooning system was proposed by the
California PATH project team in the late 1990s [1].
The Cooperative ACC systems was proposed and
analyzed in the mid-2000s [2]. The limitations of these
previous systems are that they are semi-autonomous
systems and just consider the driving in a single lane.
Developing a fully-autonomous cooperative driving
system without the single-lane constraint is very
challenging problem. One of the biggest challenges is
testing and verifying the cooperative driving algorithms.
Since multiple vehicles are required to realize the
cooperative driving algorithms, it is very difficult to
evaluate and verify the algorithms based on the real
vehicles. To tackle this problem, we propose the use of
1/10 size of multi-UGVs as the test platform to
evaluate the cooperative driving algorithms. In this
paper, we describe the hardware and software architectures of the UGVs, and a cooperative driving test
result using the testbed is presented.
2. Hardware Configuration
The chassis of the mobile robot is based on a 1/10
size commercial RC car that models the Toyota Tundra.
By using the commercial RC car, we saved the
- 147 -
ICEIC 2015
Figure 3. Test road track.
Figure 2. Cooperative driving in a lane-drop section
production cost of the chassis. Considering the control

accuracy, we chose a vehicle whose mechanical
construction is elaborate as possible. The vehicle is
driven by a BLDC motor, and the steering mechanism
is controlled by a step motor. The vehicle equipped
various sensors: two single-layer laserscanners, a
monocular camera, a gyro sensor and a motor encoder.
The laserscanners installed to the front and the rear side
of the vehicle are used to detect surrounding object.
The mono-cular camera is used for lane detection and
object recognition. The gyro sensor is used to increase
the vehicle control accuracy. The motor encoder
measures the number of revolutions of the motor to
estimate the travel distance and speed of the vehicle. In
addition to these sensors, the vehicle equips an IEEE
802.11n wireless modem to support vehicle-to-vehicle
commu-nication. We can drive the motors and process
the sensor data using a computer installed on the
vehicle.
cooperatively to increase the overall traffic efficiency.

Figure 2 shows the test road track to test the
effectiveness of the cooperative driving. The track is
divided into four different road sections: single-lane,
lane-split, multi-lane and lane-drop. Among these road
sections cooperation in the lane-drop sections is most
important for the traffic efficiency. In front of the lanedrop section, each vehicle adjusts its speed so that
whole vehicles merge into a single-lane as smoothly as
possible. Figure 3 shows the cooperative vehicle
merging in the lane-drop section. A video about this
experiment is posted on YouTube [4].
3. Basic Intelligent Functions

The mobile robot equips various perception and
control functions for autonomous driving. For
environmental perception, lane detection, vehicle
detection and obstacle detection functions based on the
fusion of the camera and the laserscanners are equipped.
Some control functions such as lane keeping, lane
change and adaptive cruise control are equipped for
basic autonomous driving. All of these functions
operate automatically within the mobile robot.
4. Cooperative Driving Test

Using the UGV testbed, we evaluated a cooperative
driving algorithm proposed in the [3]. In the literature,
S. Kim, et al. proposed a concept of smooth lane
merging and long-term perspective driving. Long-term
perspective driving is expected to encourage voluntary
cooperation on road. Each vehicle recognizes the front
road conditions beforehand based on the information
shared among the vehicles through wireless
communications. Using this information vehicles drive
5. Conclusion
In this paper, we proposed a Multi-UGV for testing
autonomous cooperative driving algorithms. The
system architecture of the UGV was briefly reviewed
and a cooperative driving experiment using the testbed
was presented. We argue that the Multi-UGV testbed is
a useful tool for developing and evaluating cooperative
driving algorithms.
6. Acknowledgement
Foundation of Korea (NRF) grant funded by the
Ministry of Science, ICT & Future Planning (MSIP)
(No. 2009-0083495).
References
[1] D. Swaroop, String Stability Of Interconnected Systems:
An Application To Platooning In Automated Highway
Systems, Ph.D. dissertation, Dept. Mech. Eng., Univ.
California, Berkeley, 1994.
[2] B. van Arem, C. J. G. van Driel, and R. Visser, The
impact of cooperative adaptive cruise control on traffic flow
characteristics, IEEE Trans. Intell. Transp. Syst., vol. 7, no.
4, pp. 429436, Dec. 2006.
[3] S. Kim, et al., Multiple Vehicle Driving Control for
Traffic Flow Efficiency, IEEE Intelligent Vehicles
Symposium, June, 2012.
[4] http://www.youtube.com/watch?v=9lvTS3_Y5nk
- 148 -
FO-1-1-2
Cooperative Target Detection using UGV-UAV Platform

with a Docking System
DooSan Baek, Gi-poong Gwon, Gyumin Oh, In-Sub Yoo, Seong-Woo Kim
Department of Electrical and Computer Engineering, Seoul National University,
Gwanak-ro 1, Gwanak-gu, Seoul 151-742, Korea
E-mail : {dsbaek, gpgwon, gmoh, isyoo}@cnslab.snu.ac.kr, sinabrlo@snu.ac.kr
Abstract
We propose a cooperative UGV-UAV platform
with a docking system to integrate UGVs advantages
which are long duration time and large load capacity
and UAVs advantages which are high mobility and
wide sensing range.
We used a camera and 2D-LIDAR to detect lane,
obstacle and target object. In our platform, UGV and
UAV drive together usually, but UAV only takes off
when it is highly needed. Therefore, we solve the
problem to optimize energy efficiency and sensing
range. The proposed platform has been tested on the
specified demo scenario.
This paper is organized as follows. In Section ,

we present our system description such as hardware,
perception and path planning. Section provides
experimental results. Section concludes this work.
. SYSTEM DESCRIPTION
A. Hardware
The system which we developed is comprised of a
single UGV and UAV as shown on Figure 1, 2. Both
UGV and UAV are designed and developed by the
authors group.
Keywords: UGV, UAV, docking, cooperative mission

performance
. INTRODUCTION
The applications of unmanned vehicle are rapidly
increasing these days such as the surveillance of an
environment [1], the detection of forest fires [2] and
the exploration on Mars [3]. Research on unmanned
vehicles is generally divided into two main areas:
Unmanned Ground Vehicle (UGV) and Unmanned
Aerial Vehicle (UAV). UGV has the advantages of
mission performance time and load capacity because
UGV is more stable and energy-efficient than UAV.
The advantage of load capacity makes UGV possible
to load more precise sensors, so UGV can build high
quality environment map. In contrast, UAV takes the
advantages of high mobility and wide sensing range.
For these reasons, UAV can perform a task even when
environment is harsh for UGV.
In this paper, we present our approach to
cooperative target detection using a UGV-UAV
platform with a docking system. By cooperative task
performance, energy efficiency and sensing range are
optimized. Then we can overcome the limitations that
are caused when performing task individually, which
can maximize UGVs and UAVs advantages.
- 149 -
Figure 1. UGV configuration
Figure 2. UAV configuration
ICEIC 2015
We utilize a 2D-LIDAR and a camera in UGV to

achieve the environment information and wheel
encoder in UGV to calculate ego-vehicles driving
data such as vehicles speed. And also we utilize a
camera in UAV to obtain the environment information
and Vicon in UAV to localize UAV itself.
Communication between UGV and UAV was
based on TCP/IP over Wi-Fi.
UGVs computations are performed by a fit-PC2
with Intel Atom Z5xx CPU 1.1 running Windows XP
and UAVs computations are performed by a regular
desktop PC with Intel i7 quad-core CPUs running
Windows 7.
AVR board converts path planning modules
output signal into electric signal to control UGVs
motor and servo motor. UAV is controlled by a single
desktop PC because UAV has few payloads to equip
the PC on itself. And there also exists Wi-Fi
communication module between UAV and the desktop
PC. Consequently, UGV and UAV can perform a
mission totally automatically.
UGVs short sensing range, UAV takes-off at the

crossroads and hover around the crossroads. During
hovering, UAV performs a scouting mission and sends
several pictures taken from UAVs camera through
wireless communication. After UGV gets pictures
from UAV, UGV calculates its final path. UAV lands
on UGV after the path planning process, then UGV
starts moving to find the target object using its camera
and 2D-LIDAR.
B. Perception
By using 2D-LIDAR, we can measure the exact
position of obstacles and target objects. But there is a
limitation that it is hard to distinguish between
obstacles and target objects if we use only 2D-LIDAR
sensor data. To solve this problem, we use camera
sensor data and apply target object detection algorithm
that can classify detected object into obstacle and
target object.
Basically UGV uses a camera sensor to drive along
the lane. From the every camera image frame, we
apply a Gaussian filter to extract the lane features.
Contrary to UGVs camera, UAVs camera has
different camera angle. Because UAVs camera angle
is not horizontal but vertical, we need a 3-D image
processing algorithm rather than 2-D image
processing algorithm. To overcome this issue, we
employ the Flood-fill algorithm that extracts lane
marking from a vertical view image.
. CONCULSIONS
C. Path Planning
The path planning module gets the sensor data
from UAVs camera, UGVs camera and 2D-LIDAR.
This makes UGV and UAV possible to recognize
integrated environment. Base on the recognition,
UGV can compute the optimal trajectory for its task
mission.
. EXPERIMENTAL RESULTS
We applied our UGV-UAV platform to following
mission scenario as below. UGV which docked with
UAV performs a mission to find the target object along
the lane. But there is a crossroads, the first fork is a
dead end, the second fork is blocked with the obstacle
and the third fork has the target object. Because of
Figure 3. Cooperative UGV-UAV platform
The cooperative UGV-UAV platform with a

docking system has been developed and tested on the
specified demo scenario. UAV takes off only when
UGV meets a crossroad and takes several pictures. We
used a camera and 2D-LIDAR sensor data to extract
lane, obstacle and target object. The path planning
module recognizes the integrated environment.
Finally, we can maximize energy efficiency and
sensing range. We verified the performance of our
system through an experiment.
ACKNOWLEDGEMENT
Foundation of Korea(NRF) grant funded by the
(No. 2009-0083495).
REFERENCES
[1] Y. Elmaliach, A. Shiloni, and G. A. Kaminka,
A realistic model of frequency-based multirobot polyline patrolling, in Proc. Int. Conf.
Auton. Agents, pp. 63-70, May 2008.
[2] D. B. Kingston, R. W. Beard, and R. S. Holt,
Decentralized perimeter surveillance using a
team of UAVs, IEEE Trans. Robotics, vol. 24,
no. 6, pp. 13941404, Dec 2008.
[3] J. Carsten, A. Rankin, D. Ferguson and A. Stentz,
Global path planning on board the mars
exploration rovers IEEE Aerospace Conference,
pp. 1-11, Mar 2007.
- 150 -
FO-1-1-3
Obstacle Avoidance for Autonomous Driving in Clustered Pedestrian

Environment: Framework and Experimental Evaluation
Wei Liua, Seong-Woo Kimb, and Marcelo H. Ang Jra.

National University of Singapore, Singapore b Seoul National University, Korea
liu_wei@nus.edu.sg, sinabrlo@snu.ac.kr mpeangh@nus.edu.sg
Abstract
This paper presents an obstacle avoidance module for

autonomous driving in clustered pedestrian environment.
As an essential part of the autonomous driving system, the
obstacle avoidance function aims at re-plan a trajectory
when the current path is occupied by the obstacles. The
framework of the proposed obstacle avoidance module will
be presented. The real experiments have been conducted
and some promising results have been achieved.
achieved in autonomous driving on urban road, there is

quite little research focus on improving the autonomous
driving ability in clustered pedestrian environment. The
pedestrian environment can be quite dynamic and clustered,
hence the obstacle avoidance need to be conducted in a
real-time manner. The proposed obstacle avoidance
module has been extensively evaluated and some
promising results have been achieved.
2. Framework
This session will introduce the essential components
that are involved in the obstacle avoidance module.
Keywords: Obstacle avoidance, autonomous vehicles,

clustered pedestrian environment.
2.1. Perception
1. Introduction
Autonomous vehicles, with a goal of realizing
autonomous system that independently and robustly
perform all intelligent and safety-critical driving functions,
had attracted dramatic attention during the past decades.
Recent advances in sensing, real-time control and
computation technologies have further spurred interest in
autonomous driving and many advances have been made
in the past decade, as evidenced, for instance, by the series
of competitions sponsored by the Defense Advanced
Research Projects Agency (DARPA) [1, 2].
Inheriting from the experience of the DARPA Grand
Challenge, most of the state-of-art autonomous vehicles
planning systems are divided into three hierarchical
subsystems: Mission Planning, Behavior Planning and
Motion Planning [3]. The task level mission planning aims
at planning an optimal mission schedule, then the actionlevel or decision-level behavior planner responds for
parsing the assigned task into a set of actions or decisions.
Finally, the motion planner is in charge of searching the
dynamic feasible trajectories to accomplish the planned
actions.
As a key component of the autonomous driving system,
this paper will present an obstacle avoidance module for
autonomous driving in the clustered pedestrian
environment. While great achievements have been
To easily utilize the collected raw sensing data, such as

laser scan, for obstacle avoidance purpose, the metric map
can be a good candidate to model the occupancy of the
environment, which also can give a metric-level evaluation
of the surroundings. The definition of the metric function
is arbitrary and can be easily adapted for different purpose.
In this paper, the distance to the nearest obstacle is
calculated and projected on the metric map for obstacle
checking and motion planning.
2.2. Avoidance Triggering

The autonomous vehicles are normally operated in the
known environment, where a reference path can be easily
set up beforehand via demonstration, thus the obstacle
avoidance module is only need to be called when the prespecified reference path is occupied by the obstacle.
The avoidance triggering can be implemented via either
measuring the Time-To-Collision (TTC) or the DistanceTo-Collision (DTC), in this paper the DTC is adopted for
its simplicity. Given the current vehicle velocity as , the
triggering distance (TD) is calculated as:
,
where
denotes the maximum deceleration and is
the parameter to regularize how early the avoidance need
to be triggered. This design is to guarantee that the vehicle
can have enough space to stop even there is no feasible
avoiding trajectory can be found.
- 151 -
ICEIC 2015
Figure 1: Test bed and experiment environment
2.3. Motion Planning

Once the obstacle avoidance function is triggered, the
motion planner will come into act to search the feasible
trajectory to by-pass the obstacles that occupying the
reference path.
In order to guarantee the completeness of finding the
obstacle-free trajectory, the planning algorithm RRT* [4]
is employed is this paper. As an optimal variant of
Rapidly-Random exploring Trees (RRT), the RRT* is able
to incrementally optimize the solution trajectory, thus can
be easily implemented in the anytime manner and become
applicable for the clustered pedestrian environment.
Recognizing the innate kinematic constraint of the
vehicles, the Dubins curve or the ReedShepp curve is used
to steer the tree extensions. The reader can refer to [4] for
the detailed algorithm.
3. Experimental Evaluation
This session will present the experimental evaluation of
the proposed obstacle avoidance module.
Our test bed is a Yamaha G22E golf cart with various
affordable sensors (shown in Fig. 1(a)), where the details
are available in [5]. The experiments were conducted in the
Utown plaza within National University of Singapore,
which is a typical pedestrian environment as Fig. 1(b).
Fig. 2 demonstrates three snapshots of the obstacle
avoiding results in the pedestrian environment. The
colorful map attached to the vehicle frame is the metric
map, where the colors are scaled according to the distance
to the nearest obstacle. The solution trajectory is given as
the black curve, which is kinematic feasible and locates far
away from the obstacle while maintaining a reasonable
length.
4. Conclusion
This paper has presented an obstacle avoidance module
for autonomous driving in clustered pedestrian
environment. Three major components of the obstacle
avoidance sub-system, i.e. Perception, Avoidance
Triggering and Motion planning, are brief introduced. The
proposed obstacle avoidance module has been extensively
evaluated via real experiments and some promising results
have been achieved.
Figure 2: Experimental evaluation results
Acknowledgement
This research was supported by the Future Urban
Mobility project of the Singapore-MIT Alliance for
Research and Technology (SMART) Center, with funding
from Singapores National Research Foundation.
References
[1] Mahelona, Keoni, et al. "DARPA Grand Challenge." (2007).
[2] Montemerlo, Michael, et al. "Junior: The stanford entry in the
urban challenge." Journal of field Robotics 25.9 (2008): 569-597.
[3] Urmson, Chris, et al. "Autonomous driving in urban
environments: Boss and the urban challenge." Journal of Field
Robotics 25.8 (2008): 425-466.
[4] Karaman, Sertac, and Emilio Frazzoli. "Sampling-based
algorithms for optimal motion planning." The International
Journal of Robotics Research 30.7 (2011): 846-894.
[5] Z. J. Chong, B. Qin, T. Bandyopadhyay, T. Wongpiromsarn,
B. Rebsamen, P. Dai, E. S. Rankin, and M. H. Ang Jr,
Autonomy for mobility on demand, in Intelligent Autonomous
Systems 12. Springer, 2013
- 152 -
FO-1-1-4
A track boundary detection method by utilizing temporary local coordinate

Myungok Shin, Mid-Eum Choi, Gi-Poong Gwon, Seung-Tak Choi, In-Sub Yoo, Bokyung Seo,
Gyumin Oh, DooSan Baek, Seong-Woo Kim
Seoul National University
{moshin, mechoi, gpgwon, stchoi, isyoo, bkseo, gmoh, dsbaek}@cnslab.snu.ac.kr
sinabrlo@snu.ac.kr
Abstract
2012 Unmanned solar vehicle challenge was a
competition of autonomous driving vehicle whose
power is charged from solar panels only. It was the
first competition in the world with remarks on the fact
that the autonomous driving and energy management
concepts are fused together. One of the main
difficulties was to detect track boundary which consists
of cones with local sensors only. Every team had to
find and classify them into left ones and right ones to
drive the vehicle inside the boundary. In this paper, we
show our own algorithm to carry out this mission,
which led us to get the second prize in the competition.
Figure 1. Track boundary which consists of cones.
Keywords: Autonomous driving, solar vehicle, cone

detection, LIDAR, unmanned solar vehicle challenge
this paper is organized as follow. We define the

problem in Section 2. Section 3 describes the proposed
detection method in detail, and the conclusions of the
paper are presented in Section 4.
1. Introduction
2012 unmanned solar vehicle challenge was a
competition for self-made vehicle. Every attendee had
to make their own vehicles equipped with various
electronic devices, such as solar panels, a GPS, a
camera, and a LIDAR, and enable the vehicle to drive
autonomously being charged from solar panels. Also it
was the first competition in the world which covered
both research parts of eco-friendly and autonomous
driving vehicle. The broad range of each research area
made the competition require many types of
customized element technologies, e.g., energy
management, environment perception, control, and
optimization. One of the core technologies was a track
boundary detection algorithm. Multiple cones formed
the track boundary, which seemed complex obstacle
zone in some situation. In this paper, we introduce our
novel track boundary detection algorithm with a 2D
laser scanner, which led our SNU solar team to win the
second prize among eleven teams in total. The rest of
2. Problem definition
The competition rules about the GPS waypoints of
the track made it an important task to find the cones on
road with local sensors and decide them as left ones or
right ones because they represented the track boundary.
It is a relatively simple task to detect cones by
analyzing the width of each segment from a local
sensor, e.g., a laser scanner or camera. However, it is
not straightforward to classify them into left ones or
right ones. Because there were many cases where the
relative position acquired from the sensor directly was
no more decision criterion, like cones on curve, or
cones on the area where tracks of both directions are
close, like in Figure 1. As a result, additional
information were necessary to deal with the cases. In
Section 3, we introduce our novel cone recognition
method that we utilized in the competition.
- 153 -
ICEIC 2015
Figure 3. Detection result.

Figure 2. (a) Ego vehicle and two nearest cones
detected (b) The procedure to seek the next nearest
cone on the left side.
3. Detection method
Considering its FOV and measurement accuracy,
our team took a 2D laser scanner, SICK LMS-511, as a
main sensor. We employed standard 2D LIDAR data
segmentation method [1] to generate object candidate,
and then detected cones by their width condition. We
assumed that the nearest cones which have the shortest
Euclidean distances to the ego-vehicle on the both side
can be found by utilizing local Cartesian coordinate,
whose origin is the position of the ego-vehicle. Figure
2(a) represents two nearest cones and the others. The
nearest cone on the -x plane was considered as left one
and that on the +x plane was considered as right one.
The other cones on both sides were recognized in order
of short distance from the ego-vehicle. Based on the
fact that there was no object on the track between left
and right cones except obstacles which can be
distinguished by using their size, the innermost cone
was considered as the next closest one on each side.
Figure 2(b) illustrates the procedure to locate the
second closest cone on left side.
i) Firstly, set a new local coordinate centered on the
left closest cone, which naturally makes four
quadrants. In Figure 2(b), (1) is a new local
quadrant 1.
ii) Then, define a line that crosses the new origin
(red point in Figure 2(b)) and has a fixed length d,
and increase the angle between the x-axis and the
line from 0 to 180, where the angle is 0 on x-axis.
iii) When a new cone is on the line, take that as the
next closest cone.
iterating the steps i) iii) on every new cone, all other

cones which indicate track border can be found. The
line rotating on the new temporary local coordinated
from the inside to outside made the detection result
reliable even on curves.
4. Result
Figure 3 shows the detection result. The green box
represents our vehicle, the white circles mean left cones,
and the yellow circles mean right cones. The bold
circles mean the second closest cones in the both side,
which generated the waypoint of the vehicle, the dark
yellow circle between the left and right cones.
5. Conclusion
This paper shows a novel detection algorithm which
finds the driving track indicated by cones on road. By
utilizing the fact that there was nothing in the area
between the left and right cones except large obstacles,
we sought the cones in order of shortest distance. The
algorithm showed reliable detection performance and
led our team to get the second prize in 2012 unmanned
solar vehicle challenge.
6. Acknowledgement
Ministry of Science, ICT& Future Planning (MSIP)
(No. 2009-0083495).
References
[1] J. Sparbert, K. Dietmayer, and D. Streller, Lane detection and
street-type classification using laser range images, in Proc. IEEE
Intelligent Transportation Systems Conf., Aug. 2001, pp. 454459.
The same process was applied to detect right cones

except the angle was decreased from 180 to 0. By
- 154 -
FO-1-1-5
Building a Precise Roadway Map for Autonomous Vehicle Driving

Gi-Poong Gwon and Seong-Woo Kim
Department of Electrical and Computer Engineering, Seoul National University, Korea
gpgwon@gmail.com and sinabrlo@snu.ac.kr
Abstract
We propose a method to build a precise and
efficient roadway map for autonomous vehicles. Raw
data about road geometry is collected through a probe
vehicle equipped a GPS and an inertial measurement
unit (IMU). The errors contained in the raw data are
corrected by an optimal smoothing technique. Finally,
for storage efficiency, corrected data in the form of
sequential set of points is modeled as arc-length
parameterized cubic-spline curves of which a spline is
represented as parameterized cubic polynomials. The
experiment result shows that the roadway map
produced using the proposed algorithm is accurate
sufficiently to use for autonomous vehicle.
Keywords: roadway map, autonomous vehicle
1. Introduction
Autonomous vehicles are being realized with
significant efforts in academia and automotive industry.
In order for a vehicle to drive autonomously, various
component functions should be supported such as
environmental perception, localization, path planning
and control. Operations of these functions are based on
precise and accurate information about surrounding
environment of the vehicle. Among this information,
precise roadway map is essential information that plays
a key role in operation of various functions for the
autonomous vehicle such as vehicle localization [1],
Motion planning [2] and ADAS [3].
In order for the roadway map to be used for autonomous vehicles, three primary requirements should be
satisfied:
Accuracy Requirement: The roadway map is used

by the functions related to the safety of the vehicle.
Therefore, centimeter-level accuracy is required.
Availability Requirement: The roadway map
should represent the road geometry in a form
suitable for the autonomous vehicle.
Storage Efficiency Requirement: The road

geometry data stored in the map should be
represented in an efficient form in the perspective
of storage cost, since expressing the whole road
network requires huge amount of data storage.
There have been some studies to build a roadway

map providing high accuracy in centimeter-level. D.
Betaille et al. represent the road as a set of clothoid
curves [4]. However, since the clothoid curve includes
the transcendental functions, it is difficult to use for
autonomous vehicle. In order to build a roadway map
suitable for autonomous vehicle, K. Jo et al. model the
road as cubic B-spline curves [5]. Since the B-spline
curve can be directly converted to a set of polynomial
curves, it is convenient to use for autonomous vehicle.
However, the B-spline cannot represent the real road
geometry perfectly. Since the B-spline curve is C2continuous at all the points on the curve, it cannot
exactly express the road sections in which the curvature
is not continuous.
In this paper, we propose an algorithm to build a
roadway map satisfying the requirements. We model
the road as a cubic-spline curve in which a single spline
is expressed as a parameterized cubic-polynomial curve.
The cubic-spline curve that we define can express the
real road more precisely.
2. Roadway Map Building

The roadway map building algorithm is composed
of three steps: data acquisition, data correction and
road modeling. In the data acquisition step, raw data
about road geometry is collected using a probe vehicle
equipped a GPS and an IMU. The raw data is corrected
in the data correction step to secure the continuity of
the data and minimize the errors contained in the raw
data. The corrected data is in the form of sequential set
of the points. However, saving all these points in the
map is inefficient in the perspective of storage cost.
Therefore, the point data is expressed as mathematical
curves to maximize the storage efficiency. The detailed
- 155 -
ICEIC 2015
procedures of the data acquisition and correction steps
are beyond the scope of this paper. In this paper, we
focus on the road modeling algorithm.
The parameterized cubic-spline curve is defined as
X ( s) C X 3,k ( s sk )3 C X 2,k ( s sk ) 2 C X 1,k ( s sk ) C X 0,k
(1)
Y ( s) CY 3,k ( s sk ) CY 2,k ( s sk ) CY 1,k ( s sk ) CY 0,k ,

3
where s is the parameter of the curve meaning arclength of the curve and sk represent the arc-length at the
beginning point of kth curve segment. The problem is
expressing the point data as the spline curve with the
minimal number of splines and acceptable accuracy. In
this paper, we consider the modeling problem as an
estimation process that estimates the coefficients of the
curves using the extended Kalman filter where the
point data is given as the observation. In other words,
using the sequential point data, the extended Kalman
filter produces a polynomial curve fits given points
most well. The overall procedure of the algorithm can
be summarized as below:
i. Initialization: The states and covariance of the
Kalman filter are initialized.
ii. Estimation: The coefficients of the polynomial are
estimated using the sequential point data. As a new
observation point added, the filter adjusts the
coefficients of the curve.
iii. Curve Transition: When the maximum error
between produced curve and given points exceeds a
threshold, the Kalman filter iteration is stopped and
the coefficients of the curve are saved. Next the reinitialization is performed to produce a new curve.
In the above algorithm description, multiple
sequential Kalman filter are applied during the
modeling process. Since a single polynomial curve
cannot express the whole point data precisely, new
Kalman filtering restarts to estimate a new curve
whenever the accuracy threshold is violated. The
accuracy is defined as the maximum distance between
the given points and the estimated curve. The
coefficients of the constant term and first-order term of
the polynomial curves are not included in the state of
the Kalman filter because they are set as fixed values
when the Kalman filter begins for guaranteeing the C1continuity between two adjacent curves.
We verified the performance of the proposed algorithm through an experiment. The raw data was collected
for the road in Seoul National University, because the
road includes many curves having various curvatures.
The raw data was corrected by an optimal smoothing
technique. From the corrected data, we produced a
cubic-spline curve using the proposed algorithm.
Figure 1. Produced Roadway Map

Figure 1 shows produced roadway map. In the figure,
each roadway segments are divided by x marks.
3. Acknowledgement
(No. 2009-0083495).
4. Conclusion
In this paper we proposed a roadway map building
algorithm for autonomous vehicles. For storage
efficiency, the roadway map is represented as
parameterized cubic-spline curves in which a spline is
expressed as a cubic-polynomial curve. We verified
that the roadway map is accurate and precise
sufficiently to be used for autonomous vehicles.
References
[1] R. Toledo-Moreo, D. Betaille, and F. Peyret, Lane-level
integrity provision for navigation and map matching with
gnss, dead reckoning, and enhanced maps, Intelligent
Transportation Systems, IEEE Transactions on, vol. 11, no. 1,
pp. 100112, March 2010.
[2] K. Chu, M. Lee, and M. Sunwoo, Local path planning
for offroad autonomous driving with avoidance of static
obstacles, Intelligent Transportation Systems, IEEE
Transactions on, vol. 13, no. 4, pp. 15991616, Dec 2012.
[3] S. Durekovic and N. Smith, Architectures of mapsupported ADAS, in Proc. IEEE Intell. Veh. Symp. (IV),
Baden-Baden, Germany, 2011, pp. 207211.
[4] D. Betaille and R. Toledo-Moreo, Creating Enhanced
Maps for Lane-Level Vehicle Navigation, Intelligent
Transportation Systems, IEEE Transactions on, vol. 11, no. 4,
pp. 786798, Dec. 2010.
[5] K. Jo and M. Sunwoo, Generation of a Precise Roadway
Map for Autonomous Cars., Intelligent Transportation
Systems, IEEE Transactions on, vol. 15, no. 3, pp. 925937,
June 2014.
- 156 -
ICEIC 2015

Oral Session
FO-1-2
Signal Processing I
FO-1-2-1
Fingerprint Liveness Detection Using SVM-based Ensemble Classifier

Wonjune Lee1, Heeseung Choi2 and Jaihie Kim1
1
School of Electrical and Electronic Engineering, Yonsei University, Republic of Korea
2
Imaging Media Research Center, Korea Institute of Science of Technology, Republic of Korea
{1wonjune727, 1jhkim}@yonsei.ac.kr, 2hschoi@imrc.kist.re.kr
Abstract
This paper proposes a method to construct a strong
fingerprint liveness detector using a SVM-based
ensemble classifier. Image texture-based static features
are employed for the liveness detection, and support
vector machine (SVM) classifiers are separately built
for each static feature. The SVM classifiers are
combined to an ensemble classifier using AdaBoost
algorithm. Performance of our proposed approach is
evaluated using LivDet 2013 database. The
experimental results show that our proposed approach
can achieve higher generalization performance than
other general SVM-based liveness detectors.
Keywords: fingerprint, liveness detection, SVM,
AdaBoost.
1. Introduction
Fingerprint recognition which is widely employed
for user authentication is exposed to spoof attack by
artificial fingerprints. Matsumoto et al. [1] introduced
how to create gummy fingers and showed that the
fingerprint recognition systems were easily fooled by
using artificial fingerprints. To protect the fingerprint
recognition against the spoof attack, a number of
approaches on fingerprint liveness detection have been
proposed [2]. Among them, static feature based
liveness detection distinguishes live fingerprints from
artificial fingerprints using only a single fingerprint
image. These static feature-based approaches are
simply adoptable to commercial fingerprint recognition,
whereas they generally provide limited performance in
practical application.
To overcome the limitation, previous researches
exploited multiple static features [3]. These approaches
can achieve higher performance than using single static
feature, whereas additional process to find an optimal
feature combination is required before constructing a
classification model. This feature selection process

increases computational load, and makes it difficult to
incrementally upgrade the existing classifier. This
paper proposes a new method to construct a strong
liveness detector. Representative textural features [3-5]
are employed to construct a liveness detector. SVM is
used to build classifiers for each static feature, and the
constructed classifiers are combined to a strong
ensemble classifier using AdaBoost. The ensemble
classifier using AdaBoost with SVMs can achieve high
generalization performance [6]. Moreover, by the
AdaBoost algorithm, optimal combination of the
classifiers can be found without additional process such
as feature selection in the feature-level fusion approach.
The performance of proposed approach is evaluated
in a public database of LivDet 2013 [7] is employed.
The experiment shows that our proposed method can
provide a promising result.
The remainder of this paper is organized as follows:
In Section 2, the static features employed in the
proposed approach are introduced. Framework of the
proposed liveness detection method is given in Section
3. Experimental results are shown in Section 4. Finally,
conclusion of this works is described in Section 5.
2. Texture-based static feature

Artificial fingers are difficult to be finely created,
and their surface is commonly coarser than the live
fingers. Therefore, the artificial fingerprint images have
low contrast between ridge and valley, and include
noise in the valley [3]. These textural characteristics of
the artificial fingerprints can be observed by using the
texture-based static features. Our proposed method
exploits 5 texture-based features: local clarity score [4],
local orientation quality [4], directional contrast [3],
first-order histogram [5], and power spectrum [3].
- 158 -
ICEIC 2015
3. Liveness detection using SVM-based

ensemble classifier
To construct a liveness detector providing high
performance, SVM classifiers for each employed
feature are constructed separately, and combined to an
ensemble classifier using AdaBoost. X. Li et al. [6]
introduced a method to exploit the RBF kernel-based
SVM classifiers (RBFSVM) as component classifiers
of AdaBoost. Since our approach exploits 5 different
classifiers based on 5 texture-based features, in each
iteration of AdaBoost, a classifier having highest
classification accuracy among the 5 classifiers is
selected as a component classifier of a final ensemble
classifier. Flow of our approach to construct an SVMbased ensemble classifier is described in Figure 1.
Power
spectrum
5.9
(6.3/5.4)
9.7
(2.0/17.4)
19.4
(9.4/29.3)
Featurelevel fusion
3.6
(4.8/2.4)
5.0
(2.7/7.2)
18.5
(12.5/24.5)
Proposed
approach
3.1
(2.9/3.2)
4.2
(4.7/3.6)
18.4
(14.4/22.4)
The liveness detection performance can be

improved when multiple features are exploited.
Moreover, the proposed approach achieves better
generalization performance than the feature-level
fusion based classification model on all test datasets.
5. Conclusion
This paper proposes a method to construct a strong
liveness detector using SVM-based ensemble classifier.
The experimental result shows our proposed method
achieves high generalization performance. In the future,
additional static features are exploited to separate the
artificial fingerprints of high quality more accurately.
Acknowledgements
This work has been supported by Institute of BioMedIT, Energy-IT and Smart-IT Technology (BEST), a
Brain Korea 21 plus program, Yonsei University.
Figure 1. Flow chart of proposed liveness detector
4. Experimental result
For the performance evaluation, the public database
of Fingerprint Liveness Detection Competition 2013
(LivDet 2013) is exploited [7]. This database is
composed of 4 different sub-datasets which are
constructed using 3 optical sensors (Biometrika,
Italdata, and Crossmatch) and 1 swipe sensor. Among
these sub-datasets, three sub-datasets constructed using
the three optical scanners are exploited for the
performance evaluation. The liveness detection
performance is estimated using Total Error Rate (TER)
which is introduced in LivDet 2013 [7]. Table 1 shows
the liveness detection performance on the three datasets.
Table 1. Performance evaluation
Local
clarity
score
Local
orientation
quality
Directional
contrast
First-order
histogram
Biometrika
Italdata
Crossmatch
TER (%)
TER (%)
TER (%)
14.5
(14.0/14.9)
17.9
(8.1/27.6)
42.9
(47.9/37.8)
46.9
(48.6/45.2)
37.6
(50.8/24.3)
41.4
(50.4/32.3)
10.7
(9.8/11.6)
27.1
(10.9/43.2)
36.2
(26.7/45.6)
17.7
(17.4/18.0)
18.5
(18.4/18.5)
49.2
(97.7/0.7)
References
[1] T. Matsumoto, H. Matsumoto, K. Yamada, and S.
Hoshino, Impact of artificial gummy fingers on fingerprint
systems, in Optical Security and Counterfeit Deterrence
Techniques IV, Proc. SPIE 4677, pp. 275289 (2002).
[2] Schuckers, Stephanie AC. "Spoofing and anti-spoofing
measures." Information Security technical report 7.4, pp. 5662 (2002).
[3] Choi, Heeseung, et al. "Fake-fingerprint detection using
multiple static features." Optical Engineering 48.4, 047202047202 (2009).
[4] Galbally, Javier, et al. "A high performance fingerprint
liveness detection method based on quality related features."
Future Generation Computer Systems 28.1, pp. 311-321
(2012).
[5] A. Abhyankar and S. Schuckers, Fingerprint liveness
detection using local ridge frequencies and multiresolution
texture analysis techniques,in 2006 IEEE Int. Conf. on
Image Processing, pp. 321324 (2006).
[6] Li, Xuchun, Lei Wang, and Eric Sung. "AdaBoost with
SVM-based
component
classifiers."
Engineering
Applications of Artificial Intelligence 21.5, pp. 785-795
(2008).
[7] Ghiani, Luca, et al. "LivDet 2013 fingerprint liveness
detection competition 2013." Biometrics (ICB), 2013
International Conference on. IEEE, 2013.
- 159 -
FO-1-2-2
Lattice Sphere Detection Techniques with Special

Channel Matrices for Wireless Communication
Systems
School of Electrical System Engineering
University Malaysia Perlis(UniMAP)
02600 Arau, Malaysia
Email: mahmoudam@unimap.edu.my
AbstractThis paper presents the effects of condition number

( ) in communication system performance. It has been shown
that a small condition number ( ) results a better performance.
This research aims to reduce the condition number ( ) value to
its smallest possible using special kind of matrices with Lattice
Sphere Detection (LSD) technique for Block Data Transmission Systems (BDTS). Toeplitz and Hankel matrices are used
separately as a channel matrix (H) while circulant matrix is
used in the previous works. The proposed scheme reduced
the condition number ( ) and, therefore, improve the system
performance. As a result; LSD-based BDTS with Toeplitz/Hankel
matrix outperforms the LSD-based BDTS with circulant matrix.
Index Termslattice sphere detector (LSD), condition number,
Circulant matrix, Hankel matrix, Toeplitz matrix, and block data
transmission system.
I. I NTRODUCTION
A block-by-Block data transmission scheme is an efficient
way to transmit data over time dispersive channels that reduces
Inter-Symbol Interference (ISI) [1]. In block data transmission
systems (BDTS), data symbols are separated by zero symbols
(known symbols), which confine the ISI within the block. Its
well known that the Maximum Likelihood Block Detection
(MLBD) technique offers the optimum solution for BDTS but
its complexity grows exponentially with the size of transmitted
data. Lattice Sphere Detection (LSD) technique serves as an
alternative technique to reduce complexity [2]. In [2], [3], LSD
technique has been used for BDTS detection. Actually, LSD
technique searches for the constellation point of the received
signal that is confined within a sphere with a predetermined
radius d [4].
It is well known that the generator matrix plays a crucial role
in the structure of lattice space [6]. In previous works [1], [2],
[3], circulant generator matrix has been used. One of main
drawbacks of the previous works [2], [3] is the high condition
number ( ). A problem with high condition number ( ) is
said to be ill-conditioned which causes a worse probability
of bit-error-rate (BER) as compared to the exhaustive search
technique. Condition number ( ) measures the worst-case
sensitivity of an input data to small perturbation. A general
theory of condition numbers was first given by Rice [8] in
1966. In [7], it has been shown that the condition number ( )

influences affects the performance of MIMO system since it
is a measure of how the original constellation is distorted by
the channel. The condition number ( ) is formed by taking
the ratio of the maximum to minimum singular values of the
channel matrix [5].
The proposed scheme aims to reduce the condition number
( ) of detection system. The main contribution of this paper
is the usage of special matrices to reduce the condition number
of the detection system. Two special matrices structures had
been used; Toeplitz and Hankel. Toeplitz matrix is a matrix
with equal values along the diagonal while matrix is called
Hankel if the elements that belong to a given reverse diagonal
of the matrix are equal [11].
At the end of this paper, it has been shown that the condition
number ( ) effects the BDTS system performance.
The reminder of this paper is organized as follows: Section
II is a background of condition number and special matrices,
lattice sphere detection technique, and radius selection. Section
III proposes special matrices as channel matrices with LSD
technique which are Hankel and Toeplitz matrices. Section
IV provides performance analysis and shows the affects of
condition number ( ) on the system performance. Section V
results and discussion. Section VI concludes the paper.
II. BACKGROUND
A. Description of Lattice Sphere Detection Technique
Fig. 1 shows the block diagram of the proposed LSD-based
BDTS. The block diagram consists of a transmitter, channel
matrix, and receiver. In transmitter, data are taken as blocks
of input to transmitting filter. Transmission path is modeled
as a channel matrix which contains the cyclic prefix. Noise is
assumed to be Additive White Gaussian Noise (AWGN) with
zero mean and average noise power spectral density (PSD)
N0 /2 (V olts2 /Hz). As shown in Fig. 2, in LSD technique,
the search can be restricted to be within a sphere around the
received signal [2], [4]. The sphere should be small enough to
enclose at least one lattice point or ML solution. The search
space is therefore drastically smaller than the ML search space
which consists of cn points for a c-ary signal constellation [9].
- 160 -
ICEIC 2015
into orthogonal matrix Q (i.e., QT Q = I) and upper triangular
matrix R as shown in Eq. 3.
r11

= Q
Fig. 1. Lattice Sphere Detection (LSD) technique based BDTS
0
.
.
.
.
.
.
0
r12
r22
..
.
..
.
..
.
..
..
..
.
0
r1n
r2n
.
.
. = QR
.
.
.
rnn
(3)
Let y = Rx + %, where y = QT y, % is the AWGN, and y

is the reduced form of Eq. 1 [10]. The LSD technique can be
solved the ML detection problem as
0
x = argxk minky Rxk k2
(4)
where is the restricted search area. As shown in Fig.

2, lattice sphere detector searches all vectors, xk , which
satisfy the spherical constraint in Eq. 5.
0
2

d2 y Rxk
(5)
0
2

y Rxk =
Fig. 2. Idea behind Lattice Sphere Detection (LSD) Technique
h0
h1
..
.
..
.
..
H=
.
.
..
.
..
.
..
0
(1)
0
h0
..
.
0
..
.
..
.
hq1
0
..
.
hq2
hq1
..
.
..
.
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
..
.
0
..
..
.
hq1
..
.
hq2
..
.
hq3
..
(6)
Assume that the channel impulse response (CIR) h =

[h0 , ........., hq1 ]T is available at the receiver and the channel
is invariant at least during one block transmission. Superscript
T denotes the transpose operation, and parameter q denotes the
channel length. Let x = [x0 , ........., xn1 ]T be the modulated
vector and y = [y0 , ........., yn1 ]T be the received vector. If
the length of the guard symbol L satisfies L q 1, the linear
convolution performed by the channel will be identical to the
circular convolution and the received vector will be given as
y = Hx +

2

n
0 X

yi
rij xj

j=i
i=nk+1
n
X
h1
h2
..
.
..
.
..
.
(2)
..
.
..
.
..
.
h0
where H is the generator matrix of dimension n n which

has been used as a circulant matrix in [2], [3].
To reduce the mathematical computations, apply QR decomposition on the generator matrix H, and decompose the matrix
- 161 -
where rij , xj and yi are the (i, j)th entry of R, j th entry

0
of x, and ith entry of y , respectively, while n is the length of
the basis vector. Thus, Eq. 1 can be written as
0
2
d2 yn rn,n xn +
0
2
yn1 rn1,n xn rn1,n1 xn1 +
(7)
B. Condition number
The condition number ( ) of a matrix measures the sensitivity of the solution of a system of linear equations to any
change in the data. Example 1, depicts the ideas:

1 1000 w
1
w
1
=
=
0
1
z
0
z
0
By changing the right side data slightly (0 is moved to 0.01),
the solution will be as

1 1000 w
1
w
9
=
=
0
1
z
0.01
z
0.01
A little change guide to a completely different answer. In
communication systems, there is no guarantee that the received
data will be without changes. The condition number ( ) of a
matrix H is deterministically calculated as

Emax
=
= kHk H 1
(8)
Emin
where Emax and Emin are the maximum and minimum
singular values of the matrix, respectively. The singular values
of a matrix H are the square roots of the eigenvalues of the
symmetric n n matrix H T H. The minimum and maximum
ICEIC 2015
singular values of the matrix in example 1 is 0.001 and 1000,
respectively. So, the condition number ( ) is equal to 106 .
The objective of this paper is to get a smaller condition number
( ) that improves the system performance by using special
matrices.
C. Description of Special Matrices
Matrices with special structure such as Hankel and Toeplitz
arise in many applications in engineering and science [11].
Matrix is called a Hankel matrix (or catalecticant matrix) if
the elements that belong to a given reverse diagonal of the
matrix are equal. The general structure of Hankel matrix is
given in [11] as
a0
a1
ap1
a1
a2
ap
a2
a
3
p+1
A=
(9)
..
..
..
.
.
an1p anp an2
A Toeplitz matrix is a nother matrix with equal values along
the diagonals [11]. A general form of an n n Toeplitz matrix
is shown below:
a0
a1
a2 an1
..
..
a1
.
a0
a1
.
.
.
A = a2
(10)
.
a2
a1 a0
.
..
..
..
..
..
.
.
.
.
an+1 a2 a1
a0
Toeplitz and Hankel matrices are considered as symmetric matrices. Symmetric matrices are square matrices whose
transpose equals the matrix itself [5].
D. Mechanism of Radius Selection
As mentioned in section 1, the selection of the initial
radius (d) is very crucial. Improper initial radius selection
results in higher computational complexity and lower system
performance or the system fails to get the correct solution [10],
[14].
It has shown in [13], the selected initial radius (d) for the
LSD-based BDTS is given as
d=
nPavg =
n 2
(11)
Eq. 11 shows the dependency of the initial radius on block

data size (n), SNR (), and the noise variance ( 2 ).
III. P ROPOSED L ATTICE S PHERE D ETECTION T ECHNIQUE
WITH S PECIAL MATRICES
In this section, we propose to use two special matrices as
a channel matrix for LSD-based BDTS. The aim of using
these matrices is to reduce the condition number ( ) and,
hence, improve the system performance. Performance analysis
is shown in section IV.
A. Hankel matrix
As mentioned in section II, Hankel matrix is symmetric.
We can take advantage of the fact that for any symmetric
matrix, there is an orthonormal basis of eigenvectors (with
real eigenvalues). The matrix with orthonormal basis has a
small value of condition number ( ). As mentioned in section
I, a matrix with small condition number ( ) is called wellconditioned and, therefore, results a good system performance.
Since Hankel matrix is symmetric and has a small condition
number, we propose to use the Hankel matrix as a lattice
generator matrix (H) instead of circulant matrix in Eq. 2. The
entry elements below the main skew diagonal are equal to 0
as
(
0
i+j1>n
Hij =
(12)
i + j 1 otherwise
So, the proposed channel matrix in Hankel structure is given
as
h0
00
..
.
H = 0
hq1
hq2
..
.
h1
0
hq1
0
hq1
hq2
hq1
hq2
hq2
h1
h1
0
0
hq1
hq2
hq1
hq2
h1
hq2
h1
0
h1
0
0
h1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
h1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
(13)
h1
0
0
In order to reduce the mathematical computations, apply QR

decomposition on this generator matrix H, and decompose the
matrix into orthogonal matrix Q (i.e., QT Q = I) and upper
0
triangular matrix R as shown in Eq. 3. Let y = Rx + %, where
0
0
y = QT y, % is the additive noise, and y is the reduced form of
Eq. 1 [10]. As shown in Section 2, the LSD technique searches
for the nearest solution inside a sphere within a predetermined
radius (d). Therefore, the ML solution can be computed as
0
2
d2 yn rn,n xn +
0
2
+ yn1 rn1,n xn rn1,n1 xn1 +
0
(14)
where rij , xj and yi are the (i, j)th entry of R, j th entry

0
of x, and ith entry of y , respectively, while n is the length of
the basis vector. It is well known that LSD technique has an
iteration process. This iterations are the results of inequality
constrains in Eq. 14 where we set xn to be the closest number
in the modulation alphabet (i.e., modulation alphabet in BPSK
is {1, 1}) that solves this inequality. The initial searching
radius is shown in Eq. 11. After each iteration, the solution,
say x(1) , is stored and d2 is updated using the new x(1) as
0
2

y

R
2
(1)

d =
x
(15)
Inn
0
2
The process is then repeated from the beginning.
- 162 -
ICEIC 2015
B. Toeplitz matrix
As mentioned in section I, Toeplitz matrix is a matrix with
equal values along the diagonals and it has constant values
along negative-sloping diagonals. Toeplitz matrix is called
a persymmetric matrix which is symmetric in the reverse
diagonal [12]. So, it has a small condition number which
produces a good system performance. The proposed generator
matrix in Toeplitz structure is shown below:
h
0
0
h
h
0
.
.
.
0
H =
h
q1
.
..
..
.
h1
q1
h0
0
..
.
0
..
.
..
.
h2
0
h0
0
..
.
..
..
..
.
..
0
..
.
h0
0
..
.
0
h0
h0
0
.
hq1

kx x
k
1
H 1 krk
kxk
kxk
h2
.
.
.
hq1
..
.
..
.

kHk H 1 krk
kx x
k
kxk
kSk
(16)
krk
kx x
k
kxk
kSk
IV. P ERFORMANCE A NALYSIS

The main objective of this section is to provide a mathematical expression for BER performance in terms of condition
number ( ). Let x be the transmitted signal and x
be the
estimated signal. Modulated signal (S) is given as
(18)
Here r is very small if x

is very near to x. However, the
converse may be false [5].
If H is an nn matrix and x is any vector with n components,
then Hx is a vector with n components. We now take a norm
of the vectors such that they becomes kxk and kHxk. It was
proven in [5] that there is a number F (depending on H), such
that
kHxk F kxk
(19)
According to [5], by taking the best possible (smallest value)
F = kHk, we have
(20)
Since S = Hx, then substituting into Eq. 20 we have

kSk kHk kxk
xk
small, it implies a small relative error kx
kxk . Therefore, the
system is well-conditioned.
One important measure of the noise immunity of a signal
set is the minimum distance between signals, defined as
min kHx H x
k [16]. From Eq. 18, krk = kHx H x
k and
rewriting Eq. 26 gives
krk =
(17)
The difference between the transmitted and received signal

(r) is given as
kHxk kHk kxk
(26)
The relationship in Eq. 26 shows that the received signal

krk
and condition number ( ). If is
can be obtained from kSk
Now, apply Eq. 14 and Eq. 15 to find the closest lattice point.
r = S Hx
= H(x x
)
(25)
Looking
back
in Eq. 8 where the condition number =
kHk H 1 . Thus, substituting Eq. 8 into Eq. 25, yields
0
h0
S = Hx
(24)
Substitute Eq. 22 in Eq. 24,
hq1
..
.
h0
..

Thus kx x
k H 1 krk. Divide both sides by kxk,
(21)
kx x
k
kSk
kxk
(27)
Probability of bit error rate (PBER ) in [16] is given as

krk
kHx H x
k
= KQ
(28)
PBER = KQ
2
2
where K is a constant. Now, substituting Eq. 27 into Eq.
28, we produce a new term for performance as

PBER KQ
kx x
k kSk
2 kxk

(29)
From Eq. 29, if the condition number ( ) is large, then PBER

is large and vice versa. Therefore, Eq. 29 shows the relationship between BER performance and the condition number
( ). Therefore, this showed that if the condition number ( )
is small, the system has a good performance and vice-versa.
For a complete analysis, it was shown in [15] that the error
probability for antipodal signaling (BPSK) is

2
(30)
PBER = KQ
Dividing Eq. 21 by kSk kxk produces

kHk kxk
kSk
kSk kxk
kSk kxk
kHk
1
kxk
kSk
(22)
Eq. 18 can be rewritten as x x

= rH 1 . Following the norm
property, as in Eq. 20, we have
1 1
rH H krk
(23)
where is SNR. From Eqs. 29 and 30, we can conclude the

relationship between and condition number ( ) as

2
k kSk
1 kx x
(31)
=
2
2 kxk
Eq. 31 shows an inverse relationship between and condition
number ( ), which means that the power of the received signal
is smaller once the condition number ( ) increases.
- 163 -
ICEIC 2015
V. R ESULTS AND D ISCUSSION
The usage of Hankel/Toeplitz as a channel matrix is useful
since it reduces the condition number and, therefore, improves
the system performance. This section presents the results of
the usage of Hankel and Toeplitz matrices for the different
channels. For equal comparison, the system in this work
considers two channel models similar to than in [1], [2].
The first channel impulse response (CIR) is presented by
channel A: [0.2294 0.4588 0.6882 0.45882 0.2294] which
exhibits strong amplitude distortion [1]. The second channel is
presented as channel B: [0.227 0.460 0.688 0.460 0.227], with
strong amplitude distortion and spectral characteristic which
exhibits spectral null [2]. The baseband data with random
blocks of size 20 bits using channel A and 16 bits using
channel B are transmitted 108 times.
Table I depicts the calculated condition numbers ( ) for
different channel matrices. As shown in Figs. 3 and 4, the
with Hankel matrix has better performance of the LSD with

circulant matrix. If the value of condition number is small,
then the value inside the Q-function will be large (as shown
in Eq. 29). Therefore, the BER will be small and vice-versa. In
TABLE I
C ONDITION
NUMBER FOR DIFFERENT CHANNELS USING SPECIAL

MATRICES
Channel Matrix
Hankel
Toeplitz
Circulant
Channel A
53.3228
10.1415
291.97
Channel B
40.4605
10.1138
138.345
Fig. 4. Performance analysis of LSD with different generator matrices using

channel B
Fig. 3, LSD with Toeplitz matrix has approximately 2dB SNR

advantage against the LSD with circulant matrix and 0.4dB
against the LSD with Hankel matrix at BER = 102 .
In Fig. 4, LSD with Toeplitz matrix has approximately 1.7dB
SNR advantage against the LSD with circulant matrix and
0.6dB against the LSD with Hankel matrix at BER = 104 .
VI. C ONCLUSION
This paper proposes LSD technique with two special matrices. The first matrix is Toeplitz matrix, whereas the second
is Hankel matrix. It is shown that LSD with Toeplitz matrix
has the smallest condition number and, therefore, has the best
system performance. In this paper, we also found the exact
relationship between LSD performance, condition number, and
initial radius selection with condition number. Subsequently,
we found the exact relationship between radius selection and
condition number.This finding leads to the convergence to the
known fact concerning the trade off between performance and
complexity.
Fig. 3. Performance analysis of LSD with different generator matrices using
channel A
ACKNOWLEDGMENT
LSD detector having the smallest condition number produces

better performance. In other words, the LSD with Toeplitz
matrix has better performance than others. Sequentially, LSD
I would like to thank the University Malaysia Perlis

(UniMAP) and Ministry of Higher Education Malaysia for
the financial support.
- 164 -
ICEIC 2015
R EFERENCES
[1] SPK. Babu, M. F. M. Salleh and F. Ghani, Reduced complexity
optimum detector for block data transmission systems, IEICE Elctron.
Express (ELEX), vol. 6, no.23, pp. 16491655, 2009.
[2] X. Li and X. Cui, Application of lattice code decoder to SC-CP for
short block length, Electronics Letters, vol. 40, no.15, pp. 954955,
2004.
[3] M. A. M. Albreem, M. F. M. Salleh, and SPK. Babu, Reduced
complexity optimum detector for block data transmission systems using
lattice sphere decoding technique, IEICE Electron. Express (ELEX),
vol. 8, no.9, pp. 644649, 2011.
[4] L. G. Barbero and J. S. Thompson, Fixing the complexity of the
sphere decoder for MIMO detection, IEEE Transactions on Wireless
Communications, vol. 7, no. 6, pp. 2131-2143, 2008.
[5] E. Kreyszig, Advanced Engineering Mathematircs, 10th edition, John
Wiley & sons, Inc., pp. 861867 2011.
[6] J. H. Conway and N. J. A. Sloane, Sphere packings, lattices and goups,
Springer, 1999.
[7] S. Roger, A. Gonzalez, V. Almenar, and A. Vidal, MIMO Channel
Matrix Condition Number Estimation and Threshold Selection for
Combined K-Best Sphere Decoders, IEICE Transactions on Communications, vol. E92-B, no. 4, pp. 13801383, 2009.
[8] D. J. Higham, Condition numbers and their condition numbers, Linear
Algebra and its Application, vol. 214, pp. 193213, 1995.
[9] T. Cui and C. Tellambura, An efficient generalized sphere decoder for
rank-deficient MIMO systems, IEEE Communication Letters, vol. 9,
no.5, pp. 423425, 2005.
[10] B. Hassibi and H. Vikalo, On the sphere-decoding algorithm i. Expected
complexity, IEEE Transactions on Signal Processing, vol. 53, no.8, pp.
28062818, 2005.
[11] S. A. Dianat and E. S. Saber, Advanced Linear Algebra for Engineers
with MATLAB, 1st ed., CRC Press, 2009.
[12] G. Ramamurthy, Left circulant and generator type matrices, Report
No: IIIT/TR/2009/155, Centre for Security, Theory and Algorithms
International Institute of Information Technology, India, July 2009.
[13] M. A. M. Albreem and M. F. M. Salleh, Near-An -Lattice Sphere
Decoding Technique Assisted Optimum Detection for Block Data Transmission Systems, IEICE Transactions on Communications, vol. E96-B,
no. 1, pp. 356359, 2013.
[14] L. Yang, R. S. Chen, K. K. Soo, and Y. M. Siu, An efficient sphere
decoding approach for PTS assisted PAPR reduction of OFDM signals,
), vol. 61, pp. 684688, 2007.
Int. J. Electron Commun (AEU
[15] D. Tse and P. Viswanath, Fundamental of Wireless Communication,
Cambridge University Press, 2005.
[16] E. A. Lee, Digital Communication, Kluwer Academic, 1994.
- 165 -
FO-1-2-3
A Vision-based Automatic Detection Algorithm for Dairy Cows in

Free-stall Barns
Suthasinee Nopparit 1, Nattapon Pantuwong 2, Kitsuchart Pasupa 3
Faculty of Information Technology
King Mongkuts Institute of Technology Ladkrabang Bangkok,
Thailand 10520
suthasinee.nop@gmail.com, natapon@it.kmitl.ac.th, kitsuchart@it.kmitl.ac.th
technical staff to maintenance the system.
Moreover, there is a risk to reduce the production
of milk on cows because the sensor could annoy
cows.
(ii) Vision-based approach: This approach
requires less cost comparing to the sensor-based
method. Porto and her colleagues analyzed dairy
cow lying behavior from video using the ViolaJones algorithm [2]. This method requires a
background (image without cows) to train a model
to detect cows. Hence, it has to be trained every
time the system is moved to other barns.
Comparing both approaches, vision-base
techniques have more potential to be used for dairy
cows behavior detection. The goal of this study is
to create an automatic system for detection and
analysis of dairy cows behavior by using visionbased techniques. In this work, we propose a
technique and mainly focus on dairy cows detection
in free-stall barns. The technique does not required
fixed environment.
Abstract
Behaviors of dairy cow represent their health
and emotions. The behavior analysis in video
surveillance is a technique which helps farmer to
observe cows activities. Our study aims to create
an automatic system for cow detection in a freestall barn by vision technique. This paper proposes
a technique that detects dairy cows from top view
of the barn. The foreground is separated from
background on sequences of images (1 frame per
10 seconds). Our proposed method does not
require a fix environment as previous work. The
overall accuracy of correct detection is 76.75%.
Therefore, our proposed algorithm is feasible to
detection cows in free-stall barns.
Keywords: dairy-cow, detection, vision-based
1. Introduction and related works

Dairy farming has been an important part of
agriculture industry. It mainly produces milk which
is important for human life. Most of dairy farms try
to observe dairy cows behaviors to maintain their
good state. Currently, it requires human to observe
and analyze the cows behaviors. The person has to
be well-trained and experienced. In fact, human
cannot manually observe every cow in farm all days
and nights. This is laborious and expensive.
Consequently, several researchers tried to develop
automatic systems that can recognize cows
behavior with less human effort e.g. [1,2].
Currently, there are two main approaches which can
be used to observe cows behavior.
(i) Sensors-based approach: an example of this
approach is the so-called Moo monitors system
[1]. The device is needed to be attached or hanged
on every cow. The sensors will sense cows
activities. The data will be automatically send over
to server and analyzed. This approach is expensive
as it requires at least a sensor on every cow and
2. The proposed algorithm

The proposed vision-based automatic detection
algorithm for dairy cows in free-stall barns could be
divided into five steps (as shown in Figure 1) as
follows:
Input Image
Foreground
Detector
Image
Processing
Blob
Analysis
Output
Image
put mage
Figures 1: Overview of proposed algorithm

1.
- 166 -
Input images are collected from an attached

camera with fisheye lens at the top of a barn
to capture dairy cows images (1 frame per
10 seconds).
ICEIC 2015
(a)
(d)
(b)
(c)
(e)
Figures 2: (a) The result from foreground detector. (b) Dilation and Erosion processing. c) Blob analysis
process. d) Dairy cows are detected. e) Accuracy of the proposed algorithm.
2.
3.
4.
5.
and background color. Therefore, we remove the

captured frame with such problems. This leads to
an improvement of the accuracy to 90%.
According to the experimental result, we could
understand the effect of each tuning parameter and
set up the environment, which could guarantee the
best performance in real environment.
Foreground detector based on Gaussian

mixture models (GMMs) is used to separate
background and moving objects (here, dairy
cows) as shown in Figures 2(a).
It should be noted that, in some cases, dairy
cows colors can be similar to
backgrounds colors. We then apply the
erosion and dilation operators to the
original image, in order to make the object
to be clearer as shown in Figures 2(b).
Blob analysis is applied to interpret the
detected areas to region of dairy cows area.
The blobs will be disposed if they are less
than target value as they are expected as not
relevant area. While they will be expanded
to the standard size of cow if the blobs are
greater than the threshold. Example of
interpreter step is shown in Figures 2(c).
The detection dairy cows areas are
labelled in output images using visionbased automatic detection algorithm as
shown in Figures 2(d).
4. Conclusions
In this paper, we present the vision-based
algorithm to detect the presence of dairy cows in
free-stall barns. The proposed method does not
require a fix environment as previous work. We
also propose the condition of the environment to
provide the best performance of the proposed
algorithm.
References
[1] Daily Master Co.,Ltd. Moo monitors system,
http://www.dairymaster.com/heat-detection/
3. Experimental Result
[2] Simona M.C. Porto, Claudia Arcidiacono,

Umberto Anguzza, Giovanni Cascone. A
computer vision-based system for the automatic
detection of lying behavior of dairy cows in freestall barns, Biosystems Engineering, 15(2), pp.
184194, 2013.
Our proposed algorithm was applied to 800

image frames. Figure 2(e) shows the accuracy of
the proposed algorithm on different values of
standard deviation (SD) of GMM and minimum
blobs. It is clear that, the case with SD=50 yields
the best overall performance.
The primary causes of fault detection are light
condition variation and the similarity of cows color
- 167 -
FO-1-2-4
Flickering Artifact Reduction Method in Video Contrast Enhancement

Jin Wook Park, Hyeon Seok Yang and Young Shik Moon1
Dept. of Computer Science and Engineering, Hanyang University
fnregia@gmail.com, hsyang@visionlab.or.kr, ysmoon@hanyang.ac.kr
Abstract
In this paper, we propose the method to reduce
flickering artifact in video contrast enhancement. The
whole process of the proposed method is similar to
FGLG(Fast Gray-Level Grouping). However the
proposed method performs group range smoothing
phase, because grouping of FGLG causes flickering
artifact. In experiment, the proposed method is
compared with FGLG and demonstrates the
performance of enhancement and flickering artifact
reduction.
limit of each group(i.e. each group range) between

similar frames is changed because grouping of FGLG is
sensitive to subtle change of histogram. The change of
grouping causes vibration of group range. This
vibration of group range matches same intensity to
different intensity between similar frames. The
intensity difference is extremely visible in static regions
and in this case human senses flickering effects.
Keywords: Video contrast enhancement, Gray-Level

Grouping, Flickering artifact
1. Introduction
Contrast enhancement is the one of the important
issue of the computer vision. Recently, Chen et al
propose GLG(Gray-Level Grouping) that performs
optimized image contrast enhancement automatically
and also introduce FGLG(Fast Gray-Level Grouping)
for high performance[1]. Although GLG can adjust the
level of histogram, grouping process is sensitive to
subtle change of histogram. In addition GLG is
designed for single image and depends on grouping to
construct transformation function. It means brightness
intensity between similar frames can abruptly change
and actually GLG causes flickering artifact while video
contrast enhancement.
In this paper, we propose the flickering artifact
reduction method in video contrast enhancement. The
proposed method is based on FGLG and improves
FGLG through group range smoothing.
2. Proposed Method
FGLG makes 20 groups to construct transformation
function using histogram. However the left and right
1
Fig 1. Flow chart of proposed video enhancement

(group range smoothing (the gray box) is the
contribution of the proposed method)
The proposed method performs group range
smoothing to prevent frequent change of group range.
Fig 1 shows the flow chart of the whole proposed
method. Group range smoothing phase(the gray box of
Fig 1) is main contribution of the proposed method. In
the group range smoothing phase, the proposed method
estimates group range at frame t-2 using 1 calculated
group range at frame t-3 and 2 observed group ranges
at frame t-1 and t. Estimating group range of frame t-2,
the proposed method calculates 2 candidates for group
range of frame t-2. The first candidate is the average of
group range between frame t-3 and frame t-1 and the
second candidate is the average of group range between
frame t-3 and frame t(the initial group range of frame t3 is the observed group range). Finally, the proposed
method selects the minimum of 2 candidates to the
group range at frame t-2. Output frame is delayed
corresponding author
- 168 -
ICEIC 2015
because the output frame is frame t-2 when the current
frame is frame t. Fig 2 shows the result of the group
range smoothing.
difference of original frames. Accordingly the flicker

artifact is reduced in the result of the proposed method.
We measure the flickering artifact of FGLG and the
proposed method using the flickering[2]. Fig 4 shows
flickering scores in each frame.
Fig 2. Left limit of 19th group(thin line: FGLG, bold

line: the result of group range smoothing)
Fig 4. Flickering score of FGLG and the proposed

method
High flickering score means that the average intensity

of smoothing area of the frame is changed highly and
vice versa. The flickering score of the proposed method
is lower than the flickering score of FGLG in general.
In the experiment, we use a low contrast video and

FGLG to compare performance with the proposed
method. Fig 3 shows results of enhancement.
4. Conclusion
(a)
(b)
(c)
(d)
(e)
(f)
In this paper, we propose the flickering artifact

reduction method in video contrast enhancement. The
proposed method enhances each frame using FGLG
and improves flickering artifact problem of FGLG
using group range smoothing. In experiment, we
compare the flickering score of the proposed method
and FGLG. As a result, the proposed method
demonstrates lower flickering score than FGLG and
shows a high contrast result similar to the result of
FGLG.
(g)
(h)
(i)
Fig 3. 121 frame, 122 frame and scaled difference
image between 121 and 122 frame from left side to
right side. Top row is original frames, middle row is
results of FGLG and bottom row is results of the
proposed method
Enhanced results of FGLG(d and e of Fig 3) and the
proposed method(g and h of Fig 3) are similar visually.
However the scaled difference image of FGLG(f of Fig
3) and the proposed method(i of Fig 3) are different.
The scaled difference image is difference image
between 121 and 122 frame multiplied by 3(for high
resolution). F of Fig 3 shows global intensity change
between d and e of Fig 3. This change causes the
flickering artifact. On the other hand, i of Fig 3 shows
that the difference is very small and similar to the
Acknowledgment. This work was supported by the National

Research Foundation of Korea(NRF) grant funded by the
Korea government(MEST) (No. 2012002464).
References
[1] Z. Y. Chen, B. R. Abidi, D. L. Page and M. A. Abidi,
"Gray-level grouping (GLG): an automatic method for
optimized image contrast Enhancement-part I: the basic
method," IEEE Transactions on Image Processing, vol. 15,
no. 8, pp. 2290-2302, Aug., 2006.
[2] J. Y. Yang, J. B. Park and B. W. Jeon, Flickering effect
reduction for H.264/AVC intra frames," Proceedings of SPIE
- the International Society for Optical Engineering, vol. 6391,
Oct., 2006.
- 169 -
FO-1-2-5
Bag-of-Audio-Words Feature Representation Using GMM Clustering

for Sound Event Classification
Hyungjun Lim, Myung Jong Kim, and Hoirin Kim
Department of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST)
{hyungjun.lim, myungjong, hoirkim}@kaist.ac.kr
Abstract
This paper addresses the problem of sound event
classification, focusing on feature representation methods.
Sound events such as screaming and glass breaking show
distinctive temporal and spectral characteristics. Therefore,
extracting appropriate features to properly represent these
characteristics is important in achieving a good
performance. In this paper, we employ bag-of-audio-words
feature representation, which is a histogram representation
of frame-based features, to characterize the time-frequency
patterns in the long-range segment of a sound event. In the
method, Gaussian mixture model-based clustering is
adopted to deal with the inconsistent dynamic range among
frame-based features. Test sounds are classified by using a
support vector machine. The proposed method is evaluated
on a database of several hundred audio clips for fifteen
sound events and the classification results show over 41%
relative improvements compared to conventional bag-ofaudio-words representation methods.
Keywords: Bag-of-audio-words, Gaussian mixture model
(GMM) clustering, sound event classification.
1. Introduction
Sound events are good descriptors in recognizing and
understanding circumstances. In an audio surveillance
application, for example, sound events such as screaming or
explosion may indicate a dangerous situation whereas sound
events such as conversation or music may imply a normal
condition. Hence, a sound event classification method that
produces highly accurate classification results will be very
useful in understanding various situations such as audio
surveillance [1, 2, 3], monitoring in health care [4], and
military [5].
In general, such sound events show distinctive temporal
and spectral characteristics [5]. Therefore, developing a
feature representation method, which is proper to describe
the characteristics of each sound event, is very important in
improving the classification accuracy of the sound events.
Sound event classification was conventionally performed
by using general audio features that include MPEG-7 lowlevel features (LLFs) [1], linear-frequency cepstral
coefficients (LFCCs) [2], Mel-frequency cepstral
coefficients (MFCCs) [4], and their combinations [3, 5].
Kim and Kim [7] proposed segmental two-dimensional
MFCCs which are based on two-dimensional discrete
cosine transform to capture temporal and spectral
characteristics of a sound event. Jonathan et al. [6] utilized
image processing based techniques such as pseudo-coloring
and partitioning in a spectrogram to overcome the noise
sensitivity of MFCC. Lee et al. [8] employed angular radial
transform to extract spectrogram shape features within a
birdsong segment.
In recent years, a bag-of-audio-words (BoAW) feature
representation which is a histogram representation of framebased audio features, such as LLF, in a long-term segment
instead of the frame-based audio features itself is
successfully applied to sound event classification [9, 10]
since the histogram may be suitable for describing the
global characteristics of a sound event. In the method, the kmeans clustering based on the Euclidean distance measure
is generally used to construct the histogram. However, since
the dynamic range of each frame-based feature is diverse
and inconsistent, the clustering result is subject to bias. To
overcome the drawback, this paper presents the sound event
classification method, focusing particularly on BoAW
feature representation using Gaussian mixture model
(GMM)-based clustering, which considers the dynamic
range of each feature. A support vector machine (SVM)
classifier is used to identify the class of a test sound among
fifteen sound event classes.
The remainder of the paper is organized as follows: The
conventional BoAW feature representation is described in
Section 2. In Section 3, we present the proposed
distribution-based clustering method. Section 4 shows the
experiments and finally, our conclusions are summarized in
Section 5.
2. BoAW feature representation

The block diagram of BoAW feature representation is
shown in Figure 1. First, the frame-based features are
- 170 -
ICEIC 2015
Figure 1: Block diagram of BoAW feature representation (Dotted box is used only for the training phase.)
extracted in each sound clip. Using these frame-based

features, we choose a cluster that has a minimum distance
between the frame-based features and the centroids of
clusters. Note that the clusters are obtained using the kmeans clustering based on the Euclidean distance measure
only in the training phase. Given a set of d -dimensional
frame-based feature vectors ( x1 , x 2 , , x N ) , k-means
clustering aims to partition n feature vectors into k sets
S = {S1 , S 2 , S k } so as to minimize the within-cluster sum
of squares, i.e.,
k
arg min || x i
S
kmenas
||2
(1)
=i 1 xSi
where i kmenas is the centroid of the i -th cluster obtained

by k-means clustering. Finally, the BoAW feature vector
can be obtained by constructing histograms for selected
clusters in a sound clip,
L
FBoAW_kmeans
[ ( , 1), ( , 2), , ( , k )]
(2)
l =1
where l is the selected cluster for l -th frame-based feature,
L is total number of frames in the sound clip, and () is the
Kronecker delta function. As a result, the BoAW feature

representation contains all the frame-based features in a
sound clip, so it can be useful to capture the global timefrequency characteristics of a sound event.
3. GMM clustering-based BoAW representation

In the conventional BoAW feature representation
described in Section 2, the Euclidean distance-based k-
means clustering method is generally used. However, since

the frame-based features have diverse dynamic ranges, the
features that have a wide dynamic range are critical on
clustering results. For example, the dynamic range of a
short-time energy is broader than with zero-crossing rates.
Therefore, we propose the BoAW feature representation
based on the GMM clustering which is the one of the widely
used distribution-based clustering methods to tackle this
disadvantage of the k-means clustering [11].
The GMM clustering is a kind of soft clustering that uses
probabilities instead of occurrence counts used in k-means
clustering. It can effectively compensate the various
dynamic ranges of frame-based features by using the
posterior probabilities of each Gaussian component. More
specifically, each Gaussian component in the GMM takes
the role of a cluster in k-means clustering, so distances
between frame-based features and each centroid is replaced
by posterior probabilities of each Gaussian.
Let the GMM has M number of Gaussian components,
then the posterior probability of m-th Gaussian component
is obtained as
GMM
wm ( x | m , m )
p ( m | x) =
(3)
M
GMM
wi ( x | i , i )
i =1
GMM
where x is the frame-based feature vector, m

, m ,
and wm are the mean vector, covariance matrix, and
mixture weight of m-th Gaussian component, respectively.
The GMM is trained using an expectation-maximization
(EM) algorithm [12]. Then the BoAW feature vector, which
is the histogram of each frame-based features in the sound
clip, FBoAW_GMM can be obtained by the summation of
posterior probabilities for all frames in the sound clip as
- 171 -
ICEIC 2015
Table 1: Configurations of the database
#
Clips
Total
duration
(sec)
Avg. clip
duration(Std.)
(sec)
Car crashing
36
154.9
4.3(2.0)
Crying
66
311.4
Dog barking
81
Explosion
Abnormal
Classes
Table 2: Average classification accuracies (%) of the

various features according to the number of clusters of the
k-means and GMM clustering methods (Bold face
represents the best result along the row axis.)
4.7(1.0)
Framebased
features
128
256
512
128
256
512
372.6
4.6(1.6)
LLF
67.6
67.6
65.6
85.4
85.7
87.1
64
280.7
4.4(1.7)
LFCC
78.7
81.7
76.2
81.5
83.3
85.9
Glass breaking
103
233.3
2.3(1.3)
MFCC
90.2
91.5
92.5
93.3
95.0
95.6
Screaming
115
228.7
2.0(0.9)
Air conditioner
68
333.6
4.9(0.3)
Bird song
92
355.4
3.9(1.4)
Conversation
48
240.0
5.0(0.0)
Car horn
96
199.5
2.1(1.2)
Motorcycle
58
292.0
5.0(0.5)
Music
72
360.0
5.0(0.0)
Raining
65
324.2
5.0(0.1)
Ambulance siren
68
322.1
4.7(0.5)
Wind
56
350.1
4.9(0.4)
k-means clustering
GMM clustering
4.1 Experimental setup
4.2 Experimental results
In order to evaluate the proposed methods, we used

fifteen classes of sound events consisting of car crashing,
crying, dog barking, explosion, glass breaking, screaming,
air conditioner, bird song, conversation, car horn,
motorcycle, music, raining, ambulance siren, and wind
which were collected from various sound effect libraries and
the Web. Since the duration of a target sound is different,
sound clips were made with a variable length which is about
1-8 sec long. Table 1 indicates data description in terms of
the number of clips per each sound event class, total
duration, and the average duration of clips. All sound clips
were digitized in 16-bit per sample with 48 kHz sampling
rate in mono-channel.
4.2.1 Effectiveness of GMM clustering
Normal
4. Experiments
To show the effectiveness of the proposed method, we

evaluated the performances of the LLF, LFCC, and MFCC
with the k-means and GMM clustering methods. The LLF
consisted of a short-time energy, zero-crossing rate, spectral
centroid, spectral bandwidth, sub-band energy, sub-band
energy ratio, spectral flux, spectral flatness, and spectral
roll-off. All the features were extracted from a short frame
of 25 msec with 50% overlap. For clustering, we used 128,
256, and 512 clusters and Gaussians for the k-means and
GMM clustering, respectively. A 5-fold cross validation
was performed with the database that was split randomly
into five equal-sized for reliable results. The classifier we
used was a support vector machine (SVM) with a linear
kernel [13].
For the application point of view, we tried to additional
two experiments: distant environments and surveillance
scenario. First, to generate additional distant sound database,
each sound data were re-recorded by playing the original
recording back on a loudspeaker with distances of 1m or
10m in a quiet outdoor environment. Second, to perform the
experiments under the surveillance scenario, the fifteen
classes of sound events were categorized into two classes:
abnormal and normal. The abnormal class consists of car
crashing, crying, dog barking, explosion, glass breaking,
and screaming, and others were mapped into the normal
class as shown in Table 1.
FBoAW_GMM =
= [ p ( m 1=
| x l ), p ( m 2 | x l ),
l =1
(4)
, p ( m = M | x l )] .
T
Consequently, the BoAW feature representation based

on distribution clustering may be more appropriate than the
conventional method by compensating the inconsistent
dynamic range of each feature to capture the distinct
characteristics of sound events.
Table 2 shows the performance comparison between the

proposed GMM clustering and k-means clustering-based
BoAW feature representation with the various frame-based
features in terms of the average classification accuracy (CA)
using original database. Here, the CA was averaged across
5-fold experiments. These results show that the GMM
clustering outperformed the conventional k-means
clustering in most cases, especially obtaining a 55.9%
relative improvement when using the LLF as frame features
and 256 clusters. Note that the relative improvement is
computed by
- 172 -
ICEIC 2015
=
ERR %
Conversation
Crying
Dog barking
Explosion
Glass
breaking
Car horn
Motorcycle
Music
Raining
Screaming
Ambulance
siren
Wind
Air conditioner
Bird song
Car crashing
Conversation
Crying
Dog barking
Explosion
Glass breaking
Car horn
Motorcycle
Music
Raining
Screaming
Ambulance siren
Wind
Car crashing
Actual
Bird song
Prediction
Air
conditioner
Table 3: Confusion matrix for fifteen classes of sound event classification (The entry represents the percentage of clips belonging
to the actual class and predicted by the system.)
98.5
0.0
0.0
0.0
0.0
0.0
3.1
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
100.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
2.6
0.0
0.0
0.0
0.0
69.4
0.0
0.0
0.0
1.6
1.9
1.0
3.4
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
100.0
0.0
0.0
1.6
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
97.0
0.0
0.0
1.0
1.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
100.0
0.0
1.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
1.5
0.0
5.6
0.0
0.0
0.0
92.2
0.0
1.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
8.3
0.0
0.0
0.0
1.6
95.1
0.0
3.4
0.0
0.0
0.9
0.0
0.0
0.0
0.0
0.0
0.0
3.0
0.0
0.0
0.0
91.7
0.0
1.4
0.0
5.2
0.0
0.0
0.0
0.0
11.1
0.0
0.0
0.0
0.0
0.0
1.0
93.1
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
1.0
0.0
98.6
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
100.0
0.0
0.0
0.0
0.0
0.0
5.6
0.0
0.0
0.0
0.0
0.0
2.1
0.0
0.0
0.0
91.3
1.5
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
1.0
0.0
0.0
0.0
0.0
98.5
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
1.0
0.0
0.0
0.0
0.0
0.0
0.0
100.0
CER baseline CER proposed
100%
Table 4: Average classification accuracies (%) of the k-means

and GMM clustering methods on various distant
environments (original, 1m distance, and 10m distance) for
distance matched condition and multi-condition
(5)
CER baseline
where ERR % and CER mean an error reduction rate and a
classification error rate, respectively. This implies that the
GMM clustering is more suitable for the BoAW framework
by effectively dealing with various dynamic ranges of the
frame features. We can also observe that the MFCC is more
superior to the LLF and LFCC as frame-based features,
showing 65.0% and 70.1% relative improvements when
using 512 clusters of the GMM clustering method,
respectively. This indicates that the MFCC is more effective
in expressing the characteristics of sound events in the
BoAW method. Therefore, the frame-based MFCC features
and 512 clusters were used as the default setting in the
following experiments.
We analyze the best classification results (the MFCC
and the GMM with 512 clusters) using the confusion matrix
as shown in Table 3. As can be seen, most classes have very
small amount of confusion except the car crashing class. We
can interpret this result as two points of view: insufficient
data and/or complex characteristics of the car crashing
sound class. It can be seen that the car crashing class has the
smallest amount of data in Table 1 (about 150 sec of total
duration) which can cause poor modeling in training phase.
Furthermore, we can simply imagine that the car crashing
event composed of the tire skid and crash sounds which
are similar to motorcycle, glass breaking, and explosion.
Therefore, the higher misclassification rate is observed in
the car crashing class compared to other sound classes.
k-means
clustering
GMM
clustering
Original
92.5
95.6
1m
90.5
94.3
Conditions
Distance matched
condition
Multi-condition
10m
90.6
94.5
Original
92.3
92.9
1m
90.4
91.5
10m
88.7
91.2
4.2.2 Evaluation of the proposed method on various distant

environments
It is important to measure the performance of the distant
environment in the audio surveillance because the sound
related to the dangerous situation is likely to enter the
system distantly. Table 4 shows the CA performances of the
k-means and GMM clustering-based BoAW feature
representation on the various distant environments: distance
matched condition means that the acoustic model is trained
using only distance matched training data with test data
whereas multi-condition means the acoustic model is
trained using all training data regardless of distance. As can
be seen, the proposed method consistently shows better CA
performances than with the conventional BoAW method for
all distant environments and training conditions. Although
the time-frequency characteristics of a sound event are
- 173 -
ICEIC 2015
event classifier. In order to evaluate the proposed features,
experiments were performed in the aspect of the CA across
fifteen sound classes. The experimental results show that the
proposed feature representation method outperformed
conventional BoAW representation based on k-means
clustering, achieving a CA of 95.6% when using MFCC
frame features and 512 clusters of the GMM clustering.
Furthermore, additional experiments were performed
related to the areas of audio surveillance. Our work verifies
a possibility that the proposed method can be successfully
applied to audio surveillance systems.
Table 5: Average classification accuracies (%) for seven

classes: car crashing, crying, dog barking, explosion, glass
breaking, screaming, and normal classes
k-means
clustering
GMM
clustering
Original
92.9
96.0
1m
91.5
94.8
Conditions
Distance matched
condition
Multi-condition
10m
91.4
95.3
Original
93.3
93.6
1m
91.4
92.3
10m
90.8
93.0
6. Acknowledgements
Table 6: Average classification accuracies (%) for two classes:

abnormal and normal classes
k-means
clustering
GMM
clustering
Original
94.8
97.3
Conditions
Distance matched
condition
Multi-condition
1m
94.3
96.4
10m
94.7
97.3
Original
95.5
95.6
1m
94.1
94.0
10m
93.7
95.0
This work was supported by the Technology Innovation

Program of the Ministry of Trade, Industry & Energy.
[10047788, Development of Smart Video/Audio
Surveillance SoC & Core Component for Onsite Decision
Security System]
References
[1] A. Harma, M. F. McKinney, and J. Skowronek,
"Automatic surveillance of the acoustic activity in our living
environment," in Proc. IEEE Int. Conf. Mult. Expo, Jul.
2005.
distorted in distant environments because of significantly

reduced power, the proposed method gives fairly good
performances. This result obviously proves that the
proposed method is more robust to distant environments.
[2] P. K. Atrey, N. C. Maddage, and M. S. Kankanhalli,

"Audio based event detection for multimedia surveillance,"
in Proc. IEEE Int. Conf. Acoust. Speech, and Signal
Process., May 2006, pp. 813-816.
4.2.3 Evaluation of the proposed method under surveillance

scenario
[3] C. Clavel, T. Ehrette, and G. Richard, "Events detection

for an audio-based surveillance system," in Proc. IEEE Int.
Conf. Mult. Expo, Jul. 2005, pp. 1306-1309.
Under the surveillance scenario, confusions between the

mundane sounds are not considered because the only
interest is to capture the dangerous situations. In this point
of view, we perform additional experiments by mapping the
classification results into normal or abnormal class. Table 5
presents the classification accuracy of normal and other
abnormal sound events, i.e., 7-way classification: car
crashing, crying, dog barking, explosion, glass breaking,
screaming, and normal classes. Table 6 also presents the
classification accuracy of normal and abnormal classes, i.e.,
2-way classification. In the same context of previous
experiments, the proposed method is more accurate than the
conventional BoAW method which can be successfully
applied to the surveillance applications.
5. Conclusion
We proposed a feature representation method that
employs BoAW based on the GMM clustering to effectively
represent the distinct time-frequency patterns of sound
events. An SVM with a linear kernel was adopted as a sound
[4] Y. T. Peng, C. Y. Lin, M. T. Sun, and K. C. Tsai,

"Healthcare audio event classification using hidden Markov
models and hierarchical hidden Markov models," in Proc.
IEEE Int. Conf. Mult. Expo, Jun. 2009, pp. 1218-1221.
[5] S. Ntalampiras, I. Potamitis, and N. Fakotakis, "On
acoustic surveillance of hazardous situations," in Proc.
IEEE Int. Conf. Acoust. Speech, and Signal Process., Apr.
2009, pp. 165-168
[6] J. Dennis, H. D. Tran, and H. Li, "Image representation
of the subband power distribution for robust sound
classification," in Proc. Interspeech 2011, Aug. 2011, pp.
2437-2440.
[7] M. J. Kim and H. Kim, "Audio-based objectionable
content detection using discriminative transforms of timefrequency dynamics," IEEE Trans. Multimedia, vol. 14, no.
5, pp. 1390-1400, Oct. 2012.
- 174 -
ICEIC 2015
[8] C. H. Lee, S. B. Hsu, J. L. Shih, and C. H. Chou,
"Continuous birdsong recognition using Gaussian mixture
modeling of image shape features," IEEE Trans.
Multimedia, vol. 15, no. 2, pp. 454-464, Feb. 2013.
[9] S. Pancoast and M. Akbacak, "Bag-of-audio-words
approach for multimedia event classification", in Proc.
Interspeech 2012, Sep. 2012, pp. 2105-2108.
[10] V. Carletti, P. Forggia, G. Percannella, A. Saggese, N.
Strisciuglio, and M. Vento, "Audio surveillance using a bag
of aural words classifier," in Proc. IEEE Int. conf. Adv.
Video and Signal Based Surveillance, Aug. 2013, pp. 81-86.
[11] C. M. Bishop, Pattern recognition and machine
learning, Springer, 2006.
[12] T. K. Moon, "The expectation-maximization
algorithm," IEEE Signal Process. Magazine, vol. 13, no. 6,
pp. 47-60, Nov. 1996.
[13] C. C. Chang and C. Lin, "LIBSVM: a library for
support vector machines", ACM Trans. on Intelligent
Systems and Technology, 2011. Software available at
http://www.csie.ntu.edu. tw/~cjlin/libsvm.
- 175 -
FO-1-2-6
Reduction of the Computational Redundancy in Integer Motion Estimation

using a Modified Test Zone Search Algorithm in HEVC
Sunil Roe1, 2, Soonwoo Choi1, Woosuk Jung1 Student Member, IEEE and Soo-Ik Chae1, Member, IEEE
1
Seoul National University, Seoul, Korea, 2Samsung Electronics Co. Ltd., Suwon, Korea
{lab700, ssoonoo, northdr, chae}@sdgroup.snu.ac.kr
Abstract
This paper proposes to use one reuse buffer for the CU of
each size that reduces redundant SAD data within the CU.
To further reduce the SAD data we also propose to modify
the test zone search (TZS) algorithm so that its
computational redundancy can be increased without
substantial BD-rate loss. According to the simulation
results, the reduction of the SAD data is about 49.2% for
the modified TZS algorithm and the BD-rate loss is 0.09%
considering parallel operations when each buffer is
implemented with a 16 way set-associative cache with 32
entries per a way.
Keywords: SAD Data Reuse, Reuse Buffer, TZS
one for each CU size. Then we do not compute a SAD

computation if its SAD data is already in the reuse buffer.
The SAD computation is performed only if the data is not
in the reuse buffer.
The averaged ratio of the redundant data is about 62%,
as summarized in Table 1. All simulation results in this
paper are obtained for the random access configuration and
averaged over the first 32 pictures in each of the five
1920x1080 image sequences such as Kimono, ParkScene,
Cactus, BasketballDrive, and BQTerrace under the
common test condition of the HM encoder [4], assuming
that the parallel SAD engines are employed to support a
throughput specified in Table II.
Table I: Redundant SAD calculation in percentage

for inter motion estimation using the TZS algorithm
Sequences
Random Access Low Delay
Kimono
39.5%
40.3%
ParkScene
46.3%
42.0%
Cactus
44.5%
42.3%
BasketballDrive
42.0%
41.0%
BQTerrace
54.3%
51.0%
Average
43.7%
42.2%
1. Introduction
This paper focuses on the computational reduction of
the sum of the absolute difference (SAD) data of the test
zone search (TZS) algorithm in integer motion estimation
(IME) for inter prediction. There have been some works on
SAD data reuse, but most of them mainly focused on
reusing the reference picture memory [1] or reusing
neighbor SAD data of the 2-D SAD tree [1, 2] for the full
search (FS) algorithm or the 4 step search algorithm [3].
The HEVC test mode (HM) encoder employs the TZS
algorithm in finding the best motion vector (MV) for IME
and find the best partition through the rate distortion
optimization search. Compared to the FS algorithm, the
number of search points within 64 search range of TZS
algorithm dramatically decreases to 1/150 with 0.4% BDrate loss.
The TZS algorithm is repeatedly called during the RDO
search: once for each PU in the allowable PU partitions of
every CU in all the allowable CU partitions for all coding
tree units (CTUs) in all the reference pictures. The TZS
algorithm finds a MV for each PU. This paper adopts the
SAD computational complexity normalized by that of the
4x4 SAD computation. The normalized complexity of each
call of the TZS algorithm computes 11,000 on the average.
Therefore, the SAD computational complexity of IME is
enormously high in the HM encoder.
Because the initial search point for each PU in TZS is
highly likely equal to those of other PU partitions because
they are selected among the MVs of its neighbor PUs.
Therefore, the SAD data among all PU partition can be
overlapped significantly. We propose to use reuse buffers,
Acknowledgment: This work was supported by Inter-University
Semiconductor Research Center in Seoul National University.
initial motion vector prediction
initial motion vector prediction
grid search with flexible rounds
grid search under 5 rounds
uiBestDistance > 5
No
No
Yes
Yes
raster search on the integer grid

aligned to the specific position
raster search on the integer grid
uiBestDistance > 0
uiBestDistance > 5
No
uiBestDistance > 0
No
Yes
Yes
origin point update
origin point update
star refinement with 7 rounds
star refinement with 4 rounds
stop
stop
(b)
(a)
Fig. 1 Original(a) and modified(b) TZS algorithms
2. Modified TZS algorithm

As shown in Fig 1(a), the TZS algorithm is composed of
three steps: the first step of grid search that finds a better
position around the initially predicted MV with three or
more diamond search rounds, the second step of the raster
search that is performed, if necessary, on the integer grid
points in the overall search range, and the final step of the
star refinement is performed for the result of the raster
search [5].
- 176 -
ICEIC 2015
We propose a modified TZS algorithm in which the
maximum number of the rounds in the grid search is
changed to 5 for the grid search step, and the integer grid
for the raster search is aligned to the offsets x and y of the
initial MV, and the maximum number of rounds in each
star refinement is changed to 4, as shown in Fig. 1(b).
With the modified TZS algorithm, the BD-rate loss is
0.09% while the ratio of redundant data is increased to
52.3% from 43.7% and the overall SAD computation is
reduced by about 17.1%. Therefore, the modified TZS
algorithm is more
efficient in reducing
the redundant
SAD
Tag : 22bit
Index : 5bit
block offset : 2bit
computation when the reuse buffers are used together.
RefList[0]RefIdx[1:0]SPy[11:2]SPx[11:3] SPy[1:0]SPx[2:0]
4x4 SAD engines assigned to each CU depth calculated by

(3) is 68 so that the total number of the SAD engines is 272.
Table II: Specifications for an HEVC Encoder which supports
4Kx2K@30fps with 400MHz
Specifications of an HEVC Encoder
Maximum Resolution
UHD(4096x2160)
Maximum Frame Rate
30
# of frames
4
# of PU partitions
7
Search Range
64
Frequency
400MHz
Yo[5-d]Xo[5-d]
8x8
8x8
8x8
8x8
8x8
8x8
16x16 CU
8x8
16x16 CU
8x8
...
...
Fig. 2 The address of a 16 way set associative cache for the reuse
...
32x32 CU
buffer of depth d.
64x64 CU
3. Reuse Buffer Architecture

To reduce the redundant SAD computation, we propose
to employ four reuse buffers: one for each CU size such as
8x8, 16x16, 32x32, 64x64 in a CTU. Each reuse buffer for
a CU is implemented with a 16 way set-associative cache
and the cache address corresponds to the identification of
the SAD data, as shown in Fig 2. The 29-bit address for
each SAD data consists of a tag field of 22 bits, an index to
each way of 5 bits, and a block offset of 2 bits. The cache
address with 22 bits consists of a 2-bit reference picture
index RefIdx, a 1-bit reference picture List RefList, and a
19-bit upper part of MV position (SPx[11:3], SPy[11:2]) in
the TZS search range. The index with 5 bits of lower part
of MV position (SPx[2:0], SPy[1:0]) represents the
position of each way, and a 2-bit index for quads in the CU
(x[5-d],y[5-d]) where (x[5:0], y[5:0]) is the pixel address in
the CTU.
For example, the 16 way reuse buffer with 512 entries
includes a tag array of 1375B for each depth and four data
arrays of 4.25KB, 3.75KB, 3.25KB, and 2.75KB for depth
0, 1, 2, and 3, respectively. Note that each entry for the
reuse buffer of depth d contains (17-2d) bits. Adopting a
16 way set associative cache instead of a fully associative
cache reduces 6.1% of the H/W complexity.
4. Hardware Cost Analysis

The specifications of a target encoder are given in Table
II. The cycle budget assigned to one CTU is 6173 cycles
which is calculated using equation (1). In this paper, we
assume 6400 cycles per CTU considering utilization
margin.
...
...
Fig. 3 Mode decision flow when CU depths are processed in

parallel and 4x4 SAD units are divided into each CU depth.
Fig. 4 shows the results of reducing the redundant SAD
computation considering parallel operation by using the
modified TZS with the reuse buffers for three different
ways such as 8, 16, 32, where HM TZS stands for the
result using the TZS algorithm of IME in the HM encoder,
modified TZS for the case of using the modified TZS
algorithm without using the 14KB reuse buffers. The size
of the reuse buffer is decided by comparing three kinds of
entries such as 256(7KB), 512(14KB), 1024(28KB) in
each fully associative cache. We select 512 entries for the
set associative cache and then determine 16 way for the
SAD reuse buffer based on the trade-off between data
reuse ratio and the size of the reuse buffer. The vertical
axis represents the average normalized SAD computational
complexity of the CTU. The lower and upper parts in each
bar represent essential and redundant SAD computation,
respectively. And the number in each part of bars are
normalized and represented in percentage by the SAD
computational complexity of the HM encoder.
Based on the simulation results, we found that the SAD
computation can be effectively reduced by using the
modified TZS algorithm and the reuse buffer. When each
reuse buffer contains 32 entries per a way with 16 ways,
the SAD computation in IME using the modified TZS
algorithm is reduced to 50.8% of the HM encoder. The
total size of the four reuse buffers is about 14.0 KB.
6. Conclusion
frequency 400 MHz * 64 * 64
6173 cycles (1)

CTU rate
4096 * 2160 * 30
cycles / depth NumSAD * NSP * Nref.pic * N partition * (1 R reuse ) (2)
cycles/CTU
cycles / depth
SAD parallelis
(3)
cycles / CTU
To meet the above requirement, SAD operations for search
points should be calculated in parallel as shown in Fig. 3.
4x4 SAD engines are assigned to each depth separately and
each CU depth does not share calculation results of other
CU depth considering parallel operation. The number of
In this paper, we propose to employ total 20KB reuse

buffers implemented with 16 way set associative caches
and the modified TZS algorithm in order to reduce the
SAD computational complexity of IME to 50.8%
compared to the HM encoder. We confirmed that
combining the reuse buffer and the modified TZS
algorithm is effective.
- 177 -
ICEIC 2015
Fig. 4 Comparison of the SAD computational complexities

for the IME using the modified TZS with/without reuse
buffers implemented with n-way set associative caches.
References
[1] Y.-H. Chen, T.-C. Chen, C.-Y. Tsai, S.-F. Tsai, and L.-G.
Chen, "Data reuse exploration for low power motion estimation
architecture design in H. 264 encoder," Journal of Signal
Processing Systems, vol. 50, pp. 1-17, 2008.
[2] H. F. Ates and Y. Altunbasak, "SAD reuse in hierarchical
motion estimation for the H. 264 encoder," in Acoustics, Speech,
and Signal Processing, 2005. Proceedings.(ICASSP'05). IEEE
International Conference on, 2005, pp. ii/905-ii/908 Vol. 2.
[3] T.-C. Chen, Y.-H. Chen, S.-F. Tsai, S.-Y. Chien, and L.-G.
Chen, "Fast algorithm and architecture design of low-power
integer motion estimation for H. 264/AVC," Circuits and Systems
for Video Technology, IEEE Transactions on, vol. 17, pp. 568577, 2007.
[4] F. Bossen, "JCTVC-I1100: Common test conditions and
software reference configurations," Joint Collaborative Team on
Video Coding (JCT-VC), 2012.
[5] N. Purnachand, L. N. Alves, and A. Navarro, "Improvements
to TZ search motion estimation algorithm for multiview video
coding," in Systems, Signals and Image Processing (IWSSIP),
2012 19th International Conference on, 2012, pp. 388-391.
- 178 -
ICEIC 2015

Oral Session
FO-1-3
Computer and Information I
FO-1-3-1
Reversible Data Hiding Using Enhanced Prediction for

Progressive Image Transmission
Hsiang-Cheh Huang 1, Feng-Cheng Chang 2, Wai-Chi Fang 3, and Ting-Hsuan Wang 1
1
National University of Kaohsiung, Kaohsiung, Taiwan, R.O.C.

2
Tamkang University, Ilan, Taiwan, R.O.C.
3
National Chiao-Tung University, Hsinchu, Taiwan, R.O.C.
E-mail address: hch.nuk@gmail.com
2. Proposed method and enhancements
Abstract
We propose the reversible data hiding algorithm for
progressive image transmission in this paper. With the
alteration of difference values between original and
predicted images, reversible data hiding can be
applicable to progressive image transmission. For
assessing parameters including the reversibility,
embedding capacity, and image quality, with our
algorithm, we observe the generally better
performances with simulations over existing methods.
Keywords: Reversible data hiding,
histogram, capacity, image quality.
difference
1. Introduction
Progressive image transmission (PIT) can be
commonly encountered when using the browsers. With
the vast amounts of image contents on the Internet,
copyright protection of progressively transmitted
media has become the practical issue. Data hiding is an
effective means for copyright protection [1][3], and
reversible data hiding has attracted attention in recent
years. Performance assessments include the following.
Reversibility. Original image and secret
information should be perfectly separated
from marked image, like reversible process in
thermodynamics.
Embedding capacity, implying the ratio
between the numbers of bits for hiding over
the size of original image. Larger capacity
would be more favorable.
Marked image should look as resemble as the
original image, i.e., differences need be small.
By utilizing the difference histogram between

original and predicted images, data embedding can be
achieved. By following the concepts from hierarchical
coding in [1], and those in [2] and [3], we generate the
predicted image first and calculate the difference
between predicted and original images. Prediction is
performed by employing the weighted averages
between neighboring pixels in horizontal and vertical
directions, and it differs from the counterparts in [2]
and [3] with the enhancements in prediction. Next,
difference values between original and predicted
images in the base- and enhancement-layers are
prepared. Data embedding can be performed
accordingly as follows.
Step 1. Generate the difference histogram between
original and predicted images in each layer.
Step 2. Choose the embedding level (EL). It is a
positive integer, noting portions for intentionally
modifying the histogram. Larger EL leads to larger
capacity for embedding. We move the positive part
to the right, and the negative part to the left with
EL. Empty bins are reserved for embedding.
Step 3. Embed secret bits in empty bins of difference
histogram. We follow the procedures in [3].
Step 4. Reconstruct the output image with PIT by
adding the difference value back to the previous
layer. The base layer is constructed first, and then
the enhancement layers are produced consequently.
Correspondingly, at the decoder, secret bits extraction
and original recovery follow the reverse procedures.
Step 1. Generate the histogram of difference values of
progressively received image.
Step 2. Extract secret bits sequentially, layer by layer,
with EL. Difference histograms with empty bins
are produced for the recovery of original image.
- 180 -
ICEIC 2015
Step 3. Obtain the original difference histogram, and
recover original image by adding the difference
back to the base and enhancement layers.
We have conducted simulations with three test
images, Airplane, F16, and Lena, with sizes of
512512, to check the effectiveness in Fig. 1, and have
made comparisons between our method and that in [2]
and [3]. There are five curves, where the blue curve
denotes performances of proposed method, the red
curve means that of [2], and remaining three imply
three schemes, or MSE (mean square error), BL
(bilinear), and NN (nearest neighbor), from [3]. We
observe the trend when embedding more bits, denoted
by bit per pixel (bpp), marked image quality, denoted
by peak signal-to-noise ratio (PSNR), gets degraded.
From Fig. 1, with our algorithm, the largest
capacities can be observed, with 1.2539 bpp at 30.64
dB for Airplane, 1.2217 bpp at 29.74 dB for F16, and
1.2228 bpp at 29.07 dB for Lena, respectively. It leads
to the average enhancement of 27.94% in maximal
capacity over those in [2] and [3]. However, an average
degradation of 2.10 dB of marked image can also be
watched. Larger capacity leads to more alteration to
difference histogram, hence the degradation of marked
images.
As reported in [3], among the MSE, BL, and NN
schemes, MSE reaches the best, and NN performs
poorly. We also observe the curve in [2] outperforms
all the three curves in [3] in Fig. 1. With proposed
method, it performs well at high embedding capacity
regions, where capacities of larger than 1.0 bpp can
easily be reached. However, it has a bit inferior
representation at low embedding capacity regions.
Even so, it still performs better than the NN scheme in
[3]. From the observations above, proposed algorithm
has the advantages of hiding more secret bits with
better qualities for the copyright protection of
progressively transmitted images.
(a)
(b)
(c)
Fig. 1
Comparisons of capacity and quality of test

images between our scheme and the method
in [2] and [3]. (a) Airplane. (b) F16. (c) Lena.
Acknowledgements
The authors would like to thank Ministry of Science
and Technology (Taiwan, R.O.C) for supporting this
paper under Grant No. MOST103-2221-E-390-018.
4. Conclusions
References
We propose a reversible data hiding algorithm with
enhanced prediction for producing difference
histogram, which is suitable for progressive image
transmission. Reversibility of proposed algorithm is
guaranteed. Simulations have presented the better
performances at high embedding capacities, and
comparable results at mid- to low-capacities regions.
Our algorithm is easy for implementation, and it is
applicable to progressive image transmission.
[1] H.C. Huang and F.C. Chang, Hierarchy-based

reversible data hiding, Expert Systems with
Applications, vol. 40, no. 1, pp, 3443, Jan. 2013.
[2] H.C. Huang, T.H. Wang, Y.H. Chen, and W.C. Fang,
Reversible data hiding with enhanced difference
alteration for progressively transmitted images, IEEE
Int'l Symp. Consumer Electronics, pp. 187188, 2013.
[3] Y.C. Lin, Reversible data hiding for progressive image
transmission, Signal Proc.: Image Communication, vol.
26, no. 10, pp. 628645, Nov. 2011.
- 181 -
FO-1-3-2
DEX2C: Translation of Dalvik Bytecodes into C Code

Minseong Kim1, Youngsun Han2, Myeongjin Cho1, Chanhyun Park1 and Seon Wook Kim1
1
Department of Electrical and Computer Engineering, Korea University, Seoul 136-713, Republic of Korea
{kissofgod, linux,yasutaxi, seon}@korea.ac.kr

2
Department of Electrical Engineering, Kyungil University, Gyeongsan-si 712-701, Republic of Korea
youngsun@kiu.ac.kr
Abstract
Dalvik is a virtual machine (VM) that has been
designed to run Java-based Android applications on the
Android operating system. In order to improve
performance of Dalvik VM, trace-based Just-in-Time
(JIT) compilation technique has been employed.
However, this approach can limit aggressive
optimizations due to its compilation overhead at runtime
and lack of code information from traces, i.e. portion of
codes. In this paper, we propose a new method-based
JIT compiler, named DEX2C, for not only improving
performance of Dalvik VM but also finding what
optimization is necessary and which codes can be
parallelized in the Android applications. Our compiler
dynamically translates the Dalvik bytecodes (DEX) into
C code by method granularity. The generated C codes
are compiled aggressively by GNU C compiler (GCC)
and parallelized by Intel C/C++ compiler. We also
developed a new method-based JIT interface in Dalvik
VM for the DEX2C compiler. Our experiment result
shows that our compiler achieves significant
performance improvement of up to 15.2x and 3.7x on
average in integer benchmarks.
compiler generates C code instead of native code

directly so as to apply various aggressive optimizations
of GCC and to exploit the parallelism with Intel C/C++
compiler [4]. Through this approach, we are able to
study what optimization is necessary and which codes
are supposed to be parallelized in the Android
applications.
Our performance evaluation shows that the DEX2C
complier framework achieves significant performance
improvement of up to 15.2x and 3.7x on average in
integer benchmarks.
Our paper is organized as follows: Section 2 describes
the DEX2C compiler infrastructure, and Section 3
evaluates the performance of our DEX2C architecture.
Finally, we make conclusion in Section 4.
2. DEX2C Compiler Infrastructure

In this section, we are going to describe both an overall
architecture of our DEX2C compiler infrastructure and
the detail structure of the compiler.
Keywords: Dalvik bytecodes to C translation, methodbased JIT compiler, DEX2C compiler.
1. Introduction
Dalvik [1] is a virtual machine that provides runtime
environment to the Android applications. Since its
runtime performance is intrinsically limited due to its
interpretation overhead, a trace-based JIT compiler [2,3]
has been adopted to improve the performance by
dynamically compiling hot traces into native codes and
directly executing them. However, each trace contains
only a few instructions when comparing with a method,
the trace-based JIT compiler inherently exploits less
optimization opportunities and parallelism than a
method-based JIT compiler handling all the instructions
of a method.
So in order to improve the performance of the Dalvik
VM, we propose a new method-based JIT compiler
called DEX2C so as to find more optimization
opportunities and to exploit the parallelism. Our
Figure 1. Overall architecture of the DEX2C compiler.
2.1 Overall Architecture

Figure 1 shows an overall architecture of our DEX2C
compiler infrastructure and its compilation flow. The
infrastructure is comprised of the following two
compilers: the DEX2C compiler for translating DEX
code of a method into C code, and GCC for generating
an object file with the C code. When a hot method to be
selected through profiling is invoked by Dalvik VM, the
DEX2C compiler performs DEX-to-C translation. After
the translation is completed, GCC compiles the
generated C code into an object file. Finally, Dalvik VM
- 182 -
ICEIC 2015
dynamically links the object file and executes the target
method instead of interpreting its DEX code.
2.2 DEX2C Compiler Structure
The compiler frontend analyzes the method information
to be translated, such as method signature, local
variables, DEX code, and so on, in order to build
intermediate representation (IR). The IR basically
includes both a symbol table and a control flow graph
with basic blocks that are separated by the branch
instructions of the DEX code. Prior to build the symbol
table, the frontend makes a local variable map that
contains the pairs of a virtual register number and its
data type by using the information of local variables.
Since the DEX code is originally register-based,
resolving the data types of the registers is essential for
DEX-to-C translation. However, unfortunately, because
the data types of the temporary registers being used in
the DEX code are not apparently specified, the frontend
performs global liveness analysis in order to exploit their
data types completely. By using the Def-Use chains
from the global liveness analysis, the data types of the
temporary registers are ultimately determined with the
local variable information and type specific instructions
such as mul-double, int-to-double, and so on. After the
symbol table defining both local and temporary
variables type and scope is constructed, the backend of
the DEX2C compiler traverses each basic block in the
control flow graph and translates its DEX code into C IR.
The C IR is designed to be nearly equivalent to C
language syntax for straightforward conversion into C
code. Finally, the backend emits a C-style method
signature including return type, method name, and
parameters. It also emits the declaration of the variables
in the symbol table and the C code from the C IR.
2.3 Method-based JIT Interface in Dalvik VM
In order to execute the generated C code in Dalvik VM,
we implemented a method-based JIT interface. First, we
determine a method to be translated by a configuration
file or by a hot-method detection algorithm. The hotmethod detection scheme counts the number of method
invocations instead of entering traces. If a method is
invoked more than a predefined threshold, the method
will be translated into C code by the DEX2C compiler.
The compiler compiles the C code into an object file
with GNU C compiler as shown in Figure 1. After the
object file is dynamically linked, the method arguments
are copied from Dalvik's argument stack into registers
and stack space of the native codes. Then, the target
method is executed by assigning a program counter to
the linking address. Also, a return value must be
transferred from the native codes return registers, r0
and r1, into the retval registers of the Dalvik VM.
3. Performance Evaluation
The performance of our DEX2C compiler was tested
using four integer benchmarks of Element Benchmark
- 183 -
[5] on Nexus 7 [6]. The benchmarks are addition,

subtraction, multiplication, and division. The generated
C codes were compiled by GCC 4.6.0 with -O2. Also, in
the performance evaluation, the dynamic compilation
overhead of the DEX2C compiler was ignored by
employing the pre-compiled object files. Figure 2 shows
the speedup of integer benchmarks against the existing
Dalvik VM with trace-based JIT compilation. As shown
in Figure 2, we could achieve 3.2x speedup in addition,
3.1x in subtraction, and 15.2x in multiplication,
respectively. Different from the other benchmarks,
division benchmark achieves only 1.2x speedup. The
optimization opportunities were reduced because the
division operation was performed by built-in libraries of
Dalvik and GCC, respectively.
Figure 2. The speedup of integer benchmarks.
4. Conclusion
To the best of our knowledge, our work is the first
attempt of making a method-based JIT compiler that
supports DEX-to-C translation and its execution
framework for the Android system. The performance
results show that our DEX2C compiler achieves a
reasonable performance improvement against the
existing trace-based JIT compiler in Dalvik VM.
In the future work, so as to find out what optimization
can be applied for the Android application, we will
evaluate the performance with various optimization
options of GCC using our DEX2C infrastructure. We
will also study how to parallelize the Android
applications through the parallelism opportunity by the
Intel C/C++ compiler.
References
[1]
Google,
Dalvik
VM
Internals,
https://sites.google.com/site/io/dalvik-vm-internals, 2008.
[2] B. Cheng and B. Buzbee. A JIT compiler for Androids
Dalvik VM, http://dl.google.com/googleio/2010/android-jitcompiler-androids-dalvik-vm.pdf, 2010.
[3] B. Stefan, Analysis of the Android Architecture,
http://os.itec.kit.edu/downloads/sa_2010_braehlerstefan_android-architecture.pdf, 2010.
[4]
Intel,
Intel
C
and
C++
Compilers,
https://software.intel.com/en-us/c-compilers, 2014.
[5]
K.
Kodama,
Element
Benchmark,
https://sites.google.com/site/elementbenchmark, 2012.
[6] Google, Galaxy nexus. http://www.google.com/nexus/,
2014.
FO-1-3-3
Thread-aware Scheduling Method for Improving Utilization of VM

Chungmu Oh, Doohwan Oh, and Won Woo Ro
School of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea Rep.
E-mails: {chungmu, ohdooh, wro}@yonsei.ac.kr
Abstract
As virtualization environment has been widespread
and become popular, how to manage and operate a
virtualization environment efficiently has emerged as a
major concern. In fact, the operational issues of the
virtualization environment, such as performance
degradation or under-utilized resource management,
can be controlled by managing the behaviors of
guestOSes (also known as VMs). Therefore, it is
necessary to identify the features of the guestOSes on
the virtualization environment and apply the features
to the VM management. In this paper, we propose a
dynamic VM scheduling method using three VM
control managers (performance, resource, and power
manager). The proposed architecture classifies VMs
considering performance factors of running threads
and then provides the optimized environment for VM's
workload. The resources of the VM are dynamically
reconfigured for the best performance, and the power
states are controlled for efficient power consumption.
Through experiments, our method shows maximum
26% improved for the performance compared with the
traditional Xen.
Keywords: Xen, Virtual Machine, Hyper Threading
1. Introduction
As the level of needs on IT infrastructure becomes
higher and more complex, the demand for the highperformed and various environmental resources more
increases. However, the high-performed resource
requires large power consumption and additional costs
such as data centers cooling cost. A variety of
platforms of which the utilization is low, inevitably
encounters unnecessary operating costs such as
occupying cost and maintenance personal cost. To
overcome these problems, the virtual environment has
been developed. However, if the virtualization
environment does not fully consider the characteristics
of VMs on the server, it does not make much difference

with the physical environment.
We start from the observation that the overall
hardware resource of the default Xen with guestOSes is
on under-utilized and the unnecessary power is
consumed. Therefore, we propose the dynamic
scheduling method considering the characteristics of
VM using three controllers. Performance manager
classifies VM by threads clock speed and hyperthreading status [1], and decides the proper cluster
group. Resource manager reconfigures VMs resources
dynamically and migrates VMs between hosts
according to the characteristics of VM and hosts
utilization status. Power manager powers off VM or
controls power states considering to the utilization rate
and power consumption of the VM.
As a result, our mechanism allows resources to
operate efficiently by considering the characteristics of
threads on guestOS, so leads to performance
improvement, energy efficiency, and utilization
elevation.
2. Background Knowledge
Simultaneous multithreading techniques such as
Hyper-Threading (HT) can execute two threads
simultaneously on a single core [1]. Therefore, HT
technology can improve the utilization of the
virtualization environment and enhance the overall
performance.
Advanced Configuration and Power Interface
(ACPI) defines processor's power saving states as Pstates and C-states, which are saved power by dynamic
voltage and frequency scaling. Xen supports these
cpufreq and cpuidle states by cpufreq driver. This logic
figures out appropriate CPU frequency according to the
cpufreq policy and current status, and passes this
related information onto the Xens hypervisor.
Therefore, we can define the optimized frequency for
the power savings and performance.
- 184 -
ICEIC 2015
3. Dynamic VM Scheduling Methods

We suggest three VM control managers:
Performance, Resource, and Power Manager. Figure 1
shows the overall system mechanism.
Performance manager classifies VMs workload
based on clock speed and hyper-threading status, and
passes this information on to Xens scheduler for
placing in the proper cluster group. Our system
provides a similar operating environment that VMs
workloads can be operated efficiently.
Resource manager supposes that the number of
threads running on VM is not changed. When the
threads of the VM are significantly greater than the
number of assigned vCPUs, we increase the number of
vCPUs for this VM. When the threads of the VM are
significantly less than the number of assigned vCPUs,
we decrease the number of vCPUs. When the specific
hosts load is reached to a prefixed threshold, the VMs
workloads on that host are migrated to a low-loaded
host.
Xen uses the C-state value and P-state value as an
extreme value whenever the workload is stopped and
running [2]. Power manager saves work histories of
VMs such as the clock speed and the number of threads,
and determines the C-state and P-state level of the VMs.
Our algorithm saves power and improves performance
effectively by decreasing idle entry/exit latency and
doing boost-up and down.
Ubuntu 12.04 with 3.5.0 kernel and guestOSes are

Centos 5.1 with 2.6.18 kernel.
We tested four VMs with 2 vCPUs on a host which
has each 1,2,3,4 threads. The worst case is that VMs
are running in an inappropriate clock speed
environment. As shown in Figure 2, our algorithm
achieves maximum 26% performance improvement
than the default Xen.
Figure 2: Experiment Result
5. Summary and future work

We design energy-efficient, utilization-improved,
and high-performed method by providing three VM
control manager: Performance, Resource, and Power
Manager. Our algorithm provides the efficient method
for operating a data center without performance loss by
using three coordinators and contributes cost efficiency.
There are many kinds of threads like as memoryintensive, CPU-intensive or network-based. As a future
work, we intend to explore optimized VM scheduling
scheme, according to the characteristics of the running
threads on VM.
Acknowledgement
of MSIP/IITP, Republic of Korea [14-000-05-001,
Smart Networking Core Technology Development] and
in part by the ICT R&D program of MSIP/IITP
(2014(10041971), Development of Power-efficient
High-performance Multimedia Contents Service
Technology using Context-adapting Distributed
Transcoding).
Figure 1: Overall system mechanism
References
4. Experiment
In this paper, we analyze the results from
blackscholes of the PARSEC benchmark suite for the
multi-threaded application on Xen virtualization
environment. The hardware experiment environment is
i7 Quad-core at 2.8GHz, with 32KB L1 cache. The
software environment is Xen 4.2.0 hypervisor on
[1] Intel Hyper Thread Technology, www.intel.com.

[2] Gang Wei, and Kevin Tian, The On-going Evolutions of
Power Management in Xen, Intel Cooperation.
[3] Chengjian Wen, and Jun He, PCFS: A Power Credit
based Fair Scheduler under DVFS for Multi-core
- 185 -
ICEIC 2015
Virtualization
Platform,
Green
Communications (GreenCom), 2010.
Computing
and
[4] Gregor von Laszewski, and Lizhe Wang, Power-Aware

Scheduling of Virtual Machines in DVFS-enabled Clusters,
Cluster Computing and Workshops, 2009.
- 186 -
FO-1-3-4
ENHANCED ATM SECURITY SYSTEM USING VISUAL CRYPTOGRAPHY TO

BIOMETRIC AUTHENTICATION
Ajish S
Assistant Professor
Dept. of Computer Science and Engineering
College of Engineering, Perumon
Kollam, India
ajishs2014@gmail.com
AbstractFor the traditional ATM terminal customer recognition systems rely only on bank cards, passwords, and such
identity verification methods which measures are not perfect
and functions are too single. For solving the bugs of traditional
ones, a new ATM terminal recognition systems is to verify the
fingerprint of the Account holder of the bank at outside of
the gate. Because biometrics-based authentication offers several
advantages over other authentication methods, there has been a
significant surge in the use of biometrics for user authentication
in recent years. The security of the ATM (Automated Teller
Machine) system has been improved by generatnig two visual
cryptography shares of the fingerprint template of the user.
Two shares are encrypted with Chaotic Image Encryption with
PIN2 as key and share1 is stored in the users ATM card and
share2 is stored in the banks database. For the authentication
of user, the user first enter the PIN number and the ATM
machine checks the first level authenticity. Then the fingerprint
of the user is captured using the fingerprint sensor for the
second level authenticity. For that the ATM machine retrieves
the two shares of the fingerprint one from the users ATM
card and second from the banks database, decrypt the two
shares and stacked two generate the fingerprint template. Then
the fingerprint template is compared with fingerprint given by
the user and the authentication is success is both are same.
As only one encrypted share is stored in the banks database
attack on the database does not reveal any information about
the fingerprint.
Keywords-Automated Teller Machine; biometrics-based authentication; visual cryptography; Chaotic Image Encryption,
I. I NTRODUCTION
With the development of computer network technology and e-commerce, the self-service banking system has
got extensive popularization with the characteristic offering
high quality 24hrs service for customer. Nowadays, using the
ATM (Automatic Teller Machine) which provides customers
with the convenient banknote trading is very common.
However, the financial crime case rises repeatedly in recent
years; a lot of criminals tamper with the atm terminal
and steel credit card and password by illegal means. Once
uses bankcard is lost and password is stolen, the criminal
will draw all cash with in shortest time, which will bring
enormous financial losses to customer how to carry valid
identity to the customer becomes the focus in current financial circle. Traditional ATM systems authenticate generally
by using the credit card and the password, the method has
some defects. Using credit card and password cannot verify
the clients identity exactly. In recent years the algorithm
that the fingerprint recognition continuously updated which
has offered new verification means for us, the original
password authentication method combined with the biometric identification technology verify the clients identity
better and achieve the purpose that use of ATM machine
improve the safety effectively.
Biometrics-based authentication offers several advantages over other authentication. Fingerprint technology in
particular, can provide a much more accurate and reliable
user authentication method. Biometrics is a rapidly advancing field that is concerned with identifying a person based
on his physiological or behavioural characteristics. As the
Automated Teller Machines (ATM) technology is advancing,
fraudsters are devising different skills to beat the security of
ATM operations. Various forms of fraud are perpetuated,
ranging from: ATM card theft, skimming, pin theft, card
reader techniques, pin pad techniques, force withdrawals and
lot more. Managing the risk associated with ATM fraud as
well as diminishing its impact is an important issue that
faces financial institutions as fraud techniques have become
more advanced with increased occurrences. Considering the
numerous security challenges encountered by Automated
Teller Machines (ATM) and users and given that the existing
security in the ATM system has not been able to address
these challenges, there is the need to enhance the ATM
security system to overcome these challenges.
There are certain issues related to biometric system
and biometric data. Biometric systems are vulnerable to
attacks, which can decrease their security [3]. As template
is stored in database, if the security of stored templates is
compromised, the attacker can gain unauthorized access. The
stolen templates can also be used for other unintended purposes, e.g. performing unauthorized credit-card transactions
or accessing health related records. Hence, biometric templates should not be stored in plaintext form and fool-proof
- 187 -
ICEIC 2015
methodologies are essentially needed to securely store the
templates. We can protect the biometric data and template
by using cryptography, steganography and watermarking.
In this paper a system is proposed by visual cryptography
technique to protect the fingerprint template to make it
secure from attack in system database as well as dual layer
of authentication to the users.
The security of the ATM (Automated Teller Machine) system has been improved by generatnig two visual
cryptography shares of the fingerprint template of the user.
The two shares are encrypted with Chaotic Image Encryption
and one share is stored in ATM card and the second share is
stored in banks database. For the authentication of user, the
user first enter the PIN number and the ATM machine checks
the first level authenticity using the PIN number. For second
level authentication the fingerprint of the user is captured by
using the fingerprint sensors. The visual cryptography shares
(share1 stored in ATM card and share2 stored in banks
database) of the particular user are retrieved by the ATM
machine and decrypt by using the PIN2 number entered
by the user. Then the two shares are stacked two generate
the fingerprint template. The fingerprint minutia matching
algorithm is used to compare the fingerprint template and
the fingerprint of the user captured by the sensor. If the
minutia of the fingerprint template and sensored fingerprint
matches the second level authentication is success. As only
one encrypted share is stored in the banks database so attack
on the database does not reveal any information about the
fingerprint.
II. RESEARCH BACKGROUND
Crime at ATMs has become a nationwide issue that
faces not only customers, but also bank operators and this
financial crime case rises repeatedly in recent years [4]. A
lot of criminals tamper with the ATM terminal and steal
customers card details by illegal means. Once users bank
card is lost and the password is stolen, the users account is
vulnerable to attack. Traditional ATM systems authenticate
generally by using a card (credit, debit, or smart) and a
password or PIN which no doubt has some defects [5]. The
prevailing techniques of user authentication, which involves
the use of either passwords and user IDs (identifiers), or
identification cards and PINs (personal identification numbers), suffer from several limitations [6]. Passwords and
PINs can be illicitly acquired by direct covert observation.
When credit and ATM cards are lost or stolen, an unauthorized user can often come up with the correct personal codes.
Despite warning, many people continue to choose easily
guessed PINs and passwords - birthdays, phone numbers
and social security numbers. Recent cases of identity theft
have heightened the need for methods to prove that someone
is truly who he/she claims to be. Biometric authentication
technology may solve this problem since a persons biometric
data is undeniably connected to its owner, is nontransferable
and unique for every individual. The system can compare

scans to records stored in a central or local database or even
on a smart card.
Biometrics can be defined as a measurable physiological and behavioral characteristic that can be captured and
subsequently compared with another instance at the time
of verification. It is automated methods of recognizing a
person based on a physiological or behavioral characteristic
[7]. It is a measure of an individuals unique physical or
behavioral characteristics to recognize or authenticate its
identity [8]. Common physical biometrics characteristics
include fingerprint, hand or palm geometry, retina, iris and
face while popular behavioral characteristics are signature
and voice. Biometrics technologies are a secure means of
authentication because biometrics data are unique, cannot
be shared, cannot be copied and cannot be lost.
A. APPLICATION OF VISUAL CRYPTOGRAPHY TO BIOMETRIC AUTHENTICATION
The fingerprint is the most common human biometric
characteristic that has been used for personal identification.
Results obtained from comparing different biometric traits
[1] show that: the fingerprint has a high value in factors like
permanence, distinctiveness and performance, and medium
value in universality, collectablility and acceptability, while
the hand-written signature has the lowest value in universality, distinctiveness, permanence and performance. For improving security, reducing fraud and enhancing user convenience, biometric systems require the process of enrollment,
verification and identification.
In enrollment, the biometric template will be collected and stored in a database for eligible users. Verification
is the process of confirming the authenticity of a biometric
sample. Finally, identification is the process in which the
identity of a biometric sample in a database is determined
[1]. Protecting and securing biometric templates in the
database are of great importance to prevent systems from
being vulnerable to some attacks. Data hiding techniques,
such as visual cryptography can enhance the security by
embedding additional information in biometric images. Using the basic scheme of visual cryptography for securing
fingerprint authentication is suggested in [4], [12], [13]. For
improving the quality, increasing the contrast and simplicity
in matching of the reconstructed image, the authors in
[13] substituted the OR operator with XOR operator as the
process of stacking VCS shares. Figure 1 depicts the share
generation processes of the fingerprint image using 2-outof-2 VCS based on XOR operation which results in perfect
reconstruction of both gery scale image.
As an example application combining biometrics and
data hiding consider the application of an ID card containing
a biometric template VCS share. Fingerprint images are
considered as a biometric sample and an entrance security
- 188 -
ICEIC 2015
system in a company is considered as case study in our
approach.
The fingerprint of each eligible person is collected
by the system administrator and they are given to the
visual cryptography algorithm. Random shares are created
from fingerprint images. One of the shares is stored in the
database and the other share is given to the eligible person
in the form of unique ID card. For verification, the user
should insert the ID card into the security system. The
corresponding share which is stored in the database is found
and stacked with the other random share that is embedded
in the ID card. After verification, the system should identify
the participant. Hence, the system requests the participants
new fingerprints to compare with the minutiae extracted
from secret fingerprint images obtained from the visual
cryptography algorithm. Authentication is accepted if the
matching process succeeds.
1 1 1 1 1 1 1 0 = 254
Share1 = 0 0 1 0 0 1 0 0
Share2 = 1 1 0 1 1 0 1 0
1 1 1 1 1 1 1 0 = 254
Combining the two shares will give the exact bit and by doing the same procedure for the whole grayscale block gives
the perfect high quality image when reconstructed without
any loss of contrast. Example of (2,2) visual cryptography
is shown in figure 3.
III. ENHANCED ATM SECURITY SYSTEM USING

VISUAL CRYPTOGRAPHY TO BIOMETRIC
AUTHENTICATION
In the proposed method there is two level authentication . The first level authentication is by using the PIN
number. The user enter the PIN number through the key
pad of the ATM machine and it is compared with the PIN
number stored in the Banks database. If both are same the
first level authentication is success.
Figure 1. Example of a (2,2) secret sharing scheme: (a) Secret fingerprint

image (b) First share (c) Second share (d) Reconstructed fingerprint image
B. Chaotic Algorithm for Image Encryption
A. Visual Cryptography using Grayscale Images

The idea of (2, 2) Visual Cryptography[4] is to
split secret a into 2 pieces called shares. If an adversary
has only one out of the two shares, then he has absolutely
no information about the secret a. First of all each pixel
value in a grayscale block is transformed into binary
representation. For example take a grayscale block and
transform into binary blocks.

111 159 20

254 10 198

40 215 100
Traditional image encryption algorithm such as data

encryption standard (DES), has the weakness of low-level
efficiency when the image is large . The chaos-based encryption has suggested a new and efficient way to deal
with the intractable problem of fast and highly secure image
encryption.
1) The Nonlinear Chaotic Algorithm(NCA) map design:
The NCA map uses power function (1 x) and tangent
function instead of linear function. The NCA is defined as
xn+1 = .tg(xn ).(1 xn )
(1)
where xn (0, 1), n = 0,1,2, . . . The ranges of parameters ,

and will be discussed as follows. Firstly, they are positive.
Secondly, the absolutevalue of the slope of the curve at fixed
point should not be less than 1 , and xn+1 > xn when xn
= 1/(1 + ), therefore may be defined as
Its corresponding binary blocks are as follows:

01101111 10011111 00010100

11111110 00001010 11000110

00101000 11010111 01100100
Take each binary block and go for different possible
combinations of that block, and design the block into
different shares. For example take a binary block 254[1
1 1 1 1 1 1 0] and divide it into shares. The shares are
designed in such a way that when combining(XORing) the
two shares will reveal the original bit information.
Share1 = 0 1 0 1 0 1 0 0
Share2 = 1 0 1 0 1 0 1 0
= .ctg(
1
).(1 + ) , > 0
1+
(2)
Finally, parameter is obtained by experimental analysis;

as a result, =1- 4 So the NCA map is defined as follows:
xn+1 = (1 4 ).ctg(
- 189 -
1
).(1 + ) .tg(xn ).(1 xn )
1+
(3)
ICEIC 2015
where xn (0, 1), (0, 1.4], [5, 43], or xn (0, 1),
(1.4, 1.5], [9, 38], or xn (0, 1), (1.5, 1.57],
[3, 15]. The ranges of a and b are obtained by iteration
experimental analysis.
C. Encryption algorithm based on NCA
The image encryption algorithm is based on the
proposed NCA map. It uses chaotic sequence generated by
NCA map to encrypt image data with different keys for
different images. Original chaotic sequence x0,x1,x2, . . .
consists of decimal fractions. However images are all digital.
So a map is defined to transform the chaotic sequence to
another sequence which consists of integers. Then plainimage image can be encrypted by use of XOR operation
with the integer sequence.
Figure 2.
Block diagram of the chaotic encryption algorithm
Figure 2 shows the block diagram of the chaotic

encryption algorithm. The encryption steps are as follows
Step 1: Set encryption key for the plain-image, including
structural parameters a, b and initial value x0.
Step 2: Do 100 times of chaotic iteration as formula (3), and
obtain the decimal fraction x100.
Step 3: If the encryption work is finished, then go to step 6;
otherwise do three times of chaotic iteration; and as a result,
a decimal fraction, such as x103, will be generated, which is
a double value and we choose its first 15 significant digits.
Step 4: Divide the 15 digits into five integers with each
integer consisting of three digits. For each integer, do mod
256 operation, and another 5 bytes of data will be generated.
Step 5: Do XOR operation using the 5 bytes of data with 5
bytes of image data (grey value or color RGB value). Output
the calculation result to the object image and go to step 3.
Step 6: Pass the encrypted image through public communication channel.
Step 7: Pass the encryption key through secure communication channel.
Step 8: End.
The decryption algorithm is similar to the encryption algorithm but receiving encryption key and operating with
the encrypted image. The first 100 points of the chaotic
iteration curve are abnegated in order to avoid the harmful
effect of transitional procedure. Furthermore, to improve
system security, we selected the pseudo-random numbers
discontinuously; as shown in Fig. 3, one was selected after
two abnegated points.
D. Biometric Authentication
In the fingerprint registration process the visual
cryptography shares(share1 and share2)of the fingerprint
template are generated and encryptd using the Chaotic
Algorithm for Image Encryption with PIN2 as the secret
key. The encrypted share1 is stored in users ATM card and
encrypted share2 is stored in the banks database. As only
one encrypted share is stored in the banks database attack
on the database does not reveal any information about the
fingerprint.
In the fingerprint authentication process the fingerprint image signals of the ATM user are collected usnig the
fingerprint sensors and are converted to a grey scale image.
The fingerprint collector serves as the fingerprint collection
module. The modules fingerprint sensor is Veridicoms thirdgeneration product, the FPS200 sensor (with 256 x 300
array numbers and 500-DPI resolution). The sensor uses
Veridicoms ImageSeek function and high-speed image transmission technology to obtain quality images of all fingerprint
types.
During fingerprint image preprocessing, the fingerprint image is enhanced. Accurate fingerprint identification
relies on the identification of the fingerprint ridge texture
and minutiae. However, due to skin condition, collection
conditions, devices, the working and living environment of
the fingerprinted person, etc., the raw fingerprint images
collected by the fingerprint sensor usually contain noise and
degrade dramatically. Therefore, the raw fingerprint images
must be preprocessed after being collected. Fingerprint image preprocessing procedures include image normalization,
orientation and frequency extraction, filtration, binarization,
ridge thinning, etc.
Minutiae extraction involves preprocessing the image
to obtain a quality image, and then finding and specifying
the minutiae. After a raw fingerprint image goes through
orientation filtration, binarization, and thinning, it becomes
a thinned image. We then determine the endpoint and
bifurcation according to the crossing of each point on the
thinned image and extract the useful information of the
two minutia points, such as coordinate position, type, and
orientation. Fingerprint minutiae fall into many types. From
the perspective of probability, 2-bifurcation and ending are
the most common.
For thinned images, the pixel point grayscale value
can only be 0 or 1. We set 0 as the background point
- 190 -
ICEIC 2015
grayscale and 1 as the foreground point grayscale of the
ridge. The crossing number CN of eight fields of any point
P on the thinned image (see Figure 3) is defined as:
encrypted share is stored in the banks database so attack

on the database does not reveal any information about
the fingerprint. Various forms of attacks like ATM card
theft, skimming, pin theft, card reader techniques, pin pad
techniques, force withdrawals can be overcome by using the
Enhanced ATM Security System using Visual Cryptography
to Biometric Authentication method.
A. Security analysis of biometric authentication
Figure 3.
Minutiae Point Block Diagram
CN
1X
=
|pk+1 pk |herep9 = p1
2
(4)
k=0
If CN(P) = 1, point P is an endpoint. If CN(P) = 3, point P

is bifurcation. Otherwise, point P is a consecutive point or
an isolated point and cannot be calculated into the minutia
set.
The visual cryptography shares (share1 stored
in ATM card and share2 stored in banks database) of
the particular user are retrieved by the ATM machine
and decrypt by using the PIN2 number entered by the
user. Then the two shares are stacked two generate the
fingerprint template. Then the fingerprint minutia matching
algorithm is used to compare the fingerprint template and
the fingerprint of the user read by the sensor. If the minutia
of the fingerprint template and sensored fingerprint matches
the second level authentication is success. The fingerprint
minutia matching algorithm as follows:
1. For any minutia point Qi in input point set Q and
any minutia point Pj in template point set P, search the
two minutia points (Qi1 , Qi2 ) and (Pj1 , Pj2 ) that are
nearest to Qi and Pj respectively, in Q and P. Thus,
points (Pj , Pj1 , Pj2 ) and (Qi , Qi1 , Qi2 ) form two triangles
4Pj , Pj1 , Pj2 and 4Qi , Qi1 , Qi2 .
2. Determine whether the two triangles are identical and
have the same rotation orientation. If they do, take the point
as a polar point to create polar coordinates, and then match
the minutia points using a variable, limit-box method.
3. We believe there is a match only if the two conditions
are met:
Nm Tm , =
2 Nm
100 Ts
N +M
(5)
where Nm is the number of matching point pairs of the two

minutia sets, Tm and Ts and are the thresholds under the
two conditions, and N and M are the minutia numbers of
the two minutia point sets.
IV. EXPERIMENTAL RESULTS
To test the method a small software application is
written in MATLAB 7.9. This application contains minimum
tools to test the both proposed schemes. As only one
The primary advantage of biometric authentication

methods over other methods of user authentication is that
they really do what they should, i.e., they authenticate
the user. These methods use real human physiological or
behavioural characteristics to authenticate users. These biometric characteristics are (more or less) permanent and not
changeable. It is also not easy (although in some cases not
principally impossible) to change ones fingerprint, iris or
other biometric characteristics.
Users cannot pass their biometric characteristics to
other users as easily as they do with their cards or passwords.
Biometric objects cannot be stolen as tokens, keys, cards
or other objects used for the traditional user authentication,
yet biometric characteristics can be stolen from computer
systems and networks. Biometric characteristics are not
secret and therefore the availability of a users fingerprint
or iris pattern does not break security the same way as
availability of the users password. Even the use of dead or
artificial biometric characteristics should not let the attacker
in.
B. Security analysis of Chaotic Algorithm for Image Encryption
The chaotic image encryption algorithm belongs to
one-time-one-password system which was proved to be secure by Shannon[5]. The floating-point-number , and x0
of the chaotic map may represent the key of the encryption
algorithm.
Experimental analysis shows that the phase space
of the proposed NCA map satisfies uniform distribution
property.Trials show that the NCA map has many characteristics of traditional cryptography, such as balanced 01 ratio,
zero co-correlation and ideal nonlinearity. Therefore, image
encryption based on NCA can resist grey code attack and
statistic attack strongly [4].
The encryption algorithm proposed in the paper has
the ability to resist brute-force attack. Encryption key is
pivotal and integrant for cryptanalysis. The key of the new
algorithm consists of three floating-point numbers. If we use
the first 15 digits of a floating-point number, then there are
15 + 15 + 15 = 45 uncertain digits. So the possible key
number is 1045 , which is much more than that of the 56-bitDES algorithm: 256 . While DES is an acknowledged secure
encryption algorithm. So it can be seen that the new chaotic
- 191 -
ICEIC 2015
image encryption algorithm is good at resisting brute-force
attack.
V. C ONCLUSION
The security of the ATM (Automated Teller Machine) system has been improved by generatnig two visual cryptography shares of the fingerprint template of the user. Two shares
are encrypted with Chaotic Image Encryption with PIN2 as
key and share1 is stored in the users ATM card and share2 is
stored in the banks database. For the authentication of user,
the user first enter the PIN number and the ATM machine
checks the first level authenticity. Then the fingerprint of the
user is captured using the fingerprint sensor for the second
level authenticity. For that the ATM machine retrieves the
two shares of the fingerprint one from the users ATM card
and second from the banks database, decrypt the two shares
and stacked two generate the fingerprint template. Then the
fingerprint template is compared with fingerprint given by
the user and the authentication is success is both are same.
As only one encrypted share is stored in the banks database
attack on the database does not reveal any information about
the fingerprint.
R EFERENCES
[1] Prof. Selina Oko and Jane Oruh ENHANCED ATM SECURITY
SYSTEM USING BIOMETRICS, 3rd ed. IJCSI International
Journal of Computer Science Issues, Vol. 9, Issue 5, No 3,
September 2012 ISSN (Online): 1694-0814.
[2] Nazanin Askari and Cecilia Moloney and Howard M. Heys,
Application of Visual Cryptography to Biometric Authentication, 3rd ed. International Journal of Computer Applications
(0975 888).
[3] S. Koteswari and P. John Paul, VC of IRIS Images for ATM
Banking, 3rd ed. International Journal of Computer Applications (0975 888).
[4] Vaclav Matyas and Zdenek Rha BIOMETRIC AUTHENTICATION SECURITY AND USABILITY, 3rd ed. IEEE.
[5] Chen GR and Mao YB A symmetric image encryption scheme
based on 3D chaotic cat maps, 3rd ed.
Chaos, Solitons
Fractals 2004;21:74961
[6] A.K. Jain and A. Ross Biometrics: a tool for information
security, 3rd ed. IEEE Transaction on Information Forensics
and Security, vol. 1, no. 2, Jun. 2006.
[7] Sandeep Katta, Visual Secret Sharing Scheme using Grayscale
Images, Department of Computer Science, Oklahoma State
University Stillwater, OK 74078.
[8] J K Mandal and S Ghatak, Secret Image / Message Transmission through Meaningful Shares using (2, 2) Visual Cryptography, IEEE-International Conference on Recent Trends in
Information Technology, ICRTIT 2011.
[9] Zhou Zhe and Yang Haibing and Zhu Yu and Pan Wenjie and
Zhang Yunpeng, A Block Encryption Scheme Based on 3D
Chaotic Arnold Maps, 2009 International Asia Symposium
on Intelligent Interaction and Affective Computing.
- 192 -
ICEIC 2015

Oral Session
FO-1-4
Communication Software, Services, and
Applications
FO-1-4-1
A Massive MIMO Architecture for Highly Efficient

mm-Wave Communications with Saturated
Amplifiers
Rui Dinis(1,2) , Paulo Montezuma(1,2,3) , Pedro Bento(1,4) , Marco Gomes(1,4) , Vitor Silva(1,4)
(1)
Instituto de Telecomunicaco es (IT), Portugal.

DEE, FCT Universidade Nova de Lisboa, Portugal.
(3) Uninova, Instituto de Desenvolvimento de Novas Tecnologias, Quinta da Torre, Caparica, Portugal.
(4) Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal.
(2)
Abstract - Although millimetre wave (mm-Wave) communications are expected to be a key part of 5G, these
frequencies present considerable challenges due to high
propagation free-space path losses and implementation
difficulties. For this reason, it is desirable to have broadband mm-Wave communications with good power and
spectral efficiencies that are compatible with high efficiency
amplification.
In this paper we propose a massive multiple-input and
multiple-output (MIMO) architecture for broadband mmWave communications that can employ highly-efficient,
low-cost saturated amplifiers with any constellation,
even large quadrature amplitude modulation (QAM)
constellations or other dense constellations with high
spectral efficiency.
Index Terms: mm-Wave communications, multilevel modulations, power-efficient amplification, massive
MIMO.
I. I NTRODUCTION
5G (Fifth Generation) systems are supposed to have much
higher capacity and spectral efficiency requirements than current systems, and many techniques are independently emerging
for these systems [1]. Millimetre wave (mm-Wave) communications are expected to be a crucial part of 5G systems [2],
[3], and there are already some standards like 802.11ad [4].
These systems use carrier frequencies above 30 GHz where
we have large unoccupied bandwidth (there are proposals for
several bands in the vicinity of 40GHz, 60Ghz, 70GHz, or
even above [2], [5]).
However, mm-Wave transmission has important problems
like high free-space path losses, very small diffraction effects,
huge losses due to obstacles and implementation difficulties,
namely with the power amplification [3]. In the other hand,
the small wavelength means that we can have small antennas
and small-sized antenna aggregates with a large number of
elements, allowing the deployment of massive multiple-input
multiple-output (MIMO) schemes [2]. Moreover, the high
reflection effects can be used to improve coverage [3]. By

taking advantage of these characteristics we can design mmWave communications with capacities several orders magnitude above current wireless systems. In fact, mm-Wave
systems can take full advantage of techniques like small cells
networks (pico or femto) and massive MIMO schemes. By
combining small cells with massive MIMO systems we can
have large beamforming gains to cope with propagation losses
and/or accommodate a large number of co-channel users, with
high frequency reuse [1].
As other wireless systems, mm-Wave communications
should have high power and spectral efficiencies, which are
conflicting requirements. In general, high spectral efficiency
means using large constellations and strictly band-limited
signals, which have high power requirements and the inherent
high peak-to-average power ratio (PAPR) leads to low amplification efficiency [6].
The high bit rates combined with good reflection effects can
make the mm-Wave channel highly time-dispersive. Orthogonal frequency division multiplexing (OFDM) [7] is widely
recognised as the first choice for severely time-dispersive
channels. However, the high PAPR of OFDM signals lead
to amplification difficulties. For this reason, single-carrier
with frequency domain equalization (SC-FDE) is preferable
for systems with severe power constraints [6], [8]. Although
the PAPR problem is much more serious with OFDM-based
schemes, it can still be important for high spectral efficiency
single-carrier (SC) schemes, especially when large compact
constellations are employed. Therefore, conventional SC signals still require quasi-linear amplifiers. To allow the use of
grossly nonlinear amplifiers (NL), which have much lower
complexity and have higher amplification efficiency, we need
constant or almost constant envelope signals. This can be
achieved by using OQPSK-type (offset quaternary phase shift
keying) schemes (i.e., signals that can be decomposed as the
sum of several linear OQPSK components [9], and that include
as special cases gaussian minimum shift keying (GMSK) and
other continuous phase modulation (CPM) schemes [10]),
we can have good tradeoffs between reduced envelope fluc-
- 194 -
ICEIC 2015
tuations and a compact spectrum. An efficient frequencydomain receiver for offset modulations based on the iterative
block decision feedback equalization (IB-DFE) concept [11]
was recently proposed [12]. Moreover, larger constellations
can decomposed as the signals as the sum of binary phase
shift keying (BPSK) or OQPSK components [13], that can
be separately amplified without distortion (or with reduced
distortion) by different NL amplifiers [14].
In this paper we propose a massive MIMO architecture for
broadband mm-Wave communications that can employ highlyefficient, low-cost saturated amplifiers.
This paper is organized as follows: section II describes the
basic concepts behind the proposed architecture. Section III
considered the transmitter structure and section IV considers
the receiver structure. Finally, section V concludes the paper.
where s = [s1 s2 ... sM ]T , g = [g0 g1 ... gM 1 ]T and W

is an appropriate Hadamard matrix with dimensions M M .
Therefore, the coefficients g for a given constellation s are
given by g = W1 s.
Clearly, (1) means that the signal associated to a given
constellation can be written as the sum of up to M polar
components. Actually, for optimized constellations the center
of mass g0 will be 0 [15], which means that we will have at
most M 1 polar components. However, for some constellations such as QAM constellations the number of non-zero
components can be much lower [13]. Since each of these polar
components can be modulated as a BPSK signal, this means
that the signal associated to any size-M constellations can be
decomposed as the sum of up to M BPSK signals, although
in general these signals will have different amplitudes and/or
phases.
II. S IGNAL C HARACTERIZATION

B. BPSK Components as Serial OQPSK Signals
A. Decomposition in BPSK Components

The use of mm-Wave frequencies means substantial propagation difficulties due to the high propagation free-space path
losses and huge attenuation by obstacles. This leads to severe
power constraints, together with significant shadowing effects.
However, mm-Wave signals have good reflection properties,
and reflected rays can be used to improved the total received
power and to reduce shadowing effects. To take full advantage
of rich propagation effects we will consider the use of SC-FDE
schemes, which, as already pointed out, are preferable from
the amplification point of view since the transmitted signals
can have relatively low envelope fluctuations. However, for
large compact constellations the transmitted signals can still
have substantial envelope fluctuations.
To overcome this problem, we will take advantage of the
fact that the signals associated to a given size-M constellation
(PSK, QAM, Voronoi or any other constellation [15]) can be
decomposed as the sum of up to M polar components [13].
The basic idea is the following. Let us consider a given sizeM constellation of complex-valued symbols sn S, with S
denoting the set of constellation symbols (i.e., #S = M ) and
(2)
()
(1)
(n , n , ..., n ) are the = log2 (M ) bists associated to
the nth constellation symbol sn . Then
(2)
(1) (2)
(3)
sn = g0 + g1 b(1)
n + g2 bn + g3 bn bn + g4 bn + ...

M
1
1
m,i M
X
Y
X
=
gi
b(m)
=
gi beq(m)
,
n
n
i=0
m=1
(1)
i=0
with (,i 1,i ... 2,i 1,i ) denoting

m,i the binary represen
Q
(m)
eq(m)
(m)
(m)
tation of i, bn
=
bn
and bn = (1)n
m=1
with T denoting the bit duration, r(p) (t) denoting the adopted
(p)
pulse shape and an the amplitude of the nth bit2 . For OQPSK
(p)
(p)
signals we have a2n = 1 and a2n+1 = j, i.e., the complex
symbols are alternately 1 and j. However, if the complex
envelope is referred to a frequency shifted from the central
frequency of the spectrum by 1/4T we have
x(s) (t)
(m)
is the polar representation of the bit n . Since we have M

constellation symbols in S and M complex coefficients gi ,
(1) corresponds to a system of M equations that can be used
to obtain the coefficients gi , i = 0, 1, ..., M 1. By putting
(1) in matrix format we have
s = Wg,
The different BPSK components have much lower envelope

fluctuations than the original signal. This suggests the use of a
different power amplifier for each BPSK component. However,
although the points in a BPSK constellation have constant
amplitude, due to the adopted pulse shape the corresponding
analog signal will have some envelope fluctuations and high
dynamic range (the envelope will have frequent zero crossings), which means that a linear amplifier is still required 1 . To
allow the use of low-complexity, highly efficient, grossly nonlinear amplifiers it would be desirable to have BPSK signals
with compact spectrum and very low envelope fluctuations and
dynamic range. This can be achieved by designing the BPSK
components as the serial version of a given OQPSK signal
with good trade-offs between a quasi-constant envelope and a
compact spectrum, as in [16].
The basic idea behind serial OQPSK schemes was originally
proposed in [17] and is the following. Let us consider that the
complex envelope of an OQPSK signal referred to the central
frequency of the spectrum is given by
X
(p)
x(p) (t) =
a(p)
(t nT ),
(3)
n r
(2)
= x(p) (t) exp(jt/(2T ))

X
(s)
=
a(s)
(t nT )
n r
(4)
1 The exception will be the case where rectangular pulses with symbol
duration are employed, but this case is less interesting due to the poor spectral
characteristics
2 The superscript symbols (p) and (s) are used to denote the parallel and
serial implementation versions of a OQPSK signal, recpectivelly.
- 195 -
ICEIC 2015
where
r
(s)
(t) = r
(p)
(t) exp(jt/(2T ))
(5)
and
(p)
n
a(s)
n = an (j) = 1.
(6)
This means that an OQPSK signal can be regarded as a BPSK

signal. From (5), R(s) (f ) = R(p) (f + 1/(4T )) which means
that the power spectrum density (PSD) of the transmitted
signals in serial format is shifted by 1/(4T ) with respect
to its parallel counterpart. Moreover, in general Rs (f ) will
correspond to an asymmetric complex filtering3 .
In our architecture we will take advantage of the relation
between OQPSK signals in the serial format and BPSK
modulations to decompose the signal associated to a general
constellation as the sum of BPSK components with quasi
constant envelope and compact spectrum, so as to allow an
efficient amplification of the different BPSK components.
III. T RANSMITTER S TRUCTURE
The decomposition of the signal associated to a given
constellation in BPSK components and the possibility of
having BPSK signals with reduced dynamic range, together
with compact spectrum by taking advantage of the relation
between OQPSK signals in the serial format and BPSK signals
are the key concepts behind our transmission architecture. Due
to the small wave length of mm-Wave frequencies, we can
have massive MIMO schemes with a large number of antennas
packed in a relatively small space.
We consider the use of SC-FDE schemes based on a given
dense size-M constellation. In this section we describe the
transmitter structure and the following section is concerned
with the receiver design.
The transmitter structure is depicted in fig. 1. The data
bits are separated in Nu streams, each one is mapped in a
given constellation which is the decomposed in Nm M
polar components. Each of the different polar components
are then transmitted as an appropriate OQPSK signal in
serial format, which is designed to have reduced envelope
fluctuations and a small dynamic range, together with compact
spectrum (e.g., as filtered MSK signals or GMSK signals). Due
to the reduced envelope fluctuations each of these components
can be separately amplified with minimum distortion or even
no distortion at all by a low complexity, high efficiency grossly
nonlinear amplifier.
By combining the amplifiers outputs we would obtain
the signal associated to the intended constellation. However,
combining these signals is not simple because we can have
high combination losses and/or nonlinearity problems at the
combiner. To overcome this problem we will send each of the
Nm components of each of the Nu sub-streams to a different
antenna. The set of Nm amplifiers, each one combined with a
3 Actually, OQPSK signals in the serial format can be regarded as a kind
of single side band modulation, which explains the better spectral efficiency
of this kind of BPSK modulation when compared with conventional BPSK
modulations.
separate antenna performs some constellation shaping that is

a function of the intended direction of radiation [18]. To avoid
this shaping and simplify its compensation, the Nm antennas
are placed vertically (where the direction of radiation is almost
constant) and these antennas are assumed to be close to each
other, with separation much lower than /2 (with denoting
the wavelength). The signals submitted to the Nm antennas
associated to a given constellation symbol might have to be
properly phase-shifted to allow the desirable constellation in
a given direction [18].
The signal associated to each of the Nm BPSK/OQPSK
components can be transmitted by Nb antennas instead of
a single one, so as to allow beamforming effects. These Nb
antennas are usually spaced by /2 and should be placed horizontally, since directive beams are usually intended to point
to different azimuths (i.e., different horizontal directions).
Therefore, we will have a transmitter with Nu sets of Nm Nb
antennas. These sets are separated by a distance much higher
than the wavelength so as to allow spacial multiplexing gains4 ,
as in a conventional layered space-time (LST) scheme [19].
This means that we will have a massive antenna transmitter
with a total of Nu Nm Nb antennas that employs saturated
amplifiers and allows spacial multiplexing and beamforming
gains.
IV. R ECEIVER S TRUCTURE
At the receiver we have Nr Nb receiver antennas grouped
in Nr sets of Nb antennas with the Nr sets separated by
a distance much higher than the wavelength and the Nb
beamforming antennas within each set are typically separated
by /2 (in general the value of Nb does not need to be the
same at the transmitter and the receiver, although it is desirable
to have at least as many sets of antennas at the receiver as the
number of sets of Nm Nb antennas used in the transmitter,
i.e., Nr Nu ).
After combining the received signals associated to the
Nb beamforming antennas the receiver is essentially an SCFDE receiver with Nu receiving branches. The basic receiver
structure is depicted in fig. 2 (for the sake of simplicity we
did not depict the beamforming part). The equalization and
separation of the Nu data streams is performed by a frequencydomain receiver based on the the extension of the receiver
proposed in [19] for general constellations [13]. However, this
receiver needs to be appropriately modified taking into account
the OQPSK nature of the transmitted signals, as proposed in
[12].
The received blocks associated to each of the Nr sets
of receive antennas are sampled, the corresponding cyclic
prefixes are removed and the resulted blocks are submitted
to DFT blocks, leading to a set of Nr frequency-domain
(r)
blocks {Yk ; k = 0, 1, ..., N 1}, r = 1, 2, Nr . To detect the
data symbols associated to a given data stream. These blocks
4 Actually, the spacial multiplexing gain can be higher than the number of
sets of Nm Nb antennas, since we can have multiple beams, each one
with the data symbols associated to a given user (provided the users can be
spatially separated by the Nb beamforming antennas, naturally).
- 196 -
ICEIC 2015
1
0
0...
100
10
01
.
00 ..
...
...
...
.....
....
...
HIGH BIT RATE

DATA STREAM
SPATIAL
MULTIPLEXER
(NU SUB-STREAMS)
PHASE
SHIFTER
DAC
QAM
MODULATOR
...
BEAMFORMING
Nb
NU PATCH
ANTENNAS
</2
NONLINEAR
POWER AMPLIFIER
POLAR
DECOMPOSITION
(BPSK/OQPSK)
Nm COMPONENTS
...
...
...
...
...
...
Nm
POLAR
DECOMPOSITION
/2
Fig. 1. Transmitter structure.
(1)
Fk,(n)
+
(1)
Yk
(2)
Fk,(n)
Sk,(p)
sn,(p)
IDFT
(2)
+
+
Yk
(1)
(Nr )
Sk,(0)
Yk
sn,(1)
Sk,(Nu )
Nu
Fig. 2. Iterative receiver structure.
are submitted to a set of Nr frequency-domain feedforward

(r)
filters {Fk ; k = 0, 1, ..., N 1}, one for each of the
signal associated to each of the Nu receive antenna sets.
The data estimates associated to each data stream are used
to compensate transmission imperfections (frequency offsets
[20], [21], phase noise [22], [23], channel estimation errors
[24], etc.) and to remove residual inter-symbol interference and
other interference through the set of Nu feedback coefficients
(u)
{Bk ; k = 0, 1, ..., N 1}, each one using the estimates of
a given data stream from the previous iteration (more details
could be found in [19]).
DFT
sn,(Nu )
(N )
u
Bk,(p)
DFT
Nr receiving antenas
Nr
sn,(p)
Bk,(p)
(N )
r
Fk,(n)
Nu streams (Spatial Multiplexing)
Soft Demodulation
Estimation and
Compensation of
Transmission Impairments
This concept can be extended to a massive MIMO scenario

which employs Nu sets of Nm Nb antennas, allowing
beamforming and spacial multiplexing gains.
ACKNOWLEDGMENTS
This work was supported in part by FCT (pluriannual
funding) from Uninova (PEst-OE/EEI/UI0066/2011) and
IT (PEst-OE/EEI/LA0008/2013 P01229-GLANCES)
and
projects
GALNC
(EXPL/EEI-TEL/1582/2013),
EnAcoMIMOCo
EXPL/EEI-TEL/2408/2013,
CoPWIN
PTDC/EEI-TEL/1417/2012, and DISRUPTIVE EXCL/EEIELC/0261/2012.
V. C ONCLUSIONS
R EFERENCES
In this paper we proposed a massive MIMO architecture for

broadband mm-Wave communications that can employ highlyefficient, low-cost saturated amplifiers with any constellation,
even large QAM constellations or other dense constellations
with high spectral efficiency. The basic idea behind this
architecture is to decompose the signal associated to a given
constellation as the sum of Nm polar components that can
be used to modulate Nm BPSK signals or OQPSK signals in
the serial format. Each of these Nm signals is then separately
amplified and submitted to a set of Nb beamforming antennas.
[1] Boccardi, F; Heath, R.W.; Lozano, A; Marzetta, T.L.; Popovski,

P., Five disruptive technology directions for 5G, IEEE Communications Magazine, vol.52, no.2, pp.74,80, Feb. 2014.
[2] Rappaport, T.S.; Shu Sun; Mayzus, R.; Hang Zhao; Azar, Y.;
Wang, K.; Wong, G.N.; Schulz, J.K.; Samimi, M.; Gutierrez, F.,
Millimeter Wave Mobile Communications for 5G Cellular: It
Will Work!, Access, IEEE , vol.1, no., pp.335,349, 2013.
[3] Rangan, S.; Rappaport, T.S.; Erkip, E., Millimeter-Wave Cellular Wireless Networks: Potentials and Challenges, Proceedings
of the IEEE , vol.102, no.3, pp.366,385, March 2014.
- 197 -
ICEIC 2015
[4] IEEE 802.11 Task Group AD, PHY/MAC Complete Proposal
Specification, IEEE 802.11-10/0433r2, May 2010.
[5] S. Nie, G. MacCartney, S. sun, T. Rappaport, 28 GHz and
73 GHz Signal Outage Study for Millimeter Wave Cellular and
Backhaul Communications, IEEE ICC2014, Sydney, Australia,
Jun. 2014.
[6] D. Falconer, S. Ariyavisitakul, A. Benyamin-Seeyar and B. Eidson, Frequency Domain Equalization for Single-Carrier Broadband Wireless Systems, IEEE Comm. Mag., vol. 4, no. 4, pp.
5866, April 2002.
[7] J. Cimini, Analysis and Simulation of a Digital Mobile Channel Using Orthogonal Frequency Division Multiplexing, IEEE
Trans. on Comm., vol. 33, pp. 665675, Jul. 1985.
[21] P. Pedrosa et al., Iterative Frequency Domain Equalization and

Carrier Synchronization for Multi-resolution Constellations, IEEE
Trans. on Broadcasting, Vol.56, No.4, pp. 551-557, Dec. 2010.
[22] P. Pedrosa et al., Phase Drift Estimation and Symbol Detection
in Digital Communications: A Stochastic Recursive Filtering
Approach, IEEE Communications Letters, Vol. 16, No. 6, pp.
854-857, June 2012.
[23] P. Pedrosa et al., Joint Equalization and Gaussian Sums Particle Filtering Phase Noise Estimation, IEEE ICC2014, Sydney,
Australia, Jun. 2014.
[24] R.Dinis, C.Lam and D.Falconer, Joint Frequency-Domain
Equalization and Channel Estimation using Superimposed Pilots,
IEEE WCNC08, Las Vegas, USA, Mar-Apr. 2008.
[8] A. Gusmao, R. Dinis, J. Conceica o and N. Esteves, Comparison

of Two Modulation Choices for Broadband Wireless Communications, IEEE VTC00(Spring), vol. 2, May 2000.
[9] A. Gusmao, V. Goncalves, N. Esteves, A novel approach to modeling of OQPSK-type digital transmission over nonlinear radio
channels, IEEE Journal on Selected Areas in Communications,
vol. 15, no. 4, pp. 647-655, 1997.
[10] T. Aulin, N. Rydbeck, C.-E. Sundberg, Continuous phase modulation - Part II: partial response signaling, in IEEE Transactions
on Communications, vol. 29, no. 3, 1981, pp. 210-225.
[11] N. Benvenuto, R. Dinis, D. Falconer and S. Tomasin, Single Carrier Modulation with Non Linear Frequency Domain
Equalization: An Idea Whose Time Has Come - Again, IEEE
Proceedings, vol. 98, no. 1, page 69-96, Jan. 2010.
[12] M. Luzio, R. Dinis, and P. Montezuma, Pragmatic Frequency
Domain Equalization for Single Carrier with Offset Modulations, IEEE Transactions on Wireless Communications, Vol. 12,
No. 9, pp. 4496 4505, Sep. 2013.
[13] R. Dinis, P. Montezuma, N. Souto, and J. Silva, Iterative
Frequency-Domain Equalization for General Constellations, 33rd
IEEE Sarnoff Symposium 2010, Princeton, USA, Apr. 2010.
[14] P. Carvalho, R. Dinis, M. Beko, Efficient Amplification and
Detection of Multilevel SC-FDE Signals Based on BPSK Components, IEEE Military Communications Conf. - MILCOM, San
Diego, US, Vol. 1, pp. 1 - 6, Nov. 2013.
[15] M. Beko, R. Dinis, Designing Good Multi-Dimensional Constellations, IEEE Wireless Communications Letters, vol.1, no.3,
pp.221,224, June 2012.
[16] P. Montezuma, Highly efficient encoded OQPSK signals:
emission and reception design aspects, IEEE MILCOM2006,
Washington, USA, Oct. 2006.
[17] F. Amoroso and J. Kivett, Simplified MSK Signalling Technique, IEEE Trans. on Comm., Vol. 25, Apr. 1977.
[18] P. Montezuma, R. Dinis, D. Marques, Robust FrequencyDomain Receivers for A Transmission Technique with Directivity
at the Constellation Level, IEEE VTC2014 (Fall), Vancouver,
Canada, Sep. 2014.
[19] R. Dinis, R. Kalbasi, D. Falconer and A. Banihashemi, Iterative
Layered Space-Time Receivers for Single-Carrier Transmission
over Severe Time-Dispersive Channels, IEEE Comm. Letters,
Vol. 8, No. 9,pp. 579581, Sep. 2004.
[20] R.Dinis et al., Joint Turbo Equalization and Carrier Synchronization for SC-FDE Schemes, European Trans. on Telecomm.,
Vol. 21, No. 2, pp.131-141, Mar. 2010.
- 198 -
FO-1-4-2
Reflectance Properties of One Dimensional Photonic Crystals

Firdaus Akbar1, Ary Syahriar2
Electrical Engineering, University of Al Azhar Indonesia
akbar_firdaus@yahoo.com1, ary@uai.ac.id2
Abstract
Photonic crystal is a periodic dieletric material that
has a unique property of photonic bandgap. Photonic
bandgap is a phenomenon where a range of light
frequency blocked or cannot propagate through the
structure. The bandgap shown using a photonic band
structure diagram and the blocking effect can be seen
from the reflectance properties of the structure. In this
paper, the structure is one dimensional photonic
crystal with dielectric material Silicon (Si) and air for
the gap. We use transfer matrix method to calculate the
results. Comparing the results of photonic band
structure diagram with the reflectance properties, we
obtain the proof for the bandgap occured.
Keywords: Photonic crystal, photonic bandgap,
reflectance properties, transfer matrix method.
1. Introduction
From figure 1, we can see that in one dimensional

photonic crystal, the dielectric medium periodicity was
often mentioned as a unit cell. A one dimensional unit
cell consists of two layer of different dielectric medium
and it is infinitely periodic through one direction only.
Parameters n1 and n2 is the refractive index of
medium 1 (Silicon) and 2 (air) respectively. To clearly
analyze the photonic bandgap, we need to choose a
layer of dielectric material and air because the
differences of refractive index between them is huge,
so that the size of the bandgap will also wider.
2. Theory
The structure of one dimensional photonic crystal
consists of different stack of dieletric layer. The
layered dielectric medium can be seen as a matrix
system that obtained from the sum of individual layer
matrices. The matrix that we use is scattering matrix
and transfer matrix. The scattering matrix diagram is,
The periodic dielectric function on photonic crystal

will have a unique properties of photonic bandgap. It is
a phenomena where a range of light frequency that
propagate through the structure will be blocked.
It happened because the light propagate through a
different dielectric material and the transmission and
reflection properties on one medium is different with
the other medium.
Figure 2. Scattering matrix diagram
And transform it into mathematical formula,
U 2 t12U1 r21U 2
U1 r12U1 t21U 2
Equation (1) then transformed into matrix form.

Figure 1. Photonic crystal structure and unit cells
- 199 -
(1)
ICEIC 2015
U t
2 12
U r12
1
r21 U1
t21 U
2
(2)
In this condition, we cannot multiple the matrix in

every layer, we need to transform it into a terms of
total field on the left and right side for the matrix
computation. So that it changed into another sets of
matrices,
U A B U
1
2
U C D U
2
1
(3)
For the simulation, the width of dielectric medium
Silicon (Si) is 0.8 m and the air gap is 0.2 m. Total
unit cell is 1 m for mathematical convenience in the
simulation results. The refractive index of the Silicon
(Si) is 3.3252 and air gap 1. We also change the
frequency
into
normalized
frequency
norm d 2c .
The simulation results of photonic band structure
diagram:
Equation (3) is a sets of transmission matrices. The

relation between them can be obtained as,
A B 1 t12t21 r12r21 r21
M
r12
1
C D t21
r 1 AD BC B
t
S 12 21
1
r12 t21 D C
(4)
From the sum results we can obtain the reflectance

properties for the layered dielectric medium and
transform it into dispersion relation. The method is
then applied to electromagnetic waves with a specific
frequency propagating through the layer at normal
incidence angle.
From the transfer matrix method, assuming that our
structure is a periodic dielectric layer, we can get the
reflection properties equation,
4n1n2
4n1n2
i k d k d
i k d k d
r 1
e 1 1 2 2
e 1 1 2 2
2
n1 n2 2
n1 n2
(5)
Figure 3. Photonic bandstructure simulation

Figure 3. shows the photonic bandstructure that
obtained from the dispersion relation. The blue line is
the dispersion relation results in every point of
normalized frequency. We can cleary see a region of
gap in the results, where in that region there is no
solution. To proof that this gap is actually blocking a
range of frequency, we need to analyze the reflectance
properties,
Where n1 and n2 is the refractive index, k1 and k2 is

the wavevector, d1 and d2 is the width of the medium 1
and 2, respectively. And the dispersion relation,
2
n1 n2
n n
cos k.d cos n1d1 n2d2

sin 1 d1 sin 2 d2
c
2
n
n
c
c
1 2
1
2
(6)
Where c0 is the speed of light in vacuum, and is

frequency. Thus, we can obtain the bandstructure
diagram that show the photonic bandgap. We then
analyze the reflection properties and compare it into
the bandstructure to get the proof of the bandgap.
Figure 4. The reflectance properties of bandstructure

diagram
From the Figure 4. above, we can clearly see the proof
of the bandgap that occur on Figure 3. The reflectance
- 200 -
ICEIC 2015
value is increased through higher normalized frequency
value. Although we use normalized value and the
results only valid below 1, we simulate it until
normalized value 2 to show the increasing reflectance
properties. As can be seen in Figure 5. below,
Figure 5. Reflectance properties on each bandgap
4. Conclusions
The photonic bandstructure can be used to show the
bandgap occured in the normalized frequency value.
But to obtain the proof, we need to compute its
reflectance properties. The reflectivity is increased
when the value of normalized frequency is higher.
Because the simulation is using normalized frequency,
the valid results is only on below normalized value 1.
References
[1] L. Lee, Donald. Electromagnetic Principles of Integrated
Optics. Florida, USA. John Wiley & Sons, 1986.
[2] J. D. Joannopoulos, R. D. Meade and J.N. Winn,
Photonic Crystals: Molding the Flow of Light. Princeton,
NJ: Princeton University Press, 1995.
[3] K. Sakoda, Optical Properties of Photonic Crystals.
Berlin, Germany: Springer, 2001.
[4] S. G. Johnson and J. D. Joannopoulos, Photonic
Crystals: The Road from Theory to Practice. Boston, MA:
Kluwer Academic Publishers, 2002.
[5] Skorobogatiy. M, Yang, Jianke. Fundamentals of
Photonic Crystal Guiding. USA: Cambridge University
Press. 2008.
[6] A. Sukhoivanov, Igor, V.Guryev, Igor, Photonic Crystals:
Physics and Practical Modeling. Springer: London. 2009.
- 201 -
FO-1-4-3
Smartphone-based Train Tracking Information Systems for Awareness and

Safety Enhancement
Adhitya Bhawiyuga
Program of Information Technology and Computer Science
University of Brawijaya
bhawiyuga@ub.ac.id
Abstract
Train is one of the popular mass transport system
used in Indonesia. However, the current train system in
Indonesia faces a problem of the high accident rate in
railway crossing. In this paper, we propose the design
and implementation of an integrated train tracking
system to enhance the awareness of the railway
crossing officer. In this system, we develop two
integrated applications. The first application is an
Android application which is used to obtain the train
position estimate by using the built in A-GPS receiver
in the smartphone. Then, the received position estimate
is sent to the server to update the position information
of a train. If a train is approaching a railway crossing
within a distance threshold, second application in the
server broadcast a notification message to railway
crossing officer through the sms-gateway. From the
experiments, our proposed system is feasible enough to
be implemented in the train system.
Keywords: train, GPS, smartphone, tracking, sms
gateway, xml-rpc.
1. Introduction
Train becomes one of the popular transportation
systems in Indonesia due to its capability of carrying
massive number of passengers for long distance trip
with a relatively low price. Every year, the whole trains
system carries around 15 million peoples to travel [1,2].
To provide the service of train system, the railway link
across the Java island has been intensively built since
the 19th centuries. In some cases, the railways are
installed through the urban areas.
Since some of the railways may across road
segments intentionally provided for cars and
motorcycles, it arises a safety issue for these kinds of
vehicles. For example, as a train is approaching railway
crossing, there is a possibility that a car enters the gate
of railway crossing at the same time. This condition
may leads to a dangerous collision. Therefore, a
signaling and gating system are highly required to avoid
the car accessing the crossing road while the train is

crossing.
Unfortunately, in the recent time, most of the
railway crossing in Indonesia incorporates an officer to
manually close the crossing gate just before the train is
entering. In several cases, the officer forgets to close the
crossing barrier which may leads into a serious train-car
crash. To avoid such case, one of the solution is to
provide an automatic railway crossing gate system [3-5].
This automatic system works by providing a sensor to
detect whether there exists a train entering the railway
crossing or not. However, considering the numerous
amount of crossing along the railway link,
implementing an automatic railway crossing gate can be
very costly. Therefore, instead of providing an
automatic railway crossing system, in this paper, we
consider a challenging goal to provide a system which
can enhance the awareness of the railway crossing
officer.
Taking into account the above challenge, we
propose a design and implementation of train tracking
system called Traindroid which consists of two
integrated applications : 1) the Android application
which obtains the train GPS position estimate then send
it to server and 2) server which send the short message
(sms) to crossing officer when the train is approaching a
crossing.
2. Design and Implementation
Figure 1 System architecture and scenario
Fig.1 illustrates the architecture of our proposed

system. Our system consists of two applications. The
first application is the Android-based application which
is used to obtain a position estimate from built-in AGPS receiver and updates those position information by
- 202 -
ICEIC 2015
sending a XML-RPC message through 3G cellular
network. On reception of the train position information,
the server store those information in a central database
and the second application in server calculates the train
distance to all railway crossing.Then, the server will
send a notification message to the crossing officer
through sms gateway if the Haversine distance [6]
between train position ( , ) and the crossing railway
position ( , ) is below a threshold such that <
while
= 2 sin1 (sin2 (

) + sin2 (
) cos cos (1),
2
2
Fig.2 illustrates the PDF of the GPS position error

inwhich the position-error samples are grouped into a
granularity of 0.1 m. From this experiment, we observe
that, although the GPS position error exceeds 20m in
some cases, most of the GPS position errors (95
percentile) are within 12.5m. In addition, by assuming
that the position error can be approximated with
Gaussian distribution, we can conclude that the RMS
error of the GPS estimate is 6.25 meters. Based on this
experiment, we set the value of parameter by 25
meters which considers more than 99% of the position
error.
2. Position Update Delay Testing
and
(2),
= +
where is the radius of earth, is the GPS error in
meter, is theminimal distance from train to the
railway crossingwhen the officer can receive a
notification. Notice that is obtained from the
performance evaluation of position accuracy while
can be approximately set to 600 meters by considering
the train speed as 30 m/s and time needed to close the
gate as 20 second .
3. Testing and Evaluation

In this section, we present our experiment to test
and evaluate the feasibility of our proposed system. The
experiment includes GPS position accuracy testing and
position update delay testing.
1. Position Accuracy Testing
The aim of this experiment is to observe the time

needed to perform a position update from mobile
application to server. This experiment is conducted by
sending the train position estimate to server. Then, the
sending time in client is compared with receiving time
in server. From this experiment, we obtain that average
of transfer speed by using EDGE connection is about
5,638333 seconds, while using HSDPA we get about
3,1287 seconds. From this result we can conclude that
by using HSDPA conncection, transfer speed is faster
than by using EDGE connection. However, EDGE itself
is still feasible for position update purpose.
A. CONCLUSION
In this paper, we proposed the design and
implementation of an integrated train tracking system to
enhance the safety by increasing the awareness of train
crossing officer. From the experiments, our proposed
system is feasible enough to be implemented in the train
system.
B. REFERENCES
Fig.2 Probability density function of GPS position error group by

0.1m granularity
In this experiment we evaluate the position

accuracy of the GPS position estimate by measuring the
GPS position error. The position error of a GPS position
estimate is considered as the Haversine distance
between the fixed true reference position and those GPS
position estimate.
[1]. Indonesian Statistic Bureau, The Amount of Indonesian Train

Passenger, 2013. Online at
http://www.bps.go.id/tab_sub/view.php?tabel=1&daftar=1&id_s
ubyek=17&notab=16
[2]. Train Department, Ministry of Transportation Republic of
Indonesia, Statistics of Passengers and Goods, 2010. Online at
http://perkeretaapian.dephub.go.id/index.php?option=com_conte
nt&view=article&id=63&Itemid=63
[3]. Harland Sydney A. Automated Railway Crossing, US Patent
6241197, June 5, 2001.
[4]. J. Banuchandar, V. Kaliraj, P. Balasubramanian, S. Deepa, N.
Thamilarasi, Automated Unmanned Railway Level Crossing
System, International Journal of Modern Engineering Research
(IJMER), Vol.2, Issue.1, pp 458-463, Jan-Feb 2012
[5]. N. Fakhfakh, L. Khoudour, E.M. El-Koursi, J. Jacot, A. Dufaux,
A Video-Based Object Detection System for Improving Safety
at Level Crossings, The Open Transportation Journal, Vol.5,
pp.45-59, 2011.
[6]. R. W. Sinnott, Virtues of the Haversine, Sky and Telescope, 68
(2) pp.159 , 1984.
- 203 -
FO-1-4-4
Effects of Close Eigenvalues in Communication Performance

in MIMO Eigenbeam Space Division Multiplexing
Yusuke DOHI, Tetsushi IKEGAMI
Department of Electrical Engineering, Graduate School of Science and Technology,
Meiji University
dohi@meiji.ac.jp, ikegami@isc.meiji.ac.jp
Abstract
The effects of close Eigenvalues in communication
performance were studied in MIMO Eigenbeam Space
Division Multiplexing (E-SDM) using ITU-R M.2135-1
time variant channel model. The results showed
increased velocity of phase angle variation because the
transmission and the receiving weights become more
sensitive for smaller gap between eigenvalues. Based on
the simulation results, we constructed the adaptive
control method of channel estimation time periods and
evaluated the bit error rate (BER) characteristics. It is
clear from the results that the gap is an effective
parameter in the adaptive control of MIMO E-SDM
technique.
In this paper, the velocity of the phase angle variation

is evaluated by using ITU-R M.2135-1 propagation
channel model [6]. The communication performance
deteriorates by increasing the velocity. The simulation
results clear that the velocity is likely to increase in case
of more close Eigenvalues.
In addition, we constructed an adaptive control of the
channel estimate time periods based on the simulation
results. Lastly, we showed the effectiveness of an
adaptive control based on the Eigenvalues gap in MIMO
E-SDM.
2. Simulation Parameters
Table 1 shows the simulation parameters for fixed
estimate time periods.
Keywords: MIMO, E-SDM, Close Eigenvalues, Time

Variant Channel Model, Adaptive Control
Table 1: Simulation Parameters

Parameter
Number of Transmission array
antenna elements
Number of Reception array
antenna elements
Array antenna element spacing
(Transmission and Receive)
Propagation Environment
Propagation Condition
MS Velocity
MS Direction
Center Frequency
Modulation
Bit Rate
Channel Estimation Time Period
1. Introduction
MIMO Eigenbeam Space Division Multiplexing (ESDM) is an effective method for getting a gain by space
diversity and increasing throughput. However, the
method suffers from inherent instability problem [1, 2].
Several studies [3, 4] have pointed out that the order of
Eigenvectors is likely to be misjudged in close
Eigenvalues.
However, it is known that singular vectors and
singular subspaces can be ill-conditioned in terms of
Singular Value Decomposition (SVD). In other words,
the singular vector is more sensitive in the case of
smaller gap between its singular value and closest [5].
In this study, we used the 2x2 MIMO E-SDM system
for our simulation. Here, the channel matrix is estimated
at regular intervals. The transmitter is linked to the
receiver by feedback for the channel matrix. The
transmitter use transmission weight matrix. The receiver
use reception that. Both of them is calculated by SVD
of the estimated channel.
Value
2
2
10 wavelength
Urban Micro-cell
NLOS
3 km/h
-20.817 deg.
5 GHz
QPSK
625 x 103 bps
3.6 x 10-3 sec
(Coherent Time/20)
These values are based on the use case for IEEE

802.11ax Task Group [7]. However, Orthogonal
Frequency Division Multiplexing (OFDM) is out of
scope for excluding Inter-Carrier Interference (ICI)
from simulation results for simplicity.
- 204 -
ICEIC 2015
Figure 1 shows the Median of Eigenvalue Gap Range
bin (MEGR) vs Average Normalized Velocity of Phase
angle Variation (ANVPV). The Eigenvalue gap is
divided by range bin. MEGR is the median of the range
bin. The velocity of phase angle variation is normalized
by the velocity of phase angle variation in maximum
Doppler frequency. ANVPV is the average of the
normalized velocity.
Figure 2: Bit Error Rate
5. Conclusion
Figure 1: Median of Eigenvalue Gap Range bin vs

Average Normalized Velocity Phase angle Variation
The simulation results show that ANVPV depends on
MEGR; the ANVPV is higher at smaller MEGR and
decreases progressively with increasing value of MEGR.
The results suggest that an Eigenvalue gap is
effective for an adaptive control in MIMO E-SDM.
Simulation using ITU-R M.2135-1 channel model

confirmed that ANVPV increased in the case of more
close Eigenvalues. We constructed the adaptive control
of channel estimate time period by Eigenvalues gap and
evaluated BER. The simulation results indicated that a
gap was effective for adaptive control in MIMO E-SDM.
References
4. Adaptive Control of Channel Estimate

Time Period
We constructed the adaptive control of channel
estimate time period by Eigenvalue gaps based on the
simulation results in Figure 1. The fixed period tfixed
(Coherent Time/20) is the datum period. The adaptive
channel estimate time period tadaptive is calculated by
the following equation:
t fixed
(1)
ANVPV MEGR WA
In equation (1), WA is the weight average of
t adaptive MEGR
ANVPV(MEGR) showed in Figure 1. By using a weight

average, the frequency of the adaptive channel estimate
time period is equal to that of fixed period. Figure 2
shows the BER characteristic in adaptive control and
fixed control.
The simulation results show that the SNR gain by
adaptive control is about 3.4 dB in BER=10-4.
- 205 -
[1] Y.Karasawa, MIMO Propagation Channel

Modeling, IEICE Trans. Commun., Vol. E88-B,
No.5, pp.1829-1842, May 2005.
[2] T.Taniguchi, et al., Design of MIMO
communication systems robust to eigenvector
mismatch problem, IEEE ISSPIT, Darmstard,
Germany, Dec.2003.
[3] R.Takemoto, et al., Eigenvector Mismatch
Problem and Its Countermeasure for MIMO MRC
Transmission : In the Case of Inter-Vehicle
Communications at 60GHz, IEICE Trans.
Commun., volJ87-B, no.9, pp.1477-1485, Sept.
2004.
[4] Y.Karasawa, et al., Eigenvector Mismatch
Problem in MIMO Eigen-mode Transmission :
Analysis on Occurrence of Frequency in Rayleigh
Fading Environment, IEICE Technical Report,
AP2005-61, July 2005.
[5] Zhaojun Bai, James Demmel, Jack Dongarra, Axel
Ruhe, Henk A. van der Vorst,Templates for the
Solution of Algebraic Eigenvalue Problems: A
Practical Guide, SIAM, 2000.
[6] Report ITU-R M.2135-1, Guidelines for
evaluation of radio interface technologies for IMTAdvanced, 2009.
[7] IEEE 802.11 TGax Document, 11-14-0980-0200ax-simulation-scenarios, July 2014.
FO-1-4-5
The Sub Optimal Number of Duplicated Packets Determining Method

for Improving QoS in High-Functional Node Network
Tokyo
Akihiro Terashima , Katsunori Yamaoka

Institute of Technology, 2-12-1-S3-68 Ookayama,Meguro-ku,Tokyo,152-8552,Japan
Email: terashima@net.ce.titech.ac.jp, yamaoka@ce.titech.ac.jp
Abstract
To improve the quality of service (QoS) of delay-sensitive
application, a High-functional Node (HN) network is studied.
HNs can operate automatic-repeat-requests between adjacent
HNs. Meanwhile, duplicating packets and transmitting them
along with the original packets between adjacent HNs may
be also effective for improving QoS. However, duplicating
packets causes trafc congestion on the network, so there
duplicated packets should be as few as possible. Thus, we
propose a method for determining the number of duplicated
packets on each link. The method satises the QoS dened
by a delay-sensitive application in advance as the smallest
possible number of duplicated packets. To choose the link
on which packet duplicating is most effective, our proposed
method uses an expectation of one link delay including delay of
retransmission between adjacent HNs. In numerical analysis,
the case is found in which the proposed method is not optimum.
Thus, we analyze characteristics of the proposed method. From
the results, even when networks consist of many links, the
proposed method is shown to be effective. However, when delay
on each link is large or an allowable delay is small, trafc
increases slightly.
Keywords: QoS, livestreaming, High-Functional Node, SDN
1. Introduction
Various delay-sensitive applications such as videophones,
VoIP, and network games are now commonly used by consumers, and their demand is expected to increase in the future.
These applications are delay-sensitive and have a more restricted allowable delay, conventional data transmission applications such as World-Wide-Web and -mail. These applications
discard packets that do not satisfy the allowable delay at
the receiver node. These discarded packets also reduce the
quality of service (QoS) of these applications. Therefore, such
packets that are not transmitted to the receiver node within
the allowable delay should be as few as possible in order to
improve QoS of these applications.
For that reason, some algorithms for recovering lost packets are actually operated in data transfer protocols, such as
Automatic-Repeat-reQuest (ARQ) or Forward Error Correction
(FEC). However, when the end-to-end delay is large, ARQ
takes a long time to retransmit packets. Thus, ARQ is inadequate for delay-sensitive applications in that environment. FEC
is also inadequate because redundant packets are transmitted
on every link on the transmission path between the sender node
and receiver node.
To recover lost packets immediately, a High-functional
Node (HN) network is studied [1][2][3]. High-functional nodes
have advanced functions such as buffering packets, detecting

packet loss, sending retransmission requests, and retransmitting packets. Time required for retransmission between adjacent HNs is shorter than that between the sender node and
receiver node, so lost packets are recovered more quickly by
HNs than end-to-end. However, packet retransmission between
adjacent HNs takes link delay between these HNs. Therefore,
when link delay between adjacent HNs is large or the packet
lossrate on the link is high, the link may become a bottleneck
and packets may not be transmitted to the receiver node within
the allowable delay.
In those kinds of low quality links, duplicating packets and
transmitting them along with the original packets are effective
for improving QoS. When a packet is lost, a duplicated packet
is forwarded in its place, and this operation is quicker than
retransmitting the lost packet between adjacent HNs. However,
duplicating packets causes trafc congestion on every link on
the path, so the number of duplicated packets should be as
small as possible. Thus, we propose a method for determining
the number of duplicated packets on each link. The method
satises the QoS dened by the delay-sensitive application
as the smallest possible number of duplicated packets. Then,
the effectiveness of our method is conrmed by numerical
analysis.
This paper consists of six sections. First, previous studies
concerning improvement of delay-sensitive QoS are introduced
in Section 2. The problem settings of this study are dened in
Section 3. In Section 4, our method is proposed. In Section
5, we describe the case in which our method is not optimum,
and show the results of performance comparison by numerical
analysis. Finally, in Section 6, we present the conclusion and
future works.
2. Related Research
A. Hybrid-ARQ-FEC
To improve quality of a real-time content delivery service,
the Hybrid-ARQ-FEC model has been proposed by previous
researchers [4][5][6][7]. In this method, a sender node sends
redundant data packets along with original data packets. When
an original packet is lost, a receiver node recovers it from
redundant data. Only when a lost packet cannot be recovered
does, a sender node retransmit redundant data packets by
ARQ[8].
First, a sender node generates redundant data packets from
an original data packet by an encoding method and transmits
them along with the original data packet. When a packet is
lost on a link and then does not arrive at a receiver node,
the receiver node recovers it from redundant data packets.
- 206 -
ICEIC 2015
However, when a network is congested, causing a buffer
overow on a node between a sender node and a receiver node,
many packets may be lost. Therefore, the receiver node cannot
recover lost packets any longer even though some redundant
packets have arrived at the receiver node.
In this case, the receiver node sends the number of redundant packets required for recovering the original packet
to the sender node instead of the NAK packet. Only when
the receiver node cannot recover lost packets from redundant
packets does the sender node retransmit only the numbers of
redundant packets required for recovering lost packets. That
means this method combines the advantage of ARQ with the
advantage of FEC.
However, ARQ and FEC are operated between the sender
node and receiver node in the Hybrid ARQ-FEC method.
When a low quality link is located on the transmission path
between the sender node and receiver node, the link may
become a bottleneck. In this case, redundant data packets are
also transmitted on every link including the bottleneck link on
the transmission path, and this may be cause trafc congestion
at every link on the path.
B. Immediately Recovery of Loss Packets by High-Functional
Node
In this study, HNs can duplicate the original packets and

send them along with original packets to the downstream.
Then, when a downstream HN receives the same duplicated
packets, it forwards only the rst packet to the downstream
and discards unnecessary duplicated packets.
B. Network Model
In this study, we suppose that all nodes in the network are
High-functional Nodes and that the transmission path between
the sender node and receiver node is given in advance. Let di
be a link delay on link i and pi be packet lossrate on link i.
The transmission path between the sender node and receiver
node consists of L links. Here, mi is the number of duplicated
packets on link i, and D is an allowable end-to-end delay
dened by the delay-sensitive application in advance.
We consider a delay-sensitive application in this study.
Thus, the Success-Rate is dened as the probability of a packet
arriving at a receiver node from sender node within D. Let
P rob be Success-Rate.
To derive P rob, rst Success-Rate is derived on one
link. On link i, when HN sends mi duplicated packets, the
i
probability of all duplicated packets being lost is pm
i . Thus,
the probability distribution of Success-Rate on one link Pi , mi
is as follows[2].
To improve the quality of service of livestreaming applications, a High-functional Node network has been studied[1][2].
A High-functional Node has the following advanced functions
in addition to functions of the simple node in current use.
1)
2)
3)
4)
buffering packets
detecting packet loss
sending retransmission requests
retransmitting stored packets
However, when link delay between adjacent HNs is large,

packets cannot be retransmitted between HNs within an allowable delay. Also, when packet lossrate on a link between
adjacent HNs is high, retransmission is operated many times
and this may cause the allowable delay to be exceeded.
, T = (2n 1)di ,
otherwise
(1)
P rob =
P1,m1 P2,m2 . . . PL,mL (T )
(2)
T =0
C. Objective Function
Let P be Success-Rate dened by the delay-sensitive
application in advance. The total number of duplicated packets
on the transmission path is expressed as m
in Equation (3).Our
objective is to satisfy P rob >= P as the fewest m
as possible.
m
= m1 + m2 . . . + mL =
mk
(3)
k=1
4. Proposed Method
A. Delay-Expectation
3. Problem Setting
A. Denition of High-Functional Node
The High-functional Node dened in this study has the
following functions in addition to the High-functional Node
functions described in Section 2.
2)
mi (n1)
i
(1 pm
i )pi
0,
Success-Rate the between sender node and receiver node

P rob can be expressed as convolution of each links Pi , mi .
Thus, P rob is as follows.
When HNs receive packets, the packets are stored in caches

for retransmission and then that forwarded to downstream
HNs. When a HN detects that a packet is lost, it sends a
retransmission request to the upstream HN. When the HN
receives a retransmission request, it immediately retransmits
the packet in the cash to the downstream HN. Thus, time
required for recovering the packet in this method is shorter
than that time by retransmission between the sender node and
receiver node.
1)
{
Pi,mi (T ) =
duplicating packets and transmitting them along with

original packets
discarding unnecessary duplicated packets
When link delay is large or packet lossrate on the link

is high, packet duplicating is effective on the link. Thus,
we dene the evaluation value Delay-Expectation considering both link delay and packet lossrate on the link. DelayExpectation is the expectation of one link delay including delay
of retransmission between adjacent HNs. When a HN sends
mi duplicated packets, the probability of all duplicated packets
i
lost is pm
i . Thus, Delay-Expectation Ei,mi is expressed as
follows.
- 207 -
ICEIC 2015
Ei,mi =
mi (k1)
i
(2k1)di (1pm
i )pi
k=1
Delay-Expectation consists of the product of link delay di

and packet lossrate pi on link i. Then, when Delay-Expectation
is large on the link, the link may be low quality.
To achieve as little Delay-Expectation as possible, DelayReduction Ei is dened as reduction of Delay-Expectation
by duplicating one packet on link i. Then, when DelayReduction is large on a link, packet duplicating may be especially effective on the link. Thus, mi is increased sequentially,
in order of larger Delay-Reduction links on our method.
Ei = Ei,mi Ei,mi +1
(5)
B. Proposed Algorithm
Our method begins from no packet duplicating on all HNs
on the path (on each link i, mi = 1). Then, on the largest
Delay-Reduction link, the HN duplicates the packet, and then
Delay-Reduction is updated on the link. Our method repeats
these operations up to P rob satisfying Success-Rate dened
by the delay-sensitive application in advance. Details of our
method are as follows.
1)
2)
3)
4)
5)
Lossrate
Loss
Rate
Delay
i
di (1 + pm
i )
=
(4)
mi
1 pi
A. Optimally
Delay-Expectation is calculated by the product of link
delay and packet lossrate on the link. When the link delay
is small or the packet lossrate on the link is low, DelayExpectation on the link is also low. Meanwhile, Success-Rate
is a probability of packet arrival at the receiver node from
sender node within an allowable delay. When the link delay
is small or the packet lossrate on the link is low, SuccessRate is also high. According to these two denitions, there
seems to be monotonic decrease relationship between DelayExpectation and Success-Rate.
However, numerical analysis shows that there are some examples that do not satisfy the monotonic decrease relationship,
as shown in Fig (1).
In Fig. (1), packet lossrate on link A is a little higher than
that on link B, but link delay on link A is a little smaller than
that on link B. In this network, because the allowable delay
is 300[ms], HNs can retransmit packets within the allowable
delay on link A, but HNs cannot transmit them on link B.
Therefore, Success-Rate is improved by packet duplication on
link B while Delay-Reduction on link A is larger than on link
B. For this reason, there is no monotonic decrease relationship
(80, 0.25)
Allowable Delay D = 300ms

Fig. 1.
A counterexample of a monotonic decrease relationship
between Delay-Expectation and Success-Rate, and our method

does not always give the optimum solution. Thus, we compare
our method and the optimum solution by numerical analysis
and show the effectiveness of our method.
B. Comparison between Proposed Algorithm, Brute Force and
Conventional Method
The number of duplicated packets on each link is determined by the proposed algorithm and brute force. The
proposed algorithm is then compared with the conventional
method and brute force. In the conventional method, packet
duplicating is not operated on all HNs on the path. Details of
numerical analysis conditions are shown in Table (I).
First, set mi = 1 for all i I.

Calculate P rob. If P rob >= P , the algorithm is
nished.
Calculate Ei,mi and Ei,mi +1 for all i I. Furthermore, calculate Ei for all i I.
Choose a link i I such that Ei is the largest, and
mi = mi + 1.
Go back to 2).
5. Performance Analysis
(70, 0.39)
Table I.
N ETWORK CONFIGURATION
parameter
link delay[ms]
packet lossrate[%]
Success-Rate dened by the delay-sensitive application[%]
allowable delay[ms]
the number of analyses
the number of links on the path
value
5-15(random)
0.1-5(random)
99
100
10000
2-7
In this condition, the number of duplicated packets on each

link is determined by the proposed algorithm and brute force.
Then, concordance of the proposed algorithm and brute force is
calculated. In addition, trafc increase, Success-Rate, and endto-end delay are also calculated. Since, as explained in Section
3, our objective is to satisfy Success-Rate dened by the delaysensitive application as the smallest possible total number of
duplicated packets on the path, trafc increase is expressed
as the total number of duplicated packets on the transmission
path. Since each link delay is given randomly, the total delay
on the transmission path may exceed an allowable delay in
some cases. In these cases, the networks are omitted from the
analysis because Success-Rate can no longer be improved by
duplicating packets between adjacent HNs.
The concordance of the proposed method and brute force
and end-to-end delay in each method are shown in Fig. (2)(3).
When networks consist of more than 4 links, concordance
decreases gradually. However, even when networks consist of
7 links, concordance is more than 87% and the total number of
duplicated packets on the transmission path determined by the
proposed method is an almost optimum solution. Meanwhile,
end-to-end delay in each method is almost the same. Thus, an
end-to-end delay is not increased or decreased by duplicating
packets between adjacent HNs.
- 208 -
ICEIC 2015
5.00
0.90
4.00
0.80
Traffic
Concordance
1.00
0.70
0.60
3.00
2.00
1.00
0.50
2
0.00
LINK
Concordance
LINK
Conventional method Traffic
Proposed method Traffic
Brute force Traffic
0.30
Concordance
0.20
Fig. 4.
0.10
Success Rate
Delay[s]
Fig. 2.
0.00
2
LINK
Conventional method delay
Proposed mathod delay
Brute force delay
1.00
Trafc increase
0.99
0.98
0.97
0.96
0.95
2
LINK
Fig. 3.
Conventional method Success Rate

Proposed method Success Rate
Brute force Success Rate
End-to-end delay
Trafc increase and Success-Rate are shown in Fig (4)(5).

When networks consist of 2 to 4 links, trafc increase is
0. In this case, even though HNs do not duplicate packets,
Success-Rate satises P . When networks consist of 7 links,
trafc on the proposed algorithm is slightly more than that
on brute force. However, there is little difference in trafc
between the proposed algorithm and brute force, so our
method gives an almost optimum solution. Also trafc does
not drastically increase in any method. This result shows a
small number of duplicated packets is required for satisfying
Success-Rate dened by the delay-sensitive application. This is
because Success-Rate is improved drastically by a few packets
duplicated between adjacent HNs.
When networks consist of 2 to 4 links, Success-Rate is
very high. In this case, even though HNs do not duplicate
packets, Success-Rate satises P . However, when networks
consist of more than 5 links, Success-Rate in the conventional
method decrease gradually. Eventually, Success-Rate in the
conventional method decreases to 97%. In contrast, even when
networks consist of 7 links, Success-Rates in both the proposed
algorithm and brute force satisfy Success-Rate dened by
the delay-sensitive application. Success-Rates in the proposed
algorithm is more than that in brute force, because the number
of duplicated packets in the proposed algorithm is more than
the optimum solution.
Fig. 5.
Success-Rate
These results show that the proposed algorithm does not

always give the optimum solution. However, the number of
duplicated packets in the proposed algorithm is slightly more
than the optimum solution. Thus, we analyze the characteristics
of the proposed algorithm to study its effectiveness in the
following subsection.
C. Characteristic Analysis in Various Network Congurations
The number of duplicated packets on each link is determined by both the proposed algorithm and brute force in
various network congurations. From the results, we show the
characteristics of the proposed algorithm.
1) Characteristics of Link Delay: The number of duplicated packets on each link is determined by both the proposed
algorithm and brute force. The maximum delay of all links
are given 4 values (10, 15, 20 and 25 [ms]), while the other
parameters are xed as shown in Table (I). Fig. (6)(7) show
the concordance between the results of the proposed algorithm
and brute force and the trafc increase in each method.
- 209 -
ICEIC 2015
1.00
Concordance
Concordance
1.00
0.90
0.80
0.70
0.90
0.80
0.70
2
LINK
Fig. 8.
10.00
9.00
8.00
7.00
6.00
5.00
4.00
3.00
2.00
1.00
0.00
Packet lossrates of 2.5, 5, 7.5, and 10[%]
LINK
LINK
Fig. 7.
2.5%-Concordance
5%-Concordance
7.5%-Concordance
10%-Concordance
Traffic
Traffic
10.00
Link delays of 10, 15, 20, and 25[ms]
9.00
8.00
7.00
6.00
5.00
4.00
3.00
2.00
1.00
0.00
2
3
4
5
6
10ms-Traffic
15ms-Traffic
LINK
10ms-Concordance
15ms-Concordance
20ms-Concordance
25ms-Concordance
Fig. 6.
2.5%-Traffic
5%-Traffic
20ms-Traffic
25ms-Traffic
Link delays of 10, 15, 20, and 25[ms]
In Fig. (6), when networks consist of many links, concordance decreases slightly. Moreover, the larger the link
delay, the lower the concordance on the same number of
links on the path. When link delay on each link is large,
packets cannot be retransmitted between adjacent HNs within
an allowable delay, and a large number of duplicated packets
is required for satisfying Success-Rate dened by the delaysensitive application.
Meanwhile, trafc increases with the number of links on
the path in accordance with a liner function. Moreover, the
larger the link delay, the more trafc on the same number
of links on the path. However, trafc does not drastically
increase in each method. The reason is Success-Rate can
be drastically improved by duplicating a few packets and
Success-Rate dened by the delay-sensitive application can be
satisfyied.
Fig. 9.
7.5%-Traffic
10%-Traffic
Packet lossrates of 2.5, 5, 7.5, and 10[%]
2) Characteristic of Packet Lossrate: The number of duplicated packets on each link is determined by both the proposed
algorithm and brute force. The maximum packet lossrate of all
links are given 4 values (2.5, 5, 7.5 and 10 [%]), while the other
In Fig. (8), when networks consist of many links, concordance decreases slightly. Thus, concordance is higher than
that in Section 5-C1. Moreover, the higher the packet lossrate,
the lower the concordance on the same number of links on
the path. However, concordance is not less than 85%, so the
proposed algorithm can give almost optimum solution.
Meanwhile, trafc increases slightly, even when network
consists of many links. Moreover, even when packet lossrate
on each link is high, trafc does not drastically increase.
- 210 -
ICEIC 2015
The reason is improving Success-Rate by duplicating packets
between adjacent HNs is better than reducing Success-Rate by
high packet lossrate on each link.
3) Characteristics of Success-Rate Dened by DelaySensitive Application: The number of duplicated packets on
each link is determined by both the proposed algorithm and
brute force. The Success-Rate dened by the delay-sensitive
application in advance is given 4 values (90, 95, 99 and 99.9
[%]), while the other parameters are xed as shown in Table
(I). Fig. (10)(11) show the concordance between the results of
the proposed algorithm and brute force and the trafc increase
in each method.
In Fig.(10), when networks consist of many links, concordance decrease slightly. Thus, the higher the SuccessRate dened by the delay-sensitive application, the lower
the concordance on the same number of links on the path.
However, concordance is not less than 85%, so the proposed
algorithm can give an almost optimum solution.
Meanwhile, when networks consist of many links, a large
number of duplicated packets may be required for satisfying
Success-Rate dened by the delay-sensitive application, but
trafc increases slightly. Moreover, even when Success-Rate
dened by the delay-sensitive application is high, trafc does
not drastically increase. The reason is Success-Rate can be
drastically improved by duplicating a few packets between
adjacent HNs.
4) Characteristics of Allowable Delay: The number of
duplicated packets on each link is determined by both the
proposed algorithm and brute force. The allowable delay is
given 4 values (50, 100, 150 and 200 [ms]), while the other
In Fig. (12), when networks consist of many links, concordance decreases slightly. Thus, the smaller the allowable
delay, the lower the concordance on the same number of links

on the path. However, only when the allowable delay is 50[ms]
and networks consist of more than 5 links does concordance
increase gradually. Thus, we additionally analyze the reason
for this. The additional numerical analysis results are shown
in Fig. (14). Fig. (14) shows average delay and average packet
lossrate on each link. In Fig. (14), when a network consists of
more than 5 links and the allowable delay is 50[ms], average
link delay becomes small gradually. When networks consist
of many links and the allowable delay is small, networks
consisting of large delay links are omitted from the analysis
because the total delay on the transmission path exceeds the
allowable delay. For that reason, only networks consisting of
small delay links are analyzed. From the above, even when an
allowable delay is 50[ms], the characteristics of the proposed
algorithm are almost the same.
Meanwhile, trafc increases with the number of links on
the path in accordance with the liner function. Thus, the
smaller the allowable delay, the more the trafc on the same
number of links on the path. However, even when the allowable
delay is small, trafc does not drastically increase. The reason
is Success-Rate can be drastically improved by duplicating a
few packets between adjacent HNs.
D. Discussion
From above results, characteristic of Delay-Expectation is
shown as follows.
The proposed algorithm does not always give the optimum
solution, because there is no monotonic decrease relationship
between Delay-Expectation and Success-Rate. Thus, HNs may
duplicate the packet on inappropriate links. Delay-Expectation
in Equation (4) is calculated by the product of link delay
and packet lossrate on the link. Meanwhile, Success-Rate in
Equation (2) is the probability of a packet arriving at the
receiver node from the sender node within the allowable delay.
Therefore, when each link delay is small as in Figs. (12)-(14),
0.90
Traffic
Concordance
1.00
0.80
0.70
2
LINK
10.00
9.00
8.00
7.00
6.00
5.00
4.00
3.00
2.00
1.00
0.00
2
90%-Concordance
95%-Concordance
99%-Concordance
99.9%-Concordance
LINK
90%-Traffic
95%-Traffic
Fig. 10. Success-Rates dened by the delay-sensitive application of 90, 95,

99, and 99.9[%]
99%-Traffic
99.9%-Traffic
Fig. 11. Success-Rates dened by the delay-sensitive application of 90, 95,

99, and 99.9[%]
- 211 -
Concordance
1.00
0.90
0.80
5.00
4.50
4.00
3.50
3.00
2.50
2.00
10
9
8
7
6
5
2
Average Delay [ms]
Average Lossrate [%]
ICEIC 2015
LINK
0.70
2
50ms Packet Lossrate

50ms Link Delay
100ms Packet Lossrate
100ms Link Delay
LINK
50ms-Concordance
100ms-Concordance
150ms-Concordance
200ms-Concordance
Fig. 14.
Traffic
Fig. 12.
Average delay and average packet lossrate on each link
almost optimum solution. Moreover, trafc increase due to

packet duplicating is small. However, when delay on each link
is large or the allowable delay is small, concordance between
the results of the proposed algorithm and brute force decreases
gradually. In future work, we intend to study a new evaluation
value instead of Delay-Expectation.
Allowable delays of 50, 100, 150, and 200[ms]
10.00
9.00
8.00
7.00
6.00
5.00
4.00
3.00
2.00
1.00
0.00
In this work, we do not consider link bandwidth or

background trafc on the path. Practically, packet duplicating
caused trafc congestion and increased queuing delay at HNs.
Thus, we intend to analyze the efciency of our method when
the network consists of limited bandwidth links.
Acknowledgement
2
LINK
50ms-Traffic
100ms-Traffic
150ms-Traffic
200ms-Traffic
This work was conducted in part as the Research and

Development for Expansion of Radio Wave Resources under
the contract of the Ministry of Internal Affairs and Communications.
References
Fig. 13.
Allowable delays of 50, 100, 150, and 200[ms]
the difference between Delay-Expectation and Success-Rate

decreases and concordance between the results of the proposed
algorithm and brute force increases. Therefore, considering the
number of allowable retransmissions within an allowable delay
on each link may improve concordance between the results of
the proposed algorithm and brute force.
6. Conclusion
In this work, we considered improving QoS of the delaysensitive application in a High functional Node network. We
proposed a method for determining the number of duplicated
packets on each link. The method can satisfy Success-Rate
dened by the delay-sensitive application as the smallest possible number of duplicated packets. We compared our proposed
method with brute force by numerical analysis.
The results show that the proposed algorithm can give an
[1] Yudai Nitta, Taro Hashimoto, Katsuyoshi Iida, Katsunori Yamaoka, and
Yoshinori Sakai,Novel Link Weight for Path Construction Based on
Overall QoS Index, Proc. of IEEE ICC2007, Jun. 2007.
[2] Takayuki Akanoma, Takamichi Miyata, Katsunori Yamaoka, and Yoshinori Sakai, Path Conguration Using Probability Distribution of Delay
for High-Functional Node Network, in Proc. IEEE CCNC 2011, pp.
231-233, Jan. 2011.
[3] Hashimoto. T, Yamaoka. K, Sakai. Y,A study of a path reconguration
for QoS multicast protocol for live streaming, PACRIM. 2005 IEEE
Pacic Rim Conference on, pp617-620, Aug, 2005.
[4] Ying-zong Huang, Mehrotra. S, Jin Li,A hybrid FEC-ARQ protocol for
low-delay lossless sequential data streaming, ICME 2009, pp718-725,
June-July, 2009.
[5] D. Rubenstein, J. Kurose, and D. Towsley,A study of proactive
FEC/ARQ and scalable feedback techniques for reliable, real-time multicast, Computer Communications, 24, 2001, pp. 563-574.
[6] Yong Jin, Jinyi Chang, Deguang Le,Performance Analysis of an Adaptive Hybrid FEC/ARQ Based on Hops for Wireless Multimedia Sensor
Networks, ICCIIS 2010, pp240-243, Oct, 2010
[7] Kaidi. H.M, Ibrahim. M,Performance analysis of hybrid ARQ based on
convolutional codeSCOReD 2010, pp37-41, Dec. 2010
[8] J. Nonnenmacher, E. W. Biersack, D. Towsley, Parity-based loss recovery for reliable multicast transmission, IEEE/ACM Transactions on
Networking, Volume 6, Issue 4, 349-361, Aug. 1998.
- 212 -
FO-1-4-6
Efficient Packet Classification by Improving Filter Categorization

Hsin-Jou Yu, Hsin-Tsung Lin, Pi-Chung Wang
Department of Computer Science and Engineering, National Chung Hsing University
shinjou0427@gmail.com, aries77329@gmail.com, pcwang@nchu.edu.tw
Abstract
Packet classification has been one of the elementary
techniques of modern routers and firewalls. While the
performance of packet classification is important for
packet forwarding, the existing algorithms usually pursue speed performance by sacrificing space efficiency
or vice versa. In this paper, we investigate several
packet-classification algorithms based on filter categorizing. These algorithms use different methods to distinguish filters. They may result in unstable performance for different filter databases. Combining complementary methods of filter categorization can benefit
the stability of packet classification. We consider two
memory-efficient algorithms, Independent Sets and
Tuple Space Search, and present several approaches to
combining their methods of filter categorizing. The
experimental results show that our approach can
achieve stable packet classification.
Keywords: packet classification, tuple space, independent sets.
1. Introduction
Packet classification is one of the basic techniques
of many network devices such as routers and firewalls.
It is an enabling function to support next generation
networking services such as security monitoring, accounting, and quality of service. Therefore, packet
classification must be capable of supporting the current
state-of-the-art networking speeds and cost efficiency.
A filter in a packet classifier is defined with five
fields, and each field can be one of the following types:
prefixes, ranges, exact values or wildcards. The most
common header fields specified in a packet classifier
include the source and destination IP address prefixes,
source and destination port ranges of the transport protocol and the protocol type. Each filter has an associated priority or cost. When a packet arrives, the corresponding field of the packet header is compared with
the filters. A filter matching all the corresponding
fields is considered as a matching filter. Packet classification requires the matching filter with the highest
priority or the least cost [1].
Many algorithms have been proposed to improve
the search performance of packet classification in the
last decade [2-5]. However, the existing algorithms
cannot support large filter databases. These algorithms
usually consume too much memory or lead to poor
worst-case throughput. We observe that packet classification schemes suffer from a trade-off between the
storage and speed performance. Finding a good balance between the storage and speed performance to
keep both performances stable and scalable are thus
important.
In this paper, we consider two algorithms, Independent Sets [6] and Tuple Space Search [7], which are
based on filter categorization. Both algorithms have
superior space performance and support incremental
updates. However, their speed performance may not
scale well and degrades their feasibility. We observed
that their approaches of filter categorizing can be functionally complementary to each other. Combining their
data structures can significantly decrease the number of
filter groups without storage penalty. Since the number
of filter groups affects the search performance of the
original algorithms, the new schemes improve the
scalability of packet classification. We evaluate the
performance of our scheme with filter databases of
varying sizes and characteristics. The results show that
our scheme can keep the storage requirement low.
The rest of the paper is organized as follows: Section 2 briefly summarizes the related work. Section 3
proposes our new approaches and the update procedure.
Section 4 presents the performance evaluation of our
schemes. Finally, Section 5 concludes this work.
2. Related Work
The simplest classification algorithm uses linear
search to compare the incoming packet header with
filters one-by-one. Linear search has the smallest storage requirement, but it needs a long time period to query a large filter database. Hence, improving speed per-
- 213 -
ICEIC 2015
formance by trading off storage performance is unavoidable. Many approaches have been proposed in the
last decade. In the following paragraphs, we provide a
brief discussion of the existing algorithms.
Ternary content addressable memory (TCAM) is
employed in hardware based solutions [8,9]. Each
TCAM cell can store words with three state: 0, 1 or
X (Don't care). The search procedure of TCAM compares all entries in parallel and returns the first matching entry. Although TCAMs are effective for packet
classification, their drawbacks include low density,
high power dissipation and extra entries due to rangeto-prefix transformation [1,10,11]. Hence, TCAMs are
only suitable for small filter databases currently. Another hardware based scheme, Bit Vector (BV) [12],
performs $d$ one-dimensional searches for a d-field
filter databases and produce d lists of filters which
have at least one matching field. Then, the matching
filters are generated by taking the intersection of the d
filter lists. An algorithm, Aggregate Bit Vector (ABV)
[11], is proposed to improve the performance of the
BV algorithm.
Currently, there are also many software-based algorithms. Cross-producting is a mechanism of constructing a pre-computed table by combining all possible
values of each field [13]. The searching procedure
looks up the best matching prefix on individual fields
first, and then combines the results of all inspected
fields to access the pre-computed table. Crossproducting suffers from an O(Nd) memory blowup for
d-field filters, where N denotes the number of filters.
Another algorithm, Recursive Flow Classification
(RFC) [14], is proposed to improve the storage efficiency of Cross-producting. RFC generates crossproducting tables with only a subset of the inspected
fields for eliminating unmatched entries. The algorithm
lowers the storage usage of Cross-producting, but it
still cannot support large filter databases.
HiCuts divides the filters into multiple groups with
a decision tree, and each group corresponds to a leaf
node of the decision tree [15]. Each query is directed to
a leaf node and uses linear search to find the matching
filters in the corresponding group. The number of filters in each group is limited by a predefined value to
keep the cost of linear search low. HyperCuts further
extends the one-dimensional cut rules to multidimensional ones [16]. HyperCuts reduces the number
of memory accesses and the storage requirement of
HiCuts, but the speed and storage performance are
unstable for different characteristics of filter databases.
Modular Packet Classification [17] and CubeCuts [18]
also proposed different approaches to partition a set of
filters. For the decision tree algorithms, filters occupied
more than one leaf nodes are replicated. To alleviate
filter replication, both BSOL [4] and EffiCuts [19]

employ multiple decision trees to store filters.
Another two algorithms, Independent Sets (ISET)
[6] and Tuple Space Search (TSS) [7], are also based
on filter categorizing. ISET categorizes multidimensional filters according to the specifications of
one field, and TSS categorizes filters according the
prefix length combinations. The storage requirements
of both algorithms are small, but their speed performance ties to the number of groups.
We can observe that all the existing algorithms exhibit a trade-off between the storage and speed performance. Hence, we attempt to achieve a better speed
performance with small storage. Consequently, the
scalability of packet classification can be improved. In
the following, we present our motivation and schemes
which pursue stability and scalability of packet classification by combining ISET and TSS.
3. The Proposed Scheme

Both Independent Sets (ISET) [6] and Tuple Space
Search (TSS) [7] are based on filter categorizing. ISET
categorizes multi-dimensional filters according to the
specifications of one field, and TSS categorizes filters
according the prefix length combinations. The storage
requirements of both algorithms are small, but their
speed performance ties to the number of groups.
The preprocessing stage of ISET is a filtercategorization algorithm, which categorizes filters into
different independent sets [6]. The filters in an independent set must be disjointed in one specific field;
thus, they do not overlap with each other. The preprocessing stage starts by using a greedy approach to generating one independent set for each field [6]. The independent set which has the most filters among all
independent sets is designated as a global maximum
independent set. After determining the first global
maximum independent set, the above steps are repeated for the remaining filters until all the filters have
been categorized in one independent set. The sets of all
global maximum independent set are then used to construct the data structures for search procedure.
There are three data structures for accessing the independent sets. First, the independent sets of the same
field are merged to generate primitive ranges. Each
primitive range corresponds to a set of possiblymatching filters, which is stored in an index array.
These filters are then compared by using linear search.
Each column of the index array corresponds to an independent set. Each row of the index array is a set of
filter indexes to indicate the filter in each independent
set that overlaps the corresponding primitive range.
The index value (-1) indicates that there is no overlap-
- 214 -
ICEIC 2015
ping filters for the corresponding primitive range. The
index array is sorted according to the starting point of
each primitive range; thus, we can use binary search to
search for the matching primitive range in the index
array. Since there are at most d fields of independent
sets, there are at most d index arrays. The last data
structure, classifier array, stores the filter database, and
each entry of classifier array stores complete filter
specifications, including the field values, priority and
action. When we retrieve an entry of the index array,
we use the corresponding index to access the classifier
array.
The search procedure of the ISET algorithm acts as
follows. In the first step, the value of each inspected
field of an incoming packet is used to search for the
matching primitive range by using binary search. After
determining the matching primitive range, the corresponding row of index array is accessed to retrieve the
index set of the possible-matching filters. With the
filter indexes, the corresponding filters are retrieved
from the classifier array and the matching filters are
determined by comparing the original filter specifications. The above procedure repeats for each generating
field of independent sets to yield all the matching filters.
A tuple is a set of filters with the same prefix
length combination [7]. For example, the filters,
F=(01*, 010*) and G=(01*, 111*), both map to tuple
T2,3. The set of tuples is called a tuple space. Since
each tuple has a specific prefix length for each field,
the prefixes of each filter can be concatenated to create
a hash key for storing the filter. When searching for
T2,3, a hash key is generated by concatenating the first
two bits of source prefix and the first three bits of destination prefix to access the hash table of T2,3. TSS
must access all tuples to find out all the matching filters and determine the one with the highest priority.
Therefore, the search performance of linear TSS in the
worst case is O(Wd), where W denotes the maximal
field length.
We observed that both ISET and TSS shared some
properties. First, both algorithms divide filters into
multiple groups to simplify the search procedure.
While ISET only accesses one filter in each set, TSS
probes one hash table for each tuple as well. Accordingly, the speed performance of both algorithms depends on the number of groups. ISET uses a greedy
algorithm to categorize filters, and the size of each
generated set gradually decreases when the number of
sets increases. The last few sets usually have only few
filters. One group with only few filters also can be observed in TSS, which categorizes filters into different
tuples according to the prefix length combination.
Since these groups which have few filters also need to
be probed once in each packet classification, removing
these groups caused by inefficient categorization could

improve the search performance of both algorithms.
Both algorithms use different approaches of filter categorization, and the filters which are belonged to a
small group of ISET may belong to a large group of
TSS. Hence, we attempt to combine both algorithms
and move the filters of the small groups from one algorithm to the other.
Our first approach of combining both algorithms is
based on the observation that most large sets of ISET
appear in both IP address fields and the global maximum independent sets generated for the ports or the
protocol number fields are usually small in size. Accordingly, our approach determines the filters stored in
TSS according to the generating fields of their corresponding independent sets.
The categorization procedure acts as following.
When a new independent set is generated for the port
field or the protocol number fields, the filters in the
new set and the remaining uncategorized filters are
stored in TSS directly. Since there are only two fields
with independent sets, the cost of searching for primitive ranges can be minimized. We store the filters in
TSS according to their prefix length combinations of
all fields.
Our second approach is based on the observation to
ISET, where the size of the generated set gradually
decreases when the number of sets increases. Usually,
the last few sets only have few filters. Hence, we attempt to improve the search performance for the last
few sets caused by inefficient categorization. We also
observed that the filters in the last few sets have a
property that the prefix lengths of these filters are usually short. Since TSS categorizes filters into different
tuples according to their prefix length combinations,
the approach will only generate few tuples when we
removed the filters of the last few sets to TSS.
We set a filter threshold value to determine the
number of filters stored in TSS. We describe the categorizing procedure as following. In the procedure of
generating the sets of ISET, we compare the number of
remaining filters with the threshold value after generating a new independent set. When the number of remaining filters is smaller than or equal to the threshold
value, the remaining filters are stored in TSS.
According to the property of ISET, it is intuitive to
observe that the search performance can be improved
with fewer sets. Hence, our third approach directly
limits the number of sets for ISET. We define a threshold value to determine the number of sets generated for
ISET. We only generate the largest sets of ISET and
the remaining uncategorized filters are stored in TSS.
Since the filters with long prefix length are usually
categorized first in the procedure of generating the sets
- 215 -
ICEIC 2015
of ISET, the number of tuples which generate from the
remaining uncategorized filters can also be reduced.
The categorization procedure acts as following.
First, we choose a set threshold value. In the procedure
of generating the sets of ISET, we compare the number
of sets with the threshold value after generating a new
independent set. When the number of sets is equal to
the threshold value, the remaining filters are directly
stored in TSS.
With the previous approaches of filter categorization, the filters are divided into two sets, one for ISET
and the other for TSS. Both sets must be searched to
yield all the matching filters. Accordingly, we describe
an improved procedure to minimize the cost of accessing both data structures.
Both algorithms, ISET and TSS, need onedimensional searches; thus, we combine the onedimensional searches of both algorithms to reduce the
storage requirement and enhance the search performance. The result of each one-dimensional search provides a tuple list with matching prefixes and a row with
the matching primitive range in the ISET index array.
The search procedure acts as follows. First, the
longest matching prefix of each field is generated. Subsequently, the tuples which appear in all tuple lists of
the longest matching prefixes are probed and the corresponding row of the index array on each field are accessed. Finally, combining the results of both searches
can find out all the matching filters.
The update procedure of our algorithm is based on
those of ISET and TSS. Before we introduce update
procedure for our algorithm, we describe the update
procedures for ISET and TSS first.
Inserting a filter into ISET consists of three steps.
First, we find a set whose filters are independent of the
new filter. If we cannot find the set, we generate a new
set. Second, we insert the new filter into the designated
set. If the starting point of the new filter already exists
in the corresponding index array, then the index array
is not modified. Otherwise, we generate a new row to
the index array. In the third step, with the index array
of the designated independent set, we replace the corresponding indexes which are original empty with the
index of new filter.
Filter deletion for ISET also starts by finding the set
which contains the filter to be deleted and eliminating
the filter indexes from the corresponding rows of the
index array. Intuitively, a set is deleted when we delete
its last filter. If there is no other filters which have the
same starting point as the deleted filter, the row of index array corresponding to the starting point is also
deleted.
To insert a filter into TSS, we first generate a hash
key from the new filter and store the filter to the corresponding hash table. A new hash table is generated if
there is no corresponding hash table. Subsequently, the

tuple lists which correlate to the new filter are modified.
The procedure of filter deletion simply removes the
deleted filter from the corresponding hash table and
updates the correlated tuple lists.
In our algorithm of packet classification, the update
procedure of ISET is slightly modified. Since the filters are categorized into ISET first, the sets usually
store more filters. Thus, it is not necessary to add or
delete any entry of the index array. We only update
filter indexes to fulfill the filter updates.
When a filter is inserted, we choose the data structure for filter insertion based on the following principles. First, we choose the one which does not generates
a new group, where ISET has higher priority for filter
insertion. This is because the search performance of
ISET ties to the number of independent sets. If the new
filter results in new independent set and hash table, we
insert the new filter into a new hash table in TSS. In
sum, a new filter is inserted into ISET if no new set is
generated. Otherwise, we insert the filter into TSS.
While a new tuple is generated, the search procedure of
TSS can reduce the probability of accessing the new
tuple.
The update performance of a packet classification
algorithm usually ties to the number of duplicated filters. The existing literature has shown that ISET incurs
moderate filter duplication and TSS does not incur any
filter replication. Therefore, both algorithms have superior update performance. By combining both data
structures of ISET and TSS, our update procedure can
leverage the update cost and the search performance.
In this section, we evaluate the performance of our
approaches and compare them with several notable
algorithms. The evaluation is based on both real and
synthetic databases. Since the largest real database
acquired contains only 1550 filters [20], we use ClassBench [21] to generate larger filter databases for testing the scalability of our approaches. ClassBench is a
notable tool for synthesizing filter databases from predefined seed files. It can also generate packet traces for
filter databases. With ClassBench, we can better evaluate the performance of our scheme. In our experiments,
we use twelve publicly available seed files [21] to generate 48 synthetic databases with different sizes. These
synthetic databases correspond to the most common
classification applications, namely access control list
(acl), firewall (fw) and IP chain (ipc). All of the evaluated algorithms are developed by using C programming language. The source codes of several algorithms
- 216 -
ICEIC 2015
are available in http://www.arl.wustl.edu/~hs1/ PClassEval.html.
The performance evaluation consists of three parts.
The first part, we present the performance trade-off
between the number of independent sets and the number of tuples. In the second part, we compare our approaches with other existing algorithms in terms of
speed and storage performance. The last part tests the
scalability of our approaches by using large databases
with 32K, 64K, and 128K filters.
We present the performance trade-off between the
number of sets and the number of tuples. This evaluation is performed upon three real filter databases.
These databases are denoted as real_acl, real_fw and
real_ipc, and their sizes are 752, 269 and 1550.
In Table 1, we list the storage performance of ISET,
TSS and our first approach. TSS has the highest storage requirements due to the oversized hash tables. Our
approach only generates independent sets for IP prefix
fields; hence, some filters are stored in the data structure of TSS. As a result, the storage performance of our
approach is between those of ISET and TSS. Our approach can significantly reduce the storage requirements by only generating few independent sets.
Table 1: The tradeoff between the number of tuples and number of sets of our approach
Fig. 1 The variation between the number of sets and
the number of tuples of our approaches for real filter
databases.
Next, we use four filter thresholds, 128, 256, 512
and 1024, for the second approach and three set
thresholds for the third approach, 2, 5 and 10, to show
the variation between the number of independent sets
and the number of tuples. As shown in Fig. 1(a), the
number of sets gradually decreases as the value of filter
threshold increases. Therefore, there is a trade-off between the number of sets and the number of tuples. In
Fig. 1(b), we also show the similar phenomenon by
varying the set threshold for the third approach. Both
figures indicate that the number of sets can be significantly reduced with our approaches. Moreover, the
number of tuples is less than the original TSS even
when we store most filters in TSS. Our approaches
equal TSS when the number of the independent sets is
decreased to zero.
Figure 2 shows that the storage requirement in kilobytes and the number of memory accesses in the worst
case (WMA) for our approaches. Since the storage
requirement of TSS is larger than that of ISET, the
storage requirement gradually increases when the
number of tuples increases. The storage requirement of
our algorithms is also between that of ISET and TSS.

For our second approach, the number of sets can be
significantly reduced when we store only 10% or more
filters to TSS. As a result, the number of memory accesses is significantly reduced, as shown in Fig. 2(a).
Figure 2(b) shows that the value of set threshold is
proportional to the number of memory accesses for our
third approach. Since the storage performance of both
ISET and TSS is superior, we tend to generate fewer
sets for achieving better search performance.
We compare our approaches with the other notable
algorithms, ISET [6], TSS [7], ABV [11], HyperCuts
[16] and RFC [14] in the second evaluation. For HyperCuts, the space factor is 1 and bucket size is 32. For
the ABV scheme, the aggregate size is 32 bits, and the
memory width is 256 bits. Based on our evaluation to
the performance tradeoff between the number of sets
and the number of tuples, we set the value of filter
threshold to 1024 and the value of set threshold to 2 in
the following experiments. This evaluation is performed upon three real filter databases and 12 synthetic
databases. Each synthetic database is initialized 16,000
- 217 -
ICEIC 2015
Fig. 3 Storage performance of the existing algorithms

using real filter databases.
Fig. 2 The variation between the storage and the WMA

of our approaches for real filter databases.
filters, but the actual number of filters in each database
is usually less than 16,000 after removing redundant
filters. The performance metrics include the required
storage in kilobytes, and the number of memory accesses in average case (AMA) and the worst case
(WMA).
To begin with, we compare our approaches with
other existing algorithms for the real filter databases,
where Fig. 3 shows the storage requirement and Fig. 4
shows the speed performance. Since the storage requirement of RFC is much larger than the other
schemes, we do not show it in Fig. 3. Among the compared algorithms, ABV consumes the most storage.
The storage requirement of HyperCuts vibrates severely for different databases. While HyperCuts performs
well for real_acl and real_fw, it also requires a significantly increasing storage for real_ipc. Both ISET and
TSS have the least storage requirements for most databases. The storage requirement of our approaches varies between those of ISET and TSS but better than that
of ABV and RFC.
Fig. 4 Speed performance of the existing algorithms

using real filter databases.
The existing algorithms show the tradeoff between
speed and storage performance, where the algorithms
consuming the most storage, including ABV, HyperCuts and RFC, also have the better speed performance.
ISET has the worst search performance among these
algorithms. The speed performances of our approaches
- 218 -
ICEIC 2015
vary for different databases. For the first and third proposed approaches, the speed performance is only worse
than RFC on real_fw. As compared with ISET and
TSS, our schemes have better or comparable speed
performance for three real filter databases.
For synthetic databases, we show the storage and
speed performance in Table 2 and Fig. 5, respectively.
We cannot yield the results of RFC in this experiment
due to its explosive storage requirement. As show in
Table 2, ABV still consumes the most storage and
ISET/SET usually need the least storage. The storage
requirement of HyperCuts vibrates severely. For example, HyperCuts outperforms our approaches for acl1
and acl5 but consumes larger storage than our approaches for the other databases. The storage requirements of our three approaches are relatively stable and
smaller than the other algorithms, except for ISET.
Table 2: Storage performance of the existing algorithms using synthetic filter databases
Fig. 5 Speed performance of the existing algorithms

using synthetic filter databases.
In Fig. 5, we do not show the WMA performance of
HyperCuts for fw4 since the value is as large as 639.
The speed performance of ABV is proportional to the
number of filters. Our second approach does not perform well for acl3, acl4 and acl5. Although our second
approach reduces the number of sets by 80% in these
three databases, there are still more than 25 sets. We
can further decrease the number of sets by increasing
the value of filter threshold, but there is a trade-off
between the storage and speed performance, as mentioned above. The speed performance of the first approach is only better than ISET in acl5 due to the 33
sets. Both the first and second approaches perform well
for the other databases while the third approach
achieves the best WMA performance.
Since the third approach yields a better search performance than other algorithm, we use the third approach to evaluate the scalability by using the filter
databases with 32K, 64K and 128K filters. There are
twelve databases for each database size. We keep the
same values of filter threshold and set threshold as in
the previous evaluation.
As shown in Table 3, the storage requirement is

proportional to the number of filters. The maximum
storage for a 32K database is 2495 kilobytes, and that
of a 64K database is 5832 kilobytes. Even though the
size of database increases to 128K, the maximum storage is less than the storage requirement of ABV with
16K filters, where the maximum storage only requires
7193 kilobytes. In addition, our approach maintains the
search performance as with smaller databases. Hence,
our third approach provides superior scalability to support large filter databases.
5. Conclusion
In this paper, we present our schemes of combining
Independent Sets and Tuple Space Search. We combine their approaches of filter categorization based on
the observation to both algorithms. Due to their different approaches of filter categorization, they can be
functionally complementary to each other. Hence, we
divided the filters into two sets to optimize the storage
performance of both algorithms. Our approach is based
- 219 -
ICEIC 2015
Table 3: Scalability performance of the third approach
on the fields of independent sets. The experimental

results show that the storage requirement of our approaches is stable. In the future work, we attempt to
develop different approaches of filter categorization to
further improving the storage efficiency. Comprehensive performance evaluation will be also conducted.
[8]
[9]
Acknowledge
This work is supported in part by the Ministry of Science and Technology of Taiwan, R.O.C., under grant
NSC103-2221-E-005 -061.
[10]
References
[11]
[1]
[2]
[3]
[4]
[5]
[6]
[7]
D. Taylor, Survey and taxonomy of packet classification techniques, ACM Computing Surveys,
vol.37, no.3, pp.238-275, 2005.
V. Pus and J. Korenek, Fast and scalable packet
classification using perfect hash functions, Proceeding of the ACM/SIGDA, pp.229-236, 2009.
B. Xu, D. Jiang, and J. Li, HSM: A fast packet
classification algorithm, 2005.
H. Lu and S. Sahni, O(logw) multidimensional
packet classification, IEEE/ACM Transactions
on Networking, vol.15, no.2, pp.462-472, 2007.
H. Lim, H. Chu, and C. Yim, Hierarchical binary search tree for packet classification, Communications Letters, IEEE, vol.11, no.8, pp.689691, 2007.
X. Sun, S. Sahni, and Y. Zhao, Packet classification consuming small amount of memory,
Networking, IEEE/ACM Transactions on, vol.13,
no.5, pp.1135-1145, 2005.
S. Varghese, V. Srinivasan, S. Suri, and G. Varghese, Packet classification using tuple space
search, 1999.
[12]
[13]
[14]
[15]
[16]
- 220 -
D. Pao, Y. Li, and P. Zhou, Efficient packet

classification using TCAMs, Computer Networks, vol.50, no.18, pp.3523-3535, 2006.
D. Pao, P. Zhou, B. Liu, and X. Zhang, Enhanced prefix inclusion coding filter-encoding
algorithm for packet classification with ternary
content addressable memory, Computers &
Digital Techniques, IET, vol.1, no.5, pp.572-580,
2007.
F. Baboescu, S. Singh, and G. Varghese, Packet
classification for core routers: Is there an alternative to CAMs?, IEEE INFOCOM, pp.53-63,
2003.
F. Baboescu and G. Varghese, Scalable packet
classification, Proceedings of the 2001 conference on Applications, technologies, architectures,
and protocols for computer communications,
pp.199-210, ACM, 2001.
T. Lakshman and D. Stiliadis, High-speed policy-based packet forwarding using efficient multidimensional range matching, ACM SIGCOMM
Computer Communication Review, p.214, 1998.
V. Srinivasan, G. Varghese, S. Suri, and M.
Waldvogel, Fast and scalable layer four switching, ACM SIGCOMM Computer Communication Review, vol.28, no.4, pp.191-202, 1998.
P. Gupta and N. McKeown, Packet classification on multiple fields, Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication,
pp.147-160, ACM, 1999.
P. Gupta and N. McKeown, Packet classification using hierarchical intelligent cuttings, Hot
Interconnects VII, pp.24-32, 1999.
S. Singh, F. Baboescu, G. Varghese, and J. Wang,
Packet classification using multidimensional
cutting, Proceedings of the 2003 conference on
Applications, technologies, architectures, and
ICEIC 2015
[17]
[18]
[19]
[20]
[21]
protocols for computer communications, pp.213224, ACM, 2003.

T.Y.C. Woo, A modular approach to packet
classification: Algorithms and results, Proceedings of IEEE INFOCOM, pp.1213-1222, 2000.
Y.K. Chang and W. Yu-Hsiang, Cubecuts: A
novel cutting scheme for packet classification,
Proceedings of WAINA 2012, pp.274-279, 2012.
B. Vamanan, G. Voskuilen, and T.N. Vijaykumar, Efficuts: Optimizing packet classification
for memory and throughput, SIGCOMM Computer Communication Review, vol.41, no.4,
pp.207-218, 2010.
H. Song, Design and evaluation of packet classification systems, 2006.
D. Taylor and J. Turner, ClassBench: a packet
classification benchmark, IEEE/ACM Transactions on Networking, vol.15, no.3, pp.499-511,
2007.
- 221 -
ICEIC 2015

Oral Session
FO-1-5
Special Symposium on Semiconductor
and Device I
- 222 -
FO-1-5-1
Experimental Study of Negative Capacitance

to Implement Sub-60 mV/decade CMOS Devices
Jaesung Jo and Changhwan Shin*
School of Electrical and Computer Engineering, University of Seoul, Seoul 130-743, Korea
E-mails: jopp111@naver.com, cshin@uos.ac.kr
effect on CMOS devices is experimentally

demonstrated for sub-10-nm CMOS technology.
Abstract
The negative capacitance (NC) for ultra-low power
transistors is experimentally implemented. To
demonstrate the effect of the NC on CMOS devices, a
ferroelectric capacitor is first fabricated using
P(VDF0.75-TrFE0.25). And then, it is connected in series
to a 1-m CMOS device. The step-up voltage
conversion is measured, as shown in the measured
internal voltageversusgate voltage (VIntVG) plot.
The steep switching characteristic in the CMOS
devices implemented by the negative capacitance is
also
observed
in
the
measured
drain
voltageversusgate
voltage
(IDVG)
plot:
subthreshold slope of 18 mV/decade is demonstrated at
room temperature.
Keywords: Negative Capacitance, CMOS, MOSFET.
2. Experiments
To experimentally demonstrate the impact of
negative capacitance (NC), a ferroelectric capacitor is
fabricated: a ferroelectric material, P(VDF0.75-TrFE0.25),
is used as the insulation layer of the capacitor. The
sequences of the fabrication are as follows: (i) 1-wt%
(weight percent) solution of P(VDF0.75-TrFE0.25), which
was fully dissolved in a solvent of methyl ethyl ketone
(MEK), was deposited (i.e., spin-coated) onto a TiN/Si
substrate. (ii) The sample was annealed on a hot plate
at ~ 140 C. (iii) Gold electrode was formed onto the
P(VDF0.75-TrFE0.25). (iv) In order to observe the NC
effect, the ferroelectric capacitor and the gate electrode
of a 1-m CMOS device are connected in series (see
the details in the inset of Fig. 1).
1. Introduction
The major technical requirements for next

generation complemetary metal oxide semiconductor
(CMOS) devices, i.e., lower power dissipation and
better performance, must be satisfied for continued
scaling of CMOS technology. In the past five decades,
CMOS devices has been successfully scaled down
following the Moore's Law, so that various electrical
characteristics such as power consumption and on-/offstate currents are significantly improved. However,
since the operational principle of the silicon based
CMOS devices is based on thermionic emssion process,
they will be, sooner or later, faced to the physical limit
(i.e., CMOS devices require at least 60 mV to increase
tenfold drain current at 300 K). To surmount the
physical limit of 60 mV/decade, negative capacitance
(NC) to amplify surface potential (vs. gate voltage) [1]
is implemented and investigated. In this study, the NC
To satisfy the technical requirements for ultra-low

power transistors, subthreshold slope (SS) should be
minimized and even lower than the physical limit of 60
mV/decade at 300 K. SS is quantitatively expressed, as
shown in the equation below.
V
j S
V KT
SS = G
ln 10
= G
j S (log10 I D ) j S q
, where S is surface potential, VG is gate voltage. The
first term in the equation, which is called body factor,
cannot be lower than one at 300 K in conventional
CMOS devices. However, if the ferroelectric capacitor
is connected to the gate stack of transistors (as
mentioned in Section 2), the surface potential of
transistors can be amplified (i.e., S > VG). This means
that the body factor can be lower than one and
thereby, SS of sub-60-mV/decade at 300 K can be
experimentally demonstrated.
- 223 -
ICEIC 2015
up voltage conversion (as shown in Fig. 1): in the end,

SS is improved up to 18 mV/decade at 300 K.
4. Conclusion
Fig. 1: Internal voltage (VInt) versus gate voltage

(VG). Inset illustrates how a 1-m channel length
transistor is connected in series to a ferroelectric
capacitor.
The effect of negative capacitance (NC) on CMOS

devices is experimentally demonstrated for low-power
applications. The fabrication steps of a ferroelectric
capacitor and the measurement set-up to see the NC
effect are explained in detail. The step-up conversion
of the internal voltage is experimentally observed, so
that the steep switching feature (SS ~ 18 mV/decade at
300 K) in CMOS devices is implemented.
Acknowledgments
This work was supported by the Korea Foundation
for the Advancement of Science & Creativity
(KOFAC), and funded by the Korean Government
(MOE). Also, this work was supported by the National
Research Foundation of Korea (NRF) grant funded by
the
Korea
government
(MSIP)
(No.
2014R1A2A1A11050637). This work was also
supported by the Basic Science Research Program
through the National Research Foundation of Korea
(NRF), funded by the Ministry of Science, ICT, and
Future Planning (No. 2012R1A1A1014011).
Fig. 2: Drain current (ID) versus gate voltage (VG).
Note that drain voltage (VD) is 2 V, and the
measured subthreshold slope (SS) is 18 mV/decade
(less than the physical limit of SS, i.e., 60
mV/decade at 300 K).
In order to experimentally observe the effect of the
negative capacitance (NC), the structure of "MOSFET"
+ "ferroelectric capacitor" is used to measure VIntVG
and IDVG. As shown in Fig. 1, the NC effect of the
ferroelectric capacitor is observed as a step-up
conversion of the internal voltage. This is occurred
because of the phase transition of the ferroelectric
material [2-3]. The abrupt change of the internal
voltage in a certain region (i.e., phase transition region)
has induced a higher surface potential (S) than gate
voltage (VG) in CMOS devices (i.e., S > VG). Hence,
the body factor in the aforementioned equation is lower
than one. Now that the first term (i.e., the body
factor) is < 1 and the second term in the equation is 60
mV at 300 K, SS < 60 mV/decade can be obtained. As
shown in Fig. 2, the NC effect is demonstrated in the
IDVG plot. In other words, the steep switching feature
in CMOS devices is demonstrated because of the step-
References
[1] S. Salahuddin and S. Datta, Use of negative
capacitance to provide voltage amplification for
low power nanoscale devices, Nano Lett., vol. 8,
no. 2, pp. 405410, Feb. 2008.
[2] D. J. R. Appleby, N. K. Ponon, K. S. K. Kwa, B.
Zou, P. K. Petrov, T. Wang, N. M. Alford, and A.
ONeil, Experimental observation of negative
capacitance in ferroelectrics at room temperature,
Nano Lett., vol. 14, no. 7, pp. 38643868, Jun.
2014.
[3] A. Cano and D. Jimenez, Multidomain
ferroelectricity as a limiting factor for voltage
amplification
in
ferroelectric
field-effect
transistors, Appl. Phys. Lett., vol. 97, No. 13, pp.
133509-1133509-3, Sep. 2010.
- 224 -
FO-1-5-2
2-string AC-powered LED driver with current regulation reduction based on

simple circuit
Kilsoo Seo1, Kihyun Kim1, Hyungwoo Kim1, Kyungho Lee1, Jonghyun Kim2
1
Power Semiconductor Research Center, KERI, Changwon 642-120, Korea
1
Power Conversion Research Center, KERI, Changwon 642-120, Korea
ksseo@keri.re.kr, kihyun@keri.re.kr, kimjh@keri.re.kr
Abstract
In this letter, a new simple circuitry LED driver
with current reduction is proposed, realized and
experimentally validated. The circuit reduces nonconducting time of LEDs to enhance power factor and
total harmonic distortion. The flicker can also be
relatively reduced. By using current limiter cells,
lighting variation is eliminated with respect of the
variation of AC input voltage. A worst case of a 4W
with only two LED-strings driver is implemented and
tested by using a 1 um 650V BCDMOS high voltage
process to verify advantageous characteristics of the
suggested scheme. Experimental results demonstrate a
PF of 0.97 with a THD of 24.62% and an efficiency of
87.1% at a 220V AC supply.
Keywords: LED, AC driver, shunt regulator, flicker,
multi-string LED.
1. Introduction
LED lighting has been concerned as an effective
lighting generation for the last few years due to its
advantages: compact, long lifetime, environmental
friendliness, as compared to other lighting systems [1].
In the literature, a lot of AC-DC drivers have been
proposed with high efficiency [3,4]. Most of them use a
bulky transformer and electrolytic capacitors which
shorts the lifetime of LED module and cannot be
integrated inside the chip. In the design presented in [5],
the design gains a high PF and improves THD;
however, it may results in a current glitch due to hard
switching operation that degrades the THD due to
severe current distortion which then degrade PF,
shorten the LED lifetime [1]. Flicker and its human
health-related effects have been drawn much more
concerns [2]. In this letter, we propose a new AC LED
driver topology which owns some dominant advantages
of circuit simplicity, high efficiency and low cost.

Furthermore, the flicker effect is improved with the
variation of the input voltage by using current limiter
cells.
2. Proposed multiple-string AC LED driver

Fig. 1 illustrates the proposed AC LED driver. The
proposed AC driver is composed of four simple subblocks: a bridge, a LED module, and bias circuit
(comprised of a resistor RB, three zener diodes ZB1-ZB3,
and a high voltage power MOSFET MB), a group of
current limiter cells and a switching system (which is
not fully shown for simplicity of analysis). The core of
the proposed LED driver is the current limiter cells
which is compounded of two resistors, one power
MOSFET and a shunt regulator. These current limiters
are configured in a constant current sink topology with
the sink current expressed as: Isink = VREFi/Ri, where
VREFi is the voltage on the reference terminal of the ith
shunt regulator.
Assume that the forward voltage drops on the LED
string is indicated by VLED. The basic operating
principle of the proposed LED driver is described as
follows: At a low voltage, VIN < VLED1, no current
flows through the circuit since the forward voltage of
LED1 cannot overcome by the input voltage. When
VLED1 < VIN < VLED1+VLED2, the LED1 turns on and the
current limiter CLC1 operates in the constant current
status. Note that the CLCs cause an additional power
loss due to the voltage drops across the transistors and
resistors; hence, in order to obtain a high efficiency,
only one CLC1 turns on while the others turn off by
using the switching system. The switching signals are
generated by detecting the value on current-sensing
resistor RS1 (is the voltage from the reference voltage
terminal VREF1 of the shunt regulators SR1). The
switching system detects when VREF1 of SR1 is close
to 2.5 V, and it generates control signals to turn off the
other power MOSFET Msw2, Msw3... Mswn. These
- 225 -
ICEIC 2015
switching MOSFETs operate in active regions with low
resistances that mean the drain-source voltages which
equal to the gate voltages of the power MOSFETs drop
down to a low level then turns off accompanying CLCs.
As VIN continues increasing, all the LEDs will be
turned on. This process repeats in the next cycles.
To demonstrate the high performance of the

proposed scheme, only two-string driver was conducted.
The reason for this is that with more string LED, a
higher PF and a lower THD can be gained [1].
However, for a low cost-effective target, we need to
balance the performance and the chip cost. Also, with
only two-string driver, a control circuit can be easily
realized by using only a resistor and a MOS transistor.
The eight LEDs were used and divided into two strings,
one string consist of 2 sub-strings with 2 LEDs for each
and connected in parallel. The LED has a 20 mArms
operating current and a 50Vrms forward voltage. The
circuit schematic is presented in Fig. 3.
Fig. 1. The proposed multi-string ACpowered LED driver.
Fig. 3. 2-string AC LED driver.
Fig. 2. Operation modes of LED current

Fig. 2 shows the current generated from CLCs and
the LED current according to the input voltage. The
current flowing through the LED is the sum of the
currents generated from CLCs. By increasing the
number of LED strings, the step-like current
approximates to the sinusoidal input voltage. The
current flows from the section in which the input
voltage is low and the input current wave shape
widened, which leads to a lower THD and a higher PF.
In AC-powered LED driver based lighting systems, the
flicker phenomenon is generated due to the LED
brightness variation. The brightness variation of LED
caused by the LED current variation derived from the
variation of the input voltage then raises the fatigue of
the eye. In this design, since the peak current is limited
by utilizing current limiter cells, the size of the input
current according to the input voltage is kept as a
constant. As a consequence, this removed the
brightness variation of LED, thus the AC-related
flicker effect is eliminated.
First, the circuit was simulated via SPICE using

1um technology to verify the feasibility of the proposed
AC LED driver operation at rated conditions. The
value of the sensing resistors, RS1 and RS2 are set of
250 Ohms and 62.5 Ohms for constant currents of
CLCs of 10 mA and 40 mA, respectively. As expected,
the first LED string conducts when the input voltage is
over VLED1 + VdM1, and the second LED string
conducts when the input voltage is higher than VLED1
+ VLED2 + VdM2. As shown in this figure, for
different input voltages the input currents is always in
phase with the input voltages. In addition, the current
profile is expanded to a lower input voltage as
compared with conventional LED driver. These factors
demonstrate an improvement of THD and PF of
proposed LED driver. It can be seen that the input
current is nearly insensitive with the fluctuation of the
input voltage by using two CLCs. The input currents
are kept at a relatively constant at different input
voltages with the current regulation is reduced to 54.2
uA/V. As a result, the flicker effect caused by LED
brightness variation according to the fluctuation of
input voltage is removed.
The two-string LED driver was designed using a 1um 650V-BCDMOS process technology that provides
- 226 -
ICEIC 2015
lateral double-diffused MOS transistors with a 350V of
breakdown voltage.
The PF and efficiency totally satisfy the international

standard IEC-6200-3-2 for lighting system while the
THD does not. This can be easily understood because
the tested circuit only used 2-string LED. If we use
more LED strings with a lower forward voltage of LED
device (VLED < 50V as used in this test case), the THD
will be further lowered to be fit for this standard.
Table I. Performance of the proposed LED driver
Fig. 4. Simulated input current versus input

voltage
All of the components are integrated inside the chip
without
any
external
components.
The
microphotograph of fabricated monolithic IC is shown
in Fig. 5(a). The fabricated chip has 1.72 mm2 of area.
The chip was packaged directly on board with the
mounted LEDs of Seoul semiconductors AN4240 for
a cost-effective solution (Fig. 5(b)). The prototype
board was tested with 220Vac input voltage and
exhibited a consistent light as shown in Fig. 5(c).
Result
220/60
Unit
Vrms/Hz-
Input Current (RMS)
21.3
mA
Power of LED Lighting
Number of LED Strings
Power Factor
0.97
Total Harmonic Distortion
24.62
Efficiency
87.1
LED Module PCB Area
23.04
cm2
IC Process
BCDMOS
IC Active Area
1.72
mm2
IC Package
COB
5. Conclusion
In this paper, we have proposed a new, simple, low
cost and high efficiency AC LED driver. For the
evaluation, only 2-string LED driver was fabricated
using the 1-um 650V-BCDMOS process technology.
Measurement results demonstrated a high performance
that the driver can gain. The LED driver proposed can
be flexibly customized to get a higher performance
according to the requirement of the lighting systems by
choosing the number of LED string.
(a)
(b)
(c)
Fig. 5. (a) Microphotograph of the proposed 2-string
LED driver IC. (b) Prototype board. (c) Light by the
proposed driver
Fig. 6 shows the measurement waveform of the input
voltage and input current of the prototype board. Table
I shows the measurement summary of the prototype
driver. The measurements of the prototype are THD of
24.6 % with a PF of 0.97, and efficiency of 87.1% of a
4W.
Fig. 6. Measured waveforms of input voltage

and input current.
Subject
Input Voltage
References
[1] N. Ning, W. B. Chen, D. J. Yu, C. Y. Feng and C.
B. Wang: Electron. Lett. 49 (2013) 1170.
DOI:10.1049/el.2013.2093
[2] A. Wilkins, J. Veitch and B. Lehman: IEEE Energy
Conversion Congress and Exposition (2010) 171.
DOI:10.1109/ECCE.2010.5618050
[3] Y. Hu, L. Huber and M. M. Jovanovi: IEEE Trans.
Power
Electron.
27
(2012)
1579.
DOI:10.1109/TPEL.2010.2082564
[4] K. I. Hwu and W. C. Tu: Proc. IEEE Applications
Power
Electronics
Conf.
(2011)
713.
DOI:10.1109/APEC.2011.5744674
[5] M. E. Poplawski and N. M. Miller: Proc. of CIE
Centenary Conference Towards a New Century of
Light (2013) 188.
- 227 -
FO-1-5-3
A Capacitive-type MEMS Acoustic Sensor with a Diaphragm of Al/Si3N4/Al

Based on a Polyimide Sacrificial layer
*
J. Lee1, 2, C.H. Je1, Y.-G. Kim1, S.Q. Lee1, W.S. Yang1, and S.-G. Lee2
Nano Sensor Lab., Electronics and Telecommunications Research Institute, Korea
2
Dept. of Electrical Engineering, Korea Advanced Institute of Science and Technology, Korea
E-mail*: jaewoo@etri.re.kr
1
Abstract
A capacitive-type micro-electro-mechanical system
(MEMS) acoustic sensor with a diaphragm of
Al/Si3N4/Al (0.1/0.4/0.1 m) multi layers on a
sacrificial layer of 3.0 m polyimide is presented. It
can make the total fabrication process simpler due to
using O2 gas as a releasing material. Furthermore,
equivalent circuit modeling for the MEMS acoustic
sensor is implemented with a lumped model. The
acoustic sensor had a modeled open-circuit sensitivity
of -38.5 dBV/Pa at 1 kHz with a bias of 10.0 V, which
shows good agreement with the measured one in the
range from 100 Hz to 16 kHz.
patterned on a Si substrate by using DRIE, which could

work as a passivation layer against SF6 etchant. After
patterning, it was filled with a multilayer back-plate, in
which the layers comprised 1.0 m of oxide and 0.8
m of nitride. The back-plate electrode was a 0.5 mthick layer of Al. After that, 3.0 m of polyimide was
deposited and patterned as a sacrificial layer. A
diaphragm of Al/Si3N4/Al layers was implemented.
After the back chamber was etched by DRIE, the
sacrificial layer was finally released using O2 gas. The
sensor had a chip area of 1.0 1.05 mm2.
3. Characterization
To determine an open-circuit sensitivity (S0) of the
sensor, the pull-in voltage (VP) was measured by
Keywords: MEMS, acoustic sensor, Microphone,

Equivalent circuit modeling.
VP
1. Introduction
MEMS acoustic sensors have been widely applied to
the mobile phone with the greatly increasing demand
for microphones, especially in the smartphone market.
Consequently, numerous design issues and fabrication
methods have been reported on the basis of surface and
bulk micromachining [1]-[4]. In this paper, the
capacitive-type MEMS acoustic sensor is proposed and
investigated. In addition, to characterize the frequency
performance, structure-based equivalent circuit
modeling [5] is implemented. Ultimately, measured
data is compared with modeled values in order to
verify the validity of the proposed structure-based
lumped-parameter model of the MEMS acoustic sensor.
8g0 1
27 0 Sm
8g0 K eff
27 0 Aeff
(1)
where Sm was the mechanical sensitivity, g0 was the airgap between the diaphragm and the back-plate, 0 was
the dielectric constant of a vacuum, Keff was the
effective spring constant, and Aeff was the effective area
of a diaphragm. The VP was 15.0 V at g0 of 3.0 m.
The residual stress of the diaphragm was determined to
be +10 MPa. Furthermore, to evaluate the frequency
response, an equivalent circuit model [5] was used as
S0()
v ou t ()
1
, (2)
P ()
Aeff K 1() (1/ Aeff ) K 2() j (C0 CP )
where K1(w) and K2(w) are given by

K 1 ( ) Rr ( ) Rh R g j M r
2. Design and Fabrication

As shown in Fig. 1, a MEMS acoustic sensor was
designed to have a plate-type diaphragm, where it had a
diaphragm of 650 m diameter. In addition, to improve
frequency response, a back-plate anchor with wheelshaped inner cross bars was placed and fixed
underneath the back-plate by using DRIE patterning.
For the fabrication, first, a back-plate anchor was
K 2 ( ) j M d
1
j C bc
.
j C d
j (C 0 C P )
2
(3)
(4)
Fig. 2 describes a schematic cross section of the model

and its equivalent circuit is in Fig. 3. In addition, Fig. 4
shows a set-up of resonance frequency (fr)
measurement, where fr was 55 kHz at 3 VDC, and a de-
- 228 -
ICEIC 2015
capped MEMS microphone module. The measured
sensitivity Smea was -39.4 dBV/Pa at 1 kHz (0 dB = 1
V/Pa, ROIC gain = 6 dB at 1.6 pF input capacitance).
The measured S0 was extracted to -38.5 dBV/Pa. As a
result of modeling, the modeled S0 had a good
agreement with the measured S0, as shown in Fig. 5.
Diaphragm
Acoustic chamber
Cbc
Cd
Air gap
Vout ()
Md
Metal lid
Rg
Rh
P ()
Read-out IC
hole
Rr ()
PCB
Mr
Acknowledgement
Vout ()
S0 ()
This work was supported by the IT R&D program of

MKE/KEIT. [10035570, Development of self-powered
smart sensor node platform for smart&green building]
Fig. 2. The cross section schematic view for an

equivalent circuit model of the proposed MEMS sensor.
References
[1] P. R. Scheeper, et al, Sensor and Actuators A, vol. 44, pp.
1-11, 1994.
[2] Q. Zou, et al, IEEE J. Microelectromech. Syst., vol. 5, pp.
197-204, 1996.
[3] J. W, et al, IEEE MEMS 2006 Conf., pp. 86-89, Jan. 2006.
[4] M. Gato, et al, IEEE Sens. J., vol. 7, pp. 4-10, Jan. 2007.
[5] H. A C Tilmans, J. Micromech. Microeng., vol. 9, pp.
157-176. Mar. 1996.
Diaphragm (Al/Si3N4/Al)
A1
P ()
Acoustic wave
Mr Rr () Rh
Rg
1:Aeff Ud
Md Cd
:1
P ()
Pd
Fd
C0
Fe
Cp
Vout ()
Cbc
Fig. 3. An equivalent circuit for the open-circuit

sensitivity of the proposed MEMS sensor.
Diaphragm pad
B1
-fr measurement
= 650 um
- De-capped MEMS microphone

(PCB area: 3.4 x 3.0 mm2)
Diaphragm holes
B2
A2
*chip area: 1.0 x 1.05 mm2
Back-plate pad
(a)
A1-A2 cross section
B1-B2 cross section
acoustic sensor
*Polytec MSA-400
Read-out IC
2.3 um thickness of back-plate (SiO2/Si3N4/Al)

back-plate anchor
Fig. 4. A set-up of resonance frequency measurement

and de-capped MEMS microphone module.
3.0 um thickness of sacrificial (Polyimide)
Sensitivity (dBV/Pa)
-10
0.1/0.4/0.1 um thickness of diaphragm (Al/Si3N4/Al)

0.6 um thickness of diaphragm anchor (SiO2)
Back etching & Sacrificial layer releasing
-20
measured S0
modeled S0
modeled fr at 10.0 V = 56 kHz
-30
-40
-50
-60
Measured S0 at 10 V = -38.5 dBV/Pa @ 1 kHz
100
1000
10000
100000
Frequency (Hz)
(b)
Fig. 1. Images (a) and schematic cross section views
(b) for the fabrication process for the MEMS sensor.
Fig. 5. Modeled and measured S0 as a function of

frequency for the proposed MEMS sensor.
- 229 -
FO-1-5-4
A 3.1-V 21-mW 1.5-Bit Fourth-Order Double-Sampled ADC

with 92-dB Dynamic Range
Young-Ouk Kim and Gil-Cho Ahn
Dept. of Electronic Engineering, Sogang University, Seoul, Korea
gcahn@sogang.ac.kr
Abstract
A 1.5-bit fourth-order double sampled delta-sigma
analog-to-digital converter (ADC) is presented.
The input feed-forward topology is used to reduce the
internal voltage swing of the integrators. A fullyfloating architecture is employed in order to avoid the
path gain mismatch problem which is caused by a
capacitor matching error in feedback digital-to-analog
converter (DAC). The ADC implemented in a 0.35m CMOS process achieves 92.0 dB DR, 88.3 dB
SNDR and 88.7 dB SNR for a 35-kHz input sine wave
signal over bandwidth of 200-kHz while consuming
21mW with a 3.1-V supply voltage.
Keywords: Delta-sigma ADC, double sampling, input
feed-forward, oversampling, switched-capacitor circuit.
1. Introduction
Delta-sigma analog-to-digital converters (ADCs)
with oversampling and quantization noise shaping are
traditionally main candidates for high and very high
resolution low-to-medium bandwidth applications [1].
In the recent trends, the operation speed of ADCs is
improved in accordance with development of submicron CMOS process. The challenge of a latest
ADCs is to reduce power consumption from
satisfying strict requirements of settling time. The
double-sampling technique is a well-known approach
to increase the over-sampling ratio (OSR) by a factor
of two with a negligible power penalty [2]. In this
paper, a 1.5-bit fourth-order double-sampled ADC
which uses fully-floating configuration is presented.
2. Architecture
The block diagram of the proposed fourth-order feedforward ADC with double sampling technique is
shown in Fig. 1. The signal component which appears in
the loop filter of the conventional modulator is mostly

removed by using input feed-forward topology. Thus, the
design requirement of the amplifier becomes relaxed. It
also simplifies the input sampling networks of the double
sampling integrators by eliminating the local feedback
loops.
3. Circuit Description
A schematic of the first integrator using double
sampling technique is shown in Fig. 2. The fullyfloating configuration is employed to solve the path
gain mismatch problem which affects overall
performance of the ADC. The mismatch in the input
signal path has little effect on the performance because
the modulated input signal near fs/2 can be eliminated
by digital filter. However, in case of feedback path, it
degrades the SNR significantly since huge quantization
noise power near fs/2 is folded into a signal band [3].
Thus, the fully-floating configuration is applied to only
feedback path to avoid noise folding. Dedicated
capacitors are used for input sampling and feedback
DAC to implement fully-floating switched capacitor
circuit. To achieve high DC gain of the amplifier, fullydifferential folded cascode topology is used in all of the
integrators. The finite gains of the amplifiers are
determined by considering the quantization noise
leakage to satisfy the target performance.
4. Measurement Results
The designed ADC was implemented in a 0.35m CMOS process, and occupies 0.76 mm2 active die
area. The fabricated chip is shown in Fig. 3. The
measured power spectrum for a -3.2 dBFS 35-kHz
sinusoidal input is shown in Fig. 4. The prototype
achieves 88.3 dB peak SNDR and 92.0 dB dynamic
range with a 3.1-V supply voltage and 21-mW power
consumption. A 25.6-MHz clock frequency is used,
resulting in an OSR of 128. The measured SNR and
SNDR versus input amplitude curves are shown
- 230 -
ICEIC 2015
+-
1/5
1/4
1/10
1/4
1.5-bit
ADC
2
3
4
DEM
Fig. 1. Block diagram of the proposed fourth-order modulator.

f2
f2p
CS11
f1
f1
Vinn
f2p
/fni
x2 pair
fni
fpi
Vinp
f2
Voutp
f1p
/fpi
Vrefp
Ci
f2p
Cd1
A1
Voutn
f1p
Cd2
Supply: 3.1 V
FIN: 35 kHz
FCLK: 51.2 MHz
VIN: 2.26 Vpp (-3.02 dBFS)
SNR: 88.7 dB
SNDR: 88.3 dB
SFDR: 102.6 dB
-20
f1p
CS12
f2
Vrefn
f1p
Output specturm [dB]
Vinp
f2p
-40
-60
-80
-100
-120
-140
-160
f1p
CS13
f2p
-180 2
10
Ci
f1
f1
Vinn
f1p
CS14
n-1
104
105
Frequency [Hz]
106
107
Fig. 4. Output FFT spectrum.
f2p
f2
103
100
n+1
n+2
SNR
SNDR
90
f1 /f1P
80
Magnitude [dB]
f2 /f2P
Fig. 2. Schematic of the first integrator.
70
60
50
40
30
20
INT1
INT2
INT3
INT4
10
Quantizer
0
-70
-60
-50
-40
-30
Input level [dBFS]
-20
-10
Fig. 5. SNR and SNDR versus input amplitude.

CLK & DEM
Table 1. Performance summary of the ADC.
Fig. 3. Chip photograph.
Process
Power Supply
Sampling rate
Clock frequency
Signal Bandwidth
Oversampling Ratio
Dynamic Range
Peak SNR
Peak SNDR
Input Range
in Fig. 5, with the input amplitude normalized by the

reference voltage. The measurement results are
summarized in Table 1.
Acknowledgment
This work was supported by IDEC, and the MSIP
(Ministry of Science, ICT and Future Planning), Korea,
under the ITRC (Information Technology Research
Center) support program (NIPA-2014-H0301-14-1007)
supervised by the NIPA (National IT Industry
Promotion Agency).
Power consumption
Chip Area
0.35 m CMOS
3.1 V
51.2 MHz
25.6 MHz
200 kHz
128
92.0 dB
88.7 dB @ FIN = 35 kHz
88.3 dB @ FIN = 35 kHz
3.2Vp-p.diff.
Analog: 16.7mW
Digital: 4.40mW
0.76 mm2
References
[2] D. Senderowicz et al., Low-voltage double-sampled

converters, IEEE J. Solid-State Circuits, vol. 32, pp.
1907-1919, Dec. 1997.
[1] H. Inose, Y. Yasuda, J. Murakami, A telemetering

system by code modulationmodulation, IRE Trans.
Space Electron. Telemetry, vol. 8, pp. 204-209, Sep. 1962.
[3] M.G. Kim et al., A 0.9 V 92 dB double-sampled

switched-RC delta-sigma audio ADC, IEEE J. Solid-State
Circuits, vol. 43, pp. 1195-1206, May. 2008.
- 231 -
FO-1-5-5
A Serializer for Converting Parallel Data with Various Data Rates to Serial Data
Keun-Seon Ahn1, Chang-Hyun Bae1, 2, and Changsik Yoo1
1
Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea
2
DRAM Design, Samsung Electronics, Hwaseong, Korea
gtcorea@hanyang.ac.kr, chbae@hanyang.ac.kr, csyoo@hanyang.ac.kr
Abstract
Serializer
A serializer that parallel data with various data

rates can be converted to serial data using independent
external clock with fixed frequency is presented. Each
parallel data of 75-, 150-, and 300-Mbps is serialized
to each serial data of 1.5-, 3-, and 6-Gbps respectively.
The proposed serializer implemented in a 65-nm
CMOS process occupies 0.024-mm2 and consumes 8.4mW at 6-Gbps from a 1.2-V power supply.
Keywords: Serializer, Voltage-mode driver, CMOS.
1. Introduction
In order to increase data bandwidth while
improving signal integrity, the serialized data is widely
used in a serial link transceiver [1]. In order to serialize
each of input data rates (75-, 150-, 300-Mbps) to each
of output data rates (1.5-, 3-, 6-Gbps), a wide range
phase-locked loop (PLL) which is difficult to be
realized can be required. Instead of using the wide
range PLL, the input data with different data rate are
converted into the serialized data with the predetermined fixed data rate [2]. Because the output data
rate is fixed regardless of the input data rate by
changing a serialization ratio which is the ratio of the
parallel input data rate and the serialized output data
rate, this technique is not suitable for systems that the
output data rate should be changed in accordance with
input data rate with the fixed serialization ratio.
In this paper, the serializer using an external clock
with fixed frequency is presented. Parallel data having
various data rates are serialized with the fixed
serialization ratio by adjusting the multiplexing ratio
instead of changing the frequency of the external clock
or using additional PLLs.
2. Circuit description
Figure 1 shows the block diagram of the proposed
serializer composed of CLK Selector, Data Register,
20:i MUX, 20:i MUX CTRL Generator, i:1 MUX, and
D0[0:9]
DIN[0:19]
Data
Register
D1[0:9]
20:i
MUX
DMO1[0:i-1]
i:1
MUX
DMO2<n>
DOUT<n>
Voltage-mode driver
iTBC
CK_EXT[0:3]
TBC
CLK
Selector
CK_INT[0:3]
SELiDj[k]
20:i MUX
CTRL
Generator
SEL_MUX[0:i-1]
i:1 MUX
CTRL
Generator
MODE_SEL[0:2]
Figure 1: Block diagram of the proposed serializer
i:1 MUX CTRL Generator. CK_EXT[0:3] are 1.5-GHz

4-phase external clocks. An external clock TBC is
aligned to the edge of DIN[0:19]. MODE_SEL[0:2]
control the multiplexing ratio i of the serializer
depending on data rate (75-/150-/300-Mbps) of
DIN[0:19]. A CLK Selector generates internal clock
iTBC and CK_INT[0:3] from TBC and CK_EXT[0:3].
DIN[0:19] is re-aligned to internal clock domain in
Data Register using iTBC because external clock
CK_EXT[0:3] and DIN[0:19] are uncorrelated of each
other. The re-aligned data D0[0:19] and D1[0:9] are
finally serialized through 20:i MUX and i:1 MUX.
Table 1 shows the multiplexing ratio of the MUXs
depending on input data rate. SELiDj[k] performs 20:i
multiplexing by selecting suitable data and the number
of output data array from the D0 and D1 according to
input data rate. This data array is re-multiplexed by
SEL_MUX [0:i-1] and finally serialized at a data rate
of 20 times of input data rate. Figure 2 describes the
timing diagram of the serialization as input data rate is
varied. The serialization ratio is maintained during the
serialization by adjusting the multiplexing ratio i.
3. Measurement Results
The prototype serializer with a voltage-mode driver
has been implemented in a 65-nm CMOS process. The
microphotograph and layout are shown in Figure 3 and
the serializer occupies 0.024-mm2 active area. Figure 4
shows the eye diagrams and the eye openings for the
BER of 10-12 at the end of a cable with 5-dB loss at 3GHz. The serialized data with CK_EXT[0:3] having a
- 232 -
ICEIC 2015
Table 1: Multiplexing ratio according to data rate
Input
Output
20:i MUX
i:1 MUX
data rate
data rate
75-Mbps
20:1
1:1
1.5-Gbps
150-Mbps
20:2
2:1
3-Gbps
300-Mbps
20:4
4:1
6-Gbps
100m
Voltage-mode
driver
240m
Serializer
Figure 3: Chip micro-photo and layout
CK_INT[0]
CK_INT[1]
CK_INT[2]
CK_INT[3]
TBC @ 300MHz
DIN[0:19] @ 300Mbps
[0:19]
CK[0]
CK[1]
0.87-UI
CK[2]
CK[3]
iTBC @ 300MHz
D0[0:19] @ 300Mbps
[0:19]
D1[0:9] @ 300Mbps
20:4
MUX
4
1
DMO1[1] @ 1.5Gbps
DMO1[2] @ 1.5Gbps
4:1
MUX
(a)
[10:19]
0
DMO1[0] @ 1.5Gbps
12
10
DMO1[3] @ 1.5Gbps
16
13
17
14
11
18
15
19
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
DMO2 @ 6Gbps
(a)
0.84-UI
CK_INT[0]
CK_INT[1]
CK_INT[2]
(b)
CK_INT[3]
TBC @ 150MHz
DIN[0:19] @ 150Mbps
[0:19]
CK[0]
CK[1]
CK[2]
CK[3]
iTBC @ 150MHz
0.71-UI
D0[0:19] @ 150Mbps
20:2
MUX
2:1
MUX
[0:19]
D1[0:9] @ 150Mbps
[10:19]
0
DMO1[0] @ 1.5Gbps
2
1
DMO1[1] @ 1.5Gbps
0
DMO2 @ 3Gbps
3
2
5
4
10
12
11
14
13
16
15
18
17
(c)
19
Figure 4: Measured eye diagram depending on mode selection

MODE_SEL[0:2] (a) 1.5-Gbps (b) 3-Gbps (c) 6-Gbps
9 10 11 12 13 14 15 16 17 18 19
(b)
CK_INT[0]
input parallel data and controls the ratio of MUXs (20:i

and i:1 MUX) depending on input data rate. The
serialization for each data rate of 1.5-, 3-, and 6-Gbps
is verified through measuring the eye diagrams and the
eye openings for the BER of 10-12.
CK_INT[1]
CK_INT[2]
CK_INT[3]
TBC @ 75MHz
DIN[0:19] @ 75Mbps
[0:19]
CK[0]
CK[1]
CK[2]
CK[3]
iTBC @ 75MHz
D0[0:19] @ 75Mbps
20:1
MUX
1:1
MUX
DMO1[0] @ 1.5Gbps
DMO2 @ 1.5Gbps
Acknowledgments
[0:19]
[10:19]
D1[0:9] @ 75Mbps
0
0
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
9
10 11 12 13 14 15 16 17 18 19
10 11 12 13 14 15 16 17 18 19
(c)
Figure 2: Timing diagram of the proposed serializer when the
input data rate is (a) 300-Mbps, (b)150-Mbps, and (c)75-Mbps.
fixed frequency of 1.5-GHz is measured at each data

rate of 1.5-, 3-, and 6-Gbps converted by
MODE_SEL[0:2].
4. Conclusions
A serializer capable of converting parallel data
having various data rates to serial data using independent external clock and maintaining a serialization ratio
is presented. A serializer detects the sampling point of
This work is sponsored by IT R&D program

MKE/KEIT. [No.10035202, Large Scale hyper-MLC
SSD Technology Development]. The CAD tools were
provided by IC Design Education Center (IDEC),
KAIST, Korea.
References
[1] D. A. Yokoyama-Martin, et al, A Multi-Standard
Low Power 1.5-3.125Gb/s Serial Transceiver in 90nm
CMOS IEEE Custom Integrated Circuit Conf., Sept.
2006, pp.401-404.
[2] K. Y. Park, et al, A 6.24-Gb/s Wide-Input-Range
Serializer ASIC using Fixed-Data-Rate Scheme, IEEE
Int. Symp. Circuits and Systems, pp.1704-1707, May
2012.
- 233 -
FO-1-5-6
Investigation of the effect of gate space length variation on the retention

characteristics in NAND flash array
Joo Yun Seo, Dae Woong Kwon, Sang-Ho Lee, and Byung-Gook Park
Inter University Semiconductor Research Center (ISRC) and
School of Electrical and Computer Engineering, Seoul National University
jooyun@snu.ac.kr
Abstract
In this work, the retention characteristics are
investigated in charge trap type NAND flash array
with gate-all-around structure using TCAD simulation.
When gate space lengths are varied from 20 nm to 60
nm, the retention characteristics are improved in the
case of longer gate space length. These phenomena are
related to the hole concentration between cells, which
induces the redistribution of trapped electrons.
flash cells are connected in series, and the diameter of

the nanowire is 30 nm. Flash cells have bandengineered charge trap layers [2] and the thickness of
tunnel dielectric layer/nitride/blocking oxide layer
(O/N/O/N/O) is 1/2/2/6/6 nm, respectively. Between
the cell gates, virtual source and drain region is formed
by the fringing field of the gates [5]. Simulation
conditions are stated in Table 1.
Table 1: Simulation conditions
Channel diameter
Cell gate length
SSL gate length
Gate space length
Retention temperature
Keywords: charge trap NAND flash memory, data

retention, gate-all-around (GAA), TCAD simulation
1. Introduction
As the demand for mobile devices such as smart
phones, tablet PCs, and solid-state drives (SSDs)
increases, NAND flash memory has become the most
widely used memory device owing to its ultrahigh
storage capacity. However, the limitation of
photolithography and cell-to-cell interferences hinders
further two-dimensional scaling of the device. To
overcome NAND scaling issues, a three-dimensional
(3D) stacked NAND array has been considered as a
breakthrough, since Toshiba reported bit-cost scalable
(BiCS) technology [1-3]. In 3D NAND, charge trap
layer is widely used due to its easiness of fabrication,
and better scalability. However, its retention
characteristic is a critical issue [4] to be improved for
reliable performance in many applications. In this work,
the retention characteristics are investigated in NAND
flash array with gate-all-around (GAA) structure and
single crystalline silicon channel.
We adopted gate-all-around (GAA) structure with
single crystalline channel for TCAD simulation. Three
30 nm
40 nm
100 nm
20/30/40/50/60 nm
85
After setting threshold voltages of programmed cells

to 0, 1, 2, 3, and 4 V, retention characteristics were
investigated with different gate space lengths. Figure 1
shows transfer curves of erased cell and programmed
cells. Threshold voltages were evaluated as the value of
the gate voltage, corresponding to 30 nA of the drain
current.
Figure 2 shows retention characteristics of
programmed cells. In baking at 85 , the threshold
voltage interval gets narrower. The amount of the
decreased threshold voltage is shown in Fig. 3 as a
function of gate space length. As gate space length
decreases, the amount of the shifted threshold voltage
increases. These phenomena are mainly attributed to
redistribution of trapped electrons in the nitride layer.
Fig. 4 depicts the density of trapped holes in the erased
cell. As gates get closer, the larger area of the nitride
layer between neighboring cells is filled with trapped
holes. The part of these holes remains even after
programming. Due to the interaction with holes in the
gate space, electrons are apt to distribute in lateral
direction, which causes the reduction of threshold
- 234 -
ICEIC 2015
voltage. In Fig. 5, we can see the distribution of
trapped electrons after 2 hours of retention conditions.
3. Conclusions
We investigated the effect of the gate space length
variation on the retention characteristics in NAND
flash array. In the case of short gate space length, holes
remained between cells interact with trapped electrons,
and it causes the reduction of threshold voltage of
programmed cells.
Figure 2. Retention characteristics at 85 (gate
space length = 40 nm)
Acknowledgement
MKE/KEIT (10035320, Development of novel 3D stacked
devices and core materials for the next generation flash
memory).
References
[1] A. Nitayama and H. Aochi, Bit Cost Scalable (BiCS)
flash technology for future ultra high density storage
devices, in International Symposium on VLSI Technology,
2010, pp. 130131.
[2] H.-T. Lue et al., A highly scalable 8-layer 3D verticalgate (VG) TFT NAND flash using junction-free buried
channel BE-SONOS, in Symposium on VLSI Technology,
Honolulu, HI, 2010, pp. 131132.
[3] Y. Kim et al., Three-dimensional NAND flash memory
based on single-crystalline channel stacked array, IEEE
Electron Device Letter, vol. 34, no. 8, pp. 990992, 2013.
[4] C. M. Compagnoni, A. S. Spinelli, and A. L. Lacaita,
Experimental Study of Data Retention in Nitride Memories
by Temperature and Field Acceleration, Electron Device
Letters, IEEE, vol. 28, no. 7, pp. 628630, 2007.
[5] W. Kim et al. Arch NAND flash memory array

with improved virtual source/drain performance, IEEE
Electron Device Letter, vol. 31, 12, pp. 13741376,
2010.
Figure 1. Transfer characteristics of flash memory

cells. (gate space length = 40 nm)
Figure 3. Amount of the decreased threshold

voltage as a function of gate space length.
Figure 4. Density of trapped holes in the erased cells.
Figure 5. Distribution of trapped electrons after

baking at 85 for 2 hours.
- 235 -
ICEIC 2015

Oral Session
FO-2-1
Control and Robotics(Lab-to-Lab) II
- 236 -
FO-2-1-1
Large actuation of an acrylic-based dielectric elastomer actuator in tubular

configuration
Ying Shi Teh,1 Yu Feng Goh,2 Soo Jin Adrian Koh1,2
1
Engineering Science Programme, National University of Singapore, 9 Engineering Drive 1, 117576, Singapore
Department of Mechanical Engineering, National University of Singapore, 9 Engineering Drive 1, 117576, Singapore
a0101671@nus.edu.sg, goh_yu_feng@nus.edu.sg, mpekohsj@nus.edu.sg
By suppressing electromechanical instability (EMI),

dielectric elastomer actuators (DEAs) have been shown
to achieve giant electrical actuation in excess of 100%
strain. We suppress EMI by applying lateral pre-stretch
to a DEA, and then clamping it to preserve the
prestretch. We then roll this assembly into a tube. DEAs
in this configuration allow it to be integrated into
robotics and mechatronics systems, so as to function as
a soft actuator. We demonstrate that DEAs in such a
configuration achieves a continuously tunable actuation
strain of 200%. The experimental data collated are
found to be in good agreement with a recently-proposed
numerical model. Hence, our experiments may be used
in conjunction with the numerical model for the design
and development of an acrylic-based tubular DEA.
Keywords: Dielectric elastomer,
electrical actuation, prestretch.
tubular,
Under a moderately high electric field, DEAs suffer

from electromechanical instability (EMI), which occurs
as a result of a positive feedback between increasing
electric field and thinning dielectric elastomer. At the
critical voltage, the dramatic increase in electric field
often leads to electrical breakdown. This limits its
maximum actuation to only 30% strain [3]. EMI is
represented by a peak in the voltage-stretch curve
(Figure 2a). Studies have shown that prestretching
effectively suppresses EMI (Figure 2b), allowing for
actuation under an electric field to surpass the 30%
strain limit [4]. Stabilizing a DEA against EMI further
eliminates the bi-stable switching at the point of
instability, thereby allowing for a continuously tunable
actuation under an increasing electric field [4].
giant
1. Introduction
Voltage
Abstract
Voltage
Soft dielectric elastomer has attracted much research

interests due to its potential for high actuation strain and
pressure that is comparable to biological muscles. Along
with other attributes including light weight, silent
operation, fast response and low cost, [1] the dielectric
elastomer actuators (DEAs) are considered for
opportunities in biomimetic functions in a wide range of
devices including soft robots and artificial limbs. [2]
A dielectric elastomer (DEA) consists of a flat
elastomer membrane sandwiched between compliant
electrodes. Applying voltage on the compliant
electrodes induces Maxwell stress, which compresses
the elastomer in its thickness, leading to areal expansion
(Figure 1).
Compliant
electrode
Dielectric elastomer

Stretch
(a)

Stretch
(b)
Figure 2: Voltage-stretch curves. (a) Voltage-stretch

response of a typical DEA with the occurrence of
EMI at critical voltage, . The onset of EMI
corresponds to the peak of the curve, indicated by .
(b) By applying a sufficiently large prestretch to the
elastomer, the local peak in the curve is suppressed,
therefore eliminating EMI.
By applying appropriate prestretch to a DEA, we
have demonstrated actuation of up to 500% linear
actuation strain for an acrylic-based DEA in a flat
configuration (Figure 3) [5]. Here, we roll the DEA into
a tubular configuration (Figure 4). This configuration
allows the DEA to be easily modularised and stacked to
create actuation systems.
We use experiments to demonstrate very large
actuation, and show that our experiments agree with
theoretical predictions.
Figure 1: Schematic of a DE membrane subjected to

a voltage
- 237 -
ICEIC 2015

coordinates
of
and
respectively in the actuated state.
From Figure 5, considering geometry, we have:
Figure 3: Schematic of a flat DEA laterally

prestretched and clamped on top and bottom.
Retraction of prestretch takes place along the
unclamped vertical edges.
P
H
P
(c) Actuated
(b) Mechanically
loaded
Figure 4: Schematic of tubular dielectric elastomer

(DE). (a) At unloaded and uncharged state. The DE
has length L, radius B, and thickness H. (b) At
mechanically-loaded state. When the DE is
prestretched in the hoop direction, and constrained
on its ends by two rigid rings of radius b, which is
then loaded in the longitudinal direction by a dead
load P, the longitudinal length is Lpre. (c) At actuated
state, a voltage is applied on the DEA, the DEA
expands in the longitudinal direction to Lact.
2. Computational model
A numerical model, proposed by Lu et. al., was used
to model our experiment [6].
Using axisymmetry of the DE membrane in the
tubular configuration, each material particle can be
labelled solely by a coordinate along its height, in the
unloaded and uncharged state, . Consider an element
connected by two neighbouring material particles,
located at coordinate points and . In the
actuated state, the element is stretched by and is
oriented at an angle from the radial axis (Figure 5).
The deformed element length becomes . We
.
further define hoop stretch as
(1b)
(2)
Lact
P
(a) Unloaded
and uncharged
(1a)
Lpre
The Helmholtz free energy is given as:
b
b
is the mechanical work done by the elastomer,

is the electrical work done by the electric field, and
is the free energy density of the DE, given
by the sum of and

. The first term
is the free energy density associated with the

stretching of the DE. It is represented by the Gent
hyperelastic material model [7], which takes into
account the strain-hardening behaviour as the DE
approaches its stretch limit. The second term
represents the dielectric energy. [8] Here we assume

that the DE is a linear, ideal elastomer which polarises
almost as freely as polymer melt. [9] The electric
displacement therefore relates to the electric field as
, where the the dielectric constant is assumed
to be independent of the state of deformation. Assuming
incompressibility, the stretch in thickness can be
expressed as
. The Gent model is given in (3),
where is a constant related to the stretch limit and
is the small strain shear modulus.
. This equation of equilibrium holds

for arbitrary, independent and small variations in ,
and . Subsequently the following equations-ofstate can be derived.
(3)
Using the Variational Principle, we set

(4a)
(4b)
(4c)
where and are nominal stresses. They are related

to the true stresses and respectively and can be
expressed as
Figure 5: An element joining two neighbouring

material particles in the actuated state. denote
the coordinates in the hoop direction and along the
axis of rotational symmetry respectively. The
material particles and take the spatial
- 238 -
(5a)
(5b)
ICEIC 2015
Combining equations (4a) and (4b) gives equation
(6), while applying an appropriate boundary condition
to equation (4a) gives equation (7).
and are measured from image analysis of the

video frames (Figure 6).
15.3mm
14.9mm
Lpre
(6)
47.8mm
48.3mm
(7)
The shooting method is then used to solve the

boundary-value problem, defined by the system of
equations (1b), (6) and (7).
We first convert the problem into an initial-value
problem by setting the appropriate initial conditions.
using the symmetry of the setup along the
plane . With an initial guess of , can
be calculated from Eqn (7). The system is then solve
iteratively to obtain the functions and
for the interval . It suffices to solve
for this interval due to the symmetry of the problem. If
the boundary condition is not satisfied,
is iterated by the bisection method, until the
condition is satisfied within a sufficiently small
tolerance.
Lactuation

=6.017kV
=0V
Figure 6: (a) No voltage applied (b) Voltage is

applied. (a) and (b) are of the same magnification.
Comparing them gives an average actuation strain of
218% for this figure.
4. Results
Voltage-actuation
strain
curves
for
both
experimental and numerical model are plotted in Figure
6. In the numerical model, we assume the following
material properties: Dielectric breakdown strength, =
200MV/m, relative permittivity, = 5, small strain
shear modulus, = 50kPa and stretch limit, = 120.
8
Voltage / kV
The longitudinal length of the actuator in the

actuated state can be calculated by
. The key parameters that can be varied

in the model are the normalised mechanical force
, hoop prestretch and the aspect ratio in
the reference configuration, .
6
2=6
Pload= 415g
L/B = 1.32
4
2
0
0
Actuation strain
3. Experimental Setup
(a)
We fabricate the tubular DEA by first prestretching

a DE membrane (3MTM VHB 4905) in the hoop
direction, giving the lateral prestretch: = b/B. In our
experiment, we select This value was selected
based on a theoretical analysis, which showed this level
of prestretch to be optimal in maximizing the actuation
strain [10].
Voltage / kV
8
6
2=6;
Pload=315g
L/B = 1.32
4
2
0
0
The stretched DE is mechanically rolled onto two

rigid rings, each of radius , mounted to a
rack and pinion system.
Actuation strain
(b)
Carbon grease, Nye Nyogel 756G, is brushed onto

the inner and outer walls of the elastomer as the
compliant electrode. The top ring is fixed in-position,
while the bottom ring is free to move. Dead weights
(Pload) are hung on the bottom ring.
The dead weight was hung on the DEA for 30
minutes before voltage was applied. This was to allow
for the viscous elastomer to fully relax to its
mechanically stretched state. A Glassman FX60R5 high
voltage power supply provides electric field to the DEA.
Voltage was ramped at a constant rate of 6.65 V/s. The
experiments are filmed and the resulting actuation strain
is computed as . The values of
Figure 7: Voltage-actuation strain curves,

terminating at electrical breakdown. Solid lines
denote experimental data; red dotted lines denote
numerical results. At electrical breakdown, (a) total
electrical actuation is predicted to be 136 % strain,
average experimental maximum is218% (b)
theoretical prediction is 176%, average experimental
maximum is144%. The plots show good qualitative
agreement between theory and experiment for its
voltage-actuation strain response. The significant
difference in maximum actuation strain may be due
to the high variability of measured dielectric
constants, the highly stretch dependent dielectric
strength, and small strain shear modulus.
- 239 -
ICEIC 2015
5. Discussion
As seen in Figure 7, the experimental data are in
good qualitative agreement with the theoretical results.
With a higher Pload of 415g, an actuation strain of over
200% is attained at an applied voltage of 6kV (Figure
7a).
However, there is a significant difference in
maximum actuation strain. This may be due to the high
variability of the material constants, which include
dielectric constant , dielectric strength and small
strain shear modulus . To ascertain this, we vary the
values of the material constants to fit the theoretical
model to the experimental data. The results are
presented in Figure 8.
considerations. We have demonstrated giant electrical

actuation by applying hoop prestretch of six. Actuation
can be further increased by using a smaller aspect ratio.
When the aspect ratio approaches zero, the actuator
behaves as a pure shear actuator and the corresponding
actuation strain is maximised [6]. However, this is
impractical due to the limited amount of total
displacement that can be attained. This can be
circumvented by first selecting the aspect ratio for a
desired actuation strain. Multiple layers of tubular
DEAs can then be stacked to raise the total
displacement (Figure 9).
Voltage / kV
Figure 9: Schematic of stacked tubular actuator

supported by rigid rings.
6
2=6;
W=415g
L/B = 1.32
4
2
0
0
To guide the selection of aspect ratio, an actuation

map for the maximal attainable actuation strain for a
varying aspect ratio and normalised load can be plotted
using the numerical model presented in Section 2.
Actuation strain
(a)
1.0
0.5
Voltage / kV
8
6
2=6
Pload=315g
L/B=1.32
4
2
0
0
4.5
Actuation strain
(b)
Figure 8: Voltage-actuation strain curves. Solid lines
denote experimental data; red dotted lines denote
fitted numerical data with material constants of (a)
, , (b)
, ,
By varying the values of the material constants in
the theoretical model, we obtain a very good fit between
experimental and theoretical data on actuation response.
These material constants used to fit the two sets of
experimental data are found to coincide with the
published values of dielectric constants (ranging from
4 to 6.5) [11], the highly stretch dependent dielectric
strength , and the highly variable small strain
shear modulus (ranging from 45 kPa to 65 kPa) due to
the viscoelastic effect of the elastomer [13].
Figure 10: Theoretical prediction of maximum

actuation strain for prestretch = 6, normalised
load ranging from 0.1 to 3.0, and aspect
ratio ranging from 0.5 to 3.0, using the material
constants specified for Figure 7.
Figure 10 shows that an optimal preload exists for a
given aspect ratio. In the absence of preload, necking of
the tubular wall of the DEA occurs due to high tension
resulting from lateral prestretch. By applying a small
preload, it introduces tension in the vertical direction,
therefore limiting the necking effect. This allows the
DEA to be closer to the pure shear configuration, hence
increasing the maximum attainable longitudinal stretch.
On the other extreme when a very large dead load is
applied, the longitudinal length in the uncharged state,
, is substantial, reducing the maximum actuation
strain attainable.
In the design of an actuator system, both maximum

displacement and actuation strain are important
- 240 -
ICEIC 2015
6. Conclusion
While previous studies have reported actuation
strains of 37.3% and 35.8% for a tubular DEA and a
fibre-stiffened cylindrical DEA respectively [14], we
demonstrate a 200% actuation strain for a similar
tubular DEA. This was due to the application of a large
hoop prestretch of 6 that fully suppresses
electromechanical instability (EMI), and thereby
allowing for giant electrical actuation. Our experiments
further exhibit very good agreement with a theoretical
model using published values of material constants. The
verification of the analytical model allows us to create
an actuation map for varying aspect ratio and preload.
This allows optimal soft actuation systems to be
designed and developed.
[14] Huang, J., et al., Large, uni-directional actuation

in dielectric elastomers achieved by fiber
stiffening. Applied Physics Letters 2012. 100: p.-.
References
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
Brochu, P., Pei, Q., Advances in dielectric

elastomers for actuators and artificial muscles.
Macromolecular Rapid Communications, 2009.
31(1):p. 10-36.
Ashley, S., Artificial muscle. Scientific American,
2003. p.52-59.
Pelrine, R.E., R.D. Kornbluh, and J.P. Joseph,
Electrostriction of polymer dielectrics with
compliant electrodes as a means of actuation.
Sensors and Actuators A: Physical, 1998. 64(1):
p. 77-85.
Koh, S.J.A., et al., Mechanisms of large actuation
strain in dielectric elastomers. Journal of Polymer
Science Part B: Polymer Physics, 2011. 49(7): p.
504-515.
Goh, Y.F., et al., Ultra-actuation of acrylic-based
artificial muscles. Unpublished.
Lu, T., et al., Highly deformable actuators made
of dielectric elastomers clamped by rigid rings.
Journal of Applied Physics, 2014. 115(18): p. -.
Gent, A.N., A New Constitutive Relation for
Rubber. Rubber Chemistry and Technology,
1996.
69(1):
p.59-61.Bhattacharyya,
D.,
Responsive Membranes and Materials. John
Wiley & Sons, 2012.
Suo, Z, Thoery of dielectric elastomers. Acta
Mechanica Solida Sinica, 2010. 23(6): p.549-578
Resonant behavior of a membrane of a dielectric
elastomer. International Journal of Solids and
Structures, 2010. 47:p. 32543262
Koh, S.J.A., et al., Theory of electromechanical
transduction in laterally-constrained dielectric
elastomers. Unpublished.
McKay, T.G.,The Dielectric Constant of 3M
VHB: a Parameter in Dispute. Proceedings of
SPIE. 7287: p.-.
Huang, J., et al., The thickness and stretch
dependence of the electrical breakdown strength
of an acrylic dielectric elastomer. 101: p.-.
Lu, T., Dielectric elastomer actuators under
equal-biaxial forces, uniaxial forces, and uniaxial
constraint of stiff fibers. Soft Matter, 2012. 8:
p.6167-6173.
- 241 -
FO-2-1-2
Functional Hip and Knee Joint Assistive Torque Controller for Gait Training
Jinfu Li, Bingquan Shen and Chee-Meng Chew
Department of Mechanical Engineering
National University of Singapore
li.jinfu@nus.edu.sg
Abstract
This paper proposes a functional hip and knee joint
assistive torque controller based on virtual gait period
sequence for gait training purpose. The advantages of
this controller are twofold. First, it is more compliant
compared with trajectory-based position control.
Second, the assistance level can be easily adjusted in
the whole gait cycle or in each sub virtual gait period.
The controller has been implemented in our single-leg
version lower extremity assistive device and
preliminarily evaluated with one healthy subject
walking on a treadmill. Experimental results show that
the assistive torques can help generate the desired gait
pattern, and with various assistance levels, the gait
trajectories are also different.
Keywords: functional assistive joint torque, lower
extremity assistive device, gait training
1. Introduction
In recent years, robotic gait training devices have
been used in rehabilitation training of neurological
patients post stroke or spinal cord injury. However, it
is still an open challenging problem how these devices
should be controlled to achieve better functional gait
improvements.
Current commercial robotic gait training devices
such as Lokomat [1], are either purely position
controlled or impedance-based position controlled
using a predetermined trajectory. These controllers
focus more on the joint trajectory tracking instead of
joint torque assistance. However, if we observe the gait
training by physical therapists, it seems that they focus
more on providing assistance to joints and thus make
the legs achieve gait functionality instead of simply
performing point-by-point gait trajectory tracking. In
order to mimic therapists rehabilitation training, a
functional joint assistive torque controller will be
developed and then evaluated with one healthy subject
on our lower extremity assistive device in this study.
Figure 1. Normal human gait cycle for single limb.

Arrows indicate directions of the joint torques
needed in the coming gait period [2].
2. Methods and Implementations

A basic human gait cycle for single limb during
level walking consists of two major phases and six gait
periods [2], as shown in Figure 1. In each gait period,
based on the functionality of that gait period, directions
of the assistive torques can be determined [2].
Therefore, we postulate that if we firstly generate a
virtual gait period sequence and then in each gait
period, we design a unidirectional passive spring and
damper model to generate the assistive joint torques,
the normal gait pattern can be achieved. This would be
much like the therapists gait training.
In this study, an impedance based model with a
fixed equilibrium position is used to generate the
assistive torques
(1)
i ki ( 0i ) bi
in the ith gait period, are

related to the joint angular position and velocity
through the stiffness term k i , damping term bi , and
where the joint torques
equilibrium angle 0i , respectively. If the direction of

assistance is in extension, the assistive joint torque is
zero when the computed i is less than zero. On the
other hand, for joint in flexion, the assistive torque is
zero when the computed i is greater than zero. The
assistive torque for joints in free mode is set zero. In
this way, the generated torques would not hinder the
movements in that gait period. The torques provided to
- 242 -
ICEIC 2015
the subject equals the generated torques from (1)

multiplying an assistance level in term of percentage.
The above controller is then implemented in the
single-leg version of our lower extremity assistive
device [3] with friction compensation algorithm [4], as
shown in Figure 2. The virtual gait cycle was set to 2
seconds. Hip joint stiffness term was set to 1.0 Nm/rad
and damping term 0.1 Nm/rad s-1. Knee joint stiffness
term was set to 0.5 Nm/rad and damping term 0.05
Nm/rad s-1. Proper equilibrium angles were selected for
each gait period.
Figure 3 A sample of 16 seconds data from the healthy

subject (Gait periods are labelled as follows, ESt = 0, MSt = 1,
LSt = 2, ESw = 3, MSw = 4 and LSw = 5).
Figure 2. Implementation.
3. Experiments and Data Analysis

One young and healthy male subject participated in
this experiment, and walked on a treadmill with
various assistance levels from 20%, 40%, 50%, 60% to
80%. The subject was required not to exert any joint
torque for the limb which worn the device in order to
guarantee that the achieved gait pattern could only be
attributed to the assistance from the device. Under each
assistance level, the walking duration last for five
minutes. The joint kinematics and assistive torques
were recorded, and then normalized in terms of
percentage of the gait cycles. Mean and standard
deviation values were calculated for analysis.
Figure 3 shows a sample 16 seconds representative
data when assistance level is set as 50%. It is observed
that based on the virtual gait period, continuous and
smooth hip and knee joint torques have been generated
and proper gait pattern similar to normal walking gait
has been achieved.
Figure 4 shows the mean and 1 standard deviations
of the joint trajectories and assistive joint torques
among all the gait cycles. It is observed that the
assistive joint torques can be easily adjusted by
assistance level. Under lower assistance, the gait
trajectories are more compliant. With assistive torques
increasing, the angle of hip extension, hip flexion and
knee flexion also increase and the subject could feel
more assistance from the device.
Figure 4 Average joint trajectories and assistive

joint torques (Assistance level labeled as: yellow20%, red-40%, green-50%, blue-60%, black-80%).
4. Conclusion
In conclusion, the proposed functional joint assistive
torque controller can help to achieve normal gait
pattern for gait training, and the assistance level can be
easily adjusted.
Acknowledgement
This work was financially supported by the Singapore
Ministry of Education (MOE) Academic Research Fund
(AcRF) (Grant No.: R-265-000-419-112).
References
[1] G. Colombo, M. Joerg, R. Schreier, and V. Dietz, Treadmill
training of paraplegic patients using a robotic orthosis, Journal of
Rehabilitation Research & Development, vol. 37, no. 6, 2000.
[2]. M. W. Whittle, Chapter 2-normal gait, in Gait Analysis, 4th ed.
Edinburgh: Butterworth-Heinemann, pp. 47100, 2007.
[3] B. Shen, J. Li, F. Bai, and C. M. Chew, Development and
control of a lower extremity assistive device (LEAD) for gait
rehabilitation, in Rehabilitation Robotics (ICORR), 2013 IEEE
International Conference on, pp. 16, June 2013.
[4] J. Li, B. Shen, F. Bai, C. M. Chew, and C. L. Teo, First
implementation results on FAT based adaptive control for a lower
extremity rehabilitation device, in Mechatronics and Automation
(ICMA), 2013 IEEE International Conference on, pp. 945-950,
August 2013.
- 243 -
FO-2-1-3
Design and Evaluation a Novel Portable KneeAnkle-Foot Robot

Gong Chen, Haoyong Yu, Member, IEEE
Gong Chen and Haoyong Yu are with Department of Biomedical Engineering, National
University of Singapore, 9 Engineering Drive 1, Singapore 117575.
E-mail: bieyhy@nus.edu.sg
Abstract
We developed an intelligent knee-ankle-foot robot,
which is compact, modular, and portable, to enable
stroke patients to perform gait rehabilitation at
outpatient and home settings. The robot was designed
with a novel compact series elastic actuator for safe
human-robot interaction. The modular design for the
knee and ankle joints caters for patients with different
degrees and types of impairments. A prototype of the
robot has been built and tested on a healthy subject in
the lab to evaluate the performance of the robotic
system.
Keywords: Stroke, rehabilitation robotics, knee-anklefoot robot, series elastic actuator.
The robotic orthosis has been tested on healthy subjects.

The effectiveness of the robot assistance is evaluated
based on the muscle activity collected via surface
electromyography (sEMG) electrodes.
Fig. 1. The prototype (b) and schematic diagram (c) of the portable
powered robot with modular ankle and knee (a), sensors are attached
to detect and monitor the state of human body for physical therapy.
2. Exoskeleton design
1. Introduction
Due to the rapid growth of aging population, stroke
is becoming one of the leading causes of adult
disability, notably gait impairment. Robots have been
developed to overcome the limitations of manual
therapy for rehabilitation, but most of them are bulky,
expensive, and available only in big hospitals [1].
Therefore, there is a great need for a compact homebased wearable robotic system for gait rehabilitation.
Numerous robots have been developed specifically for
the ankle joint, such as the MIT ankle robot [1] or for
the knee joint, such as Tibion [3]. However, research
aimed at providing active assistive torque to both the
knee and ankle was very limited due to the added
mechanical design complexity and tethered operation
system [4].
We present an intelligent compact and modular
powered knee-ankle-foot robot for chronic stroke
patients to conduct gait rehabilitation at outpatient
rehabilitation centers or at private homes. We
developed a novel compliant actuator and linkage
mechanism to achieve light-weight and modular design.
A. Knee-Ankle-Foot Robot
Figure 1 shows the schematic diagram and prototype
of the robotic system. The modular system consists of
an ankle robot and a knee robot (Fig. 1(a)). Each
module is driven with the same compact compliant
force controllable linear actuator (Fig. 1(a)). Based on
human biomechanics, the range of motion of the lower
limb joints are within 90 during normal walking [5].
Therefore, the design is optimized by utilizing a simple
rocker-slider mechanism to achieve a compact design
[6]. The structure of the system is fabricated with
lightweight carbon fiber composite material, which
leads to a total weight of about 3.5Kg. The robot has a
suite of sensors for gait pattern detection and assistive
control (Fig. 1(c)). Potentiometers are used to
determine joint kinematics. Foot pressure sensor
combining with inertia measurement units (IMUs) are
applied to detect gait initiation and phases. sEMG
electrodes are placed at the muscle group to monitor
the muscle activity pattern of the subject. A prototype
is shown in Fig. 1(b). The system will deliver optimal
assistance force based on the sensory information.
- 244 -
ICEIC 2015
B. Compliant series elastic actuator
Compliant actuator is required to provide safe and
controllable force for interaction with human limbs.
However, the series elastic actuators (SEA) widely
used for rehabilitation robot design has to compromise
between force transmission and compliance; large
output and high compliance cannot be achieved
simultaneously. We developed a novel SEA to
overcome this limitation, extending a large range of
output force while maintaining a high intrinsic
compliance [7]. As shown in Fig. 1(a), a very soft
linear spring is used at the output to handle the lowforce range and to ensure truly high intrinsic
compliance and high force fidelity. We introduce a stiff
torsion spring directly between the motor and the ball
screw in the high speed range. Due to its high reflected
stiffness, the torsion spring can handle high-force
operation when the soft spring is fully compressed,
ensuring continuous output force control and large
bandwidth at high force range. As both springs are
small, the actuator design is very compact. The actuator
for this robot has a total mass of 0.85 Kg, but can
transmit up to 1000N force.
3. Experimental Testing
limbs. We are currently developing more advanced

gait control strategies based on IMU sensors, aiming to
provide customized assistance based on the specific
gait deficiency of each individual.
Fig. 2. EMG test of major muscles in the right lower limb of the
subject with or without the force support of the robot.
Robot assistive experiment has been conducted on a

healthy subject (25-year-old male, 65kg, 165cm) to
evaluate the performance of the robot. Subject
performed overground walking for ten trials. EMG
signals of muscles at the knee (Rectus Femoris, RF;
Biceps Femoris, BF) and at the ankle (Tibialis
Anterior, TA; Gastrocnemius Lateralis: GL) were
collected by a self-customized amplifier to monitor
muscle activity of the lower limbs. Robot worked under
zero-force mode (0Nm) and assistive mode (20%
nominal torque during gait cycle [5]) to support knee
and ankle joints. The experimental results in Fig. 2
indicate that with the aid of the robot, human effort is
decreased significantly to complete the walking cycles.
The robot system is stable and capable of detecting
human state and providing assistive force.
4. Conclusion
With a novel compliant actuator, we developed a
modular and portable knee-ankle-foot robot for gait
rehabilitation. To our best knowledge, this is the first
lower limb exoskeleton with both powered knee and
ankle joints driven by SEA. Preliminary tests on
healthy subjects show the capability of the robot in
providing stable assistance force for human lower
References
[1] Riener, R., Lunenburger, L., Jezernik, S., Anderschitz,
M., Colombo, G., and Dietz, V., Patient-cooperative
strategies for robot-aided treadmill training: First
experimental results, IEEE Trans. Neural Syst. Rehabil.
Eng., vol. 13, no. 3, pp. 380395, Sep. 2005.
[2] Blaya, J. A., and Herr, H., Adaptive Control of a
Variable-impedance Ankle-Foot Orthosis to Assist DropFoot Gait, IEEE Trans. Neural Syst. Rehabil. Eng., vol. 12,
no. 1, pp. 21-31, 2004.
[3] Horst, R.W.,A bio-robotic leg orthosis for rehabilitation
and mobility enhancement, in Proc. IEEE Annu. Int. Conf.
Eng. Med. Biol. Soc.(EMBC), Sept. 3-6, pp.5030-5033,
2009. Minneapolis ,MN.
[4] Sawicki, G. S., Ferris, D. P., A pneumatically powered
knee-ankle-foot orthosis (KAFO) with myoelectric activation
and inhibition, J. NeuroEng. Rehabil, vol. 6:23, 2009.
[5] http://www.clinicalgaitanalysis.com/data/index.html
[6] Yu, H., STA Cruz, M., Chen, G., Huang,H., Zhu,C.,
Chew,E., Ng, Y. S., and Thakor, N. V., Mechanical Design
of a Portable Knee-Ankle-Foot Robot, in Proc. IEEE Int.
2013 Conf. Robotics and Automation (ICRA), p. 2175-80,
May 6-10, 2013, Karlsruhe, Germany.
[7] Yu, H., Huang, S., Chen, G., Thankor, N., Toh, S. L.,
Cruz, M., Ghorbel, Y., and Zhu, C., A Novel Compact
Compliant Actuator Design for Rehabilitation Robots, in
Proc. IEEE Int. Conf. Rehabil. Robot.(ICORR), June 24-26,
2013, Seattle, USA.
- 245 -
FO-2-1-4
Accurate Odometry for Autonomous Vehicles Using in-car Sensors

Xiaotong Shen, Scott Pendleton and Marcelo H. Ang Jr.
National University of Singapore
{shen_xiaotong, scott.pendleton01, mpeangh}@nus.edu.sg
Abstract
In this paper, we propose a novel strategy to obtain
accurate odometry for autonomous vehicles using incar sensors. Adding encoders on cars to obtain
odometry needs much mechanical work and they may
be vulnerable if protruding from the wheel. The in-car
sensors can be utilized to provide odometry, but the
direct output of the sensors may not satisfy the high
accuracy or high frequency requirement for
autonomous vehicles. We propose a novel method of
fusing two sensor readings from Controller Area
Network (CAN) bus messages to provide an odometry
of high accuracy and high frequency for autonomous
vehicles. We use Mitsubishi i-MiEV car as an example,
but the method can be extended to other vehicles.
Keywords: Odometry, in-car sensors, data fusion.
1. Introduction
Autonomous vehicles are receiving great attentions
because their great potentials for enhancing safety and
improving the throughput of transportation systems [13]. In order to realize autonomous driving, the vehicles
must be capable of sensing the surrounding
environment, localizing themselves and navigating to
the destination. Odometry can give an estimation of the
vehicle s ego motion and is one of the key components
necessary for localization [4-5].
In order to obtain odometry information, encoders
are commonly installed on vehicles to estimate their
traveled distance [1-3]. Retrofitting vehicles needs
much mechanical work and protruding encoders can
make the whole system vulnerable since they can be
easily damaged. One alternative method is to use the
in-car sensors, which is especially appealing for newer
car models since there are increasingly more sensors
installed on each iteration of new cars and the sensor
readings are accessible through the Controller Area
Network (CAN) bus. However, the direct output of the
sensor readings may not meet the requirements of high
- 246 -
accuracy and frequency as is necessary for autonomous

vehicles.
In this paper, we propose a novel method of fusing
the data from the in-car sensors to provide a high
accuracy and high frequency odometry for autonomous
vehicles. We use Mitsubishi i-MiEV car as an example,
but the method can be extended to other vehicle models.
2. Data fusion
The sensor readings are usually sent over the CAN
bus at different frequencies in different vehicles. Even
though there are already CAN messages for the car
odometer, the resolution is typically only one kilometer,
which is just used as an indicator for humans. There are
also readings for distance traveled in our i-MiEV car,
but they are very inaccurate for autonomous driving.
The two most useful messages are the readings for
the wheel rotational velocity and motor rotational
velocity. The wheel speedometer can give the absolute
value of rotational speed of the wheels at 50 Hz, whose
resolution is 0.0144 m/s. The direction of this velocity
is inferred from the gear shift value. The reading for
the motor velocity is available at 10 Hz and its
resolution is 0.0048 m/s.
For autonomous vehicles, the odometry should be
provided at a high frequency. Even though the wheel
speedometer can provide speed information at 50 Hz,
as the reading is much noisier than the motor velocity,
which is published much less frequently. The low
frequency of the speed reading results in an inability to
capture the rapid speed change, and thus the integral of
the speed over time is not accurate for distance traveled.
It is desirable to fuse these two sensor readings and
provide a high accuracy and high frequency odometry.
In order to fuse the two sensor readings, we need to
study the sensor characteristics. The motor velocity can
provide accurate velocity estimation of the vehicle and
we can use that as the ground truth. The sensor
readings from the speedometer are then downsampled
to 10 Hz and compared with the car speed estimation
from the motor sensor readings. The wheel
speedometer sensor characteristics are shown in Fig. 1.
ICEIC 2015
speed readings are read as often as they become
available and each used to calculate distance travelled
by integration. We use a timer to perform the integral
of the updated car speed to estimate the distance
traveled at 100 Hz.
3. Results
Fig. 1. Sensor characteristics of the wheel speedometer.

As we can see from Fig. 1, the sensor readings of
wheel speedometer are inaccurate and noisy when the
car speed is low. As the car speed increases, the wheel
speedometer readings become more precise and less
noisy. The standard deviation of the relative error is
shown in Fig. 2, and it is less than 5% when the car
speed is over 1.5 m/s and thus can be used to estimate
the car speed accurately.
The calibration was performed by driving the car

along a straight line and the actual traveled distance
was measured to correct the coefficient correlating
rotational speeds with distance travelled. After the
calibration, we measure the accuracy by comparing the
actual traveled distance and the output of our
estimation. The accuracy of our estimation is 0.047%,
which is high enough for autonomous vehicles. Our
estimator is running at 100 Hz, which meets the
requirement for high frequency.
The laser scans from the LIDAR sensor were
accumulated to show that the odometry is so accurate
that each road marker s shape is not deformed very
much, as shown in Fig. 3.
Fig. 3. Laser scans accumulated in the odometry frame.

Color gradient corresponds to intensity of the reading.
4. Conclusion
Fig. 2. The standard deviation of the relative error of

the wheel speedometer.
The high frequency of the wheel speedometer
readings can capture the rapid speed change and
provide an accurate odometry when the car speed is
high. When the car speed is the less than 1.5 m/s, we
can rely on the motor velocity readings since the speed
could not change drastically at low speed. When the car
speed is high, we can also use the motor velocity
readings to update the car velocity since it is more
precise. In this case both the motor velocity and wheel
- 247 -
In this paper, we propose a method of providing an

odometry of high accuracy and high frequency by
fusing the sensor readings from the CAN bus. By
utilizing the in-car sensor readings, we don t need to
install any additional sensors for the odometry. By
analyzing the characteristics of the in-car sensors, we
conclude that we should rely on different sensors at
different speed. The result of the experiment shows that
the odometry is sufficiently accurate for autonomous
vehicle usage.
Acknowledgment
This research was supported by the National
Research Foundation (NRF) Singapore through the
Campus for Research Excellence And Technological
Enterprise (CREATE) and the Singapore MIT Alliance
ICEIC 2015
IRG) research
programme, in addition to the partnership with the
Defence Science Organisation (DSO). We are grateful
for their support.
References
[1] M. Montemerlo, J. Becker, S. Bhat, H. Dahlkamp, D.
Dolgov et al,
Junior: The stanford entry in the urban
challenge Journal of field Robotics, 25, no. 9, pp. 569-597,
2008.
[2] J. Leonard, J. How, S. Teller, M. Berger, S. Campbell et
al, A Perception-Driven Autonomous Urban Vehicle
Journal of field Robotics, 25, no. 10, pp. 727-774, 2008.
[3] Z. J. Chong, B. Qin, T. Bandyopadhyay, T.
Wongpiromsarn, E. S. Rankin, M. H. Ang Jr., E. Frazzoli, D.
Rus, D. Hsu, and K. H. Low, Autonomous personal vehicle
for the first- and last-mile transportation services
Cybernetics and Intelligent Systems (CIS), 2011 IEEE 5th
International Conference on, pp. 253-260. Sept. 2011.
[4] B. Qin, Z. J. Chong, T. Bandyopadhyay, M. H. Ang Jr.,
E. Frazzoli, and D. Rus Curb-Intersection Feature Based
Monte Carlo Localization on Urban Roads Robotics and
Automation (ICRA), 2012 IEEE International Conference
on, pp. 2640-2646. May 2012.
[5] Z. J. Chong, B. Qin, T. Bandyopadhyay, M. H. Ang Jr., E.
Frazzoli, and D. Rus, Synthetic 2D LIDAR for Precise
Vehicle Localization in 3D Urban Environment , Robotics
and Automation (ICRA), 2013 IEEE International
Conference on, pp. 1554-1559. May 2013.
- 248 -
FO-2-1-5
Development of an Autonomous Vehicle : Baby In Car

Dong-Kyoung Kye, Myungok Shin, Gi-Poong Gwon, Seung-Tak Choi, In-Sub Yoo, Bo-Kyung Seo,
Soomok Lee, Hanseul Lee, Yeonjun Lee, Gyumin Oh, and Seong-Woo Kim
Department of Electrical and Computer Engineering, Seoul National University,
Gwanak-ro 1, Gwanak-gu, Seoul 151-742, Korea
E-mail : {dkkye, moshin, gpgwon, stchoi, isyoo, bkseo, smlee, hslee, yjlee, gmoh}@cnslab.snu.ac.kr,
sinabrlo@snu.ac.kr
Abstract
This paper describes the overall system of an
autonomous vehicle, Baby In Car, which accomplished the
best lap time in the 2013 Korea Autonomous Vehicle
Contest (AVC) organized by ministry of trade, industry and
energy. Baby In Car used minimal number of low-cost
sensors to accomplish the several missions such as
recognizing traffic signs and traffic lights, and avoiding
dynamic or static obstacles. Despite of using simplified
low-cost sensor systems, we had great results in 2013
Korea AVC through our differentiated algorithms. In this
paper, we present the perception, localization, and path
planning algorithms of Baby In Car which are validated
thorough the 2013 AVC.
Keywords: Autonomous vehicle, obstacle detection,
vehicle localization, path planning
1. Introduction
Autonomous driving technology is an emerging area of
researches for intelligent vehicle which is different from
existing advanced driver assistance systems (ADAS) in
terms of human intervention in driving. The researches on
autonomous vehicle have been accelerated by the three
contests hosted by U.S. Defense Advanced Research
Projects Agency (DARPA) [1]. After these contests, major
motor corporations announced plans to begin
commercializing autonomous vehicles in a few years.
Recently, Google has completed accident-free autonomous
driving over 300,000 miles.
As research area in autonomous vehicle had received
more attention, Korea government took place the 2013
Autonomous Vehicle Contest (AVC) at the Korea
international circuit. Our autonomous vehicle named Baby
In Car participated in the 2013 AVC. The course for the
2013 AVC consisted of 3 km paved road and there were 9
driving missions in this contest. Among the 10 participants,
we accomplished the best lap time with 15 min and 5 sec at
the main race.
Figure 1. Sensor configuration

Despite of the best lap time in the main race, we got the
2nd prize on the whole competition due to the time record
of the preliminary race.
In this paper, we present the overall system of Baby In
Car. The remainder of this paper is organized as follows.
The hardware and software architecture of Baby In Car are
briefly introduced in Section 2. A perception system which
provides information about surrounding environment is
given in Section 3. In Section 4, the planning system which
produces the autonomous driving trajectory will be
introduced. This paper is ultimately concluded in section 5.
2. Hardware and Software architecture

Baby In Car is made by remodeling a commercial SUV
vehicle. We used a monocular camera, stereo camera, two
laser scanners, and DGPS. The cameras and laser scanners
were used for environmental perception and the DGPS was
used for ego-vehicle localization. The configuration of
these sensors is illustrated in Figure 1.
The software architecture of Baby In Car is composed of
4 sub-modules as shown in Figure 2. Sensor interface
module receives data from laser scanner, vision sensors, and
DGPS. Perception module transforms the data such as
objects in driving space, road boundary, lane marking,
traffic light and traffic sign acquired from the sensor
interface module into the information used for planning
module. Vehicle localization is also performed in
perception module. Planning module generates a path and
- 249 -
ICEIC 2015
and at least 50 Hz of update rate. To tackle this problem,
we utilize some in-vehicle sensor measurements such as
acceleration, steering angle and wheel speed to correct the
DGPS data. By fusing the DGPS data with the in-vehicle
sensor measurements through the extended Kalman filter,
the localization system estimates the pose (position,
heading) of the vehicle with 100Hz data rate and less than
10cm standard deviation error.
4. Planning systems
Figure 2. Software architecture

plans a motion of the vehicle based on the information from
the perception module. In control module, steering and
speed of the vehicle are controlled to track the path made
from decision and planning module. Detailed description of
the perception and planning module is presented in later
sections.
3. Perception systems
1) Object Detection and Recognition
To safely avoid obstacles, a precision map should be
needed, which contain accurate position of the obstacles
and sufficient range of view. To satisfy this criteria, we use
medium range laser scanners for object detection. Once we
get the map data, detected objects in this map should be
recognized to make strategy at the planning systems. Vision
sensors are used for recognizing detected objects.
2) Traffic sign recognition

Traffic sign recognition algorithm recognizes traffic
signs to prepare the following mission in advance. There are
three steps which consist of laser sensor triggering,
detection, and recognition, to recognize the traffic sign.
First of all, when the traffic sign structure is found on
laser scanner sensors, the vision algorithm is triggered to
check whether the sign exists. After that, the detection step
generates Region of interest (ROI) through the combination
of following two features. One feature is the mixture of
color feature using various color channels. Another feature
is extracted shapes such as polygon and circle. If region of
traffic sign is detected, the recognition step proceeds in
order to derive the meaning of the sign. We extract the
binary feature from detected traffic sign, and compare to the
ground truth of individual traffic sign. In terms of pattern
matching, the detected traffic sign is recognized as one of
pre-defined traffic sign which has maximum matching value.
3) Localization
We use a low-cost DGPS whose maximum update rate
is limited to 10 Hz and the standard deviation of positioning
error is 0.7 m under open-sky environment. The
performance of the DGPS is not sufficient for ego-vehicle
localization, since the planning system using the
localization results requires high accuracy less than 10cm
Path planning is a main goal of decision and planning

module. Waypoints to be tracked by the vehicle are predefined in the global path planning step. Path planning and
obstacle avoidance methodology is developed for nonholonomic platforms. Therefore, the developed method uses
smooth and continuous functions such as polynomials [2].
To avoid obstacle, planning module modify the preplanned waypoints overlapped with the obstacle, another
waypoints which are not overlapped with the obstacle and
can make small change in current vehicle state. But it is
very difficult and computationally expensive to choice
alternative way points when there exist dense obstacles. In
this case, we used variant of dubin curve [3] to make less
computational loads.
.
5. Conclusion
We developed an autonomous vehicle, Baby In Car
based on perception and planning algorithm presented in
this paper. Because we could only use the minimal number
of low-cost sensors, software performance was more
importance than that of any other autonomous vehicle. The
software algorithms presented in this paper were validated
by the autonomous vehicle Baby In Car which won the 2nd
prize in the 2013 AVC.
The algorithms presented in this paper are dedicated for
the AVC missions. We intend to improve and develop these
algorithms for more general road environments.
Acknowledgements

Foundation of Korea (NRF) grant funded by the Ministry of
Science, ICT & Future Planning (MSIP) (No. 20090083495).
References
[1] C. Urmson, J. Anhalt, D. Bagnell, C. Baker, D. Ferguson, et

al., Autonomous driving in urban environments : Boss and the
Urban Challenge, Journal of Field Robotics, vol. 25, no. 8, pp.
425-466, Sep 2008.
[2] E. Papadopoulos, I. Poulakakis, and I. Papadimitriou, On
Path Planning and Obstacle Avoidance for Nonholonomic Mobile
Manipulators: A Polynomial Approach, Int. Journal of Robotics
Research, vol. 21, no. 4, pp. 367-383, 2002
[3] L. E. Dubins, On curves of minimal length with a constraint
on average curvature and with prescribed initial and terminal
positions and tangents, Amer. J. Math, vol. 79, pp. 497-516,
1957.
- 250 -
ICEIC 2015

Oral Session
FO-2-2
Signal Processing II
FO-2-2-1
Phase Error Compensation of Chirp Signal Generator Implemented on Direct

Digital Synthesizer
Heein Yang and Jae-Hyun Kim
Ajou University
E-mail {kfcddong, jkim}@ajou.ac.kr
Abstract
As the synthetic aperture radar (SAR) system
requires high-resolution, chirp signal generator that
can provide wide-bandwidth signal is also needed .
Direct digital synthesizer (DDS) accumulates phase
signal of chirp and synthesizes it with amplitude. It can
generate the signal with wide-bandwidth, however due
to the truncation spurs in DDS system the spectrum
purity is not guaranteed. In this paper, DDS chirp
signal generator with phase compensation block is
proposed and the simulation result shows that
proposed method can eliminate the phase offset ideally.
:
constant
source
Frequency
accumulator
++
Register
Phase
accumulator
++
++
: frequency offset
Register
++
LUT
Chirp
pulse
output
: phase offset
Figure 1. Structure of DDS signal generator.
Keywords: Synthetic aperture radar, chirp signal

generator, direct digital synthesizer, frequency
accumulator, phase error
1. Introduction
Synthetic aperture radar (SAR) is a kind of active
sensor that provides high-resolution images of target
by using microwave signal called chirp. Chirp signal is
a linear frequency modulated signal its frequency
increases or decreases linearly according to time. The
reason why SAR uses chirp signal is that it has large
bandwidth and the radar system with wide bandwidth
can achieve the high-resolution due to equation (1).
c c
(1
r= =
)
2 2B
where c, , and B are speed of light, pulse width of
signal and signal bandwidth respectively. Accordingly,
SAR system requires the chirp signal generator that
can generate signal with wide-bandwidth.
Direct digital synthesizer (DDS) is a solution that can
generate the signal with wide-bandwidth but it has
phase error on signal plot than spectrum purity gets
lowered. This paper proposes the error compensation
method for DDS chirp signal generator.
Figure 2. Signal plot of chirp signals.
2. Structure of DDS signal generator

The signal characteristic of chirp signal can be
derived as
s ( t ) = exp ( j Kt 2 + t )
(2)
where K is sweep rate of chirp signal that defines
swept frequency range.
The structure of DDS signal generator is shown in
Figure 1. DDS consists of constant source as input,
frequency and phase accumulators, and look-up table
(LUT) [1]. Chirp signal generation procedure as
follows.

(t ) = t 2 + t +
(3)
2
- 252 -
ICEIC 2015
Table 1: Simulation parameters
Contents
Center frequency
Bandwidth
Pulse width
Bits
Features
1.27 GHz
288 MHz
3.6 s
16 bits
where , , and are constant source, frequency

offset, and phase offset respectively. As the chirp
signal has phase of 2nd order polynomial, chirp signal
generator first calculates the phase, then matches the
phase address to amplitude in LUT. Accumulator
consists of feedback loop and register and it
accumulates the input signal with the clock source.
Therefore the output of frequency accumulator will be
ramp and in the same way phase accumulator will
draw out 2nd order curve output. Figure 2. Shows the
time domain signals between ideal and DDS signal
generators. The signal phase of DDS is shifted from
the center point and it degrades spectrum purity.
3. Error compensation procedure

To eliminate the phase error in DDS chirp signal,
we define the phase error term as equation (4).
error = ideal DDS
(4)
Therefore we extract the actual phase value of ideal
and DDS signals and model the phase error.
Additionally, compensated phase error is defined as
compensated = DDS + error = ideal
(5)
Equation (5) indicates the compensated phase is
identical to ideal signal phase. Phase error error has
been shown in 1st order polynomial and it means that
in equation (3) should be adjusted. Because
determines the starting frequency value (center
frequency) and the signal in Figure 2 is simulated in
baseband. Consequently frequency offset error due to
truncation exists in conventional DDS chirp signal
generator and if we add the coefficient of error to
frequency offset the phase error will be eliminated
ideally.
Table 1 shows the simulation environment in this
paper. Figure 3 is presented to verify that proposed
DDS compensates the phase error of chirp signal in
time domain. Proposed DDS signal perfectly traces
ideal signal and phase error is compensated. It has
been introduces that DDS has bad spectrum purity due
to
Figure 3. Time domain chirp signals of ideal, DDS,

and proposed DDS.
phase error from truncation. However thanks to

frequency offset adjusting the output of proposed DDS
is identical to ideal chirp waveform and it is assumed
that it can enhance the spectrum purity also.
5. Conclusion
In this paper, phase error in conventional DDS has
been investigated and phase error has been modeled to
polynomial. By adjusting the frequency offset value,
proposed DDS could enhance the signal output in time.
Consequently proposed DDS has the same signal
characteristic with ideal chirp signal.
Acknowledgement
This research was supported by NSL (National
Space Lab) program through the National Research
Foundation of Korea funded by the Ministry of
Education, Science and Technology (2012-0009092)
and KARI (Korean Aerospace Research Institute)
though the Ministry of Science, ICT and Future
Planning.
References
[1] A. Samarah, A Novel Approach for Generating Digital
Signals Using FPGA Technology for Synthetic Aperture
Radar Applications, Ph. D Thesis, pp. 13-55.
[2] H. Yang, S. B. Ryu, H. C. Lee, S. G. Lee, S.S. Yong, and
J. H. Kim, Implementation of DDS Chirp Signal Generator
of FPGA, Proc. in ICTC 2014, October, 2014.
[3] J. Tierney, A Digital Frequency Synthesizer, Audio and
Electronics, IEEE Trans. on, vol. 19, no. 1, pp. 48-57. 1971.
- 253 -
FO-2-2-2
A compressed domain fast motion and no motion detection for multiple

channel IP video surveillance system
Young-Woong Kim*, Yong-Jo Ahn*, Jae-Jin Lee**, Kyung-Jin Byun**, Dong-Gyu Sim*
Dept. of Computer Engineering Kwangwoon University*,
Multimedia Processor Research Team, ETRI**
mipjji@kw.ac.kr, yongjoahn@kw.ac.kr, ceicarus@etri.re.kr, kjbyun@etri.re.kr, dgsim@kw.ac.kr
Abstract
This paper introduce the fast motion detection method
in H.264/Advanced Video Coding(AVC) for
surveillance systems. While the surveillance equipment
supports high resolution video, the system provides
high quality video to us and decisive role in traffic
accident and settlement of a dispute. However, more
resources are needed to save the high resolution video
and the computational complexity increment. To solve
those problems, we propose a method to reduce
complexity and accelerate motion detection.
Keywords: H.264 compressed domain, fast motion
detection, multiple channel.
1. Introduction
In the surveillance system, currently the videos of full
HD are being supplied. In the future, we will be needed
to more resources to save the video and more
computational complexity to detect motion. Nowadays,
there are many studies about the fast motion detection
Figure 2: Similarity of temporal motion

vector(MV) of current and reference block and
spatial MV association
in compressed domain to get the low complexity

motion detection algorithm without additional pixel
decoding process. Figure 1 shows the complexity of
H.264/AVC. Compressed domain approach can
perform with only 15 percent of the total complexity of
decoder. In this paper, the proposed fast motion
detection algorithm is provided by Szczerba[1]. Motion
vectors may be different from the actual movement.
Video codec considers the rate and distortion to select
the motion vector. So, base algorithm estimates the real
motion to use the association of spatial motion vector
and similarity of temporal motion vector. It is based on
the confidence measurement[2]. Figure 2 shows an
example for the fast motion detection. And we also
consider the no motion case to reduce the
computational complexity. This paper proposes the
motion and no motion skip algorithm at Group Of
Picture (GOP) level.
2. Proposed method
Figure 1: H.264/AVC decoder complexity
In the real time surveillance systems, it is important to

optimize the computational complexity and to speed up
the motion detection[3]. Figure 3 shows overall process
diagram. The input bitstream based on H.264/AVC. At
first bitstream parser decodes the motion vector and
- 254 -
ICEIC 2015
Figure 3: GOP level motion detection storage system

picture information. To use this information, the
picture level part finds out the motion picture in the
GOP. The algorithm conducts each picture until meet
the condition of GOP level. The proposed algorithm
conducts at GOP level. If we detect motion at least one
picture in the current GOP, then we assume that the
current GOP has a motion and skip the motion
detection algorithm of remain pictures. GOP level
motion detection skip algorithm[4]. Because of the
general movement is sustained for at least one second.
The algorithm stores the detected GOP, the next and
previous GOP. Furthermore, In order to maximize the
performance speed, we have to consider no motion
case. Depending on the location and time, the video
also includes the no motion period. In that case,
performing motion detection algorithm in all pictures is

very inefficient. Therefore, the proposed algorithm
checks the no motion pictures condition. Figure 4
shows the skip algorithm and storage system in no
motion case. If there are three no motion pictures in the
GOP then skip the motion detection algorithm in
current GOP. However, the remaining pictures are
possible to have motion. And then, no motion GOP will
be stored. If the motion will be detected at the next
GOP, then store previous GOP and after GOP of the
current motion GOP. Eventually, the proposed
algorithm maintains accuracy and increases the speed.
The goal of the proposed algorithm is to handle 100
channels to be processed in real time.
Figure 4: GOP level motion detection storage system
- 255 -
ICEIC 2015
3. Result
References
A. Experimental environment
[1] K. Szczerba, S. Forchhammer, J. Stttrup-Andersen, and

P. T. Eybye,Fast Compressed Domain Motion Detection in
H.264 Video Streams for Video Surveillance Applications,
in Proc. Sixth IEEE International Conference on Advanced
Video and Signal based Surveillance(AVSS09), pp. 478483,
Sep. 2009.
Table 1: Test set

Sequence
name
Video1
Video2
Video3
Video4
Number
of picture
7200
92321
7680
4598
I picture
interval
15
30
30
30
Place
Indoor
Outdoor
Outdoor
Indoor
[2] R. Wang, ,H-J. Zhang, and Y.-Q. Zhang. A confidence

based moving object extraction system built for compressed
domain, IEEE intl. symp. Circuits Systems, 2000.
Intel Core i7 CPU 860 @ 2.80GHz 2.79GHz,

memory 12GB, OS Windows 7 Professional K, visual
studio 2012, H.264/AVC Main profile, GOP length (15,
30), picture per one slice (I, P, B picture), 30fps
Table 1 shows the test sequence set for the
evaluation of algorithm. Test sequences consist of
movement and no movement at indoor and outdoor.
Table 2 shows the performance of single thread
processing speed. Test sequences are H.264/AVC
based Bitstream main profile 1280x720p. Anchor
adapts the GOP skip algorithm in motion detection case.
It does not consider the no motion case. As a result,
table 1 shows that GOP skip technique achieved a
speed-up of average 2 times compare with anchor and
accuracy is maintained.
[3] M. Laumer, P. Amon, A. Hutter, and A. Kaup, A

Compressed Domain Change Detection Algorithm for RTP
Stream in Video Surveillance Applications,in Multimedia
Signal Processing (MMSP), 2001 IEEE 13th international
Workshop on, 2011.
[4] Y.-Y. Kim, S.-G. Oh, Y.-J. Ahn, Y.-S Kim, S.-H. Hwan,
S.-H. Kim, H.-J. Jo, D.-G. Sim, A compressed domain fast
motion detection for IP video surveillance monitoring
system, Twenty-seventh Signal Processing Joint conference,
Sep. 2014.
Table 2: Performance of proposed algorithm

compare to anchor
Sequence
name
Video1
Video2
Video3
Video4
Anchor(fps)
1200
1280
900
499
Proposed
algorithm(fps)
2676
2844
1935
884
Speed
up(times)
2.23
2.22
2.15
1.77
Acknowledgement
This research was supported by Basic Science
Research Program through the National Research
Foundation of Korea (NRF) funded by the Ministry of
Science,
ICT
&
Future
Planning
(NRF2014R1A2A1A11052210) and the IT R&D program of
MSIP/KEIT [10042395, Development of SW
emulation and rapid prototyping technology for highperformance SoC based-on multicore]
- 256 -
FO-2-2-3
The DVS Technique Based on Clipped LMS Filter

for MPEG-2 Application
Dongwan Kim
Sunshin An
School of Electrical Engineering

Korea University
Seongbuk-Gu, Seoul 136701
Email: dongwank@korea.ac.kr
School of Electrical Engineering

Korea University
Seongbuk-Gu, Seoul 136701
Email: sunshin@dsys.korea.ac.kr
AbstractIn this paper, we propose a new dynamic voltage

scheduling (DVS) technique which is based on clipped least mean
square (LMS) lter for workload prediction. We modify the
traditional LMS workload prediction scheme by clipping over
variable threshold to eliminate extra high peak value taking
into account the uctuation of frame actual execution time.
The proposed scheme is evaluated both energy consumption
and deadline miss ratio in MPEG-2 application and compared
previous schemes.
Fig. 1.
Illustration of DVS technique
I. I NTRODUCTION
Demands on low power devices have been increasing in
recent years [1 - 2], however in the effort of achieving
low power requirement, there is a trade-off between power
requirement and performance requirement. Mobile application,
where the devices size is xed and mostly has small-sized
form, is one of applications where a low power technique is
required reduce power consumption while maintaining overall
performance requirement. The needs on low power technique
becomes high since many industries want to put a lot of
sophisticated software applications in mobile devices which
have a huge computation load, hence, killing battery lifetime
for a xed battery size.
Dynamic voltage scheduling (DVS) is a one of technique
to reduce overall power consumption of a system in which
systems voltage supply and frequency of operation can be
dynamically changed based on workload requirement. There
are two variables that are tuned up or down in DVS, i.e.
supply voltage and frequency of operation. Most of processors
have a discrete set of operating frequency, voltage supply, and
pair of frequency and voltage supply. In CMOS circuit, power
consumption which is dominated by voltage due to switching
activity can be expressed as follow [3]
2
P = CL Vdd
fclk
(1)
where CL represents the load capacity, Vdd is supply voltage, fclk is operating frequency, and is switching probability.
As expressed in equation (1), supply voltage is quadratic
proportional to power consumption. Many literatures have
concluded that reducing supply voltage is the most effective
way to reduce power consumption. However, reducing supply
voltage lead to degrading of systems performance due to
the increase of gate delay, hence, lowering overall systems
speed. Therefore, to overcome this tradeoff, it is necessary to

analyze systems performance requirement in run-time such
that a suitable voltage supply can be provided to the system.
II. T HE DVS
TECHNIQUE BASED ON CLIPPED

FOR MPEG-2 APPLICATION
LMS
FILTER
In real-time application, performance requirement can be

analyzed from task deadline and task worst case execution
time (WCET). If the difference between this two parameter,
which is called slack time, is high, it means that the system
can be slowed down, meaning that its voltage supply can be
reduced, hence, lowering power consumption. On the other
hand, when the slack time is too low, in the worst case WCET
is higher than tasks deadline; the system needs to be speeded
up to meet performance requirement.
Figure 1 shows an illustration of DVS technique for low
power system. In order to reduce power consumption, the
slack time of task 1 and task 2 can be minimized by using
a suitable low voltage supply. Suitable voltage supply means
that even though the system is slowed down, task deadline
should not be violated. In order to set a proper supply voltage,
a priori information about the current task should be known.
Slack time is one of parameter that represents the performance
requirement at the moment. One of the methods to obtain the
slack time information is by tracing its workload [4]. Future
workload can be predicted as follows:
wp [n + 1] =
N
1
hn [k]w[n k]
(2)
k=0
where w[n] is the previous workload in the observation interval, (n1)T t nT and hn [k] is coefcient of an adaptive
FIR lter. One of methods to update lters coefcients is
- 257 -
ICEIC 2015
TABLE I
MPEG-2 INPUT STREAMS
Least-Mean-Square (LMS) in which coefcients are updated

based on prediction error. The benet of using LMS lter is
the system can learn about the on-process input stream [4].
The rule to update lters coefcients is expressed as follows:
hn+1 [k] = hn [k] + we [n]w[n k]
(3)
where we [n] is the prediction error, dened as we [n] = w[n]

wp [n], and is the step size. In LMS based prediction lter,
choosing number of coefcient and step size is important since
it may lead to dis-convergences and instability [4].
In MPEG-2 system, unit of data is dened as frame.
In general, there are three types of frame, i.e., I-frame
(Intra-coded), P-frame (predictive-coded), and B-frame (Bidirectional-coded) [5]. The execution times for each type of
frame are different, also the execution time varies over the
video stream even in the same type of frame. In our proposed
scheme, we consider rstly the variation of actual execution
time between different frames and then, secondly we consider
the variation of actual execution time in a same frame in
order to improve the accuracy of workload prediction. Most of
frames have a linear trend of actual execution time. However,
there are some frames that uctuate much more than other
frames, called as outlier frames. Workload of the next frame
can be predicted accurately if the outlier frame is removed
from the computation of LMS algorithm. We introduced a new
parameter, called frame threshold, whose value is a variable
to remove outlier frames.

i,m , x[k] > i,m
x[k] =
(4)
x[k], x[k] i,m
where the variable m has the value of [1, 2, 3] and each
value represents I,P, and B frame. Also, i,m represents the
threshold of m type frame and it is described as
i

i,m =
l,m
i
(5)
Fig. 2.
Input
File name
192X14430f ps bobo.m2v
240X20830f ps tue.m2v
320X24025f ps RedsN ightmare.m2v
Comparison between MA, WMA, LMS, C-LMS, and ideal case
shown in Figure 2, our proposed scheme (C-LMS) gives a

competitive result in terms of energy consumption (EC) and
deadline miss ratio (DMR). EC of C-LMS is about 35.2%,
40.68%, and 51.77% for input A, B, and C, respectively, while
its DMR is about 5.31%, 8.66%, and 10.34%, respectively.
For input B, even though C-LMS has a slightly greater EC than
traditional LMS, DMR of C-LMS is much lower than LMS.
On the other hand, WMA and LMS algorithm has lower DMR
but their EC is higher than of C-LMS.
l=1
where is clipping variable and it determine as performance

requirement level.
Procedure of our proposed algorithm is summarized as
follows:
1. Checking the type of incoming frame and classifying as
frame type.
2. Predicting the future workload for the same frame type
using from equation (3) to (5).
3. If outlier frame detects, workload prediction can be
processed without outlier frame.
III. S IMULATION R ESULTS
For evaluation purposes, we use three different video
streams, as shown in Table 1. To evaluate the benet of
our proposed algorithm, we compared our scheme, which
is Clipped LMS (C-LMS), moving average algorithm (MA),
weighted moving average algorithm (WMA), and least-meanssquare algorithm (LMS). The result is shown in Figure 2. As
IV. C ONCLUSION
We propose a DVS technique by using C-LMS lter for correct workload estimation in MPEG-2 application. Our scheme
is an extension of a lter-based DVS technique using LMS
FIR lter whose coefcient can be updated based on workload
history. Our modication to the LMS method is taking into
account the uctuation of actual execution time in the same
type of frame. We removed outlier frame whose uctuation
exceeds a variable threshold in workload history updating
process. Based on simulation results, our proposed algorithm
has a competitive performance among the other algorithms.
ACKNOWLEDGMENT
This work is supported by National Research Foundation of
Korea(NRF) grant funded by Korea government (No. NRF2012K1A3A1A09026959).
- 258 -
ICEIC 2015
R EFERENCES
[1] Woonseok Kim, et al., Performance Evaluation of Dynamic Voltage
Scaling Algorithms for Hard Real-Time Systems, Journal of Low Power
Electronics, 2005, Vol. 1.
[2] Pillai Padmanabhan and Kang G Shin, Real-time dynamic voltage
scaling for low-power embedded operating systems, Proc. of eighteenth
ACM symposium on Operating systems principles, 2001, Vol. 35, 5.
[3] Chandrakasan, A. P. and Brodersen, R. W., Minimizing power consumption in digital CMOS circuits, Proceedings of the IEEE, 1995, Vol. 83,
pp. 498-523.
[4] Sinha, A. and Chandrakasan, A. P., Dynamic voltage scheduling using
adaptive ltering of workload traces Fourteenth International Conference
on VLSI Design, 2001, pp. 221-226.
[5] Kihwan Shoi, et al. Frame-based dynamic voltage and frequency scaling
for a MPEG decoder, Proc. of the 2002 IEEE/ACM international
conference on Computer-aided design,2002.
- 259 -
FO-2-2-4
Modified Transform Skip Signaling Method for HEVC Screen Content

Coding
Dahee Lee, Seungha Yang, Hiuk Jae Shim and Byeungwoo Jeon
School of Electronic and Electrical Engineering
Sungkyunkwan University
Suwon, Korea
dadi0413@skku.edu, pudding@skku.edu, waitnual@skku.edu, bjeon@skku.edu
Table 1.
Prob{TSM|X} where X=IBC or non-IBC
I-Slice
B-Slice
NonNonIBC
IBC
IBC
IBC
TGM, 1080p
0.945 0.670 0.936 0.840
TGM,720p
0.847 0.299 0.790 0.434
M, 1440p
0.803 0.271 0.670 0.323
M, 1080p
0.845 0.260 0.804 0.544
A, 720p
0.262 0.105 0.364 0.338
CC,1080p
0.222 0.064 0.165 0.148
Abstract
In this paper, a modified transform skip signaling
method is investigated in order to improve coding
performance of HEVC Screen Content Coding. Its
experimental results show on average 0.2% coding gain
improvement under all intra test condition.
Keywords: Screen content coding, transform skip
1. Introduction
As a part of extensions to the HEVC version 1 [1],
international standardization for screen content coding is
under development by JCT-VC (Joint Collaborative Team
on Video Coding). Screen content is a novel type of video
sources which contain lots of artificial video/images such
as drawings, text, and graphics. Based on observation of
strong relationship between Intra Block Copy (IBC) and
transform skip mode (TSM) in screen contents [2], in this
paper, we investigate a modified transform skip signaling
method related to IBC to reduce signaling bits for TSM
and additionally TU (transform unit) split information.
Rest of this paper is as following. In Section 2, high cooccurrence relation between IBC and TSM is investigated.
Following, the proposed method is described in Section 3.
Experimental results for the method are discussed in
Section 4. Finally, Section 5 draws some conclusion.
2. Intra block copy and transform skip

In IBC coded CU (coding unit), it is observed that the
TSM is more frequently selected than in non-IBC coded
CU. The conditional probability of TSM occurrence
measured in 8x8 CU is in Table 1 which shows that TSM
indeed occurs more in IBC coded CU than in non-IBC
TGM : Text and graphics with motion

M : Mixed content
A : Animation
CC : Camera-captured content
coded CU. It hints us to utilize the relation between TSM

and IBC by collective signaling of transform_skip_flag in
IBC-coded CU to save its signaling bits. We introduce one
flag (named as representative flag) CU level which
collectively indicates TSM of eligible transform blocks in
the given CU, so that it is possible to avoid signaling TSM
(i.e., transform_skip_flag) for each TB (transform block).
3. Proposed method
The proposed method can be divided into two parts, one
is the representative flag signaling and the other is
corresponding action based on the value of the
representative flag. The proposed method is explained in a
decoders perspective. In the first part, the decoder
selectively parses the representative flag when the
following condition (lets call it as Cond. 1) is satisfied:
This research was supported by the National Research

Foundation of Korea (Grant NRF-2013K2A2A2000777).
- 260 -
Cond. 1
1) Current CU contains non-zero residual data; and
2) it can have transform block coded as TSM; and
3) it is IBC-coded.
ICEIC 2015
Table 2. Rate(G/Y) comparison of

the proposed method
with SCM 2.0 (anchor)
Start
Cond. 1 ?
No
AI
Yes
Parsing representative flag
representative flag ==1?
RGB, TGM, 1080p

RGB, TGM,720p
RGB, M, 1440p
RGB, M, 1080p
RGB, A, 720p
RGB, CC, 1080p
YUV, TGM, 1080p
YUV, TGM,720p
YUV, M, 1440p
YUV, M, 1080p
YUV, A, 720p
YUV, CC,1080p
Enc Time[%]
Dec Time[%]
No
Yes
Split_transform_flag=1
(for depth 0 TU)
Cond. 2 ?
No
Yes
transform_skip_flag=1
Perform regular
decoding process
end
Figure 1. Proposed transform skip signaling

method at decoder
This condition avoids parsing of the representative flag
for those CUs for which the signaling of TSM is not
necessary to begin with. That is, the first two conditions in
Cond. 1 make sure that TSM is possible in current IBCcoded CU. If Cond.1 is satisfied, the representative flag is
parsed by decoder. The flowchart of the propesed method
is shown in Figure 1. When the representative flag is equal
to 1, the decoder interprets it as followings: a) at least one
TU reaches the maximum allowed RQT (residual quad
tree) depth; b) all coded TBs at the max depth (but not
larger than the allowed size of TSM) are all TSM coded.
The interpretation of a) makes the decoder infer
split_transform_flag being 1 at RQT depth 0 if CU size is
not equal to the TU max depth. It can save one bit for
split_transform_flag. When the representative flag is equal
to 0, the decoder performs conventional decoding process
for parsing transform_skip_flag & split_transform_flag.
Futhermore, when the representative flag is equal to 1 and
the following Cond. 2 is satisfied, the decoder infers
transform_skip_flag being 1, which leads the method to
save signaling bits for transform_skip_flag at the max RQT
depth.
Cond. 2
1) Current TBs coded_block_flag (cbf) = 1; and,
2) it is at the maximum RQT depth; and,
3) its size is allowed for TSM.
The proposed method is implemented using the HEVC
reference software HM 15.0 RExt 8.0 SCM 2.0 [3] and
tested using the common test condition for screen contents
coding [4] under all intra (AI), random access (RA), and
-0.5%
-0.3%
-0.2%
-0.1%
0.0%
0.0%
-0.3%
-0.1%
-0.2%
-0.2%
0.0%
0.0%
99%
100%
RA
G/Y PSNR
-0.1%
-0.1%
-0.1%
0.0%
0.0%
0.0%
-0.1%
0.0%
-0.1%
0.0%
0.0%
0.0%
100%
96%
LD
0.0%
0.1%
0.0%
0.1%
0.0%
0.0%
0.0%
-0.2%
-0.1%
-0.1%
0.0%
0.0%
100%
99%
low delay (LD) configurations. The test results are given in

Table 2. For AI, RA, and LD configurations, the proposed
method improves BD-rate gains on average 0.19%, and
0.03%, respectively. Especially note gains of 0.5% and
0.3% respectively for text & graphics with motion 1080p
RGB and YUV sequences. There is little changes in the
en/decoding time, so there is no computational complexity
impacts by the proposed method.
5. Conclusions
In this paper, we presented a collective signaling
method of transform_skip_flag for IBC-coded CU. The
proposed method introduced one flag at CU level which is
conditionally signaled. Depending on the CU level flag,
signaling
bits
for
transform_skip_flag
and
split_transform_flag can be saved. By this method, average
gain of -0.19% for AI is achieved in lossy coding.
Moreover, en/decoding time increment compared to
current design is negligible.
References
[1] G. Sullivan, et al. "Overview of the high efficiency
video coding (HEVC) standard," IEEE Trans. Circuits and
Syst. for Video Technol, pp. 1649-1668, Dec. 2012
[2] S. Yang, H. J. Shim, D. Lee, and B. Jeon, Non-CE2:
Transform skip signaling for intra block copy, JCTVCS0036, Strasburg, Oct, 2014.
[3] HM 15.0 RExt 8.0 SCM 2.0 software, available
https://hevc.hhi.fraunhofer.de/svn/svn_HEVCSoftware/tags
/
[4] H. Yu, R. Cohen, K.Rapaka, J, Xu, Common Test
Condition for Screen Content Coding, JCTVC-R1015,
Sapporo, July, 2014.
- 261 -
FO-2-2-5
A FPGA-Based Real-Time Binocular Stereo Vision System using Adaptive

Support-Weight
Liang Zhang
Beijing Jiaotong
University
32351881@qq.com
Fei Qiao()
Tsinghua University
qiaofei@tsinghua.e
du.cn
Kunzhi Xie,Li Luo

Beijing Jiaotong
University
Huazhong Yang
Tsinghua University
2. Stereo matching
Abstract
In this paper, a FPGA-based smart camera named
Smart-Eyes is proposed and a binocular stereo vision
system is i mplemented. The key component for the
system is Adaptive Support-Weight algorithm. It can
produce accurate piecewise smooth disparity maps by
using complex calculation. We proposed some
optimization methods to meet the requirement of realtime and high accuracy. The system can process 60fps
(frame per second) for a video of 640*480 resolution
with the accuracy rate of 89% and the hardware
resources consumption of 73%.
Keywords: b inocular stereo vision, FPGA, parallelis m,
adaptive support-weight.
1. Introduction
Binocular stereo vision, based on the theory of
stereopsis, is a system in wh ich two cameras can be
used to extract three-dimensional information of a
scene from stereo images taken fro m distinct
viewpoints [1]. It is of great importance and finds
applications in the field of industry [2], robotics and
image analysis. As the depth informat ion found
valuable in wide range of applications, it can be
mean ingful to provide dense disparity maps by
designing a stereo vision system in the smart camera.
Current trends in the field main ly pursue real-time
execution speeds, as well as decent accuracy.
Inspired by an amazing approach named adaptive
support-weight approach proposed by Yoon [3], we
realize a similar algorith m in Verilog HDL and
implement it on a FPGA -based image processing
platform, Smart-Eyes. Our b inocular stereo matching
algorith ms average percent of bad pixels is about 11%
at the frame rate o f 60fps based on the Tsukuba dataset
provided by Middlebury [4]. It infers that we realize a
real-t ime binocular stereo vision system with
considerable accuracy at the expense of reasonable
hardware resources.
The algorith m is mainly d ivided into three parts:

adaptive support-weight co mputation, dissimilarity
computation based on the support-weights, and
disparity selection. The support-weight of a pixel can
be computed and allotted based on the gestalt
principles. Similarity and pro ximity are the two main
grouping concepts in classic gestalt theory [3]. So the
computation of support-weight is related to the
grouping by both similarity and pro ximity. Therefore
the support-weight of a pixel can be defined as
(
)
(
)
(
)
( (
))
(1)
where
and
represents separately the absolute
color difference and the spatial distance between pixel
p and q. Moreover
and
are positive parameter
which are required to be set.
When aggregating matching cost, we should
mu ltip ly the matching cost of pixel in the support
window and their corresponding support-weight at first.
And then all the results should be added up. After the
cost aggregation, the WTA (Winner-Take-All) method
is selected to choose the disparity of each pixel.
We use parallel co mputing in order to rea lize the
high speed processing. It means that the calculation of
support-weight cannot occupy too much co mputing
resources. Therefor we optimize the (1) as
(
)
( (
)) ( (
)), (2)
where
and
represent the rightward shift of the
digit, respectively. Shift operation used in (2) can
greatly simplify the co mplexity of calcu lation with
small effect on the accuracy of results. In addition, we
calculate the Hamming distance between pixels instead
of Euclidean distance.
In fact,
is determined to the size of the supportwindow. When the size of support-window is 15x15,
results show that
should better to be 2. As for , a
series of experiments show that 7 is a wise decision.
- 262 -
ICEIC 2015
Pixel_Scan
weight_computatio
n
The whole stereo vision algorith m is implemented

in a single XC7VX485T FPGA board. The utilized
hardware resources are main ly determined by the size
of aggregation window wh ich actually also affects the
accuracy a lot. In our implementation, the stereo vision
algorith m is tested with the window size of 9x9, 11x11,
13x13 and 15x15 respectively. The hard ware resource
report is shown in Fig.3 and the accuracy report is
shown in Table I. The results of experiments on
aggregation window size are shown in Fig. 4. To
achieve a better trade-off between accuracy and
hardware resources, the window size of 13x13 is
obviously a wise choice.
Pixel_Match
Left Image
Right Image
DDR3 SDRAM
Cost
computation
Cost
computation
Cost
computation
Cost
computation
Cost
computation
Cost
computation
Buffer
aggregation
aggregation
Disparity
aggregation
WTA
Fig. 1. Overview of the hardware implementation.
4. Hardware Implementation
To achieve the proposed Adaptive Support-Weight
algorith m, we propose a paralleled design on FPGA .
We transform the algorith m and present some
optimization methods which are mapped onto FPGA
under the resource constraints. Finally we imp lement
the algorith m with hardware description language
Verilog and ensure the real-time and accuracy at the
same time.
Fig.1 shows our proposed design. The video
resources and results are stored in the external DDR3
SDRAM. The other blocks are all imp lemented using
FPGA. The Pixel_Match module is the main block
which contains four parts: weight_computation module,
cost_computation module, aggregation module and
WTA module. It can be used for 16 disparity-level
parallel co mputation. The Pixel_Scan module controls
the task of scanning the whole pixels of images. We
adopt the efficient scanning mode shown as Fig.2 (c)
instead of these in Fig.2 (a) and (b).The Buffer module
read the data stored in the DDR3 and local cache them.
FPGA
Resource
Utiliaztion
Number of Slice Registers: 597200 available in total

Number of Slice LUTs:
215389 54676
(72%) (73%)
80 %
60 %
40 %
20 %
105707 28693
(35%) (38%)
(b)
153683 40320
(51%) (54%)
9x9
96137
(16%)
74138
(12%)
55194
(9%)
36952
(6%)
11 x 11
13 x 13
15 x 15
Size of Aggregation Window
Fig. 3. Hardware Resource Report (

= 15)
9x9
11x11
= 2,
13x13
= 7,
15x15
Fig. 4. Vivid Results of Experiments on Aggregation

Window Size
Table I. Results of Experiments on WinSize ( = 2,
= 7, = 15)
WinSize
(a)
298600 available in total
Number of occupied Slices: 74650 available in total 296757 74268

(99%) (99%)
100 %
9x9
11x11
13x13
15x15
(c)
nonocc.
8.45
7.15
6.36
6.03
percent of bad pixels (%)

all
disc.
9.07
19.9
7.81
19.5
7.06
19.6
6.76
19.9
avg.
12.5
11.5
11.0
10.9
References
Fig. 2. Some Scanning Methods
5. Experimental Evaluation
To verify and evaluate the stereo vision algorith m in
our Smart-Eyes, we use the Tsukuba dataset provided
by Middlebury Stereo Evaluation [4] with the
corresponding ground truth. Since our algorith m is
targeted at accuracy, real-time performance and
reasonable hardware resources, we focus on the tradeoff among algorith mic speed, accuracy and hardware
resources. The performance of algorithmic speed, with
real-time as the basic goal, achieves 60 fps .
[1] Gubbi J, Buyya R, M arusic S, et al. Internet of Things

(IoT): A vision, architectural elements, and future
directions[J]. Future Generation Computer Systems, 2013,
29(7): 1645-1660.
[2] Strategy I T U, Unit P. ITU internet reports 2005: The
internet
of
things[J].
Geneva:
International
Telecommunication Union (ITU), 2005.
[3] Yoon K J, Kweon I S. Adaptive support-weight approach
for correspondence search[J]. IEEE Transactions on Pattern
Analysis and M achine Intelligence, 2006, 28(4): 650-656.
[4]Scharstein D, Szeliski R. A taxonomy and evaluation of
dense two-frame stereo correspondence algorithms[J].
International journal of computer vision, 2002, 47(1-3): 7-42.
- 263 -
FO-2-2-6

! "#
$$

% &

&

&

'
&

(
)*$ (
)*
&

'
'

) * +*

$ ,& *
'
& *
* -

$ % &
.&'
&

* / &
*

*
&
* & *

&

&
$ -
* &
&
* &

(
)*

&
0* $

& && %

$ * #& & &
-& #&
.$
9,
9!,
!

!
!" #$
! %
& !
'()'*)$
+
! $
(, &# !
!" !
'-)&'.)+ /"'0) *,
! ! 1
'2) '3)$

&# ! & !
&# !" &
!" & !
! & $
&& !
& #
! 4 '5)
6 ! 7 8&& &
! & $

9,
9,
% ($
- $

9, ':)9!, &# ! 9
&# , !" 9!" &# ,
9,! 9,
" # $

#& & & $
9,
9!,
% " &' ( $) &' *+

,

- 264 -
ICEIC 2015
#+
$
;;
!

..

;; & # !

!

;; &&
<
<
;; ! "
9 ;;"&&

<
<

'-)4 '5)
&
& !
& !
&# &# &
&$
!
# $% % " & ' ' " & ( ( " <9(,
!
"

)
& &# * + ,
! &#
&# ! &# $
= &
!
$
! &#
$ & & &#
> & $
!
!
# $% % " & ' ' " & ( ( "<9*,

"
/ 0#1#234#567849#:9#;7<=4#/;>4? @ 8<?;?##/;>4
D
A 0#1#234#567849#:B#54;=38:93::C
6 ! 7

8& ! ! E$

6 ! 7 8& !
&$ & !
! 8 !
! &5$
1 & &
& $ 1
&
& !
$
? @ ! 4
'5) & & $
/ ,$

#& ? A
B 0@*0CC ?D 30C E -$-C=%
F192.C#.5C,$

% !! & $

0 # $ $
1
? 9,

6 $( 6 $* 6 $- 6 $. 8
'-)
-52: -*20 (3*5 ..-3 --*.5
'5)
*::
*5-
*:-
-C2
*:0
? &
*2*
*0-
*20
*3C
*2*

! ( & &
& '-)'5)$
1

/ & &
& &
! 1 $ 1
#&
$

2$

"! && ! G 8 @
@ @ 9G,
G *(&& H D

'()?7%
$<I <?
$J
8 8 J$ 1 +
G *K-(0L--3*CCC$
- 265 -
ICEIC 2015
'*) ? H< G $/$< JG +

D -7 & J ? 1 8
$*: $5 &&$(*:3@
(-C51$*CC3$

'-)F$F % F$ J> >L
8@
! 6@7 G
1 J$ & @*CC0 6 !" 1" "
+*CC0$

'.) G " H$ 8@?$ &
&! ! @
$ ? $ M
& F $((C2@((*$*CC($

'0)
$< J+ /" J
? 1 8
$*5 $((&&$(325@(35-6 $*CC2$

'2)8$1$/"7$ % & N" K1
8 O$M & F $( $.
&&$-*(@--((:55$

'3) $ 6$ 8 /$ 1$ G N
O & 8
? $2C $0&&$-.:@-5.(::5$

'5) " H" < < 8"% H <
= < + 8"< @!
-7 $? $
? 5-(. 8 *C(*K ?
5-(.-.4 !*-*C(*$

':)7$8$4 " 7$$8"$1!
&&

$ ? $ 5 > $ &
F 9F, * & .(2L.*- F G
9,*CC($
- 266 -
ICEIC 2015

Oral Session
FO-2-3
Computer and Information II
FO-2-3-1
Time Period Identification of Prosaic Texts in

Modern Mongolian Language
Zolboo Damiran*, Khuder Altangerel**
MUST-SICT,
*Department of Information Technology,
d.zolboo@must.edu.mn
**Department of Computer Science,
khuder@must.edu.mn
Abstract - The main purpose of this research is to classifying
by year each of the proses. We have used Decision tree method
approaches for set of proses, each classified with length of 10
years interval (1920s, 1930s, etc.). Since it is the first work in this
field for Mongolian language no previous work results were
available for comparison.
Keywords Machine learning, Text categorization, Decision
tree classification, corpus
I.
INTRODUCTION
Language as a social phenomenon, developed in
conjunction with the community about the changing and
varying enrichment. Even within society, some things old and
some of them are completely formed and developed within the
language of interaction subjected to many of the most active
part of the vocabulary. Vocabulary enrichment and developing
a new non-permanent active process from one generation and
social development has stagnated for a time, and a major
change is the development of a lexical effect.
Nowadays, the main common text classification methods
are the Bayes Classification algorithm, Decision Trees,
Maximum Entropy Modeling, Perceptron Learning Algorithm
and k-Nearest Neighbor Classification.
In this paper, we will describe an evaluation on a text
classification using Decision Trees method for classifying by
year of the proses.
We have chosen our training corpora based on the
following length of 10 years interval proses in Mongolia to
make the detection:
1. 1920-1929
2. 1930-1939
3. 1940-1949
4. 1950-1959
5. 1960-1969
6. 1970-1979
7. 1980-1989
8. 1990-1999
9. 2000-2009
II. DECISION TREE CLASSIFICATION ALGORITHMS
Decision trees are one of the most widely used inductive
learning methods. The decision tree is a method for knowledge
representation. It was developed in the 60s. With the use of an

attribute value set it can determine the class of a test entity. The
decision tree is a cycle free graph which has nodes as attributes
to support decisions. The branches of the tree represent a
precedence relationship between the nodes. The weight of a
branch is an element of the attribute value set of the branchs
parent node. The attributes are nodes with at least two children,
because an attribute has got as many branches as the cardinality
of the value set of the actual attribute. The root of the tree is the
common ancestor attribute, from where the classification can
be started. The last building block of the tree is the class nodes.
In every relation the class is only a child, so it is a leaf of the
tree in every case [3].
This tree can be used with the following method to classify
an entity: First a decision has to be made on each attributes
actual value. Then the next node must be reached along the
branch with this value. If this node is an attribute, this
procedure must be repeated. If this is a class, the decision trees
level of information storage is reached. This class is the
decision which has to be made when a sample with these
attribute values is in question. The usage of the tree
demonstrates that a rule set can be built for each class, which
enables the effective usage of this technique in a program. This
rule set is based on the if-then layout.
Their robustness to noisy data and their capability to learn
disjunctive expressions seem suitable for document
classication. One of the most well-known decision tree
algorithms is ID3 and its successor C4.5 and C5.1. It is a topdown method which recursively constructs a classier decision
tree. At each level of the tree, ID3 selects the attribute that has
the highest information gain. For our experiments, we chose
the ID3 decision tree package since it has many nice features.
A. ID3 algorithm
ID3 algorithm was introduced by Quinlan for
inducing Classification Models, also called Decision Trees,
from data.
We are given a set of records. Each record has the same
structure, consisting of a number of attribute/value pairs. One
of these attributes represents the category of the record. The
problem is to determine a decision tree that, on the basis of
answers to questions about the non-category attributes, predicts
correctly the value of the category attribute. Usually the
category attribute takes only the values {true, false}, or
- 268 -
ICEIC 2015
x All the samples in the list belong to the same class.
When this happens, it simply creates a leaf node for the
decision tree saying to choose that class.
{success, failure}, or something equivalent. In any case, one of

its values will mean failure [4].
The basic ideas behind ID3 are that:
x In the decision tree each node corresponds to a noncategorical attribute and each arc to a possible value of that
attribute. A leaf of the tree specifies the expected value of the
categorical attribute for the records described by the path from
the root to that leaf (This defines what a Decision Tree is).
x In the decision tree to each node should be associated the
non-categorical attribute which is most informative among the
attributes not yet considered in the path from the root (This
establishes what a Good decision tree is).
x None of the features provide any information gain. In

this case, C4.5 creates a decision node higher up the tree
using the expected value of the class.
x Instance of previously-unseen class encountered. Again,
C4.5 creates a decision node higher up the tree using the
expected value.
III.
THE CALCULATION OF ID3 ALGORITHM
x Entropy is used to measure how informative is a node.
We have collected training set of 352 documents, each

labeled with one of 9 year intervals.
The ID3 algorithm is used to build a decision tree, given a

set of non-categorical attributes, , the categorical
attribute C, and a training set T of records.
If there are n equally probable possible messages, then the

probability p of each is and the information conveyed by a
message is
function ID3(
R: a set of non-categorical attributes,
C: the categorical attribute,
S: a training set);
begin
If S is empty, return a single node with
value Failure;
If S consists of records all with the same
value for
the categorical attribute,
return a single node with that value;
If R is empty, then return a single node with
as value the most frequent of the values of
the categorical attribute that are found in
records of S;
Let D be the attribute with largest Gain(D,S)
among attributes in R;
Let {dj| j=1,2,.., m} be the values of
attribute D;
Let {Sj| j=1,2,.., m} be the subsets of S
consisting respectively of records with value
dj for attribute D;
Return a tree with root labeled D and arcs
labeled d1, d2, .., dm going respectively to
the trees
ID3(R-{D}, C, S1), ID3(R-{D}, C, S2),..,
ID3(R-{D}, C, Sm);
end ID3;
B. C4.5 algorithm
C4.5 builds decision trees from a set of training data in the
same way as ID3, using the concept of information entropy.
The training data is a set of already classified
samples. Each sample consists of a p-dimensional vector
, where the represent attributes or features of
the sample, as well as the class in which falls.
At each node of the tree, C4.5 chooses the attribute of the
data that most effectively splits its set of samples into subsets
enriched in one class or the other. The splitting criterion is the
normalized information gain (difference in entropy). The
attribute with the highest normalized information gain is
chosen to make the decision. The C4.5 algorithm then does
recursive calls on the smaller sub lists.
This algorithm has a few base cases [5].
(1)
That is, if there are 100 documents, then

and we need 8,45 bits to identify each message.
In general, if we are given a probability distribution
then the Information conveyed by this
distribution, also called the Entropy of P, is:

(2)
For example, if P is (0.5, 0.5) then is 1, if P is (0.67,
0.33) then is 0.92, if P is (1, 0) then is 0.
If a set T of records is partitioned into disjoint exhaustive
classes on the basis of the value of the categorical
attribute, then the information needed to identify the class of an
element of T , where P is the probability
distribution of the partition :

(3)
In our example, we have Info(T) = I(9/14, 5/14) = 0.94,

and in our novel example we have Info(T) = I(5/10,5/10) = 1.0.
If we first partition T on the basis of the value of a noncategorical attribute X into sets T1, T2, .., Tn then the
information needed to identify the class of an element of T
becomes the weighted average of the information needed to
identify the class of an element of Ti, i.e. the weighted average
of Info(Ti):
Info(X,T) =
(4)
In the case of our novel example, for the attribute Prose we

have
Info(Prose,T) = 5/14*I(2/5,3/5) + 4/14*I(4/4,0) +
5/14*I(3/5,2/5)= 0.694
Consider the quantity Gain(X,T) defined as:
Gain(X,T) = Info(T) - Info(X,T)
(5)
This represents the difference between the information

needed to identify an element of T and the information needed
- 269 -
ICEIC 2015
x Figure 2 shows, the results on the Mongolian proses.
The corpus consists of 352 texts of which divides into 9
year intervals.
to identify an element of T after the value of attribute X has

been obtained, this is the gain in information due to attribute X.
In our prose example, for the Prose attribute the gain is:
Gain(Prose,T) = Info(T) - Info(Prose,T) = 0.94 - 0.694 =
0.246.
10
20
30
0,8
If we instead consider the attribute 1941, we find that

Info(1941,T) is 0.892 and Gain(1941,T) is 0.048.
0,75
0,7
We can use this notion of gain to rank attributes and to

build decision trees where at each node is located the attribute
with greatest gain among the attributes not yet considered in
the path from the root [6].
0,65
0,6
The intents of this ordering are twofold:

x To create small decision trees so that records can be
identified after only a few questions.
x Our corpus design including 10 percent of test set and
90 percent of training set. Table 1 shows, number of
novels of each author in the dataset. We chose our test
set from the each authors.
TABLE I.
Number of each prose
1920-1929
1930-1939
1940-1949
1950-1959
1960-1969
1970-1979
1980-1989
1990-1999
2000-2009
= Summary
TABLE III.
4
4
21
39
35
34
100
20
95
352
Table 2 shows, classifier accuracies of each year intervals

in the dataset.
TABLE II.
1.
2.
3.
4.
5.
6.
7.
8.
9.
x We can show on Figure 2, which the accuracy of prose

classification depends on test set and training set data
percentage.
TOTAL NUMBER OF PROSES OF EACH YEAR INTERVALS
Year Interval
1.
2.
3.
4.
5.
6.
7.
8.
9.
Fig.2. ID3 algorithm results depends on training set data on

Mongolian proses year interval
CLASSIFIER ACCURACIES
Year Interval
1920-1929
1930-1939
1940-1949
1950-1959
1960-1969
1970-1979
1980-1989
1990-1999
2000-2009
| Average
THE MOST 5 INFORMATIVE FEATURES OF EACH YEAR

INTERVALS
Year
length
1.
1920-1929
2.
3.
1930-1939
1940-1949
4.
5.
1950-1959
1960-1969
6.
7.
8.
9.
1970-1979
1980-1989
1990-1999
2000-2009
ID 3 algorithm
classifier accuracy
0.77
0.78
0.75
0.73
0.75
0.76
0.73
0.76
0.76
0.754
The most 5 informative features

, , , ,
, , , ,
, , , ,
, , , ,
, , , ,
, , ,
, , , ,
, , , ,
, , , ,
x The problem with feature selection is that the small

number of selected words may not generalize well to
new documents. However, the advantage of
dimensionality reduction is not only to improve the
recognition rate (eliminate the problem of over tting),
but the reduced number of features leads to lower time
and space complexities. The term-grouping method
reduces the feature dimensionality and overcomes the
generalization problem of feature selection, while
maintaining the performance of the classier.
CONCLUSION
During the experiment we used ID3 algorithm for text
classification and the conclusions are the following:
- 270 -
x Though the ID3 algorithm worked well with the noncontiguous data that we created and has the advantage
that it generates a smaller depth decision tree, we would
like to evaluate this algorithm with a larger and more
complicated data set. In fact, since ID3 was first
ICEIC 2015
developed, there is now an improved version called
C4.5.
x This study will be expanded in the future to include
more authors and messages to further demonstrate the
scalability and feasibility of our proposed approach. The
current approach will also be extended to analyze the
authorship of other literature-related materials, such as
poetry, drama.
x Another more challenging future direction is to
automatically generate an optimal feature set which is
specifically suitable for a given dataset. We believe this
will have a better performance cross the different
datasets.
REFERENCES
[1]
., 1990
, , , , 2014
[2] Jian mei, Wu zhang and Suge wang 2012. Grid Enabled problem solving
environments for Text Categorization
[3] Mary Slocum, "Decision making using id3 algorithm", Rivier academic
journal, Volume 8, Number 2, Fall 2012
[4] Christopher D. Manning, Hinrich Schutze 1999. Foundations of
Statistical Natural Language Processing. Second Edition. Chapter 16
Text Categorization. pp 575-610
[5] Quinlan,J.R.: Simplifying decision trees, International Journal of ManMachine Studies, 27, 221-234, 1987
[6] Quinlan,J.R.: C4.5: Programs for Machine Learning, Morgan Kauffman,
1993
[7] Y.H.Li, A.K.Jain, Classication of Text Documents, The Computer
Journal, Vol. 41, No. 8, 1998
[8] ., (Ph.D)-
. ., 2006
[9] Zolboo Damiran, Khuder Altangerel, Text Classification Experiments
on Mongolian Language, IFOST, 2013
[10] Zolboo Damiran, Khuder Altangerel, Author Identification - An
Experiment based on Mongolian Literature using Decision Trees,
UMEDIA, 2014
- 271 -
FO-2-3-2
Optimal Frequency Scaling for Multi-Core Processor with Soft-Fault

Seungwon Lee, Min Su Kim, and Won Woo Ro
School of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea Rep.
{seungwon.lee, minsu.kim, wro}@yonsei.ac.kr
Abstract
When a core in a multi-core processor has a softfault such as a delay error, the overall performance of
the multi-core processor is degraded. To prevent the
performance degradation, we propose frequency
scaling that enables the multi-core processor with a
soft-fault to increase the utilization and reduce the
performance degradation. Since performance and
power consumption of a core are proportional to the
clock frequency, an appropriate frequency scaling is
required according to the status of cores and
workloads. In this paper, we propose an optimal
frequency scaling process for a multi-core processor
with a soft-fault.
workloads. In light of this factor, we propose an

optimal frequency scaling process for the multi-core
processor including a soft-fault core. Using the number
of cores with a minimum frequency of a soft-fault core,
we can estimate and exploit the performance of a
multi-core processor system including a soft-fault.
Frequency
scaling
on-die
variation
Soft-fault
Figure 1. On-die variation of multi-core processor
2. Frequency scaling for soft-fault core
Keywords: frequency scaling, soft-fault, multi-core

processor
1. Introduction
As semi-conductor technology is scaled down, the
uncertainty of a chip increases and induces on-die
variation of a multi-core processor [1]. Unlike a hardfault that causes permanent errors, a soft-fault is related
to the operating speed since the soft-fault is induced by
signal propagation delays that do not fulfill the
requirement of specification [2]. When a soft-fault
exists in a core, the core is disabled or slowed down
the speed as shown in Fig. 1; therefore, the soft-fault
causes the performance degradation. In spite of the
adverse condition of the soft-fault core, the optimal
frequency scaling of the other cores can prevent the
performance degradation of the multi-core processor.
Execution time of parallel processes depends on the
parallel processing ability of the multi-core processor.
Therefore, utilization of each core is a critical issue in
the multi-core processing. If one of the cores cannot
be used for the execution, the overall performance is
degraded.
When we can exploit the saving power of a softfault core, we can adjust the frequency of other cores
according to the status of cores and executed
We first assume that a multi-core processor contains

n cores and executes in parallel. The performance of
the core is proportional to its clock speed. In addition,
we assume that the n cores ideally execute n number of
concurrent processes. However, we cannot exploit all
cores with maximum performance when on-die
variation happens. To resolve the performance
degradation in case one core in the multi-core
processor has a soft-fault, we scale the frequency of the
each core. In addition, we assume that a soft-fault of
the core can be detected instantly and the executed
workloads are fixed while the frequencies of cores are
adjusted.
Fig. 2 shows the optimal frequency scaling process
as follows. First, the status of each core is monitored
periodically to check whether a soft-fault exists or not.
When a soft-fault core is detected, frequency of the
core is changed to the minimum frequency is
determined to enable to execute a program using this
core. Maximum frequency of other cores is dependent
to the minimum frequency since the total dynamic
power consumption has a limitation.
On the other hand, we utilize the software
characteristics such as the portions of the sequential
and parallel execution time in the total execution time.
A core with the maximum frequency has advantages to
- 272 -
ICEIC 2015
execute the sequential part; on the contrary, the other
multiple cores with relatively lower frequency run the
parallel part in parallel. Based on the collected
information of the core and workload status, we adjust
the frequency of each core to exploit the multi-core
processor with a soft-fault.
Multi-core monitoring
benchmarks for the evaluation [3, 4]. We have varied

the frequency of each core to evaluate the execution
time of the workloads. Fig. 4 shows the normalized
performance of each case. We can see that our
proposed frequency scaling improves performance
significantly, up to 20% compared to the minimum
frequency.
1.4
Soft-fault
Normalized speedup to minimum freq.
No
Condition of a soft-fault in multi-core processor
Yes
Min. freq.
Determine minimum frequency of a soft-fault core
Max. freq.
Determine maximum frequency within fixed power budget
Parallel portions of
workloads
Workloads characteristics for parallel portions
Performance
estimation by models
Performance according to two performance models
1.2
1
0.8
original freq.
one Min. freq.
0.6
one Max. freq.

0.4
minimum freq.
0.2
0
Frequency scaling
streamcluster blackscholes
Adjust core frequency scaling
bodytrack
dedup
x264
PARSEC benchmark
Figure 2. Optimal frequency scaling process
Figure 4. Normalized performance results
4. Conclusion
3. Evaluation
We altered the clock frequency of each core for
evaluation. Fig. 3 shows the frequency configurations
of the cores. According to Fig. 3(a), when the
frequency of core 0 does not reach the common
frequency of other cores, the clock frequencies of core
1, 2, and 3 except core 0 can be increased equally by
the power budge of core 0. When the clock frequency
of core 0 becomes a minimum frequency, the power
budget from the gap between original and minimum
frequency is applicable to the other cores. In Fig. 3(b),
the frequency of core 1 and core 2 becomes minimum
frequency which is same to that of core 0. The
frequency of the other core, core 3 becomes the
maximum frequency by the rest power budget from
core 1 and core 2.
Min. Freq.
Max. Freq.
Min. Freq.
Max. Freq.
Core0
Core1
Core2
Core3
Core0
Core1
Core2
Core3
L1
L1
L1
L1
L1
L1
L1
L1
Switch
Switch
L2
L2
Main memory
Main memory
(a) One Core Minimum Frequency
Our frequency scaling process estimates the

performance of each core using the information of
cores, the characteristics of a program, and monitoring
the variation of core frequencies. We evaluated our
proposal by the multi-core simulation and verified the
results of our proposal. We conclude that proposed
optimal frequency scaling can be an effective way of
improving process to exploit a multi-core processor
with a soft-fault core.
Acknowledgement
MSIP/IITP, Republic of Korea [14-000-05-001, Smart
Networking Core Technology Development] and in part by
the ICT R&D program of MSIP/IITP (2014(10041971),
Development
of
Power-efficient
High-performance
Multimedia Contents Service Technology using Contextadapting Distributed Transcoding).
References
(b) One Core Maximum Frequency
Figure 3. Core frequency configuration

In the evaluation, we assume that the clock
frequency of a soft-fault core becomes 800MHz from
1GHz which is an original core frequency. In addition,
the power budget from the reduced clock frequency of
the core is ideally used for the other cores without
power dissipation. We use the Multi2Sim simulator
and we selected five programs of PARSEC
[1] Powell, M. D., et al., Architectural core salvaging in a

multi-core processor for hard-error tolerance, in
Proceedings of the 36th ISCA, ACM, pp. 93-104. 2009.
[2] Chin Jen, L. and S. M. Reddy, On Soft fault Testing in
Logic Circuits, Computer-Aided Design of Integrated
Circuits and Systems, IEEE Transactions on 6(5), pp. 694703, 1987.
[3] R. Ubal, J. Sahuquillo, S. Petit, and P. Lpez, Multi2Sim:
A Simulation Framework to Evaluate Multicoremultithreaded Processors, in Proceedings of ISCA, pp. 62
68, Oct. 2007.
[4] C. Bienia, S. Kumar, J. P. Singh, and K. Li, The
PARSEC Benchmark Suite:
Characterization and
Architectural Implications, in Proceedings of the 17th PACT,
pp.72-81, 2008.
- 273 -
FO-2-3-3
Performance Improvement of a Mobile Processor Depending on the Cache

Configuration
Ki Yeop Kim, Chang Min Eun, Hyun Hak Cho, and Ok Hyun Jeong
Department of Electronic Engineering, Sogang University, Seoul, Republic of Korea
kiyeop@sogang.ac.kr
Abstract
High processor performance on mobile devices is
recently required. Accordingly, many advanced
technologies such as high clock frequency above 2GHz
and multi-core processor above quad-core are being
used. The cache performance especially affects the
processor performance as the number of cores is
increasing. The easiest way to improve the
performance of cache is to increase its capacity;
however, there are limits to increase the size of cache
due to the limited fabrication process, processor
chipset size, and thermal characteristic. Therefore, we
studied the effect on the processor performance
depending on the line size and associativity of cache
instead of cache capacity. We used the
SimpleScalar3.0 simulator and SPEC CPU2000
benchmarks for our evaluation, and the simulation was
based on the Cortex-A15 specifications. As a result,
average instruction per cycle showed 1.0661 when the
associativity of level-1 cache is increased to 64-way,
which is a 1.19% improvement over the performance
of the existing mobile processor. Among various
factors, associativity tuning of the level-1 cache is the
most efficient means for improving performance.
Memory systems occupy many areas of the

microprocessor die area, and power consumption of the
cache accounts for more than 40% of the overall
processor power consumption [1]. The easiest way to
improve the cache performance is to increase its
capacity. However, an unlimited increase in the cache
capacity is impossible because it affects the processor
die area and power consumption. In this paper we
study the best tuning parameter, other than cache
capacity, that affects the cache performance [2].
2. Experimental Environment
We carried out a simulation based on the
specifications of the ARM Cortex-A15 processor,
which is frequently used in mobile devices [3]. The
basic configuration of the level-2 (L2) cache and level1 (L1) cache of the Cortex-A15 is shown in Table 1.
Table 1: The basic configuration of the Cortex-A15
Capacity
L1 D
32KB
32KB
L2
512KB~4MB
(configurable)
64B
16 way
Line size
64B
64B
Associativity
2 way 2 way
Replacement
LRU
LRU
Random
policy
L1 I : Level-1 Instruction Cache
L1 D : Level-1 Data Cache
L2
: Level-2 Unified Cache
LRU : Least Recently Used
Keywords: mobile processors, cache performance,

cache capacity, set associativity, line size
1. Introduction
The multi-core processor is currently being used in
a variety of computing platforms (e.g., PC, server,
embedded systems). Companies that produce mobile
processors have also released a multi-core processor
used in mobile devices, such as smartphones, tablet
PCs, and digital cameras. Design issues that occur in
mobile processor design are more complicated than
those of the general-purpose processor. Design issues
need to address power consumption and heat
generation from a battery as well as the limited size of
the mobile device.
L1 I
We used the sim-outorder simulator of

SimpleScalar3.0 for the performance evaluation [4].
The benchmark was the SPEC CPU2000, which is
used for general-purpose processor performance
evaluation [5]. This comparison was used because the
processing power of a mobile processor is close to that
of a general-purpose processor. In the simulation, we
selected four integer programs and four floating-point
programs. Each of the eight programs has different
characteristics in access patterns and memory
footprints.
- 274 -
ICEIC 2015
3. Simulation and Analysis

We conducted a simulation while changing the
associativity and line size of the L1 cache and the L2
cache. Since the line size of the L1 cache has to be
equal to or below the line size of the L2 cache, the
experiment was only conducted in these cases. The
evaluation was carried out via the instructions per
cycle (IPC). We calculated the IPC as the average
value of IPCs of the eight benchmarks. The simulation
results are shown in Figure 1.
Figure 1. (a) IPC values with L1 cache associativity

variations. (b) IPC values with L2 cache
associativity variations. (c) IPC values with cache
line size variations. (d) Relative performances.
Figure 1(a) shows the IPC changes when L1 cache
associativity is tuned from direct-mapped to 64-way,
and fully associative. Figure 1(b) shows the IPC
changes when L2 cache associativity is tuned from
direct-mapped to 64-way, and fully associative. Figure
1(c) shows the IPC changes when L1 and L2 cache line
sizes are tuned to all possible combinations from 8B to
512B. The percentage of improvement is shown in
Figure 1(d) relative to the performance of the basic
configuration of Cortex-A15, which is set to 100%.
Figure 1(a) shows that IPC increases until 4-way
associativity, but the rate of the increase is small
thereafter. The IPC increases to 1.0661 when the
associativity of the L1 cache is changed to 64-way.
The increasing rate of the IPC is small overall in
Figure 1(b), and the IPC increases to 1.0631 when the
associativity of the L2 cache is changed to fullyassociative. The increase of the IPC is shown with the
increased L1 cache line size in Figure 1(c), and this
increases with increasing L2 cache line size until 64B,
decreasing thereafter. It increases to 1.0594 when the
L1 and L2 cache line size is changed to 128B. In
Figure 1(d), L1 cache associativity shows the highest
relative change rate.
As a result, we conclude that the L1 cache

associativity change is the most effective parameter in
terms of IPC. Increasing the associativity of the L1
cache is therefore the most efficient way to improve
the IPC when fixing the cache capacity.
4. Conclusion
The size of the cache memory is one of the most
important design constraints in mobile processors.
Therefore, it is not possible to obtain improved
performance with unlimited increases in cache capacity.
In this paper, we conducted a study of an efficient way
to improve the performance with a fixed cache
capacity. By changing the associativity of the L1 cache,
the results showed an improvement of 1.19% in the
IPC compared to the Cortex-A15, which is better than
tuning by the other parameters. Therefore, in order to
improve the performance of the mobile processor with
a size limitation, increasing the associativity of the L1
cache is the most efficient method for improving the
IPC.
In future work we will evaluate the measures of
performance improvement in the mobile processor
when power consumption is also taken into account.
Acknowledgement
This research was supported by the MSIP (Ministry
of Science, ICT and Future Planning), Korea, under the
C-ITRC (Convergence Information Technology
Research Center) support program (NIPA-2014H0401-14-1002) supervised by the NIPA (National IT
Industry Promotion Agency)
References
[1] P. ShivaKumar and N. Jouppi, CACTI 3.0: An
Integrated Cache Timing Power, and Area Model, DEC
Western Research Lab Report 2001/2.
[2] Ma Hai-feng, Yao Nian-min and Fan Hong-bo,
Cache Performance Simulation and Analysis under

SimpleScalar Platform, International Conference on
New Trends in Information and Service Science, pp.
607-612, July 2009.
[3] ARM Cortex-A15, http://www.arm.com/products/
processors/cortex-a/cortex-a15.php
[4] D. C. Burger and Todd M. Austin, The
Simplescalar Tool Set, Version 2.0, UW Madison
Computer Sciences Technical Report #1342, June 1997.
[5] Standard Performance Evaluation Corporation
(SPEC) website, http://www.spec.org/
- 275 -
FO-2-3-4
An Optimization Model For Computer Networks Monitoring

Alquliyev Rasim Mahammad 1, Shikhaliyev Ramiz Huseyn 2, Seung-Woo Seo 3
1. Institute of Information Technology Azerbaijan National Academy of Sciences Baku,
Azerbaijan Republic, rasim@science.az
2. Institute of Information Technology Azerbaijan National Academy of Sciences Baku,
Azerbaijan Republic, ramiz@science.az
3. School of Electrical Engineering and Computer Sciences, Seoul National University
Seoul, Republic of Korea, sseo@snu.ac.kr
Abstract
Optimization model for online monitoring of
computer networks (CN) is proposed. Our main goal
is to optimize the monitoring of CN nodes at given
network resources. To achieve this goal it is
encouraged to use the model of polling system, which
by optimizing can be achieved monitoring time
minimization.
Keywords: computer networks, network monitoring,
network nodes polling, SNMP-polling, polling systems,
polling models, polling discipline, mean waiting time.
the cyclically polls the queue regarding specific

. Thus, a certain time is
discipline
spent for switching server
from the queue
to
, which is called the switching time and is
queue
an independent random variable.
Polling systems is characterized by the processes of
query arrival to the queue, query service and server
switchover between queues and the buffer size and
service discipline [1].
1
1. Introduction
One of the tasks of the computer networks (CN)
monitoring is the obtain characteristics of the network
nodes and communication channels. Thus direct polling
of the CN nodes in real time can be used for this.
Hence, monitoring the CN can be modeled as a polling
system that allow real-time continuously update
monitoring data and to provide their relevance.
Due to propagation of delay when polling of
network nodes (SNMP agents) with monitor and
increasing the total processing time of all queries,
increases the time response of the network control
system for possible emergency and abnormal situations,
which is especially important in large CN. Thus, the
optimization of monitoring is one of the main tasks of
managing the CN.
2. Polling systems
The model shown in figure 1 is the basic standard
polling model. The polling model consists of polling
queue
and one server , which
This work was supported by the Science Development Foundation

under the President of the Republic of Azerbaijan Grant EFRTN-MQM-2/KT-2-2013-7(13)-29/27/1.
Q1
Qi
Q2
Fig.1. A cyclic polling model
3. CN nodes polling model

For CN monitoring a simple abstract model (fig. 2)
is proposed. The proposed model of the polling nodes
of CN is based on SNMP (Simple Network
Management Protocol) protocol is used for this [2, 3].
In this model, the monitor uses SNMP-polling and
MIB-base (Management Information Base) [4] for
obtaining monitoring data from network nodes.
Using this similarity, the polling model of network
nodes by the monitor can be shown as a polling system
(fig. 3).
It is assumed that a single server (monitor)
serves on a cycle queues (nodes)
with
infinite capacity, switching from one queue (node) to
- 276 -
ICEIC 2015
another. We are considering the polling system with
exhaustive discipline service of queues. At that, the
arrival process of queries (monitoring data) is the
independent Poisson process.
monitor
node 1
(MIB-base)
network nodes
node N
(MIB-base)
Fig.2. Abstract model for CN monitoring

The queries arrives to queue
with rate
. The average waiting time of
service of the query in queue
is denoted as
4. CN nodes polling optimization

For optimization of CN nodes polling model, it has
been decided to minimize of the mean waiting time of
queries in queue
in the model considered above. For
this purpose, we use optimal values of the probabilities
obtained in [5] optimal values of the
probabilities
for the polling systems with
exhaustive or gateway service disciplines of queues and
probabilistic discipline with the given by the
minimizing the weighted sum
probability
SNMPpolling
. .
node 2
.
(MIB-base)
and is denoted as
of the mean waiting time of queries in the queue

, where
and the total rate of arrival of queries in

the system is
. The queries arrived to
queue
are called as -class queries and their service
time is an independent random variable with mean
value
and the second moment
The loading of queue

as
is denoted by
and defined
, where
,
where is the set of queue numbers with exhaustive
service discipline.
The optimization problem is as follows:
and total system
load is
. The service time of queue
is
independent and uniformly distributed variable with
with
moments
distribution
function
and Laplace-Stieltjes
transformation
which is a classical problem of nonlinear optimization

with linear constraints. This optimization problem is
solved using Lagrange multiplier method and its
solution has the following form [6]:
(LST))
.
1
2
Q1
Qi
2
where g is a set of queue numbers with gateway

service discipline.
5. Conclusion
Q2
The paper proposes the optimal monitoring model
of CN. For this model polling system is used. The
problem of optimization of process of monitoring was
reduced to a problem of optimization of the polling
model of CN nodes, by minimizing of the mean waiting
time of queries in queue.
Fig. 3. Polling model of network nodes by the monitor

Average time of the cycle which is carried out by
the server, usually, does not depend on the queue
References
- 277 -
ICEIC 2015
[1]
[2]
[3]
[4]
[5]
[6]
Takagi H . (1990) . Queueing analysis of polling models: an

update. In: H. Takagi (ed.), Stochastic Analysis of Computer
and Communication Systems. North-Holland Publ. Cy.,
Amsterdam, pp. 267-318.
Case J., Fedor M., Schostall M., Davin J.: Simple Network
Management Protocol (SNMP), RFC 1157, Network Working
Group, IETF, 1990.
Stallings W., SNMP, SNMPv2, SNMPv3, and RMON 1 and
2, 1996, Addison Wesley
McCloghrie K., and Rose M., Management information base
for network management of TCP/IP-based internets: MIB-II,
RFC 1213, March 1991.
Boxma O. J. Static optimization of queueing systems / Recent
Trends in Optimization Theory and Applications. Ed. Agwal
R.P. Singapore: World Scientific Publ., 1995, pp.1-16.
Boxma O. J., Levy H., and Weststrate J.A. Optimization of
polling systems, In: Perfomence 90, eds. P.J.B. King, I.
Mitrani and R.J. Pooley (North-Holland, Amsterdam) pp. 349361.
- 278 -
FO-2-3-5
WAVELET BASED ADVANCED ENCRYPTION STANDARD ALGORITHM FOR

IMAGE ENCRYPTION
Ajish Sreedharan
Assistant Professor
Department of Computer Science and Engineering
College of Engineering, Perumon
Kollam, India
ajishs2014@gmail.com
AbstractWith the fast evolution of digital data exchange,

security of information has becomes much important in data
storage and transmission. Due to the increasing use of images
in industrial process, it is essential to protect the confidential
image data from unauthorized access. As encryption process
is applied to the whole image in AES, it is difficult to improve
the efficiency. In this paper, wavelet decomposition is used
to concentrate the main information of image to the low
frequency part. Then dynamic S-Box based AES encryption
is applied to the low frequency part. In dynamic chaotic SBox based AES the substitute bytes provide security because
the S-Box is constructed from the key. The high frequency
parts are XORed with the encrypted low frequency part and
a wavelet reconstruction is applied. Theoretical analysis and
experimental results show that the proposed algorithm has
high efficiency, and satisfied security suits for image data
transmission.
Keywords-Discrete Wavelet Transforms, Advanced Encryption Standard, Dynamic S-Box.
I. I NTRODUCTION
With the rapid development of network and through
which information transmission is widely used, the protection of information becomes a crucial issue. Multimedia
information, as an important information carrier, how to
confirm the confidentiality, integrity and usability when
transmitted on the network becomes a research hotspot in
recent years.
Wavelet analysis [1] is a mathematical tool, which
has been developed only in recent decades, but has been
quickly applied to many research areas, such as image processing and audio analysis. Wavelet transform time-domain
and frequency-domain or the space-domain and frequency
domain have a good local optimization features, as well as
the Multi-Resolution Analysis features make wavelet transform suitable for image processing on transform domain.
In this paper,a new image encryption algorithm is
proposed which is based on wavelet transform and AES
algorithm [13]. First of all, wavelet decomposition is used
for concentrating original image in low-frequency wavelet
coefficients, then dynamic S-Box based AES algorithm
[10] is applied to encrypt the low-frequency wavelet coefficients. In dynamic S-Box based AES algorithm [10]
the S-Box is generated from the key by using pairwise
linear chaotic maps. Secondly, an XOR operation is used
for high-frequency wavelet coefficients and the encrypted
low-frequency wavelet coefficients (as a key stream), so that
the image information contained in high-frequency wavelet
coefficients is hidden; Thirdly, a wavelet reconstruction is
used for spreading the encrypted low-frequency part to the
whole image.
II. H AAR -D ISCRETE WAVELET T RANSFORMS
The frequency domain transform applied in this algorithm is Haar-DWT [1], the simplest DWT. A 2-dimensional
Haar-DWT [1] consists of two operations: One is the horizontal operation and the other is the vertical one. Detailed
procedures of a 2-D Haar-DWT [1] are described as follows:
Step 1: At first, scan the pixels from left to right in horizontal
direction. Then, perform the addition and subtraction operations on neighbouring pixels. Store the sum on the left and
the difference on the right as illustrated in Figure 1. Repeat
this operation until all the rows are processed. The pixel
sums represent the low frequency part (denoted as symbol
L) while the pixel differences represent the high frequency
part of the original image (denoted as symbol H).
Figure 1.
The horizontal operation on the first row
Step 2: Secondly, scan the pixels from top to bottom

in vertical direction. Perform the addition and subtraction
- 279 -
ICEIC 2015
operations on neighbouring pixels and then store the sum
on the top and the difference on the bottom as illustrated
in Figure 2. Repeat this operation until all the columns are
processed. Finally we will obtain 4 sub-bands denoted as
LL, HL, LH, and HH respectively. The LL sub-band is the
low frequency portion and hence looks very similar to the
original image.
Figure 2.
The vertical operation
The whole procedure described above is called the first-order

2-D Haar-DWT. The first-order 2-D Haar-DWT applied on
the image Lena is illustrated in Figure 3.
Figure 4.
Description of the AES cryptographic algorithm
based on one-dimensional chaotic maps are used. A piecewise linear chaotic map (PLCM) [10] is given by
x/p 0 x P
(x p)/(1/2 p) p < x 1/2

F (x, p) =
F (1 x, p) 1/2 < x 1
Figure 3. (a) Original image-Lena, (b) Result after the first-order 2-D
Haar-DWT
III. WAVELET BASED AES E NCRYPTION A LGORITHM

The AES algorithm [13] is divided into four different phases, which are executed in a sequential way
forming rounds. The encryption is achieved by passing the
plaintext through an initial round, 9 equal rounds and a
final round. The four phases are SubByte Transformation,
Shiftrows Transformation, Addroundkey Transformation and
Mixcolumns Transformation [13].The structure of AES algorithm [13] is shown in Figure 4.
A. SubByte Transformation
After the wavelet decomposition the maximum value
in each column is 1024. So the S-Box used in AES algorithm cant be used in the Wavelet Based AES Encryption
Algorithm. In the SubByte Transformation dynamic S-Boxes
where 0<p<1/2, x serves as an initial condition, and p is

the control parameter for the map F.
Step 1. Divide the output range [0.1, 0.9] into 1024 intervals
of equal length. During the iteration of the chaotic map, the
output of the PLCM that occurs outside the considered range
will be neglected. This is done to generate more chaotic
numbers, since initial conditions close to 0 and 1 are not
good starting points.
Step 2. Label each region sequentially from 0 to m, where
m is equal to 1023. Let the length of each region be denoted
by L. Let us denote the first region by R0 =[0.1, 0.1+
L], and the last region by Rm =[0.1+mL, 0.1+(m+1)L].
Now, label each region sequentially, that is, R0 0, R1
1, R2 2, and Rm m.
Step 3. Calculate the arbitrary initial condition, IC from the
Key using the logistic maps.
Logistic map:
xn+1 = 1 xn , (0, 2), xn [1, 1]
(1)
Chebyshev map:
- 280 -
xn+1 = cos(kcos1 (xn )), k 2, xn [1, 1]
(2)
ICEIC 2015
The 128 bit key is divided into 4 32-bit unsigned integer
keys: key1, key2, key3, key4. In the initial condition generation process u0 = 1.9999.
x01 = (key0+key1)/(0xffffffff*2)
x02 =(key2+key3)/(0xffffffff*2)
x21 and x22 are calculated after 100 rounds iteration using
Logistic map with the initial value x01 and x02, x2=
(x21+x22)/2. The initial condition IC for the dynamic S-Box
is calculated after 100 rounds iteration using Chebyshev map
with x2 as the initial value.
Step 4. Iterate the PLCM using the initial condition. Whenever the PLCM visits a particular region, store that number
in an array S. If the PLCM has already visited a particular
region, then do not store the assigned number to that region
in the array S.
Step 5. Stop iterating the PLCM when it traverses all regions.
Step 6. Rearrange the array S in the form of a table by filling
rows sequentially.
B. Shift Rows
The ShiftRows step operates on the rows of the state,
it cyclically shifts the bytes in each row by a certain offset
as shown in Figure 5.
D. Add Round Key

In the AddRoundKey step, the sub-key is combined
with the state. For each round, a sub-key is derived from the
main key using AES key schedule, each sub-key is the same
size as the state. The sub-key is added by combining each
byte of the state with the corresponding byte of the sub-key
using bitwise Exclusive OR (XOR).
The inverse add round key transformation is identical
to the forward add round key transformation, because the
XOR operation is its own inverse.
E. Encryption of High-Frequency Wavelet Coefficients
Figure 5.
The Shift Rows transformation
The first row is left unchanged. For the second row, a

1-byte circular left shift is performed. For the third row, a
2-byte circular left shift is performed. For the fourth row, a
3-byte circular left shift is performed. The inverse shift row
transformation, called InvShiftRows, used in the decryption,
performs the circular shifts in the opposite direction for each
of the last three rows, with a one-byte circular right shift for
the second row, and so on.
C. Mix Columns
The forward mix column transformation, called MixColumns, operates on each column individually. Each byte
of a column is mapped into a new value that is a function
of all four bytes in that column. The transformation can be
defined by the following matrix multiplication on State.
The inverse mix column transformation, called InvMixColumns, is defined by the following matrix multiplication
Where the C matrix used in inverse mix column should
be the inverse of A matrix used in forward mix column
transformation. That is, the inverse transformation matrix
times the forward transformation matrix equals the identity
matrix.
The low frequency wavelet co-efficient (LL part)

is encrypted using the modified AES algorithm. The high
frequency wavelet co-efficients (LH,HL,HH) are encrypted
by exoring the high frequency parts with the encrypted low
frequency part. After that a wavelets reconstruction is used
for spreading the encrypted low-frequency part to the whole
image.
IV. P ERFORMANCE A NALYSIS
A. Efficiency
The Wavelet Based AES image encryption algorithm
is tested and evaluated based on software and hardware
simulation. Different standard images have been used lena
and cheetah (greyscale format) in the simulations which
are encrypted with wavelet Based AES and AES algorithms.
Table I shows the average time required by Wavelet Based
AES and AES for each image. From the Table it is clear
that Wavelet Based AES algorithm is much faster than AES
algorithm.
B. Differential Approximation Probability
The non-linear transformation S-box should ideally
have differential uniformity. An input differential xi
should uniquely map to an output differential yi , thereby
- 281 -
ICEIC 2015
Image(Size)
Lena(256*256)
Cheetah(200*320)
AES Encryption
Time
31.75 ms
29.25 ms
Wavelet Based AES

Encryption Time
8.2 ms
7.52 ms
Table I
AVERAGE T IME R EQUIRED BY AES AND WAVELET AES
D IFFERENT I MAGES
Input XORs
Output XORs
151
28
100
100
26
128
146
142
C. Linear Approximation Probability

The linear approximation probability is the maximum
value of the imbalance of an event. The parity of the input
bits selected by the mask dx is equal to the parity of the
output bits selected by the mask dy . According to Matsuis
original definition [12], linear approximation probability (or
probability of bias) of a given S-box is defined as
FOR
190
145
2
232

#x dx = S(x) dy 1

(4)
LP s (dx dy) = max
2n
2
dx,dy6=0
Table II
T YPICAL DIFFERENTIAL THAT OCCURS WITH THE MAXIMUM
PROBABILITY OF 10/256.
ensuring a uniform mapping probability for each i. The

differential approximation probability of a given S-box,
DP s , is a measure for differential uniformity and is defined
as
!
#x X|S(x) S(x + x) = y
s
DP (x y) =
2m
(3)
where X is the set of all possible input values, and 2m is
the number of its elements.
In Figure 6, the distribution of the differentials for the
S-box constructed by On Dynamic chaotic S-BOX is shown,
where the x-axis represents the input differentials x, the
y-axis represents the corresponding output differentials y,
and the z-axis represents the number of occurrences of the
particular input and output differential (x, y). Table
Figure 6.
where d x and d y are input and output masks, respectively;

X is the set of all possible inputs; and 2n is the number
of its elements. However, in [12], an alternative definition
for the calculation of linear approximation probability was
used, which is given hereunder as

#x dx = S(x) dy

LP (dx dy) = max
1 (5)
n1

2
dx,dy6=0
s
where the linear approximation probability is the square of

the maximal imbalance of the event.
D. Histograms of Encrypted Images
To prevent the leakage of information to an opponent,
it is also advantageous if the cipher image bears little
or no statistical similarity to the plain image. An image
histogram illustrates how pixels in an image are distributed
by graphing the number of pixels at each color intensity
level. The histograms of the several encrypted images as
well as its original images that have widely different content
are calculated and analysed. One typical example among
them is shown in Figure 7. The histogram of a plain image
(Lena image (Figure 7a) of size 256x256 pixels) contains
large spikes. The histogram of the cipher image as shown in
Figure 7d, is uniform, significantly different from that of the
original image, and bears no statistical resemblance to the
plain image. It is clear that the histogram of the encrypted
image is fairly uniform and significantly different from the
respective histograms of the original image and hence does
not provide any clue to employ any statistical attack on the
proposed image encryption procedure.
Differential distribution of S-box in Table 1
E. Correlation property Test

I shows those differentials that occur with the maximum
probability of 10/256. The rest of the differentials occur with
a probability of less than 10/256. The maximum differential
probability, DP s , is 12/256 in case of [10]. Also, more
input and output differential pairs occur with the maximum
probability of 10/256 as compared to PLCM S-box.
The following method is used to test the pixel correlation property. First, 1000 couples of pixels are randomly
chosen (horizontally, vertically and diagonally) from the
cipher image. Second, the correlation coefficient of adjacent
pixels of the cipher image obtained using the following
- 282 -
ICEIC 2015
illustrates the statistical properties of original image have
been randomly diffused into cipher image.
V. C ONCLUSION
To improve the efficiency of AES wavelet decomposition is used to concentrate the main information of
image to the low frequency part. Then dynamic S-Box based
AES encryption is applied to the low frequency part. In
Dynamic chaotic S-Box Based AES the Substitute bytes
provide security because the S-Box is constructed from the
key. The high frequency parts are XORed with the encrypted
low frequency part and a wavelet reconstruction is applied.
R EFERENCES
[1] Po-Yueh Chen and Hung-Ju Lin, A DWT Based Approach
for Image Steganography, International Journal of Applied
Science and Engineering.
Figure 7.
Histograms of the plain image and ciphered image
[2] J J Amador and R W Green, Symmetric-Key Block Cipher

for Image and Text Cryptography,
International Journal of
Imaging Systems and Technology, No. 3, 2005, pp. 178-188.
formulas:
[3] Shiguo Lian,Multimedia Content Encryption: Techniques and

Applications, Taylor and Francis Group, LLC, 2009.
xi
(6)
(xi E(x))2
(7)
N
1 X
(xi E(x))(yi E(y))
N i=1
(8)
Con(x, y)
p
D(x) D(y)
(9)
E(x) =
D(x) =
Con(x, y) =
1
N
N
X
1
N
i=1
N
X
i=1
xy = p
[4] R A Mollin,An introduction to cryptography,

Boca Raton FL USA. 2006.
CRC Press
[5] Shujun Li and Guanrong Chen and Xuan Zheng, Chaos-based

encryption for digital images and videos,
chapter 4 in
Multimedia Security Handbook, February 2004.
[6] J Daemen and V Rijmen, The block cipher Rijndael,
Card Research and Applications (2000) 288-296.
Smart
[7] Zhang Y and D Feng, Equivalent generation of the S-box

of Rijndael,
Chinese Journal of Computer, vol.27, no.12,
pp.1593-1600, 2004.
[8] Liu J and B Wei and X Wang, An AES S-box to increase
complexity and cryptographic analysis,
Proc. of the 19th
International Conference on Advances Information Networking
and Application, Taiwan, pp.724-728, 2005.
[9] L Shujun and Z Xuan and M Xuanqin and C Yuanlong,
chaotic encryption scheme for real time digital video, SPIE
vol.4666,p.149-160, Real Time Imaging, March 2002.
[10] Ghada Zaibi and Abdennaceur Kachouri, On Dynamic chaotic
S-BOX, 2009 IEEE
Figure 8.
[11] G Jakimoski and L Kocarev, Chaos and Cryptography: Block

Encryption Ciphers Based on Chaotic Maps,
IEEE Trans.
Circuits Syst. I
Pixel correlation analysis
In which x, y are gray value of two adjacent pixels, xy is

the correlation coefficient. Adjacent pixels of original image
are usually highly correlated, that is, the correlation coefficient is close to 1. Figure 8 shows the results of correlation
property analysis. Ideally, encryption algorithm should make
the adjacent pixels correlation coefficient of cipher image
close to 0, that is, pixels are basically uncorrelated, which
[12] M Matsui, Linear Cryptanalysis Method of DES Cipher,

Advances in Cryptology, Proc. Eurocrypt93, LNCS 765.
[13] William Stallings, Cryptography and Networks Security:
Principles and Practices, Third Edition,
China Publishing
House of Electronics Industry, Beijing.
- 283 -
ICEIC 2015

Oral Session
FO-2-4
Access Networks and Systems II
FO-2-4-1

! #"

! $&% ( #)'"

$
,, , +*

,, " - ,.
,
/110 " *
,, ,, ,2 2

. 43 , . 43 .

( 11 ,
,43 2 "
&#%

('

! " ##
$#
"
""
* $#%('&
)!#+"

#-,.-/.
'$"" # " " !#
$ ! %2013& !

*

# "
")

!#

)

3 $$!!2013"" "
!

" %&
"" ('

# " %4&
"
# # 0
! 65
)#" ##) 3'#
#
3
!

!# # !! # 65

""
# !! %634& -7. ('
"" !#4 "!
653"

$)"#!)

8#
)9
*

#$"+65-:.
3
!
$$$$#$"""

" "
# 3
$ $ !

"
# # "$" $

"
$ $"" ('"
4 "!
)65#
*
!# 653

65
# 634
$ !
)
65; $)#"
)' *
0
$$#

!2013

#)!#
#
#-/."
#
(' $!#
!# )
4 "!653
!#+#8

!!!! )!#

""('

#

(' 4 "
)
$ # ! $#

8 "%122&!650+$5 <

5 )!# # ! 65 %65 &
$$ ")('65
3' # #

) 65
634 )

# $=> )!#3
('#""
"!#

)65%654&)
$ ! 65 654 ) #"

634
"
+'!,-

3
!$$(')
"
"
"
#!"""" ('#

$ ! 654 4 #
65 3

, ! 65
411 )!#
$
./01

./01

/.21

--

. /
1

54 5
,$!

$$
"
"
- 285 -
ICEIC 2015
>>=
! $(%- --

-(4 35%2""" ('
(
('
33% 3$3#&!#!""('
(
)''"('

33"

-)4 35% * 634#('
- + 465% 41224 2224 2054

#+# #
$!#
) 654+$!65
+
('?)4# 654 04!#12242224
+
)'3564)# " 2054
-7465%('#7456445742 65
%45742 !!)122 $# &
4574 54 4 ,
5 /
%,&
5 5

4
4
,
D==

D>=
G==
G>=
@A634# $$ "% 4 &
# "$
"% # $&
- 8 4 3.% 2" # 634 $
) "" 4
!#('

#+# # 33"('6
%/&
6

4
-94 35%'# 4

4

4

4
4
4
%7&
4
-:4 35% $ -8

9#!
""
-;4 35%4#56 !
"
"

%:&
@- .BA!"4" ")

$$ "
; $

65 $
#

" # %3& 5684 )
#$"""3
#" 4

#$"""
"
"
""
('
"#45742 4")
4 122
8 "
%222& # !# )" %205& ! 654

564 !# $
"$ $"3)",
C
"
# "$" 4 # """
#" " *
# $$ 568 %:& 3
! "
$$ # "

"

#;" # # "$" 4 %:&
! $)% -

,
3
#)!('
('$$
""$"#
0
1
"#"
C "$

"
6$F!
2
!
653+$

<
:>=$""
(!#"#)
D,
+ """%:&
>==#%C&E=#%1&
03( (#
'+3$"()
,G:5#FH5
2 AG5
:D5#%C&7=5#%1&
,>#%('&/>#%C65&
,=#%165&
= .1
,=

/ 1!# ! $ !#

)65
7'

5 564
C""
1""
0
$" # "" # "
"#""$""#!

!! !
$$ "
# $
# "$# ##83)"/
#")3'$!->.
/

# !
(')!#
)65

/
$$ "
# %0I,J,=& )
#

%0I=& "

$$ #

)
$!#)
#$""
8'
0
$$ $$ #$"""
"

" "
# !

!

$$ "
#

!!

"#
3
$$ )
6"

! %6 & ! )

#%C201&%/=,: ,>,=,,:GE&

-,.0" 2# " "!#

$ ! # ## #
"9"$$,,>2$/=,:
-/. K
C0C? ) !
# " "!#$!
5":""",/$$,HEH/==,C/=,7
-7.7L1132L 6L:@G, ,

-:.
'(3 '(3 6
->.
- 286 -

FO-2-4-2
Performance Evaluation of Emergency Vehicle Travel Support System

Based on V2V Communications
Hiroaki Minami, Atsushi Kinoshita, Yumi Takaki, Chikara Ohta, and Hisashi Tamaki
Graduate School of System Informatics, Kobe University, Hyogo, Japan
{minami, kinoshita, yumi, ohta, tamaki}@al.cs.kobe-u.ac.jp
Abstract
In this paper, we consider travel support systems
for emergency vehicles (EVs) using vehicle-to-vehicle
(V2V) communications in urban by simulations. The
results show that a simple proximity warning using
V2V lengthens a traveling time of an EV while that
with travel route advertisement shorten the travel time
compared with the conventional scheme using only
siren and light.
Keywords: Emergency Vehicle, V2V Communication
1. Introduction
Among emergency vehicles (EVs), in this paper, we
focus on ambulances because they are more frequently
called than the others. One of the most important issues
in the ambulance operation is to shorten a traveling
time required from ambulance call to an arrival at a
hospital.
There are two reasons to extend the traveling time:
1)
delay for the ordinary vehicles (OVs) to yield
the right-of-way to EVs, and
2)
deceleration of EVs when they enter
intersections without traffic light or those on a
red light
In order to mitigate these problems, there has been a
lot of research on travel support system for EVs
(TSSEV) based on vehicular-to-vehicular (V2V)
communications and/or vehicle-to-roadside (V2R)
communications ([1][3]). These studies on TSSEV
except [2] assess communication level performance
such as packet delivery ratio and delivery delay but do
not system level performance such as traveling time. In
[2], simulation studies are executed to evaluate how
much TSSEV can shorten traveling time in the case of
only straight roads like freeways. It does not, however,
examine the case of urban areas where there are
intersections with traffic lights and obstacles like
buildings, which causes shadowing effect in radio

propagation.
In this paper, we investigate how much TSSEVs
using V2V communications shorten the traveling time
of an ambulance in the case of urban areas.
2. Travel Support for Emergency Vehicle

A legacy travel support for EVs utilizes siren and
light. Instead of them, V2V communications can be
leveraged. In this paper, we consider two types of
TSSEVs using V2V communications: proximity
warning (PW) using V2V (PWV2V) and travel route
advertisement (TRA). We assume that WAVE
(Wireless Access for Vehicular Environment) is used
as V2V communications. In what follows, we also
consider legacy PW by siren and light (PWSL) for
comparison.
PWSL
The drivers of OVs must yield the right-of-way
when approached by an EV whose light and siren
are activated. In our simulation, we assume that
the drivers yield the right-of-way if necessary
when they hear the siren and confirm the position
of EV.
PWV2V
An EV broadcasts PW messages periodically.
Each driver of OVs yields the right-of-way to the
EV after a perceptional and operational delay
depending on its situation when receiving a PW
message from the EV. In this paper, we assume
that PWV2V is implemented in the application
layer based on the Basic Safety Message (BSM).
A BSM message contains safety information
such as a position, a velocity, and a direction of
its source vehicle.
TRA
Traffic accidents often cause traffic jam, which
could result in a delayed arrival of an EV at an
accident scene. In order to alleviate this
undesirable situation, it is effective to restrict
- 287 -
ICEIC 2015
other vehicles to run on a scheduled travel route
of the EV including the accident scene. A way to
do so is for an EV to disseminate its travel route
in a certain area, which we call travel route
advertisement (TRA). In this paper, TRA is
realized using a simple flooding scheme.
Table 1: Simulation settings

Specification
Dimension
Grid
# of EVs
# of OVs
Mobility
# of lanes
Value/Type
1,200 m2
66
1
1,000
IDM
2 (/direction)
Specification
Channel Frequency
Band Width
Transmission Power
MAC/PHY
Path-loss Model
SNR Threshold
Value/Type
5.9 GHz
10 MHz
20dBm
IEEE 802.11p
ITU-R_P.1411
10dBm
3. Simulation Model and Setting

We evaluate the effectiveness of PWV2V and TRA
in terms of system level performance by simulations.
As a simulator, we use Scenargie 1.7 with Multi-Agent
extension [4]. Simulation parameters are shown in
Table 1. In the simulation field shown in Figure 1, a
building stands in every block, and the fire department
and the hospital are set in the upper-right block and the
bottom-left block, respectively. The buildings are
obstacles in terms of radio propagation, so that
shadowing effect is taken into account in the
simulations by using ITU-R_P.1411 as a path-loss
model. A lattice point is an intersection with traffic
lights except four corners, and a street has two lanes
each way. An accident is supposed to occur in the
central intersection.
The mobility of OVs and the EV is governed by
IDM (Intelligent Driver Model) [5]. OVs travel from a
randomly selected building to a randomly selected
building. As soon as the driver arrives at the
destination building, he or she sets a new destination in
random. This is repeated through a simulation trial.
The EV travels from the fire department to the hospital
via the accident scene. The EV can pass through an
intersection while slowing down even on a red light if
no OVs block it.
4. Simulation Results and Conclusions
Figure 1: Simulation field

Table 2: Simulation results
Travel Support
PWSL
PWV2V
PWV2V w/ TRA
Traveling Time (s)

585
645
461
compared to that in the case of PWSL. This is because

surrounding OVs change their routes not to overlap the
EVs route so that congestion is eased.
Through simulation results, we found that PWV2V
suffers from a longer delay than PWSL to utilize only
siren and light due to unexpected traffic jam by OVs.
That is, there is the potential that thoughtlessly earlier
yielding as a result of PWV2V does harm. This result
suggests that not only communication range but also
how neighboring vehicles should react when receiving
PW messages should be designed carefully.
Acknowledgement
We evaluate the effectiveness of TSSEV in terms of

travel time. Traveling time is defined as a period for
the ambulance to travel from the fire department to the
hospital. We conducted simulation in three cases and
the results are shown in Table 2. Each simulation result
is the average value of 10 trials with different initial
placement of OVs. As a reference, we also simulated
the case where an additional OV instead of the EV
travels from the fire department to the hospital in the
same manner as other 1,000 OVs. The resultant travel
time is 809 s.
In the case of only PWV2V, the travel time gets
longer by 60 seconds, i.e. it worsens by 10.3 compared
to that of only PWSL. This is because PWV2V causes
unexpected congestion occurs because OVs start to
yield the right-of-way too early.
On the other hand, in the case of PWV2V with TRA,
the travel time is shortened by 124 seconds, i.e. 21.2%
This work was supported by Kobe University

RCUSS Research Grant and JSPS KAKENHI Grantin-Aid for Scientific Research (C) No. 245000800.
References
[1] A. Buchenscheit, et al., A VANET-based Emergency
Vehicle Warning System, Proc. IEEE VNC 2009, pp. 1-8,
Oct. 2009.
[2] T. Satou and T. Nagaosa, A Study of the Effect an InterVehicle Communication System for Emergency Vehicle
Operation Assist Systems, IEICE Tech. Rep. ITS2009-7, vol.
109, no. 58, pp. 37-42, 2009.
[3] S. Bhosale, et al., Vanet Based Communication for
Emergency Vehicle, Advanced Research in Computer
Science and Electronics Engineering, vol. 2, no. 7, July 2013.
[4] Space-Time Engineering Inc., http://www.spacetimeeng.com/, accessed on Nov. 5, 2014.
[5] T. Martin, et al., Congested Traffic States in Empirical
Observations and Microscopic Simulations, Physical
Review E, vol. 62, no. 2, pp. 1805-1824, Aug. 2000.
- 288 -
FO-2-4-3
Priority Code Scheme for Flexible Scheduling in HTS

Lilian del Consuelo Hernandez Ruiz Gaytan, Jiang Liu, Shigeru Shimamoto
Graduate School of Global Information and Telecommunication Studies (GITS)
Waseda University, Tokyo, Japan
lilianhrg@toki.waseda.jp, liujiang@aoni.waseda.jp, shima@waseda.jp
Abstract
This paper introduces a novel scheme called
Priority Code Scheme (PCS). It is a suitable scheme,
capable to respond users demands, by dynamically
scheduling capacity resources into specific satellite
footprints. Based on users needs, the goal is using PCS
scheme to increase the resource utilization efficiency,
all through the satellite lifetime, by implementing
priority codes at every beam, amongst multiple beams
deployed on High Throughput Satellites (HTS). In
order to measure the advantages of using PCS, it is
intended to compare its performance in terms of
efficiency and capacity. The analysis is conducted
based on hypothetical scenarios.
Keywords: High throughput satellites, efficiency,
scheduling, algorithm and priority codes.
1. Introduction
In order to achieve currently capacity needs, high
throughput satellites (HTS) [1], [2] offer the possibility
to reach large number of users, providing high data
rates at low cost. Lately works [3], [4] have proved
satellite capacity improves as a result of bandwidth
increments and its better management. Getting higher
power levels also helps, but the benefits are not as
good as the ones that can be reached by having better
bandwidth administration. In this context, there are
inherent challenges to set adequacy of bandwidth
capacity. For instance, bandwidth scarcity, large
gateway networks and payload mass footprint. P.
Inigo, et al., [4] well summarize the currently high
throughput satellite situation, providing solutions and
proposals for several facing issues. On the other hand,
researches have improved scheduling process by using
various techniques, such as frequency reuse and beam
hopping [5], [6] in order to reach higher bandwidth
capacities. J. Anzalchi, et al., [5] analyze the beam
hopping technique by comparison to the fixed capacity
allocation networks. Additionally, T. Pecorella, et al.,

[6] present the analysis of combining two techniques switching and beam hopping- to reach the targeted
capacity.
In contrast, the present paper describes a flexible
and adaptable scheme that responds user consumption
habits during the satellite lifetime. The key point is that
Priority Code Scheme (PCS) takes the full advantage
of the already given capacity, by allocating free
bandwidth blocks at every beam according to the
payload mass. The bandwidth allocation is done based
on the under/overloaded events and the priority codes,
which match to the payload mass. Therefore, it is
important to establish bandwidth thresholds to identify
beams that have under/overloaded bandwidth.
The analysis employs the Shannons Channel
Coding Theorem [7] into a hypothetical scenario,
which is assumed as case study. The manuscript
consists of section 2, which describes the priority code
scheme; section 3 to include the mathematic results
and their corresponding evaluation; and section 4 for
concluding the paper, standing out the benefits of using
priority code scheme and future works.
2. Scheme Description and Analysis

The priority code scheme is based on the idea of
increasing capacity in those areas with high demand of
resources, and at the same time, minimizing the
amount of resources dedicated to low loaded regions.
The goal is to reduce the under and overloaded events
inside specific satellite footprints. To do so, there are
some steps to follow and requirements to comply. To
start explaining the PCS process, it is summarized step
by step. Step 1: HTS satellite must be capable to learn
by itself the capacity bandwidth needs by monitoring
the efficiency performance in each beam of the
satellite. Step 2: Based on the results, an analysis is
carried out to find out the beams with
- 289 -
ICEIC 2015
under/overloaded resources. Step 3: HTS provides a
priority code at each beam, adjusting the level of
loading resources. Step 4: HTS deploys a new amount
of resources at each beam, and measures again the
efficiency.
The scheme performs a cyclical repetition of step 1,
2, 3, and 4, by grouping those steps into two modules:
the algorithm and the operative module. The algorithm
module has several tasks; such as step up efficiency
thresholds in order to estimate under/overload
bandwidth capacity, establish monitoring concurrency
and define the priority codes. The operative module is
in charge to reassign capacity based on the algorithm
output. Fig. 1 describes PCS modules. It is assumed
PCS takes part of the TTC&M (Telemetry, Tracking,
Command and Monitoring) satellite subsystem.
more bandwidth to be able to satisfy its footprint real

capacity requirements. The priority code also
increases. Finally, the third case takes place when
bandwidth is overloaded. The beam efficiency tends to
be equal 0. The beam must release part of its
bandwidth as much as it satisfies its currently
necessities without implicating unused bandwidth. The
priority code decreases as well in order to match the
new bandwidth assignation. Refer fig. 2 to see the flow
chart of PCS algorithm. On the other hand, fig. 3
illustrates the algorithm scenarios.
Figure 1. Priority code scheme modules.

PCS algorithm process starts from the assumption
that all beams have same capacity assignation at the
beginning, because at time t0, there is none record
about utilization and beam efficiency. At time t0, all
beams receive the same priority code as well. This
priority code is the one which corresponds to the
medium demand payload mass. It is important to
mention that the first priority code and bandwidth
assignation values are just part of the initial
assumptions. Once initial assignations have been set,
the monitoring process takes part to get the parameter
information related to each beam into the satellite
system. The parameter information can be categorized
into three possible cases: accurate bandwidth
allocation, under loaded bandwidth allocation and
overloaded bandwidth allocation.
The first case describes the situation when the beam
has optimal efficiency; as a result, it is not necessary to
do any bandwidth adjustment. The priority code also
remains without changes. The second case represents
the situation when the capacity beam is under loaded,
which means its efficiency tends to be equal 1 due to
the payload mass is reaching the maximum bandwidth
capacity. To solve this issue, the beam must allocate
Figure 2. PSC algorithm.
Figure 3. Algorithm scenario using PCS.

To provide the whole scheme understanding, it is
necessary to define some terms, such as efficiency,
efficiency threshold, under and overloaded. Efficiency
is defined as the ratio between bandwidth utilization
and beam capacity. In order to accurately assign beam
- 290 -
ICEIC 2015
capacity, it is important to set up an efficiency
threshold to each beam. With this on mind, it is
considered that = 0.8 0.05 assures accurate
capacity assignment. For < 0.8 the beam capacity is
overloaded, and under loaded if equals 1. In contrast
to overloading, under loading is difficult to detect,
because it is not possible to measure utilization of the
unallocated bandwidth. Therefore, it is assumed that
equals 1, or any close approximation, refers to an under
loading scenario. PCS matchs the efficiency values
with the priority codes in order to determine which
beams require more attention than others. This allows
to offer faster adjustement in higher demand beams
than beams with little demand. Beams with at least
60% of efficiency are considered as high demand
beams, and receive priority code 4. Medium demand
beams have at least 25% of efficiency with priority
code 3. Table 1 summarizes other beam classifications
and their corresponding priority codes.
Based on the latest efficieny ratio values, beams
receive new priority codes. Regarding monitoring
concurrency, PCS algorithm is a short-term scheduling
algorithm; then the monitoring concurrency is very low.
In order to find out the most suitable concurrency
performance, concurrency parameter is set with
different values starting from 10 to 30 ms. However,
the analysis of optimal concurrency time is not
included in this paper. This study will be covered in
future works.
Table 1: Priority codes based on efficiency ratio.
Demand
Priority Code
High
Medium
Low
Little
4
3
2
1
Efficiency
[%]
60
25
10
5
the distance between transmitter and receiver,

represents the wavelength, KB is the Boltzmanns
constant, TSYST the system noise temperature and I
means the interference.
3. Numerical Results
The evaluation considers a DVB-S2 air interface
using Ka-Band frequencies, from 19.7 to 22.2 GHz.
The analysis only involves the forward link because it
is the link that goes from HTS in direction to final
users. The theoretical scenario refers to ten beams
(Bw1, Bw2, Bw3, , Bw9, Bw10) sharing the total
bandwidth of 500 MHz. This bandwidth is divided in
blocks of 100 kHz; therefore, the total number of
available bandwidth blocks is 5000. If the system
considers an equal bandwidth block distribution, every
beam receives 500 bandwidth blocks. For this situation,
scheduling does not take care of user needs, because
the bandwidth capacity is equally shared by all beams.
As a consequence, the presence of under and
overloading scenarios is inevitable without chance to
reverse their effects. In contrast, PCS fairly shares the
bandwidth blocks amongst beams. Beams with higher
priority code, need more capacity and as a result,
receive more bandwidth blocks than beams with lower
priorities. Inversely, beams with low bandwidth
requirements have less number of capacity blocks
assigned. This idea allows PCS to reserve unused
bandwidth to be reassigned later in case an specific
beam asks for it. To facilitate the calculations, it is
assumed that the distribution of capacity needs follows
a pseudo random pattern.
For the evalutions, eq. 1 and 2 are used considering
the following parameter values. PTWTA and I are both
set at 30 dB, GTX and GRX are equal to 19 dB, d is set at
800 km, TSYST is assumed at 500 K and the efficiency
threshold equals 0.8. The results are inset in fig. 4.
To analyze the PCS performance, Shannons

Channel Coding Theorem [7] is applied to calculate the
maximum capacity at each beam. The mathematical
expressions are denoted by eq. 1 and 2.
C = BW log2 [1+(S/(N+I)]
S/(N+I) = PTWTA GTX GRX /(4d/)2 KBTSYST BW I
(1)
(2)
Where BW stands for bandwidth, S/(N+I) is the

signal-to-noise radio plus interference, PTWTA is the
payload on the space craft, GTX and GRX are the antenna
gain at the transmitter and receiver respectively, d is
- 291 -
Figure 4. PCS scenario employing 10 Beams.
ICEIC 2015
Observing fig. 4, it is proved that PCS is a
successfull scheme. Due to all beams have different
capacity needs, PCS successfully allocates different
amount of bandwidth blocks at each beam. Despite the
unequal bandwidth distribution, PCS respects the total
available bandwidth of 500 MHz.
beam increases, but even though a HTS has few

number of beams, the efficiency percentage is higher
than 65%.
The doted vertical lines represent the fixed capacity

bandwidth allocation case. The bars represent the PCS
performance. The PCS allocated capacity is illustrated
in the bottom part of the bars, and the available
capacity in the top side. Each bar in the figure
corresponds to a particular beam in the system
configuration. At first sight, this illustration helps to
identify PSC successfully avoids under loaded events,
like the ones performed by Bw4, Bw8 and Bw9; and
overloaded cases shown in Bw1, Bw3, Bw5, Bw6 and
Bw7. Fig. 5 illustrates the case when the HTS has a
twenty five beam configuration. Generally speaking,
both plots suggest PCS offers good performance for
different number of beams. It is also proved that PCS
is capable to adjust the bandwidth allocation as a
function of the number of beams and payload mass
requirements.
Figure 6. PCS capacity performance.
Figure 7. PCS efficiency performance.
Figure 5. PCS scenario employing 25 Beams.

Fig. 6 and 7 show the PCS performance in terms of
bandwidth utilization and efficiency, respectively. To
measure the effects of changing the number of beams
in a multiple beam environment, the number of beams
is increased from 5 to 100. The efficiency threshold is
set at 0.8. Fig. 6 shows that the bandwidth utilization is
inversely proportional to available bandwidth.
According to our theoretical scenario characteristics,
PCS reaches its best performance when the system has
deployed ten multiple beams. In contrast, fig. 7 shows
PCS efficiency percentage. The percentage has
variations from 68% to 96%, corresponding to 5 beams
and 100 beams, respectively. In terms of efficiency,
PCS has better behavior as much as the number of
Until now, efficiency threshold has been set as a

constant feature in the system. However, to see the
PCS performance as a function of efficiency thresholds,
the system is evaluated once more with different
efficiency thresholds. The efficiency threshold values
are set at 0.6, 0.7, 0.8, and 0.9. Threshold performance
effects are plot in fig. 8 and 9. Fig. 8 shows the
capacity performance has similar tendencies despite
the variations in the threshold values. In all cases, the
optimal performance is reached when the multi beam
deployment, is around ten beams. For instance, in cases
where efficiency threshold equals 0.6, the optimal
performance is gotten when the satellite has twelve
beams. For efficiency threshold equals 0.7, its optimal
performance is reached at eigth beams. Finally, for
efficiency thresholds equal 0.8 and 0.9, the best
performance is gotten when the multi beam
configuration has ten beams. Therefore, the optimal
performance is reached between eight and twelve
- 292 -
ICEIC 2015
beams. As a complementary result, fig. 9 illustrates the
efficiency performance as a result of threshold
variations. In fig. 9, it is observed that the efficiency
percentage proportionally increases as much as
efficiency threshold value increas. The reason is that
for higher thresholds, the PCS is more restrictive, and
as a result, the system improves its efficiency.
order to measure PCS effectiveness, it is important to

compare PSC performance with other scheduling
techniques, such as beam hopping technique.
Acknowledgements
Authors want to thank The Ministry of Education,
Culture, Sports, Science and Technology in Japan
(MEXT) for its financial support along this research.
References
[1] H. Fenech, A. Tomassi, S. Amos and V.
Soumpholphakdy, KA-SAT and Future HTS systems, 14th
International Vacuum Electronics Conference (IVEC), IEEE,
May 2013.
[2] O. Vidal, G. Verelst, J. Lacan, E. Alberty, J. Radzik and
M. Bousquet, Next Generation High Throughput Satellite
System, First AESS European Conference on Satellite
Telecommunications (ESTEL), IEEE, October 2012.
[3] D. Serrano-Velarde, E. Lance, H. Fenech
Guisantes, A Novel Dimensioning Method
Throughput Satellite Design, First AESS
Conference on Satellite Telecommunications
IEEE, October 2012.
Figure 8. PCS capacity performance for different

thresholds.
and G. RFor High

European
(ESTEL),
[4] P. Inigo, O. Vidal, B. Roy, E. Alberty, N. Metzger, J.

Anzalchi, G. Huggins and S. Stirland, Review of Terabit/s
Satellite, The Next Generation of HTS Systems, 7th
Advanced Satellite Multimedia Systems Conference
(ASMSC) and 13th International Workshop on Signal
Processing for Space Communications (IWSPSC), pp. 318
322, September 2014.
[5] J. Anzalchi, A. Couchman, P. Gabellini, G. Gallinaro, L.
DAgristina, N. Alagha, and P. Angeleti, Beam Hopping in
Multi-beam Broadband Satellite Systems: System Simulation
and Performance Comparison with Non-Hopped Systems,
5th ASMSC and 11th IWSPSC, pp. 248 255, September
2010.
Figure 9. PCS efficiency performance for different

thresholds.
4. Conclusions
PCS offers advantages in terms on capacity
allocation. The interesting point is PCS algorithm
allows to successfully allocate bandwidth resources,
based on user demands. This point is very important
because in real situations, the network capacity needs
follow an unstable pattern due to the dynamic behavior
of user demands. As future work, it is intended to
compare PCS scheme performance increasing the
number of priority codes and determining the most
suitable monitoring concurrency. On the other hand, in
[6] T. Pecorella, R. Fantacci, C. Lasagni, L. Rosati and P.

Torodova, Study and Implementation of Switching and
Beam-Hopping Techniques in Satellites with On Board
Processing, International Workshop on Satellite and Space
Communications (IWSSC), pp. 206 210, September 2014.
[7] H. Fenech, A. Tomassi, S. Amos, V. Soumpholphakdy
and D. Serrano-Velarde, Future High Throughput Satellite
Systems, First AESS European Conference on Satellite
Telecommunications (ESTEL), IEEE, October 2012.
- 293 -
FO-2-4-4
Characteristics of Asymmetry and Symmetry Curved Slab Waveguide

Indah Juningtiaz Devayani1, Ary Syahriar2
Electrical Engineering, University of Al Azhar Indonesia
indah.juningtiaz@gmail.com1, ary@uai.ac.id2
Abstract
There are two structures of slab waveguide;
asymmetry and symmetry slab waveguide. Both
structures have differences on its propagation
properties, one of them is curved loss of slab
waveguide. We will analyze the characteristics of
curved loss between both structure and compare the
results to obtain which structure is lossy. From the
simulation results, the curved loss at symmetry slab
waveguide structure is higher than asymmetry with the
same parameters. To get the lower curved loss we use
asymmetry slab waveguide with the minimum radius of
curvature (r) is > 3mm. And for symmetry slab
waveguide, we use the minimum (r) is > 4mm.
Keywords: curved loss, asymmetry slab waveguide,
symmetry slab waveguide, radius of curvature.
1. Introduction
The curved waveguide is important to connecting
optical components, but it can cause a high loss in the
transmission.
Figure 1. is a geometry structure of curved

waveguide, with n1 is refractive index of core, n2, n3 is
refractive index of cladding, r is radius of curvature,
and is phase of curve. There are several solution to
minimize the curved loss on slab waveguide, one of
them is changing the slab waveguide structure. We use
two different curved slab waveguide structures
(asymmetry and symmetry) to find the loss with
analytical theory and compare the value of curved loss
obtained.
2. Theory
The planar waveguide structure consists of three
layers; cladding, core, and cladding. The core is
dielectric medium where the light is propagate, where
the cladding is dielectric medium that keep the light
stay propagate in the core. Asymmetry slab waveguide
is a general structure in slab waveguide. The difference
between asymmetry and symmetry is the refractive
index of cladding. In asymmetry, the value of n1 > n2 >
n3, and at symmetry is n1 > (n2 = n3). The boundary
condition is 0 < x < h for the core. For the structure, the
boundary condition for TE mode solution is,
1
2 x h
xh
cos kx sin x e
cos kx sin x 0 x h
(1)
e 1 x x 0
x h
xh
cos h sin h e
cos x sin x 0 x h
(2)
e x x 0
Figure 1. Curved waveguide geometry
The equation (1) is boundary condition of

asymmetry and equation (2) is symmetry. Where, is
propagation constant in core, is propagation constant
in cladding, and h is width of core. From the boundary
- 294 -
ICEIC 2015
condition at asymmetry and symmetry slab waveguide

the comparison of TE mode with h = 7 m in figure 2.
below,
Figure 3. The curve loss using several value of n at

asymmetrical slab waveguide (n1=1.465)
Figure 2. Comparisons TE mode asymmetry and
symmetry
Then, we can calculate the curved loss at both slab
waveguide structure. The equation is,
loss 10log10 exp( s) (dB)
(3)
Where is the coefficient attenuation, and the

value is: C1eC2 r . C1 and C2 is the parameters that
not affected by the radius of curvature. We use Lees
equation to find the value of C1 and C2,
C1
2 2
h
cos2 ( )e h
ko n2 ( h 2)
2
C2
2 (neff n2 )
n2
(4)
(5)
And s is the curved length of the bend.
For the simulation, the width of core is 7 m,
wavelength is 1.550 m, radius of curvature is 1-6 mm,
phase 40o. Then, using equation (3), the result of
curved loss asymmetry and symmetry slab waveguide
is,
Figure 4. The curve loss using different value of n at

symmetrical slab waveguide (n1=1.465)
Figure 3. shows the the curved loss is always
decreased by increased the value of n. The maximum
loss occur at 1000 m radius of curvature, at n=0.007
the loss is 11.07 dB, at n=0.008 the loss is 6.18 dB,
and at n=0.009 the loss is 2.82 dB. At n=0.007, the
lowest curved loss occur at radius curvature 2800 m,
n=0.008 at 2250 m, and n=0.009 at 1800 m. On
smaller the radius of curvature, loss become higher
than at the longer radius of curvature.
Figure 4. shows the maximum loss occur at 1000
m radius of curvature, at n=0.005 the loss is 12.70
dB, at n=0.006 the loss is 7.35 dB, and at n=0.007
the loss is 3.68 dB. At n=0.005, the lowest curved
loss occur at radius curvature 4900 m, n=0.006 at
3500 m, and n=0.007 at 2600 m.
- 295 -
ICEIC 2015
Figure 5. The comparison curve loss at asymmetry and

symmetry slab waveguide
Figure 5. shows the comparison characteristics
curved loss at the same parameters, in asymmetry is
occur at the range value radius of curvature (r) is 12.85 mm, symmetry slab at the range (r) is 1-4.45 mm.
4. Conclusions
The curved loss of asymmetry is lower than
symmetry slab waveguide at the same parameters. It
can occur because in asymmetry the value refractive
index of cladding n3 is smaller than n2. To get the lower
curved loss we use asymmetry slab waveguide with
minimum radius of (r) is > 3mm. And for symmetry
slab waveguide, we use the minimum (r) is > 4mm.
References
[1] L. Lee, Donald. Electromagnetic Principles of Integrated
Optics. Florida, USA. John Wiley & Sons, 1986.
[2] E.A.J. Marcatili, Bends in optical dielectric guides,
Bell Syst. Tech. J., volume.48, 2103-2132, 1969.
[3] Syahriar, A. The method of lines analysis of asymmetric
optical waveguide, Universitas Gunadarma. 2000.
[4] R.Baets, P.E. Lagasse, Loss calculation and design of
arbitrarily curved integrated-optic waveguides, J. Opt. Soc.
Amer., vol.73, 177-182, 1983.
[5] W. J. Minford, S. K. Korotky, R. D. Alferness, Low-loss
Ti:LiNbO3 waveguide bends at =1.3 m, IEEE J. Quantum
Electron.,vol. QE-18, 1802-1806, 1982.
- 296 -
FO-2-4-5
Generation of Discrete Multi-Tone Channel Using HNLF

M. Irfan Anis
Iqra University, Defence View, Shaheed-e-Millat Road, Karachi-75500, Pakistan
Email: mirfananis@yahoo.com
Abstract
2. Experimental Setup and Results
Experimental demonstration of a novel technique to

generate high-speed DMT 555G channel using supercontinuum generation from 10G pulse harmonics and
frequency to time transformation in a HNLF. The
result shows BER below 10-4, which is a comfortable
margin to the FEC limit of 2x10-3.
Keywords: Discrete Multi-Tone, High Non Linear
Fibre, Mode Locked Laser, Self-Phase Modulation,
Super-Continuum.
Fig.1 : 555Gb/s Experimental Setup
1. Introduction
The growth in the internet is provisioning additional
bandwidth scale without increasing capex/opex
complexity [1]. One way of overcoming this limitation
is using super-channel. Moreover, super-channels
address the fundamental issue of supporting the future
generation of high speed services. This paper presents
generation of 555Gb/s signal using super-continuum
generation in dispersive material (HNLF). The
advantage of using HNLF as a nonlinear switching
medium owing to the ultrafast fibre response time [2].
Further, HNLF length can be significantly shorter and
less switching power is required compared to
dispersion shift fibre, which in general leads to more
robust switching. Several super-continuum generation
experiments with Er-doped fiber laser of hybrid modelocking [3], sub-megahertz repetition rate femtosecond
pulses based on nonlinear polarization rotation
technique [4], mode locked bismuth oxide based
erbium doped fiber laser [5] have been reported.
In this paper, a novel technique to generate a 555
Gb/s discrete multi-tone (DMT) channel is proposed
and experimentally demonstrated. The paper is
organised as follows. Section 2 introduces the
experimental setup and results, demonstrate generation
of the high speed channel using HNLF. Finally, Section
3 summarizes the work.
Fig 1 illustrates the technique proposed and

implemented for generating the 555Gb/s signal. First, a
semiconductor MLL is used to generate a 2-ps pulse
train with a repetition rate of 10.675 GHz and a power
of -6 dBm. The spectrum is displayed in Fig. 2a and its
signal in Fig. 3a. This signal is then amplified to 16
dBm and input to super-continuum generation in a 220
m-long HNLF with non-linear coefficient of 10
1/W*km, Aeff = 10.3m, zero dispersion wavelength
of 1550 nm and 0.03 ps/nm/km dispersion slope. Due
to the HNLF non-linearity, self-phase modulation
affects the signal widening its spectrum and shortening
the pulse duration, as shown in Fig. 2b and 3b
respectively. Next, a 4.5-nm at-top band-pass filter is
used to select 52 frequency components from the
resulting signal so that the maximum peak-to-peak
power difference of the selected frequency components
is 3 dB, Fig. 2c and 3c. Then, the signal is passed
through a dispersive medium to perform frequencytime transformation. Here standard single mode fibre
(SSMF) of approximate length 16.7 km to introduce
274.23-ps/nm so that a 23.4-ps delay is observed
between adjacent subcarriers, as shown in Fig. 3d.
Moreover, the separation between adjacent pulses is
now 23.4 ps rather than the original 93.67 ps.
- 297 -
ICEIC 2015
Fig.4 : (a) Pulse shape at input of dispersive medium, (b)

Pulse shape after propagating 16.7 km through
dispersive medium (SSMF)
Finally, the signal is IM (Intensity Modulated) in a

LiNbO3 MZM (LiNbO3 Mach-Zehnder Modulator)
with a 42.7 Gb/s signal, which is composed of four
electrically multiplexed pseudo-random bit sequences
(PRBS) of length 27-1, 29-1, 210-1 and 211-1, at 10.675
Gb/s each. Thus, have different PRBS of modulated
adjacent sub-carriers. Fig. 2d.
-20
-2
FEC Limit 10
As the signal's frequency components travel along

the dispersive medium at different group velocities, it is
possible to separate all the frequency components of
the periodic signal into four groups. The frequency
components in each group constructively interfere to
form new pulses at different time instances, i.e.
different delays. For instance, a single pulse at the input
of the dispersive medium, Fig. 4a, becomes four pulses
at a length of 16.7 km, Fig. 4b, i.e. the pulse rate is
quadrupled. However, each of the four pulses is made
up of different frequency components, a subset of the
frequency components of the original pulse.
10-3
10-4
-40
10-5
BER
Intensity [dBm]
Fig.2 : Spectrum : (a) MLL to generate a 2-ps pulse train,

(b) Spectrum widened after HNLF , (c) After filter , (d) at
MZM
10-6
10-7
-60
1548
1549
1550
1551
1552
1553
1554
Wavelength [nm]
Figure 5: Bit Error Rate with 555 Gb/s signal

Fig. 5 shows the spectrum of the 555 Gb/s signal
and the end-to-end performance shows BER below 10-4,
which is a comfortable margin to the FEC limit of
2x10-3.
3. Conclusion
A novel technique to generate a 555 Gb/s highspeed DMT channel using super-continuum generation
followed by frequency-to-time transformation in a
dispersive medium. This demonstration offers a
potential for future super-channel in the exgrid
networking eld trial.
References
Fig.3 : Signal at: (a) MLL, (b) after HNLF , (c) Band Pass
Filter , (d) Different PRBS with Modulated Adjacent SubCarriers
[1] W. Liu, OFC, M3B.3, March, 2014.

[2] E.J.M. Verdurmen et al., Electrons Letter, Vol. 41, 2005.
[3] S Kim et al., Optics Letters, Vol. 39, 2014.
[4] H. Ahmada et al.,Journal of Modern Optics, Vol 61,
2014.
[5] M.R.A. Moghaddam et al., Laser Physics Letters, Vol 8,
2011.
- 298 -
FO-2-4-6
Dynamic Interference Forwarding in Interference

Limited Cellular Networks
Jun-pyo Hong, Hojin Song, and Wan Choi
Dept. of EE, KAIST, Daejeon, 305-701, Korea
Email: {jp hong, hojinsong}@kaist.ac.kr, wchoi@kaist.edu
AbstractWe consider downlink relay communications in a
greedy cellular network where each base station (BS) does not
only cooperate with other BSs but also care about its interference
to neighboring cells. Contrary to the conventional relay strategies,
we show that forwarding interference through relay can rather
improve achievable data rate in some scenarios. Our analysis of
achievable rate identies the gains of interference forwarding over
conventional relaying schemes and presents preferred scenarios
for interference forwarding. Because the proposed interference
forwarding does not change operations at BSs, it can be easily
applicable to legacy cellular networks.
I. I NTRODUCTION
Relay communications where a relay node helps communications between source and destination have been extensively
studied since the monumental work of [1]. Although the
capacity of a relay channel is not exactly identied yet, it is
well known that relay nodes are able to improve not only data
rate but also reliability of communications. Specically, under
the random fading environments, several signal forwarding
strategies were proposed in [4], [5], [6], and their performance
enhancements, mainly coming from diversity gains, were analyzed. Eventually, in an isolated source to destination link,
relaying the desired signal to destination reinforces the received
signal strength at destination and thus improves achievable data
rate.
However, in wireless networks consisting of multiple sourcedestination pairs, interference from other transmitters is inevitable if they share time and frequency resources in the
same signal space. Therefore, transmission strategies and the
ways of utilizing relays in an interference limited environment
can be signicantly different from those of an isolated source
to destination link. Recently, there have been some pioneering works on relay communications in interference limited
environments, so called an interference channel with a relay
(ICR). The model of ICR where two independent sourcedestination pairs are assisted by a relay was rstly considered
in [7]. Achievable sum rate by rate splitting at each source
was analyzed for a symmetric Gaussian channel in [8]. In [9],
[10], [11], an interference channel (IC) assisted by a cognitive
relay which has non-causal message information of two sources
was studied. Especially, [12], [13], [14] showed that relaying
interference message to destination can be benecial in improving achievable rate when the relay is connected to only
one of sources and links from other sources are blocked. It is
interesting to note that the concept of interference forwarding
(IF) is completely opposite to that in conventional relaying
even though the relay in the scenarios of previous studies has
no alternative but forwarding interference messages.
Fig. 1.
Relay communications in interference limited environments
The previous studies on relay communications in interference limited environments mostly focused on the model of
ICR from an information theoretic viewpoint and analyzed
the achievable rate region of two mutually interfering sourcedestination pairs. Furthermore, they require some levels of
coordination between two sources to mitigate the perceived interference at destinations. However, considering cost and complexity of coordination among sources, the previous approaches
are hard to implement in conventional cellular networks where
BSs greedily communicate with their own mobile stations
(MSs) and do not cooperate. In this context, we investigate
gains of interference forwarding by relay in a greedy cellular
network where each source tries to maximize its rate without
considering its inuence on other communication pairs. Our
model is fundamentally different from ICR but much more
practical because sources do not care about their interference
to unwanted destinations and correspondingly complicated
transmission schemes such as rate splitting are not required.
Similarly to our network model, a conventional relay channel
with an additional source of interference has been analyzed in
[15], called relay-interference channel (RIC). It was shown that
forwarding interferers signal at relay cannot provide gains if
the relay has a block delay so that the transmit codewords of
relay and interferer are blockwise independent. To reduce the
independency and the duplex loss in half duplex relaying, we
propose dynamic interference forwarding scheme (DIF) that
is an extension of IF to the half duplex relay with variable
slot length. Eventually, we present scenarios where forwarding
interference signal is better than forwarding the desired signal
and analyze gains of DIF in our practical cellular network.
- 299 -
ICEIC 2015
at the two destinations and relay can be represented as

Y1 (n) = 1,1 ej1,1 X1 (n)+ 2,1 ej2,1 X2 (n)+N1 (n), (2)

(3)
Y2 (n) = 2,2 ej2,2 X2 (n) + N2 ,

Y3 (n) = 1,3 ej1,3 X1 (n)+ 2,3 ej2,3 X2 (n)+N3 (n). (4)
Fig. 2.
For n = N Np , N Np + 1, ..., N , the received signals at

the two destinations are given by

Y1 (n) = 1,1 ej1,1 X1 (n) + 2,1 ej2,1 X2 (n)

+ 3,1 ej3,1 X3 (n) + N1 (n), (5)

(6)
Y2 (n) = 2,2 ej2,2 X2 (n) + N2 (n).
Channel allocations for direct transmission, DDF, and DIF
II. S YSTEM MODEL

We consider a two-hop half-duplex relaying system in a twocell network, where the reception of signal is signicantly interfered by the transmission of an adjacent cell. As shown in Fig.
1, the system consists of two independent source-destination
pairs and a half duplex relay. The two communication pairs
and the relay are indexed by 1, 2, and 3, respectively. We
assume that the two sources and relay use the same frequency
band. The destination associated with cell-1, D1 , and the relay
are located between the two sources so that they receive
not only the desired signal transmitted from S1 but also the
signal transmitted from a interferer S2 . On the other hand,
the destination in cell-2, D2 , cannot hear the signals from S1
and the relay because the received signal strength is negligible
due to the attenuation by long distance propagation from S1
and the relay to D2 . In other words, from the viewpoint of
cell-2, their communication can be considered as a simple
point to point direct communication in an interference free
environment. Therefore, the source S2 concentrates only on its
direct transmission not concerning about the interference from
S1 as well as the operations of the relay. Pi,s and Pr denote
the transmit power of Si and the relay, respectively.
In our system model, the codeword transmitted from Si is
encoded by a rate compatible punctured convolutional code
(RCPC) for an overall rate Ri with N symbols. The length
of a codeword N is assumed to be large enough to obtain
continuous and compatible rate of the code. The condition for
correct decoding at a receiver is given by
N Ri
= Ri,p I,
N Np
(1)
where Np is the number of punctured symbols, Ri,p is the rate

of a punctured codeword, and I is channel capacity. From (1), it
is indicated that a receiver can decode an overall codeword by
listening to N Np NIRi symbols even if it does not listen to
the rest Np symbols as long as the punctured rate Ri,p exceeds
channel capacity I. Specically, in relay communications, the
spectral efciency loss arising from repeated transmission of
the received signal at relay can be reduced through RCPC
which enables a relay to decode a complete codeword without
listening over the whole codeword in the listening period.
For symbol time n = 1, 2, ..., N Np , the received signals
where Xi and Yi are the transmitted signal from a transmit

node indexed by i and the received signal from a receive node
indexed by i, respectively. The additive noise at a receive
node with index i, Ni , is assumed to follow a circularly
symmetric complex Gaussian distribution with zero mean and
unit variance. ik and ik are the channel power gain and
channel phase of the link from the transmit node i to the receive
node k, respectively. It is assumed that the both sources have
global channel state information (CSI), while the relay and two
destinations know only channel state information at the receiver
(CSIR). The relay and destinations obtain the CSIR through
periodic sounding of a pilot signal and then they send the
obtained CSI to the sources via dedicated feedback channels.
The global CSI at sources is attained in this way.
III. ACHIEVABLE R ATES
Contrary to previous research on interference channel with
a relay (ICR), we focus on only relay operations for D1 and
corresponding achievable rates R1 instead of the rate region for
both R1 and R2 because, in our system model, the rate and
the transmission strategy of S2 is not affected by any other
terminals. Accordingly, the rate of S2 is easily obtained by
R2 = log2 (1 + 22 P2,s ).
(7)
Fig. 2 illustrates how channels are used for two sources

and relay according to different strategies direct communication, dynamic decode and forward (DDF), and DIF. In
direct communications without using a relay, the two sources
transmit their own codewords independently over the whole
codeword duration N . In the cases of DDF and DIF, both
sources transmit their codewords as in direct communications.
The relay receives the signals from the sources over the rst
N symbol periods of the sources transmit duration and then
reconstructs a complete codeword of S1 or S2 before listening
the rest (1 )N symbols. If the forwarding scheme at relay
is DDF, the relay decodes the codeword of S1 . On the other
hand, the codeword of S2 is decoded at relay for DIF. The
value of varies from 0 to 1 and is dynamically determined
according to channel conditions and decoding availability at
relay. For the successful decoding of codewords at relay, the
values of for DDF and DIF have to satisfy R1 /I1,3 and
R2 /I2,3 , respectively, where Ii,3 is channel capacity from
Si to relay. After decoding a codeword, the relay reconstruct
the punctured symbols Np and forwards them to destination.
The punctured symbols are coherently combined at destination
- 300 -
ICEIC 2015
over the last (1 )N symbol periods by maximum ratio
transmission (MRT) from source.
The achievable rate of a direct communication in an interference limited environment is given by

RN R = min log2 (1 + P1,s 11 ),
strong enough to rst decode treating the signal transmitted

r
from S1 as a noise. In other words, the conditions Rinf
R2
d
and Rinf
R2 are satised. Then, the inuence of the
interferer S2 on the received signal Y1 can be completely
removed without sacricing the rate of the desired signal.
Correspondingly, the achievable rate for this case is given by

max
log2 (1 + P1,s 11 + P2,s 21 ) R2 ,

11 P1,s
.
(8)
log2 1 +
1 + 21 P2,s
To ease decoding of the desired signal, which is transmitted

from S1 , the interfering signal can rstly be decoded to cancel
it out from the received signal. This approach is analogous
to the two-user multiple access channel (MAC) because the
receiver decodes not only the desired signal but also the
interferers signal. However, as shown in the third line in (8),
treating the interference as noise could be better than the MAC
approach if the rate of the interference signal is quite high to
decode.
In interference limited environments, the achievable rate of
conventional relay communications where the desired signal is
forwarded by relay is obtained by

(1)
(2)
RDDF = min RDDF , RDDF
(9)
(1)
(2)
where RDDF and RDDF are the achievable rates at the relay
during the rst phase and at the destination during the second
(1)
phase, respectively. RDDF is obtained by

(1)
RDDF = min log2 (1 + 13 P1,s ),

max log2 (1 + 13 P1,s + 23 P2,s ) R2 ,

13 P1,s
,
(10)
log2 1 +
1 + 23 P2,s
(2)
and RDDF is given in (11) at the top of the next page. Each
achievable rate in both phases can be obtained through the
same way as the rate in (8).
The achievable rate of DIF is classied into four cases
according to decoding capabilities of the interference signal
at relay and destination, when they treat the signal from S1 as
a noise. The achievable rates of the interference links treating
the desired signal as noise at the relay and at the destination
are given, respectively, by

23 P2,s
r
Rinf
,
(12)
= log2 1 +
1 + 13 P1,s

d
= log2 1 +
Rinf

21 P2,s
1 + 11 P1,s

21 P2,s + 31 Pr
.
+ (1 ) log2 1 +
1 + 11 P1,s
RDIF,1 = log2 (1 + 11 P1,s ).
(14)
As shown in (14), the effective channel between S1 and D1

becomes like an interference free channel with the help of the
relay.
In the second case, the destination can rst decode the
interference signal and subtract it for decoding of the desired
signal but the relay cannot decode the interference signal
without utilizing the desired signal from S1 . The conditions
r
d
for the second case are Rinf
< R2 and Rinf
R2 . Because
decoding of the interference signal without utilizing the desired
signal at relay is not possible, the achievable rate for the
desired signal should be restricted to making decoding of
the interference signal at relay by joint decoding possible.
Therefore, the achievable rate for the second case is obtained
by

RDIF,2 = min log2 (1 + 11 P1,s ),
log2 (1 + 13 P1,s + 23 P2,s ) R2 . (15)

In the third case, decoding of the interference signal is
possible at relay but not at destination so that the condition
r
d
corresponds to Rinf
R2 and Rinf
< R2 . The achievable rate
for the third case is given in (16) at the top of the next page.
Depending on the relationship between channel conditions and
R2 , the destination either decodes the interference signal to
cancel it from the received signal or treats the interference
signal as a noise. Therefore, as shown in (16), decoding
interference is favorable for a lower rate of interferer R2 .
In the fourth case, both relay and destination fail in decoding
the interference signal without utilizing the desired signal from
S1 . The condition for the fourth case can be represented by
r
d
two inequalities Rinf
< R2 and Rinf
< R2 . Therefore, the
achievable rate should be restricted such that decoding of the
interference signal at relay is possible. So the achievable rate
for this case is the minimum value of the second and the third
cases:
RDIF,4 = min [RDIF,2 , RDIF,3 ] .
Eventually, the overall achievable rate of DIF
as
r
d
RDIF,1
Rinf
R2 , Rinf
R
r
d
Rinf < R2 , Rinf
DIF,2
RDIF =
r
d
RDIF,3
Rinf R2 , Rinf
r
d
RDIF,4
Rinf < R2 , Rinf
(17)
is summarized
R2
R2
. (18)
< R2
< R2
IV. N UMERICAL R ESULTS

(13)
In the rst case, both relay and destination can decode the
interference signal since the received interference signal is
This section numerically quanties the achievable rate of

cell-1 in various channel conditions. The optimum values of
are numerically determined according to channel conditions.
To see how the channel power gain of each link affects the
- 301 -
ICEIC 2015

(2)
RDDF
= min log2 (1 + 11 P1,s ) + (1 ) log2 (1 + 11 P1,s + 31 Pr ),

max log2 (1 + 11 P1,s + 21 P2,s ) + (1 ) log2 (1 + 11 P1,s + 21 P2,s + 31 Pr ) 2R2 ,

11 P1,s
11 P1,s + 31 Pr
+ (1 ) log2 1 +
log2 1 +
1 + 21 P2,s
1 + 21 P2,s
(11)

RDIF,3 = min log2 (1 + 11 P1,s ),

max log2 (1 + 11 P1,s + 21 P2,s ) + (1 ) log2 (1 + 11 P1,s + 21 P2,s + 31 Pr ) 2R2 ,

11 P1,s
11 P1,s
log2 1 +
+ (1 ) log2 1 +
1 + 21 P2,s
1 + 21 P2,s + 31 Pr
(16)

5

'')
',)
1RQUHOD\

Fig. 3.
'')
',)
1RQUHOD\

Achievable rates of cell-1 versus the channel gain from S1 to D1
achievable rate R1 , we evaluate the achievable rate R1 by

varying the channel power gain of a specic link while xing
the channel power gains of other links. Specically, we set
11 = 0.1, 13 = 0.07, 21 = 0.07, 22 = 0.09, 23 = 0.3,
and 31 = 1 as a baseline of channel gains and vary one
of these channel power gains to evaluate its effect on R1 .
The transmit power at S2 and the relay are P2,s = 10 and
P
Pr = 1,s
2 , respectively. For fairness comparison between
the relaying and non-relaying strategies, the sum of P1,s and
(1 )Pr in the relaying strategies is assumed to be the same
as P1,s = 10 in the non-relaying strategy. Hence, the transmit
20
power of S1 in relaying strategies is normalized as P1,s = 3
.
Fig. 3 shows the achievable rates of cell-1 via non-relaying
direct transmission, DDF, and DIF according to the value of
11 . When the value of 11 is almost zero, the achievable rate
R1 of DDF is relatively higher than that of the others because
DDF forwards the intended message for D1 through the direct
link as well as the relaying link. However, as the channel power
gain of the direct link increases, a bottleneck of the information
Fig. 4.
relay
Achievable rates of cell-1 versus the channel gain from S1 to the
ow moves from the direct link to the relaying link, and then
the achievable rate of DDF is saturated around 11 = 0.13.
At the same point of 11 , the rate of DIF is reduced sharply
because the state of DIF is transited from case1 to case3. In
other words, the cancelation of the interference signal without
sacricing R1 is impossible after 11 = 0.13. Although the
achievable rates of non-relaying direct transmission and DIF
go to zero as 11 decreases, the link from S1 to the relay is not
a bottleneck in this conguration. Therefore, the rate of DIF
overtakes that of DDF when 11 is larger than 0.05. Contrary
to the results of Fig. 3, however, the achievable rate of DDF is
growing without saturation as 13 increases as shown in Fig.
4. This is because the rate of DDF is directly and signicantly
related to the relaying link condition. Besides, although the rate
of DIF is sharply reduced at 13 = 0.1, the rate of DIF shows
the same rate of an interference free channel log2 (1 + 11 Ps,1 )
for a small 13 . The sharp rate decline of DIF is caused by
the reason that the relay cannot decode interferers signal while
- 302 -
ICEIC 2015

5

'')
',)
1RQUHOD\

Fig. 5.

be sacriced to utilize the interference signal in decoding the

desired signal as long as R2 is not so high to decode at relay
or destination. However, if the relay or D1 cannot exploit the
gain obtained from utilizing interference signal due to the high
R2 , the relay or D1 treats the interference from S2 as a noise
instead of decoding and canceling it out. Certainly, the rate of
DIF is decreasing as 22 grows like the results of the direct
transmission and DDF. Contrary to the others, however, the
rate of DIF becomes zero when 22 is larger than 0.3. It is
indicated that once the value of 22 is larger than 0.3, the relay
cannot decode the interference signal and DIF does not work.
On the other hand, DIF achieves relatively higher rate than
direct transmission and DDF for small R2 . The value of R2
which makes DIF outperform the other strategies corresponds
to the rate of D2 when D2 in cell-2 is located far from its base
station in the opposite direction to an interfering cell as shown
in Fig. 1.
V. C ONCLUSION
We have studied interference forwarding at a half duplex

relay in an interference limited greedy cellular network. In
particular, we have proposed DIF and have analyzed its achievable rate. It has been shown that forwarding the interfering
signal can be benecial rather than forwarding the desired
signal for some scenarios even in a half duplex relay network.
The proposed DIF can be easily applicable to legacy cellular
networks because it does not change the operations at BSs.

5

R EFERENCES

'')
',)
1RQUHOD\

Fig. 6.

treating the signal from S1 as noise after 13 = 0.1. Eventually,

it is indicated that forwarding interferers signal could be better
than forwarding desired signal when 13 is not high.
Fig. 5 compares the achievable rates of direct transmission,
DDF, and DIF according to interference channel conditions.
For all transmission strategies, the achievable rates are decreasing as the interference channel power gain grows as long as
21 is too weak to decode the interference signal at D1 and
cancel it out. However, once interference channel power gain
increases enough to decode interferers signal, D1 can decode
the interference to ease decoding of the desired signal. Hence,
as the interference channel power gain is getting stronger, the
rates increase until they meet the rates in an interference free
channel. In particular, the rate of DIF is rapidly increased at
21 = 0.05 due to the rate transition from RDIF,4 to RDIF,1 .
Fig. 6 shows the achievable rates of the direct transmission,
DDF, and DIF according to the value of 22 . In other words,
the results in Fig. 6 show how R2 affects the achievable rate
of cell-1 because R2 depends on only the value of 22 as
given in (7). In the case of direct transmission and DDF, as
R2 grows with 22 , the achievable rate of cell-1 needs to
[1] T. Cover and A. E. Gamal. Capacity theorems for the relay channel,
IEEE Trans. Inform. Theory, IT-25(5):572-584, 1979.
[2] A. Sendonaris, E. Erkip, and B. Aazhang, User cooperation diversityPart I: System description, IEEE Trans. Commun., vol. 51, no. 11, pp.
1927-1938, Nov. 2003.
[3] A. Sendonaris, E. Erkip, and B. Aazhang, User cooperation diversityPart II: Implementation aspects and performance analysis, IEEE Trans.
Commun., vol. 51, no. 11, pp. 1939-1948, Nov. 2003.
[4] J. N. Laneman, D. N. C. Tse, and G. W. Wornell, Cooperative diversity in
wireless networks: Efcient protocols and outage behavior, IEEE Trans.
Inform. Theory, vol. 50, no. 12, pp. 3062-3080, Dec. 2004.
[5] J. N. Laneman, G. W. Wornell, Distributed space-time-coded protocols
for exploiting cooperative diversity in wireless networks, IEEE Trans.
Inform. Theory, vol. 49, no. 10, pp. 2415-2425, Oct. 2003.
[6] T. E. Hunter, S. Sanayei, and A. Nosratinia, Outage analysis of coded
cooperation, IEEE Trans. Inform. Theory, vol. 52, no. 2, Feb. 2006.
[7] O. Sahin and E. Erkip, Achievable rates for the Gaussian interference
relay channel, in Proc. IEEE Globecom Conference, 2007.
[8] T. Han and K. Kobayashi, A new achievable rate region for the interference channel, IEEE Trans. Inform. Theory, vol. 27, pp. 49-60, 1981.
[9] O. Sahin and E. Erkip, On achievable rates for interference relay channel
with interference cancelation, in Proc. Asilomar Conf. on Signals, Systems
and Computers, 2007.
[10] O. Sahin and E. Erkip, Cognitive relaying with one-sided interference,
in Proc. Asilomar Conf. on Signals, Systems and Computers, 2008.
[11] S. Srdharan, S. vishwanath, S. A. Jafar, and S. Shamai, On the capacity
of cognitive relay assisted Gaussian interference channel, IEEE Int. Symp.
Inform. Theory, 2008.
[12] R. Dabora, I. Maric, and A. Goldsmith, Relay strategies for interference
forwarding, in IEEE Infom. Theory Workshop, 2008.
[13] I. Maric, R. dabora, and Goldsmith, On the capacity of the interfernce
channel with a relay, in IEEE Int. Symp. Inform. Theory, 2008.
[14] I. Maric, R. Dabora, and A. Goldsmith, Generalized relaying in the
presence of interference, in Proc. Asilomar Conf. on Signals, Systems
and Computers, 2008.
[15] R. Dabora, I. Maric, and A. Goldsmith, Interference forwarding in
multiuser networks, in Proc. IEEE Globecom Conference, 2008.
- 303 -
ICEIC 2015

Oral Session
FO-2-5
and Device II
FO-2-5-1
$Q5) Gm - C /RZSDVV)LOWHU$GRSWLQJ7UDQVFRQGXFWRU
/LQHDUL]DWLRQ7HFKQLTXH

&KLKRRQ&KRL.XGXFN.ZRQ,ONX1DP
Department of Electrical Engineering, Pusan National University,

Department of Electronics Engineering, Kangwon National University

$EVWUDFW
In this paper, a linearization method for a
transconductor using V-NPN BJTs is proposed.
The proposed Gm - C low-pass filter achieve 8.5dB improvements over conventional circuits in the
output-referred
third-order
intercept
point,
respectively. In this paper, a linearization method for
a transconductor using V-NPN BJTs is proposed.
)LJ6FKHPDWLFRIWKHILUVWRUGHU G - C ORZSDVVILOWHUDGRSWLQJ
m
WKHSURSRVHGWUDQVFRQGXFWRU
.H\ZRUGV &026 GHHS QZHOO IXOO\ GLIIHUHQWLDO

WUDQVFRQGXFWRU)'7
OLQHDUL]DWLRQ
WHFKQLTXH
SVHXGRGLIIHUHQWLDO WUDQVFRQGXFWRU 3'7 YHUWLFDO
ELSRODUMXQFWLRQWUDQVLVWRU%-7
,QWURGXFWLRQ

7RGHVLJQWUDQVFRQGXFWRUVZLWKKLJKSHUIRUPDQFH
IRU5)DQGDQDORJFLUFXLWVELSRODUMXQFWLRQWUDQVLVWRUV
%-7V ZKLFK DUH JHQHUDOO\ SURYLGHG WKURXJK D
%L&026SURFHVVDUHSUHIHUUHGVLQFHWUDQVFRQGXFWRUV
J P XVLQJ %-7V KDYH ODUJHU J P DQG ORZHU ORZ
QRLVH SHUIRUPDQFH WKDQ GR WUDQVFRQGXFWRUV XVLQJ
026)(7V>@
,Q WKLV SDSHU D OLQHDUL]DWLRQ WHFKQLTXH IRU D
WUDQVFRQGXFWRU XVLQJ YHUWLFDO 131 9131 ELSRODU
MXQFWLRQ WUDQVLVWRUV%-7V LQ D GHHS QZHOO &026
SURFHVV LV SURSRVHG WR DFKLHYH KLJK OLQHDULW\
SHUIRUPDQFHZLWKRXWGHJUDGLQJSRZHUHIILFLHQF\DQG
QRLVHSHUIRUPDQFH7KHSURSRVHGPHWKRGLVYHULILHG
E\ WKH H[SHULPHQWDO UHVXOWV REWDLQHG IRU D
WUDQVFRQGXFWRULPSOHPHQWHGLQDPGHHSQZHOO
&026SURFHVV
3URSRVHG Gm - C $GRSWLQJ/LQHDUL]DWLRQ
7HFKQLTXH

)LJ VKRZV WKH ILUVWRUGHU 5) Gm - C ORZSDVV
ILOWHUDGRSWLQJWKHSURSRVHGWUDQVFRQGXFWRURI)LJ
7KHFRPELQHG3'7DQG)'7LVXVHGDVDYROWDJHWR
FXUUHQW FRQYHUVLRQ GHYLFH DQG WKH RXWSXW FRPPRQ
PRGH YROWDJH OHYHO RI WKH WUDQVFRQGXFWRU LV VHW WR D
FRQVWDQW YDOXH ZLWK D FRPPRQPRGH IHHGEDFN
&0)%ORRSDVVKRZQLQ)LJD
)LJ D 7UDQVFRQGXFWRU DGRSWLQJ WKH SURSRVHG OLQHDUL]DWLRQ

WHFKQLTXH ZLWK D S026 ORDG E (UURU DPSOLILHU LQ WKH FRPPRQ
PRGHIHHGEDFNORRS

$Q HUURU DPSOLILHU ZKLFK LV VKRZQ LQ )LJ E
VHQVHV WKH YROWDJH GLIIHUHQFH EHWZHHQ 92871 DQG
92873DQGIHHGVLWEDFNWRWKHJDWHVRIWKHS026ORDG
WUDQVLVWRUV0DPG0LQ)LJD)RUVWDELOL]DWLRQ
RIWKHWZRVWDJH&0)%ORRSWKHJDLQRIWKH&0)%
ORRSLVUHGXFHGE\DVRXUFHGHJHQHUDWLRQUHVLVWRU5GHJ
DQGWKHORRSVSKDVHPDUJLQLVLPSURYHGE\WKH0LOOHU
FDSDFLWRUC&0)%
7KH WUDQVFRQGXFWDQFH RI WKH SURSRVHG WUDQV
FRQGXFWRULVJLYHQE\

I R
Gm n c
VT
- 305 -
ICEIC 2015
7KH LQSXWUHIHUUHG QRLVH YROWDJH RI WKH SURSRVHG
WUDQVFRQGXFWRULVH[SUHVVHGDV

kT >rb 1 rb 3 n g mv @
2
2
x ' f
kT
g m5
KP
Vn #

2
Q g mv1
g m5 COX W5 L5 f
ZKHUH rbn LV WKH EDVH UHVLVWDQFH RI Qn ; gmvn WKH

WUDQVFRQGXFWDQFHRI Qn ; g mn WKHWUDQVFRQGXFWDQFHRI
)LJ&KLSPLFURSKRWRJUDSKRIWKHILUVWRUGHU Gm - C ORZSDVV
ILOWHU
M n ; K P D SURFHVVGHSHQGHQW FRQVWDQW IRU f QRLVH

COX WKHJDWHR[LGHFDSDFLWDQFHSHUXQLWDUHD Wn WKH
ZLGWK RI M n ; Ln WKH OHQJWK RI M n DQG J D QRLVH

SDUDPHWHU
0HDVXUHPHQW5HVXOWV

7KHILUVWRUGHU Gm - C ORZSDVVILOWHUDGRSWLQJWKH
SURSRVHGWUDQVFRQGXFWRUZHUHLPSOHPHQWHGLQD
)LJ0HDVXUHGIUHTXHQF\UHVSRQVHRIWKHILUVWRUGHU Gm - C ORZ
SDVVILOWHUDGRSWLQJWKHSURSRVHGWUDQVFRQGXFWRU
GHHSQZHOO&026SURFHVVWRSURYHWKHIHDVLELOLW\
RIWKHSURSRVHGOLQHDUL]DWLRQWHFKQLTXH7KHFKLSVL]H
RI WKH ILUVWRUGHU Gm - C ORZSDVV ILOWHU LV PP
PP ,W GUDZV P$ IURP D 9 VXSSO\
YROWDJH7KHPHDVXUHGIUHTXHQF\UHVSRQVHRIWKHILOWHU
LVVKRZQLQ)LJ7KHFXWRIIIUHTXHQF\RIWKHILOWHULV
0+]$VVKRZQLQ)LJWKHPHDVXUHG2,3LV
G%P ZKHQ WZR WRQHV RI DQG 0+] DUH
DSSOLHG %\ DGRSWLQJ WKH SURSRVHG OLQHDUL]DWLRQ
WHFKQLTXHWKH Gm - C ORZSDVVILOWHUDFKLHYHVG%
RI 2,3 LPSURYHPHQW ZLWK WKH VDPH SRZHU
FRQVXPSWLRQ7DEOHVXPPDUL]HVWKHSHUIRUPDQFHRI
Gm - C ILOWHU,WLVQRWHGWKDWWKHSURSRVHGPHWKRGFDQ
)LJ 0HDVXUHG IUHTXHQF\ UHVSRQVH RI WKH ILUVWRUGHU Gm - C
ORZSDVVILOWHUDGRSWLQJWKHSURSRVHGWUDQVFRQGXFWRU

7DEOH3HUIRUPDQFH6XPPDU\RI7KH Gm - C ORZSDVVILOWHU
(PSOR\LQJ7KH3URSRVHG7UDQVFRQGXFWRU
LPSURYH OLQHDULW\ ZLWKRXW GHJUDGLQJ RWKHU

SHUIRUPDQFHVVXFKDVSRZHUHIILFLHQF\DQGQRLVH
7UDQVFRQGXFWRU
WRSRORJ\
&RQFOXVLRQ

$ OLQHDUL]DWLRQ PHWKRG XVLQJ 9131 %-7V LQ D
GHHSQZHOO&026SURFHVVLVSURSRVHGWRLPSURYHWKH
G\QDPLF UDQJH RI D WUDQVFRQGXFWRU 7KH SURSRVHG
PHWKRGPDNHVWKHRYHUDOO J P RIWKHWUDQVFRQGXFWRU
FORVHWR]HURE\FRPELQLQJD9131%-73'7DQGD
9131 %-7 )'7ZLWK WKHSURSHU FXUUHQWUDWLR 7KH
SURSRVHG ILUVWRUGHU Gm - C ORZSDVV ILOWHU DFKLHYH
G%2,3LPSURYHPHQWVUHVSHFWLYHO\7KHPHWKRG
FDQ DOVR EH HPSOR\HG WR DFWLYH PL[HUV DQG %%$
FLUFXLWV 7KH SURSRVHG WHFKQLTXH LV HVSHFLDOO\
EHQHILFLDO IRU %%$ FLUFXLWV LQ GLUHFWFRQYHUVLRQ
UHFHLYHUV '&5V DQG ORZ,) UHFHLYHUV EHFDXVH LW
SURYLGHV KLJK OLQHDULW\ SHUIRUPDQFH DV ZHOO DV ORZ
/f QRLVHSHUIRUPDQFH

9131
)'7
9131
3'7
3URSRVHG
7UDQVGXFWRU
*DLQG%

1)G%

2,3G%P

&XUUHQWFRQVXPSWLRQ
&KLSDUHDPP
PP
6XSSO\YROWDJH9

7HFKQRORJ\
GHHSQZHOO&026SURFHVV
3DUDPHWHUYDOXHVRIWKHVHEORFNVDUHVLPXODWHG
$FNQRZOHGJPHQW
7KLV UHVHDUFK ZDV VXSSRUWHG E\ %DVLF 6FLHQFH
5HVHDUFK 3URJUDP WKURXJK WKH 1DWLRQDO 5HVHDUFK
)RXQGDWLRQRI.RUHD15)IXQGHGE\WKH0LQLVWU\RI
(GXFDWLRQ
5HIHUHQFHV
>@ ' $ 5LFK HW DO %L&026 WHFKQRORJ\ IRU
PL[HGGLJLWDO DQDORJ DQG 5) DSSOLFDWLRQV ,(((
0LFURZ0DJYROQRSS-XQ
- 306 -
FO-2-5-2
Low-frequency noise characteristics of Bi2Mg2/3Nb4/3O7 (BMN) temperature

sensor with annealing temperature variation
Il Hwan Cho*, Seongjae Cho, Jong-Ho Lee, and Byung-Gook Park
Department of Electrical and Computer Engineering, University of California, Davis, CA 95616, USA
2
Department of Electronic Engineering, Gachon University, Gyeonggi-do 461-701, Republic of Korea
3
Department of Electrical and Computer Engineering, Seoul National University, Seoul 151-744,
Republic of Korea
ihwcho@ucdavis.edu
Abstract
2. Experiments
Reliability characteristics of a temperature sensor

with Bi2Mg2/3Nb4/3O7 (BMNO) functional layer were
investigated with an emphasis on low-frequency noise.
Annealing temperature variation effects were
measured and analyzed at different temperatures
600C, 700C, and 800C. It has been found that
annealing temperature determines the trap distribution
in the forbidden band and the sample processed at
700C showed different patterns compared with other
samples.
Keywords: reliability, BMNO, low-frequency noise,
annealing temperature, trap distribution
1. Introduction
Detection of overheating is an important issue in the
electronic systems. Among various types of
temperature detectors, Schottky diode type temperature
detector with Bi2Mg2/3Nb4/3O7 (BMNO) layer showed
a remarkable sensitivity [1]. Although its operating
mechanism has been already studied, reliability
characteristics need to be analyzed for optimized
device performances. Low-frequency noise would be a
highly sensitive index of the material quality and
device reliability since its time dependence reveals the
presence of imperfections and traps that significantly
affects the quality and reliability [2]. In this work, the
material quality of BMNO is closely investigated
varying the process condition performing the lowfrequency noise measurements. For the analyses,
BMNO samples prepared at different annealing
temperatures, 600C, 700C, and 800C, are measured
and the relation between material quality and device
reliability will be studied.
BMNO films of 10-nm thickness were deposited on

p-type Si substrate by a radio-frequency (RF)
sputtering. The sputtering was performed at room
temperature in a gas ambient prepared by mixture of
10 sccm Ar and 10 sccm O2. The main deposition
process was performed at a reduced pressure of 5
mTorr and at an RF power of 50 W. After the
deposition was completed, rapid thermal annealing
(RTA) processes were carried out at different
temperatures, 600C, 700C, and 800C, for 1 min. Ti
was deposited to form the top electrodes with a
thickness of 100 nm and square patterns with an area
of 100100 m2 were constructed by the shadow-mask
process.
3. Results and Discussions
Fig. 1 TEM image of the prepared BMNO layer with

the Ti top electrode.
- 307 -
ICEIC 2015
Fig. 1 shows the transmission electron microscopy

(TEM) images of the BMNO layer prepared by an RF
sputtering. The related X-ray diffraction (XRD) study
was also performed in a previous work [1].
magnitude and slope of the power spectral density

(PSD) are dependent on annealing temperature. In the
low-frequency region below 100 Hz, all the data show
a good match with the 1/f slope, which implies that
most of the traps in the forbidden band have nearly
uniform distribution [2]. However, the curves obtained
at biases < -3 V from the sample prepared at 700C
showed denser spacing compared with those from
600C and 800C.
(a)
(a)
(b)
(b)
(c)
Fig. 2 1/f noise characteristics from devices prepared at
different annealing temperature. (a) 600C, (b) 700C,
and (c) 800C.
Fig. 2 demonstrates the low-frequency noise
characteristics of the BMNO-based sensors with
temperature variation. The measurement voltage was
varied from -1 V to -10 V. As shown in the figures,
(c)
Fig. 3 Power spectral density (PSD) as a function of
current from samples prepared at different
temperatures. (a) 600C, (b) 700C, and (c) 800C.
The sample prepared at 700C also showed
different slopes in the current vs. PSD curves as shown
in Fig. 3. Slope of 1 comes from fluctuations in
- 308 -
ICEIC 2015
mobility and diffusivity and slope of 2 originates from

random-walk model. Thus, two types of sources are
underlying the curves obtained from the sample
prepared at 700C while the others are approximated to
have a single slope of 2 as demonstrated in Fig. 3(a)
through (c).
4. Conclusion
Reliability of temperature sensors with BMNO
layer have been investigated by low-frequency noise
measurements. It is revealed that annealing
temperature has an effect of changing trap density in
the BMNO layer and the sample prepared at 700C
showed slightly different characteristics compared with
those processed at 600C and 800C in terms of PSD
dependence on frequency and injection current.
Acknowledgement
This research was supported by the Basic Science
Education, Science and Technology (MEST) (No.
2014R1A1A1006439).
References
[1] J.-M. Lee, I.-T. Cho, J.-H. Lee, S.-G. Yoon, and I. H.
Cho, Enhancement of Temperature Sensitivity for Metal
InsulatorSemiconductor Temperature Sensors by Using
Bi2Mg2/3Nb4/3O7 Film, Japanese Journal of Applied Physics,
pp. 080602-1, July 2012.
[2] J.-H. Lee, S.-Y. Kim, I. Cho, S. Hwang, and J.-H. Lee,
1/f Noise Characteristics of Sub-100 nm MOS Transistors,
Journal of Semiconductor Technology and Science, pp. 3842. 2006.
- 309 -
FO-2-5-3
A new multiple frequency out of DLL with Glitch Elimination and Phase Interpolator
for DDR4
Wei-Bin Yang 1, Chi-Hsiung Wang 1, Kuo-Hsiang Hsu 1, Han-Hsien Wang 1,
Yu-Yao Lin 1, Horng-Yuan Shih 1, Yu-Lung Lo 2
1 Department of Electrical Engineering, Tamkang University, New Taipei City, Taiwan
2 Department of Electrical Engineering, National Kaohsiung Normal University, Kaohsiung, Taiwan
robin@ee.tku.edu.tw, chwang@gmail.com, jackie240246@gmail.com, yllo@nknu.edu.tw
Abstract
This paper describes a delay-locked loop (DLL)
architecture. In this paper, phase-combining delaylocked loop (DLL) architecture is the low power
architecture. The proposed glitch elimination circuit
reduced the phase detector (PD) glitches and the charge
pump (CP) current mismatch. And The DLL architecture
used the delay-time-adjustment phase interpolator
(DTAPI), and the phase combiner circuit generating
multiple output frequency. The proposed circuit has been
design by a 90nm CMOS process technology and using
computer simulation. The proposed phase-combining
delay-locked loop (DLL) achieves four frequency output
(200, 400, 800, and 1600MHz). The simulations show
that the jitter and power are 99 ps at 200MHz, 33 ps at
1600MHz and 2.78 mW.
Keywords: Delay-Locked Loop, DLL, Phase Interpolator,
Phase Combiner.
1. INTRODUCTION
Currently, DDR3 SDRAM is widely used as a main
memory of PC and server systems. It provides reasonable
performance focusing on the reliability of data retention.
However, the explosive growth of mobile devices such
as smartphones and tablet PCs requires a very large
number of server systems [1]. And, higher performance
server systems are required due to the advent of highbandwidth network and the rise of high-capacity
multimedia content. A main memory of server system also
has to have the low power and high performance features
because it is one of the critical components of server
systems [2].
DDR4 SDRAM is regarded as the next generation
memory for the computing and server systems. In
comparison with precedent DDR3 SDRAM, major
changes are supply voltage of 1.2 V, pseudo open drain
I/O interface, and high data rate from 1.6 Gb/s to 3.2 Gb/s
[3].
In DDR DRAM, the action of transferring data in or
out relies on both rising and falling edges of clock to
trigger. Therefore, the clock is desirable to have as less
static phase mismatch as possible. An ideal DLL can
generate a synchronous clock perfectly aligning to the
reference. Although in reality, there is a limit for
resolution on phase detector and charge pump, called dead

zone. One of the design targets of proposed charge pump
is to minimize the dead zone and to generate an output
clock which edges are close to the reference. The charge
and discharge current play important roles in achieving
low dead zone design.
In this paper, propose a glitch elimination circuit to
reduce the glitch which generated by dynamic phase
detector, and enable to decrease the jitter which generated
by Charge Pump (CP) current mismatch. This paper also
proposed the delay-time-adjustment phase interpolator
(DTAPI) circuit. This circuit could reduce area and power
consumption.
The rest of this paper is organized as follows. Analysis
for the proposed phase-combining delay-locked loop
(DLL) was both described in section II. Section III
presents simulation results of the proposed phasecombining delay-locked loop (DLL) to assess the
performance. Finally, conclusions are given in Section IV.
2. DELY-LOCKED LOOP WITH PHASE

INTERPOLATOR
Fig.1 shows the architecture of the phase-combining
delay-locked loop (DLL). The DLL architecture contains
the dynamic phase detector (DPD), a glitch elimination
circuit, a charge pump (CP), a loop filter (LF) that is made
from single capacitor, a voltage-controlled delay line
(VCDL), a delay-time-adjustment phase interpolator
(DTAPI), a phase combiner.
Fig. 1. The phase-combining delay-locked loop (DLL)

architecture.
- 310 -
ICEIC 2015
A. Phase Detector (PD)
The drawback of some conventional phase detectors is
dead zone, which causes the phase error in the output
signal. [4]. When the phase error is within the dead zone,
the charge pump does not charge the capacitor, and the
phase jitter may appear [5].
Fig.2 shows the dynamic phase detector (DPD) [6-7]
for high-speed operation. The block diagram of DPD
consists of two half-transparent (HT) registers that operate
in concert to generate up and down signals. This PD has
only six transistors and the critical path is reduced to two
logic gate delays; no reset path is present in the phase
detector, so can overcome the speed limitation and make
the dead zone smaller than the conventional phase
detector. The DPD is a digital circuit, which is triggered
by the edge of the Fref and Fout of VCDL. According to the
phase difference between input signals, UPin is used to
increase and DNin is used to decrease the control voltage
of the loop filter.
Fig. 4. The charge pump (CP) circuit.

D. Voltage Controlled Delay Line (VCDL)
Fig.5(a) shows the architecture of the voltage
controlled delay line (VCDL) the VCDL includes a bias
circuit of voltage to current, the Pmos current source of
adjust the magnitude of the delay, input and output buffer,
the latch circuits to ensure the duty cycle in 50% and
differential-pair delay cells[10].
Fig.5(b) shows the differential-pair delay cell circuit.
Although the differential-pair delay cell requires more
area and power consumption but it less susceptible to
supply noise and substrate noise. This differential-pair
delay cell contains a differential input pair NMOS (M13)
and a positive feedback differential-pair PMOS (M14). In
adjusting, used to adjust the transduction of M13
capacitance ratio gm/C to achieve maximum operating
frequency and the minimum power consumption.
Fig. 2. The dynamic phase detector (DPD) circuit.
B. Glitch Elimination Circuit

Although the dynamic phase detector makes the dead
zone smaller than the conventional phase detector, it still
has a glitch when the dead zone happened and the glitch
will make charge pump charge or discharge the capacitor
at the wrong time.
In this paper, we use the glitch elimination circuit to
solve this problem. It is the way of the digital logic to
replace conventional way of using buffer in order to save
area and power consumption. Fig. 3(a) shows the
architecture of the glitch elimination circuit and Fig. 3(b)
shows the truth table for the glitch elimination circuit. We
obtained the following function for UPout and DNout.
(a)
(b)
Fig. 5. (a) The voltage controlled delay line (VCDL)
architecture, and (b) the delay cell circuit.
(a)
(b)
Fig. 3. (a) the architecture, and (b) the truth table of the
glitch elimination circuit
C. Charge Pump (CP)
In this work, a charge pump schematic associated with
the loop filter is shown in Fig. 4. The UPout and DNout
signals are activated to turn on the M11 or M14. The VCDL
delay increases when the control voltage of filter
decreases greatly. Thus, the delay between the Fout and Fref
will decrease rapidly until the Fout is close to the Fref[8-9].
E. Delay-Time-Adjustment Phase Interpolator

(DTAPI)
Fig. 6(a) shows the delay-time-adjustment phase
interpolator (DTAPI) circuit and Fig. 6(b) shows the
architecture. The DTAPI design by digital with analog
and its contain three logic gates NAND, NOR, and NOT
gate and two current blocks C1 and C2.The three logic
gates are implemented to control Pmos and Nmos to avoid
the short circuit current happended. The current source
MOS (M1, M2, M7, M8) control by bias voltage Vp and
Vn[11].
- 311 -
ICEIC 2015
There are two situation when 1 and 2 have input
phase. One is when input phase 1 and 2 are same phase
C1 and C2 opening at the same time to charge(or discharg)
the capacitor; the other is when input phase 1 leading
phase 2 the C2 opening to charge(or discharg) the
capacitor, until 2 arrives and C1 opening to charge the
capacitor with C2 at the same time.
Phase sequences. That is the number of delay component

of the Voltage-Controlled Delay Line(VCDL).
TABLE I. RELATIVELY DIFFERENT PHASE SEQUENCES
FOR THE PHASE COMBINER CIRCUIT
x/y
Phase Sequences
2/1
P0P8P16P24P0
P0P4P8P12P16P20P24
4/1
P28P0
P0P2P4P6P8P10P12P14
8/1
P16P18P20P22P24P26
P28P30P0
P0P1P2P3P4P5P6P7
P8P9P10P11P12P13P14
16/1
P15P16P17P18P19P20P21
P22P23P24P25P26P27
P28P29P30P31P0
(a)
(a)
(b)
Fig. 6. (a) The delay-time-adjustment phase interpolator
(DTAPI) circuit and (b) architecture of DTAPI.
F. Phase Combiner Circuit
Phase combiner circuit is a circuit which makes lowfrequency turn into one or multiple high-frequency. There
are many elements to be considered on the design of
phase combiner circuit. For example, the range of
frequency, power consumption, phase noise suppression,
output loading. Thus, design, choose an appropriate
frequency combiner is very important to Delay-Locked
Loop(DLL).
In order to be used for more circuit, so DLL need large
operating bandwidth range. Therefore, we use the
frequency combiner in DLL architecture. The clock
frequency of frequency combiner and phase combiners
function is[12],
Fout
x
u Fref
y
(b)
Fig. 7. (a) The twice the output frequency of the phase
combiner circuit, and (b) the 16 times the output
frequency of the phase combiner circuit.
Fig. 7(a) is twice the output frequency of the phase
combiner circuit and Fig. 7(b) is sixteen times the output
frequency of the phase combiner circuit sample. The
phase combiner circuits use the characteristics pseudo
differential delay component (eliminates common mode
gain and the output of the circuit is maintained at 50%
duty cycle).The advantage of this circuit is simply to find
the two different clock which away from each other 90,
can make two multiplier circuit. In our system of DLL,
VCDL outputs 16 phase to the interpolation circuit, The
interpolation circuit outputs 32 phase to the frequency
combiner, and we use these 32 phase to turn 100MHz into
200MHz, 400MHz, 800MHz, 1600MHz, to apply more
circuitry.
(1)
3. SIMULATION RESULTS
In the function, Fout is the output frequency of the

phase combiner circuit, Fref is the reference of input signal,
and x/y refers to the output frequency multiple of phase of
frequency combiner. Table I is the frequency of required
The proposed circuits of phase-combining delaylocked loop (DLL) had been designed in the previous
sections. The DLL have been designed and simulated by
SPECTRE in a 90nm CMOS process technology.
- 312 -
ICEIC 2015
Fig. 8 is the transient simulation of the PD, Glitch
Elimination Circuit and CP. The simulation of the Fref and
Fout is leading and lagging state. When equal to the Fout
phase of the Fref phase, the PD have glitches at UPin and
DNin. Through the glitch elimination circuit, the glitches
are eliminated. The CP is charging or discharging to
capacitance maked smooth and no glitch at Vctrl. Fig. 9 is
the phase-combining delay-locked loop (DLL) simulation.
The simulation of phase-combining delay-locked loop
(DLL) is Fref, 200MHz, and 1600MHz. The jitter of output
signals are 99 ps at 200MHz, and 33 ps at 1600MHz. The
power dissipation is 2.78 mW.
Fig. 8. The simulation of the PD, glitch elimination

circuit and CP.
Fig. 9. The simulation of the DLL output frequency.

However, some parameters of Table II deserve to be
mentioned. The DLL output frequency is between
200MHz and 1600MHz. And the power is lower than
reference.
TABLE II. DLL SPECIFICATION COMPARISON
WITH REFERENCE
[1]
This work
90
90
Technology (nm)
Supply Voltage
1.2
1
(V)
DDR4
DDR4
DRAM Interface
ADLL
ADLL
DLL Type
200, 400, 800,
Frequency
1600
1600
(MHz)
15.6 (w/o I/O)
2.78 (w/o I/O)
Power (mW)
@1600MHz
4. CONCLUSION
In this paper, we proposed the glitch elimination circuit
reduce the PD output glitch. And the glitch elimination
circuit makes reduce the CP current mismatch, and system
frequency jitter. The proposed phase-combining delaylocked loop (DLL) architecture generates four frequency
output. Simulations show that the jitter and power are 99
ps at 200MHz, 33 ps at 1600MHz and 2.78 mW.
ACKNOWLEDGEMENT
The authors would like to thank the National Chip
Implementation Center and Ministry of Science and
Technology, Taiwan, for supporting this work,
respectively.
REFERENCES
[1] R. Ramakrishnan, CAP and cloud data management,
Computer, vol.45, no. 2, pp. 4349, Feb. 2012
[2] M. E. Tolentino, J. Turner, and K. W. Cameron, Memory
MISER: Improving main memory energy efficiency in
servers, IEEE Trans. Comput, vol. 58, no. 3, pp. 336350,
Mar. 2009.
[3] Yo-Hao Tu, Kuo-Hsing Cheng, Hsiang-Yun Wei, and
Hong-Yi
Huang, A low jitter delay-locked-loop applied for
DDR4, 2013 IEEE 16th International Symposium on
Design and Diagnostics of Electronic Circuits & Systems
(DDECS), pp. 98-101, April 2013.
[4] Fang-Ren Liao and Shey-Shi Lu, A Programmable EdgeCombining DLL with aCurrent-Splitting Charge Pump for
Spur Suppression, IEEE Transactions on Circuits and
Systems II: Express Briefs, vol. 57, no. 12, pp. 946-950,
Dec. 2010.
[5] S. Kim, K. Lee, Y. Moon, D. K. Jeong, Y. Choi, and H. K.
Kim, A 960-Mb/s/pin Interface for Skew-Tolerant Bus
Using Low Jitter PLL, IEEE J. Solid-State Circuits, vol.
32, pp. 691-700, May 1997.
[6] J. Yuan and C. Svensson, Fast CMOS nonbinary divider
and counter, Electronics Letters, vol. 29, no. 13, pp. 12221223, June 1993.
[7] J. Yuan and C. Svensson, High speed CMOS circuit
technique, IEEE Journal of Solid-State Circuits, vol. 24,
no. 1, pp. 62-70, Feb. 1989.
[8] H. O. Johansson, A Simple Precharged CMOS Phase
Frequency Detector, IEEE Journal of Solid-state Circuits,
vol. 33, no. 2, pp. 295-299, Feb. 1998.
[9] Kuo-Hsing Cheng, Shu-Ming Chang Yu-Lung Lo and
Shu-Yu Jiang, A 2.2 GHz Progmmable DLL-based
Frequency Multiplier for SOC Applications, Proceedings
of 2004 IEEE Asia-Pacific Conference on Advanced
System Integrated Circuits 2004, pp. 72-75, Aug, 2004.
[10] W. S. T. Yan and H. C. Luong, A 900-MHz CMOS lowphase noise Voltage-Controlled Ring Oscillator, IEEE
Transactions on Circuits and Systems II: Analog and
Digital Signal Processing, vol. 48, no. 2, pp. 216-221, Feb.
2001.
[11] Wei-Bin Yang, Chi-Hsiung Wang, Sheng-Shih Yeh, and
Chao-Cheng Liao, A multiple frequency clock generator
using wide operation frequency range phase
interpolator, Microelectronics Journal 44(8), pp.688-695,
May 2013.
[12] Wei-Bin Yang, Chi-Hsiung Wang, Sheng-Shih Yeh, and
Chao-Cheng Liao, A multiple frequency clock generator
using wide operation frequency range phase
interpolator, Microelectronics Journal, vol. 44, no. 8,
pp.688-695, May 2013.
- 313 -
FO-2-5-4
Extraction of Sub-Bandgap Trap Profile of Poly-Si/SiO2 interface in 3-D

Stacked NAND Flash Memory cells
Nag Yong Choi, Ho-Jung Kang and Jong-Ho Lee.
School of ECE and ISRC, Seoul National University, Seoul 151-742, Korea
jhl@snu.ac.kr
Abstract
The interface trap density (Dit ) was extracted from the
cells in 3-D stacked NAND flash memory with a tubetype poly-Si channel structure. Capacitance and
conductance were measured at frequencies (f) of 1 and
100 kHz at different temperatures (T) in order to extract
Dit in a wide range of the trap energy level (Ec-ET). The
humps due to deep states could be clearly observed in CV curves when the f is low and the T is high. The Dit
profile was extracted in Ec-ET of 0.08~0.46 eV. Based on
the extracted Dit profile, we could fit the profile with a
Gaussian function, which was verified by comparing
simulated and measured I-V curves.
Keywordsinterface trap density (Dit), 3-D stacked
NAND flash memory, conductance method, parallel
conductance, trap profile, poly-Si body.
1. Introduction
Due to the limit of scaling, increasing cost, and
reliability issue in planar (2-D) NAND flash memory, 3D stacked NAND flash memory has been considering
very promising candidate. In word-line stacked structures
[1]-[3], the gate dielectric stack including nitride storage
layer surrounds the tube-type polycrystalline silicon
(poly-Si) body standing vertically. However, the traps of
grain boundary in poly-Si body induces some side effects
[4]. Although there were many reports on the result
coming from poly-Si channel, they were mostly limited to
thin-film transistors. Our previous work has reported the
interface trap density (Dit) of the cells in 3-D stacked
NAND flash memory by using conductance method [5].
However, it has reported accurate trap profile in a limited
sub-bandgap energy of Poly-Si/SiO2 interface.
In this paper, we extract the Dit in a wide-range energy
level by measuring capacitance at different temperatures
(T). Therefore, we predict trap profile in a wide subbandgap energy at poly-Si/SiO2 interface of 3-D stacked
NAND flash devices with thin tube-type poly-Si body.
2. Experiments
The 3-D stacked NAND flash memory was fabricated at
a company [3] and has thin tube-type poly-Si body, gate

dielectric stack including SiN layer, and virtual
source/drain. Gate length (Lg), space between vertical
word-lines (WL) and tube diameter are less than 100 nm.
Fig. 1(a) shows the cross-sectional transmission
electron microscope (TEM) images of 3-D stacked
NAND flash memory cell array used in this work. To
obtain sufficient capacitance and conductance for
measurement, we used multi bit-line and tied word-line
structure shown in Fig. 1(b) with a pass bias applied to
drain select line and source select line. Poly-Si/SiO2
interface has much larger trap density than that of
crystalline Si/SiO2 interface and deep traps in sub-band
gap due to bulk traps caused by grain boundary of polySi. As discussed in our previous work, the channel
electrons can interact with deeper traps in both oxide and
poly-Si body at a low frequency, so that the bulk traps
can be extracted using the low frequency. Similarly, the
channel electrons can also interact with deeper traps at
high T, because the electrons at deep traps can be emitted
at high T. Fig 1. (c) explains schematically electron
interaction with traps at different frequencies and
temperatures.
BL1
Temperature
controller
ONO
SiO2
C-V measure
MG
B1500A
(B1520A)
BL2
BLn
All WLs
SiO2
VDSL, VSSL
Poly-Si Body
B1500A
(b)
(a)
@ Same Temperature
High Frequency
Low Frequency
EC
EC
Traps
EF
EV
Traps
Blocking
Nitride
layer
EF
Traps
EV
Poly body
Gate
@ Same Frequency
Low Temperature
High Temperature
EC
EV
Poly body
Tunneling
oxide
Tunneling
oxide
EF
Poly body
Tunneling
oxide
(c)
Fig. 1. (a) TEM cross-section image of 3-D stacked NAND flash

memory cell. (b) Circuit diagram of Conductance measurement using a
C-V meter (B1520A) and temperature controller. (c) Energy band
diagram showing electron interaction with frequency at a fixed
temperature (center). Energy band diagram showing electron
interaction with temperature at a fixed frequency (right).
- 314 -
ICEIC 2015
@Program
3. Result and discussion
60
30
0
10
3.0
-1
D it (10 cm eV )
20
0
2.4
VCG (V)
10
10
10
10
Extracted D
it
Temperature
Gaussian
-40 qC
0 qC
25 qC
-2
12
Capacitance (pF)
60
40
10
and temperatures (-40, 25, 70 .
80
-40 qC
-20 qC
0 qC
25 qC
50 qC
75 qC
Frequency (Hz)
Fig. 3. Measured Gp/ of cells in program state versus at different VCG
Freq. : 100 kHz
Freq. : 1 kHz
@ 70qC
VCG=3.05~4.05 V
90
@Program
100
@ 25qC
VCG=3.55~4.35 V
Gp/Z (nF)
Fig. 2 shows measured capacitance versus control gate

voltage (C-VCG) of cells in program (P) state with
different temperatures at frequencies of 1 kHz and 100
kHz. Humps are clearly observed in C-VCG curves at 1
kHz as the T increases. Since the bulk traps in deep states
need more time to interact with channel electrons, the
humps are observed at low frequency and high
temperature. However, the humps of C-VCG curves were
not shown at low T, even at low f. It means that the
channel electrons need sufficient thermal energy to
interact with bulk traps (deep traps). As T increases, the
C-VCG curve shifts to the left because the interface state
capacitance due to the deep traps is connected in parallel
to the gate capacitance.
@ -40qC
VCG=4.15~4.8 V
75 qC
E (0.56 eV)
1.8
1.2
0.6
0.5
0.4
0.3
0.2
0.1
0.0
E -E (eV)
C
Fig. 4. Extracted Dit versus EC-ET in 3-D stacked NAND flash memory
3
Fig. 2. Measured C-VCG of cells in program state at different

temperatures (-40, -20, 0, 25, 50 75 ) and frequency (1 kHz and 100
kHz)
Parallel conductance (Gp/) is required to extract Dit

from measured data [6]. Fig. 3(a) and (b) show measured
Gp/ versus f at different VCGs. As shown in Fig. 3, the
peak of Gp/ increases at a low frequency as T increases,
which means that the Dit in the deep state can be detected
at a high T. The result from the conductance method
shows corresponding behavior to that of C-VCG method.
Extracted Dit is 0.8~1.61012cm-2eV-1 in the Ec-ET of
0.08~0.46 eV when cell devices are programmed as
shown in Fig. 4, and 1.1~1.71012cm-2eV-1 in the same
Ec-ET range when erased. In the Ec-ET range between 0
and ~0.25 eV, the trap profile is well fitted with an
exponential function. The trap profile around the midgap
is fitted based on the limited trap profile shown in Fig. 4
to a Gaussian function as shown in the inset. To verify
the validity of the extracted trap profile, we compared the
simulated I-V curves based on the trap profile in Fig. 4
and measured curves. Both curves showed very good
agreement (not shown here).
conductance method was used at various measurement

temperatures. Based on the limited trap profile extracted
by the method, we could fit the profile around midgap to
a Gaussian function.
Acknowledgments
This work was supported by the Brain Korea 21 Plus
Project in 2014 and Development of novel 3-D stacked
devices and core materials for the next-generation Flash
memory sponsored by Ministry of Knowledge Economy
and SK hynix Semiconductor Inc. in 2014.
References
[1]
[2]
[3]
[4]
4. Conclusion
In this paper, we have extracted Dit profile at the polySi/SiO2 interface in the cell devices of 3-D stacked
NAND flash memory having tube-type poly-Si body. To
extract accurate sub-bandgap interface trap profile,
[5]
[6]
- 315 -
M. Ishiduki et al., "Optimal Device Structure for Pipe-shaped

BiCS Flash Memory for Ultra High Density Storage Device with
Excellent performance and Reliability," IEDM Tech. Dig., p. 625,
2009.
J. Jang et al., Vertical cell array using TCAT(Terabit Cell Array
Transistor) technology for ultra high density NAND flash
memory, VLSI Tech. Dig., p 192, 2009.
E. Choi et al., Device Considerations for High Density and
Highly Reliable 3D NAND Flash Cell in Near Future, IEDM
Tech. Dig., p 211, 2012.
G. A. Armstrong et al., "Differentiation of Effects due to Grain
and Grain Boundary Traps in Laser Annealed Poly-Si Thin Film
ransistors," JJAP, vol. 37, p. 1721, 1998.
M. Jeong et al., Characterization of Traps in 3-D stacked NAND
Flash Memory Devices with Tube-Type Poly-Si Channel
Structure, IEDM Tech. Dig., p 207, 2012.
E. H. Nicollian et al., The Si-SiO2 Interface-Electrical Properties
as Determined by the Metal-Insulator-Silicon Conductance
Technique, Bell Tech. Journal, vol. 46, p.1055, 1967.
FO-2-5-5
Modeling and Simulation of a Pair-Wise Serial ROIC for Uncooled

Microbolometer Array
Syed Irtaza Haider, Sohaib Majzoub, Mohammed Alturaigi, Mohamed Abdel-Rahman
King Saud University
{sirtaza, smajzoub, mturaigi, mabdelrahman}@ksu.edu.sa
changes its resistance when exposed to IR radiation
due to its thermally sensitive layer. If the target
temperature differs by ambient temperature i.e.
Tscene by 1K, it results in a temperature increase in
the microbolometer membrane on the order of 4mK
[3].
Abstract
The main contribution of this paper is design, modeling,
and simulation of a readout integrated circuit (ROIC).
We present a ROIC design considering pair-wise, timemultiplexed, column-wise configuration along with
thermal modeling of uncooled microbolometer array.
Fully differential approach is used at the input stage in
order to reduce the fixed pattern noise due to process
variation and self-heating related issues. Pulse sequence
to each pair of microbolometers is provided such that
they are both under the same self-heating point along the
self-heating trend line. Process variation with 10% is
considered. The proposed design is simulated with a
reference input image consisting of an array of 127x92
pixels. This configuration uses only one unity gain
differential amplifier along with single 14-bit ADC in
order to minimize the dynamic range requirement for the
ROIC.
These thermal detectors need to be electrically

biased during the readout in order to monitor the
change in resistance. Electrical biasing generates
heat which results in self-heating of the
microbolometer detector and causes a change in
resistance. Heat generated by the self-heating cant
be quickly dissipated through the thermal
conduction to substrate. It results in change in
temperature due to self-heating much higher as
compared to change in temperature due to incident
radiation [4].
Keywords: ROIC, uncooled microbolometer, selfheating, process variation, thermal imaging.
Fixed pattern noise (FPN) and self-heating

results in major degradation and poor performance
of thermal imaging system and hence imposes strict
requirement on ROIC for noise compensation in
order to detect the actual change due to infrared
radiation.
1. Introduction
Infrared uncooled thermal imagers have been
employed in a wide range of civilian and military
applications including smartphone cameras,
industrial process monitoring, driver night vision
enhancement, and military surveillance. MEMS
microbolometer thermal detectors are the most
widely used pixel element detectors in today's
infrared uncooled thermal imaging cameras.
Readout topologies extensively discussed in the

literature are pixel-wise [2], column-wise [5] and
serial readout. Pixel-wise readout improves the
noise performance of the microbolometer by
increasing the integration time up to the frame rate.
Column-wise readout reduces the number of
amplifiers and integrators thus serve as a good
compromise between silicon area and parallel
components. Serial readout architecture is read pixel
by pixel and therefore it requires only one amplifier
and integrator results in low power consumption
and compact layout [6].
Microbolometer sensor arrays are fabricated

using micro-electro-mechanical systems (MEMS)
technology and they suffer from process variation
which introduces the fixed pattern noise (FPN) in
detector arrays [1]. At the early stage of sensor
fabrication, sensors resistance discrepancy of
10% is expected [2]. Microbolometer detector
- 316 -
ICEIC 2015
This paper focuses on ROIC design considering

the impact of process variation and self-heating on
its performance. Pair-wise, Serial configuration is
used in which one pair of microbolometer is
selected and biased at a time. Readout is performed
differentially during the pulse duration. Focal plane
array (FPA) consists of 127x92 normal
microbolometers and one row of blind
microbolometers for providing reference to ROIC.
PBIAS (t BIAS ) =
IR =
(1)
TIR =
PBIAS ( BIAS ) BIAS

G.
(7)
Parameter
Value
Nominal Resistance, R0 ()
(2)
100e+3
Pulse Duration, tBIAS (s)
Bias Current, IBIAS (A)
20
Ambient Temperature, T0 (K)
300
Thermal Time Constant, (ms)
11.7 [2]
Temperature Coefficient of Resistance, (%/K)
-2.6 [2]
Thermal Conductance, G (W/K)
3.7e-8 [2]
Thermal Capacitance, H (J/K)
4.34e-10 [2]
Optics F/Number
(3)
Area of Microbolometer Pixel, Ab(m2)
where, is the thermal time constant. Under the

normal condition tBIAS << and T due to selfheating is independent of thermal conductance [7].
If IBIAS is the constant bias current applied to the
microbolometer during the readout, self-heating
power can be expressed as:
2
PBIAS (t BIAS ) = I BIAS
R B (t BIAS )
IR
G
Table 1: Parameters Used In ROIC Simulator
where, is the Temperature Coefficient of

Resistance (TCR) of the detector, Ro is the nominal
resistance of microbolometer and T(tBIAS) is the
temperature change due to the self-heating during
pulse biasing and is given by:
T ( BIAS ) = T T0 =
(6)
The temperature change due to the absorbed

infrared power is given by,
where, H is the thermal capacitance, G is the

thermal conductance of microbolometer, PBIAS is the
bias power and PIR is the incident power absorbed
by microbolometer detector due to incident
radiation. For metallic microbolometer materials,
the resistance RB has linear dependence on
temperature and can be expressed as:
R B (t BIAS ) = R0 (1 + T (t BIAS ))
Ab Tscene dP
( ) 300 K ,
dT
4F 2
where, Tscene is the difference in temperature

between target and ambient, and (dP/dT) 300K, is
change in power per unit area with respect to
temperature change radiated by black body at an
ambient temperature in the wavelength interval
8m-14m [2].
Self-heating is an unavoidable phenomenon

which causes the temperature of thermal detector to
rise even though the bias duration is much smaller
as compared to thermal time constant of detector.
The heat balance equation of microbolometer
including the self-heating can be written as [7]:
dT
+ G.T = PBIAS + PIR
dt
(5)
When FPA is exposed to incident radiation,

difference in radiant flux incoming on
microbolometer can be estimated as,
2. Thermal Modeling of Microbolometer
2
I BIAS
R0 H
2
H I BIAS
t BIAS R0
6.25e-10
Fill Factor of Microbolometer, (%)
62 [2]
Transmission of Infrared Optics, (%)
98 [2]
Absorption of microbolometer membrane, (%)
2.624 [2]
FPA Size
128 x 92
Frame Rate, (frames per second)
(4)
92 [2]
Temperature Contrast (dP/dT) 300K, (WK m )

-1
-2
10
Infrared system parameters mentioned in Table 1.

are taken from [2].
By solving the above equation using (2) and (3),
- 317 -
ICEIC 2015
(8)
next pair of microbolometers. Recently biased

detector pair is left to cool off until the next pulse
for the next reading within the same frame rate is
applied.
where, is the fill factor of microbolometer and

is the portion of microbolometer that absorbs the
incident infrared radiation is the transmission of
optics and is the absorption of microbolometer
membrane in infrared region. When both incident
and bias power are zero, temperature of
microbolometer cools down based on the equation
below [4],
Blind microbolometer is biased once in a column

with first normal microbolometer and it exhibits the
same temperature drift due to self-heating, as the
normal microbolometers, which also can be
drastically minimized using differential approach.
The normal microbolometers are read twice with
each adjacent neighbor except the last normal
microbolometer.
Resistance change of microbolometer detector

due to change in scene temperature can be evaluated
as,
RIR = R0 ( . . . .TIR )
TCOOL ( ) = TB e
(9)
14-bit ADC is used to convert the signal to

digital representation. The blind microbolometer
exhibits the same thermal characteristics as that of
the normal microbolometer but remains unaffected
by incident radiation thus serves as a reference
point. Absolute values of each pixel are then
calculated based on the reference blind
microbolometer after all values are converted into
the digital domain.
where, TB is the temperature of microbolometer

at the end of pulse biasing.
3. Readout Architecture and Simulator

Fig.1. demonstrates the flowchart of the ROIC
simulator. Temperature mapping of a thermal image
is performed at the beginning. For each pixel Tscene
is calculated based on the target temperature and
ambient temperature.
Infrared radiation model evaluates difference in
incoming flux IR, change in bolometer
temperature TIR, and resistance change of
bolometer due to the absorbed incident power RIR
using (6), (7) and (8) respectively. Total resistance
of each pixel is calculated using (10) and is given
by,
RTOTAL = Ro + RPV + RIR
(10)
where, RPV is resistance due to process variation

and is 10% deviation from nominal resistance, RIR
is change of microbolometer resistance due to
incident radiation. Parameters mentioned in Table 1.
and synchronization pulse sequence mentioned in
Table 2. is provided to the ROIC simulator. It
evaluates self-heating power, temperature drift and
change in resistance due to pulse biasing using (5),
(3) and (2) respectively.
A pair of microbolometers is biased twice during
a frame rate and the reading is performed
differentially. Once the readout of the selected pair
is finished, bias current source is switched to the
Figure 1 ROIC Simulator Flowchart
- 318 -
ICEIC 2015
Table 2. shows the synchronization pulse

sequence based on proposed pair-wise serial
configuration where X is the number of rows and Y
is the number of columns. A pair of microbolometer
is selected and provided with a bias current for
specified pulse duration.
Fig.3 shows the temperature variation of the

microbolometer pixel (2, 1) due to self-heating
when given two pulses, one at t = 2s and the
second at t = 82s. From t = 8s to t = 82s and
from t = 88s to t = tframe, both incident and bias
power are zero and hence bolometer cools down as
(9) where tframe is the total time for the readout.
Table 2: Synchronization Pulse Sequence For PairWise Serial Configuration

Pulse #
Selected Microbolometer Detector (BD) Pair
BD(1,i) and BD(2,i)
BD (3,i) and BD(4,i)
(X/2)
BD (X-1,i) and BD (X, i)
(X/2) + 1
BD (2,i) and BD (3,i)
(X-1)
BD (X-2,i) and BD (X-1,i)
i=1Y,
Fig.2. demonstrates the effect of self-heating by
measuring resistance versus bias current for pulse
duration of 20s and 10s. For pulse duration of
20s, increasing the bias current from 1A to 25A
results in a decrease in the nominal resistance Ro by
approximately 7000, which is equivalent to a
temperature rise of 2.5K. In order to minimize the
impact of self-heating, one way is to reduce the bias
current to the lowest practical value as shown in
Fig.2.
Figure 3 Variations in Microbolometer Temperature

with and without IR
Fig.4 shows the voltage variation of the

microbolometer detector pixel (1, 1) and pixel (2, 1)
during the pulse biasing. Individual slopes of both
pixels are 5.348mV/s and 4.2mV/s respectively
while the slope of differential readout signal is
1.148mV/s.
Figure 4 Voltage variation of pixel (1, 1) and pixel (2, 1),

and Differential Readout
Figure 2 Microbolometer Self-Heating for tBIAS= 20s

and tBIAS=10s
- 319 -
ICEIC 2015
Fig.5 (A) shows the input thermal image to

ROIC Simulator taken from [9] which is 320 x240
but cropped to 127x92 for the simulation purpose.
Fig.5 (B) shows the output image of simulator using
proposed architecture mapping a temperature
change of about 12oC.
References
[1] S. J. Hwang, H. H. Shin, and M. Y. Sung, "High
performance read-out IC design for IR image sensor
applications," Analog Integrated Circuits and Signal
Processing, vol. 64, pp. 147-152, 2009.
[2] D. Svrd, C. Jansson, and A. Alvandpour, "A readout
IC for an uncooled microbolometer infrared FPA with
on-chip self-heating compensation in 0.35 m CMOS,"
Analog Integrated Circuits and Signal Processing, vol.
77, pp. 29-44, 2013.
[3] B. F. Andresen, B. Mesgarzadeh, M. R. Sadeghifar,
P. Fredriksson, C. Jansson, F. Niklaus, A. Alvandpour,
G. F. Fulop, and P. R. Norton, "A low-noise readout
circuit in 0.35-m CMOS for low-cost uncooled FPA
infrared network camera," vol. 7298, pp. 72982F72982F-8, 2009.
[4] X.Gu, G.Karunasiri, J.Yu, G.Chen, U.Sridhar, and
W.J.Zeng, "On-chip compensation of self-heating effects
in microbolometer infrared detecto arrays," Sensors and
Actuators A: Physical, vol. 69, pp. 92-96, 1998.
Figure 5 (A) Input Thermal Image 127 x 92 (B)

Simulator Output
5. Conclusion
[5] C. H. Hwang, C. B. Kim, Y. S. Lee, and H. C. Lee,

"Pixelwise readout circuit with current mirroring
injection for microbolometer FPAs," Electronics Letters,
vol. 44, p. 732, 2008.
The ROIC model presented in this paper uses a

pulse bias current scheme to reduce the effect of the
self-heating. Simulation results show that the
temperature drift due to self-heating is compensated
using differential readout but not completely
eliminated due to consideration of very high
resistance discrepancy of 10% due to process
variation. Pulse sequence to each pair of
microbolometer is provided such that they are both
under the same self-heating point along the selfheating trend line i.e. the pair are picked such that
both are biased the same number of times.
Proposed architecture of ROIC requires one
differential amplifier and one 14-bit ADC in order
to reduce the dynamic range requirement, power
dissipation and area at an expense of longer readout
time for large focal plane array.
[6] D. Jakonis, C. Svensson, and C. Jansson, "Readout

architectures for uncooled IR detector arrays," Sensors
and Actuators A: Physical, vol. 84, pp. 220-229, 2000.
[7] X. Qian, Y. P. Xu, and G. Karunasiri, "Self-heating
cancellation circuits for microbolometer," Sensors and
Actuators A: Physical, vol. 111, pp. 196-202, 2004.
[8] S. Eminoglu and T. Akin, "MT3250BA: A 32025650m snapshot microbolometer ROIC for high-resistance
detector arrays," Infrared Technology and Applications
XXXIX, vol. 8704, pp. 87042Y-1, 2013.
[9]SPI infrared. Available: http://www.x20.org/shop/clipon-thermal-rifle-scopes/x27-clip-on-thermal-rifle-scope/
Acknowledgment
The authors gratefully acknowledge the technical
and financial support of The Research Center of
The College of Engineering, Deanship of Scientific
Research, King Saud University.
- 320 -
FO-2-5-6
Passivation Effects in Tin Oxide Thin-Film Transistors

Young-Joon Han, Yong-Jin Choi, Sang-Hun Song, Hong Chang Yeoh1, and Hyuck-In Kwon*
School of Electrical and Electronics Engineering, Chung-Ang University, Seoul 156-176, Korea
1
Analog Devices Inc. San Jose, CA, USA
*
E-mail : hyuckin@cau.ac.kr
. Introduction
Recently, oxide semiconductor-based thin-film transistors
(TFTs) have made an impressive progress in a relatively
short time. However, most of the research for the oxide
TFTs has been focused on the n-type devices including
amorphous indium-gallium-zinc oxide (a-IGZO) TFTs,
which has prevented the implementation of the
complementary logic circuits with oxide TFTs. Since Ogo
et al. [1], tin monoxide (SnO) has attracted special attention
as a channel material of the p-type oxide TFT due to the
potential for high hole mobilities. However, the SnO TFTs
reported thus far have been fabricated without a passivation
layer even though the passivation layer is critical for the
mechanical and chemical protection of the TFTs. From the
previous works for a-IGZO TFTs, it has been known that the
interaction of the semiconductor surface with atmospheric
humidity and oxygen can degrade the electrical performance
of the TFTs [2], [3]. In this work, we investigate the effects
of humidity and oxygen on the electrical performance of ptype SnO TFTs, and present the effective method for the
passivation of SnO TFTs using a SU-8 organic layer.
. Device Structure and Fabrication

The experiments were performed on the bottom-gate type
SnO TFTs, where a heavily doped n-type silicon wafer was
used as a substrate and a gate electrode. A 35 nm-thick
thermally grown SiO2 was employed as a gate insulator,
and a 10 nm-thick SnO thin-film was deposited onto the
SiO2/Si substrate by RF magnetron sputtering with a Sn
target, and a substrate temperature of RT. The as-deposited
SnO thin-films on the SiO2/silicon substrate were subjected
to the rapid thermal annealing (RTA) for 100 seconds at
200 oC. After post-deposition annealing process, the source
and drain electrodes were formed with Ni using the e-gun
evaporator. The active and electrode layers were patterned
using the photolithography and lift-off process. Two
different materials of plasma-enhanced chemical vapor
deposition (PECVD) SiO2 and spin-coated SU-8 were
tested as a passivation layer. PECVD SiO2 was deposited

under the condition of 300 oC, 0.58 Torr, 150 watts RF
power, N 2O/SiH4 ratio of 9.4, and 20 minutes. For SU-8
passivation, G1060 SU-8 resist from Gersteltec was spincoated and prebaked on a hot plate at 65 C for 1
minutes, 95 C for 1 minutes and 130 C for 10 minutes,
respectively.
. Results and discussion

Fig. 1(a) shows the representative transfer curve of the
fabricated SnO TFTs without a passivation layer measured
at a drain-to-source voltage (VDS) of -1.0 V. The curve
exhibits the p-type behavior with a field-effect mobility
(FE) of 1.2 cm2/Vs, a subthreshold slope (SS) of 1.1
V/decade, a threshold voltage (Vth) of 4.1 V, and a current
on/off ratio (Ion/Ioff) of ~2.5 104, where FE was determined
by the maximum transconductance at a VDS of -1.0 V, and
Vth was estimated by the intercept of the extrapolated curve
with a voltage axis. Fig. 1(b) shows the representative
output characteristics of the fabricated SnO TFTs.
Fig. 2(a) shows that the TFT loses its initial
characteristics and the conductivity becomes very low after
forming the passivation layer with PECVD SiO2, which is
believed to be caused from the plasma-induced damage
during the SiO2 deposition process. Much better results are
obtained from the SU-8 passivated devices. SU-8 is an
epoxy-based negative chemically amplified resist that has
been commonly used for the fabrication of high aspect
ratio features [4]. Fig. 2(b) shows that the SU-8 passivated
SnO TFT exhibits similar transfer characteristics with
those of the device without a passivation layer. The
extracted electrical parameters are FE of 1.1 cm2/Vs, SS of
1.3 V/decade, Vth of 3.2 V, and Ion/Ioff of ~2.5 104,
respectively, which are comparable with the electrical
parameters obtained from the device without a passivation
layer in Fig. 1.
Fig. 3(a) and (b) compare the shelf-life stability of the
SnO TFTs without and with a SU-8 passivation layer.
- 321 -
ICEIC 2015
0.6
|IDS|
0.4
|IGS|
0.2 VDS = -1V

W/L = 150m/250m
0.0
-15 -10 -5
0
VGS [V]
10
-7
10
-8
10
-9
10
-10
10
5
10
-11
(b)
7 W/L=150m/250m
VGS= 0 ~ -15V, -3V step
6
5
4
3
2
1
0
15
-14 -12 -10 -8
-6
VDS [V]
-4
-2
Fig. 1. Representative (a) transfer and (b) output

characteristics of the fabricated bottom gate SnO TFTs.
(a)
VGS [V]
|IDS| [A]
|IDS| [A]
-6
10
-7
10
-8
10
-9
10
-10
no passivation
10
PECVD SiO2 passivation
-11
10
-12
10
VDS = -1V
-13
10
-14 W/L = 150m/250m
10
-15 -10 -5
0
5
10
10
-6
10
-7
10
-8
10
-9
10
15
(b)
-6
10
-7
10
-8
10
-9
10
-10
10
-11
(a)
as-fabricated
50 days after
100 days after
no passivation
-15
-10
-5
10
-6
10
-7
VGS [V]
10
15
10
-8
10
-9
10
-10
10
-11
(b)
SU-8 passivation
-15
as-fabricated
50 days after
100 days after
-10
-5
VGS [V]
10
15
Fig. 3. Long term durability of the SnO TFTs (a)

without and (b) with a SU-8 passivation layer. During
the experiments, the devices were stored in a room,
exposed to air ambient.
VDS = -1V
W/L = 150m/250m
References
no passivation
SU-8 passivation
-10
-15
10
|IDS| [A]
|IDS| [A]
0.8
-6
|IDS| [A]
1.0
10
|IDS|, |IGS| [A]

|IDS| [A]
(a)
1.2
-10
-5
VGS [V]
10
15
Fig. 2. Transfer curves of the SnO TFT before and

after forming the passivation layer with (a) a PECVD
SiO2 and (b) a SU-8.
During the experiments, the devices were stored in a room,
exposed to air ambient. Fig. 3(a) shows that the fabricated
SnO TFT without a passivation layer exhibits the electrical
performance degradation as the aging time increases, but
the device with a SU-8 passivation layer presents
remarkable stability over time with a negligible variation of
on-current and Vth (Fig. 3(b)). It has been known that the
SnO is a metastable phase [5], but our experimental results
show that the suitably passivated p-type SnO TFT can
successfully retain stable performance for a long time.
. Conclusion
In this article, we examine the effects of passivation layer
on the long-term durability and bias stress stability in ptype SnO TFTs. The electrical performance of the SnO
TFTs without a passivation layer was hardly affected by
the oxygen partial pressure in the environments. For the
stable operation of SnO TFTs, two different materials of
PECVD SiO2 and spin-coated SU-8 were tested as a
passivation layer. The TFT lose its initial characteristics
and the conductivity becomes very low after forming the
passivation layer with PECVD SiO2, but no significant
degradation was observed in the electrical performance of
SU-8 passivated devices. The SnO TFTs with a SU-8
passivation layer show much improved long-term
durability under air environments compared to the devices
without a passivation layer.
[1] Y. Ogo, H. Hiramatsu, K. Nomura, H. Yanagi, T.

Kamiya, M. Hirano, and H. Hosono, P-channel thin-film
transistor using p-type oxide semiconductor, SnO, Appl.
Phys. Lett., vol. 93, no. 3, pp. 032113-1-032113-3, Jul.
2008.
[2] J. S. Park, J. K. Jeong, H. J. Chung, Y. G. Mo, and H.
D. Kim, Electronic transport properties of amorphous
indiumgalliumzinc oxide semiconductor upon exposure
to water, Appl. Phys. Lett., vol. 92, no. 7, pp. 072104-1072104-3, Feb. 2008.
[3] D. Kang, H. Lim, C. Kim, I. H. Song, J. Park, J. Chung,
and Y. Park, Amorphous gallium indium zinc oxide thin
film transistors: sensitive to oxygen molecules, Appl. Phys.
Lett., vol. 90, no. 19, pp. 192101-1 192101-3, May 2007.
[4] A. Olziersky, P. Barquinha, A. Vila, L. Pereira, G.
Goncalves, E. Fortunato, R. Matins, and J. R. Morante,
Insight on the SU-8 resist as passivation layer for
transparent Ga2O3In2O3ZnO thin-film transistors, J.
Appl. Phys., vol. 108, no. 6, p. 064505-1-064505-7, Sep.
2010.
[5] X. Q. Pan and L. Fu, Oxidation and phase transitions
of epitaxial tin oxide thin films on (1012) sapphire, J.
Appl. Phys., vol. 89, no. 11, pp. 6048-6055, Jun. 2001.
Acknowledgements
government (MEST) (No. 2014-005368) and by
NanoMaterial Technology Development Program through
the National Research Foundation of Korea(NRF) funded
by the Ministry of Science, ICT and Future Planning
(2009-0082580).
- 322 -
ICEIC 2015

Oral Session
FO-3-3
Access Networks and Systems III
FO-3-3-1
,QWHUIHUHQFH0LWLJDWLRQLQ+HW1HWVXVLQJ3RZHU&RQWURODQG%HDP)RUPLQJ
.RQMHWL9LVZDQDGK*DULPHOOD5DPD0XUWK\
63&5&,QWHUQDWLRQDO,QVWLWXWHRI,QIRUPDWLRQ7HFKQRORJ\+\GHUDEDG
NRQMHWLYLVZDQDGK#UHVHDUFKLLLWDFLQUDPPXUWK\#LLLWDFLQ
$EVWUDFW
)HPWR &HOOV WKDW DUH LQVWDOOHG LQ PDFUR FHOOXODU
QHWZRUN IRUPV D WZRWLHU +HWHURJHQHRXV QHWZRUN
\LHOGLQJ DQ LQWHUIHUHQFH SUREOHP EHWZHHQ WKH WZR
OD\HUV 7KH LQWHUIHUHQFH PDQDJHPHQW LV RI D JUHDW
FRQFHUQWRGHSOR\IHPWRFHOOV7RDGGUHVVLQWHUIHUHQFH
LVVXH ZH SURSRVHG DQ LQWHJUDWHG WHFKQLTXH RI SRZHU
FRQWURODQGEHDPIRUPLQJZLWKRXWDQ\UHTXLUHPHQWRI
FKDQQHO VWDWH LQIRUPDWLRQ &6, 7KH EHDP IRUPLQJ LV
LPSOHPHQWHG E\ WKH XVH RI GLUHFWLRQ RI DUULYDO 'R$
XVLQJ DGDSWLYH DQWHQQD V\VWHPV 6LPXODWLRQV VKRZ D
FOHDU LPSURYHPHQW LQ PLWLJDWLQJ WKH FURVVWLHU
LQWHUIHUHQFH
.H\ZRUGV+HW1HWV3RZHUFRQWURO%HDPIRUPLQJ
'LUHFWLRQRIDUULYDODGDSWLYHDQWHQQDVV\VWHPV
,QWURGXFWLRQ
5HVHDUFKHUV VKRZ WKDW PRVW RI WKH GDWD WUDIILF LQ
FHOOXODUQHWZRUNLVJHQHUDWHGIURPLQGRRUHQYLURQPHQWV
:KLOH RQ WKH RWKHU KDQG WKH SHQHWUDWLRQ ORVVHV PDNH
WKH UHFHSWLRQ GLIILFXOW LQ LQGRRU HQYLURQPHQWV )HPWR
FHOOLVDRQHRI WKHEHVW ZD\VWRDOOHYLDWH WKHVHLVVXHV
%XW WKH UDQGRP GHSOR\PHQW RI IHPWR FHOOV FUHDWHV
LQWHUIHUHQFH WR WKH H[LVWLQJ FHOOXODU QHWZRUNV VXFK DV
,(((PRU*33/7(IRUPVWZRWLHU+HW1HWV
7R PLWLJDWH VXFK LQWHUIHUHQFH SUREOHPV WKH EDVLF
VWUDWHJ\HPSOR\HGZKLOHLQVWDOOLQJWKHIHPWRFHOOVLVWR
HLWKHU DEDQGRQ WKH VSHFWUXP EDQG XVHG IRU QHDUE\
PDFUREDVHVWDWLRQRUWRFRQWUROLQWHUIHUHQFHOHYHOV%XW
DEDQGRQLQJ WKH EDQG ZRXOG UHVXOW LQ UHGXFWLRQ RI
HIILFLHQF\ RI IHPWR FHOO XWLOLW\ +HQFH WKH ODWWHU LV
JHQHUDOO\DSUHIHUUHGDSSURDFK
,QDW\SLFDOVFHQDULRWKHIHPWRFHOOXVHUVZRXOG EH
VDYHG IURP WKH LQWHUIHUHQFH FDXVHG E\ 0%6 E\
FRQWUROOLQJ WUDQVPLW SRZHU ZUW 6,15 +RZHYHU )%6
ZLOO FDXVH VLJQLILFDQW LQWHUIHUHQFH WR L QHLJKERULQJ
)%6 DQG LL QHDUE\ 0%6 XVHUV 7KH LQWHUIHUHQFH
SUREOHPWRWKHIRUPHULVDGGUHVVHGLQ >@DQLQWHOOLJHQW
YDULDWLRQRISRZHUFRQWUROPHWKRGGLVFXVVHGLQVHFWLRQ
:KLOH VROYLQJ WKH LQWHUIHUHQFH SUREOHP FUHDWHG E\
WKHIHPWRFHOOWRWKHQHDUE\0%6XVHUVLVWKHVXEMHFWRI
WKLV SDSHU ,Q WKLV SDSHU ZH SURSRVH D WHFKQLTXH LQ
ZKLFKQHDUE\ 0%6XVHUVFRXOGEHDYRLG E\ WKH XVDJH
RIPXOWLSOHDQWHQQDVDWIHPWRFHOODFFHVVSRLQW
6HFWLRQ H[SODLQV WKH SUHYLRXV ZRUN 7KH SURSRVHG
VROXWLRQ IRU LQWHUIHUHQFH PLWLJDWLRQ LV SUHVHQWHG LQ
VHFWLRQ 6LPXODWLRQ UHVXOWV DUH SORWWHG LQ VHFWLRQ
IROORZHGE\FRQFOXVLRQLQVHFWLRQ
%DFNJURXQG
7KH PDMRU FKDOOHQJHV HQFRXQWHUHG E\ +HW1HWV >@
LQFOXGH GHVLJQ RI PXOWL WLHU QHWZRUNV LQWHUIHUHQFH
PDQDJHPHQW VSHFWUXP UHVRXUFH DOORFDWLRQV DQG
EDFNKDXO PDLQWHQDQFH DQG UHODWHG LVVXHV ,QWHUIHUHQFH
PDQDJHPHQWLVWKHVXEMHFWRIWKLVSDSHU
7KHLQWHUIHUHQFHLQWZRWLHU+HW1HWVDUHFODVVLILHGLQWR
WKHIROORZLQJIRXUW\SHV
,QWHUIHUHQFH IURP PDFUR FHOO EDVH VWDWLRQ WR
IHPWRFHOOXVHUV
,QWHUIHUHQFH IURP QHDUE\ PDFUR FHOO XVHUV WR
IHPWRFHOOXVHUV
,QWHUIHUHQFH IURP IHPWR FHOO EDVH VWDWLRQ WR
QHDUE\PDFURFHOOXVHUV
,QWHUIHUHQFH IURP IHPWR FHOO EDVH VWDWLRQ WR
QHLJKERULQJIHPWRFHOOXVHUV

7KH WZR FRPPRQ VROXWLRQV RIIHUHG WR PLWLJDWH
LQWHUIHUHQFH DUH LQWHUIHUHQFH FRQWURO DQG LQWHUIHUHQFH
DYRLGDQFH 0RVW RI WKH SUHYLRXV ZRUNV UHTXLUH HLWKHU
WKHFKDQQHOVWDWHLQIRUPDWLRQ&6,RUWKHFRRUGLQDWLRQ
IURP WKH PDFUR FHOO EDVH VWDWLRQV 2QH RI WKHVH
WHFKQLTXHV
LQFOXGH
,QWHU&HOO
,QWHUIHUHQFH
&RRUGLQDWLRQ ,&,& >@ DV QDPH VXJJHVWV LW
FRRUGLQDWHV EHWZHHQ QHLJKERULQJ IHPWR FHOOV WR DYRLG
WKH LQWHUIHUHQFH %XW WKLV FRRUGLQDWLRQ ZLOO EHFRPH
FRPSOH[ DV WKH QXPEHU RI IHPWR FHOOV LQFUHDVHV 7KH
RWKHUFRPPRQO\HPSOR\HGWHFKQLTXHLV3RZHU&RQWURO
>@ LQ ZKLFK WKH WUDQVPLW SRZHU RI IHPWR FHOO EDVH
VWDWLRQLVFRQWUROOHGWRPLWLJDWHLQWHUIHUHQFHW\SHDQG
W\SH %XW LW LQ WXUQ LQFUHDVHV WKH QHLJKERULQJ
- 324 -
ICEIC 2015
LQWHUIHUHQFHV W\SH %DVLF EHDP IRUPLQJ WHFKQLTXHV
UHTXLUH FKDQQHO VWDWH LQIRUPDWLRQ ,Q DGGLWLRQ WKH
SUHYLRXV ZRUNV GR QRW FRXQWHU DOO WKH IRXU W\SHV RI
LQWHUIHUHQFH
,Q WKLV SDSHU SRZHU FRQWURO DQG EHDP IRUPLQJ
DSSURDFKHV DUH HPSOR\HG WR FRXQWHU DOO WKH W\SHV RI
LQWHUIHUHQFHHVSHFLDOO\WKHLQWHUIHUHQFHIURPIHPWRFHOO
EDVHVWDWLRQWRQHDUE\PDFURFHOOXVHUVDQGLQWHUIHUHQFH
IURPIHPWRFHOOEDVHVWDWLRQ WR QHLJKERULQJ IHPWR FHOO
XVHUV
3RZHU&RQWURODQG%HDP)RUPLQJ
\N W = ZQ H M ZW + QN

Q =
:KHUH
ZQ UHSUHVHQWV WKH YDOXH RI FRPSOH[
ZHLJKWDSSOLHGWRWKHRXWSXWRIQWKHOHPHQW7KXVE\
RSWLPDO FKRLFH RI ZHLJKWV WKH DUUD\ ZLOO UHFHLYH D
ZDQWHG VLJQDO IURP GLUHFWLRQ N DQG UHFHLYH QXOOV
IURP WKH VRXUFHV ORFDWHG LQ WKH GLUHFWLRQ RWKHU WKDQ
N /LNHZLVHZHLJKWLQJQHWZRUNFDQEHRSWLPL]HGWR
VWHHU EHDPV LQ WKH ZDQWHG GLUHFWLRQ DQG QXOOV WR WKH
XQZDQWHGGLUHFWLRQ
,QWKLVSDSHUZHLQWHJUDWHSRZHUFRQWURODQGEHDP
IRUPLQJWHFKQLTXHVVRWKDWDOOWKHW\SHVRILQWHUIHUHQFH
DUHPLWLJDWHG
L 3RZHU&RQWURO
:HSURSRVHDWKUHVKROGUDQJHUDWKHUWKDQWKUHVKROG
OHYHO 7KLV WKUHVKROG UDQJH ZRXOG YDU\
IURP 7K/ < 6,15 < 7K8 ZKHUH WKH ORZHU ERXQG
7K/ JLYHV WKH PLQLPXP UHTXLUHG 6,15 YDOXH ZKLOH
WKH XSSHU ERXQG 7K8 JLYHV WKH PD[LPXP DOORZHG
6,15 YDOXH 7KH IRUPHU LV WKH GHILQLQJ SDUDPHWHU WR
RYHUFRPH WKH FURVVWLHU LQWHUIHUHQFH W\SH DQG W\SH
:KLOH WKH ODWWHU LV WR WDFNOH FRWLHU LQWHUIHUHQFH
W\SH DV LW FRQVWUDLQV WKH QHLJKERULQJ LQWHUIHUHQFH
SRZHUOHYHOV>@
LL %HDP)RUPLQJ
%HDP IRUPLQJ 0XOWLSOH DQWHQQD V\VWHP LV RQH RI
WKHVROXWLRQVWRW\SHLQWHUIHUHQFH,QWKLVSDSHUEHDP
IRUPLQJLVDFFRPSOLVKHGWKURXJKWKHXVDJHRIDGDSWLYH
DQWHQQD V\VWHP DQG FRPSXWLQJ GLUHFWLRQ RI DUULYDO
'R$,Q)LJVKRZWKHDGDSWLYHDQWHQQDV\VWHPV>@
FRQVLVWV RI D QDUURZ EDQG VLJQDO RI ZDYHOHQJWK
)LJ$GDSWLYHDQWHQQDV\VWHPHPSOR\HGLQRXUSDSHU
WRHVWLPDWH'R$DQGEHDPIRUPLQJ>@
7KH ZHLJKWV RI WKH DOJRULWKP ZQ DUH FRPSXWHG E\
PLQLPL]LQJ WKH RXWSXW SRZHU ZKLOH PDLQWDLQLQJ WKH
XQLW\UHVSRQVHLQWKHGHVLUHGGLUHFWLRQLH

0LQLPL]DWLRQRI Z
5;; Z
6XEMHFWHGWR Z QN =
DUULYHV DW 1 HOHPHQW DUUD\ IURP GLUHFWLRQ N IURP
:KHUH 5;; UHIHUVWRLQSXWFRYDULDQFHPDWUL[
WKH DQWHQQD ERUH VLJKW $VVXPLQJ ILUVW HOHPHQW LQ WKH

DUUD\ DV WKH SKDVH UHIHUHQFH DQG G HTXDOV WKH DUUD\
VSDFLQJ WKH UHODWLYH SKDVH VKLIW RI WKH UHFHLYHG VLJQDO
DWQWKHOHPHQWFDQEHH[SUHVVHGDV
7KLVFDQEHDFKLHYHGXVLQJ/HDVW0HDQ6TXDUH/06
>@
QN =
G Q
VLQ N

7KHVLJQDODWRXWSXWRIHDFKRIWKHDQWHQQDHOHPHQWV
FDQEH
; QN = H M ZW + QN
$QGWRWDODUUD\RXWSXWLQGLUHFWLRQRI N DV

6LPXODWLRQ5HVXOWV

,Q ILJ RQH FDQ LQIHU WKDW WKH SUREDELOLW\ RI
LQWHUIHUHQFH WR PDFUR FHOO XVHUV GXH WR IHPWR FHOOV
ZRXOG VLJQLILFDQWO\ UHGXFH E\ HPSOR\LQJ EHDP
IRUPLQJ ,Q ILJ WKH VLJQLILFDQW UHGXFWLRQ LQ
LQWHUIHUHQFHOHYHOVFDQEHREVHUYHG HYHQDWQXPEHU RI
DQWHQQDHOHPHQWVHTXDOWRRU
- 325 -
ICEIC 2015
>@ 3DXOL 9RONHU -XDQ 'LHJR 1DUDQMR DQG (LNR 6HLGHO

+HWHURJHQHRXV /7( QHWZRUNV DQG LQWHUFHOO LQWHUIHUHQFH
FRRUGLQDWLRQ:KLWH3DSHU1RPRU5HVHDUFK
>@ *HVEHUW 'DYLG HW DO 0XOWLFHOO 0,02 FRRSHUDWLYH
QHWZRUNV $ QHZ ORRN DW LQWHUIHUHQFH 6HOHFWHG $UHDV LQ
&RPPXQLFDWLRQV,(((-RXUQDORQ
>@ 6KDNLU 0 = DQG 7 6 'XUUDQL 1DUURZEDQG
EHDPIRUPLQJ DOJRULWKP IRU VPDUW DQWHQQDV ,QWHUQDWLRQDO
%KXUEDQ &RQIHUHQFH RQ ,((( $SSOLHG 6FLHQFHV
7HFKQRORJ\,%&$67

3RZHUFRQWURO
%HDP)RUPLQJQ
%HDP)RUPLQJQ
3UREDELOLW\RI,QWHUIHUHQFH

7UDQVPLWSRZHULQP:

)LJ)HPWRFHOODFFHVVSRLQWWUDQVPLWSRZHUYVSUREDELOLW\RI
LQWHUIHUHQFHWRQHDUE\PDFURXVHUV

3UREDELOW\RI,QWHUIHUHQFH

1XPEHURIHOHPHQWVDW%6

)LJ1XPEHURIDQWHQQDHOHPHQWVDWIHPWRFHOODFFHVVSRLQWYV
SUREDELOLW\RILQWHUIHUHQFHWRQHDUE\PDFURXVHUV
&RQFOXVLRQ
7KHFRPELQDWLRQRILQWHOOLJHQWSRZHUFRQWURODQGEHDP
IRUPLQJUHVXOWHGLQVLJQLILFDQWUHGXFWLRQRIDOOWKHIRXU
W\SHV RI LQWHUIHUHQFHV HVSHFLDOO\ WKH W\SH
LQWHUIHUHQFH 7KLV WHFKQLTXH GRHV QRW UHTXLUH DQ\ &6,
IRULPSOHPHQWDWLRQ
5HIHUHQFHV
>@ . 9LVZDQDGK * 5DPD 0XUWK\ $ &RJQLWLYH )HPWR
&HOO $FFHVV 3RLQW LQ +HW1HWV WR 0LWLJDWH ,QWHUIHUHQFH
DFFHSWHGIRU,&,&7
>@6ZDOHV6LPRQ&HWDO7KHSHUIRUPDQFHHQKDQFHPHQW
RIPXOWLEHDPDGDSWLYHEDVHVWDWLRQDQWHQQDVIRUFHOOXODUODQG
PRELOH UDGLR V\VWHPV9HKLFXODU 7HFKQRORJ\ ,(((
7UDQVDFWLRQVRQ
>@ $GLED(/)DGO$QRXDU'DOOLDQG6HGGLN%UL&LUFXODU
3DWFK $UUD\ IRU 6PDUW $QWHQQD LQ &%DQG-RXUQDO RI
:LUHOHVV 1HWZRUNLQJ DQG &RPPXQLFDWLRQV

- 326 -
FO-3-3-2
Sensors Network Deployment under Irregular Conditions

1
Imen Arfaoui1, Noureddine Boudriga1 and Khalifa Trimche2

CN&S Research Lab, SUPCOM, University of Carthage, Tunis, Tunisia
2 Faculty of Science of Tunis, Tunis, Tunisia
{arf.imen, noure.boudriga2} @gmail.com, khlifa.trimeche@fst.rnu.tn
Abstract
Wireless Sensor Networks (WSNs) are used in many

fields such as military monitoring, health care,
weather monitoring, commodity tracking, and home
control. Many of these applications require full
coverage and connectivity. In particular, to ensure full
sensing and connectivity coverage in these
applications the most investigated issue was the
deployment of WSN under regular conditions. In this
paper, we focus on the deployment of wireless sensors
to monitor two-dimensional areas (2D areas) under
irregular conditions for applications requiring
coverage constraints. The proposed deployment model
aims at ensuring full sensing and connectivity when
dropping the sensors from air, taking into account
irregular conditions such as the wind conditions and
the rugged nature of the terrain. In fact, we provide
mathematical expressions to estimate dropping times
and sensors landing positions using parameters such
as the wind speed intensity and direction, altitude and
velocity of the quadcopter used for dropping.
Keywords: Wireless sensor network, deployment,
irregular conditions, coverage, connectivity.
1. Introduction
Recently, wireless sensor networks (WSNs) have
attracted a lot of attention thanks to the rapid
development in sensor and wireless technology, which
allows the use of WSNs for a wide variety of purposes.
WSNs are sets of large numbers of small, lower-power
devices equipped with integrated sensing and wireless
communication capabilities. They usually employ low
quality radio modules and have a dynamic topology
and resource constrained device nodes. The above
network consists of thousands of wireless node
distributed in a geographical area.
WSNs have appeared among of the most important
research areas thanks to their great potential to support
a large range of real world applications ranging from

home applications to battle field surveillance.
Examples of applications, where WSNs have proved
efficiency, include monitoring of a temporary industrial
worksite, damage assessment after a disaster, precision
farming, intruder detection in a warehouse, health
monitoring of a building. Therefore, to avoid missing
of valuable measurements and information and to have
an efficient monitoring in these highly sensitive
applications, the deployed WSN should ensure high
coverage and connectivity quality.
Under full sensing and connectivity coverage of the
area of interest, any particular phenomenon occurring
in this area is detected by at least one sensor and
reported to the sink node. In fact, an efficient sensing
and reporting strategy needs an optimal choice of the
deployed sensors number and locations.to ensure full
coverage and connectivity, the most investigated issue
has been the deployment technique to set up in the
design of the WSN. However, most of the proposed
deployment strategies in the literature have been built
using simplified theoretical assumptions and conditions,
where the sensors are deployed without taking into
account the real conditions that may be faced during
the deployment. Since this idealistic condition does not
hold all time in practical deployment situations, a good
deployment strategy taking into account irregular
conditions should be analyzed and developed.
We propose in this paper, a sensor deployment
method that aims to drop sensors using unmanned
quadcopter in a 2D area of interest. The proposed
deployment method aims to reduce the drawbacks
observed with techniques that do not take into account
real dropping conditions. The main contributions of
this paper are as follows:
We build a dropping scheme, from air, capable of
determining sensor dropping point in order to
provide realistic control on the landing positions of
the deployed sensors taking into account the
variations of environmental factors including wind
speed and direction.
- 327 -
ICEIC 2015
We provide mathematical expressions to estimate
the dropping times and sensors landing positions
using parameters such as the wind speed intensity
and direction, altitude and velocity of the
quadcopter, and area geography.
The remaining of this paper is organized as follows.
Section 2 reviews the studies that have been conducted
to address the deployment in WSN. We give the
architectural issues of the network in Section 3. In
Section 4, we propose our deployment scheme to fully
cover an area with irregular wind forces. We show in
this section, in a first step, the deployment model of our
system by mathematical calculations of the forces
applied on the sensor when dropped from the
quadcopter and, in a second step, the impact of wind
forces on the deployment strategy. Section 5 presents
some simulations results. Finally, we conclude in
Section 6.
2. Related works
To set up the design of WSNs, the most
investigated issue is the sensor deployment. It consists
to decide what type of sensor nodes is needed and
where it should be deployed in order to achieve the
required network performances. The goal of the WSN
aims essentially to maximize the sensing and
communication coverage. Usually, sensors can be
placed in an area of interest, either deterministically or
randomly. A considerable literature addressing various
deployment methods either for random or deterministic
deployment in WSNs has been developed. In general,
the deterministic nodes deployment can be considered
as static nodes placement with controlled deployment.
However, the random deployment can be classified into
two classes namely, the static nodes placement with
random deployment and the dynamic nodes placement
with random deployment [1].
In the first category of deployment, the static nodes
placement with controlled deployment [2, 3], sensors
are static and do not change their positions. Using this
method allows an optimal and guaranteed quality of
coverage where the deterministic sensors are placed in
positions chosen to achieve better and full monitored
area coverage. Static sensors deployment requires prior
knowledge of the deployment locations and the overall
geometry of the deployment area. However, positioning
the static sensor nodes at specific places necessitates
line of sight communication, and easy, direct and full
control of the monitored area. This fail hardly and not
always guaranteed on hazardous, constrained and large
monitored areas, due to the nature of geographic
environment and since the sensors cannot be placed in
positions chosen to ensure full coverage of the

monitored area. Hence, deployments with static nodes
placement are not suitable for large scale and
constrained applications.
On the other hand, the random deployment consists to
randomly spread sensors in the monitored area. In this
deployment strategy, one can found the static node
placement with random deployment and the dynamic
nodes placement with random deployment, where
nodes may change their position after random
deployment. The drawback of static random
deployment is that the required coverage and desired
connectivity might not be achievable [1,2]. The
problem becomes more complex with the occurrence of
obstacles in the environment and in hazardous area.
Furthermore, assuming that the deployed sensors are
able to move within the monitored area [1,4,5], the
goal is to increase the coverage quality in order to get
the required quality of coverage by commanding the
sensors to move and change their positions.
Nevertheless, because the distribution of the sensors
may not be uniform in the given area, these methods do
not allow ensuring total sensing and communication
coverage to report all collected events. In general,
randomly deployed sensors either statics or dynamics
may result in irregular density of sensor nodes where
only certain area is covered by sensor nodes.
Despite of their significant studies, these researchers
only focus on the deployment of WSN either
deterministically or randomly over regular constraints
and assumptions. For that reason, all these methods are
subject to many drawbacks related to the high cost they
generate, the high energy consumption and the irregular
nature factor and depend on the constrained application
targeted to continuously monitor 2D areas,. Therefore,
some recent works have focused on deployment of
WSN while taking into account the irregular conditions.
A previous work related to the deployment of a WSN
with wind conditions has been introduced in [6]. The
proposed method has been used to deploy WSN under
wind conditions, but no study was done regarding the
vertical wind conditions which may have a great impact
on the sensor landing position and no prediction
method of the sensors dropping times and positions
was done.
Furthermore, an application was proposed in [7] to
enhance coverage quality in WSN. The proposed
method highlights different kinds of irregularity that
may be faced. Moreover, authors in [8] studied the
effects of environments with different characteristics
(e.g., vegetation) and assess the overall trends induced
by the environment in a more systematic and holistic
way, by taking into account seasonal and daily
- 328 -
ICEIC 2015
variations. Even though the proposed methods present
an important approach for the deployment of WSN in
the presence of irregularity, they may not be directly
applicable in outdoor 2D constrained applications
where the irregularity phenomenon is studied after
deploying sensors, which does not meet the
requirement of constrained applications.
A good sensor deployment method is necessary,
thus, to deploy real world WSN taking into account the
climate conditions, the nature of the monitored area,
and the obstacle irregularities in target area for 2D
constrained applications
3. Network Architecture
Assume given an area to be covered using WSNs, the
deployment scheme we propose assumes the dropping
of sensors from air using unmanned quadcopters [9].
The role of the quadcopter is to drop sensors from air
at specific locations and times. Figure 1 shows an
example of a quadcopter used to in [9].
essentially by obstacles. Several types of obstacles can

be found inside realistic deployment areas.
Third, irregularity due to environmental factors,
such as wind. Among the causes of temporal variations
of the sensor landing position, one can mention wind
speed and direction variation, which represent relevant
variation [10]. Different kind of wind speed can be
present varying from low to calm and windy wind [11]
depending on the geographical place and height and the
local situations (buildings, open field, sea, etc.). Wind
speed variation can affect the sensors landing positions
and times. Hence it is essential to model the wind speed
variation when deploying real world WSN.
Due to space restrictions, we have decided in this paper
to only discuss the most relevant kinds of irregularity,
namely the irregularity due to the wind and the terrain
irregularity, and leave the other kinds of irregularity
mentioned above for the long version of the paper. In
addition, we propose expressions to deal with the
rugged nature of the terrain, which will be described
and explained in details in further work.
4. Deployment Strategy
4.1. Deployment model
Figure1: An example of unmanned quadcopter

Considering the characteristic of the monitored area
and environment, three kinds of irregularities can be
faced when deploying sensors. These irregular
conditions affect the deployment of WSN and hence
the network performance. Hence, one should take into
account these irregular conditions when deploying
realistic WSNs.
First, irregularity due to the area geography. The
nature of monitored area in which sensors are dropped
may be rough, hazardous with varying vegetation.
Depending on the vegetation type and density the
monitored area, where we will drop sensors, may be
different from one place to another. The rugged nature
of the terrain may impact the deployment of sensors
and functions.
Second, irregularity due to obstacles and
environmental factors [7]. The real behavior of a
sensor sensing and communication range is not the
same in all directions due to obstacles and vegetation.
The ranges are non-circular but irregular caused
In this subsection, we define the deployment

method used to deploy sensors and present the
mathematical expressions to determine their landing
positions and times within the area to monitor and
control coverage, when the environmental factors are
varying during deployment. We assume that sensor will
land in an horizontal ground path. We consider an
orthonormal basis (Ox,Oy,Oz) with the following
parameters.
m is the mass of the dropped sensor,
V0=(Vo,0,0) is the velocity of the quadcopter
(assumed to be parallel to the x-axis),
h is the altitude of the quadcopter when the

sensors are dropped,
F=(Fx,Fy,Fz) is the force of the wind

according to the x, y and z axis.
Using the above parameters, we will estimate the
falling position of the sensor PosF(t). The falling path
and the forces applied on the sensors during falling
down are represented by Figure2.
- 329 -
ICEIC 2015
The landing position of the dropped sensor is given
then by the following:
Pos Land (t Land ) (
Fx h
V0
g
Fz
m
2h F y h
,
,0)
g
Fz
g Fz
m
m
(5)
where the landing time is given by:

t Land
Using the fundamental principle of dynamics, we

determine the falling position of the sensor dropped at
t =0sec from the quadcopter (origin).
Pos F (t ) V (u )du
(1)
where the velocity of the dropped sensor is given as

follows:
t
V (t ) (
0
t
t
F (u )
Fx (u )
Fz (u ) mg
du V0 , y
du,
du ) (2)
m
m
m
0
0
Therefore, the falling position at time t on the three

axes is given by the following equation:
t u
Pos F (t ) (
0 0
t u
Fy ( w)
Fx ( w)
dwdu V Ot ,
dwdu,
m
m
0 0
(3)
t u
Fz ( w)
1
dwdu gt )
m
2
0 0
Particularly, we could estimate the parameter in

equation (3) if we consider that during the sensor
dropping, the wind forces are constants. The falling
position at time t will be at this case as follow:
PosF (t ) (
F
Fx
1 F
t V0 )t , y t , ( z g )t )
2m
2m
2 m
(4a)
4.2. Impact of wind forces on the deployment

model
Using the result achieved in the previous subsection,
we will evaluate the effect of wind on the deployment
model. First, due to the effect of vertical wind Fz, the
duration of the landing time may vary from one drop to
another. Second, we will analyze the effects of wind on
the sensor landing position. Since, for a further work,
the quadcopter equipped with a camera, after having
thrown the sensor, will take a picture of the sensor
landing environment. The picture has to provide a full
view of the sensor landing position and the
environmental conditions of the sensor landing
environment. Therefore, when dropping the sensors, a
sensor visibility distance should be estimated and
included such that the dropped sensor position can be
captured in the picture. According to the landing time,
let d be the visibility distance, the landing position
should be then at most d verifying the following
equation:
2
2
X Land
YLand
d
(4b)
(7)
Where (XLand,YLand) is the landing position of the

dropped sensor according to the x-axis and y-axis.
Equation (7) can be written then as:
(
The landing position of the dropped sensor is therefore

governed by equation (4b):
1 F
( z g )t h
2 m
(6)
Having these information, we will provide deployment

strategies of WSNs that have the ability to dynamically
adapt to changing environments to control sensors
dropping times and positions in order to ensure full
coverage and connectivity by controlling the distance
between landing positions.
Figure2: Falling path and applied forces
2h
Fz
g
m
Fx h
V0 .
g
Fz
m
Fy h
2h
) (
) d
Fz
g
Fz
g
m
m
(8)
If we assume V0 and h are constants, one can deduce

from equation (8) the effects of wind forces on the
sensor landing position.
- 330 -
ICEIC 2015
Furthermore, to ensure a successful deployment of
WSN with full coverage and connectivity, we will
predict the landing position of the second dropping
sensor which requires precise prediction method.
This method aims to develop the mathematical
expressions that will consider the time separating two
dropping sensors in order to get a distance lower than a
given between two successive landing points.
Pos Land, 2 Pos Land,1
(9)
Hence, to estimate the second landing position

taking into accounts the wind variations between two
successive drops, one should determine the dropping
time and position of the second sensor.
Since the wind forces F = (Fx, Fy, Fz) are variable
from one drop to another, for the 2 nd drop, the wind
forces are given as follow:
F2 = (Fx,2, Fy,2, Fz,2)
(10)
Knowing that the first sensor is dropped from a

position P1=(X1=0,0,h), the second sensor will be
dropped then from a position P2= (X2,0,h). According
to equation (5), the second sensor landing position will
be estimated at:
Pos Land (t Land, 2 ) ( X 2 (

Fy , 2
Fx , 2
2m
t Land, 2 V0 )t Land, 2 ,
(11)
2
Land, 2
t
,0)
2m
One can deduce, from equation (9), that:
( X Land, 2 X Land,1 ) 2 (YLand, 2 YLand,1 ) 2
(12)
According to equations (11) and (12), the second

sensor dropping position X2 according to x-axis can be
estimated as follows:
X 2 (
Fx , 2
2m
2 (
(t Land,1
Fy , 2
2m
2
2
)
t Land
,1 )
V0
2m
(t Land,1
Fx ,1
(13)
Fy ,1
2
2
2
)
t Land
,1 )
V0
2m
Therefore, the dropping time of the second sensor t2 is

given by:
X
(14)
t2 2
V0
Having determined the dropping time and position of
the second sensor, one can deduce the dropping time
and position of the remaining sensors deployed in the
network taking into account wind conditions.
As mentioned before, when deploying sensors, one

should take into account not only the wind conditions,
but also the varying environment areas. Therefore, to
take into consideration the rugged nature of the terrain,
we assume z=P(x,y) the equation of the terrain. The
sensor landing position PosLand=(Px,Py,Pz)is then given
by the intersection point between the sensor parabolic
trajectory and the terrain surface z = P(x,y).
To determine the sensor landing position, one can solve
the system Pz = P(x,y) and notify according to equality
(5), the new equality :
1 F
( z g )t P( x, y)
2 m
(15)
5. Simulation
In this section, we perform some simulations
experiments to validate the hypothesis made (during
dropping) and the impact of the visibility distance d
and wind strength variations. We study the
performance of our system by discussing the variation
of the initial velocity V0 and the vertical wind FZ and
the variation of winds forces between two successive
drops and their impacts on the sensor landing positions.
In the simulation environment, it was assumed that
the sensor nodes were deployed in outdoor area from a
quadcopter from an altitude h equal to 70m, the mass
of the sensor is 100 g and g is the gravity which is
equal to 9.8 m/s. The first sensor is dropped from a
point A(0,0,h) at time t= o sec.
Three simulation experiments were conducted for that
reason. In each experiment, we choose different values
of the lateral and frontal wind to cope with the
variation of the wind speed and to use more efficient
wind speed for real conditions.
5.1. Impact of initial velocity on the sensor

landing position
Figure 3 calculates the initial velocity that the
quadcopter must flies with where the landing position
of the sensors will be at most d. As shown, the initial
velocity increases as the visibility distance increases.
We note that if the quadcopter flies at high velocity,
they may be possible that the sensor landing position is
in a further distance and hence, not captured in the
picture. Hence, it is desirable that the quadcopter flies
with an average velocity during the sensors dropping to
guarantee that the sensors will not be thrown very far
from their initial dropped positions.
It can be seen that the quadcopter initial velocity is able
to bring closer or away the sensor landing position.
Therefore, for estimated winds forces and for a
- 331 -
ICEIC 2015
visibility distance not exceeding an allowed value, the
initial velocity must be necessarily less than a threshold
value. Consequently, the estimation of the visibility
distance will be generally measured taking into account
the quadcopter initial velocity.
Therefore, Fz should not exceed a maximum value

given by 0.98 N.
Based on the figure below, it can be concluded that the
vertical wind has a great impact on the sensor landing
position.
Figure3: Initial velocity for different visibility

distance values
Figure4: Vertical wind for different visibility

distance values
5.2. Impact of the vertical wind on the sensor

landing position
To evaluate the impact of the vertical wind on the
sensor landing position, we consider from equation (8),
the function g representing the square distance between
the origin and the landing point and defined by:
g ( Fz ) (
Fy h
Fx h
2mh
V0 .
) (
)
Fz mg
Fz mg
Fz mg
(16)
For a given values of Fx and Fy and for V0 equal to 25

m/s, we determine the maximum values of Fz such that:
g ( Fz ) d 2
2h
Fz
g
m
5.3. Impact of the wind variation on the sensors

landing positions
One can deduce from equations (11) and (12), that
the second dropping position X2 (respectively the
second drooping time t2) exists and allows sensor to
land at a distance at most d if only the following
inequality holds:
(17)
Figure 4 plots the square root of g(Fz) for different

values of vertical wind Fz.
Or, since t Land
For a vertical wind Fz with a same direction to the

weight Fz or less than 40% of the weight, the sensor
may land at a distance d below 200m. Hence, for some
values of the vertical wind variation the sensor can land
at a distance less than or equal to d.
, Fz must meet the
following inequality:
Fz < -gm
(18)
Fy , 2
2m
2
t Land
,2
Fy ,1
2m
2
2
t Land
,1 )
(19)
Therefore, figure 5 shows the maximum lateral wind

variations between two successive dropping sensors so
that the sensor can land at a visibility distance d, where
the distance separating two landing points is less than
or equal to .
We can remark from the figure, that the landing
position of the sensor for a given distance depends
on variation of the wind variations. The lateral wind
- 332 -
ICEIC 2015
variations should not exceed a maximum value from
one drop to another so that the dropping position of the
second sensor exists and therefore, the sensor lands at a
distance at most d.
For a general case, high wind variations from one drop
to another involves that either estimated sensor landing
position will be very far away the visibility distance d
or the sensor dropping position could not exist.
Figure5: Existence of the sensor dropping position

according to the lateral wind variations
6. Conclusion
Ensuring full coverage and connectivity of an area
with irregular conditions constitutes a challenging task
that we attempt to solve in this paper. In this paper, we
developed a deployment model for a WSN taking into
account realistic conditions of irregular wind forces on
the deployment strategy. We focused first on providing
a deployment model able to estimate the sensor landing
position and time. Then, we developed mathematical
expressions to estimate dropping times and sensors
landing positions using parameters such as the wind
speed intensity and direction, altitude and velocity of
the quadcopter, and area geography.
In future works, we will implement the proposed
deployment in realistic environment with irregular
vegetations and with the presence of obstacles based
special sensors.
[2] A. Brooks, A. Makarenko, T. Kaupp, S. Williams,

H. Durrant-Whyte, "Implementation of an indoor
active sensor network, " in Proceedings of the 9th
International
Symposium
on
Experimental
Robotics, Singapore, June 2004.
[3] B. Liu, O. Dousse, J. Wang, A. Saipulla, "Strong
Barrier Coverage of Wireless Sensor Networks, "
Proceedings of the 9th ACM international
symposium on Mobile ad hoc networking and
computing ,Hong Kong SAR, China, May, 2008.
[4] Howard, et al. "Mobile sensor network deployment
using potential fields", In Distributed Autonomous
Robotic Systems Springer, Japan, 5, pp. 299-308,
2002.
[5] Poduri et al. "Constrained coverage for mobile
sensor networks "International Conference on
IEEE, Vol. 1, pp. 165-171, May, 2004.
[6] R. Bellazreg, N. Boudriga, K. Trimche, S. An,
"Border Surveillance: A dynamic deployment
scheme for WSN-based solutions," in the
Proceedings of the 6th Joint IFIP Wireless and
Mobile Networking Conference WMNC, United
Arab Emirates, April 2013.
[7] I. Arfaoui, R. Bellazreg and N. Boudriga, "A Novel
Realistic Irregular Radio Model to Enhance
Coverage Evaluation in Wireless Sensor
Networks,"
Conference
on
Software,
Telecommunications and Computer Networks,
SoftCOM, Split, Croatie, Sep, 2014.
[8]R. Marfievici, A. L. Murphy, G. P. Picco, F.
Cagnacci, and F. Ossi. "How Environmental
Factors Impact Outdoor Wireless Sensor Networks:
A Case Study," In Proc. of the 10th Int. Conf. on
Mobile Ad-hoc and Sensor Systems (MASS), 2013.
[9] S. Berrahal, J-H Kimu, S. Rekhis, N. Boudriga, D.
Wilkinsu, and J. Acevedo, "Unmanned Aircraft
Vehicle Assisted Border Surveillance," Asia Pacific
Conference on Communications, APCC, Thailand,
Oct 2014.
[10] R. Beaubrun and Y. Kraimia, "Assessing the
Impact of Wind on Detecting Fire Using a Wireless
Sensor Network, "Sensors & Transducers Journal,
vol. 18, Special Issue, 2013, pp. 120-127.
[11] Hashim, M. H. and S. Stavrou, "Wind influence
on radiowaves propagating through vegetation at
1.8 GHz," IEEE Antennas and Wireless
Propagation Letters, Vol. 4, 2006.
References
[1] M. Younis and K. Akkaya, "Strategies and
techniques for node placement in wireless sensor
networks: A survey," in Elsevier Ad-Hoc Network
Journal, 6(2008), pp.621-655.
- 333 -
FO-3-3-3
Temperature Effect on Uniform Fiber Bragg Gratings based on Thermo-optic

coefficients
Rumadi 1, Ary Syahriar 2 and Dwi Astharini 3
Department of Electrical Engineering, Faculty of Science and Technology, University of Al
Azhar Indonesia, Sisingamangaraja Street, Kebayoran Baru, Jakarta, 12110, Phone (021) 727
92753, Fax (021)-724-4767
rumadi13@hotmail.com
Abstract
and its thermo-optic coefficient
This paper report temperature effect on uniform

FBGs. Based on relation thermo-optic coefficient and
refractive index, we can get different index change
versu temperatures. With input different index change
in power reflection coefficient calculation by transfer
matrix method, wavelength shift is obtained. From
wavelength shift we determine temperature sensitivity
on uniform FBGs. Simulation result show that
temperature sensitivity is 12.5 pm/0C.
Keywords: uniform FBGs, thermo-optic coefficient,
index change, transfer matrix method, temperature
sensitivity.
1. Introduction
Temperature effect on the uniform FBGs are often
used in optical communication systems, especially in
sensor applications. One application is tunable
UDWDM, DWDM, WDM FBG filters for Passive
Optical Network Access [1]. The temperature can
influence the refractive index of material, temperature
increases with the increase in refractive index.
Compared to the thermo-optical effect, the thermalexpanding effect can be ignored [2]. In this work, we
assume only thermo-optic coefficient that influence
temperature effect on uniform FBGs.
dn dT
can be
potentially detrimental to optical system performance,

so spatial knowledge of dn dT is also important[3].
The typical values of the refractive index n and
thermo-optic coefficient dn dT of the SiO2 are 1.4463
and 1105 0C at 1550 nm, respectively [4]. Relation
between refractive index and thermo-optic coefficient
given by[5]
dn
nT nR (T R)
(1)
dT
where T is the temperature in 0C, R is the room
temperature, nT and nR are the refractive index at T
and at room temperature, respectively.
3. Principle FBGs
It is important to know basic theory of FBGs to
understand how work. A grating is a device that
periodically modifies the phase or the intensity of a
light wave reflected on, or transmitted trough it[6]. The
propagating wave is reflected, if its wavelength equal
Bragg resonance wavelength D ,in the other case is
transmitted. The equation relating teh grating spatial
periodicity and the Bragg resonance wavelength
given by Figure 1:
2. Temperature effect in Refractive index

High quality, refractive optical designs depend
intimately on accuracy of refractive index data of
constituent optical materials. Since absolute refractive
index is generally a function of both wavelength and
temperature, it is important to know refractive indices
at the optical systems design operating temperature.
Further, for large, refractive, optical components,
spatial variation of both a materials refractive index
- 334 -
ICEIC 2015
1 d
2 dz
(7)
1 d
describes the possible chirp in
2 dz
the grating. The detuning , that is always independent
on the variable z, is defined as :
The derivative
In a single mode fibre Bragg grating, the coupling

occurs between the forward and backward propagating
fields of the same mode. The maximum reflectivity is
obtained at the wavelength providing the Bragg
condition [8]:
(8)
neff
(9)
s neff
(10)
(2)
where,
,
, , represent Bragg Wavelength,
effective index, and grating period. In a uniform Fiber
Bragg Gratings having a constant grating period,
forward and backward propagating fields are given by
coupled mode equation [8]:
where ,
For single-mode fiber, the dc coupling coefficient

and the ac coupling coefficient can be simplified to:
Figure 1. Diagram illustrating the properties of fiber Bragg

gratings[6]
Bragg 2neff
1
1
D 2 neff

Bragg
dA
j ' A ( z ) j B ( z )
dz
(3)
dB
j ' B ( z ) j * A ( z )
dz
(4)
4. Transfer Matrix Method

The principle behind the transfer matrix method is to
subdivide the grating structure into multiple uniform or
non uniform sections. Each of these sections is then
described by a transfer matrix that transfers the
input field into the output field, and then each section
is identified using a 2-by-2 matrix[8].
A ( z ) and B ( z ) are transmitted and

Figure 2. The Boundary condition of the transfer
Matrix method uniform gratings[7]
reflected fields that presented by :
A ( z) A( z )e( jd z 2)
(5)
B ( z ) B( z )e( jd z 2)
(6)
Solving coupled mode equation for transfer matrix

method (TMM) is found. A uniform FBG can be
described by only one matrix given by [8]:
And general dc self-coupling coefficient is defined

as:
- 335 -
ICEIC 2015
1.4465
neff
1.4464
Effective Refractive Index
j sinh( B L)
cosh( B L) j sinh( B L)
B
B
Tk
j sinh( B L)
cosh( B L) j sinh( B L)
B
B
(11)
1.4463
1.4462
1.4461
1.446
1.4459
20
where,
40
60
80
Temperature, 0C
100
120
140
Figure 4. The effective refractive index versus temperature
B 2 2
(12)
5. Simulation Result
From the Figure 4, we choose the value of the

refractive index at a certain temperature. The
temperature at select from room temperature 23
degrees to 83 degrees with a difference of 20 degrees.
Temperature Effect on Refractive Index

The parameter used for simulation are core
refractive index = 1.4463 , cladding = 1.4453, D =
1550 nm, core radius = 5 m, T = 23-125 0C. Figure
5.1 is temperature effect on core refractive index with
thermo-optic coefficients value is 10-5 /0C. It shows
that the core refractive index is increased if the
temperature is increased.
Table 1: Wavelength Shift with temperature

Effective index at:
T1 = 23 0C
T2 = 43 0C
T3 = 63 0C
T4 = 83 0C
Value
1.4459445
1.4460445
1.4461446
1.4462446
Temperature Effect on uniform FBGs

1.4476
Figure 5 shows the effect of temperature on the

uniform FBG. The increase in temperature causes a
wavelength shift constantly. At a temperature
difference of 20 degrees and the average difference
index change of 0.0001639, produces a wavelength
shift of 0.25 nm each reflection. if we summarize the
resulting data from figure 1, as follows :
ncore
Core Refractive Index
1.4474
1.4472
1.447
1.4468
1.4466
1.4464
1.4462
20
40
60
80
Temperature, 0C
100
120
140
Figure 3. The core refractive index versus temperature
After getting the value of the refractive index of the

core is heated, we can obtain the effective index.
Figure 4 is temperature effect on effective refractive
index, it shows that the effective refractive index is
increased if the temperature is increased.
- 336 -
Table 2: Wavelength Shift with temperature

Wavelength Shift
1
Value
0.25 nm
0.50 nm
0.75 nm
ICEIC 2015
Table 2: BW with temperature
Wavelength Shift
BW
BW
BW
Value
0.125 nm
0.3 nm
0..5 nm
We can obtain the gradient = 12.5 pm C 0 between

the wavelength shift with temperature from Figure
(4.7a). If we input gradient in equation mT C ,
so get :
T = 430 C
T = 630 C
0.8
Normalized Power Reflection
1.25 1011 (T R)
T = 230 C
0.9
(13)
T = 830 C
0.7
And
0.6
T R
0.5
0.4
0.3
substitute equation
, we get :
(13)
in
T R 1.25 1011 (T R)
0.2
equation
(14)
0.1
0
1548
1549
1550
1551
1552
1553
1554
Wavelength, nm
1555
1556
1557
1558
Figure 5. Temperature effect on reflection uniform Fiber Bragg

Gratings. The effect of temperature caused different index difference
( neff ) value, at red solid line neff = 0.001812945, green solid
line neff = 0.0019611719, green solid line neff = 0.002127957
and blue solid line neff = 0.00230479586.
0.9
0.8
Wavelength Shift, nm
0.7
0.6
= 0.0125*T - 0.2875
Data point
Linear fit
0.5
0.4
where T = Bragg wavelength after haeted , R is

Bragg wavelength at room, and T is temperature, R =
room temperature and temperature sensitivity is
12.5 pm C 0 . This equation can be used to calculate
the wavelength shift with temperature on uniform Fiber
Bragg Grating. This equation can be used to calculate
the wavelength shift against temperature on uniform
fiber Bragg gratings. By using the wavelength shift
equation we can immediately adjust the temperature
should be heated to shift a certain width of
wavelengths.
5. Conclussions
0.3
0.2
0.1
0
-0.1
20
30
40
50
60
Temperature,0C
70
80
90
(a)
From the simulation result we get calculation approach

for designing uniform Fiber Bragg gratings using
thermo-optic. This equation can determine how much
the temperature must be increased to shifting Bragg
wavelength with temperature sensitivity is 12.5 pm/0 C.
References
0.9
0.8
Reflectivity (Normalized)
BW (nm)
Magnitude
0.7
[1] M. Ferchichi, M. Najar, and H. Rezig, Design of

temperature-strain tunable UDWDM, DWDM, WDM
FBG filter for Passive Optical Network Access,
ICTON, Marrakech , pp. 15, 2008.
0.6
0.5
0.4
0.3
0.2
0.1
0
20
30
40
50
60
Temperature,0C
70
80
(b)
Figure 6 (a) The wavelength shift on uniform FBGs versus
temperature , and (b) The maximum reflectivity and BW versus
temperature.
90
[2] H. Yang, S. Wang, K.Mao, G. Li, J.

Wang,Numerical
Calculation
of
Seawater
Temperature Sensing Based on PolydimetylsiloxaneCoated Microfiber Knot Resonator, Optics and
Photonics Journal, pp. 91-97, 2014
- 337 -
ICEIC 2015
[3] Douglas B.L & Bradley J.F , Temperaturedependent absolute refractive index measurements of
sntetic fused silica,NASA Goddard Space Flight
Center : Greenbelt, 2006
[4] D. Lee, K.H Kim, S.H Hwang, Min-Hee Lee, ElHang Lee.,Optimization of Thermo-optic parameters
for Temperature-Insensitive LPWG Refractometers,
ETRI Journal, Vol. 28, Number 6, December 2006
[5] G. Ghosh, Michiyuki Endo, T. Iwasaki,
Temperature Dependent Sellmeier Coefficients and
Chromatic Dispersion for Some Optical Fiber
Glasses, Journal of Ligthwave Technology, Vol. 12,
Number 8, August 1994
[6] Radek Heln, Education Program for Fiber Bragg
Gratings Simulation, Ph.D. Degree Programme(3),
FEEC BUT ,2007
[7] Jianfeng Zhao, An Object-oriented Simulation
Program for Fiber Bragg Gratings, Thesis Master of
Engineering of Electrical and Electronic Engineering,
University Johannesburg : Republic of South Africa,
2001
[8] Erdogan T, Fiber Grating Spectra, Journal of
Lightwave Technology, vol. 15, no. 8, 1997, pp. 1277
1294
- 338 -
FO-3-3-4
Train Arrival Information at Railway Crossing Area Using Zigbee Networks

Octarina Nur Samijayani, Fadjar Iftikhar
Electrical Engineering Department, Al Azhar University of Indonesia
Octarina.nur@uai.ac.id, fadjar.iftikhar@gmail.com
Abstract
Train accidents are often occurred at railway
crossing area. The accurate information of train
arrival is needed to raise the vigilance of road users.
This research designed the train arrival information
system using Zigbee networks. Zigbee networks
contained a set of node sensors that communicates
wirelessly using personal area network. Each node
communicates using ZigBee/IEEE 802.15.4 standard.
ZigBee operates in 2.4 GHz frequency with very low
power consumption. Sensor nodes worked to detect the
train arrival, and calculate the countdown time of train
arrival at crossing area. This paper presents the
simulation result of Zigbee networks using train model.
The prototype is able to identify the train, then
calculate train velocity with average error of about
6.85% and succeed to display the countdown timer of
train arrival at crossing area.
Keywords: Zigbee, Train Information, WSN.
1. Introduction
One factor causing train accident at railway crossing
area is because of road user obeys the train sign and
tries to pass the crossing area although the gate has
been closed. The accurate information of train arrival
in crossing area is important to give warning to the
road users. This research proposed a method to provide
train arival information using Zigbee Networks. The
time arrival is displayed as the countdown timer at
railway crossing area. The information of train arival
on a certain train station furthermore can be integrated
using Wireless Sensor Networks (WSN) based system.
WSN system may allow many train stations to
communicate each other wirelessly through the internet.
Innovations in industrial, home and automation in
transportation represent smart environments. Data for
smart environments are obtained through WSN, where
thousands of sensors are deployed at different locations
operating in different modes [1]. A sensor network is
capable of sensing, processing and communicating
which helps the base station or command node to
observe and react according to the condition in a
particular environment including physical, battle field,
biological [2]. Sensor network protocols have a unique

self-organizing capability. Another interesting feature
of WSNs is that the sensor nodes cooperate with each
other since each nodes are contained an in-built
processor [3]. Each node communicates using ZigBee
standard. Zigbee/802.15.4 operates in 2.4 GHz
industrial, scientific, and medical (ISM) radio band and
supports data transmission at rates up to 250 kbps.
2. System Design
This research studies the feasibility of WSN
implementation for train monitoring system. This paper
presents the prototype design of train information
system in railway crossing area using Zigbee networks.
XBee PRO series 2 with output power 63mw are used
as the transceiver. XBee PRO series 2 is able to
transmit and receive data with range of about 1500 m
in outdoor in line of sight condition [4]. Two sensor
nodes R1 and R2 are placed at 100 m away entering the
crossing area and one coordinator node C is located in
the crossing area. R1 and R2 sensor nodes detect and
determine the train arrival, and calculate its velocity.
The velocity of train is then used by the Coordinator
node to calculate the time needed by train to arrive at
crossing area which is displayed as the countdown
timer. The illustration of system design is depicted on
Figure 1.
Crossing area X
Display
R2
Display
R1
100 m
s1
Coordinator
500 m
s2
Figure 1. System design of train information in one

crossing area
By assuming the train has length more than 200m,

then the distance between R1 to R2 is set up to be
100m, so that R1 and R2 can detect train
simultaneously to ensure the object detected is the
- 339 -
ICEIC 2015
train. By considering the distance between R2 and
Coordinator is 500m, and train velocity is about 4070
km/h, the countdown timer for train arrival from R2 to
the crossing area is about 25s to 45s. The flowchart of
node sensor operation is depicted in Figure 2.
3. Experiment Result
In order to test the system design and the algorithm
built on each sensor node the design in Figure 2 is
simulated using train model with an appropriate
adjusted scale as shown in Figure 3. The distance
between R1 to R2 is set to be 50 cm, distance between
R2 to coordinator is 250 cm with the length of train is
about 60cm.
Figure 3. Experiment model of system design

The experiment is done to test the train velocity
calculation and to test the accuracy of countdown
timer. This testing is done using two different trains
speed; Train 1 arrives with slow velocity (v1) and
Train 2 arrives with fast velocity (v2). The testing is
done by using 20 experiments in order to analyze the
performance of the system. Table 1 present the result of
velocity calculation testing and Table 2 present the
result of countdown timer testing.
Table 1. Result of velocity testing
Velocity Test for Train 1
Figure 2. The flowchart of sensor node operation
When sensor R1 detects the train, Zigbee of R1 will

send information about the presences of train wirelessly
to the coordinator through the R2 to activate the timer.
If R1 and R2 have detected train simultaneously, then
Zigbee R2 will send information about the presences of
the train to coordinator to stop the timer. Time between
R1 and R2 is noted by coordinator to calculate the
velocity of train which is used to calculate the
countdown time between R2 to coordinator. Then
coordinator will display on LCD display the countdown
timer at railway crossing area.
- 340 -
Velocity Test for Train 2
Exp.
v exact
(cm/s)
v
calculation
(cm/s)
v
error
(%)
v exact
(cm/s)
v
calculation
(cm/s)
v
error
(%)
7.08
7.289
2.862
26.62
29.586
10.024
6.75
6.821
1.045
21.46
21.459
0.004
8.22
8.292
0.867
20.62
22.222
7.210
7.95
8.489
6.349
25.1
24.155
3.914
8.37
7.837
6.801
21.63
25.381
14.778
10.8
11.416
5.392
23.97
26.882
10.832
10.79
11.261
4.185
23.75
27.778
14.500
11.02
11.390
3.244
23.97
26.882
10.832
11.02
10.730
2.706
25.1
23.923
4.918
10
11.02
11.136
1.040
22.54
26.882
16.151
11
10.29
9.960
3.312
23.97
23.810
0.674
12
9.65
10.121
4.658
23.54
25.641
8.194
13
8.25
8.636
4.465
28.33
26.455
7.087
14
8.4
8.547
1.720
20.62
20.833
1.024
15
8.24
9.058
9.030
28.33
25.907
9.354
16
8.37
7.752
7.973
25.34
27.174
6.749
17
8.24
8.306
0.790
25.1
25.510
1.608
18
8.24
7.862
4.813
25.1
24.876
0.902
ICEIC 2015
19
8.73
8.591
1.617
25.1
27.027
7.130
20
8.7
9.524
8.650
25.1
25.381
1.106
Avg:
9.0065
9.151
4.076
24.2645
25.388
6.850
4. Conclusion
Based on the experiment result, the train

information system model has average error of 4.076%
in detecting the velocity of Train 1; slow velocity (v1)
and 6.85% error in detecting velocity of Train 2; fast
velocity (v2).
Table 2. Result of countdown timer testing
No.
Countdown timer testing for

Train 1
Exact
Display
Error
(s)
(s)
(s)
Countdown timer testing for

Train 2
Exact
Display
Error
(s)
(s)
(s)
35.74
35
0.74
9.01
0.01
36.17
37
0.83
11.3
12
0.7
30.47
30
0.47
12.05
12
0.05
31.11
31
0.11
9.93
10
0.07
29.92
30
0.08
9.53
12
2.47
23.22
23
0.22
9.96
10
0.04
22.76
23
0.24
10.43
11
0.57
22.31
23
0.69
10.36
10
0.36
22.64
23
0.36
9.93
10
0.07
10
22.51
23
0.49
10.36
11
0.64
11
24.18
24
0.18
10.42
10
0.42
12
25.66
26
0.34
10.35
11
0.65
13
30.31
30
0.31
9.01
0.01
14
29.75
30
0.25
12
12
15
29.78
30
0.22
9.37
0.37
16
29.95
30
0.05
9.36
10
0.64
17
30.28
30
0.28
9.34
10
0.66
18
30.24
30
0.24
9.29
10
0.71
19
28.68
29
0.32
9.35
10
0.65
20
29.14
29
0.14
9.33
10
0.67
Avg:
28.241
28.3
0.328
10.034
10.4
0.488
The train arrival information system using Zigbee

networks is successfully detected and identified the
train and calculates its velocity to obtain the countdown
timer. The Zigbee transceiver performs to send the data
wirelessly in about 250 kbps. Based on the experiment
result, the average error of train velocity calculation is
about 6.85%. This error may affect to the countdown
timer calculation, however the system design still has
positive result in calculating the countdown timer with
small amount of error. The different time between the
exact train arrival and the countdown timer displayed
on LCD is less than 1s.
5. Acknowledgement
This paper is acknowledged for Directorate General
of Higher Education of Indonesia and LP2M of Al
Azhar University of Indonesia for supporting the
publication of this research.
6. References
[1] D. J. Cook and S. K. Das, Smart environments:
technologies, protocols and applications, New York:
John Wiley, pp. 13-15, 2004.
[2] K. Sohraby, D. Minoli, and T. Znati, Wireless sensor
networks: technology, protocols and applications, New
Jersey: John Wiley, pp.
[3] Edwin P. K. G., Baskaran K, and Elijah B. R., Research
Issues in Wireless Sensor Network Applications: A
Survey, International Journal of Information and
Electronics Engineering, Vol. 2, No. 5, September 2012.
[4] Meng-Shiuan Pan, Yu-Chee Tseng, ZigBee Wireless
Sensor Networks and Their Applications, Department
of Computer Science, National Chiao Tung University.
The error in calculating the train velocity may affect

to the countdown time calculation. Based on the testing
result in Table 2, the difference time between the exact
time arrival and countdown timer on LCD Display is
about 0.328s for slow speed; Train 1 and 0.488s for
fast speed; Train 2. The design obtains less error for
the slow speed of train; however the error of
countdown timer is quite small, which is less than a
second (error < 1s).
- 341 -
FO-3-3-5
Simulation and FPGA Implementation of a Matched Filter for Cognitive

Radio
Christy A. Caete 1, Alberto S. Baacia 2
Department of Electrical and Electronics Engineering
University of San Carlos Talamban Campus
ytsirch2000@yahoo.com, abanacia@yahoo.com
Abstract
This study presents the matched filter method for
detecting the presence or absence of a primary user
signal corrupted by AWGN. The matched filter method
was simulated in MATLAB to get the theoretical
results, and implemented in Altera EP4SGX230KF40
Stratix IV FPGA. The FPGA was chosen because of its
flexibility, performance, and power efficiency
comparable to ASICs. The 64QAM technique was used
to modulate the signal simulated in MATLAB.
Convolution is the major operation of the matched
filter as it effectively improves the signal-to-noise ratio
of the detected signal. The results of the convolution
were verified in MATLAB both in the time and
frequency domain. The results of the matched filter
design were verified in MATLAB using multiple values
of SNR, ranging from -25 dB to 25 dB. The probability
of false alarm was specified at varying levels to
compute the probability of detection. The ROC curve
showed that the probability of detection increases as
the SNR value increases. The results of the Neyman
Pearson test proved that the matched filter is an
optimum detector for sensing signals corrupted by
additive white Gaussian noise. The FPGA
implementation of the matched filter showed that the
detector can sense the presence of the signal in 19.51
s which falls within the acceptable range required by
the IEEE 802.22 standard for Cognitive Radio.
Keywords: cognitive radio, FPGA, matched filter
detection, PDF, primary user, ROC curve, spectrum
sensing, white space.
1. Introduction
The growing demand for frequency spectrum usage
in mobile communication, satellite services, wireless
sensors,
and other
wireless
communication
applications is expected to become a great issue for
spectrum scarcity in the future. One of possible
approach to solve the dilemma for spectrum scarcity is
to search dynamically for white spaces in the

spectrum and use these available frequencies
opportunistically. Cognitive radio (CR) technology,
defined first by Mitola [2], [3], is thus advocated as a
candidate for implementing opportunistic spectrum
sharing. Cognitive radio is a new innovation in
wireless radio communications designed to have the
capability to be aware and adapt its system parameters
to meet the requirements of the user. As a whole,
cognitive radio networks function for spectrum
sharing, management, sensing, and mobility.
The main goal of cognitive radio is to access
unlicensed spectrums in idle mode for opportunistic
usage without causing harmful interference with the
licensed or primary users. To detect the presence of
white-space, efficient techniques for spectrum sensing
is essential. There are many known approaches for
spectrum sensing in cognitive radio, one of these is the
matched filter detection approach. This technique is
known as the optimum method for detection of primary
users when the user has prior knowledge of the
transmitted signal. From a noisy channel, the matchedfilter approach provides a maximum signal-to-noise
ratio which is a great advantage for detection of signal.
FPGA or field programmable gate array offers a
new opportunity for signal processing. FPGAs are
appealing devices because of their flexibility,
performance, and power efficiency comparable to
ASICs (Application Specific Integrated Circuits) and
GPPs (General Purpose Processors). These powerful
capabilities of FPGAs provide a great advantage for
Cognitive Radio devices.
2. Matched Filter Method

The matched filter method is a technique which
requires a prior knowledge of the users signal
parameters such as modulation type, carrier frequency,
and pilot symbols or preambles during the filtering
process. The core operation of the matched filter is
convolution.
- 342 -
ICEIC 2015
One important property of the matched filter is its
capability to maximize the output SNR, given the
convolution y(t) and impulse response h(t). In a
geometric point of view, the cross product of the
convolution is maximized by correlating the received
signal with the impulse response (of the filter) that is
parallel with the signal. This simply means that the
output signal due to noise should be minimized by
choosing the filter coefficients that are orthogonal to
the noise.
Figure 1 Matched Filter Block Diagram

Based from the figure, the output of the block
diagram y(t) is just the correlation of the signal x(t) and
noise n(t). According to [11], the transfer function of
the impulse response of a matched filter is given by the
following:
H (f) = k [X*(f) / SN(f)] e j2fT
(1)
where:
X*(f) = the complex conjugate of the frequency
spectrum of the waveform
SN(f) = two-sided spectral density of the noise
k = an arbitrary constant
The behavior of the linear-time invariant system is
described by the convolution of the input signal and
impulse response of the filter. Further derivations for
the systems impulse response are shown below:
Let:
SN(f) = N0 / 2 ; white Gaussian noise spectral
density
So, our transfer function becomes:
H (f) = k [X*(f) / (N0 / 2)] e j2fT
H (f) = 2k/ N0 [X*(f) e j2fT]
(2)
3. Neyman-Pearson Criterion
According to Tertinek [27], statistical hypothesis
testing is the main idea behind a detection process in
any communication system. Considering the two cases
for hypothesis
and
, the following hypothesis
problem are formulated given that the probability
density function for each assumed hypothesis is known
[ ]
[ ]
[ ]
(6)
where s[n] is the signal to be detected and w[n] is an

additive white Gaussian noise.
The goal for optimal detection is to determine
whether
or
was true. The Neyman-Pearson
method is one of the several mathematical approaches
to solve the detection problem for Cognitive Radio. In
statistics, the Neyman-Pearson lemma is a method that
performs a hypothesis testing between two hypotheses
and
and rejects
in favor of
through a
likelihood ratio test.
In this paper, only the additive white Gaussian noise
is assumed with the following autocorrelation function:
Using the property of Fourier transform, X*(f) = X

(-f), equation 2 becomes:
H (f) = 2k/ N0 [X(-f) e j2fT]
[ ]
[ ]
{ [ ] [
]}
[ ]
The following equation is also denoted as the noise

vector:
(3)
Taking the inverse Fourier transform of equation,

the impulse response of the filter is:
h(t) = IFT { H (f) }
= IFT {2k/ N0 [X(-f) e j2fT] }
where:
X(-f) = x(-t)
e j2fT = time shift of T in seconds.
Using the Neyman-Pearson criterion for the

matched filter, the detector decides
if the likelihood
ratio exceeds a threshold
(4)
Based on the results above, the impulse response of

the matched filter is therefore just the time-reversed
and delayed version of the systems input signal x(t):
h(t) = x(T - t )
where x = [ [ ] [ ]
[
]] is the vector of the
received signal. Since it is assumed that the probability
density function under each hypothesis is Gaussian,
(5)
- 343 -
ICEIC 2015
]
[
[
Dividing both side by
and so,
[
]]
The logarithm of both side are taken to simplify the

equation and yields,
[
Based on the equation above, the detection

performance is improved as
is increased. This
also means that increasing the ENR (energy-to-noise
ratio) does not change the shape of the PDF curve but
only moves them father apart.
Tertinek also included the definition of the
probability of false alarm as,
{ [ ]
Simplifying the equation further results to,

(
as well as the probability of detection as,

The second term of the inequality equation simply
denotes the energy of the signal. Since the signal is
known, the equation becomes:
And thus the final threshold for the NeymanPearson detector becomes:
{ [ ]
(
The quantities
and
are the mean values under
the hypotheses
and
, respectively, while is the
standard deviation. Using the two equations (2.3.7) and
(2.3.8) above into equation 2.3.6, the equations
become,
{
[ ] [ ]
The equation above shows the test statistic

and
the threshold
which is chosen to satisfy a certain
value of the probability of false alarm (Pfa).
Tertinek further explained that the interpretation of
equation (10) is based on the linear vector space
theory. The
quantity denotes the dot product of the
received signal vector as well as the known signal.
According to Schwarz inequality (refer to Appendix
A), the maximum value of the dot product occurs when
they are parallel to each other, while the lowest value
occurs when the two vectors are orthogonal to each
other. With the noise being independent on the signal,
the detector eliminates the orthogonal components
while retaining the components which are parallel.
} as the expected value and
{
} as
Given {
the variance of the test statistic, the mean threshold T is
computed as,
{
(
)
}
)
The last two equations lead to the derivation of the

probability detection as,
(
Based on the probability of detection derived above,

the detection performance of the matched filter can be
improved if the Pfa or the ENR is increased. It also
goes to show that two signals with arbitrary shape will
result to the same detection performance if their
energies are the same.
- 344 -
ICEIC 2015
4. Methodology
The Matched Filter architecture was implemented
using MATLAB Simulink where series of signal
processing simulations were done. To verify the
functionality of the Matched Filter modeled in
Simulink, the digital input signals modulated in BPSK,
QPSK, and 64-QAM were used. The 64-QAM was
chosen since it is the technique used in digital TV
band, while QPSK is the usual technique used in
cellular systems. BPSK was also chosen for testing
purposes. The signals were then transmitted via the
AWGN channel where the input signal for the matched
filter is being generated. The matched filter system
flow chart is shown in figure (2).
The hardware implementation of the matched filter
was also done using the FPGA Stratix IV from Altera.
The matched filter architecture was designed through
Verilog coding using the Quartus II Software version
11.1. To verify the functionality of the modules, the
codes were tested using a testbench code generated in
Modelsim-Altera Simulator of Quartus II. The
Modelsim Simulator provides the ideal input and
output waveforms of the matched filter architecture
where the signals can be easily verified and analyzed.
After the design is tested through Modelsim, it is then
loaded through the FPGA. The LED from the Stratix
IV module serves as an indicator whether a signal is
detected or not.
The MATLAB implementation of the matched
filter is composed of five processes. The first step
involved the generation of the input signal to be
modulated in the transmitter. The second step was the
designing of the three transmitters modulated using the
BPSK, QPSK, and 64-QAM technique. Third, the
AWGN was modeled in MATLAB, where the
modulated signals were being transmitted. The next
process was to design the matched filter in Simulink,
where the input signals were signals corrupted by noise
coming from the AWGN channel. And the last stage
was the detection process. To detect the presence or
absence of the signal, the threshold value was set
wherein the outputs coming from the matched filter
were compared serially. The power spectral density
were also plotted to verify the presence of the signal in
the frequency spectrum.
gain, and convolved with the template signal. Taking

the SNR value of 20 dB, the plots of the PSD show
that the detected signals have power concentrated on
their center frequencies, forming the shape of s sync
function. The matched filter was able to detect the
target signal modulated by 64QAM with a PSD of 16
dBW centered at 57 MHz frequency.
Figure 2 System Flow Chart

Based on the SIMULINK design of the Matched
Filter, the input of the system is a signal corrupted by
additive white Gaussian noise. It is then passed
through the bandpass filter to remove unnecessary
frequencies, passed through the amplifier to increase
- 345 -
Figure 3 MATLAB Architecture of the Matched

Filter
ICEIC 2015
Figure 6 ROC curve of matched filter performance

with 64QAM modulated signal as the target
signal
Figure 4 FPGA Architecture of Matched Filter
Table 1 shows the summary of the results of
simulations done in MATLAB and FPGA.
Table 1: Comparison of results between FPGA and

MATLAB simulation of the matched filter
Implementation
Method
MATLAB
16 dBW
Time of
detection
5.029 s
FPGA
20 dBW
19.51 s
PSD
Target
Signal
64QAM
64QAM
Figure 5 Spectrum of transmitted signal vs. PSD of

target signal modulated by 64 QAM at SNR of 20
dB
Figure 7 ModelSim simulation output of the
detected signal as indicated by the red circle
- 346 -
ICEIC 2015
Figure 8 Frequency spectrum of the output signal

from FPGA simulation
6. Conclusion
Based on the results of MATLAB simulations, the
matched filter detector was able to convolve the stored
template signal and the detected noisy signal properly
by maximizing its signal-to-noise ratio. When the noise
is absent, the output of the matched filter is just pure
signal energy. This was verified by taking the FFT of
the signal, and the output in the frequency domain
revealed that the bands where most of the signal
powers were located were emphasized. In general, the
matched filter applies the greatest weighting to spectral
components that have the greatest signal-to-noise ratio.
The FPGA implementation of the matched filter
revealed that the detector can detect the presence of the
signal in 19.51 s which is an acceptable range (below
1ms for fast sensing and 25ms for fine sensing) as
stated in the IEEE 802.22 standard for Cognitive
Radio. As the FPGA technology continues to evolve,
the generation of parallel architectures and techniques
will be able to promote high level computations and
improved performance. FPGAs open the opportunities
for higher computation performance and thus are
potential devices to implement for signal processing.
[6] J. Mitola and G. Q. Maguire, Cognitive radio: Making

software radios more personal, IEEE Pers. Commun., vol. 6,
pp. 1318, Aug. 1999.
[7] D. Cabric, I. D. ODonnell, M. S.-W. Chen, and R. W.
Brodersen, Spectrum sharing radios, IEEE Circuits Syst.
Mag., vol. 6, no. 2, pp. 3045, 2006.
[8] C. Hwang, G. Lai, and S. Chen, "Spectrum Sensing in
Wideband OFDM Cognitive Radios," IEEE Transactions On
Signal Processing, Vol. 58, No. 2, February 2010
[9] B. Wild and K. Ramchandran, Detecting Primary
Receivers for Cognitive Radio Application, An IEEE
journal, 2005
[10] K.B. Letaief and W. Zhang, Cooperative
Communications for Cognitive Radio Networks,
Proceedings of the IEEE, Vol.97, No.5, May 2009
[11] J.S. Chitode, Communication Systems I, 3rd
Edition, Copywrite @ 2004 by Technical Publications
PuneTM , pp 684-685
[12] J. Lotze, S. Fahmy, J. Noguera, L. Doyle, and Robert
Esser, An FPGA-based Cognitive Radio Framework, ISSC
2008
[13] S. Sabat1, K. Dapatri1, and S. Udgata2, "FPGA
implementation of Entropy based spectrum sensing technique
for Cognitive Radio," International Journal of Recent Trends
in Engineering, Vol 2, No. 5, November 2009
[14] H. Flores, DOST Eyes New Technology to Increase
Internet Access, The Philippine Star, February 2013
[15] Weiss, S. Merrill, Weller, Robert D., Driscoll Sean D.
New measurements and predictions of UHF television
receiver local oscillator radiation interference [online].
Available: h-e.com/pdfs/rw_bts03.pdf
References
[1] Wireless 2025: The Future of Mobile, Telephony Online,
http://telephonyonline.com/, April 2009.
[2] J. Mitola, Cognitive radio: Making software radio more
personal, IEEE Pers. Commun., vol. 6, no. 4, pp. 4852,
Aug. 1999.
[3] J. Mitola, Cognitive radio: An integrated agent
architecture for software defined radio,
[4] S. Haykin, Cognitive radio: Brain-empowered wireless
communications, IEEE J. Sel. Areas Commun., vol. 23, pp.
201220, Feb. 2005.
[5] FCC, Notice of proposed rule-making and order, ET
Docket 03-322, Dec. 2003.
- 347 -
ICEIC 2015

Oral Session
FO-3-4
Communication System and Wireless
Networking II
FO-3-4-1
Optimal Relay Design for MIMO Relay Networks

Using Gradient Projection
Apriana Toding
Dept. Electrical Engineering.
Universitas Kristen Indonesia Paulus, Makassar, Sul-Sel 90245, Indonesia
Email: aprianatoding@ukipaulus.ac.id
AbstractIn this paper, we design the optimal relay matrices
for multiple-input multiple-output (MIMO) relay communication
systems with parallel relay nodes using the projected gradient
(PG) approach. We show that the optimal relay amplifying
matrices have a beamforming structure. Using the optimal
structure, the relay power loading algorithm is developed to
minimize the mean-squared error (MSE) of the signal waveform
estimation at the destination node. Simulation result demonstrate
the effectiveness of the proposed relay amplifying matrix with
multiple parallel relay nodes using the PG approach in the system
bit-error-rate performance.
Index TermsMIMO relay, parallel relay network, beamforming, non-regenerative relay, projected gradient.
I. I NTRODUCTION
In order to establish a reliable wireless communication link,
one needs to compensate for the effects of signal fading
and shadowing. An efcient way to address this issue is
to transmit signals through one or more relays [1]. This
can be accomplished via a wireless network consisting of
geographically separated nodes.
When nodes in the relay system are installed with multiple
antennas, we call such system multiple-input multiple-output
(MIMO) relay communication system. Recently, MIMO relay
communication systems have attracted much research interest
and provided signicant improvement in terms of both spectral
efciency and link reliability. In [3]-[6], the authors have
studied the optimal relay amplifying matrix design for the
source-relay-destination channel. In [3] and [4], the optimal
relay amplifying matrix maximizing the mutual information
(MI) between the source and destination nodes was derived
assuming that the source covariance matrix is an identity
matrix. In [5] and [6], the relay amplifying matrix was
designed to minimize the mean-squared error (MSE) of the
signal waveform estimation at the destination. In [7], the
author investigated the joint source and relay optimization for
MIMO relay networks using projected gradient (PG) approach.
However, in [2]-[7], the authors investigated the optimal relay
amplifying matrix design for two-hop MIMO relay networks
with a single relay node. In [8], some linear relaying strategies
are presented for multiple relays in MIMO relay networks by
making use of local CSI. In [9], the authors investigated the
optimal relay amplifying matrices for two-hop MIMO relay
networks with multiple parallel relay nodes with sum relay
power constraints at the output of the second hop channel.
In this paper, we propose the optimal relay matrices for

MIMO relay communication systems with parallel relay nodes
using the projected gradient (PG) approach which signicantly
reduces the computational complexity of the optimal design.
We show that the optimal relay amplifying matrices have a
beamforming structure. In addition to the PG approach, we
constrain the power at each relay node which is more practical
compared to the constraints in [9] as that constraint may
exceed the available power budget at the relay nodes. Simulation result demonstrate the effectiveness of the proposed relay
amplifying matrix with multiple parallel relay nodes using the
PG approach in the system bit-error-rate performance.
The rest of this paper is organized as follows. In Section II,
we introduce the system model of MIMO relay communication
system with parallel relay nodes. The relay matrices design
algorithm is developed in Section III. In Section IV, we show
some numerical simulations. Conclusions are drawn in Section
V.
II. S YSTEM M ODEL
Fig. 1 illustrates a two-hop MIMO relay communication
system consisting of one source node, K parallel relay nodes,
and one destination node. We assume that the source and
destination nodes have Ns and Nd antennas, respectively, and
each relay node has Nr antennas. The generalization to the
system with different number of antennas at each node is
straightforward. To efciently exploit the system hardware,
each relay node uses the same antennas to transmit and receive
signals. Due to its merit of simplicity, we consider the amplifyand-forward scheme at each relay.
The communication process between the source and destination nodes is completed in two time slots. In the rst time
slot, the Ns 1 source signal vector s is transmitted to relay
nodes. The received signal at the ith relay node can be written
as
yr,i = Hsr,i s + vr,i ,
i = 1, , K
(1)
where Hsr,i is the Nr Ns MIMO channel matrix between

the source and the ith relay node, yr,i and vr,i are the received
signal and the additive Gaussian noise vectors at the ith relay
node, respectively.
In the second time slot, the source node is silent, while
each relay node transmits the amplied signal vector to the
- 349 -
ICEIC 2015
destination node as
xr,i = Fi yr,i ,
i = 1, , K
(2)
where Fi is the Nr Nr amplifying matrix at the ith relay

node. Thus the received signal vector at the destination node
can be written as
yd =
K
Hrd,i xr,i + vd
(3)
i=1
where Hrd,i is the Nd Nr MIMO channel matrix between

the ith relay and the destination node, yd and vd are the
received signal and the additive Gaussian noise vectors at the
destination node, respectively. Substituting (1)-(2) into (3), we
have
yd =
K
(Hrd,i Fi Hsr,i s + Hrd,i Fi vr,i ) + vd
i=1
+v
Hrd FHsr s + Hrd Fvr + vd = Hs
(4)
where Hsr [HTsr,1 , HTsr,2 , , HTsr,K ]T is a KNr Ns

channel matrix between the source node and all relay nodes,
Hrd [Hrd,1 , Hrd,2 , , Hrd,K ] is an Nd KNr channel
matrix between all relay nodes and the destination node,
F bd[F1 , F2 , , FK ] is the KNr KNr block diag T
T
T
T
, vr,2
, , vr,K
onal equivalent relay matrix, vr vr,1
is obtained by stacking the noise vectors at all the relays,
Hrd FHsr as the effective MIMO channel matrix of the
H
Hrd Fvr + vd as the
source-relay-destination link, and v
equivalent noise vector. Here ()T denotes the matrix (vector)
transpose, and bd[] stands for a block-diagonal matrix. We assume that all noises are independent and identically distributed
(i.i.d.) Gaussian noise with zero mean and unit variance. The
transmission power consumed by each relay node (2) can be
expressed as
H

H
E[tr(xr,i xH
, i = 1, , K
r,i )] = tr Fi Hsr,i Hsr,i + INr Fi
(5)
where E[] denotes statistical expectation, tr() stands for the
matrix trace, and ()H denotes the matrix (vector) Hermitian
transpose.
Using a linear receiver, the estimated signal waveform
vector at the destination node is given by s = WH yd , where
W is an Nd Ns weight matrix. The minimal MSE (MMSE)
approach tries to nd a weight matrix W that minimizes the
statistical expectation of the signal waveform estimation given
by

H
MSE = tr E s s s s

H
H
H
= tr WHHI
Ns W HINs +W CW (6)
where ()1 denotes the matrix inversion. Substituting (7) back

into (6), it can be seen that the MSE is a function of F can
be written as

1
H 1
MSE = tr INs + H C H
(8)
III. M INIMAL MSE R ELAY D ESIGN
In this section, we address the relay amplifying matrices
optimization problem for systems with a linear receiver at the
destination node. In particular, we show that the optimal relay
matrices has a general beamforming structure. Base on (5) and
(8), the relay amplifying matrices optimization problem can be
formulated as

1
HC
1 H
min
(9)
tr INs + H
{Fi }

H
s.t.
tr Fi Hsr,iHH
sr,i+INr Fi Pr,i , i = 1, , K(10)
where (10) is the power constraint at the relay node, and Pr,i >
0 is the corresponding power budget availabe at the ith relay.
A. Optimal Relay Design Using Projected Gradient (PG)
Approach
Let us introduce the following singular value decompositions (SVD)
H
Hsr,i = Us,i s,i Vs,i
,
(11)
where s,i and r,i are Rs Rs and Rr Rr diagonal matrix.

Here Rs rank(Hsr,i ), Rr rank(Hrd,i ), rank() denotes
the rank of a matrix. The following theorem states the structure
of the optimal Fi .
THEOREM 1: The optimal structure of Fi as the solution to
the problem (9)-(10) is given by
Fi = Vr,1 Ai UH
s,1 ,
i = 1, , K
(12)
where Ai is an R R diagonal matrix and R min(Rs , Rr )..

PROOF:
Without loss of generality, Fi can be written as

Ai Xi
UH
s,1
Fi = Vr,1 Vr,1
H
Yi Zi
(U
s,1 )
i = 1, , K
(13)
H
H
H
(Vr,1
) =INr Vr,1 Vr,1
, U
where Vr,1
s,1 (Us,1 ) =INr
H
Us,1 Us,1 , such that [Vr,1 , Vr,1 ] and [Us,1 , Us,1 ] are unitary
matrices. The matrices Ai , Xi , Yi , Zi are arbitrary matrices
with dimensions of R R, R (Nr R), (Nr R) R,
(Nr R) (Nr R), respectively. Substituting (13) back into
H
(9), we obtain that Hrd,i Fi Hsr,i = Ur,i r,i Ai s,i Vs,i
and
K
H H
H
H
H
Hrd,i Fi Fi Hrd,i = i=1 Ur,i r,i (Ai Ai +Xi Xi )r,i UH
r,i .
Thus we can rewrite equation (9) as
K

K

H
H H
H
MSE =tr
INs +
Vs,i s,i Ai r,i Ur,i
Ur,i r,i (Ai AH
i +
where C
noise covariance matrix given by
isHthe
equivalent
C=E v
= Hrd FFH HH
rd + INd . The weight matrix W
which minimizes (6) is the Wiener lter and can be written as
H
H + C)
1 H
W = (H
H
Hrd,i = Ur,i r,i Vr,i
(7)
- 350 -
i=1
H
H
Xi XH
i )r,i Ur,i
i=1
+ IN d
1
K
H
Ur,i r,i Ai s,i Vs,i
1
i=1
i = 1, ,K.
(14)
ICEIC 2015
problem
TABLE I
PROCEDURE OF APPLYING THE PROJECTED GRADIENT
ALGORITHM TO SOLVE THE PROBLEM (15) - (16)
min
i
A
s.t.
(0)
1) Initialize the algorithm at a feasible Ai for i = 1, , K; Set

n = 0.
(n)
2) Compute the gradient of (15) f (Ai );
(n)
(n)
(n)
(n) .
Project Ai = Ai sn f (Ai ) to obtain A

i
(n+1)
(n)
(n) A(n) )
= Ai + n (A
Update Ai with Ai
i
i
(n+1)
(n)
Ai , then end.
3) if max abs Ai
Otherwise, let n := n + 1 and go to step 2).
Substituting (11) back into the left-hand-side of

the transmission power constraint (10), we have

2
H
H
tr Ai (2s,i+ INr )AH
i + Yi (s,i+ INr )Yi+ Xi Xi + Zi Zi .
From (13), we nd that Xi = 0R(Nr R) , Yi = 0(Nr R)R ,
and Zi= 0(Nr R)(Nr R) , minimize the power consumption.
Thus we have Fi = Vr,i Ai UH

s,i .
The remaining task is to nd the optimal Ai , i = 1, , K.
From (14), we can write the optimization problem as
K

K

H
H H
H
min tr
IN s +
Ur,i r,i Ai
Ai
i=1
i=1
H
H
AH
i r,i Ur,i + INd
1
K
1
H
i=1
s.t. tr
Ai (2s,i
INr )AH
i
(16)
Both the problem (9)-(10) and the problem (15)-(16) have

matrix optimization variable. However, in the former problem,
the optimization variable Fi is an Nr Nr matrix. In general,
the problem (15) - (16) is nonconvex and globally optimal
solution is difcult to obtain with a reasonable computational
complexity. Fortunately, we can resort to numerical methods,
such as the projected gradient algorithm [11] to nd (at least)
a locally optimal solution of (15) - (16). The procedure of the
projected gradient algorithm is listed in Table I, where n and
sn denote the step size parameters at the nth iteration. max
abs denote the maximum among the absolute value of all
elements in a matrix, and is a positive
constant close to 0.

1
HC
1 H
THEOREM 2: If f (Ai ) = tr IN + H
is
s
chosen as the objective function, then its gradient f(Ai ) with

respect to Ai can be calculated by using results on derivatives
of matrices in [13] as

f (Ai ) = 2 [Mi Ri ]T [Si Ci ]T + [Mi Ri ]T [Di ]T

1
T
T
[EH
i Gi Ri ] [Si ]
i = 1, , K.
(17)
PROOF: See Appendix A.
i given
i onto the feasible set of A
The projection of A
by (16) is performed by solving the following optimization
(19)
i [( + 1)IN + 2 ]1
i = A
A
s,i
r
where > 0 is the solution to the nonlinear equation

i [(+ 1)IN + 2 ]1(2 + IN )
tr A
s,i
s,i
r
r
2 1 H
[(+ 1)INr+ s,i ] Ai = Pr,i .
(20)
Equation (20) can be efciently solved by the bisection method

[11]. The step size parameters n and sn are determined by
the Armijo rule [11], i.e., sn = s is a constant through
all iterations, while at the nth iteration, n is set to be
mn . Here mn is the terminal nonnegative integer that sat(n+1)
(n)
ises the following
inequality MSE(Ai
)MSE(Ai )

(n)
(n)
(n)
A ) , where and
mn realtr (f (Ai ) )H (A
i
i
are constants. According to [11], usually is chosen close
to 0, for example [105 , 101 ], while a proper choice of
is normally from 0.1 to 0.5.
B. Simplied Design
By introducing
Pr,i ,
i = 1, , K.
(18)
By using the Lagrange multiplier method, the solution to the

problem (18)-(19) is given by
(15)

i A
i )(A
i A
i )H
tr (A

H Pr,i .
i (2 + IN )A
tr A
s,i
i
r
Hrd F.
F
(21)
The received signal vector at the destination can be equiv +v

FH
sr , and
, where H
alently written as yd = Hs
Fvr + vd . Considering (2) and (21), the transmission

v
power consumed at the output of Hrd can be expressed as

H
HsrHH +IKN F
E[tr((Hrd xr )(Hrd xr )H )] = tr F
sr
r

H
H
.
(22)
tr(Hrd,i HH
rd,i )tr Fi Hsr,iHsr,i+INr Fi
Substituting (10) into (22) we have
K
K

H

HsrHH +IKN F
P
tr(Hrd,i HH
tr F
r,i
sr
rd,i ). (23)
r
K
i=1
i=1
Here i=1 Pr,i Pr , is the total transmission power budget

available to all K relay nodes. Using (23), the relaxed relay
optimization problem can be written as

HC
1 H
1
min
(24)
tr INs + H
F
H

H
Pr , i = 1, ,K(25)
HsrH +IKN F
s.t.
tr F
sr
r
H
where Pr Pr tr(Hrd HH
rd ). Let Hsr = Us s Vs denote
the singular value decomposition (SVD) of Hsr , where the
dimensions of Us , s , Vs are KNr KNr , KNr Ns , Ns
Ns , respectively. We assume that the main diagonal elements
of s is arranged in a decreasing order. Using Theorem 1 in
as the solution to the problem
[10], the optimal structure of F
(24)-(25) is given by
- 351 -
= Qf UH
F
s,1
(26)
ICEIC 2015
where Q is any Nd Ns semi-unitary matrix with QH Q =
INs , Us,1 contain the leftmost Nb columns of Us , and f is
an Ns Ns diagonal matrix. The proof of (26) is similar to
the proof of Theorem 1 in [10]. From (26), we see that the
has a beamforming structure. In fact, the optimal
optimal F
diagonalizes the source-relay-destination channel H
up to a
F
rotation matrix Q. Using (26), the relay optimization problem
(24)-(25) becomes

1 1

2 2
min tr INs + f s f + INs
(27)
f
s.t.

tr 2f 2s +INs Pr .
(28)
Let us denote f,i , s,i , i = 1, , Ns , as the main diagonal

elements of f , s , respectively, and introduce

ai 2s,i ,
yi 2f,i 2s,i +1 ,
i = 1, , Ns .(29)
variance. We dene SNRs = s2 Ps KNr /Ns and SNRr =

r2 Pr Nd /(KNr ) as the signal-to-noise ration (SNR) for the
source-relay link and the relay-destination link, respectively.
We transmit Ns 1000 randomly generated bits in each
channel realization, and all simulation results are averaged
over 200 channel realizations. In all simulations, the MMSE
linear receiver in (7) is employed at the destination for symbol
detection.
In our example, a parallel MIMO relay system with K = 2
relay nodes, Ns = Nd = 5, and Nr = 4 are simulated. We
compare the BER performance of the propose optimal relay
matrices using Projected Gradient (ORP) algorithm in (12)
with ZF algorithm in [8], MMSE algorithm in [8], and the
naive amplify-and-forward (NAF) Algorithm. While Fig. 2
demonstrates BER versus SNRs for SNRr xed at 20 dB.
It can be seen that the propose algorithm outperforms all
competing algorithms in the whole SNRs range.
The optimization problem (27)-(28) can be equivalently rewritten as

min
y
s.t.
Ns

i=1
Ns
a i x i + yi + 1
ai xi yi + ai xi + yi + 1
yi Pr
yi 0,
(30)
i = 1, , Ns (31)
i=1
where y [y1 , y2 , , yNs ]T . The problem (30)-(31) can be

solved by an iterative method developed in [10], where in
iteration, y is updated alternatingly by xing the other vector.
After the optimal y is found, f,i can be obtained from (29)
as

yi
,
i = 1, , Ns .
f,i =
(32)
2s,i xi + 1
in (26), we have
Using (21) and the optimal structure of F
Hrd,i Fi = Qf i , where matrix i contains the (i1)Nr +
1 to iNr columns of UH
s,1 . Then we obtain
Fi = Hrd,i Qf i ,
i = 1, , K
where () denotes matrix pseudo-inverse. Finally, we scale Fi

in (33) to satisfy the power constraint (10) at each relay node
as
i = 1, , K
where the scaling factor i is given by i

H
Pr,i /tr(Fi [Hsr,i HH
sr,i + INr ]Fi ), i = 1, , K.
VI. A PPENDIX
H
Base on (11) and (12), we have Hsr,i = Us,i s,i Vs,i
,
K
H
H
Hrd,i=Ur,i r,i Vr,i , Fi=Vr,i Ai Us,i , i=1 Hrd,i Fi Hsr,i =
K
K
H
H H
, and
i=1
i=1 Hrd,i Fi Fi Hrd,i =
K
H H
H
i=1 Ur,i r,i Ai Ai r,i Ur,i . Thus f (Ai ) can be written as
K

K

H
H H
H
f (Ai ) = tr INs+
Ur,i r,i Ai
i=1
(34)
=
i=1
K
1
H
H
AH
i r,i Ur,i+INd
(33)
i = i F i ,
F
V. C ONCLUSIONS
In this paper, we have derived the general structure of the
optimal relay amplifying matrices for parallel MIMO relay
communication systems using the projected gradient approach.
The proposed algorithm has less computational complexity
compared to the existing techniques. Simulation result shows
the effectiveness of the proposed algorithm.
1
H
Ur,i r,i Ais,i Vs,i
i=1
(35)

K
H
H H
H
Let us dene ZH
i j=1,j=i Vs,j s,j Aj r,j Ur,j , and Yi
K
H H
H
j=1,j=i Ur,j r,j Aj Aj r,j Ur,j +INd . Then f (Ai ) can be
written as

H
H H
H
f (Ai ) = tr INs+(ZH
i +Vs,i s,i Ai r,i Ur,i )(Yi +Ur,i r,i
1
H
H 1
H
A i AH
U
)
(U
V
+Z
)
r,i
r,i
i
s,i
i
i
r,i r,i
s,i
IV. S IMULATIONS
(36)
In this section, we study the performance of the proposed

optimal relay beamforming algorithms for parallel MIMO
relay systems with linear MMSE receiver. All simulations
are conducted in a at Rayleigh fading environment where
the channel matrices have zero-mean entries with variance
s2 /Ns and r2 /(KNr ) for Hsr and Hrd , respectively. The
BPSK constellations are used to modulate the source symbols,
and all noise are i.i.d Gaussian with zero mean and unit
1
Applying INs +AH C1 A

= INs AH (AAH +C)1 A.
Then, (36) can be written as

H
H H
H
f (Ai ) = tr INs (ZH
i + Vs,i s,i Ai r,i Ur,i )((Ur,i r,i
- 352 -
H
H
H H
H
Ai s,i Vs,i
+ Zi )(ZH
i + Vs,i s,i Ai r,i Ur,i )
H
H 1
+(Yi + Ur,i r,i Ai AH
i r,i Ur,i ))

H
(Ur,i r,i Ai s,i Vs,i + Zi ) .
(37)
ICEIC 2015
H
Let us now dene Ei Ur,i r,i Ai s,i Vs,i
+ Zi , Ki
H H
H
Yi + Ur,i r,i Ai Ai r,i Ur,i , and Gi Ei EH
i + Ki . We
can rewrite (37) as

1
H 1
f (Ai )= tr INsEH
.(38)
i Gi Ei = tr INsEi Ei Gi
vr
Then the derivative of f (Ai ) with respect to Ai is given by

1
f (Ai ) =
tr Ei EH
i Gi
Ai
Ai

H 1
=
tr G1
i Ei Ei Gi Gi
Ai
1
H
tr[EH
i Gi Ur,i r,i Ai s,i Vs,i ]
Ai
H 1
=
tr G1
i Ei Ei Gi ((Ur,i r,i Ai s,i
Ai
H
H
H H
H
Vs,i
+ Zi )(ZH
i + Vs,i s,i Ai r,i Ur,i )

H
+(Yi + Ur,i r,i Ai AiH H
r,i Ur,i )
1
T
H T
[EH
i Gi Ur,i r,i ] [s,i Vs,i ] .
H 1
MiG1
i Ei Ei Gi ,
Dening
we can rewrite (39) as
CiEH
i ,
and
x1
x2
.
.
.
y1
F2
y2
H rd
.
.
.
yNd
R elay
Source
(39)
.
.
.
H sr
x Ns
vd
D estin atio n
Fig. 1. Block diagram of a parallel MIMO relay communication system.
H
H
DiAH
i r,i Ur,i ,
H
f (Ai ) =
tr Mi (Ur,i r,i Ai s,i Vs,i
+ Zi )Ci
Ai
Ai
+Mi (Yi + Ur,i r,i Ai Di )]
1
T
H T
[EH
i Gi Ur,i r,i ] [s,i Vs,i ] .
(40)
10
Average BER
10
H
Here Ri Ur,i r,i , and Si s,i Vs,i
, we can rewrite (40)
as
f (Ai ) =
tr [Mi Ri AiSiCi+Mi Ri AiDi]
Ai
Ai
1
T
T
[EH
i Gi Ri ] [Si ] .
10
10
(41)
Finally, the gradient is given by

f (Ai ) = 2 [Mi Ri ]T [Si Ci ]T + [Mi Ri ]T [Di ]T

1
T
T
[EH
.
i Gi Ri ] [Si ]
10
NAF Algorithm
ZF Algorithm [8]
MMSE Algorithm [8]
Optimal Relay Algorithm
10
15
SNRs (dB)
20
25
Fig. 2. BER versus SNRs while xing SNRr = 20dB. Ns = Nd = 5, and

Nr = 4.
(42)

R EFERENCES
[1] R. Pabst, B. H. Walke, D. C. Schultz, D. C. Herhold, H. Yanikomeroglu,
S. Mukherjee, H. Viswanathan, M. Lott, W. Zirwas, M. Dohler, H.
Aghvami, D. D. Falconer, and G. P. Fettweis, Relay-based deployment
concepts for wireless and mobile broadband radio, IEEE Commun.
Mag., vol. 42, pp. 80-89, Sep. 2004.
[2] B. Wang, J. Zhang, and A. Hst-Madsen, On the capacity of MIMO
relay channels, IEEE Trans. Inf. Theory, vol. 51, pp. 29-43, Jan. 2005.
[3] X. Tang and Y. Hua, Optimal design of non-regenerative MIMO
wireless relays, IEEE Trans. Wireless Commun., vol. 6, pp. 1398-1407,
Apr. 2007.
[4] O. Munoz-Medina, J. Vidal, and A. Agustn, Linear transceiver design
in nonregenerative relays with channel state information, IEEE Trans.
Signal Process., vol. 55, pp. 2593-2604, Jun. 2007.
[5] W. Guan and H. Luo, Joint MMSE transceiver design in nonregenerative MIMO relay systems, IEEE Commun. Lett., vol. 12, pp.
517-519, Jul. 2008.
[6] G. Li, Y. Wang, T. Wu, and J. Huang, Joint linear lter design in multiuser cooperative non-regenerative MIMO relay systems, EURASIP J.
Wireless Commun. Networking, vol. 2009, Article ID 670265.
[7] Y. Rong, Joint source and relay optimization for two-way linear
non-regenerative MIMO relay communications, IEEE Trans. Wireless
Commun., vol. 8, pp. 6068-6077, Dec. 2009.
[8] O. Oyman and A. J. Paulraj, Design and analysis of linear distributed
MIMO relaying algorithms, IEE Proc. Inst. Elect. Eng., Commun., pp.
565-572, Aug. 2006.
[9] A. S. Behbahani, R. Merched, and A. M. Eltawil, Optimizations of a
MIMO relay network, IEEE Trans. Signal Process., vol. 56, pp. 50625073, Oct. 2008.
[10] Y. Rong, X. Tang, and Y. Hua, A unied framework for optimizing linear non-regenerative multicarrier MIMO relay communication systems,
IEEE Trans. Signal Process., vol. 57, pp. 4837-4851, Dec. 2009.
[11] D. P. Bertsekas, Nonlinear Programming. 2nd. Edition, Athena Scientic, Belmont, Massachusetts, 1999.
[12] S. Boyd and L, Vandenberghe, Convex Optimizationh. Cambridge, U.K.: Cambridge University Press, 2004.
[13] K. B. Petersen and M. S. Petersen, The Matrix Cookbook. [Online].
Available: http://matrixcookbook.com.
- 353 -
30
FO-3-4-2
Miniaturized Circular Polarized TE10-Mode Substrate-Integrated-Waveguide

Antenna
Kyeongseob Kim and Sungjoon Lim
School of Electrical and Electronics Engineering, Chung-Ang University, Seoul, Republic of
Korea
kks6695@naver.com, sungjoon@cau.ac.kr
Abstract
In this paper, a miniaturized circularly polarized
(CP) antenna based on a substrate integrated
waveguide (SIW) is presented. To reduce the size, only
1/8 of the SIW cavity is used as the radiation aperture.
The measured peak gain is 0.7dBi and axial ratio is
2.3dBi at 1.645GHz.
2.3 dB at 1.645 GHz as illustrated in Fig. 2. The 3-dB

axial-ratio bandwidth is from 1.64 to 1.65 GHz.
Keywords: Circular polarization (CP), substrate

integrated waveguide (SIW), eighth-mode SIW
(EMSIW).
1. Introduction
The demand for high performance and a small size
has increased steadily. To meet this demand, substrate
integrated waveguide (SIW), which is low-loss,
compact in volume, low profile, and can make a simple
integration with other planar circuits, is being used in
an increasing number of applications. The SIW is
composed of two rows of conductive cylinders on a
printed circuit board (PCB). The eighth-mode SIW was
formed by bisecting the quarter-mode substrate
integrated waveguide (QMSIW) [1]. In this paper, an
electrically small circular polarization SIW antenna is
proposed. The antenna size is reduced by utilizing two
EMSIW cavities working in the TE10 mode.
Figure 1. Dimensions and prototype of the proposed

antenna (unit: centimeters).
Figure 2. Simulated and measured peak gain and

axial ratio in the LHCP mode (theta = 0).
2. Design and Simulation Result
3. Acknowledgement
The proposed circular polarization SIW antenna is

fabricated on a Rogers Duroid 5880 substrate with a
thickness of 1.575mm. Fig. 1 shows dimensions and
prototype of the proposed antenna. The size of the
EMSIW cavity is 1/8 of the conventional SIW.
Because of the isolating structure of the via walls, the
two cavities can be closely placed. To excite
electromagnetic waves with equal magnitude and
90 phase difference at each port, a quadraturecoupler is used in the experiments. The simulated and
measured peak gain and axial ratio are 1.65 dBi and
[1] S. Sam and S. Lim, Electrically small eighth-mode

substrate-integrated waveguide antenna with different
resonant
frequencies
depending on
rotation
of
complementary split ring resonator, IEEE Trans. Antennas
Propag., vol. 61, no. 10, pp. 49334939, Oct. 2013.
This work was supported by the Basic Science

Education,
Science
and
Technology
(2012R1A1A2040160).
4. References
- 354 -
FO-3-4-3
The Analysis of Prophet on IBR-DTN for Digital Information Sharing System

in Rural Area
Magdalena Trie P. 1), Eko Sakti P.2) , Achmad Basuki 3)
Program of Information Technology and Computer Science
Brawijaya University
Magdalena.trie@gmail.com1), ekosakti@ub.ac.id2), abazh@ub.ac.id3)
since it is hard to build a reliable network.
Therefore, a digital information sharing system
is required in order to solve the problem of
uneven spread of information exchanges.
The have been several researches related to
topic of the digital information sharing system.
The author in [2] implemented information
sharing system using IBR-DTN on Raspberry Pi.
Their work assumed that distance between IBRDTN nodes is not far way, not taking care of the
existence of moving/commuting nodes between
nodes.. On the other research [3], the author
offers a digital information sharing system
without Internet connectivity by using a digital
data courier mechanism. The shortcoming of the
system is in the need of a courier to deliver the
data to the USB flash drive from the village to
the city and vice versa. It may leads to a low data
delivery rates if the system is highly rely on a
courier only, while we do have a lot of people or
vehicles commuting in between the village and
city. Therefore, we need a method to take the
advantage of having the nodes that move back
and forth between regions.
In this paper, we propose the implementation
of Prophet Algorithm as a routing protocol to
overcome the problems. The Prophet algorithm
utilizes information about the encounters
between nodes and transitive properties of nodes
to optimize the delivery of a DTN bundle over a
network with limited connectivity[4]. Therefore,
it is suitable to be implemented on commuting
nodes that are in between the source and
destination. We implemented that Prophet
algorithm on top of the IBR-DTN, which is one
implementation of the Delay Tolerant Network
(DTN). DTN offers a communication service on
a network with limited connectivity, because it
has a high tolerance for delay on the network.
IBR-DTN is used because it is one
Abstract
Delay Tolerant Network (DTN) is a
technology which can be utilized to overcome the
difficulties of information exchanges in rural
area. Implementing DTN between two adjacent
and contiguous nodes is trivial. However, it is
very challenging if those two nodes are not
contiguous and in between only commuting
nodes are available as a communication option.
For example, there exist two nodes located in
separated islands with some ships commuting
between those islands. We are required to utilize
any available intermediate nodes (e.g. ships) to
forward the messages between two separated
nodes. In order to do that, we can employ the
Prophet Routing Protocol Algorithm to select
appropriate nodes for forwarding the messages.
In this paper, we implemented IBR-DTN with
Prophet as the component of information sharing
system in rural area. The IBR-DTN with Prophet
will use transitive properties and the history of
encounters between commuting nodes. From the
experiment, we concluded that Prophet
implemented in IBR-DTN nodes (includes the
commuting nodes) can successfully exchange
information between nodes. We measured that
the delivery ratio for a small number of files
using two commuting nodes is higher than using
one commuting node. On the contrary, using one
commuting node has a lower average delay.
Keywords: Rural, DTN, IBR-DTN, Prophet
Routing Protocol, Transitive node
1. Introduction
Rural is an area that is far away from the city
or the beach. That condition leads to the
difficulties of digital information exchanges,
- 355 -
ICEIC 2015
implementation of DTN that has Prophet as one

of the routing module. From the experiment, we
concluded that Prophet implemented in IBRDTN nodes (includes the commuting nodes) can
successfully exchange information between
nodes. We measured that the delivery ratio for a
small number of files using two commuting
nodes is higher than using one commuting node,
On the contrary, using one commuting node has
a lower average delay
4. The Theory
Prophet
Prophet (Probabilistic Routing Protocol using
History of Encounters and Transivity) is one of
the routing protocols in DTN (Delay Tolerant
Network), where there are no fixed network.
Prophets characteristics is using the knowledge
of a meeting between nodes to optimize the
packet forwarding. Another characteristic is the
transitifity, whereby if the two nodes are rarely
met, it can take advantage of the nodes that are
often met with the node. Prophet has a metric or
vector called Delivery Predictability (DP). DP is
used on each node to determine wether to
forward the packet or not when encounter occur
within nodes.
2. Problem Statement
The research problem in this paper is based
the reality of the difficulties of information
sharing in the rural area, where connectivity is
basically limited and contiguous nodes are not
exist. Our research question are on how the
Prophet can be used to connect multiple moving
nodes and analyze the use of Prophet for
information exchanges (file) on network with
limited connectivity using multiple moving
nodes.
Delivery Predictability Calculation

Each node has a DPs table and every
encounter between nodes, it exchange the
information about their DPs table. The DPs
table will be updated whenever the encounter
occur between nodes. Delivery Predictability can
be calculated in several ways based on the
encounter between nodes. Nodes wich is often
meet will be have a high DP. The calculations
shown in equation 2-1.
(,) = (,) + (1 (,) )x (2-1)
where:
(,) = DP to node B which is stored in the
node A after the encounter
(,) = DP before encounter with the node
= Constant initialization
The nodes that are rarely met, tend to be the
nodes that are less good to forward the message
because the value of the DP at the node
decreases. The calculation is shown in Equation
2-2 where is a constant (usually 0988) [4] and
K is the unit of time which is calculated from the
last DP aging.
(,) = (,) x
(2-2)
One of the characteristics of Prophet is
transitiv properties. Transitiv properties are used
if there are two nodes, the source and destination,
which rarely met but there are another nodes that
often met with one of the source and destination.
Nodes between the source and the destination is
3. Related Work
Literature review in this study refers to the
previous study, entitled "Design of Information
Exchange System on Delay Tolerant Network in
Rural Area Using Raspberry Pi". The study
described the design of the network
infrastructure in rural areas that are low cost,
small size devices, energy saving, and able to
work on a limited connectivity. The
infrastructure is implemented using the IBRDTN that has bundle protocol.
Other related research entitled "Digital Data
Courier: Rural Digital Information Sharing
System" offers a digital information sharing
system without any internet connection. The
system is built on the concept of DTN. The
absence of a permanent Internet connection in
the rural area causes that the store and forward
mechanishm in DTN can not occur, so in this
study proposes a data courier mechanism. By
using a courier service data, the geographical
constraints are no longer a barrier to the spread
of information [3].
- 356 -
ICEIC 2015
a node that is a good possibility for forwarding

messages between source and destination nodes.
The calculations shown in equation 2-3.
Digital Information
Technological developments, especially in
communication technology make progress very
rapidly. With the development of Internet, the
information system required to be done via the
internet. Based on the presentation, the digital
information is information that is presented in the
form of electronic or digital. Unlike the physical
information that can be directly used or accessed
at any time without additional devices, digital
information requires support device to be
accessible.
(,) = (,) (1 (,) )

x (,) x (,) x
(2-3)
where:
(,) = DP to node C which is stored in the

(,) = DP before encounter
(,) = DP to node B which is stored in the
(,) = DP to node C which is stored in the
node B after the encounter
Rural Area
Rural is an area that is far away from the city
or the beach [1]. Rural geographical location
makes it hard to reach from the city, therefore it
have characteristic :
- Not affordable from technology developments,
both information technology and communication
technology
- Human resources is limited
- The economy in rural areas far below the urban
areas
- Geographical location are difficult to reach for
the development of rural areas
= Constanta
DTN (Delay Tolerant Network)

Delay Tolerant Network or commonly
referred as DTN offers a communication service
on the network with limited connectivity. DTN
provides a mechanism that can connect a
regional network that has different delay
characteristics
[5]. DTN is a network
architecture that offers a pretty high tolerance for
delay. DTN is designed to overcome the
communication on a network where there is no
continuous connectivity.
5. Design and Testing

In this study, constructed a digital
information sharing system on rural area which
stands on a DTN network. In the file transfer
between its nodes used Prophet as a routing
protocols .
Fig. 2 illustrates the design of the system
architecture. There are two areas separated by
inland seas and were not connected directly, in
order to do information exchange, it needed a
network infrastructure. In each of the rural is
provided a computer as the sender and receiver.
IBR-DTN nodes as carriers of information
between the regions is placed in a vessel. There
are 2 moving nodes are placed in two different
vessels that commuting between island.
IBR-DTN
Delay Tolerant Network is a network that
offers messaging facility to a network that is not
always has an end-to-end connection
continuously. In recent years DTN become very
popular and widely developed. One result is the
development
of
IBR-DTN
DTN
as
implementation of DTN. IBR-DTN daemon is
one of the DTN bundle protocol that is used as
the standard protocol. In this study, we used IBRDTN as the implementation of DTN as compared
to DTN2, IBR-DTN is better in terms of memory
and storage on the disc [6].
Raspberry Pi
Raspberry is a mini computer that only the
size of an ATM card. Although the size of a
raspberry pi much smaller than desktop
computers in general, however, raspberry pi have
the same capabilities as a desktop computer [7].
- 357 -
ICEIC 2015
File delivery from rural 1 to
rural 2
IBR-DTN node 1
Rural 1
Files Delivery Test Using Prophet

Sending files using Prophet as a routing
protocol performed with 3 scenarios. In the 1st
scenario, the IBR-DTN nodes are close to each
region. Rural 1 sends a file of 30MB to Rural 2.
After 10 minutes node 1 moves closer to the
Rural 2 and node 2 moves closer Rural 1. After
arriving, the node stops for 10 minutes before
finally returning to their respective areas. On the
way back to the area, each node are encounter.
Illustration Testing with 1st Scenario contained in
Figure 3. The test is performed to determine the
transmission of files between nodes that run back
and forth from the rural to the more remote areas.
IBR-DTN node 2
Rural 2
The nodes moves from one

region to another
wireless range
Figure 1 System architecture and scenario
At each IBR-DTN node , sender and receiver

in the rural area, using prophet as the routing
protocol. Prophet used the transitive properties
and knowledge record of encounter between
nodes. Inter-regional nodes that utilize the
prophet are moving closer and away from the
rural area between the two region.
Test Environment
From the described design of the system and
implementation, the system tested to determine
whether the system is going according to the
expected function. Tests done on the system by
testing the transmission of files with limited
connectivity, and sending files using a prophet to
know the network performance.
IBR-DTN node 2 move

closer to Rural 1
adhoc
IBR-DTN node 1
Rural Area 1
IBR-DTN node 2
IBR-DTN node 1 move closer

to Rural 2
Rural Area 2
IBR-DTN node 1
IBR-DTN node 2
Rural Area 2
Rural Area 1
3
Files Delivery Test with Limited Connectivity

In this test is done by sending a file of
approximately 6MB of computer sender to the
receiver. At first, the sender and receiver
computers are not connected to each other, then
after 15 minutes, the sender and receiver are
connected. Network with limited connectivity is
illustrated in Figure 2.
The test is performed to determine the IBRDTN bundle that utilize when there is no
connection to the destination or destination is not
found.
sender
No connectivity
Rural Area 1
4
IBR-DTN node 2 IBR-DTN node 1
Rural Area 2
IBR-DTN node 1 moves

back to Rural 1
adhoc
IBR-DTN node 1
IBR-DTN node 2
Rural Area 1
Rural Area 2
back to rural 2
Figure 3. Ilustration of 1st Testing Scenario
File delivery testing using prophet with 2nd

scenario is illustrated in Figure 4. In the second
scenario the two nodes are close on the same
rural areas. Then after 10 minutes, node 2 moves
closer to the Rural 1. File for 30MB shipped from
rural areas 1 to 2. After 10 minutes of node 2
moves toward the Rural 2 and node 1 moves
toward Rural 1. Both nodes stopped for 10
minutes after meet each other halfway, and then
return to their respective areas. The test is
performed to determine the delivery of data on
receiver
Figure 2. Network with Limited Connectivity
- 358 -
ICEIC 2015
each node when the nodes meet with the

destination.
Third testing scenario is to determine the
value of average delay and delivery ratio. Third
scenario has the same steps as 2nd scenario in
Figure 4, but there is a difference in the 1st phase.
In the 3rd scenario, on the 1st phase, the node 1
are move away from the Rural 2 with the
opposite direction from Rural 1 and move back
to Rural 2 and it occur over 3 times. Testing
parameters to calculate the delivery ratio
presented in Table 1.
3. Testing and Evaluation

In this section, we present our experiments to
test and analyze system. To analyze the
performance of the Prophet as the routing
protocol, is needed metrics that can be used to
measure performance. The metrics are average
delay and delivery ratio.
- Average Delay: metrics used to measure the
average time that a file takes when file is sent
until reach their destination.
- Delivery Ratio: the metrics used to measure the
ratio of the number of messages sent to the
destination on the number of messages sent from
the sender, at a specific time.
From the above test scenarios, the results of
the test is in the following.
IBR-DTN node 2 moving

closer to Rural 1
IBR-DTN node 1
File Delivery Testing Results with Limited

Connectivity
IBR-DTN node 2
Rural Area 1
Rural Area 2
Rural Area 1
IBR-DTN node 2

back to Rural 1
Rural Area 1
IBR-DTN node 1
At the time of sending the file, the receiver

(destination) is not found or is not affordable then
the file are stored in a bundle. Bundle is stored
on the sender's computer. Bundle has a file size
that is equal to the size of the original file. Bundle
will remain stored on the sender's computer until
the receiver are reachable.
At the time of receiver on or connected to the
sender, the bundle will be transferred from the
sender to the receiver and the file will be received
in the inbox folder destination.
Rural Area 2

back to Rural 2
Rural Area 2
Figure 4. Ilustration of 2nd Testing Scenario
File Delivery Testing Results Using Prophet

Table 1 Testing Parameter
Parameter
1 node
Total number of
10
test
Routing
Prophet
Protocol
Number
of
1 node
moving nodes
Contact time
300 s
Range test
20 m
TTL bundle
480 s
Rate of file 1 file per 5created
10 s
File size
10-100MB
The test results of the 1st scenario shows in

Figure 5, where the file is forwarded to the node
that had met with the destination. Bundle also
retained by the node 2 after the bundle is
forwarded to node 1. When node 2 reach the
destiantion first, the bundle is transferred to the
destination computer (receiver).
2 node
10
Prophet
2 node
300 s
20 m
1800 s
1 file per 510 s
10-100MB
- 359 -
ICEIC 2015
1

closer to rural 1
1
adhoc
IBR-DTN node 1
Rural Area 1

closer to Rural 1
IBR-DTN node 2
IBR-DTN node 1
Rural Area 2

closer to Rural 2
IBR-DTN node 2
Rural Area 2
Rural Area 1
2
Rural Area 1
IBR-DTN node 2
IBR-DTN node 1
Rural Area 2
Rural Area 1
Rural Area 1
4

back to Rural 1
IBR-DTN node 1
Rural Area 2

back to Rural 2
Rural Area 2

back to Rural 1
Rural Area 1
adhoc
IBR-DTN node 2
IBR-DTN node 1
Rural Area 1
IBR-DTN node2 moving
back to rural 2
IBR-DTN node 2
Rural Area 2
File forwarded as a bundle
Rural Area 2
Figure 6. Test Result of the 2nd Scenario
File forwarded as a bundle
Figure 5. Test result of The 1st Testing Scanrio
Table 2. Average Delay
File
size
(MB)
Test results of the file delivery using prophet

with 2nd scenario shown in the Figure 6. The
results of the test is that when the nodes 1 and 2
was encountered, the forwarding bundle were not
occurred. At the time of node 2 back into the
Rural 2 without carrying a bundle, the file sent
by Rural 1 did not get to the destination (Rural 2).
Third scenario testing is done by calculating
the average delay and delivery ratio. The result is
when both nodes encounter, the bundle
forwarded to node 1 and when the node move
backs to Rural 2, the file are sent.
By using 3rd scenario, the calculation for the
influence of the file size toward the average delay
file with intermediate nodes 1 and 2 nodes
contained in Table 2.
10
20
30
40
50
60
70
80
90
100
Average Delay
(second)
1 node
2 node
386.98
712.64
388.20
1082.65
387.82
1296.89
392.43
1592.10
397.58
1483.37
415.18
1760.86
418.81
2226.50
417.05
2347.82
423.55
2741.04
443.68
2931.73
The Result of delivery ratio calculation using

1 moving node and 2 moving nodes shown in
Table 3.
- 360 -
ICEIC 2015
Table 3. Delivery Ratio
Delivery Ratio
1 node
2 node
0. 89
0. 67
0.83
0.5
0.93
0.8
0.83
0.5
0.76
0.28
0.75
0.25
0. 56
0. 89
10
0.5
0. 22
This is because by using 2 nodes, although the

file transfer time takes longer, if the files are few
in number (no more than 5 files, 10MB each)
then the number of file delivered to the
destination is greater than using 1 node.
Comparison of Delivery Ratio
Using 1 and 2 Nodes
ratio
No. of File
Generated
From Fig. 7 it can be seen that the average

value of the delay with 2 IBR-DTN node is much
longer than 1 node. Value of average delay with
one node for smallest to largest file size is below
500 seconds. While the average delay with 2
nodes to the file size of the smallest to the largest
reaching above 500 to 3000 seconds.
From the graph on Fig. 8 it can be seen that
the difference in the value of the delivery ratio of
the 1 IBR-DTN node and 2 IBR-DTN nodes is
not too far away. Using 2 node the delivery ratio
is 1 of the number of files 1 to 5 and then the
value decreased from 6 to 10. The number of files
while on 1 node delivery worth 1 ratio of the
number of files 1 to 3, and then decreases ranging
from 4 to 10 the number of files.
3500
3000
2500
2000
1500
1000
500
0
10
20
30
40
50
60
70
80
90
100
second
Comparison of Average Delay using 1 and 2

nodes
file size (MB)
Figure 7. Comparison Graphic of Average Delay
1.2
1
0.8
0.6
0.4
0.2
0
1
3 4 5 6 7 8 9 10
number of file
1 node
2 node
Figure 8. Comparison Graphic of Delivery Ratio
Conclusion
Enabling Prophet Routing modul in IBRDTN nodes increases the delivery ratio
information exchanges between DTN nodes.
However, as we found in the experiment, the
more commuting nodes are used, the higher the
average delay is.
REFERENCES
[1]. Indonesian
Department
of
Language
Development and Guidance (Kemdikbud),
Kamus Besar Bahasa Indonesia (KBBI), 2014.
Online at http://kbbi.web.id/
[2]. Evan Hardyanto. Perancangan Sistem
Berbagi Informasi di Pedesaan Berbasis Delay
Tolerant Network Menggunakan Raspberry Pi,
PTIIK, Brawijaya University, 2013
[3]. I Ketut Adi Suhendra. Kurir Data Digital :
Sistem Berbagi Informasi Digital Pedesaan,
PTIIK, Brawijaya University, 2013
[4]. Grasic, Samo dan Davies, Elwyn. The
Evolution of a DTN Routing Protocol
Prophetv2 Chants 11, Las Vegas, Nevada,
USA, 2011.
[5]. Venkataraman, Vinod dan Bhatt Acharya,
- 361 -
ICEIC 2015
Hrishikesh. Delay Tolerant Networking - A

Tutrial Department of Computer Science The
university of Texas at Austin, 2009.
[6]. Schildt, Sebastian dan Morgenroth, Johannes.
IBR-DTN: A lightweight, modular and highly
portable Bundle Protocol implementation
Institute of Operating Systems and Computer
Networks
Technische
Universitat
Braunschweig, Braunscweig, Germany, 2011.
[7]. Saiful, Ahmad. Raspberry Pi Komputer Rp
300
ribuan
yang
substansial,
http://inet.detik.com/read/2012/03/20/102306/
1871695/317/1/raspberry-pi-komputer-rp-300ribuan-yang-substansial Diakses pada tanggal
13-05-2014.
- 362 -
FO-3-4-4
Towards Fault Tolerance in Border Surveillance Wireless Sensor Networks

Walid Abdallah*, Noureddine Boudriga*, and Sunshin An**
(*)Communication Networks and security research Lab, University of Carthage, Tunisia;
(**)Computer Network research Lab, Department of Electronics Engineering, Korea University;
Seoul, Korea
ab.walid@gmail.com, noure.boudriga2@gmail.com, sunshin@dsys.korea.ac.kr
Abstract
Border surveillance is one of the major and critical
applications of wireless sensor networks (WSN). To
ensure continuous and reliable operation of the border
control system, deployed sensors should be able to
detect intrusion attempts even in the case where a
number of sensors nodes are faulty. In this paper, we
propose a fault tolerance framework for border
surveillance WSNs that encompasses techniques to
control, detect, predict, and repair faults. Performance
evaluation shows a significant improvement of the
network lifetime when these techniques are used.
Keywords: WSN, Border surveillance, fault tolerance.
1. Introduction
Wireless Sensor Network (WSN) technology is
becoming employed in many domains requiring the
monitoring of events that can occur in a given area. In
this case, the targeted applications will rely on data
reported by the sensor nodes to make appropriate
decisions. This requires that data can be collected with
high reliability and accuracy, an all time full coverage
of the monitored area, and that sensor nodes are in
satisfactory functioning state.
Particularly, in border surveillance application[1], a
WSN is built by deploying a number of sensor nodes
throughout the border line in order to detect peoples or
vehicles that try to illegally cross the border. When an
intruder is detected, the sensor nodes will transmit an
alarm to a control center to decide about the
appropriate actions to be taken. Therefore, to ensure
border control system reliability, sensors should be
able to detect events with high accuracy at any time
and in any point of the monitored area. This must be
provided even if some sensors are faulty, and is
defined as the fault tolerance propriety. However,

sensors can act inappropriately or they can run out of
energy, leading to decreasing the system detection
capability.
A sensor node that can fail in performing its
function appropriately may cause non detection of
intrusion on the border line which, in some cases, may
lead to harmful security consequences. It is then very
important to detect sensor faults, triggers repairing
procedures, and design schemes to implement fault
tolerance in border surveillance wireless sensor
networks.
This paper, proposes a framework to implement
fault tolerance in WSNs intended for controlling
suspicious activities along the country frontiers. It also
presents techniques to control sensor operation, and
detect and predict fault occurrences. Approaches to
isolate and repair faulty nodes and provide fault
tolerance are also developed.
The remaining parts of the paper are structured as
follows. Section 2, presents the adopted border
surveillance wireless sensor network architecture and
describes the functions of each one of its elements.
Section 3, deals with faults detection and prediction
techniques. Section 4, discuss the proposed faults
repairing strategy and fault tolerance scheme. Section
5, presents performance evaluation of fault tolerance
and repairing approach. Finally, Section 6 concludes
the paper.
2. Network architecture
In this section, we will describe the architecture of
the border surveillance wireless sensor network. We
first present the different types of nodes that compose
the topology of the network as well as their functions.
- 363 -
ICEIC 2015
Then, we will discuss some issues related to their

deployment in the monitored area.
2.1. Network topology

Two main topologies can be used to configure any
wireless sensor network; namely, the flat topology and
heterogeneous hierarchical topology. In a flat topology
all sensor nodes should have the same sensing,
processing and communication capabilities. Meanwhile,
heterogeneous hierarchical topology is composed of
many kinds of nodes implementing different functions
and having diverse features in terms of communication,
processing, and energy. Specifically, a heterogeneous
wireless sensor network will include an important
number of cheap sensor devices with low capabilities
and offering a major function consisting in performing
sensing tasks. In addition, a few number of more
expensive devices are installed to achieve complex
operations, such as network control, data filtering and
aggregation, and transport.
The diversification of functions among different
kinds of wireless sensor nodes can contribute in
building cost effective WSN with enhanced efficiency,
scalability, and transmission reliability for many
applications, especially in border surveillance, where a
large number of sensor nodes must be deployed along
the country frontier to control malicious activities of
illegally crossing the border.
Consequently, We consider here the thick-stripbased network topology that we proposed in [1]. This
network has a hierarchical structure composed of three
layers of devices endowed with different capabilities.
The Basic Sensing Node (BSN): These devices

compose the first layer of the network hierarchy.
They are a low cost sensors that are randomly
deployed in strip area adjacent to the border line.
The main function of BSNs, is to detect the
presence of individuals and report this to the
closest Data Relay Node (DRN). In addition, a
BSN can relay data detected by other BSNs which
are far away and cannot directly communicate
with a close DRN.
The Data Relay Nodes (DRN): These nodes
constitute the second layer of the topology. They
are configured in a linear architecture that crosses
the middle of the monitored area. Each DRN will
control a set of BSNs, aggregate reported
information, and transmit data to the data
dissemination node (DDN). Communication
between the DRN and the DDN can be performed
directly or via intermediate DRNs. On the other
hand, transmission between the DRNs and the
BSNs is performed in a full duplex mode. Indeed,
besides routing events detected and reported by
BSNs, the DRN must transmit some instruction to
monitor resource availability, control energy
consumption, and manage routing information.
The Data Dissemination Node (DDN):The DDNs
are situated in the third level of the architecture.
Each DDN will be responsible of the management
of a set of DRNs. Its main function is to process
the data received from the DRNs and to send alerts
to the Network Control Center (NCC) for analysis
and to take suitable decisions.
We assume in this paper that the deployment of

sensor nodes is performed by a quadcopter as we have
defined it in [2]. This deployment provides three types
of techniques: (a) an accurate localization of sensor
nodes and the investigation of coverage problems by
quadcopters; (b) an economical and efficient response
technique that allows to quickly respond to various
types of incidents by intervening in the field to drop
additional sensors at precise positions; (c) a technique
to capture and transmit aerial photo and video
footages of the crossed zone; and (d) an arm-based
technique to remove and place physically sensor
nodes.
Figure1 shows the considered network topology.
2.2. Nodes deployment

Figure1: Network architecture
In this architecture, we can distinguish the
following kinds of nodes:
The main objective of the WSN-based border

surveillance system is to efficiently and reliably
identify and detect persons and vehicles that attempt to
cross the border line. Therefore, the deployment
strategy of the WSN represents an important issue to
address in the design of the network architecture and
- 364 -
ICEIC 2015
ensure connectivity between the different sensing

devices, when needed.
repairing and recovering. We can define a fault as the

deviation of the device from the expected behavior.
In our work, we consider a thick line network

because this ensures a larger coverage and enables the
tracking of the intruders. In fact, this choice is more
effective than a linear configuration where the
intruders can be detected only when they cross the
border line. However, deploying BSNs in a strip area
adjacent to the border line allows real time and
efficient intrusion detection by many devices. This will
enhance the reactivity of the whole system by
providing intrusion tracking and targets localization
functions. Nevertheless, the performances of the
detection system depends on the quality of coverage
and connectivity of the wireless sensor networks. This
can be achieved by adopting a suitable deployment
strategy of the different types of nodes.
In particular, the border surveillance system must

ensure permanent operation and detect events related to
surveillance with higher accuracy regardless the faults
that may occur in some devices of the WSN. The faults
in the WSN-based border surveillance can occur in any
layer of the network hierarchy. However, the reader
can argued that most of the faults occur in the physical
layer [4-6] which is subject to malfunctioning and
energy depletion. As examples of faults, one can
mention, drifts that appear along the life time of the
sensor node due to bad calibration of the sensing
devices, random noise that cause false variation in the
collected data, energy depletion due to batteries failure,
and complete malfunctioning software faults. In the
following, we give a detailed classification of sensor
faults.
In our architecture, the DRNs will be deployed on a

line that is crossing the middle of the strip area. To
ensure that all nodes are connected, the distance
between two consecutive DRNs must be relatively
smaller than the coverage radius of a single DRN.
Besides, the BSNs will be randomly deployed in the
monitoring region. The main constraint, we observe
here, is that a DRN must communicate to all BSNs that
are under its control in a one hop communication. For
this reason, the width of the strip must be less than
twice the coverage radius of the DRN.
In addition, the deployment strategy must minimize
the number of isolated BSNs. To this end, a controlled
random deployment of the BSNs must be performed,
where one can specify the region where the sensor
node can be deployed. The authors of this paper had
proposed in [3] an air dropping deployment strategy of
sensor nodes that can control the position where the
sensor node will be placed using the concept of paving.
A mathematical model is also provided to predict the
dropping position of a sensor node taking into
consideration the velocity and the height of the
helicopter, and the wind force.
3. Faults detection and prediction

One of the major issues in wireless sensor
networks is how to maintain a satisfied level of
functioning of the sensing and communication
functionalities of the sensor nodes during a maximal
period of time. Generally, the network lifetime depends
on the energy consumption of all its sensor nodes.
However, the operation performance will require the
implementation of faults detection and tolerance
mechanisms in the wireless sensor network, in addition
to some techniques that can allow a quick fault
3.1. Faults classification

Sensor faults can be classified into two categories:
data-centric and system-centric faults [4]. In the first
category, faults are observed through the data gathered
by the sensor nodes. In the opposite, faults in the
second category refer to physical malfunctioning,
impact of environment changes, and inconsistencies of
factors that cannot be modified throughout the sensor
lifetime.
By considering only data-centric view point, we
assume that the faults occurring in each layer of the
network hierarchy can be detected by analyzing the
information transmitted to the higher level. In this
category, we can distinguish the following major five
faults:
Temporal gradient: A temporal gradient consists in the
occurrence of an abnormal variation of a measurable
parameter during a short time interval. In most cases,
the temporal gradient depends on the environment
context and the variation models of the gathered
parameter characterizing the physical phenomenon. In
general, the analysis of the variation must be done on a
vector of sampled values of the observed parameter
and not on an isolated event. In our border surveillance
application, this can be the variation of the positions of
an intruder that cannot reflect a normal behavior (e.g.,
very high speed, sudden deviation in direction, etc.).
Crossing boundaries: In this case, a probable fault can
be detected by monitoring the value of an observed
parameter and controlling whether it exceeds a given
threshold. The crossing is defined as the existence of
an isolated value or a sensor that significantly deviates
from the expected temporal or special variation models
- 365 -
ICEIC 2015
of the observed parameter. This can be for example the

value of the reported battery level which cannot fit
with operation time of the sensor. This value can
indicate that the battery of the sensor node will be out
of charge in closer time. Another example related to
the border surveillance, consists in detecting an
intrusion attempts by only one BSN whilst all its
neighbor nodes do not report any detection, assuming
that the sensing coverage is total.
Zero variation: Some kinds of faults may be detected
by observing that there is almost no variation on the
value of a given factor during a long time interval.
Typically, a zero variation fault depicts a constant
value for a large number of successive samples of this
parameter, even if this value can be within the accepted
interval of values. An example of zero variation in
border surveillance can be the missing of variation in
the location of an intruder that started to cross the
border zone.
High noise: A high level of noise mainly affects
transmitted data and may create unexpected variation
of the monitored values. This can be caused by
hardware failure or a low battery level. A problem in a
sensor node due to noise can be detected by controlling
the bit error rate of the transmitted data and the
variation in the reported values. It is worthy to note,
that even in case of high noise that affects data, it may
still be exploited by the analysis process to reveal an
intrusion attempt. In border surveillance, high noise
can be observed when the transmitted data gets
unreadable.
Missing data: A missing data requested by the network
control center may reveal defaults in several BSNs
located in a specific region. In addition, missing data
reports for a relatively long period of time may indicate
that a given sensor is faulty. Another problem, is that,
in some cases, data missing is not due to faults in
sensor nodes that generate the data, but it is caused by
faults in intermediate neighbor nodes that are
responsible of relaying it.
3.2. Fault detection and prediction

We describe here the fault detection techniques
proposed for the border surveillance WSN. These
techniques are based on a set of hypotheses regarding
the wireless sensor network regular operation and the
information gathered from the sensors to detect faults.
In particular, they assume that all data is forwarded to
the control center (or sink node), the communication is
not corrupted by any transmission error, and faults are
not caused by security attacks targeting data flow or
any one of the network elements that participate in

generating or relaying information.
In addition, we suppose that any event detected by
a BSN will be also detected by its neighbors or it will
be reported by the same node in a very short time. In
the latter case, the format of the reported data should
be different, by including a sequence number, for
example. Furthermore, when reporting an event, the
BSN should be clearly identified and localized with a
bounded error, and corresponding message must be
time stamped. In our case, the location of the sensor is
determined by the deployment pattern. Using aerial
dropping, the position of the sensor node is determined
by the center of the region where it can fall down. The
estimation error of the sensor localization is controlled
by the square of this region.
Two main fault detection approaches can be
distinguished, variance-based and profile-based. The
first one is a technique that monitor resource
consumption and forecast their exhausting time. The
second approach identifies faults by examining the
variance of the fault characteristics an comparing them
to a knowing library of possible faults. The two
approaches are based on the same principles. They first
control the deviation of the current behavior of the
reported data of the sensor node from the normal
behavior and then they give some predictions on the
assumed fault. For the sake of simplicity, we will
describe in this paper, only one fault example for each
fault detection method. They are the energy depletion
and temporal gradient.
Energy depletion fault detection: Our method assumes
having an energy amount at the beginning of its
lifetime, should that a sensor has to send message ,
at any time its energy reaches a level equal to
where is a given number that describes the
granularity of fault detection. In general is equal to 3
or 4. The messages must be time stamped and
encompasses the identity and the location of the sensor
node. When the central station message receives
messages , it identifies the remaining energy
level and computes the expected complete depletion
time. Finally, if the remaining energy is equal to
then the network control station will triggers a request
to replace the node .
Node replacement can be done by different ways.
First, a soft replacement can be operated by simply
reprogramming the scheduling scheme of the
neighbors of the faulty node. Such a replacement
requires that the sensing coverage is redundant (kcoverage, for example). Second, a physical
replacement can be operated by ordering the
- 366 -
ICEIC 2015
quadcopter in charge of the WSN deployment to fly to

the location of the faulty nodes, remove it and replace
it by a new one. This operation assumes that the time
of consumption of the remaining energy, , is
sufficient to allow the removal and replacement
operations.
Temporal gradient detection: with this method, the
network control center is equipped with an observation
window of size a standard deviation , and a
threshold value for every parameter subject to
gradient variation. At the reception of each message
transmitted by a sensor j, the center calculates the
deviation of the reported value with regard to the
samples gathered during the observation window, N . If
it is more than the fixed threshold then the value is
compared to messages reported by neighboring nodes.
If the reported message is not close, in some sense, to
the reported information then the sensor is identified as
faulty.
Many techniques have been developed to provide
an accurate estimation of the different parameters
involved in the detection of faults [7] and reduce
related false positive. Among these techniques are the
time-series analysis-based or learning-based technique,
[8]. We propose here a method that uses heuristics to
detect and identify the fault types which exploits
statistical correlations between sensor measurements to
generate estimates for the sensed phenomenon based
on the measurements of the same phenomenon at other
sensors and reduce false positives. This method is used
to monitor faults detection in border surveillance
application to handle energy depletion fault detection
as follows: If the energy level is lower than a first
threshold (that can be ), then the control
center deduces that the BSN is entering to a faulty

state. On the other hand, if it is less than a second
threshold (that can be ), then the
node will become faulty very soon and its replacement

must be triggered. A similar method to detect temporal
gradient is to notice abnormal variation of the
parameter using two threshold values, The
first threshold allows to consider the sensor as entering
a faulty state.
Other detection methods may be important to
consider. They all use indirect proof of faults. In
particular, they can use large variation in the observed
characteristics by the sensor nodes about the crossing
targets. Indeed, knowing the limited speed of the
detected intruder and that the location of sensor nodes
are predefined with an acceptable accuracy, then
important variations in the positions of the detected
object can depict a fault in the localization function of

a given BSN.
4. Fault repairing and tolerance

In this section, we present the fault repairing and
tolerance techniques proposed for a border surveillance
application based on wireless sensor network.
Repairing in general consists in planning a replacement
of the faulty sensors. Faults tolerance, on the other
hand, are techniques that keep the wireless sensor
network in an operation state even in the case where a
given number of sensors are malfunctioning or faulty.
4.1. Fault repairing

Our fault repairing is based on a proactive detection
of faulty sensors or those that will become faulty in a
given period of time. This is achieved in three steps. In
the first step, the faulty sensor nodes must be identified
and located by analyzing the quality of the data they
transmit. This can be performed through a library of
rules describing the ways of how a sensor goes to fault,
based on the variation of selected parameters. These
rules may take into consideration the models reflecting
the evolution of some characteristics related to the
border monitoring activity.
In the second step, the network control center
diagnoses the type of fault and predicts fault
occurrence based on the collection of received
messages that can help analyzing the propagation of
faults in time and the theoretical model governing the
variation of the related parameters. The analysis is also
based on a library of ad hoc rules. The final step is the
remote programming of the faulty node (or some of its
neighbors) through the closer DRN. In the case where
soft reparation cannot be performed on the faulty node,
a special kill program is remotely executed. In
addition, an air dropping of new sensors can be issued
after determining the dropping positions/zones.
The rules involved in the aforementioned libraries
aim at automating the analysis of the occurring faults
and the repairing process. Examples of rules include
the following set of rules related to indirect faults:
Target speed rule:
If sensor reports several times that the speed of a
target is higher than a maximum speed known for the
type of target, then the sensor is faulty.
Target speed deviation rule:
If sensor and report two values of the speed of a
given target measured at the same time that are distant
from each other, then one of sensors is faulty.
- 367 -
ICEIC 2015
Target false position rule:

If sensor and report two positions of the same
target measured at the same time completely different
then one of sensors is faulty.
The proactive physical replacement technique
assumes that we can predict the instant when a sensor
failure occurs sufficiently in advance, so that, a
replacement of the sensor that will become faulty can
be achieved before fault happening. Nevertheless, the
proactive replacement scheme can be complex when a
large number of replacements is required per unit of
time and that the area covered by the WSN. Therefore,
the time needed to replace failure nodes can affect the
whole network lifetime.
4.2. Fault tolerance

Two main definitions of the WSN lifetime can be
distinguished [9]. The first, takes into consideration the
time when the first node in the network becomes
faulty, while the second definition of the network
lifetime considers the time when a specific portion of
the sensor nodes in the network fail affecting the
quality of the service delivered by the network. It is
clear that the second definition fits better with the
situation of wireless sensor networks serving border
surveillance. In particular, if the purpose of border
surveillance is to only detect the crossing target, one
can be convinced that sensors can fail without
reducing the detection quality. Here, we denoted by

and the floor function, the width of border
strip to monitor and sensing range of the sensors,
respectively.
To increase the lifetime of the network a fault
tolerance procedure must be implemented while
triggering faulty nodes replacement activity. The fault
tolerance is generally achieved by maintaining sensing
coverage. This can be performed either by triggering
sensor replacement procedure sufficiently in advance
to fault occurrence or by temporarily increasing the
sensing ranges of the sensor nodes in the vicinity of the
sensor moving towards failure.
In our WSN architecture, fault tolerance can also be
achieved by reprogramming a new line of surveillance
in the controlled area. It can be achieved by redefining
the neighboring order of the DRN forming the line of
surveillance. Indeed, a DRN can connect to a nonconsecutive node on the line, if it detects that one of its
neighbors is becoming faulty. This is done by a
temporary increasing in the communication radius of
the DRN.
The increase in the communication/sensing range is

performed in two phases. During the first phase, the
coverage is analyzed in the vicinity of the fault node by
recalculating the probability of coverage according to
the real deployment of the operational BSNs. If this
quality is acceptable then nothing is done; but, if it is
degraded (e.g., the probability is less than a given
threshold), then the second phase takes place. The
latter consists in identifying the sensor nodes that are
close to the faulty node and command them to
temporarily increase their coverage range by an
amount that fixes the coverage holes created by the
faulty node (or makes the coverage probability higher
than the predefined threshold).
One can notice that the proposed fault tolerance
scheme adds some complexity to the coverage control,
since it introduces some irregularities to the sensing
model and, therefore, may the falsify mathematical
expressions controlling the deployment, if any. In
addition, it can shorten the lifetime of the border
surveillance wireless sensor network. Indeed, the
unfair distribution of ranges often causes the problem
of energy hole, which may induce energy depletion of
the BSNs that are situated in the uncovered holes faster
than the nodes in other regions [10, 11]. This can be
resolved by balancing the replacement strategy and the
tolerance strategy.
5. Performance evaluation
In this section, we assess the performances of the
proposed nodes replacement strategy in terms of
network lifetime and the number of replaced sensors.
We suppose that the border surveillance area of the
wireless sensor network is a thick strip incorporating
two lines of BSNs deployed along the border length.
We assume that the border line length is about 3km
and that 30 BSNs are randomly dropped in the two
regions limited by the two lines according to a uniform
distribution pattern. In this case, every second square
of BSNs is assumed to contain in its center a DRN to
which the BSNs report the gathered data. Thus, one
can see that the points of the two lines are fully
covered by these sensors.
In addition, to assess the network lifetime we
adopted another definition that is appropriate for
border surveillance applications, where the main target
of surveillance is not only to locate intruders
attempting to cross the borderline, but also to track
them. Consequently, the network life time will be
defined as the time of failure of the first set of sensors
allowing the crossing of an intruder without being
detected. This is reflected in our simulation model by
- 368 -
ICEIC 2015
the time where the first pair of sensors situated on

different lines and facing each other run out of energy.
The impact of the replacement strategy on sensors
lifetime is simulated by considering that when the
battery of the sensor node is fully charged, it can send
a maximum of 1000 packets to report detected events
and the transmission rate cannot exceed one packet per
unit of time. Furthermore, we suppose that a sensor
node executes normal functions that consumes few
amount of energy when it is not transmitting a packet
to the DRN. The order of magnitude between the two
energy consumptions is fixed as equal to 1/100.
During simulations, two parameters have been
varied to assess the impact of the proposed
replacement strategy. The first is the replacement time
referred to the time needed to deploy new sensors in
order to replace those that are becoming out of energy.
We varied this parameter between 150 s and 500 s. We
also assumed that 100 s corresponds to the horizon of
energy shortage. Consequently, when the remaining
energy of a sensor reaches 1/10 of its initial value, a
request is sent to replace the sensor. The second
parameter that is varied in our simulation work is the
number of targets crossing the monitored area. Three
rates of border crossing attempts are considered. They
are set to 2, 4, and 6 attempts per 10 time units.
In each simulation we measure the network lifetime
and the number of replaced sensors to evaluate the
effect of replacement strategy. The results of the
conducted simulations are shown by the Figure 2.
It can be firstly notified that when the time needed
to replace a sensor is less than the time of shortage
prediction, the sensors can be replaced all time. For
this reason, the results depicted by the plotted curves
start from a replacement duration more than 100 s. By
examining the simulation results, we can formulate
three main observations.
Figure2 :Impact of the replacement strategy on the

network lifetime.
The first one is that when the replacement time
increases from 150 s to 500 s, the network lifetime
decreases and the number of replaced sensors becomes
smaller. Particularly, we can notice that the number of
replaced sensors reaches 40% in the case when one
attempt is performed every 10 time slots and the time
to replace is 150 s. This can be explained by the fact
that, when the replacing time increases, the probability
that the sensor needing replacement fails before it can
be replaced, increases also.
The second observation is that, for a given
replacement time, increasing the number of crossing
attempts per unit of time, significantly shortens the
network lifetime. This is predictable because when a
high number of intrusion attempts are detected by
BSNs, this will generate more messages transmissions
to DRNs and consequently more requests for
replacement will be sent and the probability that a
request is not answered will increase.
Finally, we can notice that increasing the number of
sensing lines in the monitored area can considerably
enhance the network lifetime. This is due to the
increasing number of sensors that will be faulty due to
energy shortage before that an undetected intrusion
attempt can occur.
- 369 -
ICEIC 2015
6. Conclusion
This paper proposed a fault tolerance framework
for border surveillance WSN that encompasses the
development of faults detection, prediction techniques,
and replacement strategies to reduce the impact of
failures. Simulation results show the effectiveness of
the proposed schemes in improving the network
lifetime and the detection efficiency.
network deployment strategies, IEEE Transactions on

Mobile Computing, vol. 7, no. 4, pp. 484497, 2008.
[10 ] C. Song, M. Liu, J. Cao, Y. Zheng, H. Gong, and G.
Chen, Maximizing network lifetime based on
transmission range adjustment in wireless sensor
networks, Computer Communications, vol. 32, no. 11,
pp. 13161325, 2009.
[11 ] Y. Yu, C. Song, M. Liu, and H. Gong, Energy-efficient
algorithm for sensor networks with non-uniform
maximum transmission range, Sensors, vol. 11, no. 6,
pp. 62036213, 2011.
A future work will address the definition of

efficient schemes to provide fault tolerance for border
surveillance systems allowing target tracking in large
strips along the country frontier and enhancing the
border surveillance system lifetime.
References
[1 ] R. Bellazreg, N. Boudriga, and S. An, Border
Surveillance using sensor based thick-lines, in
Proceedings of the International Conference on
Information Networking (ICOIN 13), Bangkok,
Thailand, 2013.
[2 ] S. Berrahal, S. Rekhis, and N. Boudriga, "Unmanned
Aircraft Vehicle Assisted Border surveillance," in the
20th Asia-Pacific Conference on Communications
(APCC2014), Oct.. 1-3, 2014, Pattaya Thailand.
[3 ] R. Bellazreg, N. Boudriga, K. Trimeche, Sunshin An,
"Border surveillance: A dynamic deployment scheme
for WSN-based solutions," in proceedings of Wireless
and Mobile Networking Conference (WMNC), 2013 6th
Joint IFIP, pp.1,8, 23-25 April 2013
[4 ] K. Ni, N. Ramanathan, M.N.H. Chehade et al., Sensor
network data fault types, ACM Transactions on Sensor
Networks, vol. 5,no. 3, pp. 129, 2009.
[5 ] A. B. Sharma, L. Golubchik, and R. Govindan, Sensor
faults: detection methods and prevalence in real-world
datasets, ACM Transactions on Sensor Networks, vol.
6, no. 3, 2010.
[6 ] V. Baljak, K. Tei, and S. Honiden, Classification of
Faultsin Sensor Readings with Statistical Pattern
Recognition, in Proceedings of the 6th International
conference on Sensor Technologies and Applications
(SENSORCOMM 12), pp. 270276,Rome, Italy,
August 2012.
[7 ] A. Sharma, L. Golubchik, and R. Govindan, On the
prevalence of sensor faults in real-world deployments,
in Proceedings of the 4th Annual IEEE Communications
Society Conference on Sensor, Mesh and Ad Hoc
Communications and Networks (SECON 07),pp. 213
222, San Diego, Calif, USA, June 2007.
[8 ] D. Tulone and S. Andmadden, PAQ: time series
forecasting for approximate query answering, in
Proceedings of the European Conference on Wireless
Sensor Networks (EWSN 06), pp. 2137, Zurich,
Switzerland, February 2006.
[9 ] Z. Cheng, M. Perillo, and W. B. Heinzelman, General
network lifetime and cost models for evaluating sensor
- 370 -
FO-3-4-5
)DVWHU6SHFWUXP6HQVLQJLQ&RJQLWLYH5DGLRXVLQJ+DGRRS<$51
6ULNDQWK0XQMXOXUL*DULPHOOD5DPD0XUWK\
63&5&,QWHUQDWLRQDO,QVWLWXWHRI,QIRUPDWLRQ7HFKQRORJ\+\GHUDEDG
6ULNDQWKPXQMXOXUL#UHVHDUFKLLLWDFLQUDPPXUWK\#LLLWDFLQ
$EVWUDFW
5HVHDUFK LQ &RJQLWLYH 5DGLR WHFKQRORJ\ KDV EHHQ
YHU\ DFWLYH VLQFH IHZ \HDUV DV LW DWWHPSWV WR VROYH WKH
IUHTXHQF\ FULVLV SUREOHP LQ ZLUHOHVV FRPPXQLFDWLRQV
6SHFWUXP 6HQVLQJ LV WKH PRVW FUXFLDO SKDVH RI
&RJQLWLYH 5DGLR ZKLFK GHWHUPLQHV WKH VXFFHVV RI WKH
WHFKQRORJ\7RPDNHVSHFWUXPVHQVLQJPRUHDFFXUDWH
UHVHDUFKHUV FDPH XS ZLWK PDQ\ QHZ WHFKQLTXHV E\
LQFRUSRUDWLQJ RSWLPL]DWLRQ WKHRU\ DQG PDFKLQH
OHDUQLQJ WHFKQLTXHV LQWR FRUH FRPPXQLFDWLRQ
DOJRULWKPV +RZHYHU WKLV OHG WR WKH LQFUHDVH LQ WKH
RYHUDOOV\VWHPODWHQF\
7KLV SDSHU LV DQ DWWHPSW WR UHGXFH WKH V\VWHP
ODWHQF\ RI D &RJQLWLYH 5DGLR (QJLQH E\ HPSOR\LQJ
+DGRRS <$51 LQ WKH V\VWHP 7KLV GDWD DQDO\WLF WRROV
KHOSLQSDFLQJXSWKHWLPHWDNHQ IRUVSHFWUXPVHQVLQJ
DOJRULWKP E\ SDUDOOHO LPSOHPHQWDWLRQ RI PDQ\ VXE
WDVNVIROORZLQJ0DS5HGXFHIUDPHZRUN
ZKLFK ZH SURSRVHG WKH QH[W JHQHUDWLRQ ZLUHOHVV

DUFKLWHFWXUH SURWRW\SH EDVHG RQ FORXG FRPSXWLQJ DQG
GLVFXVVHG YDULRXV FKDOOHQJHV WR LPSOHPHQW WKH VDPH
7KH PDLQ PRWLYDWLRQ EHKLQG RXU ZRUN LV LPSURYH WKH
ZLUHOHVV DUFKLWHFWXUH EXLOW IRU RXU UHVHDUFK LQ >@ DQG
>@
&DVHIRU+DGRRSLQ6SHFWUXP6HQVLQJ
6SHFWUXPVHQVLQJ66LVWKHPRVWLPSRUWDQWVWHSRI
&5 7KH DLP RI WKH 66 LV WR DFFXUDWHO\ GHWHUPLQH WKH
XQXVHGVSHFWUXPLHWRGHWHUPLQHVSHFWUXPKROHV$Q
HIILFLHQW66DOJRULWKPIXUWKHUFRQVLVWVRIIROORZLQJWKH
IROORZLQJVWHSV
.H\ZRUGV%LJ'DWD$QDO\WLFV&RJQLWLYH5DGLR
6SHFWUXP6HQVLQJ+DGRRS<$511H[WJHQHUDWLRQ
:LUHOHVV&RPPXQLFDWLRQV
,QWURGXFWLRQ
)UHTXHQF\ VSHFWUXP RQFH DQ XQOLPLWHG QDWXUDO
UHVRXUFHLVWHQGLQJWREHFRPHDYHU\VFDUFHUHVRXUFHLQ
ZLUHOHVV FRPPXQLFDWLRQV 7KH WHUP 6SHFWUXP
'URXJKW FRLQHG E\ )HGHUDO &RPPXQLFDWLRQV
&RPPLVVLRQ )&& H[SODLQV WKH VLWXDWLRQ RI
DYDLODELOLW\ RI IUHTXHQF\ VSHFWUXP +RZHYHU
WHFKQRORJ\ DGYDQFHPHQWV PDGH LW SRVVLEOH WR FRPEDW
WKLV FKDOOHQJH LQ WKH IRUP RI 6RIWZDUH 'HILQHG 5DGLR
6'5 DQG &RJQLWLYH 5DGLR &5 5HVHDUFKHUV FDPH
XS ZLWK DQ LGHD RI &5 WR VROYH WKH VSHFWUXP VFDUFLW\
SUREOHP7KHIXQGDPHQWDOLGHDRI&5LVWRVFDQHQWLUH
VSHFWUXP DQG HVWLPDWH WKH XQXVHG VSHFWUXP DQG WKHQ
LQWHOOLJHQWO\ WUDQVPLW DQG UHFHLYH RQ WKRVH XQXVHG
EDQGV7KLVSURFHVVLVWHUPHGDV6SHFWUXP6HQVLQJ
,QWKLVSDSHUZHIRFXVRQWKHUROHRI%LJ'DWDWRROV
VXFK DV +DGRRS LQ WKH GHVLJQ RI ZLUHOHVV QHWZRUNV
7KLV ZRUN LV DQ H[WHQVLRQ RXU SUHYLRXV ZRUN>@ LQ
- 371 -
&KRRVLQJ WKH ULJKW PHWKRG GHSHQGLQJ XSRQ

WKH UDGLR HQYLURQPHQW 7KHUH DUH PDQ\
PHWKRGV IRU VSHFWUXP VHQVLQJ VXFK DV HQHUJ\
GHWHFWLRQ F\FORVWDWLRQDU\ PHWKRG ZDYHOHW
EDVHGDSSURDFKHWF
(PSOR\LQJ VXLWDEOH SUHGLFWLRQ DOJRULWKPV

%HIRUH DSSO\LQJ ULJKW DOJRULWKP D VXLWDEOH
SUHGLFWLRQ DOJRULWKP KDV WR EH DSSOLHG WR
LQFUHDVHWKHHIILFLHQF\RIWKH66GHVLJQ
7KH ILJ SUHVHQWV WKH &RJQLWLYH 5DGLR OLIH F\FOH

ZKLFK LQWHQGV WR DERYH GLVFXVVHG LPSOHPHQW WKH
VSHFWUXPVHQVLQJZLWKPDFKLQHOHDUQLQJWHFKQLTXHV
XVLQJ UHSODFHPHQW PHWKRG >@ +HUH WKH DERYH
PHQWLRQHG KHIW\ WDVNV DUH FDUULHG RXW LQ UDGLR
VHQVLQJGHYLFHV
7KHRYHUDOOHIILFLHQF\RIWKHV\VWHPGHSHQGVXSRQ
WKH KDQGVKDNLQJ SURWRFRO DQG LWV ODWHQF\ EHWZHHQ
UDGLRVHQVLQJDQGFRJQLWLYHUDGLRDVJLYHQLQILJ
+RZHYHU WKH KDQGVKDNLQJ ODWHQF\ GHSHQGV
XSRQ WKH WLPH WDNHQ E\ UDGLR VHQVLQJ GHYLFH WR
FRPSOHWH WKH SURFHVVHV RI PDFKLQH OHDUQLQJ
WHFKQLTXH IROORZHG E\ VXLWDEOH VSHFWUXP VHQVLQJ
PHWKRG 7KHUH DUH PDQ\ SDUDOOHOL]DEOH
DOJRULWKPVLQ66,QWKLVSDSHU+DGRRSLVXVHGWR
UHGXFH WKH 66 ODWHQF\ E\ SDUDOOHO LPSOHPHQWDWLRQ
RI ))7 DOJRULWKP XVLQJ 0DS5HGXFH PRGHO >@
6LQFH 0DS DQG 5HGXFH SKDVHV DUH GLVFXVVHG LQ
GHWDLOLQ>@ZHGLUHFWO\LPSOHPHQWWKHDOJRULWKP
ICEIC 2015
FORXG FRPSXWLQJ SDUDGLJPV VXFK DV 6'1

YLUWXDOL]DWLRQZLOOKDYHWKHLUUROHWRSOD\LQWKHGHVLJQ
RIZLUHOHVVQHWZRUNV

[
$GDSWLYH))7DSSURDFK
)L[HG))7DSSURDFK
ZLWKKDGRRS
1XPEHURI))7RSHUDWLRQVRQHDFKQRGH

)LJ&RJQLWLYH5DGLR/LIH&\FOH
7KH RYHUDOO HIILFLHQF\ RI WKH V\VWHP GHSHQGV XSRQ

WKHKDQGVKDNLQJSURWRFRODQGLWVODWHQF\EHWZHHQUDGLR
VHQVLQJDQGFRJQLWLYHUDGLRDVJLYHQLQILJ

+RZHYHUWKHKDQGVKDNLQJODWHQF\GHSHQGVXSRQWKH
WLPH WDNHQ E\ UDGLR VHQVLQJ GHYLFH WR FRPSOHWH WKH
SURFHVVHV RI PDFKLQH OHDUQLQJ WHFKQLTXH IROORZHG E\
VXLWDEOH VSHFWUXP VHQVLQJ PHWKRG 7KHUH DUH PDQ\
SDUDOOHOL]DEOH DOJRULWKPV LQ 66 ,Q WKLV SDSHU
+DGRRS LV XVHG WR UHGXFH WKH 66 ODWHQF\ E\ SDUDOOHO
LPSOHPHQWDWLRQ RI ))7 DOJRULWKP XVLQJ 0DS5HGXFH
PRGHO>@

3HUFHQWDJHYDULDWLRQVLQWKHVSHFWUDORFFXSDQF\SUREDELOLWLHV

)LJ))7RSHUDWLRQVYVVSHFWUDORFFXSDQF\SUREDELOLWLHV

1XPEHURI&RPSOH[))7RSHUDWLRQV

6LPXODWLRQ5HVXOWV

7KH ILJ GHSLFWV D SORW EHWZHHQ ))7 RSHUDWLRQV

YHUVXV VSHFWUDO RFFXSDQF\ SUREDELOLWLHV DV SHU WKH
DOJRULWKPGLVFXVVHGLQ>@7KHSDSHU>@LVRQHRIRXU
DWWHPSWVWRUHGXFHWKHV\VWHPODWHQF\E\XVLQJDPXOWL
UHVROXWLRQ))7DSSURDFK:KDWZHWULHGWRSURYHKHUH
LV WKDW E\ GHSOR\LQJ +DGRRS LUUHVSHFWLYH RI WKH
VSHFWUDO RFFXSDQF\ SUREDELOLW\ WKH QXPEHU RI ))7
RSHUDWLRQV UHPDLQV VDPH ZKLFK LQ WXUQ UHGXFHV WKH
ODWHQF\
7KHILJVXJJHVWVWKDWWKHQXPEHURIFRPSOH[))7
RSHUDWLRQV GHFUHDVH ZLWK LQFUHDVH QXPEHU RI PDSSHUV
JLYHQ WKH QDWXUH RI WZLGGOH IDFWRUV LQYROYHG LQ ))7
7KLVZRXOGDJDLQUHGXFH WKH ODWHQF\ RI WKH RYHUDOO 66
RSHUDWLRQ
&RQFOXVLRQ
:LUHOHVV DSSOLFDWLRQV SURGXFH WRQV RI GDWD HYHU\
VHFRQG ,Q DGGLWLRQ EDFNKDXO QHWZRUNV KDYH YHU\ OHVV
WLPH WR SURFHVV DQG UHVSRQG WR WKH GDWD +HQFH WKH
FRQIOXHQFH RI ZLUHOHVV QHWZRUNV ZLWK FORXG
WHFKQRORJLHV LV LQHYLWDEOH 7KLV SDSHU VXFFHVVIXOO\
GHPRQVWUDWHV WKDW WKH IXWXUH ZLUHOHVV DUFKLWHFWXUHV
ZRXOG FRPH SDFNHG DORQJ ZLWK %LJ 'DWD WRROV 2WKHU

1XPEHURIPDSSHUV
)LJ1XPEHU&RPSOH[))7RSHUDWLRQVYV0DSSHUV
5HIHUHQFHV
>@ 6ULNDQWK 0 DQG 5DPD 0XUWK\ * $ &RPSUHKHQVLYH
1H[W*HQHUDWLRQ :LUHOHVV $UFKLWHFWXUH 3URWRW\SH EDVHG RQ
WKH :LUHOHVV 5HVLOLHQW &ORXG &KDOOHQJHV ;5&,2SHQ
%DQJDORUH,QGLD
>@+DUDGD+0XUDNDPL+,VKL]X.)LOLQ66DLWR<
7UDQ + 1 .DWR 6 $ VRIWZDUH GHILQHG FRJQLWLYH UDGLR
V\VWHP FRJQLWLYH ZLUHOHVV FORXG */2%(&20

,(((1HZ<RUN86$
>@ 6ULNDQWK 0 5DPD 0XUWK\ * 7RZDUGV IDVWHU VSHFWUXP
VHQVLQJ WHFKQLTXHV LQ FRJQLWLYH UDGLR DUFKLWHFWXUHV ,&,&7
.HUDOD,QGLD
>@KWWSDU[LYRUJSGISGI
>@ 6XPLW . 5DPD 0XUWK\ * (IILFLHQW 6SHFWUXP
6HQVLQJ0RQLWRULQJ 0HWKRGV DQG 7HVWEHG 'HYHORSPHQW IRU
FRJQLWLYHUDGLREDVHG:616'5:QQ&RPP,OOLQRLV86$
- 372 -
ICEIC 2015

Oral Session
FO-3-5
and Device III
FO-3-5-1
Design of Electrically Injected Photonic Crystal Laser with Oxide Current

Guiding Layers
Seonghyun Paik1, Seongjae Cho2, Byung-Gook Park3, and James S. Harris, Jr.1
Department of Electrical Engineering, Stanford University, Stanford, CA 94305, USA
2
Department of Electronic Engineering, Gachon University, Gyeonggi-do 461-701, Republic of
Korea
3
Department of Electrical and Computer Engineering and Inter-university Semiconductor
Research Center (ISRC), Seoul National University, Seoul 151-742, Republic of Korea
E-mail address: bgpark@snu.ac.kr
1
Abstract
We present a design for electrically injected photonic
crystal laser with oxide current guiding layers. Selective
lateral oxidation of AlGa(In)As layers forms current block
layers and prevents leakage current in undesired region.
Effective electrical injection with high Q factor photonic
crystal laser can be achieved without high temperature
annealing and active region regrowth.
smaller thermal budget than annealing processing for

dopant activation. Design of the photonic crystal laser with
oxide layers, however, is challenging due to refractive
index change of oxidized layers. With a proper design of
epitaxial structure and cavity, it becomes possible to obtain
a cavity structure with high Q factor.
2. Laser design and parameters
Keywords: photonic crystal laser, oxide current

confinement
1. Introduction
With recent developments in photonic crystals and
greatly enhanced solid-light interactions, photonics is
rapidly expanding into many new applications. Recently,
photonic crystal lasers have shown great improvement in
performance, but they need high temperature (> 650 C)
annealing to diffuse the ion-implanted dopants that form
lateral pn junctions for current injection [12]. In addition,
it is not possible to avoid active region regrowth due to
current leakage. Alternatively, photonic crystal lasers with
vertical current injection have been investigated [3].
However, the laser efficiency is limited because an
additional post structure degrades Q factor of the cavity.
Lateral oxidation of high Al composition layer is one
of the popular methods for current confinement of
VCSELs. High Al (> 90%) composition AlGaAs can be
oxidized at about 400 C and this oxidized layer can
function as a current blocking layer [4]. Even a low Al
composition material In0.52Al0.48As, lattice matched to InP,
has been reported to be available for lateral oxidation at up
to several microns at 500 C [5], which provides an
enough depth for photonic crystal cavities and much
Fig. 1 Schematic of the designed laser structure

In this design, we utilized a nanobeam photonic crystal
cavity from an epitaxially grown structure including 2
layers for oxidation. Oxidation layer can be chosen to be
lattice matched to substrate (AlGaAs for GaAs substrate,
InAlAs for InP substrate). The radii of air holes are 0.3a,
where a is the lattice constant of the nanobeam. The
distance between holes and radii at center and next nearest
holes are tapered. The width and thickness of the
nanobeam are 1.3a and 1.0a, respectively. Finally, the
width of unoxidized region is 4.0a. Photonic crystal is
further optimally designed to maximize the cavity Q factor.
Oxidized layer has much lower refractive index
compared to unoxidized region so that we can expect thick
- 374 -
ICEIC 2015
oxide layers will generate greater perturbation in refractive
index and decrease cavity Q factor as a result. On the other
hand, oxidation rate of the layer is highly dependent on
thickness of the layer, and thin layer is more difficult to
achieve deep lateral oxidation [4]. As a result, thickness of
the layer should be compromised for high Q factor and
process feasibility.
Q factor
10
10
10
0.05
0.1
0.15
Thickness of each oxide layer(a)
Fig. 2 Q factors of cavity structure as a function of

thickness of each layer for oxidation
[1] B. Ellis, M. A. Mayer, G. Shambat, T. Sarmiento, J.

Harris, E. E. Haller, and J. Vukovi, Ultra low-threshold
electrically pumped
quantum-dot
photonic-crystal
nanocavity laser, Nature Photon. 5, 297-300 (2011)
[2] S. Matsuo, K. Takeda, T. Sato, M. Notomi, A. Shinya,
K. Nozaki, H. Taniyama, K. Hasebe, and T. Kakitsuka,
Room-temperature continuous-wave operation of lateral
current injection wavelength-scale embedded active-region
photonic-crystal laser, Opt. Express 20(4), 3773-3780
(2012)
[3] H.-G. Park, S.-H. Kim, S.-H. Kwon, Y.-G. Ju, J.-K.
Yang, J.-H. Baek, S.-B. Kim, and Y.-H. Lee, Electrically
driven single-cell photonic crystal laser, Science
305(5689), 1444-1447 (2005)
[4] K. D. Choquette, K. M. Geib, C. I. H. Ashby, R. D.
Twesten, O. Blum, H. Q. Hou, D. M. Follstaedt, B. E.
Hammons, D. Mathes, and R. Hull, Advances in Selective
Wet Oxidation of AlGaAs Alloys, IEEE J. Sel. Top.
Quantum Electron. 3(3) 916-926 (1997)
[5] N. Iwai, T. Mukaihara, M. Itoh, N. Yamanaka, S.
Arakawa, H. Shimizu and A. Kasukawa, 1.3 m GaInAsP
SL-QW Al-oxide confined inner stripe lasers on p-lnP
substrate with AlInAs-oxide confinement layer, Electron.
Lett. ,34(14) 1427-1428 (1998)
Figure 2 shows that simulated Q factor indeed

decreases as oxidation layer thickness increases. Q factor
remains high at small perturbation, but decreases sharply
as the thickness increases. However, the Q factor is still
high enough at layer thickness of 0.12a, which corresponds
to about 50 nm at 1550-nm InP-based laser and 30 nm at
980-nm GaAs-based one, and is thick enough to achieve an
effective oxidation [45].
4. Conclusion
We presented an optimized design for electrically
injected photonic crystal laser with oxidized current
guiding layers. By implementing epitaxial layers to be
oxidized, we could obtain effective current confinement
inside the laser cavity without high temperature doping
activation or active region regrowth. Simulated Q factor >
30,000 is achieved with thick oxidation layers for deep
lateral oxidation.
Acknowledgements
This work was supported by the Center for Integrated
Smart Sensors funded by the Korean Ministry of Education,
Science and Technology as Global Frontier Project (CISS2012M3A6A6054186).
References
- 375 -
FO-3-5-2
Improvement of On-Off Current Ratio in Vertical Electron-Hole Bilayer

Tunnel Field-Effect Transistors (V-EHBTFETs)
1
Sang Wan Kim1, Seongjae Cho2, Jang Hyun Kim3, Byung-Gook Park3, Woo Young Choi4
Dept. of Electrical Eng. and Computer Sci., University of California, Berkeley, CA 94720, USA
2
Dept. of Electronic Eng., Gachon University, Seongnam-si, Gyeonggi-do 461-701, Korea
3
Dept. of Electrical and Computer Eng. and Inter-university Semiconductor Research Center
(ISRC), Seoul National University, Seoul 151-742, Korea
4
Dept. of Electronic Eng., Sogang University, Seoul 121-742, Korea
E-mail: wchoi@sogang.ac.kr
Abstract
A study on the vertical electron-hole bilayer tunnel

field-effect transistor (V-EHBTFET) is presented. For
an optimum device design, performances of VEHBTFETs with different locations of SiGe channels
are compared: all-Si, all-Si0.7Ge0.3, and Si0.7Ge0.3
locally introduced in the fin channel. As a result, the
last one shows the best performance compared with
the others in terms of subthreshold swing, on-off
current ratio, and turn-on voltage.
Keywords: Tunnel field-effect transistor (TFET),
subthreshold swing (S), steep subthreshold slope, lowpower operation
representatives in the former approach [3]. Since the

TFET is operated by band-to-band tunneling (BTBT)
for carrier injection, it can achieve smaller S and more
effectively suppressed Ioff maintaining high on-state
current (Ion) at a lower VDD.
However, experimental results from previous
literatures show that there still remain several issues
such as poor Ion, larger S not easily reduced, and highlevel Ioff due to ambipolar behaviors [3], [6]. In order
to overcome the weaknesses, a vertical electron-hole
bilayer TFET (V-EHBTFET) was proposed [6]. In this
work, the device is further optimized for higher Ion/Ioff
ratio and scaling of turn-on voltage (Vturn-on).
Sub-gate
During the last decade, as the integration density of

metal-oxide-semiconductor field-effect transistors
(MOSFET) has been rapidly increased, the reduction
of power density has become one of the most
important issues in future complementary MOS
(CMOS) integrated circuit (IC) designs. For low power
consumption, scaling of supply voltage (VDD) and
suppression of off-state leakage current (Ioff) should be
achieved. However, in case of MOSFETs, both criteria
are in the trade-off relation due to the fundamental
limit of 60-mV/dec-subthreshold swing (S) at room
temperature [1].
In order to solve the problem, several strategies
have been studied. They can be categorized into two
groups according to the approach methods. One of
them is to change the carrier injection mechanism from
thermionic emission [2, 3] and the other is to increase
the gate-channel coupling with a novel gate stack [4, 5].
Tunnel field-effect transistor (TFET) is one of the
Main-gate
1. Introduction
Si or SiGe
BOX
H
D
TSOI
Fig. 1. Schematic of the V-EHBTFET [6].

Fig. 1 shows the schematic of V-EHBTFET. It is
differentiated from existing TFETs by more effective
control over the region where the BTBT takes place.
The sub and main gates on both sidewalls of the
vertical fin lead to hole accumulation and electron
inversion, respectively, at the same time, which
enables ultra-steep switching characteristics with the
help of extremely narrow tunneling barrier width (Wt)
- 376 -
ICEIC 2015
that is mainly determined by the fin thickness (T).

However, its rather low Ion and high Vturn-on still have
room to make improvements. Since the BTBT
probability is expressed as a hyper-exponential
function of energy bandgap (Eg), a use of small-Eg
material enhances Ion [7]. Fig. 2 shows the transfer
characteristics of V-EHBTFET devices with Si (black)
and Si0.7Ge0.3 (white) channels, respectively. The latter
device demonstrates better performances in terms of Ion
103 times higher than that of all-Si device and Vturn-on
with a reduction from 0.3 to 0.22 V.
Drain Current [A/m]
-3
Drain Current [A/m]
-3
10
Vg-sub = -0.4 V
-6
Vd = 0.5 V
10
Wfn-sub = 5.17 eV
-9
-12
All Si
All Si0.7Ge0.3
Savg = 4 mV/dec
-15
10
0.0
0.2
0.4
0.6
Vd = 0.5 V
Ion boosting
10
Wfn-sub = 5.17 eV
-9
10
Wfn-main = 4.05 eV
-12 moderated Ioff
Vturn-on scaling
10
All Si
All Si0.7Ge0.3
Si0.7Ge0.3 at Fin
-15
10
0.0
0.2
0.4
0.6
0.8
1.0
Gate Voltage [V]
3. Conclusion
Wfn-main = 4.05 eV
10
-6
Vg-sub = -0.4 V
Fig. 4. Comparison between transfer characteristics of

devices with different SiGe channel locations.
Savg = 20 mV/dec
10
10
0.8
1.0
Gate Voltage [V]
Fig. 2. Transfer curves of V-EHBTFETs with Si and

Si0.7Ge0.3 channels.
In previous TFET devices, Ion/Ioff ratio does not
show a drastic enhancement due to the drastic increase
in Ioff coming from thermally-generated minority
carriers. In case of V-EHBTFET by our design, the
BTBT occurs with a high localization in the vertical fin.
We examined the electrical performances of the device
with Si0.7Ge0.3 channel confined in the fin region as
shown in Fig. 3. As the result, 103 times lower Ioff was
obtained maintaining the Ion and a reduced Vturn-on as
shown in Fig. 4.
In this work, electrical characteristics of VEHBTFET have been investigated and optimized with
design variables of channel materials and their
locations. The simulation results revealed that
introduction of a smaller-Eg channel material
(Si0.7Ge0.3) locally formed in the vertical fin was
substantially effective in obtaining smaller S, higher
Ion/Ioff, and lower Vturn-on.
Acknowledgments
This work was supported in part by NRF funded by
MISP under Grant NRF-2012R1A2A2A01006159
(Mid-Career Research Program), in part by the KEIT
funded by the MOTIE under Grant 10039174 (IT
R&D Program), and in part by the MOTIE/KSRC
under Grant 10044842 (Future Semiconductor Device
Technology Development Program).
SiGe
Si
Main-gate
Sub-gate
References
Hoff-set
D
Fig. 3. Schematic of V-EHBTFET with SiGe channel

locally formed only in the fin region.
[1] P.-F. Wang, et al., Solid-State Electron., vol. 48, no.

12, pp. 21812186, Dec. 2004.
[2] K. Gopalakrishnan, et al., IEDM Tech. Dig., pp.
289292, Dec. 2002,
[3] W. Y. Choi, et al., vol. 28, no. 8, IEEE Electron
Device Lett., pp. 743-745, Aug. 2007.
[4] H. Kam, et al., IEDM Tech. Dig., pp. 463466, Dec.
2005.
[5] S. Salahuddin and S. Datta, Nano Lett., vol. 8, no. 2,
pp. 405410, Feb. 2008.
[6] S. W. Kim, et al., IEEE Trans. Nano. (submitted)
[7] S. Cho, et al., Appl. Phys. Lett., vol. 99, no. 24, pp.
243505-1243505-4, Dec. 2011.
- 377 -
FO-3-5-3
A Practical Solution to Ringing Error Problems with Lucy-Richardson

Deconvolution for Spatiotemporal SRAM Margin Variation Effect Analyses
Hiroyuki Yamauchi
and
Worawit Somha
Fukuoka Institute of Technology, FUKUOKA, JAPAN

E-mail: yamauchi@fit.ac.jp, bd12002@bene.fit.ac.jp
Abstract
This paper proposes a practical solution to the
ringing error problem with Lucy-Richardson (L-R)
deconvolution used for inversely analyzing the Random
Telegraph Noise (RTN) effects on overall SRAM
margin modulation. The proposed technique
successfully circumvents the ringing error thanks to
reducing the phase difference between the feedbackgain and deconvoluted object in iteration cycles, which
contributes to avoid any positive feedbacks, resulting
in no error amplification. This effectiveness has been
demonstrated for the first time with applying it to a
real analysis for the effects of the RTN on the overall
SRAM margin variations, while exploiting a faster
convergence benefit of L-R algorithm.
Keywords: Lucy-Richardson deconvolution, Ringing
The almost relevant ideas for the ringing reduction

described in the publications rely on the human optical
illusion trick for image recognition. The required
ringing suppression level is unfortunately quite
different from our cases.
The authors proposed the alternative algorithms to
avoid the ringing [2] but it needs additional iteration
cycles due to fine segmentations.
Thus, the L-R algorithm can be still attractive
candidate for our applications if the ringing issues
would be solved. Thus, we tried to experimentally
figure out what is behind the ringing in the L-R
iterations and what are the most sensitive procedure to
ringing noise amplification.
In this paper, we demonstrate the ringing elimination
for the first time based on the proposed control of the
key procedure and parameters in the L-R deconvolution
(L-R-dcnv).
1. Introduction
Ever increased spatiotemoral margin variations (MV)
effects on SRAM fail probability cannot be inversely
analyzed any more by the ordinary Gaussian-based
deconvolution analyses [1-2]. This leads to a rapid
increase in pressure to develop a new deconvolution
analysis tool (see Fig. 1).
Lucy-Richardson (L-R) algorithm [3] is one of the
most widely used one for recovering a latent image
from the blurred image.
The authors already demonstrated the ringing issues of
the L-R deconvolution (L-R-dcnv) of the RTN
distribution (g) with the SRAM overall MV (h) and
concluded that this cannot be used for SRAM analyses
[2]. This is because it causes the ringing and cannot
meet the prediction accuracy requirements of the
probability density distribution (pdf) in the tail region
(rare-event, i.e., pdf < 10-12) [2].
To the best of our knowledge, there have been very
little qualified published solutions to the ringing error
problems with the L-R-dcnv for the real SRAM MV
analyses [2].
2. Experimental Analyses for Ringing

The original and modified key expressions for L-Rdcnv are shown in Table-1 and 2, respectively. We
figure out the most sensitive factors (p and q) to the
ringing by experimental results. The factors of p and q
are determined as expressions (4) and (8) shown in
Table-1 and 2, respectively.
The phase differences between RTN(g(t)) and q
effect the g(t+1) behavior, as shown in Fig. 2. Once its
phase difference becomes sufficiently smaller, the
difference of amplitude is automatically reduced by
iteration cycles.
Otherwise, the ringing starts to happen as shown in
Fig. 2. Thus, we focused on how to reduce the phase
differences between the g(t) and q.
Six types of phase control (A-1 to C-2) shown in
Table-2 are experimentally compared as shown in Figs.
3 to 6.
Those are categorized into the following three:
1) padding zero to the both edges of p or q for noise
filtering.
(See Fig. 3)
- 378 -
ICEIC 2015
2) smoothing of p or q with least mean square
(LMS). (See Fig. 4 and Fig. 5)
3) shifting q with the tuning the position of the
center of PSF. PSF is used in iteration cycles of the
expression (7). (See Fig. 6)
Since q is the convolution result of p with PSF, the
phase of q can be controlled by the center position of
PSF as shown in Fig. 6.

Based on the experimental results, the followings
are found: 1) padding zero to q is better than that for p,
2) LMS smoothing of p is better than that for q and
wider x range (a.k.a # of for Gaussian) for smoothing
reduces more RTN(g(t)) ringing, and 3) the right phase
shift of q by PSF modulation can make the phase
difference between g(t) and q much smaller, resulting in
no ringing of RTN(g(t)).
The case C-2 is the best option. Thanks to
eliminating the RTN(g(t)) ringing, the deconvolution
error of RTN(g(t)) and fail-bit count error (cdf of h(t)=
g(t)f) are reduced as shown in Table-3.
Fig.2 See Table-1 and 2. Ringing problem with Lucys deconvolution

and its strong dependency on the phase difference b/w g(t) and q
Table-1 Expressions for

deconvolution algorithm (1-4)
g(t+1)= g(t) x
References
conventional
g(t)
Lucy-Rechardson
f^ ---- (1)
f^ = flipped f
[1] K. Takeuchi, et al, Comprehensive SRAM Design

Methodology for RTN Reliability , Digest of IEEE
Symposium on VLSI Technology, (2011), pp. 130-131
[2] H.Yamauchi, W.Somha, A Technique to Solve
Issue of Richardson-Lucy Deconvolution for
Analyzing RTN Effects on SRAM Margin Variation,
5th IEEE Latin American Symposium on Circuits and
Systems, Feb. 2014
[3] Fish D. A. et al, "Blind deconvolution by means of
the RichardsonLucy algorithm", Journal of the
Optical Society of America A 12 (1): pp.5865
h = g f ------------------- (2)
h(t) = g(t) f ------------------- (3)
h
= h(t) ------- (4)
p = g(t)
h
f
Table-2 Proposed 6-modifications and its expressions for modified
parts (A-C) of Lucy-Rechardson deconvolution (5-8)
A-1
A Padding zero
to
LMS
B (least mean
square)
Phase tuning
C b/w p and q
by PSF
A-2
B-1
B-2
C-1
C-2
g(t+1) = g(t)x LMS

g(t+1)= g(t)x LMS
p = h(t)/ h
q = p f^
p = h(t)/ h
q = p f^
shift p to right
shift p to left
h f^ -- (5)
h(t)
h
h(t) f^ -- (6)
LMS: least mean square
h
PSF ---- (7)
h(t)
q = p f^ = p PSF ---- (8)
g(t+1)= g(t) x
Fig.1 Forward (convolution) and inverse (deconvolution) problem
of RDF(f) and RTN(g) variation effects on overall VLSI (SRAM)
margin variations (h=fg)
- 379 -
PSF: point spread function based on f^
ICEIC 2015
Fig.3 See A in Table-2. Comparison of ringing reduced effects by

padding zero to p and q. Padding zero to q is better than that for p
Fig.5 See B in Table-2. LMS of p adapting area dependencies.
Fig.4 See B in Table-2. Comparison of ringing elimination by

reduced the differences in the swing-amplitude and phase by least
mean square (LMS) of p and q
Fig.6 See C in Table-2. Center position shifting of PSF by tuning of

truncated parts of f^ gives a major impacts on ringing reduction. It is
found that they have strong dependencies of center position of PSF on
the ringing. Fig. 6(c) demonstrates an elimination of ringing.
- 380 -
ICEIC 2015
(t)
(t)
Table-3 Summary of error reductions by the proposed one (C-2) for RTN deconvoluted distribution g(t) and cdf of h = g f .
(t)
Main reason for error reduction is elimination of ringing of g .
How much the proposed one (C-2) can reduce the error?
Relative error at pdf=10-12
Error of deconv RTN
g(t)
Error of cdf of h(t)
Conventional L-R
100%
10-10@10-12
(a.k.a fail bit count error)
- 381 -
Proposed (C-2) case
1/1010
1/1010
< 10-8 %
< 10-20@10-12
FO-3-5-4
FinFETs Source/Drain Resistance Modeling under Low Contact Resistivity

Conditions
JungHun Kim and SoYoung Kim
College of Information and Communication Engineering
Sungkyunkwan University
Suwon, Korea
ksyoung@skku.edu
Abstract
We show that at low contact resistivity, the
conventional source/drain resistance model is
insufficient to describe the electrostatics in the
extrinsic region of tri-gate FinFETs. We
electrostatically analyze the extrinsic source/drain
region of the tri-gate FinFETs using 3D TCAD
simulation. We improve the traditional transmission
line model (TLM) based contact resistance model
considering three dimensional current flow. We derive
the sheet resistance model using conformal mapping,
considering the silicon resistance below the contact,
which has been mostly ignored in planar MOSFETs.
Fig. 1 S/D resistance model components and

dimensional parameter definition table.
In this work, we develop the resistance extraction
and simple modeling method of extrinsic source/drain
resistance components based on Sentaurus 3D TCAD
simulation [5].
2. Resistance Extraction Method
Keywords: FinFET, compact model, source/drain

resistance, extrinsic resistance.
1. Introduction
The performance of planar MOSFETs with channel
lengths under 32 nm has limitations due to short
channel effects (SCE). To overcome SCE, The tri-gate
FinFETs, which is one of the MuGFET (multi-gate
FET) has been adopted for mass production. FinFETs
has suffered from the high parasitic resistance and
capacitance for its 3 dimensional shape. Several studies
show that the contact resistivity can be very low
(0.2~0.5 um2) in short channel devices [1][2].
Tekleab [3] discussed various types of contact
boundary conditions that can be successfully applied to
FinFETs. However, in their work, the contact
resistivity value is larger than 3.3 um2, and our
TCAD simulation shows that their model has 22.19%
maximum error if the contact resistivity is less than
0.30 m2. Chang-Woo Sohn [4] also discussed the
extrinsic resistance of FinFETs, and they adopted the
concept of effective contact resistivity which is difficult
to be determined.
Fig. 1 shows the simulated FinFETs structure with

the geometric dimensions used in this study. Gaussian
doping profile is adopted and S/D contact is
surrounding the top and both side walls of S/D region.
We simulate the FinFETs with different effective
width (Weff=2Hfin+Wfin) but same height-to-width ratio
(=Hfin/Wfin). For device simulation, we solve Poissons
equation, drift-diffusion transport equation considering
mobility degradation, density gradient quantization
Fig. 2 Voltage and current density versus position.
- 382 -
ICEIC 2015
model. Contact is simulated as Schottky contacts

specified by contact resistivity [5]. Stress is ignored for
its negligible effects on extrinsic resistance.
Our extraction method for extrinsic resistance is
based on [6]. The voltage (electron quasi-Fermi
potential) and total current density under the bias
conditions of Vgate=0.8V, Vdrain=0.05V, Vsource=0V, and
Vsubstrate=0V are shown in Fig. 2. Each resistance
component specified in Fig. 1 is extracted as follows:
Contact resistance (Rcon) is defined as the voltage
difference between inner and outer drain contact
divided by drain current. Sheet resistance (Rsh) is
defined as source region resistance. Accumulation and
spreading resistance (Rspr+Rac) is defined as voltage
difference between junction line and source end
divided by drain current.
Under low contact resistivity which means Rd is less
than 0.5 m2, Rcon contribution to Rsd is significantly
reduced. Usually for sub-32 nm node FinFETs, Rd=1.5
um2 is adopted [3][4].
3. Analytical S/D Resistance Model

3.1 Accumulation and Spreading Resistance
Rac and Rspr are well discussed in [6] and they are
sensitive to mobility models, gate bias, doping profile
as implied in (1). We will use integral form as shown in
the following.
1
Rac
K
11.62[ nm ]
are compared in Fig. 2.

3.2 Sheet Resistance
Planar MOSFET compact model ignores silicon
region under contact because of its small value [7].
However, at low contact resistivity, the silicon region
has to be considered. Fig. 3 (a) shows simplified form
of S/D silicon region to be analyzed. Yellow region
represents silicon and gray region represents contact
metal. Given H/W ratio (=2.33), the top contact of S/D
has little effect on Rsd (Fig. 3 (b)).
The sheet resistance denoted by Rsh can be modeled
as (2) using conformal mapping methods in [8]. The
factor 1/2 in (2) comes from parallel connection of side
sheet resistance (Fig. 3 (c)). We confirm our results
using Raphael which is 3D field solver [9].
L Lsw,eff 2
1
Lsd
Rsh ( sd ) ( sd
)))
ln(sinh(
2 H fin
Wfin / 2
2 Wfin / 2
q n n p p dx
11.62[ nm ] xac
11.62[ nm ] xac
1
Rspr
K
(a)
(b)
(c)
Fig. 4 Description of Rcon analysis. (a) shows
distributed resistance along the silicon interface, (b)
shows closed cut plane of S/D region in the channel
direction at low contact resistivity, (c) shows opened
cut plane at conventional contact resistivity.
q n n p p dx
( 1)
(2)
3.3 Contact Resistance
13.50[ nm ]
,where xac is accumulation layer length, q is electron

charge, n/p are electron/hole densities, n and p are
electron/hole mobilities and K is proportional constant
that is used as the fitting parameter in this model.
Electron quasi-Fermi potential and its integral in (1)
Although conductance (G) of TLM can be exactly

determined from short contact limit in (3), resistance
(R) of TLM is difficult to determine for some reasons.
Rshort
Rlong
1
GLsd
lim coth Lsd R G
Rd
( lim coth Lsd R G 1)

R 0
G
1
)
Lsd R G
(3)
(a)
(b)
(c)
Fig. 3 Description of Rsh analysis. (a) S/D region
with top contact, (b) S/D region without top contact,
(c) simplified side sheet resistance.
Previous TLM in [3][4] ignores Rd dependency of

R, which causes significant model error at low contact
resistivity. The Rd dependent situation can be
visualized as a closed cut plane as shown in Fig. 4 (b),
which means the current along the interface affects the
contact resistance. So, the conductive area is enlarged.
As a result, we propose the improved TLM model as
described in (4)
- 383 -
ICEIC 2015
Fig. 5 Rsh validation results with various Hfin.

Rd=0.3 m2, Wfin=15 nm.
Fig. 6 Rsh validation results with various Lsw. Rd=0.3

m2. Wfin=15 nm, Hfin=35nm.
Rcon
1
d
G Weff R
,R
R
coth( Lsd R G )
G
sd
S0 B Rdq
Fig. 7 Rcon validation results with Weff=51 nm,

H/W=2.33.
Fig. 8 Rcon validation results with Weff=85 nm,

H/W=2.33.
(4)
, S0 H fin W finWeff
,where Weff is effective width of FinFETs. and S0 is

effective conductive cross section area, B and q are the
fitting parameters depending on the geometry like Weff.
Fig. 9 Model validation for Rsd using TCAD
simulation.
4. Model Validation
4.1 Sheet Resistance Validation
We verify our Rsh model by changing Hfin and Lsd.
Fig. 5 shows Rsh validation with various Hfin. As
FinFETs below 22nm process nodes uses H/W ratio
larger than 3, the range Hfin30 nm is an infeasible
range. The maximum error occurred at the feasible
range is 3.33%. Fig. 6 shows Rsh validation with
various Lsw. In this case, all Lsw range is feasible. The
average error is 5.57%.
4.2 Contact Resistance Validation
We verify our Rcon model by changing Weff and Rd,
but keeping same H/W ratio. Fig. 7 and 8 show the
results. As effective width becomes smaller, the contact
resistance becomes larger because of the small contact
area. And proposed TLM shows well-matched results

compared to Sentaurus simulation even under 0.3
m2. Maximum errors of previous TLM are 22.19%
for Fig. 7, 15.17% for Fig. 8, and maximum errors of
proposed TLM are 0.34 % for Fig. 7, 0.16% for Fig. 8.
Thus, proposed TLM gives better results.
4.3 Total Source/Drain Resistance Validation
Finally, Fig. 9 shows the accuracy of the total
source/drain resistance (Rsd = Rac + Rspr + Rsh+ Rcon )
model compared to Sentaurus simulation. The errors
are within 5%. The fitting parameter with default
values shown in Fig. 1 are : q 1.32 , B 4.43 105 ,
K 2.68 103 , C 2.38 103 , Lsw, eff 3.50 103 .
- 384 -
ICEIC 2015
5. Conclusion
We propose improved contact and sheet resistance
model for S/D resistance of FinFETs. When the contact
resistivity is very low, the sheet resistance, which has
been mostly ignored in planar MOSFETs, has a
considerable contribution to S/D resistance. We also
show the previous TLM model can no longer be
accurate in this regime, and propose an improved
model. In the future, modeling of spreading (Rspr) and
accumulation resistance (Rac) will be investigated. The
modeling method in this paper is also applicable to
other multi-gate transistors like nanowires.
Acknowledgement
This work was supported by the IT R&D program
of MKE/KEIT [10039174, Technology development of
22nm level foundry devices and PDK] and IDEC.
References
[1] Jieying Luo, et al., Compact Model for Carbon
Nanotube Field-Effect Transistors Including Nonidealities
and Calibrated With Experimental Data Down to 9-nm Gate
Length, IEEE TED, vol. 60, no. 6, pp. 1834-1843, June
2013.
[2] Aaron D. Franklin and Zhihong Chen, Length scaling of
carbon nanotube transistors, Nature Nanotechnol., vol. 5,
no. 12, pp. 858-862, November 2010.
[3] Daniel Tekleab, et al., Modeling and Analysis of
Parasitic Resistance in Double-Gate FinFETs, IEEE TED,
vol. 56 no. 10, October 2009.
[4] Chang-Woo Sohn, et al., Analytical Model of S/D Series
Resistance in Trigate FinFETs with Polygonal Epitaxy,
IEEE TED, vol. 60, no. 4, April 2013.
[5] Sentaurus 3D, Synopsys Inc., Mountain View, CA, 2014.
[6] Ng, K.K and Lynch, W.T., Analysis of the gate-voltagedependent series resistance of MOSFETs, IEEE TED, vol.
33, no. 7, pp. 965-972, July 1986.
[7] Yuan Taur and Tak H. Ning, Fundamentals of Modern
VLSI Devices
[8] P. M. Hall, Resistance calculations for thin film
patterns, Thin solid Films, vol. 1, no. 4, pp. 277-295,
January 1968.
[9] Raphael 3D, Synopsys Inc., Mountain View, CA, 2014.
- 385 -
FO-3-5-5
Ge/SiGe Quantum-Well Diode Modulator for On-Chip Optical Interconnect

Xiaochi Chen1, Yijie Huo1, Seongjae Cho2, Byung-Gook Park3,*, and James S. Harris, Jr.1
1
Department of Electrical Engineering, Stanford University, Stanford, CA 94305, USA
2
Department of Electronic Engineering, Gachon University, Gyeonggi-do 461-701, Korea
3
Department of Electrical and Computer Engineering, Seoul National University, Seoul 135-944,
Korea
*
E-mail address: bgpark@snu.ac.kr
Abstract
In this work, a surface-normal modulator diode has
been fabricated and characterized. Our DC Ge/SiGe
modulator devices are SiGe p-i-n diode on Si with
Ge/SiGe quantum wells (QWs) in the intrinsic region.
The Ge/SiGe QW structures were grown by RPCVD,
and after the epitaxial growth of Ge/SiGe QWs, the
modulator diode was fabricated using standard Si
fabrication processes. Modulator photocurrent spectra
have been successfully obtained at room temperature
in the wavelength range from 1400 nm to 1550 nm at
various biases, which would accommodate the
applications for Si on-chip optical interconnect.
The designed Ge/SiGe modulator devices have

SiGe p-i-n diode structures on Si substrate with
Ge/SiGe quantum wells (QWs) in the intrinsic region.
The Ge/SiGe QW structures were grown by a reducedpressure chemical vapor deposition (RPCVD). After
the epitaxial growth of Ge/SiGe QWs, the modulator
diode was fabricated using standard Si fabrication
processes as shown in Fig. 1.
Keywords: surface-normal modulator, quantum well,

RPCVD, photocurrent, on-chip optical interconnect
(a)
(b)
(c)
(d)
1. Introduction
In the most recent technology roadmap, the on-chip
optical interconnect is being regarded as the
replacement for electrical interconnect owing to its
low-power consumption, high-speed data transmission,
and low latency [13]. Here, modulator is an essential
active optical component that alters phase, amplitude,
and frequency of the optical signals, which has been
adopted from optical telecommunication system down
to on-chip optical interconnect for next-generation
very-large-scale integration (VLSI) system realized by
the convergence of electronics and photonics [45]. In
this work, a surface-normal modulator diode has been
fabricated and characterized. Ge/SiGe quantum wells
were constructed as the base material for an optical
modulator with higher compatibility to Si processing
and stronger quantum confinement effects.
2. Device fabrication
Fig. 1. Fabrication process flow of modulator diodes.

Wafers with epitaxially grown Ge/SiGe QWs were
coated with 1-m-thick photoresist (Shipley 3612) in
the standard 4-inch SVG coater track, using the
standard recipe with 2-mm edge bead removal. The
resist was then patterned, using optical lithography in
the ASML stepper and developed in the SVG
developer. The square mesas with different sizes from
100100 m2 to 500500 m2 were plasma-dry-etched
to reach the bottom p-doped region with NF3 etchant in
the AMT etcher. Rectangular ring contact regions were
- 386 -
ICEIC 2015
patterned with 1.6-m-thick photoresist, again using

the SVG coater, ASML stepper and SVG developer.
The size of the optical window inside ring contacts
range from 80 80 m2 to 450450 m2. Metal layers,
including 20-nm Ti, 10-nm Pt, and 200-nm Al, were
deposited by electron-beam evaporation. The multilayer metal was lifted-off in acetone/isopropanol
solvents, and then, the device fabrication was finished.
-3
x 10
0V
-1V
-2V
-3V
-4V
-5V
Photocurrent (a.u.)
5
4
3
2
1
0
1400
1450
1500
Wavelength (nm)
4. Conclusion
In this work, a Ge/SiGe quantum-well-based
surface-normal modulator diode has been fabricated
and characterized. The Ge/SiGe quantum wells were
constructed by an RPCVD which is an epitaxy tool
more suitable to batch process for massive production
and the rest of device fabrication was carried out by Sicompatible process integration. The fabricated
Ge/SiGe modulator demonstrated clear excitons peaks
and shifts under various bias conditions at room
temperature successfully. The Ge/SiGe quantum-well
modulator would be an essential active component for
optical interconnect in the electronic-photonic
integrated circuits (EPICs) toward the next-generation
VLSI systems.
3. Measurement results and discussion

6
Last, photocurrent is low at 0 V due to the high

resistance. There is voltage drop across the resistive
region, and consequently, the modulator is a little bit
forward-biased, which is the reason that the
photocurrent at 0 V is low.
Acknowledgments
1550
Fig. 2. Ge/SiGe QWs QCSE photocurrent spectra.

The photo-absorption current is measured at room
temperature (RT) as shown in Fig. 2. First, clear
excitons peaks are observed even at RT while the
peaks from bulk Ge are not observable at RT. The
reason is that the excitons are very fragile: they collide
very frequently with phonons at RT and then break
leading to a very short lifetime. Since the absorption
linewidth is inversely proportional to lifetime, so the
linewidth is quite board and not easy to resolve.
However, here the excitons are confined in the QWs.
They are spatially close to each other and it is hard to
break them. Thus, they have long lifetimes and
demonstrate clear peaks. Second, very clear peak shifts
can be seen due to quantum-confined Stark effect
(QCSE) [6]. The operation wavelength is close to Cband where wavelengths for the on-chip optical
communication channel are available. These shifts are
larger than that in previous works. The underlying
reason is that we have fewer QWs than the works and
the thinner QW region induces a larger electric field.
Third, excitons peaks become lower as bias voltage
increases. It is because the electron and hole in the
excitons will go to different directions when an electric
field is applied. The overlap of their wavefunctions
will decrease, so the absorption intensity decreases.
This work was supported by the Center for

Integrated Smart Sensors funded by the Ministry of
Science, ICT & Future Planning as Global Frontier
Project (CISS-2012M3A6A6054186) and in part by
the National Research Foundation of Korea (NRF)
funded by the Korean Ministry of Science, ICT &
Future Planning (NRF-2014R1A1A1003644).
References
[1] International Technology Roadmap for Semiconductors
(ITRS) 2013 Edition. On-line available at http://www.itrs.net.
[2] J. W. Goodman, F. I. Leonberger, S.-Y. Kung, and R. A.
Athale, Optical Interconnections for VLSI Systems, Proc.
IEEE, vol. 72, no. 7, pp. 850866, Jul. 1984.
[3] D. A. B. Miller, Rationale and Challenge for Optical
Interconnects to Electronic Chips, Proc. IEEE, vol. 88, no.
6, pp. 723749, Jun. 2000.
[4] M. Gilmore, Fibre Optic Cabling: Theory, design and
installation practice, Butterworth-Heinemann Ltd. (Oxford,
UK), 1991.
[5] D. A. B. Miller, Optics for low-energy communication
inside digital processors: quantum detectors, sources, and
modulators as efficient impedance converters, Optics Lett.,
vol. 14, no. 2, pp. 146148, Jan. 1989.
[6] Y.-H. Kuo, Y. K. Lee, Y. Ge, S. Ren, J. E. Roth, T. I.
Kamins, D. A. B. Miller, and J. S. Harris, Strong quantumconfined Stark effect in germanium quantum-well structures
on silicon, Nature, vol. 437, no. 7063, pp. 13341336, Oct.
2005.
- 387 -
ICEIC 2015

Poster Session
PS-1
and Device
P1-01

#"!$!

! "

#
#

&%
$ #
#
#&

$ &)##
)'(" #

# &#
*+
,& )
#

$%#)&) &
-
'!

$ # $
$%#)

# &

&
.
# '
(
& )

&

& &'/&
%
$ &)&
$

& &# # # &
'
/) )
& #
#
)

-

# #
$ #
&&##&&$) &'

%"&

#"$

!" ## # # $

%()& *' '+
" () ,./0 -1./0
2 #
0 " " # %43&
!" # ()
# 5,1 # # #
7#,668

!

#"!$ #%& '

,)0()-*(.1+/(
.-3/.2
(,-563(03)4+
#)378(
#)378(
7: &3 &#

#

8&
&

7 $ &
& & $

# # &

# & ' $
# ,
&7+
0+
$ $%#)

$%#)&#
)'( 7&
# &
9<627= & &
&
#

& ,&
$%#)
&734? >'@34-'( 0&
#
&
$ #&& $ 9 <627=' 9 9
<627=
#
&
#&
& # ! $ '
& &
!7 !0 !A

' (
&
#
#
&

&
& ' & &
#
&

& #& $
#&
!
,# & ,
&

'( 0
&7'B34- @'534-$%#)
'

'"(*)

&
&&$ " &#

#
& &2 ,& 0'134-
,& 1'534-' $
& & $
&
.
& # #
#
' (
& , .
&
#
&
$ $#
& $768'9 # .

:
&.!:7
& $$
.
& ;/
& & -

& $$ #
# &

&. & $8'

& , &

6'75 #&& # &
# )&
&
##'8
$
&7A1C77A
#
&)
&
&

0' &
& & $ &
&

&&
& &

A
1

&

& 6'>; 734-
@'534- & & B66!4- A'D34-
&#
)' &&&&
&
- 389 -
ICEIC 2015
#
" &#
0'134-
1'534-%
'
7'5; &) + $%#)

& 734-
@'534-' $%#)

&
# &
# $%#) #&&
*:;+

&'

%

)

)
%
(

&

9796
66
67
76
0: &3 )
77

A66;
%#)

7'B3E@'73

7'B3E@'03

7'B3E@'A3

7'B3E@'13

>66;

# &

D>08

7'6@8

7'078
7'A78
%#)

7'B3E@'B3
7'B3E@'>3

7'B3E@'@3

7'B3E@'53

# &

D5>8

7'6@8

7'008

7'AA8

' &
)-)),
)

&
)
&

.
1/#0
>B
!
6'7A
!
>B
:!
6'75
!
.
1/%0
.
1/'0
A3 &&

&
2
1
&

,
)

5'619
*>'@8$ 7'0;+
09

A'79
AEB'>34-
0'A19
*7'A8$ 7'5;+
7E@'534-
AE7634-
7E7'@34-
1
)

& &# & & .) /&
# #
#
"&# :
"&#

$ *" +$.) !

&) $
F#
*" 067A"78780676771+

13 &&

&

#

)

)
#
(

&

9796
66

A66;
%#)

73E>'13

# &

D118

>66;

%#)

73E>'@3

# &

D>68

+",

8

$ "
&#
& . &'
& ,
&

6'75! # )'
C
# &

&0'A19*7'A8$
<7=F :,( ) ") ,

, G8A7634- C
.!
3 $ !/ !H9/8
#
H&

9
.;&I

#
&
$#'AA5JA17.0665

<0=

7 4) /, G8 09
6'7A!; $
3:
#
&I!
#
## )
&'0A>00A>B'0665'

<A= 8 !--
! /' ;
$ !#
&
#&# G8 : &
&
!
: & 3 $ 9
.
&/& "# $
..4
#
!
C&I H"8 (8F ("H(
/F"0676
- 390 -
P1-02
A Wide Output Range Step-Up DC-DC Converter with Maximum 92.5%

Power Efficiency for High Voltage Application
Joo-Young Chun, Young-Jun Park, Juri Lee, and Kang-Yoon Lee
College of Information and Communication Engineering, Sungkyunkwan University, Korea
krombee@skku.edu, pyj88@skku.edu, juri@skku.edu, klee@skku.edu
Adaptor
12V, 1.5A
Abstract
(From DC adeptor)
Step-Up DC-DC Converter
This paper presents a Wide Output Range Step-Up DCDC Converter with Maximum 92.5% Power Efficiency in
0.18 CMOS technology. The proposed Step-Up
converter operates with 500 kHz switching frequency.
Post-simulation result show that the output voltage is 14V
~ 30V at 12V input when output current is 500mA and the
maximum efficiency is 92.5%.
Keywords: Step-Up DC-DC converter, Wide Range,
PWM, Bootstrap.
VDD
Current
Gen.
VB
Boot
strap
VS+5V
VS
VS+5V
VS
VS
HS_L
VEN
0V
Enable
5V
Clock
Generator
DRIVER
HS_R
StU_OUT
VSS
0V
C
LS
Feedback
Circuits
PWM
Load
GND
LDNMOS
FB
Fig. 1 Block diagram of Step-Up DC-DC Converter with

bootstrap circuit
1. Introduction
In recent years, the trends of the portable product are
downsizing, light weight and power management system.
The need of DC-DC converter has been extended to
various fields as advanced technology applied to
application. So, the high efficiency at wide input range and
load current of DC-DC converter is needed. The inductor
type of PWM mode from DC-DC converter has very high
converting efficiency. So, it is compact for the need of
battery cycle life such as portable system and electronic
device.[1]
The proposed Step-Up DC-DC Converter operates in
PWM mode. The input voltage is 12V with wide output
range of 14 V ~ 30 V. The load current is 500mA and postsimulation result shows maximum efficiency of 92.5%.
Fig. 2 is the proposed bootstrap circuit. The switching

loss is reduced and the efficiency increased by maintaining
VGS voltage to 5V of the high power transistor which is
LDMOS. From the level shifter, if gate signal of VIN and
VINB has enabled in order than VS voltage and VB voltage
is generated. Thus, the VGS voltage of LDMOS maintains
5V constantly.
Level Shifter
VB
M2
Gate Driver
M3
Gate_Logic
VIN
Delay
Cell
AND2
VIND
VOUT
VINB
Delay
Cell
AND2
VINBD
VIN
M1
M4
VINB
VS
2. The proposed Step-Up DC-DC Converter
Fig. 2 The Proposed Bootstrap Circuit
Fig. 1 is the block diagram of Step-Up DC-DC

Converter with bootstrap circuit. The DC-DC converter is
designed to achieve high efficiency from a wide output
range by connecting bootstrap circuit to the gate of high
power transistor to minimize switching loss.
3. Layout and Simulation

Fig. 3 shows the layout of the proposed Step-Up DCDC Converter. The area is 3200 m x 2000 m. The layout
was designed symmetrically.
- 391 -
ICEIC 2015
VOUT vs Efficiency
95
Efficirency [%]
90
92.5% @ TT/5V/27C
85
SS/5V/125
80
TT/5V/25
FF/5V/-40
75
70
14
16
19
20
22
25
28
30
VOUT
Fig. 5 Efficiency results with PVT variation of proposed

Step-Up DC-DC Converter
Fig. 3 Layout of the proposed Step-Up DC-DC Converter

Fig. 4(a) is the top post-simulation result of the
proposed Step-Up DC-DC Converter with Bootstrap circuit.
The simulation result was plotted by extracting and
applying parasitic parameters of Resistor, Capacitance, and
Coupling Capacitance(R+C+CC) from layout using
Cadence tool.
Fig. 4(b) is the waveform with bootstrap circuit added.
Non-overlap circuit operates with opposite phase of
VGS_LS (Low-Side) and VGS_HS (High-Side) signal to
prevent from overlapping of two signals. Fig. 4(a) shows
maximum output voltage of 30V is stably generated with
5V difference between VS and VB.
4. Conclusion
The proposed Step-Up DC-DC Converter was designed
with 0.18 CMOS process. The switching frequency is
500 kHz, load current 500mA, wide output range of 14 V ~
30 V at 12 V input, and 89.5% ~ 92.5% efficiency has
been achieved.
The proposed wide output range Step-Up DC-DC
Converter could be applied to power management IC to
increase power supply efficiency.
Table 1: Performance Summary of Proposed Work
VGS_LS_
mos
5V
VGS_HS_
mos
5V
Parameter
Supply voltage
Output voltage
Switching
Frequency
Output Current
Maximum
Efficiency
(Post-Simulation)
Process
VB
VS/VB
VS
VG_HS_R
mos
30V
StU OUT
(a)
This work
12 V
14 V ~ 30 V
500 kHz
500 mA
92.5%
0.18 m CMOS
Acknowledgment
This research was supported by the MSIP (Ministry of
Science, ICT and Future Planning), Korea, under the
ITRC(Information Technology Research Center) support
program (NIPA-2014-(H0301-14-1008)) supervised by the
NIPA(National IT Industry Promotion Agency)
References
(b)
Fig. 4 Post-simulation result of proposed Step-Up DC-DC
Converter (a) Top-simulation (b) Bootstrap simulation
Fig. 5 is the efficiency result of PVT variation which is
the corner analysis. When it is in Typical NMOS and
PMOS (TT), the efficiency is from 89.5% to 92.5%. The
result shows stable efficiency overall voltage from 14 V to
30 V with maximum efficiency of 92.5%.
- 392 -
[1] Young Hwan Lho, A Study on the Design of

Voltage Mode PWM DC/DC Power Converter,
Korean Railroad Conference, pp. 411-415, Oct. 2011
[2] Joo-Young Chun, Young-Joon Park, Hyung-Gu Park
and Kang-Yoon Lee, A Step-Up DC-DC Converter with
94.51% Maximum Efficiency for Wide Output Range,
IEIE SoC Conference, pp. 235 236, May. 2014
P1-03
Controlling hole transfer by WO3/MoO3 nanoparticles in organic solar cells

Eung-Kyu Park1, Ji-Hwan Kim1, Jae-Hyoung Kim1 and Yong-Sang Kim1,*
1
School of Electronic and Electrical Engineering, Sungkyunkwan University, Suwon, Gyeonggi

440-746, Korea
E-mail: yongsang@skku.edu
2. Experimental
Abstract
We investigated the effect of metal oxide
nanoparticle (NPs) in PEDOT:PSS (poly(3,4
ethylenedioxy-thiophence),
Poly(styrene-sulfonate))
layer for the light harvestation in P3HT:PCBM
organic solar cells. Due to the difference in the energy
band structure of the two nanoparticles, the WO3 NPs
acted as a hole blocking layer, whereas MoO3 NPs
helped in the hole transfer. The solar cell with WO3
NPs at 1.5 wt% concentration, showed a power
conversion efficiency of 4.22% under AM 1.5G
illumination and the device blended with 2 wt% of
MoO3 NPs showed a PCE of 4.40%.
Keywords: Metal oxide nanoparticle, organic solar
cells
1. Introduction
The organic solar cells (OSCs) have an infinite
potential of becoming a renewable energy source
because of the advantages like low-cost, simple
fabrication, light-weight, and flexibility [1-3]. The
scattering of light due to the surface plasmon resonance
effect is the most sought-after technique to enhance the
short circuit current density (Jsc) of organic solar cells
[1-3]. The addition of light scattering materials
revamps the light intensity in the device, resulting in an
increased light absorption.
In this study, the artificial buffer layer mixed with
metal oxide NPs (WO3, MoO3) was used to enhance
the scattering effect and to provide mechanical
endurance to the device without increasing the
thickness.
The
electrochemical
impedance
spectroscopy (EIS) was used to study the interface
charge transport process and resistance.
We investigated the effect of metal oxide

nanoparticle mixed in PEDOT:PSS based buffer layer
on the inverted organic solar cells. As shown in Fig.
1(a), the fabricated solar cells had a structure of
ITO/ZnO/P3HT:PCBM/PEDOT:PSS(WO3 or MoO3)/
Ag. For the fabrication, ITO glass substrates were
cleaned in an ultrasonic bath with acetone, isopropyl
alcohol, and deionized water for 20 min, respectively.
At first, ZnO solution was spin coated on ITO substrate
and then annealed at 200 C for 20 min in a dry oven in
ambient air. The active layer (P3HT:PCBM) was
deposited on a ZnO layer by spin coating. The
P3HT:PCBM mixture (P3HT:PCBM=1:1 weight ratio)
was dissolved in chlorobenzene at a concentration of
40 mg/ml. In order to deposit hydrophilic PEDOT:PSS
mixed with or without NPs on hydrophobic active layer,
PEDOT:PSS was also mixed with 0.5 vol% of Triton
X-100 (C14H22O(C2H4O)n) nonionic surfactant. This
solution was then spin-coated on hexamethylene
disilazane, which was pre-coated on the active layer.
Thermal pre-annealing was conducted at 160 C for 10
min in a dry oven in ambient air. Ag top electrode (100
nm) was deposited on PEDOT:PSS layer through a
shadow mask by thermal evaporation, defining an
active area of 0.1 cm2.
Fig. 1. (a) Schematic of the inverted organic solar

cell (b) The energy band diagram with WO3 and
MoO3 in PEDOT:PSS layer.
- 393 -
ICEIC 2015
Fig. 1 (b) shows the energy band diagram of different
device. J-V characteristics were measured with J-V
curve tracer (Eko MP-160) and solar simulator (YssE40, Yamashita Denso) under AM 1.5G (100
mW/cm2) irradiation intensity. The Resistance was
measured using EIS. Entire fabrication and
measurement processes were conducted in ambient air.
current which is dependent on surface roughness of the

electrodes. It is obvious that the electron transfer in a
less rough interface is faster than in a highly rough
interface.
This speculation is consistent with the obtained values
(in Table 2) by fitting of the impedance spectra.
3. Results and discussions

The measured J-V characteristics of the organic
solar cells using without NPs and with NPs (WO3 or
MoO3) are shown in Fig. 2. The control device showed
a power conversion efficiency of 3.46 %. The WO3 and
MoO3 based devices showed the PCE of 4.22 % and
4.40 %, respectively. The performance of all the
organic solar cells is summarized in Table 1.
Fig. 3. Nyquist plots of the cell with WO3 or MoO3
NPs
Table 2. EIS measurement of organic solar cells
without NPs, with WO3 and MoO3 NPs in
PEDOT:PSS layer.
Rs[ cm2]
Rp[ cm2]
Control
36.7
675
WO3
33.5
351
MoO3
30.4
254
4. Conclusion
Fig. 2. J-V characteristics of inverted organic solar
cells using PEDOT:PSS buffer layer with WO3 or
MoO3 NPs
Table 1. Summary of organic solar cells
performance without NPs, with WO3 and MoO3
NPs in PEDOT:PSS layer.
Control
WO3
MoO3
Jsc [mA/cm2]
12.80
14.61
15.00
Voc [V]
0.56
0.56
0.57
F.F
0.48
0.51
0.51
PCE [%]
3.46
4.22
4.40
Fig. 3 presents the nyquist plots of the cells with

different NPs in the dark, at frequencies ranging from
20 Hz to 10 kHz [4]. Rs represent the ohmic resistance
including the electrodes and bulk resistance in the
active layer. Rp is associated with the interface charge
transport process, defined by the charge transfer
resistance.
The value of Rp of the cell with MoO3 is 254 cm2,
the smallest in all devices. However, device without
NPs has an opposite effect and leads to the increase of
Rp (675 cm2). The small Rp provides more efficient
charge transport. As we all know, this charge transfer
process has a certain speed, reflected in Faradaic
The effects of two kinds of metal oxide NPs in

PEDOT:PSS layer for light harvesting on organic solar
cells was investigated. The addition of metallic NPs
increased the light scattering. The control device
showed a 3.46 % efficiency while WO3 NPs in
PEDOT:PSS layer showed a PCE of 4.22%. The
device with MoO3 NPs in PEDOT:PSS layer showed a
higher performance of 4.40 % under AM 1.5G
illumination. The MoO3 NPs based devices have low
parasitic resistance and higher charge transfer.
References
[1] M. G Kang, T Xu, H. J Park, H. X Luo, L. J Guo:
Adv. Mater. 22 (2010) 4378.
[2] A. P Kulkarni, K. M Noone, K Munechika, S. R
Guyer, D. S Ginger: Nano Lett. 10 (2010) 1501.
[3] E. K. Park, M. Choi, J. H. Jeun, K. T. Lim, J. M.
Kim, Y. S. Kim: Microelectronic Engineering 111
(2013) 166.
[4] Y. Zhang, L Li, S Yuan, G Li, W Zhang:
Electrochim. Acta. 109 (2013) 221.
- 394 -
P1-04

! $ ! " #&%! #&% !
"'"*)(! , +
/,/--. 0

&" % %
%

!

21 &
- % $3$ 0 3
& &
! &
0 3
!
& &
,% & 0

!

!"

# $%(&#$(')
2 % ! " " " %

!
* 67 5676 6)
2" !" "
165 56

)"! 98
" !
+
/ :
/ :
/ ;
/ ;

%) 2"
" " "
)< )+""% )
.*
)2""%! 09:8=
*%
)!

!
)
!

"!"

" < )+).0"""%
"
%3 %
" )
1 !!""%
&98=' !

"" % &+=' )
6*3 " !

?>
) < ) :
"
)
1" " ! !!
*3 3

"" % "
) ! *
" ! !! *
! *").!&
9='
"

" %)
2"! ! ! "" %
! * *" "
)
#"$
%

!" " " *
*

#$(
,+-). !#$(
" !)
" "" %
! /

" #$( ) #%
! " ! *
0!! * !
)1 !!!%

!
)
2"! 3 "*"%
! " !
" "
!
! * ) 4% " " *
" )."
!"!
"!"
!"

)
- 395 -
ICEIC 2015
< )9"""% *

* "
)
" 8):?=!""
% !!
) 2"
" "
!! )

'"( %

. " "% !
"

@ " "
!
) 2" %

" " " *
!! * " &""
% ! ') 2" "
" *
@!!#$( )
"&"

% "
-./*21.0./*2#.3
)!

2" *"6" A)
*

,+- B") B C= (
2(2&2* ( 2 ' 2" ! D
4 " <"

E 41 0 )
:88F)+F:+F))

"'"

% "
-./*2,4.0./*2#.3
" #" + % %

**
, "
" 4"

"

- 396 -
P1-05
AlGaN/GaN MISFET Gas Sensor Having a Horizontal Floating Gate

Chang-Hee Kim, Chul-Heung Kim, Yoonki Hong, Jongmin Shin, Kyu-Bong Choi, In-Tak Cho,
Chul-Ho Won1, Do-Kywn Kim1, Jung-Hee Lee1 and Jong-Ho Lee
Inter-university Semiconductor Research Center (ISRC) and Department of Electrical and
Computer Engineering, Seoul National University, Seoul 151-742, Republic of Korea
1
School of Electronics Engineering, College of IT Engineering, Kyungpook National University,
Daegu, 702-701, Republic of Korea
jhl@snu.ac.kr
wafer. After photolithography process for active
Abstract
An AlGaN/GaN MISFET (Metal Insulator
Semiconductor Field Effect Transistor) gas sensor was
fabricated and characterized. The sensor had an ntype channel, floating-gate, sensing layer and controlgate formed horizontally. As a sensing material in this
work, SnOx was adopted to sense a target gas of NO2.
Transfer (ID-VGS) curve of the gas sensor was
measured in N2 gas ambient as a reference and in NO2
gas ambient with a concentration of 50 ppm. A sensing
speed of the gas sensor was less than 35 s at 300 C.
Keywords: AlGaN/GaN, MISFET, Gas Sensor, NO2
1. Introduction
Recently, there has been a growing interest in gas
sensors to detect harmful gases causing lung diseases
such as asthma [1]. A promising FET type gas sensor
based on Si MOSFET having a lateral floating gate
(FG) has been proposed to achieve low cost, low power,
high reliability, and small size [2]. The gas sensor uses
a metal oxide sensing layer which has a wide range of
working temperature (150C < T < 500C) [3].
However, Si MOSFET type gas sensor has a maximum
working temperature of 250 C because the junction
leakage in Si MOSFET degrades sensing property at a
temperature higher than 250 C [4]. Thus, it becomes
increasingly important to develop a FET type gas
sensor based on wide band gap materials to work at a
high temperature [5]. In this work, we propose an
AlGaN/GaN MISFET gas sensor having a horizontal
FG and show gas sensing characteristics of the device
by using SnOx and NO2 as a sensing layer and a target
gas, respectively.
2. Device Fabrication
Fig. 1 (a) and (b) show the top and 2D cross
sectional views of the fabricated gas sensor, respectively. The device reads out work-function (WF) change in
the sensing layer butted to the control gate (CG), when
the device is exposed to a target gas. Key fabrication
process steps of the device are explained as follows. An
AlGaN/GaN hetero-structure is grown by metal organic
chemical vapor deposition (MOCVD) on a sapphire
patterns, the layers are etched. Then, a 30 nm thick

Al2O3 layer is deposited by atomic layer deposition
(ALD) to form a gate insulator. The layer is etched by
wet etch process after photolithography process for
contact pattern. Then, a titanium (Ti) and nickel (Ni)
are patterned by lift-off process to form a source, drain
and FG. A 50 nm thick SiO2 layer is deposited by
plasma enhancement chemical vapor deposition
(PECVD) to be used for a passivation layer. Then, the
CG (Ni/Ti) and sensing layer (n-type SnOx) are formed
by e-beam evaporation and sputtering processes,
respectively. They are patterned by lift-off process.
Thicknesses of SnOx, Ni and Ti to be used for the CG
and FG are 100 nm, 70 nm and 30 nm, respectively.

Fig. 2 shows ID-VGS curve of the fabricated gas sensor
based on n-type MISFET at 25 C. Both of the channel
length and width of the device are 5 m, respectively.
Fig. 3 shows ID-VGS curve for the fabricated gas sensor
exposed to N2 and NO2 at 300 C. In this work, an ID of
the gas sensor decreases when the device is exposed to
NO2. The NO2 is an acceptor type gas on the SnOx [6].
When the gas sensor is exposed to NO2 gases, the gases
diffusing through the SnOx extract electrons from the
SnOx and become negatively charged ions at surface of
SnOx. It creates a positive space charge (depletion)
region in the SnOx. The region increases WF of the
SnOx. The increased WF shifts threshold voltage of the
gas sensor into the positive bias direction and decreases
sensing current [2], [7]. Fig. 4 shows transient response
of the fabricated gas sensor by changing chamber
ambient (N2 and 50 ppm NO2) alternately at 300 C.
Response and recovery times of the device are about 35
s and 60 s at VGS = -13.5 V, VDS = 0.5 V, respectively.
4. Conclusion
We have proposed an AlGaN/GaN MISFET gas
sensor having a horizontal floating gate which is able to
work at high temperature. In this work, a SnOx sensing
layer was adopted to sense NO2. Sensing current of the
- 397 -
ICEIC 2015
gas sensor exposed to NO2 decreases due to increasing
WF of the sensing layer. Measured response and
recovery times of the gas sensor when exposed to N2
and 50 ppm NO2 alternately, are about 35 s and 60 s,
respectively.
(b)
SiO2 (Passivation layer)

SnOx
Ni/Ti
(Sensing layer)
(Floating Gate)
Ni
Ti
5. Acknowledgement
This work was supported by by the Brain Korea 21
Plus Project in 2014 and the National Research
government (MSIP) (No. 2008-0062617)
Al2O3
(Gate Insulator)
References
ID (A)
Fig.1. (a) Top and (b) 2D cross sectional views of

the fabricated gas sensor cut along AA.
10
-5
10
-6
Temp. = 25 C
10
-7
VDS = 0.5 V
10
-8
10
-9
10
-10
10
-11
10
-12
-14
-6
10
N2
NO2 50 ppm
-7
10
Temp. : 300 C
VDS : 0.5 V
-8
10
-22
-20
-18
-14
-12
VGS (V)
4.5
NO2:ON
VGS = -13.5 V, VDS = 0.5 V
N2: OFF
Temp. : 300 C
NO2 : 50 ppm
3.5
ID (A)
Contact
-16
Fig.3. Transfer (ID-VGS) curve for the fabricated gas

sensor exposed to N2 and NO2 at 300 C.
3.0
2.5
2.0
1.0
Sensing layer
-6
-5
Metal2
-8
10
NO2:OFF
1.5
Metal1
-10
Fig.2. (a) Transfer (ID-VGS) curve of the fabricated

gas sensor based on n-type MISFET at 25 C.
Source/Drain
Active
-12
VGS (V)
4.0
Floating
Gate
Undoped GaN
Sapphire
ID (A)
[1] United State Environmental Protection Agency

(EPA). [Online]. Available : http://www.epa.gov 2010.
[2] Chang-Hee Kim, In-Tak Cho, Jong-Min Shin, KyuBong Choi, Jung-Kyu Lee and Jong-Ho Lee, A New
Gas Sensor Based on MOSFET Having a Horizontal
Floating-Gate, IEEE Electron Device Letters, vol. 35,
no. 2, pp.265-267, Feb. 2014.
[3] G. Eranna, B. C. Joshi, D. P. Runthala, and R. P.
Gupta, Oxide Materials for Development of Integrated
Gas SensorsA Comprehensive Review, Critical
Reviews in Solid State and Materials Sciences, vol. 29,
no. 3, pp111-188, Aug. 2004.
[4] Ingemar Lundstrm, Thomas Ederth, Hans Kariis,
Hans Sundgren, Anita Spetz, Fredrik and Winquist,
Recent developments in field-effect gas sensors,
Sensors and Actuators B, vol. 23, no. 2, pp. 127-133,
Feb. 1995.
[5] D. Donoval, M. Florovi, J. Kov, and P. Kordo,
High temperature performance of AlGaN/GaN HFETs
and MOSHFETs, Microelectronics Reliability, vol. 48,
no. 10, pp. 1669-1672, Oct. 2008.
[6] Shih-Chia Chang, Thin-film semiconductor NOx
sensor, IEEE Transactions on Electron Devices, vol.
26, no. 12, pp. 1875-1880, Dec. 1979.
[7] Alexandru Oprea, Nicolae Brsan and Udo Weimar,
Work function changes in gas sensitive materials:
Fundamentals and applications, Sensors and
Actuators B, vol. 142, no. 2, pp. 470-493, Nov. 2009.
A
Control Gate
(a)
AlGaN
N2: ON
12
15
18
21
24
27
Time (min)
Fig. 4. Transient response of the fabricated gas senor

in alternate ambient of N2 and NO2.
- 398 -
P1-06
A Design of 1-GHz Sub-Harmonically Injection-Locked PLL

Sung-Yong Cho and Deog-Kyoon Jeong
Department of Electrical Engineering and Computer Science, Seoul National University
Seoul, Korea
E-mail : sycho@isdl.snu.ac.kr
Abstract
The design and simulation results of 1-GHz subharmonically injection-locked PLL (SI-PLL) in a 65nm
CMOS technology are reported. Replica VCO is used
to lock output clock with injection pulse and the other
VCO in conventional PLL loop follows voltage and
temperature variations continuously. The simulation
results show that RMS jitter of 1-GHz clock is
improved by 35% with reference clock injection.
nodes in each VCO cell to achieve the injection effect

as shown in Fig. 1. [2] After locked of VCO, clock
edges, clk0 and clk180, are fixed to injection pulse. As
a result, VCO noise is improved toward injection
signal noise.
injection
< VCO >
< VCO Cell >
Keywords: SI-PLL, replica VCO, low jitter

Clk0,180
1. Introduction
injection
Oftentimes, PLL is employed for various kinds of

applications and low-noise clock is a key to achieve
high performance for the applications. There are
several ways to make low-jitter PLL such as
multiplying-DLL and sub-sampling PLL. [1] Among
the techniques, sub-harmonically injection locked
oscillator (ILO) is employed in this paper because of
its advantages of simple operation and powerful jitter
reduction.
In SI-PLL containing a single VCO, there are two
loops, one is main PLL loop and the other loop is for
injection pulse. Therefore, injection timing adjustment
circuit is needed for synchronizing phase lock between
main loop and injection pulse, thus making it
complicated to design it. In this paper, dual-VCO
method for 1-GHz SI-PLL is adopted for compact
architecture. The following sections describe circuit
design of the SI-PLL followed by simulation results.
2. Circuit design
2.1. Injection Locked Ring Oscillator
The designed SI-PLL employs an injection-locked
ring oscillator. A 4-stage ring oscillator is used as the
VCO, and a mosfet is located between differential
Fig. 1. Injection-locked ring oscillator

2.2 Pulse Generator
A pulse generator is designed with XOR gate as
shown in Fig. 2. The XOR gate can provide pulse
doubled in comparison with AND gate, thus having
twice injection effect [3]. This is because the pulse can
be generated from both rising and falling reference
clock. The pulse width is set to 50ps which is the delay
of 3-inverter and the minimum width for the CMOS
XOR gate.
Ref.Clk
125MHz
Inverter
Delay Cell
XOR
Pulse
Fig. 2. Pulse generator

2.3 Overall design of SI-PLL
Fig. 3 shows overall design of SI-PLL. There are
two loops in the PLL, one is the conventional chargepump PLL loop and the other one is for injection loop.
These two loops have no interference each other since
control voltage of replica VCO is from the capacitor
voltage of integral path (Vctrl) in loop filter. The
- 399 -
ICEIC 2015
former loop is for generating control voltage of VCO

which makes the frequency of replica VCO set to
target frequency. As a result, the phase of replica VCO
clock can be fixed with the injection pulse.
CLK180
CLK0
Inj.Pulse
CLK180
CLK0
Inj.Pulse
Injection
(a) Before locked

XOR
Pulser
Replica
VCO
Ref.Clk
125MHz
PD/CP
(b) After locked
Fig. 5. Locking process of injection pulse
Injection
Clk_out
1GHz
VCO
Vctrl
Jitter RMS : 3.45ps

Divider(8)
(a) w/o injection
Jitter RMS : 2.27ps
(b) w/ injection
Fig. 6. Effect of reference clock injection
Conventioanl PLL Loop
Fig. 3. Overall design of SI-PLL
4. Conclusion
The SI-PLL is designed in a 65 nm CMOS process.
Fig. 4 shows the layout picture of the SI-PLL,
composed of VCOs, CP, PFD, divider and LF. Fig. 5
indicates locking process with injection pulse. In the
beginning of injection, the pulse may be located in any
phase of replica VCO clock, thereby pulling or
pushing the clock. After all, clock edge is forced to
locate middle point of the injection pulse and VCO is
locked with a reference clock.
Fig. 6 shows simulation results of effect with
reference clock injection. The simulation is achieved
with H-SPICE containing flicker and thermal noise
from 100kHz to 10GHz. The RMS jitter with injection
is 2.27ps in comparison with conventional PLL of
3.45ps. Therefore, jitter performance is improved by
35%.
Rep. VCO
A design of 1 GHz SI-PLL is presented. The PLL

employs the replica VCO and injection locking is
accomplished without injection timing calibration
circuit. As a result, jitter performance is improved by
35%.
References
[1] A. Musa et al., A compact, low-power and lowjitter dual-loop injection locked PLL using all-digital
PVT calibration, IEEE J. Solid-State Circuits, vol. 49,
no. 1, pp. 5060, Jan. 2014.
[2] B.M. Helal, C.-M. Hsu, K. Johnson, M.H. Perrott,
A Low Noise Programmable Clock Multiplier based
on a Pulse Injection-Locked Oscillator with a HighlyDigital Tuning Loop, IEEE RFIC Symposium, pp.
423-426, June, 2008.
[3] J. Lee and H. Wang, Study of subharmonically
injection-locked PLLs, IEEE J. Solid-State Circuits,
vol. 44, pp. 15391553, May 2009.
CP
VCO
PFD
LF
Divider
Fig. 4. Layout picture of the SI-PLL
- 400 -
P1-07

! "#

$

" !
% #$& '(
, #)*+' % & -./0
%
% % %
1 + % %
$& )*+ % %
% # +' % $& )*+
% % #2+'1 +
% % % (
3 2+
+ % ( 3
% %
" 1
+ % 42 516%)

& % %&%
1

& #% !$ !!" #
#" +
#
"%(')& ",#
# *+

!!" # #" +
#
" %-')& /"# .
"
#
#" ++#
"%1)&0
*' + "

"' (' -"

+ #" +
#
" ##
++#+
! -')
(')0
"' *' # -;

! #
/ #
!"+ #
"

+!"##+ "" #
+#
0
(')
2 #" +
#
" + $ . "# 3(

" #+ . + # + "# #
#
!"* $ "+
+
+ "#$
! #
+
" #+0 )"!
" # + ++ # ## #
#" +
#
" + "!
" " #"+# +
+ + " #" +
# % &

+
!"%(& "#$045
6# #" +
#
" ",#
#

7 -1)+"
# "!
"
#" +
#
" . + # "

+ "#$0 #+" ",#

#
!
" #" +
#
" + 7 - 1)+ +
"

+0 ) "

+ #
+ /"! .$ #
8" # "+#+
.# !
" #" +
#
"
# 90:
"
++0
"','#-;
!#"

+3(!"/"++-7)
/"#
+0 )) (( +# !
" # #$ +
!+#

! "+ #/$0

)"

+#" +
#
" ++

(0 .+!
" 3(!"0)
!
#"

+!"+/ .$
4
< % &
$+
)
#
#

! 7 8 - !
"#8
## "!"" #"

"" #" #
# %-;& +
- 401 -
ICEIC 2015
+#0 )
#
+
! 99 9=0= >, "

+"0 (0 "+ #+ # "#$
"+

! # "

+ !" # #
/ #

!"+
# # -')
" # (')0 # +
++ ## !"+ / # + "" #

+#
02+ .+ (0;#"

+
!"+.##" "#$"!
" #
#
#"+ # # +

"
+#
0 (0 ;
"+ #+ # -;
! # "

+ 3( !"
#
/ #
-') # # +
"

+#
# "+ # #
"
++ /
#
#"#"%-7)&/"#
+02+ .+ (0
; # "

+ ",#
# *
"+
/ #
-7)/"#
+8+#0)3(!"
+ .+ .$ # " # .+
# "" # ""
"
# *450
"'-' "

#
"
!#3(!"
,'

) 3( !"
# # "

+ #" +

#
" " # 90:
"
++ #
"
/ # !+.#$
! #
"

+ ",#
# *0 (0 ? +
+ #
"

#
"
! # # 3(
!" !#"0 )
" +,
! # 3(
!" + 90; 90 0 # "+ 0@ 2
!"
0: 7 +$ /
#0 ) +"
!"* $ "+
+
! # 3( !" + +

(0=0)
!#3(!"+=00(0@0
+
+#+"-; #
#
+
!99
9=0= >, " 0 $
# # "

+
",#
# *=0:
!-;"
/ #
+ /
/" # + " # !" +
$ -') # # +

"
+#
+

$0 # +
# ## # "

+ #

"
/ "#$ #
# "
#"
"!
" ++ +
"!! $
+0
"'/'+"!"* $"+
+
!#3(!"
#
#"

+#" +
#
"0
"'0'+"-;
!#3(!"
# #"

+
#" +
#
"0

$ %-"!
" "$
!)3(2!"A
$
)-"

+)" +
#
"
-'
2 ",#
#
+ 7 - 1)+
"
++ + "

+ #
"
/
#$ "
!#" +
#
"0)"

+
#
+#
/"
!##" +
#
"

+#
,"
.$
. 7 -1)-')
7 -1)(')##"
" "" #"#
0)
"

+3(!" /=0: :0= -;
"
/ #+"+ #/$0)#
+
.

$ #
#/ 8"+ 2 " #+0 )
"

+ # * + + $ . ! !
" 2
" #+ " #
/"+
" /"+ %'3+&

( " /"+ . + # "
/+ "#$
"!
" ++
8
+"!
" 0
. "

)+ "+" + +
"# .$ +
3+" -"
" #"
# #
3+"
(
#

!
" %3(& ! .$ # +#"$
!A #
%9;9@:=999&0
)" +
#
"
#

$
B7 -
(')
7 -
-')
-"

+
)" + #
"
< %&
=0?
=0
=0
(%&
@0:
@0:
@0C
-;%&
D0;
?0?
90
"" #
+#

0=
0@
"% &
$/
#%7&
0@
90; 90
0:
90: "

++
)

$
B-"#"/+
!#+.
+"+#0

45 '00 0E2 #/!. .
2#-!
". #)7" /"+F
+1.1+ + 1/
0=:
00;=@@G;=CD
' 0990
45 -003 10H 0 #E2
/
.
"(A)

+!"%(A)2& " #

!"#
+ #

$ ##
F
+1.1+ + 1/
0=
00C=G
:9
/099;0
- 402 -
P1-08
Wide Range Driver Amp with linearity for TVWS

Juri Lee, Hyung Gu Park, Joo young Chun, Kang Yoon Lee
College of Information and Communication Engineering, Sungkyunkwan University, Korea
E-mail : juri@skku.edu
Abstract
This paper presents the wide range driver amplifier
(DA) with linearity for TV White Space (TVWS) RF
transceiver. The TV White Space frequency range is
470~698MHz. The proposed DA has filter
characteristic. Also, the wide range matching and
power control can be implemented. The 0.13um CMOS
process is used and the layout size is 946 um x 688 um.
proposed for frequency control. The inductor Q value

determines the filtering characteristic, however,
provided model inductor Q value is so low. Therefore,
the negative gm circuit was adopted to enhances the Q
value. [1]
P5
P4
P2
P3
P1
P0
Keywords: DA, Filter , Power control, Matching
BIAS
OUT
1. Introduction
TVWS transmitter can transmit the signal for a wide
frequency range (470-698MHz). Since the TVWS band
is broadcasting frequency, the interferer of adjacent
channel is high. Therefore, when the receiver receives
the signal with quality, the transmitter requires the high
performance of the DA which can transmit the signal
with the unwanted signal blocking. The figure 1 shows
the DA block diagram and simulation environment.
The proposed DA is composed of the Pre Amp and
Main Driver. When the DA verifies with simulation,
Pad, Bonding wire model, Matching Network, and
antenna 50 should be considered. The Chebyshev Pi
LC Low Pass filter is adopted for Matching Network
and reject the harmonic components.
0.2736
IN
Figure 2. Pre driver schematic

The figure 3 shows the main driver schematic. The
basic structure as cascode amplifier is employed for
high power stability. Also, for the large output voltage
swing, the inductor load is used. The Cap. bank <2:0>
of main driver guarantees S22 value (-10dB) for wide
range. The main driver is consists of power control
cells <4:0>, these cells control the power with On/Off.
VDD
750pH
Driver Out
DA_CONT<0>
OUT
IN
PRE
Driver
Main
Driver
Bonding wire
Modeling
50
DA_CONT<1>
DA
Power
Cell_0
DA_OUT
PAD
PRE_Amp_Bias
PRE_PD
IN
PRE
DA
DA
Power
Cell_1
DA_CONT<2>
DA
Power
Cell_2
DA_CONT<3>
AlwaysON
DA
Power
Cell_3
DA
Power
Cell_def
Main Driver In
Power Cell Out

DA_CONT<0>
Figure 1. Block Diagram and simulation environment
DA In
2. Architecture
Figure 3. Main driver schematic
The figure 2 shows the pre driver schematic. The pre

driver block drives the some power gain. The proposed
pre driver enhances the filtering characteristic by using
the load inductor. In order to get the filtering
characteristic in wide range, the Cap.bank <4:0> is
3. Experiment Results
The figure 4 shows the proposed DA layout. The
layout size is 946um x 688um
- 403 -
ICEIC 2015
Pre amp
( dBm )
14
12
10
8
6
4
2
0
-2
-4
-6
Main amp
Figure 4. Driver Amp layout
4. Conclusion
This paper proposed the DA has filtering
characteristic and linearity for wide range (470~698
MHz). Also, this DA offers the similar to the power
and s22 value overall the TVWS range with Cap. bank
control. The table 1 shows the performance summary
of the proposed DA
.
Table 1. Performance Summary
< S21 >

30dB
20dB
10dB
0dB
< S22 >
-10dB
Parameter
Technology
Power
Supply Voltag
Current Consumption
Die Area
-20dB
460M
715M
Frequency (Hz)
Figure 5. Driver Amp post simulation results.

The figure 6 shows the linearity simulation of
proposed DA in post simulation level. Figure (a) and (b)
are total current and output power respectively with
power control <4:0 >. In figure 6(a), we can see the
total current linearity. Also, in figure 6(b), we can see
the power linearity with power control. Since the
power scale is dBm, the graph shape is log function.
( mA )
42
39
36
33
30
27
24
21
18
15
12
9
Total Current
Total Current
Power Cont. <3:0>
(b)
Figure 6. Linearity simulation of DA with power
control <3:0> (a) Total current (b) Power
The figure 5 shows the post simulation results of DA

S-parameter. The S21 simulation of the figure5, The
DA has the filter characteristic and stable gain for
460~715MHz range. Also, S22 value maintains the 10dB for wide range that means matching is well
made.
0dB
POWER
POWER
value
0.18m CMOS
12dBm
3.3V
41mA
946um x 688um
Acknowledgements
This research was supported by Global PH.D
Fellowship Program through the National Research
Foundation of Korea(NRF) funded by the Ministry of
Education (grant number 2013H1A2A1034225)
References
[1] Desheng Ma, Fa Foster Dai, A 7.27GHz Q-Enhanced
Low Noise Amplifier RFIC With 70 dB Image Refection
Ratio,
IEEE
MICROWAVE
AND
WIRELESS
COMPONENTS LETTERS, VOL. 20, NO. 8, AUGUST
2010
[2] Razavi, 1999, Design of Analog CMOS Integrated
Circuits.MC Graw Hill.
Power Cont. <3:0>
(a)
- 404 -
P1-09

! "
#$ %'& &(

" #% #$

) *

+* ,/. /- 0
00 &1

* ,/. / 0

30 2 ,4 "& 5

* ,
/. / 3 576457.. 8 2 +576 9
:;)4;-0+,<<-&:,
=2,4 "&.00

+&&,<<=&:,-* ,/. /
0 3 >7

&

$
(%8 # ) ! #
*%* %"
"#
%)%!!
#!
!% !% &9#
% /#' 3 ! /# !
)#* %"
"#
% % &&& *#!*
:,:; "#0'
( !2 ) !

%"
"# #
!%
( !%!
% !% * ! %
% ) * ! #!* * ! &&& #
!*:,:;"#0'* ! ! <= "
!%
!
"!( !!!
4> *# "!% ! ! %2#
!
<, /
% ! ! % !
?
) !$!2 &' : "
!

! !
"!#$#
"
!% #! !% !% &'
!%( %!# ! )%#
% *% *! !*
! !% !% ! )%! ) !%
!
%
) ( *%* ! "!! ! *% !
! %!# !
#!
!% !% &' ! !* !
!% !% ( ! )%" ! * "!
(!% *&&&.-,"/+!0,,1'

(!2 ) !( #!#( !
&'
*% ! !%" " *%
)%!*%%" ) !
&&& *## ' ! *!( % #
*% **! (

! # !!
%)
%% ! &34' 34 ( !

!% !%
!
%! "( #*"!%
%
% 65#073 ! %2 ))%!!

!%"
"
% *%* * (

! %#*%**!

$ & ' %

@A) "
! %! 9#
% /#
*%%"
! " *!
"6<7B !"!!
*!
! ) % !%" % ! !
% ! ! ( % %)% ! "
**( ! %(!%% !
(%%% ! #
%" !% (%

*! % %
!%
!
%!%"%!
!%!
* # ! !
*% !! % " !
%"
" %% ! "2
% ! %(
"
! %
! ! !! %
$*%" !(%!%
C@.:<-D:,:E"#
0 #:
F . 0=; D :,- /F"#: 657 ! "
! ! %!#
%%% !% *%!
2GHG%"( ! " %

"
! !9#
%/#
- 405 -
ICEIC 2015

%% !3! !%!!!!" " !9#

% /# :0"/+ ! )%
(! ,,=/ !% )! ,50/
=="/+
()
()
()
()
()
()
$ 0 () !# ()

* * +
()
$ " () +

$ * *

* $,

$ $
%
$
-() / . , () / ." , () / .0 1

0 #% 2+ 3

I ! " ! # !! %)
%% ! ! 9#

%/#!%%!" %" %
%% !
C &:' !%#!
#" ! %" % !

%+ !% &$ "' &5' )%!#
!
#" !%" %! $
" !% !% *% ! !
! $ % ! !% !%
") %" ! ) ( !
% ! !

! ( ! )%! !%
%" ! ! ! $ %
"! ! !
% % !%
)%! !
%" ! ! 9#
% % !
! )%!
% ! !+
% % %
%!)!( &&&/9J,:/'!!%
!
" ! ! # !! %)
%% ! !
!
%#!# !% & ! % $
"'%%!)"
"!( &&&/9J,5/'
! )%! !
! !%" ! # !!
%)
%% ! & $ "' (
! * ! "*%)
(!% * &' & $ 0' % %!)
! ( &&& /9 J ,0 /' ! )%!
!
* ! ( !
* ! # !! %)
%% !
& $ "' !"*%)" ! & $
0'
3A&/9!9#
%/#%
$ 09#
%/#) ! # !!
%)
%% ! J := K@+K" ! *%
** )!
&/AA',=/%)%!!!
(#-,#"/+
! 0,, 1 )% !% % #!#
%
4 5

@ ) 9%"
"#
% )%! #!
!% !% &9#
% /#' *%* %
!%# *% **! !* !

&(!!% )%!!
'%
!9#

%/#C!%)%* ! !(
&&!%&%'/9 **!"%!%
&)%!' !

%% 3 !%"
*%%" ! 9#
% /# ) (!
34+3%!L:,-&34J:=K@+K"'!/AA,=/
M-,"/+!0,,1

6$
%2
**%! ( ! 4! H %

! 1% &4H' % !
( ! 1%
)% " ! &3N' &4 5,:<H:@5@:@::,=,-0E' @
! %2
**%! ( ! H %
N%%"!%
!4! H %
! 1%
&4H'
( ! !% 3
!
%
N &45,:5H:@:@:,:<,::'
7
6:7I/ (%@/%
!99% 2
% I
O@ !"%* !
!
!
#!!% !%O
? &
5
?)<**:0E#:<,5,,P
657 1" 1"
#Q 1

O9%"
"#
% !
! !% !% !
%%34+3O ? &,@
5
&/ &<&
**:EPG:E;5,,;
607#9I 9"
%
R# ROA)*
*% * %
!
(#! !
!
!% !%
!
#%"
"

%
!%
! O )& ?& @& ** 5<0=,=#
:S5<0=,=#0A5,,E
6<7 !
%
A)B %9
/% C#5,:0,0
*
! / @B@%5,:0
- 406 -
P1-10
The Fast Switching LED Driver Using Current Peaking and Carrier Sweep
Out Techniques for High Speed Visual Light Communication System
Chang Kyu Lee#*, Seong Jin Oh*, Kang Yoon Lee*
#
Samsung Electronics CO., Ltd., Giheung, Korea
*
Sungkyunkwan University, Suwon, Korea
ck1024.lee@samsung.com
Abstract
In this paper, a fast response current-pulse
switching technique for a Light-Emitting Diode (LED)
driver, not only for illumination but also for Visible
Light Communication (VLC), is proposed. It uses
current peaking technique to reduce the optical rise
time, done by adding a capacitance in parallel to the
current limiting resistor, and an inductor is used to
discharge the LED with a reverse current IR during the
turn-off phase. Also, for the input stage, inverter
instead of NMOS is used to reduce the power
dissipation and carriers sweep out. The proposed
circuit is designed in CMOS 0.35- process and
experiments show the proposed circuit provides the
switching delay time from 3.81 ns to 0.42 ns of the
conventional LED driver at 100 MHz frequency.
Keywords: LED Driver, visible light communication,
pulse-current, carrier sweep out, CMOS, inverter.
pulse should be as narrow as possible. The LED

switching speed is restricted by the depletion
capacitance denoted by Cp in LED Electrical model as
shown in Fig.1 [1].
V
LED
Rs
Carriers
Cp
Fig. 1. LED Electrical Model

The rest of the paper is organized as follows. In
Section 2 the proposed LED driver circuit how it works
is shown. The simulation result is discussed in Section
3. Section 4 concludes this paper with some indications
on future work.
2. Proposed LED Driver Circuit
1. Introduction
Recently, the Light Emitting Diode (LED) has
gradually substituted for incandescent and fluorescent
light. It has great attention as a most promising
candidate for the next generation lighting source due to
its less environmental concern, longer life time, and
excellent efficiency.
Moreover, the LED which is a semiconductor
device, can be turned on and off much quicker than
other lighting devices. This high speed switching can
make the LED suitable for the communication system.
It is possible to encode data in the light by varying the
rate at which LEDs flicker on and off to give different
strings of 1s and 0s. Modulation is very fast that human
eye can not notice. In order to increase data
transmission rate in communication, driving current
As shown in Fig. 2(b), the proposed LED driver

circuit is employed carrier sweep out and current
peaking technique. The Cpeak in parallel to the RL
makes peaking current and reduces the current pulse
rising time when the LED is turn on. On the other hand
during the turn off phase, the inductance L is used to
remove active carriers [2]. Also the PMOS transistor
can be a small resistance of the closed loop at the same
time, when the LED is turn off phase. The remaining
carriers are swept out by the PMOS. Furthermore a
CMOS inverter can not only sweep out carriers but also
decrease power dissipation [1].
Typical pulse widths for those systems are in the
range between 5 ns to 50ns (with 10 to 100 MHz) [2].
To verify the reliability of the proposed LED driver,
applied to high frequency of 100MHz.
- 407 -
VDD
13
ICEIC 2015
VDD
RSweep Out Cpeak
RL
This Work
Conventional
RL
LED
Gate Driver
Vout [V]
LED
Gate Driver
PMOS
HV-NMOS
HV-NMOS
(a)
11
12
(b)
10
Fig.2. Schematic design (a) Conventional LED

Driver Circuit. (b) Proposed LED Driver Circuit
250n
30n
50n
Time [ns]
Table 1: Performance comparison of Rise Time (tr)

and Fall Time (tf)
LED Driver
Conventional [2]
This Work
tr
3.31 ns
0.20 ns
tf
0.50 ns
0.22 ns
4. Conclusion
This paper evaluated to achieve the fast switching
LED driver using the state-of-the-art techniques for
high speed VLC system. Current peaking and carrier
sweep out skills achieve the current-pulse rising and
falling times of 0.20 ns and 0.22 ns, respectively by
0.35- CMOS technology process parameter. This
study is expected to be extended in the area of these
works.

Korean government (MSIP)(2014R1A5A1011478).
70n
Peaking
References
ILED [mA]
-10
-30
Fig.4 Simulated waveform of Output Voltage at 100

MHz
Acknowledgment
10
-90
ILED [mA]
-50
10
The enhanced LED driver with current peaking and

carrier sweep out is simulated CMOS 0.35- process
parameter. Fig. 3 shows the waveform of conventional
and proposed circuits ILED at 100 MHz, respectively.
Compared with the conventional circuit, proposed LED
drivers current waveform shows the peaking and
sweep out shape, according to expectations.
Fig. 4 presents the simulation results of output
voltage waveform for a 100 MHz square wave input.
Improved circuit waveform indicates steeper angle than
conventional circuit. The performance comparison of tr,
tf is shown in Table 1, in the proposed LED driver, the
current rising and falling times are 0.20 ns and 0.22 ns,
respectively, much quicker than conventional LED
driver.
Conventional
270n
Time [ns]
Proposed
260n
30n
Sweep Out
50n
Time [ns]
70n
Fig.3 Simulated waveform of LED Current at 100

MHz
[1] Kishi, T. ; Tanaka, H. ; Umeda, Y. ; Takyu, O., A

High-Speed LED Driver That Sweeps Out the Remaining
Carriers for Visible Light Communications, Journal of
Lightwave Technology, pp. 239 249, Jan. 2014.
[2] Halbritter, H. ; Jager, C. ; Weber, R. ; Schwind, M. ;
Mollmer, F. High-Speed LED Driver for ns-Pulse Switching
of High-Current LEDs, Photonics Technology Letters, IEEE,
pp. 239 249, Sept. 2014.
[3] Tse-Ju Liao ; Yu-Chen Liu ; Chern-Lin Chen, A
nanosecond current pulse driver for light emitting diode,
Future Energy Electronics Conference (IFEEC), pp. 299
303, Nov. 2013.
- 408 -
P1-11
A 60GHz Dual-Injection Locked Frequency Divider with current re-injection

Se-Il Oh#*, Dong-Soo Lee*, Kang-Yoon Lee*
#
*
si0823.oh@samsung.com
Abstract
This paper describes wide locking range injection
locked frequency divider (ILFD) in 65nm CMOS for
60GHz PLL. There are several millimeter-wave
frequency dividers such as ILFD, current mode logic
(CML) frequency divider, miller frequency divider. The
ILFD is the most suitable for high operating frequency
divider and low DC power consumption. However the
ILFD has narrow locking range so insufficient for
practical use. In this paper, the proposed ILFD is
designated with using NMOS transistor for increasing
injection current in the oscillator and used both tail
and direct injection input. Experimental results reveal
the minimum and maximum operation frequencies to
be 51GHz and 62.8GHz with 2.3mW at the supply
voltage of 1V.
Keywords: CMOS, injection locked frequency divider
(ILFD), locking range, 60GHz, oscillator
have been realized up to very high operation frequency,

unfortunately with high power consumption [2]. The
ILFDs operate high frequency and consume generally
less power than CML or Miller dividers, but one
disadvantage is the limited input locking range in
conventional type as shown Fig. 1. In the following
sections, the methods of realizing wide locking range
ILFD will be described.
VDD
+Vout
VDD
Vin
-Vout
M3
+Vout
M1
Vin
-Vout
M2
M3
M1
M2
(a)
(b)
Fig. 1. (a) Conventional divide-by-2 ILFD (b) Direct ILFD
divide-by-2
2. Circuit Design
1. Introduction
Recently, there have been many studies in the field
of 60GHz bandwidth circuit devices such as wireless
communication applications. As the high-frequency
capabilities of CMOS improve through scaling, CMOS
become a viable alternative for mm-wave applications
[1]. The Phase Locked Loop is an important block for
mm-wave band transceivers, so low power design is
very important and challenging. The PLL of 60GHz
needs to frequency divider chain with very high
division ratio in order to comparing a high frequency of
VCO output with a low frequency of reference clock.
So many frequency dividers are needed by chain which
is the most power consuming part among the PLL
blocks. There are several kinds of frequency dividers
such as Current Mode Logic (CML) frequency divider,
Miller frequency divider and an injection locked
frequency divider (ILFD). CML and Miller dividers
The principle of injection locking and locking range

which means frequency range in which injection
locking happens are described in [3]. Many kinds of
ILFDs are studied for wide locking range which is
proportional to input power and increasing current. So
this paper is studied how to increase current and input
sensitivity without additional power consumption. As
shown in Fig. 2, the proposed ILFD is ring oscillator
type which has wide dividing range comparing with LC
oscillator type. This ILFD is designed by cross coupled
transistor M3, M4 and differential input pair transistor
M1, M2. This ILFD also has dual injection system
which is direct injection method using transistor M6
and tail injection method using transistor M5 to
increase input sensitivity. The incident signal is provide
both M5 and M6 which size of M6 can be designed
much smaller than M5 due to more efficient injection
scheme because it has no biasing function [2]. This
- 409 -
ICEIC 2015
designated ILFD also has re-injection asymmetric
transistor M7 which is modeled by the feedback amp
for increasing current.
The proposed model is better than single injection

model as having wide locking range at all input
sensitivities. The proposed ILFD experiment results are
compared with the other published high frequency
injection locked frequency divider results in Table 1.
Table 1: Performance comparison of ILFD
Results
CMOS Technology
Freq. range[GHz]
Locking range[%]
Input level[dBm]
Power dissipation
Fig. 2. Divide-by-4 ring oscillator using the proposed ILFD

(Dual injection locked frequency divider with re-injection)
The proposed ILFD is simulated in a 65nm CMOS
process technology. The divider-by-4 test scheme of
proposed ILFD and the transient waveform result is
shown in Fig. 3. The output spectrum at a 60 GHz
input signal frequency is shown in Fig. 4. The injection
locking range reveals the minimum and maximum
operation frequencies to be 51GHz and 62.8GHz at the
input sensitivity 0dBm and power dissipation is 2.3mW
at the supply voltage 1V. Additional simulation result
is that the proposed dual injection ILFD compares with
single injection ILFD which is tail injection frequency
divider with re-injection(without M6 transistor of the
proposed ILFD) to fine the best performance model.
Vinj
[4]
0.2m
52.7~55.9
5.7
0
10.1 mW
[5]
0.13m
64~70
8.96
-3.5
6 mW
This work
65nm
51~62.8
18.9
0
2.3 mW
4. Conclusion
This paper has attempted to introduce wide locking
range 60GHz frequency divider and its verification.
The most appropriate for high frequency divider among
several kinds of divider is the ILFD. However the
ILFD has narrow locking frequency range. Therefore
dual injection scheme and using re-injection NMOS
transistor for increasing current are proposed and
compared with single injection ILFD. This simple
scheme is simulated by 65nm CMOS technology. As a
result the proposed ILFD has 11.8GHz locking range at
input sensitivity 0dBm and power dissipation is only
2.3mW at supply voltage 1V.
Acknowledgement
Foundation of Korea(NRF) grant funded by the Korean
government(MSIP)(2014R1A5A1011478). This work
was supported by IDEC (IPC, EDA Tool, MPW)
Vinj
References
Vout
Fig. 3. Simulated waveform of divide-by-4
Fig. 4. Simulated input sensitivity about single injection

ILFD type and proposed dual injection ILFD type
[1] C. H. Doan, S. Emami, A. M. Niknejad and R. W.

Brodersen, Design of CMOS for 60GHz Application,
ISSCC, pp. 440-441, Feb. 2004
[2] Marc Tiebout, "A CMOS Direct Injection Locked
Oscillator Topology as High-Frequency Low-Power
Frequency Divider," IEEE Journal of Solid-State Circuits,
vol. 39, no. 3, pp. 1170-1174, March 2005.
[3] Razavi, B., A study of injection locking and pulling in
oscillators, IEEE J. Solid-State Circuits, vol. 39, Issue 9,
pp.1415-1424, August, 2004
[4] Ken Yamamoto and Minoru Fujishima, "55GHz CMOS
Frequency Divider with 3.2GHz Locking Range," in Proc.
30th European Solid-State Circuits Conference ESSCIRC
2004, September 2004, pp. 135-138.
[5] Razavi, B., Heterodyne phase locking : A technique for
high speed frequency division, IEEE J. Solid-State Circuits,
vol. 42, no. 12, pp. 2887-2892, Dec, 2007
- 410 -
P1-12
Fast-Locked Duty-Cycle Corrector with 2-Step Operation

Kwang Won Kim#*, In Seong Kim*, Kang Yoon Lee*
#
*
kw2020.kim@samsung.com
shows the simulation results of the proposed circuit.
Finally, In section IV, we describe the conclusion.
Abstract
This paper describes fast locked duty cycle
corrector (DCC) using 2-Step Operation (Coarse-Fine
Operation). The architecture of the proposed DCC
uses a non-feedback type (Coarse Op.) and a feedback
type (Fine Op.). It can provide both fast correction
time and high accuracy. The simulated correction
accuracy of DCC is 0.5% for 10% external input
duty error in 10 clock cycles. The proposed DCC has
been operated from 0.6Ghz to 1Ghz of clock frequency
range in a 0.18um CMOS technology.
- Duty Cycle Adjuster (Interpolation)
CLK
Buffer
CLK
TDC
Fig. 1. The Architecture of Non-Feedback Type DCC
I_CLK
Keywords: Duty Cycle Corrector (DCC), Fast-Locked

DCC,
Duty-Cycle
Adjuster
Ctrl[2:0]
CtrlB[2:0]
FSM
(Up/Down)
1. Introduction
O_CLK
OUT
Comparator
Phase
Spliter
Charge
Pump
Fig. 2. The Architecture of Feedback Type DCC
These days many high speed systems such as DDR

DRAM, ADC, CDR utilize both positive and negative
transition edge of a clock. In such applications, the
clock duty should be closed to 50% for proper high
speed signaling. DCC (Duty Cycle Corrector) plays on
important role in the chip to chip signaling.
DCC can be typically classified into non-feedback
(Open loop) and feedback (Closed loop) type. The nonfeedback digital DCC [3] has the advantage of fast
locking time and low power consumption. However, it
has low accuracy, low immunity for PVT variation
comparing to feedback type.
The feedback DCC [1] has the advantage of high
accuracy and high immunity for PVT variation; but it
takes long correction time, we need a high performance
DCC which has both high accuracy and fast correction.
In order to achieve high accuracy and fast duty
correction, we propose a 2-step (Coarse Step: Nonfeedback, Fine Step: feedback mode) duty cycle
corrector in high speed systems. This is organized as
follows: In section II, we describe the architecture and
operation of the proposed 2-step DCC. Section III
1-Step(Coarse) : Non-Feedback
2-Step(Fine) : Feedback
- Duty Cycle Adjuster (Interpolation)
CLK
CLK
Buffer
I_CLK
Duty-Cycle
Adjuster
O_CLK
OUT
TDC
Ctrl[2:0]
CtrlB[2:0]
FSM
(Up/Down)
Comparator
Charge
Pump
Phase
Spliter
Fig. 3. The Architecture of Proposed 2-Step DCC
2. Proposed 2-Step(Coarse/Fine) DCC

Fig. 3 shows the block diagram of the proposed 2-step
duty cycle corrector. This DCC is composed of a nonfeedback block (TDC, Interpolator) and feedback block
(Charge Pump & Comparator in Fig. 4, Up-down
Counter). The first step of proposed DCC is nonfeedback operation by interpolation in 1 cycle of clock.
(Coarse step)
After the coarse step is completed, the fine step is
operated by feedback looping and control bit shifting.
The correction time of feedback DCC is determined by
- 411 -
ICEIC 2015
the number of control bit. The number of control bit is
proportional to duty correction range of DCC.
Because of the prior coarse step operation, the
proposed DCCs number of control bit can be
minimized by fine steps input duty error range
reduction. The proposed DCC uses 3 control bits. The
period of control bit updating and comparators
sampling is 2-divided clock. Therefore, the maximum
correction time of proposed DCC is 9-10 cycle of clock.
60%
CLK_IN
0.00n
1.45n
1.45n
6.41n
8.09n
9.79n
11.44n
13.11n
14.79n
3.04n
4.74n
6.41n
8.09n
9.79n
11.44n
13.11n
14.79n
48.8%
Closed_Out
0.00n
4.74n
48.6%
Open_Out
0.00n
3.04n
1.45n
3.04n
50.1%
4.74n
49.7%
6.41n
8.09n
9.79n
11.44n
13.11n
14.79n
6.41n
8.09n
9.79n
11.44n
13.11n
14.79n
Comp Out: 0 Duty Down

1 Duty Up
Vbiasp1
0.00n
CLKB_2X
Vbiasp2
OUT
Comp.
CLK_2X
IN
INB
COMP_OUT
1.45n
3.04n
4.74n
(b)
Fig.6 Simulated waveform of 2-Step DCC at 800Mhz with (a) 40%
input duty and (b) 60% input duty
OUTB
CLKB_2X
Vbiasn
Fig.4. The Folded-Cascode Charge-Pump and Comparator.

60%
IN
40%
40%
60%
60%
40%
INB
Integration
CLK_2X
Equalization
Fig.7 Output Duty cycle against input duty cycle
Equalization
Integration
OUT
4. Conclusion
OUTB
COMP_OUT
Fig.5 Charge-Pump and Comparators Timing Diagram
The proposed 2-step DCC circuit was designed using
a 0.18um CMOS technology. From the simulation
results, this DCC can operate from 0.6Ghz to 1.0Ghz.
By the coarse step of non-feedback DCC, the duty
cycle is corrected to be 2% duty error for 10%
external input duty error. By the fine step of feedback
DCC, the duty cycle is corrected to be 0.5% duty
error shown in Fig.7. The correction time of DCC is in
9-10 cycle of clock shown in Fig.6.
40%
CLK_IN
0.00n
1.50n
3.05n
1.50n
3.05n
7.81n
9.42n
11.04n
12.63n
14.28n
4.57n
6.25n
7.81n
9.42n
11.04n
12.63n
14.28n
51.5%
Closed_Out
0.00n
6.25n
51.7%
Open_Out
0.00n
4.57n
1.50n
3.05n
4.57n
50.7%
50.0%
6.25n
7.81n
9.42n
11.04n
12.63n
14.28n
6.25n
7.81n
9.42n
11.04n
12.63n
14.28n
Comp Out: 0 Duty Down

1 Duty Up
0.00n
1.50n
3.05n
4.57n
(a)
In this paper, the proposed DCC provides fast

correction time as well as high accuracy. In order to
achieve them, we use coarse and fine 2-step operation.
The simulated correction accuracy of DCC is 0.5%
for 10% external input duty error in 10 clock cycles.
The proposed DCC has been operated from 0.6Ghz to
1Ghz of clock frequency range in a 0.18um CMOS
technology.
Acknowledgement
Foundation of Korea(NRF) grant funded by the Korean
government(MSIP)(2014R1A5A1011478).
References
[1] Y. J. Min et al., A 0.31-1Ghz Fast-Corrected Duty-cycle
Corrector With Successive Approximation Register for DDR
DRAM Applications, VLSI Systems, IEEE Transactions on
Volume: 20 , Issue: 8, Aug. 2012.
[2] S.-K. Kao, and S.-I. Liu, All-Digital Fast-Locked
Synchronous Duty-Cycle Corrector, Circuits and Systems
II: Express Briefs, IEEE Transactions on Volume: 53 , Issue:
12 , Dec. 2006.
[3] C. S. Jeong et al., Digital delay locked loop with openloop digital duty cycle corrector for 1.2Gb/s/pin double data
rate SDRAM, European Solid-State Circuits Conference.
pp. 21-23, Sep. 2004
[4] Y. S. et al., A Register Controlled Delay locked Loop
using a TDC and a new Fine Delay Line scheme, in Proc.
IEEE ISCAS, Sep. 2006
- 412 -
P1-13
4W GaAs Power Amplifier MMIC for Ku-band Applications

Keun-Kwan Ryu, Ki-Bum Ahn, and Sung-Chan Kim
Dept. of EE, Hanbat National University, Daejeon 305-719, Korea
kkryu@hanbat.ac.kr, kbahn@asb.co.kr
balanced type in the future, the power amplifier MMIC
has simple multistage configuration.
Abstract
In this paper, we reported on a 4W power amplifier
MMIC for Ku-band satellite communication
applications. The Ku-band monolithic power amplifier
was fabricated using D-mode power pseudomorphic
high electron mobility transistor (PHEMT) process.
The linear gain is 30 dB and the saturated output
power is over 36.1 dBm in the frequency range of
13.74 GHz to 14.5 GHz. The good performance of
power added efficiency is achieved as over 30%
compared to conventional results.
Keywords: Power amp, PHEMT, MMIC, Ku-band
1. Introduction
High speed data transfer and internet access by
terrestrial wave are restricted in terms of service
providing and infra build up cost. This restriction can
be overcome, and wide band internet and broadcasting
services can be realized by using satellite
communication systems. Communication systems
operating in the Ku band are becoming more prevalent
as the demand grows for high-speed data transfer and
Internet access. One important component of these
communication systems is the power amplifier.
Because the power amplifier in communication systems
demands the performances of high linearity, high
reliability, high output power and high power added
efficiency in communication systems, its cost and
added value are very high. In recent years, power
amplifiers MMICs based on GaAs with improved
performance are developed. Several power amplifier
MMICs in Ku-band with 1 or 2W output power have
been demonstrated [15].
In this paper, we presented the high performance and
compact monolithic power amplifier chip in the
frequency range of 13.75 GHz ~ 14.5 for block up
converter (BUC) of VSAT outdoor unit (ODU)
applications. In order to increase the small-signal gain
and to extend the output power of the amplifiers by
2. Monolithic PA Design and Measurements

The requirements of block up converter (BUC)
companies are finally reflected in the specifications of
power amplifier MMIC. The gain, saturated output
power, power added efficiency and return loss are
required over 25 dB, 36 dBm, 25% and below -8 dB,
respectively. We analyze power cell and chose the 8
finger, 150 um gate length device in the 0.25 um power
PHEMT D-mode process provided by Win
Semiconductors Corporation. The output power of 28
dBm for each device was expected by a load full
simulation. The final stage of power amplifier MMIC is
designed by eight devices for 37 dBm output power as
following figure 1. And also the output power of 36.8
dBm and the gain over 30 dB is achieved by fine
tuning during the EM (electromagnetic) simulation.
Fig. 1. The block diagram for 4 W power amplifier MMIC
The designed power amplifier MMIC is measured on

wafer state. A test board including DC bias supply is
designed and MMIC is attached on the board to
measure the scattering parameters of the bare chip on
probe station. The inductances of bonding wires of
input and output ports are considered during the
simulation.
The K type connectors and RO4003 substrate with
12mil thickness provided by Rogers are used to
minimize signal loss and a change of 50 line widths
- 413 -
ICEIC 2015
between MMIC and RO4003 substrate during assembly
of test jig for Ku-band. A single layer capacitor (SLC)
of 100 pF is mounted at the DC bias point as a bypass
capacitor for stable circuit.
This MMIC exhibits gain of 30 dB, return loss
below -8 dB, saturated output power of 36.1 dBm and
the power added efficiency of 30 % as following figure
2, 3 and 4. The measurement results are satisfied with
the design requirements of BUC companies. Figure 5
and table 1 show 4W power amplifier MMIC and
comparing with specifications of conventional products
output power and the power added efficiency are 30 dB,

36.1 dBm and 30%, respectively. The efficiency is a
good performance against commercial products. We
expect this MMIC to be developed as a manufactured
good by MMIC packaging technology.
Fig. 5. The photograph of MMIC with 3.4mmX2.6mm

Table 1. The Specifications of 4W power amplifier MMICs
Fig. 2. The simulation and measurement data of S-parameter
Acknowledgement
This work was supported by the leading industry of
IT Convergence and equipments of the Chungcheong
Leading Industry Office of the Korean Ministry of
Trade, Industry and Energy.
References
Fig. 3. The measurement output power over temperatures
Fig. 4. The measurement PAE over 13.5GHz to 14.5GHz
3. Conclusion
We successfully demonstrated a 4W power amplifier
MMIC for Ku-band applications. This MMIC is
fabricated using the 0.25 um GaAs PHEMT MMIC full
process. From the measurement, the gain, the saturated
[1] A. Bessemoulin, A 1-watt Ku-band power amplifier MMIC

using cost-effective organic SMD package, 12th GAAS
Symposium, pp. 587-590, Amsterdam, 2004.
[2] A. Dechansiaud, Design of an integrated cascode cell for
compact Ku-band power amplifiers, the 42nd European
Microwave Conference, pp. 1091-1094, Amsterdam, 2012.
[3] C.W. Huang, S.J. Chang, W. Wu, C.L. Wu, and C.S. Chang, A
Ku-band four-stage temperature compensated PHEMT MMIC
power amplifier, Microwave and Optical Technology Letters,
vol.44, no.5, pp.480-485, March 2005.
[4] J.G. Kim, H.M. Park, J.Y. Kim, S.I. Jeon, and S.C. Hong, A 2watt balanced power amplifier MMIC for Ku-band satellite
communications, Microwave and Optical Technology Letters,
vol.42, no.4, pp.342-344, August 2004.
[5] K.K. Ryu, K.B. Ahn, and S.C. Kim, 2W Monolithic Power
Amplifier for Ku-band Applications, 2014 ICEIC, pp. 10911094, Kota Kinabaru, January 2014.
[6] "HMC949," Hittite microwave corporation data sheet, v02.0211.
[7] "ASTRA 2154011," ATML data sheet, 2007.
[8] TGA2510, TriQuint Semiconductor data sheet, 2009.
[9] AM42-0007-DIE, MA-COM Technology Solutions data sheet.
- 414 -
P1-14
Positive Bias Temperature Instability in Solution Processed InGaZn Oxide

Thin Film Transistors
Ji-Hwan Kim1, Eung-Kyu Park1, Min-Ho Park1, Dong-Hoon Lee1, Dawoon Han1
and Yong-Sang Kim1,*
1
School of Electronic and Electrical Engineering, Sungkyunkwan University, Suwon, Gyeonggi

440-746, Korea
E-mail: yongsang@skku.edu
Abstract
2. Experimental
A stabilized indium gallium zinc oxide (IGZO) thin

film transistor (TFT) was obtained by focusing on the
effects of positive bias temperature instability (PBTI).
Positive stress results in a positive shift in the
threshold voltage (VTH). The VTH of initial device was 1
V, while that of device under 3000s bias stress was 8.5
V. The shift is attributed to the electron injection from
the channel into the interface/dielectric traps. The
stress temperature is also considered as an important
factor in threshold voltage instabilities.
Keywords: InGaZn oxide TFT, PBTI, PBS, Stability
1. Introduction
Oxide Thin Film Transistors have been an attractive
research area for the flat panel displays such as active
matrix liquid crystal displays and organic light emitting
diode displays [1]. The stability of oxide TFTs is of
significant importance because of long-term reliability
concern. The effects of bias thermal stress (BTS) on
the degradation of oxide TFTs is the most common
issue. In n-channel MOSFETs, a positive bias
temperature instability (PBTI) has been found to be an
important reliability problem and is widely investigated.
The PBTI degradation in MOSFETS is mainly
attributed to the generation of interface trap states and
fixed oxide charges, and can be thermally and
electrically activated [2-4].
In this paper, the instability and mechanism of nchannel oxide TFTs under bias stress were studied. By
measuring and analyzing the transfer and output
characteristics before and after bias stress under stress
temperatures, the effects of PBTI on oxide TFTs were
studied.
The IGZO solution was prepared by adding

In(NO3)3, Ga(NO3)3 and Zn(Ac)2 powders (form
Aldrich) at a molar ratio of 0.7:0.1:0.2 in 2methoxyethonol and stirring at the temperature of
75 C for 12h. The bottom-gate top-contact (BGTC)
structured IGZO TFTs were fabricated with a
schematic of Si/SiNx/IGZO/Al as shown in Fig. 1. The
Si wafers with a 300nm thick PECVD grown SiNx gate
insulator was used. The IGZO was deposited on SiNx
layer by spin coating. After coating the IGZO layer, the
film was annealed at a temperature of 350 C for 3h on
hot-plate. The IGZO film thickness was adjusted to
about 10~15 nm. The source-drain electrodes, a 100
nm thick Al layer were deposited through the shadow
mask by thermal evaporation. The oxide TFTs thereby
obtained, have a channel length (L) and width (W) of
100 and 1000 m, respectively. Poly (methyl
methacrylate) (PMMA) was used as a channel
passivation layer. The passivation layer prevents the
adsorption of oxygen and water molecules on IGZO
surface. The electrical characteristics were investigated
using 4145B (Agilent). All measurements were done at
room temperature.
- 415 -
Fig. 1. Cross sectional schematic of IGZO oxide

TFTs
ICEIC 2015
3. Results and discussions

Fig. 2 shows the transfer characteristics of IGZO
TFTs where the VGS was swept from -20 to 40 V with
the sweep step of 0.5 V at the VDS of 20 V. From the
experimental data, a field-effect mobility (FET) of 1.02
cm2/Vs, a VTH of 1 V, on/off current ratio of > 107
and sub-threshold slope of 0.9 V/dec can be estimated
for the IGZO TFTs. The inset shows the output
characteristics of IGZO TFTs.
Fig. 4. Transfer characteristics of IGZO TFTs as a
function of PBTS. (Inset: Root (IDS) versus VGS
before and after the PBTS)
Fig. 2. Transfer characteristics of IGZO TFTs.

(Inset: output characteristics)
Fig. 3 shows the transfer characteristics of IGZO
TFTs at the initial and after positive bias stress for
various times. Before the bias stress, device had a
threshold voltage of 1 V and after bias stress time of 10,
30, 100, 300, 1000 and 3000 sec an increased V TH of 2,
3, 4, 5, 6.5, 8.5 V, respectively was obtained. The
transfer curves shifted towards the positive direction.
The phenomenon of the VTH shift can be explained by
using an electron charge trapping mechanism. The
trapped electrons in the interface between the active
layer and the gate oxide by the positive gate bias
reduced the effective applied gate voltage, which
produced a positive shift in the VTH [3-4].
Fig. 4 investigates the effect of various stress

temperatures. The initial device had a threshold voltage
of 1 V and after bias stress time of 1000s at 25, 50, 75
and 100 C the VTH increased to 5.5, 7.5, 8.5, 11 V,
respectively. The above results indicate that the VTH
is primarily due to the trapping of electrons in the traps
located in the interfaces or dielectric layer.
4. Conclusion
We investigated the positive bias temperature
instability in IGZO TFTs. The transfer curves shifted
towards the positive direction after the stress. The
VTH is caused by the trapping of charges in traps
located at the interface and dielectric layers. Also, the
VTH instability shows a strong dependence on stress
bias time and temperatures.
References
[1] J. Y. Kwon, K. S. Son, J. S. Jung, and J. M. Kim, "Botto
m-Gate IGZO TFT Array for High-Resolution AM OLED
Display "IEEE Electron Device Lett. 29, pp. 1309, 2008.
[2] I. T. Cho, J. M. Lee, J. H. Lee, and H. I. Kwon, "Charge
trapping and detrapping characteristics in amorphous InGa
ZnO TFTs under static and dynamic stresses", Semicond. Sci.
Technol. 24, pp. 015013, 2009.
[3] K. Nomura, T. Kamiya, H. Hirono, and H. Hosono,
"Origins of threshold voltage shifts in room-temperature
deposited and annealed a-IGZO TFTs", Appl. Phys. Lett. 95,
pp. 013502, 2009.
Fig. 3. Transfer characteristics of IGZO TFTs as a

function of bias stress time. (Inset: Root (IDS) versus
VGS before and after the bias stress)
[4] J. K. Jeong, H. W. Yang, J. H. Jeong, Y. G. Mo, and H. D.

Kim, "Origin of threshold voltage instability in IGZO TFTs "
Appl. Phys. Lett. 93, pp. 123508, 2008.
- 416 -
P1-15
PET detector with APD pixel array using Edge detection

Jinwoo Kim, Dongha Lee, Jinwook Burm
Dept. of Electronics Engineering, Sogang University
121-742, Sinsu-dong, Mapo-gu Seoul, Korea
burm@sogang.ac.kr
Abstract
This paper presents PET detector with 44 pixel
array using Edge detection. And, Avalanche
photodiodes (APDs) is used in this paper. APDs
operating in Geiger mode has many applications
including single photon detection. This system is
included APD with read-out circuit at VDD of 3.3V, a
12bit counter operating at VDD of 1.8V, the edge
detection of variable inverter, and level shifter from
3.3V to 1.8V voltage. Variable inverters for edge
detection can adjust the response time between 0.5ns
and 5ns. The detectors are fabricated on a 0.18m
CMOS process with thick gate oxide option.
Fig.1 The block diagram of the entire system
2. Circuit architecture
A general quenching characteristics of a Geiger
mode APD is shown in Fig. 2. The characterization of
Geiger-mode avalanche photodiodes operated in gated
mode requires fast rising-edge, well-defined over-bias
pulses, and effective avalanche quenching. [3].
APD
voltage
Keywords: Avalanche Photo Diode, Edge Detection,

Positron Emission Tomography.
1. Introduction
High Bias
Active
Reset
Passive
Quenching
Many applications nowadays employ, for the

detection of very faint optical signals, avalanche
photodiodes instead of photomultipliers, due to the
advantages of solid state detectors (miniature size,
lower voltage operation, higher quantum efficiency,
insensitiveness to magnetic fields) [1]. An avalanche
photodiode (APD) is a highly sensitive semiconductor
electronic device that exploits the photoelectric effect
to convert light to electricity. The APDs are used in
discrete packages made with special processes, and are
often connected to a detection and control electronic
chip [2].
In this paper, we design the circuit of the pixel array
and quenching bias circuits, to count the number of
photons incident at APD. Fig.1 below shows the
configuration of the entire system. In Section 2, we
examined the quenching bias circuit and Geiger-mode,
and in Section 3 describes the simulation results of the
design.
Low Bias
Active
Quenching
Hold-off
time
Fig.2 Timing graph of quenching and reset operation

An APD combined with a readout circuit form a
pixel. By arranging individual pixel, a pixel array is
formed. The edge detection to merge and counted using
a counter. The edge detection is made up of a D flipflop with variable inverter. The variable inverter
adjusts the edge detection time from 0.5 ns to 5 ns. In
addition, in order to use the VDD of 3.3V, it is reduced
to 1.8V through level shifters.
Fig.3 is a circuit that was designed quenching bias
circuit and the APD has been modeled. Using a
variable inverter in order to create a quenching
waveform of the APD as shown in Fig.2, VDD is 3.3V.
- 417 -
ICEIC 2015
VDD=3.3
Read-out, Counter
Vbias1
Pixel
Vbias2
OUT
487 m
APD
Vop
Vbias4
Vbias3
Fig. 3 APD and quenching bias circuit
Fig.4 shows simulation results of (1) the waveform
after the level shifter, (2) voltage of quenching bias
circuit, and (3) APD bias. It can be seen that leaving
the signal from hold-off state stop the breakdown
reaction of APD instantaneous. In addition, it is
possible to see that the voltage changes from 3.3V to
1.8V for digital processing, using a level shifter.
APD
voltage
Quenching
bias circuit out
Level
Shifter out
Fig. 4 APD and quenching bias circuit
4. Conclusion
In this paper, it is a system with a counter for
processing the signal from the APD in 16 pixel. The
results were verified by simulation, when the 0.5ns or
more, both signals of adjacent APD has been
recognized correctly in the two signals counter. It was
designed by controlling the voltage of the inverter Gate
of Edge Detection, as adjustable enough.
Fig. 5 shows the layout of 44 pixel with APD. This
pixel size is 67m 70m (Quenching bias circuit only
67m 20m). The APD layout area is 50 50 m2.
436 m
Fig. 5 Layout of 44 pixel with APD
Acknowledgment
Foundation of Korea (NRF) grant funded by Ministry
of Education (NO.NRF-2013R1A1A2011943). This
work was supported by the Industrial Core Technology
Development Program (10049095, Development of
Fusion Power Management Platforms and Solutions for
Smart Connected Devices) funded By the Ministry of
Trade, industry & Energy. This research was supported
by the MSIP (Ministry of Science, ICT and Future
Planning), Korea, under the ITRC(Information
Technology Research Center) support program (NIPA2014-H0301-14-1007)
supervised
by
the
NIPA(National IT Industry Promotion Agency). This
work was supported by R&D Program of the Ministry
of Knowledge Economy. [K10041135, Development of
Multi-Functional Power Management IC for Smart
Mobile Devices]. This work was supported by IDEC
(IPC, EDA Tool, MPW).
References
[1] G. Andrea, Ivan Rech, and Massimo Ghioni, Progress in
Quenching Circuits for Single Photon Avalanche Diodes,
IEEE TRANSACTIONS ON NUCLEAR SCIENCE, VOL.
57, NO. 6, pp. 38153826, Dec.2010.
[2] F. Zappa, A. Lotito, and S. Tisa, Photon-counting chip
for avalanche detectors, IEEE Photon. Technol. Lett., vol.
17, no. 1, pp. 184186, Jan.2005.
[3] S. J. Dimler, J. S. Ng, G. J. Rees and J. P. R. David,
Capacitive Quenching Measurement Circuit for GeigerMode Avalanche Photodiodes, SELECTED TOPICS IN
QUANTUM ELECTRONICS, 2007, IEEE, pp. 919-925,
July/August 2007.
- 418 -
P1-16

#!"$"

!#

"

$&%
%##

"
%%

')*( #
!+

% &
-

!
, .

% % %

'0)/(
$& )*

%%
1
"% '233( & .%

&
)* $& %% )*
# 4 5!+
67 5!+ ,&
77 %8+9;
:9;
%.# 4#< $& &

7=##
74>#):/

& # %

!#%
$"
'

&
'

$'()'*$
' # $
$

$+ *'("
$
# $
+ #%
$ "
$ '
$ ! ' $( , #%
'
$# '$$ ' $$
'

'
'(
,
'#"-
#+
'

''$()
' '

' /.
'

$
#

$( )
' '

$
'$
' ( ' $
' /.' + $$' '

/.(

'
'$''
$$
$'' # '
% + /. ' #%
#

'( 0

'

#%

( $ '

+' /")21 '
'
#

/.,31
(

)$*$-,$)++

"( 4 ' ' + #

(" + "
!
/.'
$
/.,31
# " '
-# /.# ! $''
#( & ' $' +
+
$ '
!( , $ $
'$
%' % $
'$
+'
' /.'( )
' $+
$$'''
$(
(
)$(." ,
)

& /.
'
'
(& $ '
#%
# ''
'
$ #

$ '
"( 5 ' ' + # $$' (

& '
46 +' ' $ +
- 419 -
ICEIC 2015

##
$$*

'(& '
'$#+46+
'
#

'

$ /.(
/.0210+$

& '$'%
$ '
'( & ' ! # ' '$
%
'
+ '
$
''$

$*(
' '%' $ '#%

$/.''
(& '
+'

!7.3 #

#

'
$ 7.3

$'(
)
'$#$
$
'#!
$ '
' ( & '
$$*
' +

$(

34-

& '
' ' '

"( 8(
'
' # #%
$( 9 *' '
'
+' #

: *' ' #%
( & ' ' ' '

$'$+
'
+'("(8
+ ' ' $ #%
# ' $
$
# ( "' #%
'
' +
'
+'( ,#
#%
'

+#

$*
(
& '#'

;(4< =7.3$''
4(< / '$$ * +' $' ;(46
5
$
#%

#4(<?+>'
@(; ?+>'( & $ '
' ' 4;; >0- 4 70-
##'
$
'$
'AB(<C(
5
&
# '$

' '

' $$( & ' '
$
$ ' $$' $

'$

$ '-( )
' $

'$
#'+A;D$
$(,
'-'+6;D $
$(
#$-
& ' ' '$$ + 2
'
"

# E 2"
#
+ 7
'
# 1
2.(2" 5;484,4,5;44FA8( & '
''$$+ )
'&

+
)$/21",6 #!
"$
''$$+ )
'&

$
! 4;;AF;F6 G$
#
"'
!7

!#'
3
'#
3
'H#
7
'#
&
'I1
(& '' ''$$
+ 73)! 7
' # 3
)&
"
!

E
)& )
#

&
'
'$$$2)!,
5;4A 0;8;4 4A 4;;B '$' + 2)!,
2
)& )
' !
,
( & '
' '$$ + I ! # 7
' #
E
1
( JE4;;A4486 $
#
7 "

! 7

) # 3
7+ 'K( & ' ' ' '$$ +
)1)!1,&7!C(
,
J4K 3

3
( 3
7
! G, A ?+>' 7.3

L'
4><
&
%H@A/ *B?3/2/3@$?$)@*) @$
!+' /.(8<2.(B 5;;8(
J5K
'+3

G4(6 F(B?+'$A
!,73
&
' C"%

H @@) $*?B 3)$*/B /.(1F@ 2.(<
,'5;48(
- 420 -
P1-17
A 0.18 m CMOS 12-bit 1500S/sSAR ADC for Temperature Sensor

Jinyoon Jang and Jinwoo Kim and Jinwook Burm
Dept. of Electronics Engineering, Sogang University,
Mapo-gu, Seoul, 121-742, Korea, +82-2-714-6205
burm@sogang.ac.kr
Abstract
A success approximation register analog-to-digital
converter (SAR ADC) is designed for low power
temperature sensor applications. To meet the
requirements of temperature sensors requiring a high
resolution and a low power consumption, but not a high
sampling rate, SAR ADC structure is utilized. To
enhance the resolution of SAR ADC, we proposed a
common-mode reset switch. The digital and analog
block of the ADC was fabricated in a 0.18m CMOS
process. The results of simulation shows SNDR of
69.41dB (ENOB 11.23bit) and the power consumption
of 53 W.
positive side MSB switches are set to VREFP(VDD)

and other side VREFN(GND). When the input are
sampled and held at the sample switch, MSB capacitors
sample input voltage levels. The comparator (Fig 1.)
compares the levels of two inputs to produce an output.
Fig. 2 shows the timing diagram of the SAR ADC.
Keywords: Common-mode reset switch.
1. Introduction
SAR ADCs (success approximation register
analog-to-digital converters) advantage is low power
consumption. Nowadays, a lot of applications need low
power operation and high accuracy. Especially,
temperature sensor does not need high speed operation,
because the temperature slowly changes, but it needs
high resolution operation. Instead of low power
consumption and low operation speed, we need high
SNDR (ENOB). And we achieve this purpose by
correction the input common mode level of the amplifier
at comparator. The mismatch of VCM level at positive
input and negative of amplifier lowers the ENOB of
SAR operation. So it needed to make right common
mode level and it is possible by add the switch circuit
between positive side CAP array and negative.
2. SAR ADC structure

Fig.1 shows the conventional SAR ADC with
common mode based structure. It has 12 sampling
capacitors without a split capacitor. It has binary
weighted capacitors with the unit capacitance of 21.25
fF. The MSB capacitance is 43.52 pF. In the operation,
Figure 1. Structure of common mode based

conventional SAR ADC
Figure 2. Operation of the proposed SAR ADC
3. Common-mode reset switch structure

If the common mode level (VCM) at the both positive
and negative input are not the same, the error occurs at
LSB decision. Because the proposed structure has
0.58mV for 1 LSB, a little difference even a few mV
between the positive and negative inputs of amplifier
(comparator) makes the wrong decision of LSB data.
Therefore we add the extra switch between amplifier
input, and it makes the average value of both input
common mode voltage. Fig. 3 shows our proposed
technique.
- 421 -
ICEIC 2015
Property
Proposed Structure
SNDR
69.4118dB
ENOB
11.3643bit
POWER
53W
CONSUMPTION
Table 1. Simulation result
5. Conclusion
Figure 3. Common mode averaging switch structure

And it is robust against the effect occurred by parasitic
capacitance between sampling capacitors. To calculate
Vx at Fig. 3,
Cparasitic = CP1 + CP2 ++CPn
Vx = Vsampled Cparasitic /(C1 + Cparasitic)
where CPi is the parasitic capacitance of each i-th
capacitor in Fig. 3 and C1 is the total capacitance. By the
calculation, the input common mode voltage is
increased Vx. The parasitic capacitance are always
added to the sampling capacitance.
Figure 4. Shows the simulation result with differential
input swing range 1.2Vpeak-to-peak. Output signal has
69.4118dB and ENOB is calculated by SNDR, is
11.3643dB.
Our design achieves power consumption 53W and

improve the SNDR upper 60dB to make ENOB larger
than 11bits.
6. Acknowledgment
Foundation of Korea (NRF) grant funded by Ministry of
Education (NO.NRF-2013R1A1A2011943). This work
was supported by the Industrial Core Technology
Development Program (10049095, Development of
Fusion Power Management Platforms and Solutions for
Smart Connected Devices) funded By the Ministry of
Trade, industry & Energy. This research was supported
by the MSIP (Ministry of Science, ICT and Future
Planning), Korea, under the ITRC(Information
Technology Research Center) support program (NIPA2014-H0301-14-1007)
supervised
by
the
NIPA(National IT Industry Promotion Agency). This
work was supported by R&D Program of the Ministry
of Knowledge Economy. [K10041135, Development of
Multi-Functional Power Management IC for Smart
Mobile Devices] This work was supported by IDEC
(IPC, EDA Tool, MPW).
References
Figure 4. Transient Response of both input of

comparator
1] Gilbert Promitzer, 12-bit Low-Power Fully Differential

Switched
Capacitor
Noncalibrating
Successive
Approximation ADC with 1MS/s, IEEE JOURNAL OF
SOLID-STATE CIRCUITS, VOL. 36, NO 7, JULY 2001.
[2] Naveen Nerma, Student Member, IEEE, and Anatha P.
Chandrakasan, Fellow, IEEE, An Ultra Low Energy 12bit Rate-Resolution Scalable SAR ADC for Wireless
Sensor Nodes,, IEEE JOURNAL OF SOLID-STATE
CIRCUITS, VOL. 42, NO. 6, JUNE 2007.
[3] Wenbo Liu, Member, IEEE, Pingli Huang, Student
Member, IEEE, and Yun Chiu, Senior Member, IEEE,
A 12-bit, 45-MS/s, 3-mW Redundant Successive
Approximatio-Register Analog-to-Digital Converter
With Digital Calibration,, IEEE JOURNAL OF SOLIDSTATE CIRCUITS, VOL. 46. NO. 11, NOVEMBER
2011.
- 422 -
P1-18

! !
! #
"
!

!#

"

!

%'
&!
$& () *' ''
#
+, )./ -#
%'
& () '
#
&
&1
'''. 0'

'#%'*

!
&

! 23# )./ (
#
&
,& 4+,5 6
&
&

!&&*'87&69:
&8&6
;:%' '&())./#

*#
"
72
#+!

%& !$
! !!" " !
" !! :!

!$ $!$ ! , $ "$ !! !$ ( %
!$ " % ( & ' " %

'"$"
% "$" "!$ %%! %%!
! "$ " & 5$% ! %% "! ! "!"$ !$
%" ! !$ ! !!& 5$ ! !! "
" "!

$( !$ %%!
%!$! !!$ $ &
'" ! (

#"!
!$ " " !
!
% ! % !$ & '!
( "! "$ "&
) *+ "" ( , !
!$ "!
.-/&
' !$ !$ -1 ! 20
!$ $ $ % " 34 ! %
!$
"" ! "$ " & 5$
6 % & "! 1 , !$ (
"$ !"! % !$ & "! 7
, !$ % !$
&"! 8, !$ ! !&
"! 2 !$" " &
' #
!! (!

*'9 &-+ " %
" " ! " ! , ,

&$ 9 &-!$

)(! ' #
! ! (! (

*'"

9 1$ "" %!
*+
% 34& 5 " " ! ! ) !
"$ !"! % % &
5$ ! % "$ ! 7&2 ! ,"! !$ !
! $ !$ ! 8 !& 5$ ! ! !! %
!$! ! !!$-1 !&
5$! " " ! %!$34 $ 9 7&9
7*+ $ !$ " "! !! (% % !$
- 423 -
ICEIC 2015
)(!'+ ,!

)(!2'

(

-.-.
)(! *' -. / ! ' -. #0
(1

!! " " !& 5$ !$! !$ !"$
!$% ,!) !"&"!$!) "
( ! ! (
! %!$ &5$
!$ !
%!$ !"$5$ " %
!$ "$ ;"! & 4 $ !

" !$ !! " %!$ % .1/&
9 7* + $ !$ ! % & 4 $
!
" !$ !! !" %
!$ % &9 "" !"!
!
! $ $ !! " !$ !"
!"!&
2'
( 3(

5$34 !! ( $ 9 8&5$
! "" ! ! !$! ! !$ <
: !&
5$9 2 $ !$995 %34&
' (

5 -$ !$! % !$4 $
% "34%
!$ &34" " ! !!" " !
! ! 6 % >8&=1 <#
>?&?? 9#& -1) ! 203
$ 21&>@<#2=&=@9#&5$ %
!$ !$
%! %-=0%3&
,
5$ !
!$ <! #"$
9 ! % A *<#9+ ! %
!

% B"! *<&<#9)10-7#--10--@87+& 5$
-.-.
)(!'-.))+
'-.))+

+$! !(!&
5"$

# !
#!
<#*34+
<#*+

% !
9
0&--C
-1 !
203
>8&=1
21&>@
=808>0*D+
-=0%3

!
!$'! 5"$

( ! *-008@0@2 E( ! %
9 !!% ! %
! "!( "F+%
!$ !
%
5 !
GB
&5$ "$ !
!$ '* !

% " " '5 9!
+ A !$ '5# *'% !
5"$
#"$!+ ! *<')
10-8)4070-)-8)-00?+
(

!$
<'*<! '5 '!
! "
+ 5$
!
#G %!$ !

%A B"
&.A-008--72( ! %
! )9"! ! ' % !
( "/ & 5$ !
'B
*'B5 H+&
3!
.-/ ' $
! & 180)%3 1&-) ,
!$ " )$ "
" " &
)!! " !'BBB %10--8=&@I10?7)10>7&
.1/&J#K#&-&2)D-0) !-8&7)
3 )! ) !" (!& )!!
" !'BBB %-@@@78&2I2@@)=0=&
- 424 -
P1-19
Effects of Miller Capacitance on AC switching characteristics of tunnel fieldeffect transistor (TFET)

Dae Woong Kwon, Hyun Woo Kim, Jang Hyun Kim, and Byung-Gook Park
Inter University Semiconductor Research Center (ISRC) and
School of Electrical and Computer Engineering, Seoul National University
dw79kwon@snu.ac.kr
Abstract
In this work, the relationship between fall/rise delay
and tunneling current is investigated in a TFET
inverter using TCAD simulation. Though tunneling
current is continuously increased, the extent of fall/rise
delay improvement is gradually reduced. These
phenomena are related to the occurrence probability
of Miller effect, which induces the increase of gate-todrain capacitance.
Keywords: tunnel field-effect transistors (TFETs),
Miller capacitance, AC switching performance.
1. Introduction
Even though supply voltage (VDD) has been
successfully reduced with continual miniaturization of
complementary metaloxidesemiconductor (CMOS)
devices, it is no longer sustained for sub-45-nm due to
short-channel effects (SCEs) and subthreshold swing
(S) limitation. Recently, inter-band tunnel field-effect
transistors (TFETs) have been extensively investigated
because it can achieve sub-kT/q S at room temperature
and enable further VDD reduction for low-power logic
applications [1]. However, the previous works on
TFETs has mainly focused on device level direct
current (DC) transfer characteristics and not on circuit
level alternating current (AC) switching performances.
In this paper, we analyze the abnormal large-signal
switching behaviors such as long fall/rise delay of
output voltage (Vout) in the transient response of a
TFET inverter. Furthermore, the relationship between
fall/rise delay and its drive current is rigorously
investigated.
The device structure and physical parameters of
TFET used in this simulation study are shown in Fig.1.
All the simulated devices have the planar structure
with Si body thickness of 20 nm, physical gate
length/active width of 100 nm, HfO2 gate dielectric
thickness of 2.5 nm, S/D doping of 11020 cm-3, and

body doping of 11017 cm-3 for minimizing shortchannel effects. Also, transient responses of TFET
inverters are simulated for an input step voltage with a
peak-to-peak voltage of 0.8 V and a rise time of 1 ns.
Here, load capacitance (CL) = 4 10-15 F are used.
Figure 2 shows the increase of tunneling currents in
n-/p-channel TFET (nTFET/pTFET) by increasing
Kane parameter A strongly related with tunneling rate
[2]. Additionally, Figure 3 indicates that fall delay of
TFET inverter gets shortened as Kane parameter A
becomes lager throughout input ramping and then
holding. However, it should be noted that the extent of
fall delay improvement is gradually reduced although
tunneling current is continuously increased.
In order to investigate the cause of the improvement
reduction, gate-to-drain capacitances (Cgd) of TFETs
with various Kane parameters A are firstly checked.
Expectedly, Figure 4 presents that the effect of
tunneling current on gate-to-drain capacitance is
negligible since Cgd is dominantly determined by
channel-to-drain side energy barrier [3].
Consequently, the occurrence of Miller capacitance
is confirmed. As shown in Figure 5, Miller effect can
occur in a TFET inverter because input signal and Vout
can be moving simultaneously in the opposite
directions while input signal is ramping [4]. The inset
of Figure 4 demonstrates that the probability of Miller
effect occurrence get higher as tunneling current
becomes increased. Therefore, it is clearly concluded
that the improvement reduction of fall/rise delay is
mainly attributed to higher occurrence probability of
Miller capacitance as tunneling current gets increased
and thus fall/rise delay becomes shortened.
3. Conclusions
We investigate the effects of tunneling current on
fall/rise delay of TFET inverter. By increasing Kane
parameter A strongly related with tunneling rate, it is
found that improvement reduction of fall/rise delay is
mainly attributed to higher occurrence probability of
Miller capacitance as tunneling current gets increased.
- 425 -
ICEIC 2015
Acknowledgement
Inverter characteristics
[1] W. M. Reddick and G. A. J. Amaratunga, Silicon

surface tunnel transistor, Appl. Phys. Lett., vol. 67, no. 4,
pp. 494496, Jul Jul. 1995.
[2] K. H. Kao, A. S. Verhulst, W. G. Vandenberghe, B.
Sore, G. Groeseneken, and K. De Meyer, Direct and
indirect band-to-band tunneling in germanium-based
TFETs, IEEE Trans. Electron Devices, vol. 59, no. 2, pp.
292301, Feb. 2012.
[3] S. O. Koswatta, M. S. Lundstrom, and D. E. Nikonov,
Performance comparison between p-i-n tunneling
transistors and conventional MOSFETs, IEEE Trans.
Electron Devices, vol. 56, no. 3, pp. 456465, Mar. 2009.
[4] S. Mookerjea, R. Krishnan, S. Datta, and V. Narayan,
On enhanced Miller capacitance in inter-band tunnel
transistors, IEEE Electron Device Lett., vol. 30, no. 10,
pp. 11021104, Oct. 2009.
A_(1e14)
A_(1e17)
1.0
0.9
A_(1e15)
A_(1e18)
A_(1e16)
Gate_Bias
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0.0
10
20
30
40
50
Time [ns]
Figure 3. Output voltage changes of TFET inverters

with various Kane parameters A.
-15
10
CGD-VG Characterisitcs @ nTFET

A_(1e14)
A_(1e15)
A_(1e16)
Frequency : 1kHZ
1.1
Input/Output voltage [V]
References
Capacitance [F]
This work was supported by the Brain Korea 21

Plus Project in 2014 and by the Future Semiconductor
Device Technology Development Program (10044842)
funded By MOTIE(Ministry of Trade, Industry &
Energy) and KSRC(Korea Semiconductor Research
Consortium).
Input/Output voltage [V]
1.1
-16
10
0.5
0.9
0.8
0.7
0.6
0.5
0.4
Output falling
Input rising
0.3
0.2
0.1
0.0
T im e [ns]
-17
10
In verter ch aracteristics
1.0
1.0
1.5
2.0
Gate voltage [V]
Figure 1. Device structure and parameters used in

mixed-mode device and circuit simulations.
Figure 4. Gate voltage (VG) versus gate-to-drain

capacitance (CGD) curves of TFETs with various
Kane parameters A. (Inset) Enlarged output
voltage changes which explain occurrence
conditions of Miller capacitance.
Drain current [A]
I -V Characterisitcs @ n/pTFET
D
G
-1
10
-2
10
A_(1e14)
A_(1e15)
A_(1e16)
-3
10
A_(1e17)
A_(1e18)
-4
10
-5
10
-6
10
-7
10
-8
10
-9
10
-10
10
-11
10
-12
10
-13
10
-14
10
-15
10
-16
10
-0.7 -0.6 -0.5 -0.4 -0.3 -0.2 -0.1 0.0 0.1 0.2 0.3 0.4 0.5 0.6 0.7
Gate voltage [V]

Figure 2. Transfer characteristics of n/pTFET with
various Kane parameters A.
Figure 5. Circuit diagrams of TFET inverter which

show occurrence of Miller effect in pull-down
condition during input signal ramping.
- 426 -
P1-20
Stability enhancement of IZO thin film transistor using SU-8 passivation

layer
Sang-jo Kim1, Ji-hoon Shin2, Yong-jin Im1, Seung-soo Ha2, Chan-hee Park1, Moonsuk Yi1
1
Department of Electronic Engineering, Pusan National University, Busan, Korea
Department of Electrical and Computer Engineering, Pusan National University, Busan, Korea
E-mail address: msyi@pusan.ac.kr
Abstract
In this work, SU-8 passivated IZO thin-film
transistor(TFT) made by solution processes is
investigated for enhancing stability of indium zinc
oxide(IZO) TFT. A very viscous negative
photoresist SU-8, which has high mechanical and
chemical stability, was deposited by spin coating
and pattered on the top of TFT by photo lithography.
To investigate the reason of enhanced electrical
characteristics especially in positive bias stress(PBS)
by SU-8 passivation layer, the TFT device was
analyzed by X-ray photoelectron spectroscopy(XPS)
and Fourier transform infrared spectroscopy(FTIR).
The TFTs with SU-8 passivation layer show good
electrical characteristics, such as FE=6.43cm2/Vs,
VTH=7.1V, ION/OFF=106,
SS=0.88V/dec, and
especially 3.6V of VTH under PBS for 3600s. On
the other hand, without SU-8 passivation, VTH
under PBS for 3600s was 7.7V. XPS/FTIR analyses
results showed that SU-8 passivation layer prevents
significant oxygen desorption/adsorption process.
This feature makes the effectiveness of SU-8
passivation layer for PBS.
Keywords: Passivation, Solution, Oxide-TFT, SU-8
In recent years, solution-processed amorphous

oxide thin-film transistors such as indium zinc
oxide(IZO) and zinc tin oxide(ZTO) have been
widely
investigated[1].
Amorphous
oxide
semiconductor materials are supposed to replace the
conventional amorphous Si as channel material, but
the instability during bias stress is considered as
one of main issues to be solved for product
applications [2]. In this study, a negative photoresist
SU-8 is used as a passivation layer to solve the
problem.
Fig.1. Schematic of passivated TFT device
Fig.2. Transfer characteristic curves of IZO TFTs at different stages
To analyze the effect of SU-8 passivation layer

onto IZO TFT, 5 stage processing procedures are
applied. 1st stage is to fabricate IZO TFT, postannealing was applied on IZO TFT at 200G at 2nd
stage, SU-8 is coated on IZO TFT at 3rd stage, hard
baking step was appliedd at 200G at 4th stage.[3]
Finally, one hour of hard baking was applied at 200
at 5th stage after 4th stage.
When SU-8 was coated on IZO TFT at 3rd stage, a
new interface of SU-8/IZO was introduced and the
IZO TFT didnt have semiconductor characteristic
because of an increased carrier concentration
imported from unused epoxy rings of SU-8. After
200 hard post-annealing at 4th and 5th stage, IZO
- 427 -
ICEIC 2015
TFT has recovered its semiconductor characteristic.

In this step, hard baking step expedited additional
cross-linking by consuming the unused epoxy rings,
causing a larger polymer network.[3] Figure 2
shows the transfer curves of TFTs at each different
stages.
FTIR results shown in Fig. 3 show that the crosslinking of unused epoxy rings is not completed at
the 3rd stage, but it was completed at 4th and 5th
stages. Comparing the stages of 4 and 5, the IZO
TFT has low Ion/off ratio at 4th stage compared with
5th stage. Ion/off ratio increased from 102 to 106 as in
Fig .2. The difference of off-current at the stages of
4 and 5 was explained by the XPS results shown in
Fig. 4. The less oxygen vacancy peek at 531.9 eV of
5th stage compared with 4th stage shows that one
hour of hard baking at 5th stage decreased the
unoccupied oxygen bonding and consequently
decreased the off-current of IZO TFT.
Fig.5. ID-VG Transfer curves of (a) 1st stage, (b) 5th stage IZO TFT as a
function of PBS time
After 5th stage processing, IZO TFT has been

stabilized under PBS by SU-8 passivation layer as
shown in Fig.5. Highly dense SU-8 layer prohibits
crucial oxygen desorption/adsorption processes, and
this characteristic makes the validity of SU-8
passivation layer under PBS condition.[3] After 2nd
stage (post-annealing without SU-8 layer), IZO TFT
has good electrical characteristics except for
mobility compared to 1st stage. But the PBS
stability of 2nd stage IZO TFT was worse than 1st
stage IZO TFT. IZO TFT in 5th stage has good
electrical characteristic for PBS as depicted in Fig.
5 and also showed good electrical characteristics
such as FE=6.43cm2/Vs , VTH=7.1V, ION/OFF=106
and subthreshold swing (SS)= 0.88V/dec and VTH
is 3.6V under PBS for 3600s.
References
[1] D.-H. LEE, Y J Chang, G. S. Herman and C. H.
Chang, A General Route to Printable High-Mobility
Transparent Amorphous Oxide Semiconductors, Adv.
Mater. 19, 843 847(2007)
Fig. 3. FTIR absorption spectra of SU-8 films on top of IZOs. The peak
at 915cm-1 used to evaluate the degree of polymerization of the SU-8
passivation film
[2]JP Bermundo, Y Ishikawa, H Yamazaki, T Nonaka,

and Y Uraoka, Highly Reliable Polysilsesquioxane
Passivation Layer for aInGaZnO ThinFilm Transistors
ECS J. Solid State Sci. Technol. 3, Q16, (2014)
[3] A. Olziersky, P. Barquinha, A. Vila, L. Pereira, G.

Goncalves, E. Fortunato, R. Martins, J. R. Morante,
Insight on the SU-8 resist as passivation layer for
transparent Ga2O3-In2O3-ZnO thin-film transistors,
J.Appl. Phys. 2010, 108, 064505(2010)
Fig.4.O1s spectra for (a) stage 4 (b) stage 5. IZO TFT is fitted to
three nearly Gaussian distribution located at 529.9, 531.9(oxygen
vacancy), 532.9 eV respectively
- 428 -
P1-21
Small Headroom Current Mirror with High Accuracy

Ho-Joon Kim, Jae-Koo Park, Kee-Won Kwon
College of Information and Communication Engineering, Sungkyunkwan Univ.
mist5972@skku.edu, keewkwon@skku.edu
Abstract
We propose a 3rd order current mirror that has
smaller output voltage headroom than other 2nd order
current mirror. We could improve the headroom by
0.7V which is the amount of threshold voltage of the
NMOS transistor by lowering drain-source voltage of
the current copying transistors. In addition, it also
could copy the current more precise than conventional
one. Therefore, it provides more margins on the output
node in the low voltage circumstances.
However, there is mismatch between the drain voltage

of M1 and M2, and this makes an error in copying
current as described follow:
(1)
(2)
(3)
and the drain
The drain voltage of M1 is
voltage of M2 is
so there is an error caused by this
mismatch.
Op-amp part
Keywords: current mirror; voltage headroom; output

impedance; accuracy; regulated active feedback
Iref
Iref
Iout
Iout
M8
M9
M5
M6
M7
1. Introduction
The current mirror is a decisive element in analog
integrated circuits, since its accuracy limits the overall
performance of them. A cascode current mirror can
improve the accuracy by raising its output impedance,
but output voltage headroom must be sacrificed as each
cascaded transistors need overdrive voltages to operate
properly, so they are trade-off. A current mirror with
regulated active feedback improves output impedance
and accuracy without additional cascaded transistors,
so there would not be extra headroom [1]. However, its
headroom is still large. In this paper, we propose a
small headroom current mirror circuit by modifying the
regulated cascode current mirror.
2. Analysis of the conventional circuit and

the proposed circuit
Fig. 1. (a) is simple current mirror and it works as
following mechanism. The input current generates the
gate voltage of M1, and the connection between the
gate of M1 and M2 makes the gate voltage of M2 same
as the gate voltage of M1. If the drain voltage of M2 is
higher than overdrive voltage, this circuit generates
output current as the saturation current of M2.
M1
M2
(a)
M3
M4
M1
M2
(b)
Fig. 1. (a) Simple current mirror

(b) Regulated active feedback current
mirror
Fig. 1. (b) is the regulated active feedback current
mirror, the conventional circuit of this paper, and it
resolves above problem by following idea. There is an
op-amp part marked by circle, and the positive input of
this op-amp is connected to the drain of M1 and the
negative one is connected to the drain of M2, so
voltages of two drain nodes will be equalized by virtual
short effect of the op-amp, and their voltage level
would be
, so the mismatch problem between
the drain voltage of M1 and M2 is solved.
There is additional advantage of this circuit, its high
output impedance and accuracy, and the output
impedance can be calculated as
- 429 -
(4)
(5)
ICEIC 2015
The eq. (2) can be rewritten as,
(6)
(7)
As mentioned above, the regulated active feedback
current mirror has quite large output impedance and
accuracy, yet it has limited range of output voltage
swing. Its output voltage headroom can be calculated
by following.
(8)
This level is quit high because of
whose level is
about 0.7V, so we cascaded an NMOS transistor above
M1 and biased the gate voltage with
to
ensure the drain voltage of M1 as
, then we altered
op-amp whose input transistors are PMOS which could
have lower gate voltage than NMOS.
Op-amp part
Vp
M11
M10
Iref
M7
M8
Iout
Fig. 3. I-V curves of the simulation result
Fig. 4 represents errors of two circuits in copying

current in the range between 10 and 1mA. Likewise,
the dotted line represents the result of the regulated
active feedback current mirror and the solid line is the
result of the proposed circuit. It turned out that the
proposed circuit is more accurate, and it has wider
input current coverage either.
M9
M6
M3
Vb
M4
M5
M1
M2
Fig. 2. Proposed circuit

Fig. 2 represents the proposed circuit. M3 is
cascaded on M1, and changed op-amp is used. The
drain voltage of M2 becomes
by virtual short effect
of the op-amp, and the output voltage headroom is set
in
.
The simulation was based upon 0.35
BiCMOS
process with 3.3 supply voltage using HSpice tool on
the Linux background. Fig. 3 shows the I-V
characteristics of the simulation result. The dotted line
is the result of the regulated active feedback current
mirror and the solid line is the result of the proposed
circuit. It is clear that proposed circuit has smaller
output voltage headroom than the regulated active
feedback current mirror.
Fig. 4. Error in ppm
4. Conclusion
From the simulation result, it is turned out that the
proposed circuit can copy currents less sensitive to the
output voltage, and it can also copy wider range of
input currents with ensured accuracy. The main
advantage of proposed circuit compared with the
regulated active feedback current mirror is that it has
wider output voltage swing range in about 0.7V.
Therefore it can provide more voltage margins on the
output node and it is suitable in the low voltage
circumstances.
Reference
[1] A. Zeki and H. Kuntman, Accurate and high output
impedance current mirror suitable for CMOS current output
stages, Electronics Letters, Vol. 33, pp. 1042-1043, 1997.
- 430 -
P1-22
Investigation of bias-stress-induced instability in graphene field-effect transistor

using new polymer-free transfer method
Hamin Park, Ick-Joon Park and Sung-Yool Choi
Department of Electrical Engineering and Graphene Research Center, Korea Advanced Institute of
Science and Technology (KAIST), 291 Daehak-ro, Yuseong-gu, Daejeon 305-701, Korea
Phone: +82-42-350-7427, E-mail: sungyool.choi@kaist.ac.kr
These authors equally contributed to this work

Abstract
We propose a polymer residue-free transfer
technique for CVD-grown graphene transfer to ensure
the intrinsic electrical properties of graphene for high
performance transistor applications. The electrical
characteristics and reliability of graphene field-effect
transistor (GFET) are evaluated through a negative
bias-stress-induced instability measurement.
persulfate solution (APS) to reduce the thickness of

layer. Then, the layer was moved to isopropyl alcohol
(IPA) to be sink into solution for inverting the layer with
graphene downward. After a dry and an annealing to
enhance the adhesion between graphene and SiO2,
copper was removed using 10:1 mixed etchant, which
was made of IPA and 0.1 M APS. IPA was mixed to
prevent peeling off of graphene from the substrate by
reducing surface tension of the etchant [3].
Keywords: graphene transfer, graphene field-effect

transistor, bias-stress-induced instability
1. Introduction
Graphene transfer has been achieved using a polymer
supporting layer to prevent folding and tearing of
graphene during the transfer process. The most
commonly used polymer material is polymethyl
methacrylate (PMMA) [1]. The polymer supporting
layer is removed after the polymer-graphene layer is
transferred to target substrate. However, polymer
residues remain on a graphene surface. These residues
make graphene far from its intrinsic property and have
negative effects to applications [2].
In this paper, we report a new polymer-free transfer
method that use copper catalyst metal as a supporting
layer. The usage of catalyst metal as a supporting layer
enables avoiding a graphene from the contact with
polymer material and there become free of polymer
residue on a graphene surface after transfer process. In
addition, GFETs were demonstrated. Then, a transfer
curve and negative bias-stress-induced instability were
measured.
2. Experimental
The proposed transfer process had been achieved by
the process shown in Fig. 1(a). After the delamination
of graphene-copper layer without polymer supporting
layer, copper layer was weakly etched using ammonium
Fig. 1(b) shows the optical image and Raman

spectrum of graphene film transferred to SiO2 substrate.
The optical image shows that there was no void or
folded part on the graphene film with full coverage.
Raman spectrum shows 2D/G intensity ratio of ~ 2 and
a negligible D peak intensity.
The cross sectional view of the GFETs is shown in
Fig. 2(a). 25 nm/55 nm thick palladium/gold (Pd/Au)
and 10 nm/55 nm chromium/gold (Cr/Au) were
thermally evaporated as source/drain electrodes and
gate electrode, respectively. 24 nm thick aluminum
oxide (Al2O3) was deposited using atomic layer
deposition (ALD) as a top-gate dielectric.
Fig. 2(b) and the inset of Fig. 2(b) show the transfer
curve and transconductance of GFET. Carrier mobilities
were extracted from the following equation.
g
=

The hole and electron mobilities of the GFET device
were 1088 cm2V-1s-1 and 476 cm2V-1s-1, respectively.
The reliability of GFET is one of important issues for
practical applications. We measured negative biasstress-induced instability of GFETs. In GFETs, the biasstress effect is commonly described in terms of a Dirac
voltage shift [4-6].
The time-dependent change of Dirac voltage was
measured under the gate bias stress magnitude of -6.5 V.
Fig. 3(a) shows the linear plot of transfer curves which
were shifted to negative direction with an increase of a
- 431 -
ICEIC 2015
stress time. However, the slope of the transfer curves
were more or less constant during the applied bias
stresses.
In order to quantify the time-dependent Dirac voltage
shift, we used the following stretched-exponential
model:
= _0 (1 ( ) )
where _0 is the Dirac voltage shift at infinite
time, is the characteristics time constant, and is
the stretched-exponential exponent ( 0 < 1 ),
indicating the width of the involved trap distribution.
Fig. 3(b) shows that the Dirac voltage shift against
negative gate bias stress time is well fitted by the
stretched-exponential model. The obtained and
values are 165 s and 0.73, respectively, different with
other reports due to the lack of polymer residues in our
graphene. It is well-known that the residues increase
trap site density at the interface between graphene and
gate dielectric [6-7].
4. Conclusion
In summary, we propose a new polymer-free transfer
method without polymer residues on a graphene surface.
We fabricated GFETs using this method and measured
the transfer curve and negative bias-stress-induced
instability. We used stretched-exponential model and
extracted (165 s) and (0.73) values which are
different with previous reports. This difference comes
from a lack of polymer residues which act as trap sites
at the interface between graphene and gate dielectric.
Acknowledgements
We acknowledge the financial supports from Global
Frontier Research Center for Advanced Soft Electronics
(2011-0031640), and the Nano-Material Technology
Development Program (2012M3A7B4049807).
Fig. 1 (a) Process steps of new polymer-free transfer

method. (b) Optical microscope image. The inset
shows raman spectrum of transferred graphene.
Fig. 2 (a) Schematic of GFET. (b) Transfer curve.

The inset shows the transconductance.
Fig. 3 (a) The transfer curves of GFET under a

negative gate bias stress condition. (b) Time
evolution of the magnitude of . The time
dependence of is well described by a
stretched-exponential model.
References
[1] X. Li, et al. "Transfer of large-area graphene films for highperformance transparent conductive electrodes." Nano
letters 9.12 (2009): 4359-4363.
[2] A. Pirkle,et al. "The effect of chemical residues on the
physical and electrical properties of chemical vapor deposited
graphene transferred to SiO2." Applied Physics Letters 99.12
(2011): 122108.
[3] H.W. Lin, et al. "A Direct and Polymer-Free Method for
Transferring Graphene Grown by Chemical Vapor Deposition
to Any Substrate." ACS nano8.2 (2014): 1784-1791.
[4] W. J. Liu, et al. "Positive Bias-Induced Instability in
Graphene Field Effect Transistors." Electron Device Letters,
IEEE 33.3 (2012): 339-341.
[5] Z. Liu, et al. "Large-scale graphene transistors with
enhanced performance and reliability based on interface
engineering
by
phenylsilane
self-assembled
monolayers." Nano letters 11.2 (2010): 523-528.
[6] W.C. Shin, et al. "Seeding atomic layer deposition of highk dielectric on graphene with ultrathin poly (4-vinylphenol)
layer
for
enhanced
device
performance
and
reliability." Applied Physics Letters 101.3 (2012): 033507.
[7] I.-J. Park, et al. "Bias-Stress-Induced Instabilities in PType Thin-Film Transistors." Electron Device Letters,
IEEE 34.5 (2013): 647-649.
- 432 -
P1-23

(&
'
&
'
*+*+
(&
"! $# % !

& (' ) ! "!
% ! *+/-., !
"! (0/ *+(0/, ) (-
*2(-, & ! " *1#,
3 3!3 ! ! !
! /-. & 3 !!
% *$-,
54
-0.2 ! +(0/
6 !
! +(0/ 7458 !:9;6
7<8=!:9;6!7?>@<!:9;6?>;6?>>;6
! ? 0;6 "
! +(0/
3 A4 !: +(0/ ><< B !
& ?%/

!"#
$%

!
"
##"

$
#$ # &%'( ) &%(
# "
!
* + ,
# ,
)&'(
.-"/
*+ 0,# , 1
1 "
$ !

,, ,# $#
&2(
)
## .-"1
! # , ##
/
1 *3 + #
*+ " #
*4+&5(6

)-
, "

#"

'

*+
-%*+7 &'( *+
&8( *+##1

- %*+
$
7 $

# "

)-
"

!

$ #
/ 1
-""9

)-#-
%*+
$

# &8( 0
$- $# "

##

$
$

#

- 433 -
ICEIC 2015
#"0
0/.-
$
#!

, 0$ #"
# $

!

- %*+
$
## 1
, ", - %*+ 0
1

! , #
4 $

/ : #-

"

!
$#$&;(
- 2
$
.- )- $ "

##1 0
## .-
#$ <AB > 0
! !
'8 > 0
"
##
1 " 2%5 E?: 2'@ E?:
-

##
# " , ## "

!!
E 4,
*E4+ ! #
$
$ #$ $
9

)"*,*## ++

22
0!",
#""
##
0 ;8

, - '
$
#

#" "
## 1
0
##1

#

"<8;2>=?: <@2A>=?: <%BC@>=?:
%B ?: %BB ?: % ?: "" "1,
#! ,
22
((- 1
2
2!
2"
2
2
2
2!
2"

2
"

*
!
/

0
#%--.'(. '
"
-50"

##1

*
!

-'4
"
##1

*
+%)%
&$)(% $'

*

*
,-)%

*

"
&%(04F G/ $#$ B%@

H
, I1 0&
! 85 % ##@@A8 'BB;
&'( / G $#$ 1
.- ! "J 0
I 1 C 2!%2
- ! 5% %' ##'@2'<'@5% K'BB;
&2( 4 / / , " %@E?:
1 1C2!%2 -
! 2C %' ##%C2C<%C5C K'BB'
&5(
G/ 4
. 0
1 " .-
F
(-
. I 0 C ! 58 5 ##
52855B /#'B%5
&8(
/ $4$.-.!
-J . 'A

) 0
" =,
# *)0 'B%5+
'B%5 ##%B52 %B55
&;(0L, ?L E)
M E
G $ # " #:

1 I1 0& ! 8'
8 ##%522%55' ,'BB5

#$ %
-20
$
)- .- # .- # #$
DAB>
- 434 -
P1-24
A Proximity-Based Motion Gesture Sensor with a single LED

for Thin Mobile Devices
Jeong Seok Kim and Yong Sin Kim
School of Electrical Engineering Korea University
hanshin06@korea.ac.kr, shonkim@korea.ac.kr
Abstract
In this paper, a proximity-based motion gesture sensor
(MGS) incorporated into thin mobile devices is presented.
The MGS system composed of a single IR LED and
multiple photodiodes requires an optical block that
separates the field-of-view (FOV) of individual
photodiodes. The detection rate of this configuration is
decreased as lowering its height due to the larger overlap
of each FOV and smaller timing margin. At the expense of
an additional electrical component, the proposed
architecture enhances timing margin reduced by optical
performance degradation.
this system is proportional to the timing margin that

depends on the difference between FOV and . The height
of an optical block can be increased, so as to decrease .
However, a tall optical block might not be incorporated
into thin mobile devices. Gray zone is determined by the
dimension of an optical block and can be defined as
T ( L, h) 2 arctan(L / h)
(1)
Where L is the distance between the center of
photodiode and the near edge of an optical block and h the
height of optical block. In order to decrease , we can
either decrease L or increase h.
Keywords: motion gesture sensor, optical block
1. Introduction
Conventional proximity-based motion gesture sensor
(MGS) systems use multiple IR LEDs and a photodiode
[1]. The detection rate of this configuration is proportional
to the distance among each LED. The configuration
suggested by authors in [2] consists of a single LED and
multiple photodiodes to reduce power dissipation and form
factor (boundary of sensing system) at least to half and to
1/10, respectively. Since the detection rate can be reduced
due to photodiodes located closely on a single chip, this
configuration requires a tall optical block in between two
photodiodes. The taller the optical block, the higher the
detection rate is. However, the thickness of recent mobile
devices becomes thinner that leads to limiting the height of
the optical block and the detection rate. So we propose an
MGS system using a single LED and multiple photodiodes
for thin mobile devices
2. Basic principle
Fig. 1 shows field-of-view (FOV) and gray zone () of
two photodiodes in an MGS system using a single LED
with optical block, where FOV is the total view angle that
a reflected light can be reach onto each photodiode and
the total view angle overlapped by two photodiodes.
Motion gesture sensor which has small timing margin
cannot detect fast moving motion. So the detection rate of
Fig. 1 Proximity-based motion gesture sensor

architecture using a single LED with optical block
The timing margin is determined not only by optical
block but also by electrical noise. Signal to noise ratio
(SNR) that includes optical and electrical noise can be
defined as
D A SL
(2)
SNRL
D A N AL ( FOV ) N EL
Where is the sensitivity of a photodiode per unit area,
A is the area of the photodiode, and SL, NAL(), NEL are
input signal, ambient light noise, and electrical noise of
left channel, respectively. Signal to noise ratio of right
channel (SNRR) can be expressed by substituting subscript
L to R in (2). If A becomes large enough, NEL (or NER) can
be neglected, but it can be expensive solution. NAL(FOV)
(or NAR(FOV)) is proportional to . If gets smaller, so
does the noise. NEL (or NER) is added as the output current
of each photodiode is converted and amplified to the
proper voltage level. When timing margin gets small,
electrical noise such as flicker noise, thermal noise, power
supply noise, signal integrity, and so on becomes dominant
factors and limits the timing margin [3, 4]. Therefore,
decreasing electrical noise by using digital signal
processing can be crucial.
- 435 -
ICEIC 2015
NAL()
NEL
TIA
Amp
Digital
Average
Filter
PDL
NAR()
IR LED
NER
TIA
Amp
height of its package is proportional to an optical block

that separates the view angles of each photodiodes. As the
height of a sensor gets lower, the gray zone where motion
gesture cannot be detected increases. This increased gray
zone and noise added by electrical components lower
timing margin. The proposed architecture using a digital
average filter increases SNR and thus the timing margin
more than 20ms, which effectively lowers the height of a
sensor and makes it suitable for thin mobile devices.
ADC
Digital
Processor
ADC
PDR
Fig. 2 Block diagram of proximity-based motion

gesture sensor
3. Proposed architecture
Fig. 2 shows the overall structure of the proposed
proximity-based MGS system, which consists of a single
IR LED, two photodiodes, trans-impedance amplifier
(TIA) for converting and amplifying tens of pA current
from photodiodes, amplifiers (Amp), analog to digital
converters (ADCs), a digital average filter, and a digital
processor to determine each gesture. A TIA can obtain
large gain by flowing current through specific impedance
load. During amplifying by a TIA, electrical noise added
in conjunction with ambient light noise from photodiode
decides total SNR. The gain of an Amp is controlled
depending on the amplitude of input signal. Even though
the Amp stage makes additional electronic noise, the
amplitude of the electrical noise by each Amp is much
smaller than that by each TIA so its neglected. Signal
digitalized by ADC is fed to a digital average filter to
increase SNR. Noise becomes dominant in determining
timing margin as ideal time delay gets smaller. In other
words, noise performance gets more important as detection
rate gets lower.
4. Test results
In order to test timing margin according to the height of
an optical block and SNR, two types of optical blocks
(h=0.5mm and h=0.2mm) were fabricated by using 3D
printing. For same testing environment, two test boards
were located in parallel. The width of an object was set to
50mm, and the distance between photodiodes and the
object to 120mm. When the object swept from left to right,
we measured timing margin. In Fig. 5, timing margin
obtained without filter is 38.1ms and almost zero for the
height of 0.5mm and 0.2mm, respectively. However, with
a digital average filter whose order is 8, the timing margin
at the configuration of h=0.2mm is increased to 24.0ms.
As a result, when optical performance is decreased due to
using a shorter optical block, we can increase timing
margin by adding a digital average filter.
5. Conclusion
Small form factor and low power consumption are the
main advantages of a proximity-based motion gesture
sensor using a single LED with multiple photodiodes
compared to a sensor using multiple LEDs with a
photodiode. However, the configuration with a single LED
may not be suitable for thin mobile devices since the
500mV/div
20ms/div
h =500um
w/o filter
a
V
h =200um
w/o filter
b
V
h =200um
w/ filter
c
t
Fig. 3 Measured waveforms and timing margin for three

configurations: h=0.5mm w/o filter (Fig. 5a),
h=0.2mm w/o filter (Fig. 5b), and h=0.2mm with digital filter and
ideal DAC(Fig. 5c)
Acknowledgments
Science, ICT & Future Planning), Korea, under ICT/SW
Creative research program supervised by the NIPA
(National ICT Industry Promotion Agency) (NIPA-2014H0502-14-3029). This research was also supported by
Basic Science Research Program through the National
Research Foundation of Korea (NRF) funded by the
Ministry of Science, ICT & Future Planning (NRF2014R1A1A1003771)
References
[1] Cheng, H., Chen, A.M., Razdan, A., and Buller, E.:
Contacless Gesture Recognition System Using Proximity
Sensor, IEEE ICCE, Las Vegas, USA, 2011, pp. 149-150
[2] Kong, K.H., Kim, Y.S., Kim, J.E., Baek, K.H., and
Kim, S.: A Proximity-Based Motion Gesture Sensing
Technique for Small-Form Factor Mobile Applications,
submitted to IEEE Trans. Consumer Electron at 15th Oct.
2012
[3] Leach, W.M., and Jr.: Fundamentals of low-noise
analog circuit design, Proceedings of the IEEE, 1994, 82,
(10), pp. 1515-1538
[4] Kundert, K.: Power supply noise reduction.
http://www.designers-guide.org, accessed 1st November
2012
- 436 -
P1-25
Sensitivity Analysis for Random Dopant Fluctuation in DG MOSFET using

Regression Model
Yong Hyeon Shin, Edward Namkyu Cho, and Ilgu Yun
Department of Electrical and Electronic Engineering, 50 Yonsei-ro, Seodaemun-gu
Yonsei University, Seoul, Republic of Korea
iyun@yonsei.ac.kr
2. Modeling Scheme
Abstract
Random dopant fluctuation has been constantly
noticed in double gate metal-oxide-semiconductor field
effect transistor. It causes several problems in the
device such as threshold voltage shift and drive current
variation. In this paper, a regression model is
proposed to provide sensitivity of drive current. For
the regression model, the numerical model is built and
compared the results with a commercial TCAD
simulated results for the verification.
For the simulation, DG MOSFET is simplified as

the two dimensional schematic structure shown in Fig 1.
Keywords: Random dopant Fluctuation (RDF), double

gate (DG) MOSFET, Sensitivity.
FIG. 1. Schematic structure of two dimensional
symmetric DG MOSFET.
1. Introduction
Over the past decades, technology for shrinking the
device has been steadily developed. However, with
improving the performance, several problems have
taken place. The one of example about the problems is
random dopant fluctuation (RDF). It brings threshold
voltage shift and variation of drive current (IDS)
representatively [1]. Since double gate (DG) metaloxide-semiconductor (MOSFET) cannot also avoid the
phenomenon, by using impedance field method,
previous researches has focused threshold voltage shift
caused by RDF [2].
On the other hand, in this paper, we propose other
way to analyze RDF through a regression model with
respect to randomly doped body doping concentration
(NA). Unlike previous researches, regression model can
directly shows relationship between IDS and doping
profile in DG MOSFET. For the regression model, a
numerical model is realized using Poissons equation
and continuity equation. All of the results are verified
by comparing a commercial numerical device simulator.
where x and y are the orthogonal coordinate, L is the

100nm channel length, tox is the 1nm oxide thickness, tsi
is the 10nm silicon body thickness, source and drain
are heavily n-type doped ND=1020cm-3, S1 to S9 are
virtual 9 sections divided with the same area in order to
roughly represent random dopant in DG MOSFET. By
numerically solving Poissons equation and continuity
equation in steady state as the following equation (1)
and (2), IDS is calculated.
q
(1)
2V ( p n N D N A )
J 0
(2)
where V is the potential, q is the elementary charge, is
the dielectric constant, n and p are the electron and
hole density, ND+ and NA- are the ionized donor and
acceptor concentration, J is the current density.
To build the regression model for RDF in DG
MOSFET, the device is virtually divided with the same
area. Each section from S1 to S9 has different NA, which
is generated by Latin hypercube sampling. Based on
NA=5 1018cm-3, total 100 doping profiles randomly
- 437 -
ICEIC 2015
generated and simulated using the numerical model.
From the results, the regression model can be defined
as a linear IDS function according to NA of each section:
Considering all results, we can analyze the effect of

random dopants in DG MOSFET.
I DS a0 ai Ni
(3)
i 1
where ais are the model coefficients, Nis are the

doping concentrations of section Si. Since the
coefficients can be regarded with sensitivity about
doping concentration, it provides how the position of
random dopants affects the performance of DG
MOSFET.
3. Result and Discussion

First of all, the numerical model is verified with the
simulation results of the commercial 2-D ATLAS
numerical device simulator of Silvaco, Inc [3]. In this
study, in order to only focus on investigation about the
dopants fluctuation, normalized IDS based on VDS=0.1V,
VGS=1V and NA=1017cm-3 are used. The following Fig.
2 shows comparison of the numerical model and the
simulation results according to uniform NA.
FIG. 3. Coefficients of regression model at

VDS=0.1V and VGS=1V.
4. Conclusion
In this study, we proposed to analyze the effects of
RDF in DG MOSFET using regression model. In order
to support the regression model, although the virtually
divided nine sections cannot exactly explain the
random dopants, it can allow us to know how the
position of RDF can impact on the variability of DG
MOSFET performance through the coefficients of the
model.
Acknowledgement
FIG. 2. Comparison of the numerical model and the

simulation results at VDS=0.1V.
Next, from the verified numerical model, 100 sets of
IDS are calculated for the regression model. Since IDS is
normalized, random doping profiles are also
normalized by using maximum and minimum NA. The
Fig. 3 represents the coefficients of the regression
model. In the Fig. 3, the IDS tendency about NA
variations is represented. Since the symmetric structure
is used, coefficients are almost the same along center of
y axis.
However, the coefficients of drain side are higher
than that of source side indicating that the IDS variation
is more vulnerable to NA variations of drain side. It
reflects the phenomenon of channel length modulation,
which includes that the inversion charge density of
drain side is more sensitive with respect to NA [4].

of MKE/KEIT [10039174, Technology Development
of 22 nm level Foundry Devices and PDK]. This work
was also supported by Institute of BioMed-IT, EnergyIT and Smart-IT Technology (BEST), a Brain Korea
21 plus program, Yonsei University.
References
[1] X. Liang and Y. Taur, "A 2-D analytical solution for
SCEs in DG MOSFETs," Electron Devices, IEEE
Transactions on, vol. 51, pp. 1385-1391, 2004.
[2] A. Wettstein, O. Penzin, E. Lyumkis, and W. Fichtner,
"Random dopant fluctuation modelling with the impedance
field method," in Proceedings of International Conference
on Simulation of Semiconductor Devices and Processes,
2003, pp. 91-94.
[3] ATLAS Users Manual, Silvaco International, Santa Clara,
CA (2008).
[4] E. N. Cho, Y. H. Shin, and I. Yun, "An analytical
avalanche breakdown model for double gate MOSFET,"
Microelectronics Reliability, (in press), 2014
- 438 -
P1-26
Static and Dynamic analysis of Split-gate Nitride Resurf Stepped Oxide

(SNRSO) MOSFETs for 100V applications
Doohyung Cho1,2, Kwanhoon Song1, Sanggi Kim2 and Kwangsoo Kim1
1 Department of Electronic Engineering, Sogang University,
2 Convergence Component & Materials Research Laboratory, Electonics and
Telecommunications Research Institute (ETRI)
doohyung@sogang.ac.kr, kimks@sogang.ac.kr
Abstract
In this paper, SNRSO (Split-gate Nitride Resurf
Stepped Oxide) MOSFET for 100V application is
proposed and its static and dynamic performance is
analyzed by 2-D TCAD simulator. The split gate is the
concept which induces a drastic reduction of the gateto-drain capacitance inherent in RSO device while
keeping all the benefits of the RESURF effect. We
achieved the Ron.sp of 22mmm2 and the gate-to-drain
charge of 5.6nC/mm2 in SNRSO structure with the
breakdown voltage of 115V (a pitch of 4.4m, 1.2m
trench width). As a result, the Figure of Merit
(FOM=Ron.sp*Qgd) of SNRSO is lower than that of
NRSO (Nitride RSO) structure by 7 times.
Keywords: Power MOSFET, Split-gate, Superjunction
1. Introduction
The most important design consideration of a power
MOSFET as a switching device is the minimizing
MOSFETs switching losses and conduction losses [1].
Recently, there have been significant efforts to reduce
the Qgd of trench MOSFETs. One of these efforts, splitgate technology was introduced to get a reasonable
trade-off between the on-state resistance and the
switching losses (Qgd). The other technique such as the
RESURF Stepped Oxide (RSO) has been introduced
into trench MOSFETs to achieve the lowest possible
specific on-state resistance [2]. However, the RSO
MOSFET has relatively large switching losses when
compared with lateral DMOS devices due to the higher
gate-to-drain (Miller) capacitance (Cgd). The Split-Gate
technique is by far the best one in producing a low Qgd
[3]. In this point, the combination of RSO structure and
split-gate technology is a reasonable combination to
reduce total power loss [4].
Previously, we proposed a new structure to achieve

simple process controllability and improved electrical
properties with NRSO (Nitride RSO) [5]. In this paper,
a split-gate version of the NRSO device is presented
with performance which optimized for 100V
applications. Con-sequently, SNRSO MOSFET can
accomplish 7-times lower FOM (Ron.sp*Qgd) than
conventional NRSO MOSFET.
Fig. 1 shows the cross-sectional view of
conventional (a) NRSO and (b) SNRSO MOSFET. The
poly electrode in SNRSO structure is separated into
two regions, control gate and split-gate, by internal
oxide. Control gate is related to device on-off while
lower-side split-gate is shorted with the source
electrode to reducing gate-drain overlap charge (Qgd).
Thus SNRSO structure has less switching loss than
NRSO [6]. In SNRSO structure, however, the onresistance can be increased a little since the electron
accumulation cannot be induced at the interface
between the oxide and n-drift region next to the lowerside split-gate [1]. In fig. 2, the static characteristics of
SNRSO and NRSO are compared. There is no change
in VTH and breakdown voltage except for Ron.sp
increased 15% due to scant electron accumulation. The
optimization of device parameters for the best static
performance is shown in Fig. 3. The device was
optimized at 1x1015cm-3 of drift concentration and
4.4um of cell-pitch. FOM (BV2/Ron.sp) of SNRSO and
NRSO
structure
were
601V2/ohm.mm2
and
2
2
764V /ohm.mm respectively, Ron.sp of these structures
were 17.3m.mm2 and 22m.mm2 with the same
breakdown voltage of 115V. It means NRSO structure
shows better static performance than SNRSO.
- 439 -
ICEIC 2015
At last, we perform dynamic AC simulation for
switch-ing characteristics analysis. The reduction of
Qgd is essential for improving switching characteristics
and it can be achieved by reducing gate-drain overlap
area. In this point, SNRSO structure is able to achieve
lower Qgd about 1-order than NRSO due to its splitgate, shorted source, isolating control gate from drain
[4]. The total gate charge simulation results shown in
Fig. 4 indicate that Qgd in SNRSO and NRSO structure
were 5.6nC/mm2 and 48nC/mm2 respectively. This
result show about 8 times difference in Qgd. In Fig. 5,
we compared parasitic capacitances of SNRSO and
NRSO structure. The parallel connection of inter-oxide
and thick oxide in SNRSO structure make Cgs
decreased with increasing inter-oxide thickness [6].
Additionally, SNRSO has 5 times lower Cgd than
NRSO structure (Fig. 5(b)). We proposed the split-gate
version of NRSO MOSFET to reducing switching loss
for 100V class application and con-firmed 6.5 times
improvement in FOM (Ron.sp*Qgd) of SNRSO (122.2
mnC) compared to that of NRSO (830.4 mnC).
[3] C.F. Tong, I. Cortes, P.A. Mawby, J.A.Covington, and F.

Morancho, "Static and Dynamic Analysis of Split-Gate
RESURF Stepped Oxide (RSO) MOSFETs for 35 V
Applications", CDE 2009, pp. 250-253.
[4] P. Goarin, G.E.J. Koops,R. van Dalen,C. Le Cam, and J.
Saby "Split-gate RESURF stepped oxide (RSO) MOSFETs
for 25 V applications with record low gate-to-drain charge",
ISPSD 2007, 61-64.
[5] Kyoung Il Na, Sang Gi Kim, Jin Gun Koo, Jong Dae Kim,
Yil Suk Yang, and Jin Ho Lee "Simulation and Fabrication
Studies of Semi-superjunction Trench Power MOSFETs by
RSO Process with Silicon Nitride Layer", ETRI Journal, Vol.
34, pp. 962-965, Dec. 2012
[6] Gajda, M.A. Hodgskiss, S.W. Mounfield, L.A. Irwin, N.T.
Koops, and G.E.J. van Dalen, "Industrialisation of Resurf
Stepped Oxide Technology for Power Transistors, ISPSD
2006, pp. 1-4.
3. Conclusions
In this paper, the split-gate version of NRSO structure
with easier process control and improved electrical
properties is proposed. Although SNRSO structure
shows a little bit worsen static performance compared
to NRSO case, it shows significant improvement in
dynamic characteristics with 6.5 times lower
FOM(Ron.sp*Qgd). It lead us to conclude that the
combination of RSO and split-gate technology is the
optimum solution to get a reduction of total power loss
in 100V class application. After this work, the
development of fabrication process for SNRSO
structure will be the next topic to be investigated.
Acknowledgements
Science, ICT and Future Planning), Korea, under the ITRC
(Information Technology Research Center) support program
(NI-PA-2014-H0301-14-1007) supervised by the NIPA
(National IT Industry Promotion Agency)
References
[1] Raghavendra S. Saxena, and M. Jagadesh Kumar, Polysilicon Spacer Gate Technique to Reduce Gate Charge of a
Trench Power MOSFET, IEEE Trans. on Electron Devices,
Vol.59, pp.738-744, March 2012.
[2] C.F. Tong, P.A. Mawby, and J.A. Covington "'Field
Balanced SG-RSO structure showing tremendous potential
for low voltage Trench MOSFETs", EPE 2009, pp.1-4.
- 440 -
P1-27
Silicon-based Synaptic Transistor with Nitride Charge Trapping Layer

Hyungjin Kim, Jungjin Park, Min-Woo Kwon and Byung-Gook Park
Inter-university Semiconductor Research Center (ISRC) and Department of Electrical and
Computer Engineering, Seoul National University, Seoul 151-742, Korea
E-mail: lummy@snu.ac.kr
Abstract
We design the synaptic device with the siliconnitride charge trapping layer. The short- and longterm memories are mimicked by the floating-body
effect and hot carrier injection respectively. The longterm memory is formed by the hot carrier injection into
the nitride layer after the repetitive input pulses. The
response of a synaptic device to pulsed input is also
studied.
Keywords: neuromorphic systems, synaptic device,
charge trapping
1. Introduction
As the scaling of modern VLSI devices progresses,
it becomes serious that the large power consumption of
the conventional Von Neumann system is inevitable
due to the structural limitations of that. As an
alternative to the conventional system, the researches
about a neuromorphic system which is based on a
biological neural network have been conducted [1].
Above all, a synaptic device is an essential component
because the modulation of synaptic weights between
neurons enables a biological system to learn and have
various functions with high efficiency in power
consumption [2].
In our previous research, a novel silicon-based
synaptic device was proposed [3]. It mimics the
transition from short-term to long-term memory like a
biological system using excess generated holes in the
floating body and charge injection to the floating gate.
However, advantages of the charge trapping layer
compared to the floating gate have been widely known.
Therefore, we design the long-term memory
component as nitride layer in this study for simple
process steps and low process cost. For an accurate
estimation for electrical behaviors, a commercial
ATLASTM TCAD 2D device simulator (ver. Atlas
5.18.3.R) is used.
Figure 1 shows the concepts of the proposed device.

The simulated device structure is based on an
asymmetric double-gate with 10-nm body thickness
and 100-nm gate length. The gate1 conducts a shortterm memory inducing the floating-body effect with 3nm gate oxide. On the other hand, the gate2 conducts a
long-term memory through hot carrier injection. The
top oxide-nitride-bottom oxide thicknesses are 3-nm/6nm/8-nm, respectively.
To verify the transition mechanism from short-term
to long-term memory in this device, the pulsed inputs
are biased to the device. The bias conditions for the
memory transition are VG1=VD=0.7 V, VS=0 V and
VG2=-2.5 V with 0.2 s pulse width and 100 s interval.
Within only a few times of pulsed inputs, impactgenerated holes are accumulated with the number of
input pulses (N) as shown in figure 2. They increase
body potential and result in the short-term
reinforcement of conductance similar with a
capacitorless-DRAM.
At the certain threshold point of the body potential
increase due to excess generated holes, newly
generated hot holes are injected to a charge trapping
layer. Figure 3 shows the charges of trapped holes with
N. The hot hole injection into the nitride layer starts
from the sixth input pulse. It corresponds to the
transition from short-term to long-memory in a
biological system. Figure 4 shows the trapped charges
contour in the charge trapping layer. Most of charges
are located at the drain side due to the impact
ionization method.
Figure 5 shows the response of the device with a
shorter interval time (10 s). With a shorter interval,
the transition occurs earlier time, the fifth input,
because it is shorter for holes to decrease by
recombination and more holes remain in the body
during the interval. It is very similar with a biological
system.
- 441 -
ICEIC 2015
References
We designed the synaptic transistor with the charge

trapping layer. The mechanism of the transition from
short-term to long-term memory was explained. The
excess holes were accumulated by the floating-body
effect and hot holes were trapped in the nitride layer
after the repetitive pulsed inputs. The charges in the
charge trapping layer increased with the number of
input pulses. The interval between inputs determined
when the transition to long-term memory occurred like
a biological system.
[1] R. Douglas, M. Mahowald, and C. Mead, Neuromorphic

Analogue VLSI, Annu. Rev. Neurosci., pp. 255-281, 1995.
[2] S. H. Jo, T. Chang, I. Ebong, B. B. Bhadviya, P.
Mazumder, and W. Lu, Nanoscale Memristor Device as
Synapse in Neuromorhpic Systems, Nano Letters, pp. 12971301, 2010.
[3] H. Kim, J. H. Lee, G. Kim, M.-C. Sun, and B.-G. Park,
Silicon-based Floating-body Synaptic Transistor, Solid
State Devices Materials, pp.322-323, September 2012.
Acknowledgement
This work was supported by the Center for
Integrated Smart Sensors funded by the Ministry of
Science, ICT & Future Planning as Global Frontier
Project (CISS-2012M3A6A6054186).
VG1
Gate 1
impact

ionization
Source
excess
holes

Nitride
Charge of trapped holes per width [C/Pm]
3. Conclusion
2.4x10-13
2.2x10-13
2.0x10-13
1.8x10-13
0.00
10
# of input pulses
Fig. 3 Charges in the insulator layer as a function of N

with 100 s interval.
Drain
hot hole
injection
Oxide
Gate 2
VG2
Fig. 4 Trapped hole concentration in the insulator layer
after (a) the first input pulse and (b) the sixth pulse.
Charge of trapped holes per width [C/Pm]
Fig. 1 Schematic diagram of the proposed synaptic

transistor.
Fig. 2 Hole concentration after (a) the first input pulse

and (b) the fifth input pulse.
2.4x10-13
2.2x10-13
2.0x10-13
1.8x10-13
0.00
10
# of input pulses
Fig. 5 Charges in the insulator layer as a function of N

with 10 s interval.
- 442 -
P1-28
Effects of Trap Density in GeSbTe material for Phase-Change Memory

Jun Yeong Lim, Yong Hyeon Shin and Ilgu Yun*
Department of Electrical and Electronic Engineering, Yonsei University
iyun@yonsei.ac.kr
Abstract
2. Modeling and Simulation
The program/erase operation of the phase-change

memory (PCM) using joule heating induces unpredictable
defects and trap at the edge of transition bulk region in
GeSbTe (GST). In this paper, the effects of type and
density of trap in GST material to read current are
investigated by using the Silvaco TCAD modeling and
simulation.
Keywords: Phase-change memory, joule heating, trap,
GeSbTe, Silvaco, TCAD, modeling.
1. Introduction
Among many new non-volatile memories, the phasechange memory (PCM), which has been actively
researched to replace the standard NAND Flash memory, is
one of the prospective new memories. The principle of
program/erase (P/E) operation of PCM is mainly expressed
by switching the phase of GeSbTe (GST) material to
amorphous or crystalline state. Each state has different
resistance value due to the characteristics of crystal and
amorphous state and it can make us to distinguish the state
of PCM device.
However, it is difficult to control switching the exactly
same bulk region in GST material at each P/E operation
because the bulk region is defined by using only Joule
heating with current flow. It is so ambiguous to define the
switching bulk region. In addition, in each case, the trap
and defect densities of GST material are also changed
according to amorphizing of crystallizing dimension [1].
These problems in PCM switching operation eventually
make the variation of Vth and Roff, which is the standard to
evaluate the reliability and endurance characteristics of
PCM device.
In this paper, the effects of trap density in GST
materials on the characteristics of PCM device using
Silvaco TCAD modeling and simulation are analyzed.
Here, the simulated PCM test structure is composed of

stacked layers. We deposit the TiN to a bottom electrode,
and deposit GST according to the pore-like structure with
Si3N4 insulating layer, and deposit the TiN to a top
electrode by using the Silvaco TCAD DevEdit program [3].
The simulation is set to be the p-type device by increasing
the mobility of hole larger than electron and both states of
GST are simulated separately. By varying the density of
vacancies (V), acceptor-like traps (TNA) and donor-like
traps (TND) within the permitted range, the tendency of read
current of PCM device at a transient graph like Figure.1 is
investigated. It has the uniform characteristic according to
time because the read voltage fixed to 0.4 V is too small to
change the apparent variation or degradation of currenttime graph. The density of vacancies to insert to crystal
GST is varied from 1015 /cm3 to 1020 /cm3. The densities of
acceptor and donor like traps are varied from 1017 /cm3 to
1020 /cm3 [4]. The other characteristic of each state of GST
is properly chosen by referring the standard researches [4].

At first, we change the density of vacancies of GST in
crystal state. As shown in Figure.1, current is gradually
increased according to the quantity of vacancy trap density.
In crystal state, the vacancies are located in close to
valence band and it behaves like acceptor-like traps which
receive the electron or emit hole [4]. Therefore, the current
increases because the emitted hole adds to the existing hole
current.
Now, based on amorphous state of GST simulation, the
effects of the acceptor-like trap and donor-like trap are
investigated. Figure.2 shows that when the acceptor-like
trap increases, the current also increases apparently. This
reason is same with analyzation of the acceptor-trap like
vacancy in crystal GST. In case of donor-like trap, it has
opposite direction with acceptor-like trap. In p-type device,
the role of donor is receiving the hole. These traps catch
- 443 -
ICEIC 2015
Figure 1. Current through the GST according to the

vacancies sites in crystal state.
Figure 3. Current through the GST according to donor

trap sites in amorphous state.
the hole carriers which compose the dominant current of

PCM device and it induces the reducing the read current of
device.
Figures 1 and 2 show the variations of read currents
when the acceptor-like traps in both crystal and amorphous
states are changed. However, the sensitivity of current to
the acceptor-like trap is comparatively different. The
current of crystal state is changed a little, barely smaller
than one order when the vacancies increasing 4 orders. In
contrast, in amorphous state, the current changes nearly 3
orders, even if the trap density is changed very little. The
reason of this phenomenon is due to the difference of the
mobility of each state. In amorphous state, the number of
mobility is nearly 20 times larger than the mobility of
crystal state. Therefore, the simulation results show
different sensitivity according to the state of GST. In
addition, because of this difference, it is well known that
the noise of PCRAM is generated in amorphous state alone.
5. Conclusion
In summary, we studied the effects of the type and
density of trap in GST at both crystal and amorphous states.
In crystal state, the read current was proportional to the
density of vacancies. In amorphous state, the acceptor-like
trap had the same relationship between the read current and
the density of acceptor-like trap with vacancies of crystal
state. On the other hand, the donor-like trap had the
opposite relation in comparison with acceptor-like trap. In
addition, it was found that amorphous state was more
sensitive to read current of PCM device than crystal state.
Acknowledgement
This research was financially supported by SK Hynix. Also,
this work was supported by Institute of BioMed-IT,
Energy-IT and Smart-IT Technology (BEST), a Brain
Korea 21 plus program, Yonsei University.
References
Figure 2. Current through the GST according to

acceptor trap sites in amorphous state.
[1] A. Pirovano, A.L. Lacaita, F. Pellizzer, S.A. Kostylev, A.

Benvenuti, and R. Bez, Low-Field Amorphous State Resistance
and Threshold Voltage Drift in Chalcogenide Materials, IEEE
Transactions on Electron Devices, IEEE, pp. 714-719, May 2004.
[2] S. Raoux, W. Welnic, and D. Ielmini, Phase Change
Materials and Their Application to Nonvolatile Memories,
Chemical Reviews, ACS, pp. 240-267.
[3] ATLAS Users Manual, Silvaco International, Santa Clara,
CA (2008).
[4] A. Pirovano, A.L. Lacaita, A. Benvenuti, F. Pellizzer, and R.
Bez, Electronic Switching in Phase-Change Memories, IEEE
Transactions on Electron Devices, IEEE, pp. 452-459, March
2004.
- 444 -
P1-29
Geometry-dependent Variability Analysis of Amorphous InGaZnO TFT by

Parameter Extraction using Capacitance-Voltage Measurements
Edward Namkyu Cho, Jung Han Kang, Suehye Park, and Ilgu Yun*
Department of Electrical and Electronic Engineering, Yonsei University
iyun@yonsei.ac.kr
Abstract
In this paper, the extraction of electrical channel
dimensions for dielectric constant of amorphous
InGaZnO (a-IGZO) thin-film transistor (TFT) is
proposed. The width and length of the channel mask
varying with the fixed source/drain electrodes and
overlap lengths are used to extract accurate electrical
dimensions. The validity of extracted electrical
dimensions is shown by normalized current-voltage
characteristics with the variation of a channel mask
length.
Keywords: InGaZnO, Thin-Film Transistor, Electrical
Geometry, Capacitance Method
1. Introduction
Amorphous InGaZnO (a-IGZO) thin-film transistor
(TFT) is one of the promising candidates for future
application of active matrix crystal display (AMLCD),
organic light emitting diode (OLED), and flexible
display [1]. To reduce modeling noise of device
performance and degradation characteristics, the
extraction of an accurate electrical dimension in the
test structures, such as insulator, channel thickness,
effective channel width (Weff) and length (Leff), is very
crucial. However, the target geometry or electrical
dimension of fabricated device is very difficult to be
verified. In this paper, metallurgical-geometry
dependent electrical dimensions of the inverted
staggered structure of a-IGZO TFT are extracted based
on the capacitance-method.
2. Experiments and Measurements

The test structures (see Fig. 1) with varying mask
width (Wmask) and the inter-contact distance (Lcnt) were
fabricated with fixed overlap (Lov) length and the
source/drain contact length (Lsd). For the experiments,
the gate-to-source/drain capacitances (Cg-sd) were

measured at room temperature (RT) in the dark
condition at 1 MHz frequency for DC voltage from -5
V to 20 V to the gate electrode with source/drain tied
to ground configuration. Fig. 1 (b) shows the
schematic of electrically effective dimensions for gate
bias dependent capacitance modeling which are based
on the predefined geometry in the Fig. 1 (a). In other
words, Lcnt, Lsd, and Lov are source/drain electrically
effective distance, source/drain electrode effective
length, and source/drain staggered overlap effective
length to etch-stopper layer, respectively. Here, the
gate bias dependent unit area capacitance of the
minimum capacitance (Cmin) and maximum
capacitance (Cmax) were modeled as a series connection
of the unit area insulator/channel layer capacitance and
the unit area insulator capacitance, respectively. In
order to extract electrical dimensions, Cmin and Cmax
from the measurements were analyzed with channel
geometry variation.

Assuming the electrical area in strong accumulation
is proportional to the metallurgical area, Cmax is
modeled with Lcnt and Wmask. Cmin shows linearity only
with Wmask variation, since the variation of the
source/drain electrical dimension is a function of Wmask
with fixed Lov and Lsd in the large negative gate bias
condition.
Based on the results of parameter extraction, IGZO
~11.12 is extracted, which is similar with the previous
result of a-IGZO channel layer dielectric constant [2].
The extracted channel parameters are verified by
comparing W/L and the extracted channel geometry,
Wmask/(Lcnt+2Lsd) normalized I-V characteristics as
shown in the Fig. 2. For the comparison of the
normalized saturation current, length dependent turnon voltage is compensated.
- 445 -
ICEIC 2015
The proposed method is valid for the gate bias

dependent channel geometry extraction which is in
strong accumulation or depletion condition. In addition,
in the case of dielectric constants are known, insulator
and channel layers can be extracted by measuring the
high frequency C-V characteristics of the width and
length variation of the test structures.
Gate bias dependent

capacitance modeling.
electrical
dimensions
for
4. Conclusion
The capacitance method based electrical dimension
extraction technique was proposed for invertedstaggered structure a-IGZO TFT. The electrical
dimensions from the metallurgical width and length
dependent measured 1 MHz C-V characteristics with
the fixed overlap, insulator, and channel thicknesses
were considered. Based on the method, the thicknesses
of the insulator and channel layers were extracted and
the instability of TFTs varying the geometry variation
could be analyzed.
Fig. 2. Normalized transfer curves with channel length

variation. (a) Normalized by Wmask/Lcnt, (b) normalized
by electrical dimension, Wmask/(Lcnt+2Lsd).
(a)
Acknowledgement
This research was financially supported by the LG
Display. Also, this work was supported by Institute of
BioMed-IT, Energy-IT and Smart-IT Technology
(BEST), a Brain Korea 21 plus program, Yonsei
University.
References
(b)
Fig. 1. (a) Schematic of inverted-staggered a-IGZO
TFT test structure. (Here, the geometry parameters for
the extraction of electrical dimensions are defined.) (b)
[1] K. Nomura, H. Ohta, A. Takagi, T. Kamiya, M. Hirano,

and H. Hosono, Room-temperature fabrication of
transparent flexible thin-film transistors using amorphous
oxide semiconductors, Nature, Nature publishing group, pp.
488-492, Nov. 2004.
[2] H.-J. Chung, J.H. Jeong, T.K. Ahn, H.J. Lee, M. Kim, K.
Jun, J.-S. Park, J.K. Jeong, Y.-G. Mo, and H.D. Kim, BulkLimited Current Conduction in Amorphous InGaZnO Thin
Films, Electrochem. Solid-State Lett., Electrochemical
Society, pp. H51-H54, Jan. 2008.
- 446 -
P1-30
Power-Efficient Refresh Control for Cross-Point ReRAM

Sang-Yun Kim, Jong-Min Baek, Wen-Liang Ma, and Kee-Won Kwon
keewkwon@skku.edu
Abstract
1200
1000
Power-efficient refresh management for cross-point

ReRAM is proposed where the refresh is divided into two
parts; one is hidden refresh, the other is special refresh.
The special refresh manages the pre-determined tail cell
which is severely degraded by read cycling disturbance.
The measured period of hidden refresh is increased by 10
times thanks to the special refresh which leads to reduced
power consumption by 90 %.
800
600
400
200
0
Keywords: ReRAM, refresh, refresh management,

refresh period, cycling disturbance
Figure 1: Variation of set current as a function of
cycling disturbance.
1. Introduction
executed when the sampling cells are degraded by 50%.

The sampling cells are periodically monitored with predetermined schedule time which is decided by a tail cell.
Therefore, as shown in Fig. 1, the hidden refresh should
be executed every one hundred million times to save a tail
cell.
The block diagram of proposed refresh control is
shown in Fig. 2. A tail bit, as shown in Fig. 1, can be
separately managed by special refresh.
Fig. 1 shows the measured variation of set current with

tail, second tail and normal cells as a function of read
cycling disturbance. In our previous work, we proposed
hidden refresh for ReRAM where the degraded cells are
recovered by single short pulse [2]. Hidden refresh is
- 447 -
Reset counter (Cnt=0)
2. Proposed Refresh Control
Normal Operation
Resistive random access memory (ReRAM) has been

widely investigated by many research groups because it is
considered as a promising candidate to replace nonvolatile memory such as flash memory [1]. Even with
many advantages of ReRAM, the resistance value is
continuously changed by disturbance or aging. Recently,
to solve the problem, we reported hidden refresh of
ReRAM which can recover the degraded cell using an
ADC-based sense amplifier [2]. In hidden refresh, the
scheduled time to monitor the variation of ReRAM cells is
determined by a worst cell and periodic power
consumption is needed to control hidden refresh. The
refresh period of ReRAM can be increased if a few tail
cells are separately managed.
In this work, we propose the new refresh management
which is composed of hidden and special refresh to reduce
power consumption due to refresh control.
Figure 2: The block diagram of proposed refresh.
ICEIC 2015
RA
Special refresh
Row decoder &

driver
A tail bit is refreshed with special refresh control as

shown in Fig. 4. By adopting the proposed refresh, the
hidden refresh period is increased by 10 times.
Fig. 5 compares the refresh power consumption
between our previous and proposed works. In DRAM,
refresh period is adaptively controlled with temperature to
reduce power consumption [3]. The power consumption
with proposed refresh control can be reduced by 90 % as
shown in Fig. 5.
CA
1.2
Figure 3: Conceptual logic block of special refresh

control.
1
0.8
The address of a tail bit is selected and registered

during wafer test operation. The counting number (Cnt) is
increased when the input address is matched with
registered one as shown in Fig. 2. The special refresh is
executed if the Cnt is larger than 10n and the system is
idle state. Here, the optimum value of n is determined
during wafer test operation. The Cnt is reset after special
refresh.
Fig. 3 shows the conceptual logic block of special
refresh. In our scheme, the address of a tail bit is
registered in address comparator and n is set to be 8
which is based on the measured data. The special refresh
block generates single short pulse to refresh the degraded
cell. In our proposed scheme, an additional column is
needed to store the information of counting number
because the information disappears during power-down
mode. Therefore, the access count is kept during powerdown operation and reloaded during power-up mode.
Fig. 4 shows the measured set current as a function of
read cycling disturbance with proposed refresh control.
1200
0.6
0.4
0.2
0
hidden refresh
this work
Figure 5: Normalized refresh power consumption.
4. Conclusion
A new refresh control for ReRAM is proposed to
increase refresh period which results in reduced power
consumption by 90 %. The proposed refresh control is a
critical skill in ReRAM because the degraded cell caused
by cycling disturbance can be effectively recovered
without sacrificing system performance. And also, the
refresh power consumption can be minimized with the
proposed refresh control.
Acknowledgement
This work is supported by Korean National Research
Program [Contract No. : MKE-10039191].
1000
800
600
400
200
0
Figure 4: Variation of set current as a function of

cycling disturbance with proposed refresh control.
References
[1] I. G. Baek et al., Multi-layer cross-point binary oxide
resistive memory (OxRRAM) for post-NAND storage
application, in IEDM Tech. Dig., pp. 750-753, 2005.
[2] S.-Y. Kim et al., Power-Efficient Fast Write and Hidden
Refresh of ReRAM Using an ADC-Based Sense Amplifier,
IEEE Trans. Circuits Syst. II, vol.60, no. 11, pp. 776-780, 2013.
[3] D. Shim et al., A Process-Variation-Tolerant On-Chip
CMOS Thermometer for Auto Temperature Compensated SelfRefresh of Low-Power Mobile DRAM, IEEE J. Solid-State
Circuits, vol.48, no.10, pp. 2550-2557, October 2013.
- 448 -
P1-31
Low-Frequency Noise in Hysteresis-Free Multilayer MoS2 FETs

Chan Hak Yu1, Choong Ki Kim1, Jae Hur1, Yang-Kyu Choi1, and Sung-Yool Choi1
1
Department of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST),
291 Daehak-ro, Yuseong-gu, Daejeon 305-701, Korea
Phone: +82-42-350-7427, E-mail: sungyool.choi@kaist.ac.kr
These authors equally contributed to this work

Abstract
In this article, we demonstrate hysteresis-free behavior of

the MoS2 FET made by exfoliated MoS2 thin films with Al2O3
passivation and high vaccum annealing. Additionally, 1/f
noise, which limit the high performance of MoS2 for actual
applications, is characterized in the hysteresis-free MoS2
transistor.
Keywords: Multilayer MoS2, hysteresis, 1/f noise, noise
amplitude, Van der Waals gap
1. Introduction
Molybdenum disulfide, a two dimensional layered
semiconducting material, has attracted a considerable
attention due to its outstanding electrical and optical
properties [1]. Especially, finite band gap property offers
reasonable Ion/Ioff ratio (~106) for low power field effect
transistors (FETs). However, large hysteretic behaviors in
the transfer curve, presumably due to water (H2O) molecules,
are observed in MoS2 devices when measured in the air
environment [2]. Therefore, hysteresis should be essentially
removed for high performance and operational stability.
Herein, we report hysteresis-free performance of the
MoS2 device measured in the air ambient condition. Using
Al2O3 passivation layer and high vacuum annealing (HVA,
10-6 torr) at 300 C, unwanted hysteresis is removed and
electron mobility is improved. Additionally, 1/f noise, which
hinders the performance enhancement of MoS2 practical
applications, is also characterized in the hysteresis-free MoS2
device.
2. Experimental
Bulk molybdenum disulfides (SPI Supplies, USA) were
mechanically exfoliated, and transferred onto 90 nm-thick
SiO2-grown p+ silicon (Si) substrate. After transferring MoS2
layer, H2 annealing was performed for removing the scotch
tape residue for 2 hours at 400 C. The channel length was
defined with photo lithography. For ohmic contact between
MoS2 and source/drain (S/D) electrode, a 15 nm-thick
titanium (Ti) layer followed by a 55 nm-thick gold (Au)
layer was deposited using the thermal evaporator. S/D
electrodes were formed through lift-off process. After HVA
for removing water molecules in MoS2 layer, 40 nm-thick
Al2O3 passivation layer was deposited using atomic layer

deposition (ALD) at 150 C on the entire MoS2 channel
region. The chamber pressure was ~510-3 torr, and
trimethylaluminum (TMA) and DI water were used as
precursors. After the passivation, the HVA was performed
again to remove water molecules stemmed from ALD
precursors.

The inset image in Fig. 1(a) shows the transferred MoS2
ultrathin film. The multi-layer thickness of MoS2 flake was
measured using Raman spectroscopy and atomic force
microscopy (AFM). E2g-A1g separation gap is 23.64 cm-1 and
the thickness of exfoliated MoS2 thin films is 2.491 nm, as
shown in Fig. 1(a) and the inset of Fig. 1(a), respectively.
Fig. 1(b) shows a fabricated device schematic of the MoS2
FET.
Figure 2(a) shows I-V transfer characteristics showing
how the HVA and passivation step influences on hysteresis
and other electrical performances. Even though we
performed the HVA right after fabricating the device, we
have observed significantly large hysteresis, which was
arisen from the water molecules in air [2].But, the HVA and
passivation process effectively removes the aforementioned
hysteresis, as shown in Fig. 2(a). Meanwhile, we observed
the ohmic contact behavior between the MoS2 channel and
the Ti/Au electrode as shown in Fig. 2(b).
In order to evaluate mobility and threshold voltage
change due to passivation and HVA step, we extracted
mobility and threshold voltage using gm method and linear
extrapolation method, respectively. Figure 3 shows that
mobility increases and threshold voltage shifts negatively
after the HVA and passivation. Mobility is enhanced from
6.39 to 19.32 cm2V-1s-1 and threshold voltage is changed
from 16.9 to -15.2V after the HVA and passviation. These
changes can be explained by considering the dielectric
screening and the reduction of contaminants such as oxygen
and water molecules [3-5].
From MoS2 FETs showing the hysteresis-free transfer
curve and negligible small contact resistance, it is found that
the noise behavior of MoS2 channel follows the Hooge
empirical law [6]:
AI D2
H
- 449 -
SID
,A
ICEIC 2015
Mobiltiy (cm2/Vs)
20
VT was extracted using linear extrapolation
15
In summary, the hysteresis-free MoS2 transistor was

demonstrated by use of Al2O3 passivation and HVA.
Consequently, the proposed processes enhanced the mobility
and improved electrical robustness. Additionally, 1/f noise
analyses with the hysteresis-free MoS2 transistor were useful
to characterize the carrier dynamics of 2-dimensional
materials, especially for MoS2.
Acknowledgements
We acknowledge the financial supports from Global
Frontier Research Center for Advanced Soft Electronics
(2011-00.1640), Nano-Material Technology Development
Program (2012M3A7B4049807), and LG Display Co., Ltd.
Fig.1. (a) Raman spectroscopy results and AFM results

in inset and (b) schematic image of MoS2 FETs
40
2.5
2.0
1.5
1.0
0.5
-5
10
Drain Current, ID (A)
Gate Voltage, VG (V)
(b)
10
0
-10
0.0
-6
10
-7
10
VG=0~21 V
-8
10
-9
10
-10
10
-3 -2 -1
Drain Voltage, VD (V)
-0.5
-1.0
-1.5
-0.6
VG=0~21 V
-0.4
-0.2 0.0
0.2
0.4
Drain Voltage, VD (V)
0.6
Fig.2. (a) ID-VG transfer curve in order of HVA and

Passivation steps and (b) ID-VD output characteristic of
the multilayer MoS2 FETs
-20
HVA
HVA + Passivation
HVA
+ HVA
+ Passivation
Fig.3. Mobility and threshold voltage change by use of

ultra-high vacuum annealing and passivation steps
(b)
-18
10
HVA+Passivation+HVA
-19
VG = -10 V ~ 20 V
-20
10
PSD, SID (A /Hz)
10
-21
10
-22
10
-23
10
slope ~ 1/f1
-24
10
10
Noise Amplitude, A
(a)
-5
10
Noise Amplitude
2
-6
10
-7
10
Frequency, f (Hz)
10
10
-10
-5
10
15
Slope,
4. Conclusion
-5
Mobility
VT
Figure 4 shows the maximum and minimum value of

are 1.16 and 1.06 respectively. And it also exhibits a trend of
the noise amplitude (A) for various VG biases. The noise
amplitude in this paper shows the reasonable values
compared with those in the reference papers [6-8]. The noise
peak is found at near VG=10 V. This anomaly regarding to
the noise peak in MoS2 channel can be interpreted by the
carrier number fluctuation model with consideration of van
der Waals gap [9]. Additionally, these characteristics were
observed in many multi-layer graphene and MoS2 devices
[9-11].
10
-6
VD = 0.5 V
10
-7
10
-8
10
-9
10
-10
10
-11
10
-12
10
-13
HVA+Passivation+HVA
10
HVA+Passivation
-14
10
HVA
-15
10
-40 -30 -20 -10 0 10 20 30
20
10
I D2 1
f
SID A
(a)
30
Mobility was extracted from gm,max
Threshold Voltage, VT (V)
where A is the noise amplitude, ID is the drain current, f is the

frequency, H is the Hooge parameter, and N is the total
number of free carriers. In our measurement, exponent and
averaged are approximately 1.8 and 1.08, respectively.
These exponent values are well-matched with ideal Hooge
empirical law (=2, =1). We extracted the accurate A values
with linear fitting using the following equation.
0
20
Gate Voltage, VG (V)
Fig. 4. (a) Power density spectrum of drain current and

(b) noise amplitude and values at various VG conditions
References
[1] B. Radisavljevic, A. Radenovic, J. Brivio, V. Giacometti and A. Kis,
Single-layer MoS2 transistors Nature Nanotechnology, 6, 147, March
2011
[2] Dattatray J. Late, Bin Liu, H. S. S. Ramakrishna Matte, Vinayak P.
Dravid, and C. N. R. Rao, Hysteresis in Single-Layer MoS2 Field
Effect Transistors, ACS nano,, 6, 5635, May 2012
[3]Fang Chen, Jilin Xia, David K. Ferry, and Nongjian Tao, Dielectric
Screening Enhanced Performance in Graphene FET, Nano Letters, 9,
2571, April, 2009
[4]Hao Qiu, Lija Pan, Zongni Yao, Junjie Li, Yi Shi et al., Electrical
characterization of back-gated bi-layer MoS2 field-effect transistors and
the effect of ambient on their performances, Applied Physics Letters,
100, 123104, March 2012
[5]Woanseo Park, Juhun Park, Jingon Jang, Hyungwoo Lee, Hyunhak
Jeong, Kyungjune Cho, Seunghun Hong and Takhee Lee, Oxygen
environmental and passivation effects on molybdenum disulfide field
effect transistors, Nanotechnology, 24, 095202, February 2013
[6]Vinod K. Sangwan, Heather N. Arnold, Deep Jariwala, Tobin J.
Marks, Lincoln J. Lauhon, and Mark C. Hersam, Low-Frequency
Electronic Noise in Single-Layer MoS2 transistors, Nano Letters, 13,
4351, August 2013
[7]J. Renteria, R. Samnakay, S. L. Rumyantsev, C. Jiang, P. Goli, M. S.
Shur, and A. A. Balandin, Low-frequency 1/f noise in MoS2
transistors: Relative contributions of the channel and contacts, Applied
Physics Letters, 104, 153104, April 2014
[8]Xuejun Xie, Debina Sarkar, Wei Liu, Jiahao Kang, Ognian Marinov,
M. Jamal Deen, and Kaustav Banerjee, Low-Frequency Noise in
Bilayer MoS2 Transistor, ACS Nano, 8, 5633, April 2014
[9]Guanhyu Xu, Carlos M. Torres, Jr., Yuegang Zhang, Fei Liu, Emil B.
Song, Minsheng Wang, Yu Zhou, Caifu Zeng, and Kang L. Wang,
Effect of Spatial Charge Inhomogeneity on 1/f Noise Behavior in
Graphene, Nano Letters, 10, 3312, August 2010
[10]Guanxiong Li, Sergey Rumyantsev, Michael S. Shur, and
Alexander A. Balandin Origin of 1/f noise in graphene multi layer:
Surface vs. volume, Applied Physics Letter, 102, 093111, March 2013
[11]Hyuk-Jun Kwon, Hongki Kang, Jeawon Jang, Sunkook Kim, and
Costas P. Grigoropoulos, Analysis of flicker noise in two-dimensional
multilayer MoS2 transistors, Applied Physics Letters, 104, 083110,
February 2014
- 450 -
P1-32
Improved Reverse Recovery Characteristic for 50V Power MOSFET with

Integrated Schottky Body Diode
Byunghwa Lee, Doohyung Cho and Kwangsoo Kim
Dept. of Electronic Engineering, Sogang University
leebh@sogang.ac.kr, kimks@sogang.ac.kr
Abstract
This paper proposes a 50V power MOSFET which
replaces the typical body (PN) diode with a Schottky
diode. A Schottky diode is a unipolar device which is
able to reduce reverse recovery loss with greater
efficacy than PN diode. Thus, the power MOSFET with
an integrated Schottky body diode can minimize the
reverse recovery loss within the device. The analysis
results of the proposed Schottky body diode UMOSFET (SU-MOS) and of the conventional UMOSFET (U-MOS) are described to prove the
reduction in reverse recovery loss. The results show a
24.62% reduction in peak reverse current, a 8.68%
reduction in reverse recovery time and a 7.26%
improvement in figure of merit (FOM). The device
characteristics are analyzed using a Synopsys
Sentaurus TCAD tool.
diode which is a bipolar device with a Schottky diode

which is a unipolar device.
In this paper, we proposed a power MOSFET with an
integrated Schottky body diode (SU-MOS) and
analyzed the device characteristics through the
Synopsys Sentaurus TCAD tool.
2. Proposed Structure
Figure 1 shows the structures of both the conventional
U-MOS and the proposed SU-MOS. The body diode is
composed of a PN diode and a paralleled Schottky
body diode.
Keywords: Power MOSFET, UMOSFET, Reverse

recovery, Schottky diode
1. Introduction
Power MOSFETs have been commonly used in high
frequency applications such as switching regulators,
switching converters and motor drivers. There has been
an increase in demand for high frequency operations,
and there is a need for even faster switching and lower
reverse recovery loss to maximize the efficacy of the
high frequency application. However, the reverse
recovery of a MOSFET is determined by its minority
carrier lifetime. The methods to reduce carrier lifetime
include electron irradiation and the random usage of
the recombination center. These methods improve the
reverse recovery characteristic, but unfortunately also
cause conduction loss which reduces the lifetime of
both the minority and majority carrier. Therefore, a
more effective lossless technique to improve carrier
lifetime is required. The proposed power MOSFET
was found to obtain a reduction in reverse recovery
loss without loss of carrier lifetime. The proposed
method was able to do so by replacing the body (PN)
(a)
(b)
Figure 1 Cross-section of the (a) SU-MOS (b) UMOS
- 451 -
Table 1 Device Parameters for the Simulation

Parameter
SU-MOS
U-MOS
Cell pitch
Drift region thickness (L)
Mesa region width
Drift region doping
n+ doping
+
n junction depth
p-base doping
p-base junction depth
Gate trench depth (H)
Oxide thickness (tox)
Metal work function
Schottky width (WS)
2.4 m
2.5 m
2 m
1.051016cm-3
11020cm-3
0.32 m
21017cm-3
0.68 m
1.25 m
0.05 m
4.9 eV
-
2.4 m
2.5 m
2 m
1.051016cm-3
11020cm-3
0.32 m
21017cm-3
0.68 m
1.25 m
0.05 m
4.9 eV
0.3 m
ICEIC 2015
The 2-D numerical simulation parameters of the SUMOS and U-MOS are shown in Table 1.
3. Simulation Results and Discussions

The output curve and breakdown characteristic are
shown in Figure 2. The two devices have similar static
characteristics. However, the leakage currents increase
as WS becomes wider.
JL = 2 ( /)
(1)
According to the formula (1), the leakage current
increases due to the increase area [1].
Figure 3(b) shows the current waveforms and the

source voltage during reverse recovery. FOM can be
defined as follows:
FOM = 1/(ERR )
(2)
ERR = () () t rr
(3)
Table 3 shows the FOM for varying WS. According
to Table 3, the best FOM is confirmed when the WS is
set at 0.3um.
Table 2 Reverse Recovery Characteristics with
Different of WS
Peak Reverse
Current IRR [A]
U-MOS
WS = 0.3m
WS = 0.6m
WS = 1.0m
8.916
6.720
5.668
4.641
Reverse
Recovery Time
trr [ns]
1.991
1.818
1.764
1.740
Table 3 Comparison of FOMs
(a)
(b)
Figure 2 (a) Output and (b) breakdown
characteristics of SU-MOS and U-MOS
U-MOS
WS = 0.3m
WS = 0.6m
WS = 1.0m
Energy
loss
ERR [J]
0.2634
0.1793
0.1437
0.1174
Leakage
current
IL [A]
2.03210-5
3.81110-5
1.09810-4
1.82210-4
FOM
[nJA0.5 ]-1
841.887
903.063
663.474
645.774
4. Conclusion
In this paper, both the 50V SU-MOS and the U-MOS
are analyzed. The simulation results show that the SUMOS achieved a greater improvement in the reverse
recovery characteristics. IRR and trr also decreased to
24.6% and 8.68%, respectively when WS was set at
0.3m. The FOM also improved to achieve 7.26% in
the SU-MOS.
5. Acknowledgements
(b)
(a)
Figure 3 (a) Reverse recovery test circuit and
waveforms of the SU-MOS and U-MOS. (b)
Waveforms of the drain current and the source
voltage of the SU-MOS and U-MOS
Figure 3(a) displays a circuit schematic to analyze the
reverse recovery characteristic for varying WS [2]. The
peak reverse current and reverse recovery time
decrease as WS increases. The minority carriers
recombination time is reduced due to the increasing WS
[1]. The results of the reverse recovery characteristics
are shown in Table 2.

ITRC (Information Technology Research Center)
support
program
(NIPA-2014-H0301-14-1007)
Promotion Agency) and was supported by IDEC(IC
Design Education Center).
References.
[1] B.J. Baliga, Fundamentals of Power Semiconductor
Devices. 1st ed., New York: Springer, 2008.
[2] Synopsys, Inc., Two-dimensional Process and Device
Simulation of Trench-Gate NMOS Power Device Using
TCAD Sentaurus, synopsys Inc., Mountain View, CA, USA,
2013
- 452 -
P1-33
An Improved 4H-SiC Trench MOS Barrier Schottky (TMBS) Rectifier

Made with High-k Material Layer
Seulgi Sim and Kwangsoo Kim
seulgi502@sogang.ac.kr, kimks@sogang.ac.kr
Abstract
This paper proposes a new structure of trench MOS
barrier Schottky (TMBS) rectifier with a high-k
material based on the results from 2-D numerical
simulations. The proposed TMBS contains HfO2 with
dielectric constant of 25 stacked between a SiO2 and
SiC drift layer. The breakdown voltage (BV) of the
proposed TMBS is 5.7% higher than that of the
conventional TMBS. The forward voltage drop and
Ron,sp also improve in proposed TMBS.
figure, s is the trench top width, m is the mesa top

width, a is the trench depth, and b is the N-type drift
thickness. The main difference between the two
structures is the usage of the high-k material (HfO2)
layer between the SiO2 and SiC drift layer in the
proposed TMBS. The thickness of the Oxide (tox1) and
HfO2 (thigh-k) layer in the proposed TMBS is designed to
be equal to the thickness of the oxide (tox2) layer in the
conventional TMBS.
Keywords: 4H-SiC, TMBS, High-k material, BV
1. Introduction
Schottky barrier diode (SBD) is widely used in lowvoltage switching power applications. However the low
breakdown voltage limits the performance of the SBDs.
To overcome this problem, new structures such as the
trench MOS barrier Schottky (TMBS) have been
proposed [1].
A TMBS induces charge coupling between the
electrode in the trench and the dopant charge in the
drift region. The charge coupling allows a high doping
concentration in the drift region by creating a wide
depletion in the mesa region. As such, the TMBS can
simultaneously achieve a high breakdown voltage and a
low on-state voltage drop [2].
However, the TMBS structure includes a trench
region which leads to field crowding in the corner of
the trench region. Though the TMBS has a higher
breakdown voltage than conventional SBDs, this field
crowding limits the breakdown voltage of the TMBS
[3]. In this paper, we propose a structure which not
only reduces the corner electric field but also improves
forward and reverse characteristics.
Figure 1 is a diagram of the structure for both the
proposed TMBS and the conventional TMBS. In this
Figure 1 Cross-section of the (a) proposed TMBS

(b) conventional TMBS
In this work, the optimum structure of the TMBS is
as follows: s=3um, m=2um, a=7um, b=9um,
tox1=0.4um, thigh-k=0.3um, tox2=0.7um.
3. Simulation Results and Discussion

The device simulator Sentaurus TCAD tool by
Synopsys was used to analyze the two structures.
Figure 2 shows that the breakdown voltage is
dependent upon the impurity concentration for both
structures. For the TMBS, the breakdown voltage
peaked at a certain doping concentration of the drift
region [4]. The conventional TMBS has a peak
- 453 -
ICEIC 2015
breakdown voltage at 51015cm-3 while the proposed
TMBS peaks at 11016cm-3.
corner. As such, the proposed TMBS is able to achieve

a higher voltage than the conventional TMBS.
Figure 4 shows the forward characteristics of both
structures. It can be seen that the improvements found
in the proposed TMBS are due to the high doping
concentration in the drift region. Table 1 summarizes
the electric characteristics of both TMBS structures. In
this paper, the FOM (figure of merit) is obtained by
FOM = VR2/Ron,sp
Table 1. Comparison of electric characteristics
Conventional
Proposed
Parameters
TMBS
TMBS
Ron.sp(mohm.cm2)
2.794
1.033
BV(V)
968.207
1023.8
Figure 2 Breakdown voltage dependence on Nd
FOM
(MW/cm2)
355.457
1014.95
4. Conclusion
Figure 3 Field distribution along the mesa center

line (from top to bottom) at a reverse bias of 600V
In this paper, a TMBS rectifier with a high-k

material is proposed and analyzed compared to the
conventional TMBS. The proposed TMBS was found
to have lower on-resistance and a higher breakdown
voltage than the conventional TMBS. The onresistance decreased by 50% while the breakdown
voltage increased by 5.7%. As a result, the FOM
increased by 2.85 times. With the improved forward
and reverse properties of the proposed TMBS, it is
possible to develop smaller device size and increase
TMBS availability in the low-voltage switching power
applications.
Acknowledgements
support
program
(NIPA-2014-H0301-14-1007)
Reference
Figure 4. Forward I-V characteristics
Figure 3 shows the field distribution along the mesa
center at a reverse bias of 600V. In this figure, the
electric field peak value is observed at the side of the
trench corner (7um). The proposed TMBS shows a
lower peak value than the conventional TMBS in this
location because the high dielectric constant of the
HfO2, is larger than that of the 4H-SiC and SiO2, which
leads to a decreased electric field around the trench
[1] M. Mehrotra and B.J. Baliga, The Trench MOS Barrier

Schottky (TMBS) Rectifier, in IEEE IEDM Digest, pp. 675678, 1993
[2] B.J.Baliga, Silicon Carbide Power Device, World
Scienrific, pp.120-140, 2005
[3] Li, W.Y., Ru, G.P., Jiang, Y.L., and Ruan, G., A
proposal of trapezoid mesa trench MOS barrier Schottky
rectifier, Proc. 10th Int. Conf. Solid-State and Integrated
Circuit Technology, pp. 1789-1791, 2010
[4] Takashi Shimizu,Shinju Kunori and Akihiko Sugai,
100V Trench MOS Barrier Schottky Rectifier Using Thick
Oxide Layer(TO-TMBS), International Symposium in
Power Semiconductor Device & ICs, pp. 243-246, 2001
- 454 -
P1-34
An Improved 4H-SiC Trench MOS Barrier Schottky (TMBS) Rectifier

Made with High-k Material Layer
Seulgi Sim and Kwangsoo Kim
seulgi502@sogang.ac.kr, kimks@sogang.ac.kr
Abstract
This paper proposes a new structure of trench MOS
barrier Schottky (TMBS) rectifier with a high-k
material based on the results from 2-D numerical
simulations. The proposed TMBS contains HfO2 with
dielectric constant of 25 stacked between a SiO2 and
SiC drift layer. The breakdown voltage (BV) of the
proposed TMBS is 5.7% higher than that of the
conventional TMBS. The forward voltage drop and
Ron,sp also improve in proposed TMBS.
figure, s is the trench top width, m is the mesa top

width, a is the trench depth, and b is the N-type drift
thickness. The main difference between the two
structures is the usage of the high-k material (HfO2)
layer between the SiO2 and SiC drift layer in the
proposed TMBS. The thickness of the Oxide (tox1) and
HfO2 (thigh-k) layer in the proposed TMBS is designed to
be equal to the thickness of the oxide (tox2) layer in the
conventional TMBS.
Keywords: 4H-SiC, TMBS, High-k material, BV
1. Introduction
Schottky barrier diode (SBD) is widely used in lowvoltage switching power applications. However the low
breakdown voltage limits the performance of the SBDs.
To overcome this problem, new structures such as the
trench MOS barrier Schottky (TMBS) have been
proposed [1].
A TMBS induces charge coupling between the
electrode in the trench and the dopant charge in the
drift region. The charge coupling allows a high doping
concentration in the drift region by creating a wide
depletion in the mesa region. As such, the TMBS can
simultaneously achieve a high breakdown voltage and a
low on-state voltage drop [2].
However, the TMBS structure includes a trench
region which leads to field crowding in the corner of
the trench region. Though the TMBS has a higher
breakdown voltage than conventional SBDs, this field
crowding limits the breakdown voltage of the TMBS
[3]. In this paper, we propose a structure which not
only reduces the corner electric field but also improves
forward and reverse characteristics.
Figure 1 is a diagram of the structure for both the
proposed TMBS and the conventional TMBS. In this
Figure 1 Cross-section of the (a) proposed TMBS

(b) conventional TMBS
In this work, the optimum structure of the TMBS is
as follows: s=3um, m=2um, a=7um, b=9um,
tox1=0.4um, thigh-k=0.3um, tox2=0.7um.
3. Simulation Results and Discussion

The device simulator Sentaurus TCAD tool by
Synopsys was used to analyze the two structures.
Figure 2 shows that the breakdown voltage is
dependent upon the impurity concentration for both
structures. For the TMBS, the breakdown voltage
peaked at a certain doping concentration of the drift
region [4]. The conventional TMBS has a peak
- 455 -
ICEIC 2015
breakdown voltage at 51015cm-3 while the proposed
TMBS peaks at 11016cm-3.
corner. As such, the proposed TMBS is able to achieve

a higher voltage than the conventional TMBS.
Figure 4 shows the forward characteristics of both
structures. It can be seen that the improvements found
in the proposed TMBS are due to the high doping
concentration in the drift region. Table 1 summarizes
the electric characteristics of both TMBS structures. In
this paper, the FOM (figure of merit) is obtained by
FOM = VR2/Ron,sp
Table 1. Comparison of electric characteristics
Conventional
Proposed
Parameters
TMBS
TMBS
Ron.sp(mohm.cm2)
2.794
1.033
BV(V)
968.207
1023.8
Figure 2 Breakdown voltage dependence on Nd
FOM
(MW/cm2)
355.457
1014.95
4. Conclusion
Figure 3 Field distribution along the mesa center

line (from top to bottom) at a reverse bias of 600V
In this paper, a TMBS rectifier with a high-k

material is proposed and analyzed compared to the
conventional TMBS. The proposed TMBS was found
to have lower on-resistance and a higher breakdown
voltage than the conventional TMBS. The onresistance decreased by 50% while the breakdown
voltage increased by 5.7%. As a result, the FOM
increased by 2.85 times. With the improved forward
and reverse properties of the proposed TMBS, it is
possible to develop smaller device size and increase
TMBS availability in the low-voltage switching power
applications.
Acknowledgements
support
program
(NIPA-2014-H0301-14-1007)
Reference
Figure 4. Forward I-V characteristics
Figure 3 shows the field distribution along the mesa
center at a reverse bias of 600V. In this figure, the
electric field peak value is observed at the side of the
trench corner (7um). The proposed TMBS shows a
lower peak value than the conventional TMBS in this
location because the high dielectric constant of the
HfO2, is larger than that of the 4H-SiC and SiO2, which
leads to a decreased electric field around the trench
[1] M. Mehrotra and B.J. Baliga, The Trench MOS Barrier

Schottky (TMBS) Rectifier, in IEEE IEDM Digest, pp. 675678, 1993
[2] B.J.Baliga, Silicon Carbide Power Device, World
Scienrific, pp.120-140, 2005
[3] Li, W.Y., Ru, G.P., Jiang, Y.L., and Ruan, G., A
proposal of trapezoid mesa trench MOS barrier Schottky
rectifier, Proc. 10th Int. Conf. Solid-State and Integrated
Circuit Technology, pp. 1789-1791, 2010
[4] Takashi Shimizu,Shinju Kunori and Akihiko Sugai,
100V Trench MOS Barrier Schottky Rectifier Using Thick
Oxide Layer(TO-TMBS), International Symposium in
Power Semiconductor Device & ICs, pp. 243-246, 2001
- 456 -
P1-35

!
#$"%& '
#()*-).%
! ,(-+.#$!!/.#$!!

01
$ %

01 /

!

!

"#

$"

"%&

*

'()+
,-
./

$

%
$
&01' %

%
$
!

0
$
&01' %

2 2$
2 $
3

$
$
$ $

%

%2

4+5! 1

%

01 %

!
6

01 %

/
/

$ $%
/

4754(5!8

%

%

9$
%

&0:' %

&0;'
$ %
! /
%

%

3 $ $ 2
$
/

$

&;8<'
%

$ $ /
! 8

%

/
!
1
/

/
01 %

/ $;8< & ;=<= '!8

01 %

2

>
$ $ ;
?@8!
!

8
2

01 %

/
:! +! 8
%

2$
&

' %

$ $ /

%
$
%

&01'!1
2$

17')0
1+ 17 !?
$

3$%
')0
$%
22 $$ $
)
01
17')0 1+ 17 1
/

6 $

01!8

01 %

+ 1+ 17 22 !
22
')0
17

')0
1+ 17
1+
17
)
'
)

1
17 ')0
1+ 17 1

" #$ % !
!
!
!!&

=
;
01 %

/ /
$
$ %
/ :! 7! 8
$

&+AB' %

$ &6+ 67'
$
/
&)'%
$
&CA,'
; &<='!; <= 2>

%
*A-!
?
$

%

2$
$

$/ $$ ')0

%
( ) / /
3 ) ')0 17 & 1+ 17 ' &+'
8
%
+3 ) % 3 )

3+ C 2
$
%
$

/
( * A ( - 4B5! 8

1 &+ C ' 3 )
$$
$
) %
2

17 ')0
&7'
) 1 ')0
1
1
1+ 17 1
1 /
$
$
$
/ ,

; -
01
%

/ /
$ D0 + 1+ 17 22
2

>
! 8 2>
$
$$
01
%

; <=/ $
!
- 457 -
ICEIC 2015
22
')0
( '*

(*
(,
)
(+ ( 7
(C
1+
(B
((
$ %
! 8
; 01 %

D!70 (0&0)& 'I0*& ''!

; 01 %

$
2
$

2
/
) C! /

%

?@8 01
%

D0 (0&0E)& '
I0E*& ''

9$ ! 8

01 %

/

D!)J %

D!70 7!,0 $%
0H(!D0!
(-
1
()
17

22
''*

')0
4+
4,
4*
4-
4B

!"
!" #$%
&

,' ')0 )+

" -.

&

-

/
47
4C
4(

(!( (' ) *+

" %
'()
&

!!!

=
?@8
01 %

/ /
$
$ %
/ :! (! 8
$

&E+AEB' %

$ &6+ 67'

/
&E)'%
$
&ECAE,'
&'! 8
2>
2 %

0?1<!
?
$
%

$

; 01 %

$$
$

!
1
4)
1+
17

" * %
#+,
&

!!!

*) %

8

01 %

/ :! 7 (
$
/

=

$

8 ; D!()
! 8
%$

%

2 22 (!D 1+ +DD 17 )D
( '* &/ F 5' &7DD F 7DD' ''* + 6 ! 8
2
$
1 /
2 +DD
01 %

! 8

?@8 G=G =G= /

E7G(-DB
E7G(-DC

%
!
:! B /

01 %

/ :! 7 (

6H7D!8

/

$
9$
&7'!8

/

;
?@8 %
4(501 %

%
!
8
%
01 %

$
$
&00 '/

0 $%
0

G %
;?@801 %

/

/
$
/

! 8
01 %

%

/
$
D!70
/
$!1
$$
/
/ >

;0
1 %

$
2

D!() 3;
2
!
, $ !!
,

!%
4 %022-331 !%
%
% ))5)
6
#'

, 1
78

9

4+5<!

$ != %K /%
;

$ F 9$
$9$ $

01L18 !$ !16
!=
% !
)7 !-!+*7+M+*(+
!7DD)!
475 ! <> ?! % !
G!
!N O

+!70 D!+,$ ; 01 %

P
757'1)0'+5!% !B* !+,!
!7D++!
4(5 ! <> ?! % ! !
G!
=
<!
Q
>! 8 /0
/= /
; 6 6
0
$
%

L777 '+!
1*% !CD !-!7(((M7(B7
!!7D+(!+R
4B5 !! ! 2
S
2 ; $

%
S777
5% !(7 !+B!+7B)
+7BC@$+--C!
- 458 -
P1-36
A Layout Technique for the Efficient Matching of an Input TTL Signal
Ji-Hak Yu*, Seung-Baek Park and Soo-Won Kim

Samsung Electronics co, Ltd and Korea University
dbwlgkr@korea.ac.kr
Abstract
Pad Pitch(p)
A layout technique for the efficient matching of an input

TTL signal using a simple rule is presented. Using a simple
rule, we propose an algorithm that can be done
automatically by skill language. It can easily estimate a
routing area and save design time. The proposed technique
post-simulated in a 65 nm CMOS process achieves 2.2
7.219 ps of signal skew for six ten pads.
Signal to
shielding signal
space(s)
The longest
signal
length(lref)
Shielding signal
width(w)
Bent signal
Bent vertical
height(h)
Bent horizontal
length(l)
Keywords: Matching, TTL signal, layout, automation.
Fig. 1. Basic form of the proposed Matching signal
1. Introduction
In VLSI circuit design, Signal matching techniques are a
major factor in performance optimization [1]. In particular,
clock skew matching is one of the most important reasons
for signal matching techniques [1]. In the past DRAM has
handled this, some pin skew compensation is available from
the internal circuit. However, clock speeds have recently
greatly increased (i.e. LPDDR4, GDDR5), so it has become
difficult to match the signal skew with internal circuits.
Therefore, it is necessary to perform accurate calibration
with PAD.
For calibration from the PAD, each of the PADs signals
should match. Furthermore, each PAD signal match method
necessitates a manual layout technique. The manual layout
technique tends to be a random case, so it includes time loss
and inaccuracies. Therefore, to reduce the manual operation,
some papers use automatic techniques [2, 3]. However, the
automatic techniques are only suitable for matching internal
signals.
Therefore, it is a difficult to make a specific form for
calibration from PAD. In this paper, to solve this problem,
we propose a layout technique that has been specialized for
calibration from PAD by using simple rules. Using simple
rules, we propose an algorithm for automation by the skill
language.
First, the input TTL signal starts from the same position
for each PAD module, and the first units to receive this
signal are placed in the same column. Second, we determine
the longest signal by using a reference signal. Third, the
signals to be matched should be bent to the same area. At
this time, all signals must have the same width, so it is
possible to control only the length. Finally, make the
shielding around the bent signal.
2.2. Detail design technique and algorithm

The basic form of the matched input TTL signal is depicted
in Fig. 1. We defined a variable that PAD pitch p, the longest
signals length lref, bent horizontal length l, bent vertical
height h, which is the same value for all signals, shielding
line width w, and signal to shielding signal space s. All the
input TTL signals start from the same position of each PAD,
and finish at the same point, so if the signal satisfies the
condition = + 2, it will match completely. Therefore,
a bent signals l and h become = ( )2 and =
+ 2. This can be extended to N+1Pad, as shown in Fig.
2(a). lN becomes = ( )2 . Therefore, the
difference between lN and lN-1 are as the following equation.
( 1)
=
2
2
2
(1)
As a result, a bent signal lN can be expressed by the

following equation.
2. Layout design
2.1. Overall flow
The overall sequence of the proposed Input TTL signal
matching technique has the following order.
- 459 -
( )
,
2
= {
1 + ,
2
=1
2
(2)
ICEIC 2015
REF
N=1
N=2
N=N
REF
N=1
N=2
3. Post simulation results
N=N
OVERLAP
(a)
(b)
Fig. 2. (a) Simple extension to N+1PAD and (b) Form

of the proposed overlapped signal
We will now discuss the signal arrangement. If we arrange
simply like Fig. 2(a), we will take up space, which is very
inefficient. To improve the use of space, each signal
compares l with p and finds signals that can overlap each
other as shown in Fig. 2(b). This technique has a simple rule;
the Nth bent signal has group elements that can be
overlapped if the following conditions are satisfied.
The Nth signal can be overlapped by N2k-1th Nmax
signals (k goes from 1 to , incremented by 1).
Using the above rules, a signal is scanned that can be
overlapped from N1 to Nmax, then grouped. Next, the
smallest signal is found among the ungrouped signals in the
first step, and the previous scanning step is iterated. Upon
finishing the step, we create shielding lines around the bent
signals.
For example, if Nmax is N5, then N1, N2, N4, N8, N16, N32,
, N can be overlapped. However, Nmax is N5, so N8 to N
will be eliminated. As a result, only N1, N2, and N4 can be
overlapped, so they form a group. Then we find the smallest
signal among the ungrouped signals, which is N3. The
previous step is repeated, and we cannot find a group
element. Next, the smallest signal is N5, which is similar to
N3. As a result, Fig. 3 is the final form of Nmax is N5.
REF
N=1
N=2
N=3
N=4
N=5
The proposed technique is post simulated in 65 nm CMOS

technology, which has a 100 m pad pitch and 3.5 m clock
signal pitch. Fig. 5(a) shows the post simulation result of the
each clock skew for N = 5 to 9, and Fig. 5(b) shows details
of the maximum skew for N = 9. The maximum skew of
each signal is 2.27.219 ps for N = 5 to 9, because of the
differences in the length of the other vertical metal. Table 1
is a summary for N = 5, 7, and 9.
(a)
(b)
Fig. 5. (a) Each clock skew for N = 5 to 9, and (b)
Maximum clock skew for N = 9
Table 1: Summary for N = 5, 7, and 9
N=5
N=7
N=9
Skew [ps]
2.200
3.175
7.219
l [m]
248.75
348.75
448.75
Routing height [m]

29.0
39.5
50.0
4. Conclusion
In this paper, a TTL signal matching layout technique has
been suggested. The proposed layout technique has several
advantages; it has little skew and simple rules, so it can be
implemented in automated systems, and designers can
estimate routing spaces accurately. If we further consider
vertical metal, we can implement TTL signal with very little
skew. As a result, it is expected to improve high-speed
device performance.
References
Fig. 3. Final form of Nmax = 5 bent signal
The process described above can be converted to the
algorithm, as shown in Fig. 4. If we use a cadence skill
language by using this algorithm, we can implement the
automatic tool.
Start
Enter a variable
- p, w, s, N
Calculate l, h
Grouping the
Signals order that
can be overlapped
each other
(1,2,4...2k-1, k=1 to
, incresed by 1)
Create pattern &

align
Finding the
minimun
elements among
the ungrouped
one
# of group
element = N
Make Shielding
lines
[1] Xiong, X.-M., Green, D, Hardin, J and Riedel, L.

Automatic Signal Net-Matching For VLSI Layout Design,
Proc. IEEE Conf. ICCD, pp. 524527, Oct 1989.
[2] Qiang Gao, Hailong Yao, Qiang Zhou and Yici Cai A
Novel Detailed Routing Algorithm with Exact Matching
Constraint for Analog and Mixed Signal Circuits,
International Symposium on Quality Electronic Design
(ISQED), pp. 16, Mar 2011
[3] Ozdal, M,M and Hentschke, R.F, Exact route matching
algorithms for analog and mixed signal integrated circuits,
in Proc. IEEE/ACM Conf. ICCAD., pp. 231238, Nov 2009.
NO
YES
END
Fig. 4. Algorithm of proposed technique
- 460 -
P1-37
A BGA Ball Minimization Technique for the SoC Package Design Process
Baekseok Ko, Joowon Kim*, Jaemin Rwoo*, Chulsoon Hwang*, Jeong Cho, Soo-Won Kim
Korea University, *Samsung Electronics co. Ltd
E-mail: baekseok-ko@korea.ac.kr
Abstract
2. Simulation and Optimization
This paper presents a technique to minimize the number

of power/ground ball grid array (BGA) balls in a
commercial application processor (AP). A loop inductance
and loop resistance of self-impedance profile is modeled
using clustered power/ground balls, and is analyzed to
find the optimum point of the power/ground ball numbers.
Using a secured space, a case study is evaluated with the
application of decoupling capacitors on the bottom of the
package. Using the proposed technique, 52.9% of CPU
and 30% of VDD power/ground ball reductions are
achieved, and power integrity quality is retained.
A bump-interconnection configure unified port in a

commercial PI tool was used to observe the self-impedance
profiles [5]. The opposite BGA ball side was merged with
the PCB CAD power plane. The entire PDN impedance
profile is shown in Fig. 1, where the bump-side port is
terminated at 6.45 m, 100 nF from the chip RC model.
With the variation of the MLCC movement and the layout
modification, section C is insensitive in Fig. 1.
Keywords: package optimization, power integrity, ball

optimization, loop inductance, loop resistance, BGA
1. Introduction
In power delivery network (PDN) design, the factors
involved in the organization of chip-package PCB should
be considered complex design elements to reduce the selfimpedance of the PDN. Each hardware module can lead to
over-design, which eventually increases the cost of the
network. Most efforts and countermeasures concentrate on
the layout figure and capacitor placement due to the
significant influence of power integrity (PI) performance
[1]-[4]. However, it is also important to find and remove
over-designed factors in overall system. The package
power ball interconnection has a bridging role between the
semiconductor and the system, and it is designed with a
wide margin to ensure sufficient coverage according to the
system operation, the layout of package, PCB. Therefore, it
needs to ensure that the number of balls is appropriate.
This paper presents a method for deciding and
optimizing the number of power-ground balls in a ball grid
array (BGA) package. After the ball reduction, the secured
area allows us to place multi-layer ceramic capacitors
(MLCCs) on the bottom of the package to help minimize
the impedance. This case study uses the VDD and CPU
power nets of the digital TV application processor (AP) to
validate the proposed technique.
Fig. 1. PDN self-impedance profiles according to changing design

parameters.
(a)
(b)
Fig. 2. Package physical form of DTV AP: (a) the bottom side of power
interconnection; (b) profile of chip-package-PCB connection.
The power-ground ball allocation of the test vehicle is

described in Fig. 2. For the evaluation of ball
interconnection, the loop inductance and loop resistance of
Fig. 2 (b) are the parameters for reducing balls. Selfimpedance Z11 on the die generates loop inductance and
loop resistance. In Fig. 3, loop inductance (L) is expressed
as L=Z11/2 and the measured frequency is 100 MHz.
Loop resistance is expressed as R=Z11/2 and the
measured frequency is 1 MHz. In the PI simulation
environment, the voltage regulator module (VRM) model
(10 m) is set on the bottom side of the PCB, with the
thru-via inside of the dummy PCB. Power net figure of
dummy PCB is added under package with same size. All of
- 461 -
ICEIC 2015
the power and the ground pins are tied to one united plane
in the dummy PCB layer. These clustered balls meet with
the VRM short termination in the equivalent electrical
length.
fabricated sample. The MLCC pads are inserted in the

space secured from the power/ground ball removal (Fig. 5
[a]). The area efficiency of package improves 30% of CPU
and 52.9% of the VDD. During the system operation, the
minimum voltage of 1.073 V is marked. The voltage droop
is -127 mV, as shown in Fig. 5 (b). The MLCCs are then
moved from the top to the bottom space, which is secured
by the ball elimination. The voltage droop result is
improved by 11 mV (20.4 %) of the 1.2 V power supply.
Fig. 3. Self-impedance profile of the CPU block as eliminating powerground balls.
The balls are individually eliminated. Ball

interconnection has a cluster type, so the sequence of ball
removal is meaningless. Fig. 3 shows the plotted
impedance profiles with ball reduction in the
electromagnetic tool [5]. Along with ball reduction
connections, extracted loop inductance and resistance are
also calculated in Fig. 4. At the marked inflection points,
trend lines increase dramatically. The loop inductance is
represented by the AC ripple noise performance, and the
loop resistance is shown by the IR drop characteristic of
the PDN. Markers of the CPU power net in Fig. 4 (a)
indicate a measure of 10 balls for the loop inductance, and
15 balls for the loop resistance, respectively. This indicates
that a measure of 15 balls is the proper optimum value for
the CPU power, and that a measure of 10 balls is the
optimum value for the VDD power shown in Fig. 4 (b).
(a)
(b)
Fig. 5. Measurement results: (a) bottom view of the fabricated sample;
(b) CPU power noise measurement results according to the MLCCs
movement after ball reduction.
4. Conclusion
The proposed technique for making decisions regarding

power/ground ball numbers involves simple and fast
methodology in hardware design. After ball reduction,
spare design space is used for improving performance. The
proposed idea is compatible with the conventional PDN
analysis process due to its simplicity. This methodology is
useful when making ball map direction and it can be
applied in industry fields if software automation is
involved for development and verification.
References
(a)
(b)
Fig. 4. Calculated loop inductance and loop resistance as eliminating
power-ground balls: (a) the rigorous selection mark; (b) the VDD block.
[2] M. S. Tanaka, et al, Early Stage Chip/Package/Board Codesign Techniques for System-on-Chip, in Proc. EPEPS, pp.
21-24, 2011.
Table 1: The minimum required BGA ball connection

number using simulation results
Number of balls, (a): Rigorous selection with margin
Net
Initia
l#
Inflection
(Loop L)
Inflection
(Loop R)
# of min.
balls
CPU
30
15 (10a)
21 (15a)
21
30%
VDD
34
16 (10a)
16 (10a)
16
52.9%
[1] R. Fizesan, et al., Simulation for Power Integrity to Design a

PCB for an Optimum Cost, in Proc. SIITEM, pp. 141-146,
2010.
[3] Caponet M. C. et al., Solutions to Minimize Conducted EMI

in Power Electronic Circuits, Applied Power Electronics
Conference and Exposition (APEC 2001), IEEE, Vol. 1, pp.
220-224, 2001.
Reduce
d ratio
3. Measurement and Evaluation

The optimum number of balls is applied to the sample
package and board using the simulation results (Table 1)
and rigorous selections are conservatively included in the
[4] J Sakai et al., Signal Integrity and Power Integrity Properties

of FCBGA Based on Ultra-thin, High Density Packaging
Substrate, Proceedings of Electrical Components and
Technology Conference, Lake Buena Vista, FL pp. 284-290,
May 31-June 3, 2005.
[5] Sigrity PowerSI, v16.2 (2013), Cadence, Inc.
- 462 -
P1-38
A Squelch Detection Circuit for Serial Link Applications

Chang-Hyun Bae1, 2, Min-Ki Jeon2, Dong-Ho Choi2, and Changsik Yoo2
1
DRAM Design, Samsung Electronics, Hwaseong, Korea
2
Department of Electronics and Computer Engineering, Hanyang University, Seoul, Korea
chbae@hanyang.ac.kr, csyoo@hanyang.ac.kr
Abstract
Non-skewed
inverter
Skewed
inverter
A squelch detection circuit which can detect squelch

state regardless of the polarity of the differential input
using a skewed inverter and two DDAs is proposed. A
detectable voltage level can be also controlled by an
internal VREF controller. The proposed squelch
detection circuit in a 65-nm CMOS process occupies
0.002-mm2 and consumes 0.48-mW from a 1.2-V
power supply.
VRXP
+
- DDA
+ Block
-
VRXN
WP
V1
V2
V3
SQLCHOUT
WN
WP=10xWn
VREF+
VREF-
Internal VREF
Controller
Keywords: Squelch detection, Serial Link, CMOS.
Figure 1: Proposed squelch detection circuit.
1. Introduction
In a serial link supporting Serial-ATA and USB, a
differential signal with a specific pattern before
receiving or transmitting data can be transmitted or
received to reset a transceiver or manage the power of
a data transmission system [1-2]. A squelch circuit
detects when this differential signal amplitude is more
than the pre-determined voltage level and then informs
whether the signal is data or noise to the system.
Therefore, more accurate detection is needed to prevent
a malfunction of the system due to wrong inform. In
addition to this, since the circuit should be always
turned on to monitor the transmission signal, power
consumption should be minimized. In this paper, the
squelch detection circuit detectable the squelch state
more correctly is proposed using a skewed inverter and
an internal VREF controller.
2. Circuit description
Figure 1 shows the circuit diagram of the proposed
squelch detection circuit which is composed of a
differential difference amplifier (DDA) block, a
skewed inverter, a RC filter, and an internal VREF
controller. The DDA block compares the differential
input amplitude (|VRXP-VRXN|) with the voltage
VRXP
VRXN
VREF+
VREF150mV
V1
V2
V3
SQLCHOUT
Figure 2: Timing diagram of the squelch detection circuit.
difference (|VREF+-VREF-|) of the reference voltages. The

skewed inverter which the size of pMOS is 10 times
larger than the size of nMOS is used to have shorter
rising time. The variation of the output of the skewed
inverter is filtered out by the RC filter. The internal
VREF controller is capable of tuning the detectable
voltage level using variable resistors. Figure 2 shows
the timing diagram of the squelch detection circuit
which can recognize the differential input amplitude
less than the difference (150-mV) of the two references
as squelch state. If the differential input amplitude is
greater than 150-mV, the circuit outputs logical 0.
This means a data transmission state. Although data is
being received, the differential input amplitude can be
- 463 -
ICEIC 2015
Positive Differential Difference Amplifier (DDA)
VRXP
VRXN VREF+
VREF-
Figure 5: Chip micro photo and layout.
V1
+
Negative DDA
+
-
VRXP
VRXN
VRXP
VREF+
VREF-
Squelch state
VRXN
150mV
Figure 3: Circuit diagram of the differential difference

amplifier (DDA) block.
SQLCHOUT
Figure 6: Measurement of SQLCHOUT.
VRXP
VRXN
has been implemented in a 65-nm CMOS process. The

microphotograph of the proposed chip and layout are
shown in Figure 5. The test chip occupies an active
area of 0.002-mm2. Figure 6 shows the measurement of
SQLCHOUT when squelch state is input periodically.
Figure 4: Simulation results of the proposed squelch
detection circuit.
less than the difference of the references because the

polarity of the differential input amplitude is changed
when data 1 (0) is transitioned to data 0 (1). In
this case, the skewed inverter is used to prevent V2
from lowing below the threshold of the nMOS of the
non-skewed inverter due to the longer falling time of
the skewed inverter. Figure 3 shows the circuit diagram
of the DDA block. A positive DDA is used to issue
logical 0 when VRXP is higher than VRXN and the
differential input amplitude is more than the difference
of the references. A negative DDA is used to issue
logical 0 when VRXP is lower than VRXN and the
differential input amplitude is higher than the
difference of the references (|VRXN-VRXP| > |VREF+-VREF|).
3. Simulation results and Measurement
4. Conclusions
A squelch detection circuit capable of detecting
squelch state regardless of the polarity of the
differential input using two DDAs and the skewed
inverter is presented. Since the detectable voltage level
can be tuned by the internal VREF controller, the
proposed circuit is expected to be applied to various
serial link standards.
5. Acknowledgement
This work is sponsored by IT R&D program
MKE/KEIT. [No.10035202, Large Scale hyper-MLC
SSD Technology Development]. The CAD tools were
provided by IC Design Education Center (IDEC),
KAIST, Korea.
References
Figure 4 shows the simulation results of the

proposed squelch detection circuit. When the
differential input amplitude is greater than the predetermined voltage level, SQLCHOUT is changed to
low. The test chip of the proposed squelch detection
[1] Serial ATA Revision 3.0 specification, June 2, 2009.

[2] S. Seth, R. Thinakaran, S. Chakravarty, and V. Sinha, A
low power high speed envelope detector for serial data
systems in 45nm CMOS, Proc. International Symposium on
Circuits and Systems(ISCAS), IEEE, pp. 49-52. May 2011.
- 464 -
P1-39
A 6-bit Current-Steering DAC for High Speed Current Mode SAR ADC
Wen-Liang Ma, Jae-Koo Park, Se-Jin Baik, Sang-Yun Kim, Jong-Min Baek and Kee-Won Kwon
keewkwon@skku.edu
Abstract
This paper presents a 6-bit fully binary weighted
current-steering digitalto-analog converter (DAC) with
data-independent current source cell for fast and reliable
ReRAM read application. An appropriate size of
capacitor placed at the common source node of the
differential switches improves the settling time by about
44% by mitigating the glitch induced by skew of the two
complementary switches. The proposed DAC is realized in
350 nm CMOS process, occupying 0.047mm2 with 640 W
energy consumption in full-scale current of 5~25 A.
Keywords: Digital/analog converter (DAC), SAR ADC,
glitch energy, current-steering DAC, current source cell
1. Introduction
Resistive random access memory (ReRAM) is a
promising candidate for the next generation non-volatile
memories due to its fast write speed, low write energy,
logic process compatibility, and compact cell area.
However, the resistance variance of ReRAM cells limits
the read margin and consequent high performance yield.
To adaptively track the optimum reference level for fast
and reliable read in cross-point cell array, a 4-bit currentmode flash ADC-based sense amplifier is adopted to
detect the spatial distribution and temporal drift of
resistance of the distributed reference cells [1]. The power
consumption and chip area increase exponentially with
the resolution in flash ADC although the high resolution
is inevitable to reduce bit error rate for multiple-level-cell.
This paper proposes a data-independent currentsteering high-resolution DAC for high speed current mode
SAR ADC in order to get fast, accurate and reliable read
process.
One reason of the degradation in dynamic performance

of a current-steering DAC lies on improper timing of
turning on and off of the switches, which results in a
voltage glitch at the common source node of the DAC
switches. To mitigate the effects of the data-dependent
glitches, several solutions have been addressed, such as
using cascode current source, properly controlling the
crossing point of switch drivers and lowering the voltage
swing of switch inputs. Instead of CMOS-based switch
driver, a CML-based architecture of D/A cell is presented
to reduce the voltage swing of the data signal [2] as shown
in Fig. 2(a). Fig. 2(b) shows a differential-quad switching
current source, which can reduce data-dependent
behaviors in the switches if the complementary switching
signals are aligned carefully [3]. However, twice many
switches toggle at double frequency, dissipating quadruple
power when compared to others.
Fig. 2(c) shows the proposed current source cell. A
capacitor Cb is added at node b, to remove the datadependent glitch at the common source node of the
differential switches. Also, by adding the appropriate size
of capacitor, we can adjust the pole at node b to coincide
the output pole at node cresulting in quick settling.
The whole 6-bit current-steering DAC is showed in Fig. 3.
Regulated cascode current mirror is adopted to get the
accurate current copy. The full-scale current of DAC can
be adjusted by changing the input reference current, Iref.
2. Proposed DAC Current Source Scheme

Fig. 1 shows the proposed current-mode SAR ADC
employed in diagnostic read circuits of ReRAM. The
current-DAC is the crucial part of the ADC determining
the performance and reliability.
- 465 -
Figure 1: Current-mode SAR ADC as an ReRAM

read-out circuit
Vb (V)
ICEIC 2015
492 m
166 m
Figure 2: (a) Conventional CML-type, (b) differentialquad switching, and (c) the proposed current sources
Figure 4: (a) Data-independent performance at the

common source node of the differential switches and (b)
reduction of settling time (to LSB) with Cb size
Figure 3: The proposed 6-bit current steering DAC
A prototype of 6-bit current-steering DAC with
proposed current source cell was fabricated in the 350 nm
CMOS process. Fig. 4 shows the data-independent
performance of the proposed DAC at the common source
node of the differential switches. After capacitor Cb is
added, the glitch about 100 mV high is almost removed
from node b. Consequently 44% reduction in settling
time is achieved at optimal capacitance of 15 f F. The
gradual increase of the settling time with larger capacitor
is attributed to the increase of RC time constant. The
layout of whole SAR ADC is illustrated in Fig. 5. The
area of DAC and SAR ADC is 0.047 mm2 and 0.37 mm2,
respectively. The performance is summarized in Table 1.
The settling time is 200 ps in wide range of full-scale
current, 5~25 A.
4. Conclusion
A 6-bit fully binary weighted current-steering DAC
with data-independent DAC current source cell scheme is
presented for fast and reliable ReRAM read application.
About 100 mV glitch is removed and about 44% settling
time improvement is obtained by using this current cell.
Acknowledgement
This work is supported in part by Korean National
Research Program [Contract No. : MKE-10039191], and
CAD tools and chip fabrication are supported by IDEC.
Figure 5: Layout of the designed SAR ADC

Table 1: DAC performance summary
CMOS Process
Supply Voltage
Resolution
Settling Time
350 nm
3.3 V
6 bit
200ps @ Cb=15 f F
Energy Consumption
640 W @ Full Scale 5~25 A
DAC Area
0.047 mm2
References
[1] S.Y. Kim, J.M. Baek, D.J. Seo, J.K. Park, J.H. Chun, and
K.W. Kwon, Power-Efficient Fast Write and Hidden Refresh of
ReRAM Using an ADC-Based Sense Amplifier, in IEEE Trans.
Circuits Syst.II: Express Briefs, vol.60, pp.776780, Nov. 2013.
[2] G. I. Radulov, P. J. Quinn, and A. H. M. van Roermund, A
28-nm CMOS 1 V 3.5 GS/s 6-bit DAC With Signal-Independent
Delta-I Noise DfT Scheme, in Very Large Scale Integration
(VLSI) Systems, IEEE Transactions on, Issue: 99, Jan. 2014.
[3] B. Schafferer and R. Adams, A 3 V CMOS 400 mW 14 b
1.4 GS/s DAC for multi-carrier applications, in IEEE Int.
Solid-State Circuits Conf. (ISSCC) Dig. Tech. Papers, vol. 47,
pp. 360361, Feb. 2004.
- 466 -
ICEIC 2015

Poster Session
PS-2
and Device, System and Control
P2-01

!

#
"

$
% '&&(

!"
%#&%$$
)$ *
) +
(
0

) 0

,./-
0 *

$
))
+
&
$
$
0

) ) +
*

)$
$
$
0
)

$
)
0

&"

*

$)
$
& #
) +

65&631 *

442
$0 )) 2&25 78$&

# "!$ "!#%!#&%
#%%#

'#%)#($"!#&%#%%#$##$#
#$ !!$&!)!$$"$$*"#%$$

$!%#+
-',/$*$.10'%$""#
*!$ "!$ $/$"!#&%#%%#
$!%% "%! )* +
-, )% / #
%! ! $ "#$%0 '% $ / #"#% %%
- # % #%% !% $ %!

"# % % %"! )*%" "!#&%
#%%#$ .210 '% $ /$ % $() % $
%$
-$%#%#03#*#$"#"$
%$ $% % "!$ %
%!4$ %# %# $)$ % $!) #"
*!% #%#& / % $" % %
$# "!$ "!#% +
, .510 # # %
%! ! % )* $$ % "!#&%
#%%%$#%#"#"%!% "#%
%%"!
-"!#&%#%%#0

'
%

%#&%$$

60 "%$ % $ % %
- "%!
"!#&%#%%# )% / #
0
- $
!%/%)% # )*"#%$$%%
% "!#&% #%% / %
7%!)%!)$#%!$$0$
%
- #"!#&%#%%)$ #$%!"#"$
/80.210"!#&%#%%
-$
%# / % $!% !%0 # %
- )%
% %! ! $ "#$% % # % #%%
!% % "!$ %$0
- *
$%%$ )% %) #%! "!#&% $%%$
)#$())%#$"%%%)*!0
) #%! "!#&% $%%$ / 9!!
:% / % ; # 3 "!#& $0
<%%% )% %
)* %
- !# # $$ % / >== 0 # #%*

$ %
)*
- !# # 205?@
05>@ #$"%*! # % )*!% >>=
0
' ## % # % "!$ !$$ /% %
% "!$ $!) )* % # "!#&%
#%%)%#%
-/ #!#/%)
% %! %
)*0 6# % / #!$$
$%#%# % "#"% !% $ $%#! "! %
% %!4!%# %# / % $# "!$
" # % 3 A )*# %
- 468 -
ICEIC 2015
"#"%!$$$$!#$=0@=<4B )!%$

! =0=@ <4B # % = / # %!
$%#%#0%"! % $# "!$
)* / $ )(# $ % %($$ % / #
!# #$$ % %#$ $$ !$$ $ %!
#$$ % $# "!$ % $ %!
# $ %/ #!#%($$$""#"#%!
%0<%$ %$%/ # %!!
-
/%!&$"!#&%#%%#0
)*!% >>= ! )% "#"% !$$

=0=@<4B )$/%/%#%
!%# / # !# /%) % %!

)*0
(

"!#&%#%%#%#$%$ %
-
)%%!!#)%%/ # %!
!!#%%$!%%##$)600
"%! "!#&% #%%# /$ "!$
)*$ % ! $ $ !! #%% !% /% !$
$%"!#&%*#$ +;,0
6# % $%#%# )% / # %! ! % ;&
!%$% %"%! "# !$""#
)! % ;: ! %$% ""# ! )% %
-#%%!% CB 0D$$)60+,

% / # %! $%#%# # % ;& !
%$% ) % =0=>> # %
- !% C B
)! % %! $%#%# # % ;& !
%$%%=0>C #%!% ?B 0-%%#
$ $) 60 +/, % / # %!
$%#%#%;: !%$%"%=0>@ #
%
-!% CB )!% %!$%#%#
%;: !%$%%=05EE #%!%
?0> B 0 "#* %! !$$ ) $ %
%# "# %# ;0 # ) $# % $
% "!#&% *#$ # 3 % ;
"!#&%0 ; $ / ;F
;4+3G;,==H.C1)#3;#%
")#$ %%)%"%"!#& $#$"%*!0
D$#$!%%; %/ # %!$%#%#
% %! $%#%# # E@0E2 H ?E0C H
#$"%*!0
)*

' $ # *! "%! "!#&% #%%#
/$ %
- )% % / # %! ! $
"#"$!&/%26 %0
!%# "% "!#&% #%%# / #!& /
$ %
- )% "!$ %$0 ' ## %
#%#%%!% %"!#&%#%%#$
)!! $ % % ; % $!) )*
#%#$%$ %"!$ $%#%#$%!&0D$
#$!% !%#$ !! #%%# !% C B $
/%0 ; E@0E2 H $ /$#* # %
+,

+/,
'
!% %#&
+

,- ,-.
/

$)#()$$""#%/%I%!$#
6% #+I6, ##% /
% #*# %+I6=DDD==
5@@,
0
.1300%%$0D0$-"%$%%#$2=+==>,0
.1 0 0 7 <0 0 (D( 0
#$$
0 I$() ;0 -"%$ ;:"#$$ = E
+=,
.218:J0-"%0
0D 0<>>
+==@,
.51 D#$%$ #!$ ;0 #($ 3 '/$ J0 0
J"!$ 3#
!7 $! *) %%#$
E>C+==>,
- 469 -
P2-02
Extinction ratio enhancement of triangular resonator

with surface plasmon resonance mirror
Tae-Ryong Kim1, Hong-Seung Kim1, Guem-Yoon Oh1, Doo-Gun Kim2, and Young-Wan Choi*1
1
Lab. of Optoelectronics and Circuit systems, School of Electrical and Electronics Engineering,
Chung-Ang University, Korea
2
Photonics Bio Research Center, Korea Photonics Technology Institute, Korea
E-mail address: *ychoi@cau.ac.kr
Abstract
2. TRR with SPR mirror (SPR-TRR)
In this paper, extinction ratio of triangular ring
resonator (TRR) with surface plasmon resonance
mirror is analyzed in specific condition around 1550
nm range. The transmitted coefficient and attenuation
coefficient in TRR are important to determine
transmission characteristics. In the analysis,
reflectivity at the SPR mirror is contained in the
attenuation coefficient in order to find out the
variation in the output transmission. Quality-factor is
slightly enhanced, when SPR mirror is applied to TRR,
from 4.5306103 to 4.9319103.
Keywords: SPR mirror, Triangular resonator, SPRTRR, Extinction ratio
The phase change, which is a result of reflection

inside resonator, is determined by effective refractive
index (RI) of ring resonator. According to this
characteristic, sensing area would become a portion of
area on the resonator to detect a change of effective RI
[1]. The recombined waves at the output is canceled
out by destructive interference. The resonance peak of
output transmission is appeared periodically and that
periodicity of resonance is called free spectral range
(FSR) [4]. TRR structure is modified from general ring
resonator structure to attach the SPR mirror.
The conceptual structure of TRR with SPR mirror is
illustrated as a Fig. 1. SPR mirror interface is similar to
Kretschmann configuration [1].
1. Introduction
Recently, research and development of optical
biosensor which is able to check the existence of a bio
matter using optical properties has intensively been
undertaken. Integrated optic based ring resonator has
been preferred by advantages of both mass production
and high density integration [1]. Because the output
transmission power of the ring resonator is determined
by transmitted and attenuation coefficient in resonator,
a careful choice of those parameters is required for
high performance of resonator [2]. The triangular
resonator with surface plasmon resonance mirror
(SPR-TRR) is achieved by attaching surface plasmon
resonance (SPR) mirror to triangular resonator (TRR).
It is available that a smaller detection area than the
TRR [3]. Performance of the SPR-TRR mainly
depends on the parameters of ring resonator,
reflectivity in SPR mirror. In this paper, spectral
characteristic of transmission power in TRR and SPRTRR is analyzed in specific wavelength range.
Figure 1. Conceptual structure of triangular

resonator applying SPR mirror
In contrast to ring resonator, the sensing area of
SPR-TRR is reduced to only SPR mirror region. The
wave is guided at fixed incident angle into the SPR
mirror owing to structure of TRR. When the incident
angle is set 17.892 degree at between InP and Au
interface, then the reflection at the SPR mirror is in
Fig.2.
- 470 -
ICEIC 2015
Table 1. FWHM and Q-factor by result of

calculation by Matlab
Normalized reflection
1 .0
TRR
SPR-TRR
0 .6
Resonance
position
1.548 um
1.549 um
0 .4
FWHM
0.341 nm
0.314 nm
Q-factor
4.530103
4.931103
0 .8
0 .2
1 .2
1 .3
1 .4
1 .5
1 .6
1 .7
1 .8
W a v e le n g th (u m )
3. Conclusion
Figure 2. Reflection by SPR mirror
related with wavelength
The output transmission of TRR applying SPR
mirror is expressed as
t r D 2 t r D cos(TD TR Tt )
2
T (O) Pt
Et
1 r t D 2 t r D cos(TD TR Tt )
2
Transmission (dB)
, where t is transmitted coefficient, D is attenuation

coefficient, r is reflectivity at SPR mirror and T is a
phase change of corresponding to parameters,
respectively. In Fig. 3, output transmission is
calculated where D is 0.871 and t is 0.6 [4]. The black
color line is a transmission of TRR and the red color
line is a transmission of SPR-TRR.
Acknowledgment
government (MSIP) (No. 2012R1A2A1A01011488).
TRR
SPR-TRR
Degraded Q-factor was predicted by a loss induced

by SPR mirror, but Q-factor is enhanced by choosing
parameters where t and D equal to 0.6 and 0.871,
respectively. The attenuation coefficient of resonator is
affected by reflectivity in the SPR mirror. The reason
of enhancement is a not optimized condition for TRR,
but performance is enhanced by attaching the SPR
mirror. Therefore Q-factor is enhanced in specific
range of wavelength. As the results, when the design
parameter of SPR-TRR, expect that can achieve the
more sensitive biosensor by enhancing the ER.
References
-5
-10
1.546
1.548
1.550
1.552
1.554
W avelength (um)
Figure 3. Spectral transmission of TRR (black line)

and TRR applying SPR mirror (red line)
As shown Fig.3, extinction ratio (ER) is enhanced
SPR-TRR compared to TRR. Difference of peak
position is due to phase change at SPR mirror. The
extension of half value is called full width half
maximum (FWHM). The Q-factor is expressed as Q =
O0 /FWHM,
then calculated value of FWHM and Q-
[1] X Fan, IM White, SI Shopova, H Zhu, JD Suter, Y Sun

Sensitive optical biosensors for unlabeled targets: A
review, Analytica chimica acta, Elsvier, pp. 8-26, May
2008.
[2] A. Perentos, F. Cuesta-Soto, A. Canciamilla, B. Vidal, L.
Pierno, N. S. Losilla, F. Lopez-Royo, A. Melloni, S. Iezekiel,
Using a Si3N4 Ring Resonator Notch Filter for Optical
Carrier Reduction and Modulation Depth Enhancement in
Radio-Over-Fiber Links, IEEE Photonics Journal, An IEEE
Photonics Society Publication, vol. 5, no. 1, pp.5500110,
2013
[3] Geum-Yoon Oh, Tae-Kyeong Lee, Hong-Seung Kim,
Doo Gun Kim, and Young-Wan Choi, Design of ultrasensitive biosensor applying surface plasmon resonance to a
triangular resonator, Optics Express, vol. 20, no. 17, pp.
19067, 2012
[4] Rabus, D.G., Integrated Ring Resonators, Springer, pp.
3-9, 2007
factor related specific resonance peak is in Table. 1. As

shown the Table.1, the Q-factor is enhanced from
4.530103 to 4.931103.
- 471 -
P2-03
Analysis on the low VGS/high VDS stress-induced instability in amorphous

indium-gallium-zinc-oxide thin-film transistors
Jun Tae Jang, Hara Kang, Jonghwa Kim, Sung-Jin Choi, Dong Myong Kim, and Dae Hwan
Kim*
School of Electrical Engineering, Kookmin University, Seoul 136-702, Korea
*
E-mail : drlife@kookmin.ac.kr
Abstract
The low VGS/high VDS stress-induced instability in
amorphous InGaZnO thin-film transistors was
investigated by combining the forward/reverse VGS
sweep and a low/high VDS read-out conditions. It was
dominated by a local trapping of electron/hole
followed by the local potential barriers complicatedly
modulated by the variations of not only the position of
source/drain but also the value of VDS under a read-out
condition.
The a-IGZO TFTs with the bottom gate ES

structure were integrated on a glass substrate as shown
in Fig. 1. The sputtered Mo was used as the electrodes
for gate, source (S) and drain (D). The plasmaenhanced chemical vapor deposition (PECVD)
SiNx/SiOx bilayer was used as the GI. The a-IGZO
active thin-film was deposited by the dc sputtering at
room temperature. The detailed fabrication process is
the same as [4].
Keywords: High drain / low gate bias stress, charge

trapping, indium-gallium-zinc-oxide (IGZO), thin-film
transistors, electron-hole pair generation.
1. Introduction
Amorphous indium-gallium-zinc-oxide (a-IGZO)
thin-film transistors (TFTs) have been considered as
promising driving/switching devices in large-area high
frame-rate active-matrix organic light-emitting diode
(AMOLED) displays due to their advantageous
features, such as good large-area uniformity, high
mobility, good transparency, and low leakage current
[1]. Up to now, many researchers have studied their
instability mechanism under the operation condition of
AMOLED for commercializing IGZO TFTs [2-3].
However, most of previous instability analysis has been
focused on the bias stress condition of a high VGS/low
VDS or VGS=VDS. Thus, a low VGS/high VDS stressinduced instability needs to be analyzed because
various VGS/VDS configuration should be taken into
account in perspective of the driving scheme for stable
AMOLED displays.
In this work, the threshold voltage (VT) shift under a
bias condition of low VGS/high VDS was investigated
using either the forward/reverse or a low/high VDS
read-out, and was attributed to the electron-hole pair
generation followed by a local trapping of electron/hole
into the gate insulator (GI)/etch stopper (ES) dielectrics.
Fig. 1. Schematic illustration of a-IGZO TFT with

the bottom-gate ES structure.
The fabricated TFT has geometrical parameters,
such as an equivalent oxide thickness of GI TOX=258
nm, the active layer thickness TIGZO=50 nm, the
channel length L=50 m, the gate-to-S/D overlap
length LOV=15 m, and the channel width W=25 m.
The IGZO TFT provided electrical performance, such
as VT=0.39/0.41 V, subthreshold swing SS= 389/386
mV/dec, field-effect linear and saturation mobility
FE,lin=7.91/7.84 cm2/Vs, FE,sat=11.05/11.07 cm2/Vs
under the forward (F)/reverse (R) VGS-sweep read-out
condition as shown Fig. 2. Therefore, no significant
S/D asymmetry was observed in the pristine state. The
used bias stress condition of a low VGS/high VDS was
VGS=10 V and VDS=30 V during the stress time
TSTR=5000 sec. The TSTR-evolutions of I-V curves were
shown in Fig. 2. In the read-out condition of VDS=0.1 V
(low VDS), the difference between F and R was
negligible whereas either the SS degradation or the
- 472 -
ICEIC 2015
10
-6
10
-7
10
-8
10
-9
10
-10
10
-11
10
-12
10
-13
10
-14
100
Stress condition
VGS=10V, VDS=30V
60
Line : Forward
Symbol : Reverse
0s
5000s
-5
-4
-5
-6
10
-7
10
(a)
5
10
15
VGS [V]
10
10
40
Stress condition
VGS=10V, VDS=30V
IDS[A]
-11
10
VDS=10.1V
0
20
4
Line : Forward
Symbol : Reverse
0s
5000s
(b)
-13
-5
Drain
e
(b)
(5ks) After stress

At thermal equilibrium
After stress
VDS=0.1V readout
After stress
VDS=10.1V readout
Fig. 3. The read-out VDS-dependent energy band

diagram in (a) the F and (b) R read-out conditions.
Acknowledgements
10
-10
Source Active layer
20
(0s) Before stress

At thermal equilibrium
-12
10
(a)
IDS[A]
-10
10
-8
-9
We analyzed the low VGS/high VDS bias stressinduced instability in the bottom gate a-IGZO TFTs
with an emphasis on either the F/R or a low/high VDS
read-out condition. It was dominated by a local
trapping of electron/hole into GI/ES and the local
potential barriers complicatedly modulated by the
variations of not only the position of S/D but also the
value of VDS under an individual read-out condition.
We believe that our results would provide the
informative implications of optimizing the driving
scheme for the display pixel in the amorphous oxide
TFT-driven AMOLED backplanes.
10
10
3. Conclusion
80
VDS=0.1V
-10
condition of VDS as shown in Fig. 3(a). In other words,

the low VGS/high VDS stress-induced locally high
electron barrier can be alleviated only in the F high VDS
read-out condition. Therefore, the VT lowering induced
by a local hole trapping into ES near S is also observed
only in the F high VDS read-out condition.
IDS[nA]
IDS[A]
positive VT shift (VT) was clearly observed after

TSTR=5000 sec [Fig. 2(a)].
Our device simulation results (not shown here) into
which the experimentally extracted subgap density-ofstates and device parameters were incorporated [4]
implied that the high energy electrons were able to
generate the electron-hole pairs near D electrode under
the used stress condition as was the case in [5]. Then,
the electrons can be locally trapped into the GI near D
and the holes locally trapped into the ES near S as
illustrated in Fig. 3. Therefore, both the stress-induced
SS degradation and the positive VT in Fig. 2(a) can be
attributed to the local electron/hole trapping as seen in
Fig. 3. The hump-like feature in a transfer curve in a
linear scale [Fig. 2(a)] is also consistent with the series
connection of a local low VT (near S) and a high VT
(near D) TFTs.
10
15
0
20
VGS [V]
Fig. 2. The low VGS/high VDS stress time-evolution

of measured transfer characteristics in (a) VDS=0.1
V and (b) VDS=10.1 V read-out conditions.
On the other hand, the low VGS/high VDS stress
instability becomes more complicated in the read-out
condition of VDS=10.1 V (high VDS) as shown in Fig.
2(b). Both the negative VT and the SS degradation
were observed only in F read-out. The positive VT in
R read-out is consistent with the case of VDS=0.1 V
read-out. It can be explained as follows; in the case of
F high VDS read-out, a locally high potential barrier for
electrons resulting from the electron trapping near D
would be lowered by applying VDS=10.1 V whereas a
locally low potential barrier caused by the hole
trapping near S remains regardless of the read-out
This work was supported by National Research

Foundation of Korea through the Ministry of Education,
Science
and
Technology (Grant
No.
2013R1A1A2013100) and the Ministry of Science, ICT
and Future Planning (Grant No. 2011-0030230), in
part by BK+ with the Educational Research Team for
Creative Engineers on Material-Device-Circuit CoDesign under Grant 22A20130000042.
References
[1] K. Nomura, et al., Room-temperature fabrication
of transparent flexible thin-film transistors using
amorphous oxide semiconductors, Nature, 432, p. 488,
November 2004.
[2] S. M. Lee, et al., Device instability under high
gate and drain biases in InGaZnO thin film transistors,
IEEE Trans. Device Mater, Reliab., 14, p. 471, March
2014.
[3] C.-Y. Jeong, et al., A study on the degradation
- 473 -
ICEIC 2015
mechanism of InGaZnO thin-film transistors under
simultaneous gate and drain bias stresses based on the
electronic trap characterization, Semicond. Sci. and
Technol., 29, p. 045023, March 2014
[4] Y. Kim, et al., Amorphous InGaZnO thin-film
transistors-Part I: Complete extraction of density of
states over the full subband-gap energy range, IEEE
Trans. Electron Devices 59, p. 2689, October 2012.
[5] S. Urakawa, et al., Thermal analysis of amorphous
oxide thin-film transistor degraded by combination of
joule heating and hot carrier effect, Appl. Phys. Lett.,
102, p. 053506, February 2013.
- 474 -
P2-04
Frequency-dependent C-V Based Extraction of Interface Trap Density in

Normally-off Gate-recessed AlGaN/GaN Field-effect Transistors
Sungju Choi, Youngjin Kang, Jonghwa Kim, Sung-Jin Choi, Dong Myong Kim,
Ho-Young Cha, Hyungtak Kim, and Dae Hwan Kim
School of Electrical Engineering, Kookmin University, Seoul 136-702, Korea

School of Electronic and Electrical Engineering, Hongik University, Seoul 121-791, Korea
E-mail : drlife@kookmin.ac.kr
Abstract
The exact extraction of interface trap density (Dit) is
very important especially in the gate-recessed MOS
structure which is a promising approach for normallyoff AlGaN/GaN field-effect transistors (FETs). In addition, the efficient C-V model should be precisely established including the frequency-dependence in AlGaN/GaN FETs because they are developed mainly for
high speed applications. Here, the extraction of Dit is
demonstrated in the normally-off gate-recessed AlGaN/GaN FETs and its result is compared with that of
a conventional conductance method. The proposed
method is not only simpler than the conductance method along with the same precision but also useful in a
simple C-V model for AlGaN/GaN FETs.
tion of device performance as well as serious instability.

In this work, we demonstrate the Dit extraction by
using the frequency-dependence of capacitancevoltage (C-V) characteristics in the gate-recessed normally-off AlGaN/GaN FETs. The proposed frequencydependent C-V method (FDCM) is very useful in an
efficient C-V model for AlGaN/GaN FETs because it
supplies the frequency-independent bias-dependent
capacitance components while the extracted Dit is consistent with that extracted from a conventional conductance method (CM) [3].
Keywords: Normally-off, gate-recessed, AlGaN/GaN

FETs, interface trap density, frequency-dependent C-V
The used normally-off gate-recessed AlGaN/GaN

FETs were integrated on a Si substrate as shown in Fig.
1(a). Fig. 1(b) shows the measured frequencydependent C-V curve which was characterized through
a typical LCR meter.
1. Introduction
(a)
GaN-based high electron mobility transistors

(HEMTs) have been attractive candidates for high
power, high frequency application under high temperature due to its beneficial features, such as maximum
frequency of oscillations, low specific on-resistance,
and high breakdown voltage. It should be also noticed
that the normally-off operation of GaN-based devices
is important for commercializing the CMOS circuitbased applications [1]. The gate-recessed metal-oxidesemiconductor (MOS) structured AlGaN/GaN fieldeffect transistors (FETs) is a promising candidate for
the normally-off GaN-based HEMT with advantages
such as a thin barrier layer, low gate leakage, low gate
swing, low turn on voltage and high break down voltage [2]. However, the interface trap density (Dit)
should be exactly characterized especially in the gaterecessed AlGaN/GaN FETs because they would undergo the etching damage-induced trap generation in
each interfacial layer, which would evoke the degrada-
Source
(b)
Lex,s
Ls
Lgate
Lex,d
LDrain
Gate
Drain
SiO2
TSiO2
GaN
TGaN
TAlGaN
TAlN
Ti-GaN
AlGaN
AlN
i-GaN
Si(111)
Fig. 1. (a) A schematic view of the normally-off

gate-recessed AlGaN/GaN FETs. Geometrical parameters are W=100 Pm, Ls=2 Pm, Lex,s=1 Pm,
Lgate=2 Pm, Lex,d=3 Pm, LDrain=12 Pm, TSiO2= 30 nm,
TGaN=4 nm, TAlGaN=20 nm, TAlN= 2 nm, and TiGaN=1.7 Pm. (b) The measured Cg-Vg curve with
various small-signal frequencies.
The result was derived from the observation
through frequency dependence of capture-emission
events caused by the interface and/or bulk traps as well
as parasitic source/drain resistance (Rs). The model and
physical assumption is similar to [4]. Both the parallel
- 475 -
ICEIC 2015
mode capacitance (Cp) and the resistance (Rp) can be

measured as a function of the gate voltage (Vg) under
various frequencies as shown in Fig. 2(a). Then, the
Cox and Rs can be de-embedded in the four-element
model in Fig. 2(b). The ZM in the two-element model
and Zp in the four-element model are individually obtained by
RM
jZCM RM2
(1)

ZM
2
2
1 ZCM RM 1 ZCM RM
independent Cg [Fig. 3(a)]. Finally, the Dit can be finally extracted by Cit(Vg)= q2uDit(Vg)uWL as shown in
Fig. 3(b). Here, the Dit(Vg) was transformed into Dit(E)
by using the f-independent Cg. The FDCM-based
Dit(E) was verified to be consistent with the CM-based
Dit(E) [Fig. 3(b)]. Furthermore, the FDCM is much
simpler than CM because the former requires only
three different f conditions while the latter many different f conditions.
(a)
ZC R 2
RP
1
p p
(2)

j
1 C R 2 ZCox
1 (ZC p R p ) 2

p
p
In addition, the Rs can be determined from the

measured accumulation impedance at high frequency
(f=1 MHz in our case) [3]:
RM , a
(3)
Rs
2
1 Zhigh RM , a CM , a
Zp
(b)
RS
Thus, we can obtain the Rp and CP as functions of

experimentally acquired CM and RM by using ZM=Zp.
(a)
(b)
(e)
Fig. 3. (a) The extracted Cg(f-independent), CEFF, and

CGaN. (b) The extracted Dit(E) with the inset of semilog plot.
CEFF
RM Zp Cp
ZM CM
Rp
RS
(c)
(d)
CEFF
ZCH
Rit
Cit
CGaN
3. Conclusion
CEFF
Cit
CGaN
RS
Fig. 2. (a) Equivalent circuit for the parallel mode

impedance analyzer, (b) four-element model for the
effective capacitance (CEFF) and series resistance
(Rs), (c) physics-based five-element model for frequency-dispersive C-V characteristics, (d) equivalent model for f-independent CEFF, CGaN, Cit, and (e)
the Rs versus VGS curve with the inset figure of the
Rs versus frequency.
The following is the four-element model, which is
transformed into the five-element model reflected in
the interface trap model as shown in Fig. 2(c). The
channel impedance ZCH is composed of Rit, Cit, and
CGaN. By using ZCH=Zp, Rit is obtained as follows.
Z 2C R 2 C C C C C
p p
it
GaN
it
GaN
p
Rit 2 2 2
2
2
Z Cit CGaN 1 Z C p R p C p CGaN

(4)
C
C

it GaN
2 2
Z Cit CGaN 1 Z 2 C p R p 2 C p CGaN
Then, using the relation of Rit(Z1)= Rit(Z2)=Rit(Z3), we

can obtain the CEFF, Cit, and CGaN as well as the f-
The Dit(E) of normally-off gate-recessed AlGaN/GaN FETs was successfully extracted by using
FDCM. The proposed method is not only more efficient than a conventional CM along with the same precision but also very useful in a simple C-V model for
AlGaN/GaN FETs.
Acknowledgements
Foundation of Korea through the Ministry of Education, Science and Technology (Grant No.
2013R1A1A2013100) and the Ministry of Science,
ICT
and
Future
Planning
(Grant
No.
2013R1A1A2065339), in part by BK+ with the Educational Research Team for Creative Engineers on Material-Device-Circuit
Co-Design
under
Grant
22A20130000042.
References
[1] T. Palacios, et al., High-power AlGaN/GaN HEMTs for Ka-band applications, IEEE Electron Device Lett., 26, pp. 781783, November 2005.
[2] J. Shi, et al., High performance AlGaN/GaN power switch with HfO2
insulation, Appl. Phys. Lett., 95, p. 042103, July 2009.
[3] E. H. Nicollian and J. R. Brews, MOS(Metal Oxide Semiconductor) Physics and Technology, Wiley, 2003.
[4] S. Lee, et al., Extraction of Subgap Density of States in Amorphous
InGaZnO Thin-Film Transistors by Using Multifrequency Capacitance
Voltage Characteristics, IEEE electron Device Lett., 31, pp. 231-233, March
2010.
- 476 -
P2-05
Development of Microwave Band-Pass Filter Employing Aerosol-Deposited

Al2O3-PTFE Composite Thick Films
Ji-Won Lee and Jung-Hyuk Koh*
School of Electrical and Electronics Engineering, Chung-Ang University, Seoul, 156-756, Korea
E-mail address: jhkoh@cau.ac.kr
Abstract
Fabrication of microwave band-pass filter with
coplanar waveguide with ground structure was
realized by employing Al2O3-polytetrafluoroethylene
(Al2O3-PTFE) composite thick films for integrated
substrates produced by aerosol deposition (AD). In
order to predict the performance of the band-pass filter,
3-D electromagnetic simulations were performed by
high-frequency structure analysis. The thick Al2O3PTFE composite films prepared by the AD process had
submicron-sized Al2O3 crystallites due to the shockabsorbing effect of PTFE during the film growth. The
thick films were characterized by X-ray diffraction and
scanning electron microscopy. The Cu transmission
lines with the thickness of 300 nm were deposited by
electron-beam evaporation to form the band-pass filter.
The fabricated band-pass filter showed similar
characteristics to the simulation results. The insertion
loss and resonance frequency were 9.5 dB and 2.3
GHz, respectively.
Keywords: Band-pass filter, aerosol deposition, 3-D
electromagnetic simulation
1. Introduction
In recent years, one of the widely used materials for
electronic substrates is FR-4, a composite of epoxy and
glass. However, FR-4 substrates are unsuitable for
high-performance microwave devices like embedded
substrates that require a high quality factor and low
coefficient of thermal expansion (CTE) [1]. Compared
with FR-4, ceramic materials have been used in the
high- frequency device industries as substrate materials
due to their high reliability, high dielectric properties,
low thermal conductivity, and low CTE. Moreover, for
the miniaturization and integration of microwave
devices, a 3-dimensional arrangement is required in the
hetero junction between different components.
Therefore, different types of materials should be

considered to be employed in such circuits. However,
ceramics have high processing temperatures above
1000 C due to the necessary sintering process. Such
high processing temperatures can damage other
components.
To solve these problems, ceramic-polymer
composites that combine the merits of ceramics and the
flexibility of polymers have been considered.
Furthermore, low-temperature fabrication and thickfilm processing of the composites are necessary for the
3-D integration of the substrates because of the low
melting temperature of polymers and the vertical
integration of the films. We have performed a lowtemperature fabrication of ceramic-polymer composite
thick films using the benefits of the aerosol deposition
(AD) process that is able to form dense ceramic thick
films without sintering of the ceramics. The AD
process was designed for the room-temperature
fabrication of ceramic thick films by Dr. Akedo in
Japan [2]. Previous researches have been conducted on
pure ceramic and on composite thick films without
sintering the ceramics.
For these reason, we have focused on the AD
process since it has superior merits, such as roomtemperature processing, high deposition rate, and high
density. In this study, Al2O3-polytetrafluoroethylene
(PTFE) composite thick films for embedded substrates
were prepared by the AD process. Moreover,
microwave BPFs were fabricated on these aerosoldeposited Al2O3-PTFE composite thick films. The
fabricated BPFs have similar properties according to
the results of simulated filters.
2. Experimental
The fabrication of ceramic-polymer composite thick
films for integrated substrates was performed by the
AD process. Powder of Al2O3 with average diameter of
0.5 m was used as ceramic starting material. As
- 477 -
ICEIC 2015
polymer starting powder, PTFE with average diameter

of 0.2 m was used. To produce Al2O3-PTFE
composites, the amount of PTFE was 0.5 wt% in the
mixed starting material. To decrease the dielectric loss
tangent, the starting material of Al2O3 was heated to
900 C for 2 h before the deposition, and annealing of
the Al2O3-PTFE composite thick films was performed
after the deposition process. The annealing temperature
and time were 280 C and 5 h, respectively. The film
deposition rate was 3 m/min. The composite film
surface was polished.
For the formation of the BPFs, copper transmission
lines were formed on the Al2O3-PTFE thick films by
photolithography. The resistivity of the Cu layer
deposited by electron-beam evaporation was 2.98
cm. In the photolithography processing, spincoating, pre-baking, exposure, reversal bake, flood
exposure, and development were applied on aerosoldeposited Al2O3-PTFE composite thick films.
Photoresist AZ 5214 E was used for the masks in the
course of the BPF patterning. Finally, upper patterns
were formed by electron-beam evaporation on the
prepared composite thick films.
small discrepancies may come from some distortion of

the Cu top electrode in the course of the lithography
process. Therefore, we found that AD represents a
good processing method for the production of BPFs in
3-D structured devices. The proposed Al2O3-PTFE
composite thick films fabricated by AD should be
suitable for integrated substrates.
Al2O3-PTFE composite thick films were prepared

by the AD technique without sintering process. The
actual BPF with CPWG structure were fabricated by
lithography on Al2O3-PTFE composite thick films. The
Al2O3-PTFE composite thick films consisted of
crushed Al2O3 particles surrounded by PTFE links
resulting from the shock-absorbing effect of PTFE. The
fabricated composite thick films showed superior
dielectric properties, such as a low relative permittivity
of 4.9 at 1 MHz and low loss tangent of 0.00546 (Q =
183). As a result, the BPF with CPWG structure
showed similar microwave characteristics like the
results of a corresponding simulation in the frequency
range from 1.05.0 GHz. The insertion loss and
resonance frequency were 9.5 dB and 2.3 GHz,
respectively.
The BPF patterns were successfully formed on the

Al2O3-PTFE composite thick films forming coplanar
waveguide with ground (CPWG) structure, as shown in
Fig. 1. As evident from the optically magnified image
of the BPF, port, coupling gap, and transmission line
were successfully deposited.
Fig. 1. Optical microscopy images of Cu

transmission lines after the lift-off process using
negative photoresist: (a) port and (b) coupling gap.
In this research, the measured insertion loss of the
microwave BPF response in form of the S-parameter is
displayed along with simulated data in Fig. 2. In Fig. 2,
both simulated and measured results are compared in
the frequency range of 1.05.0 GHz. The simulation
results showed that the minimum insertion loss of the
BPF is 3.5 dB, compared to the experimentally
determined value of 9.5 dB. Consistent with the results
of filter characterization, we observed small differences
between experimental and simulation results. These
Fig. 2. Experimentally measured and simulated Sparameter of the BPF (a) and its structure (b).
4. Conclusions
References
[1] R.S. Tomar and P. Bhartia, New Quasi-Static Models
for the Computer-Aided Design of Suspended and Inverted
Microstrip Lines, IEEE Trans. Microw. Theory Tech, pp.
453-457, April 1987.
[2] J. Akedo, Room Temperature Impact Consolidation
(RTIC) of Fine Ceramic Powder by Aerosol Deposition
Method and Applications to Microdevices, J. Therm. Spray
Techn, Publisher, pp. 181-198, December 2007.
- 478 -
P2-06

!
"

!
#
$

&%

'!()* +
,

-

'" " % %

7#%0% 389
%
! "#

!# % %%% "
% %#% % %
% % )%* % '2
!# % % "
%%# "3 !#%%
% # ) %
#% -%%%%%"
%#%%.00;:!/

!# %% $ " %
$ $ # &$%#
' '('%%%
) %" " % # #
* + #) * )' %
#')"*
# " # % ) %
%*%% ,$ # ) %
!# % # '
)*%
# '% " # % -% '' #
) )% # % #
%%.!/
0%.!/ !# # #
%"00,%1 %
%# # % % 1
%%#'2
43 56
#% '' ' # %
% "% "" %
# # # % %%
+ # % %
$"
% "

!# % %% # %'"
#%%%%%%
# - # # % " %
." < # )%* % " < #
%/
!#%*%'" #
% # % * % # *
% &% # #'# " # )%*
% # "
*%"#%* -##
% " # % % " # *
% # )%* %
*'
- 479 -
ICEIC 2015
& '

-5 7#%*'
" % * " # %
"%%# "1 &8'%%
# % % " 5 # % !* 3
%# % # %% " % *
% , " % !# % %% %#
"%%#>="%
$"
,
" %#&+

!%#&+-#

%
./
1??
8??
$"
!% "

%%
./
1?> ?3
8?B 99
""
./
> ?3
B 99
7
.=/
1 >3
1 93
*%

C ' %
+ # '" " # %% &%
% # % %% % #
* " % !# %% " % %%
" # % %
* '% # * #
" " , % !# % %%
' #%%# "%%#
>= !#%%"#%'' *%%#*%%
"#"#
$"
&
" )(

)()"

% -)
""
7
./
./
./
.=/
35?
353 9@
3 9@
3 1@
39?
3@8 93
@ 1A
8 9?
1??
3A5 >B
> 51
1 93
. "

& 5 %# % # " " # 0% 389
%%%' !#%%"0%
389 % % %# " > * 1
%# % # 0% 389 % %% !#
% %% '' % # 7
('%% ##%%%#>=%
$"
* "
%#&+
!#% $ % %'' * # 0) :

!#0'0

436 ! : : : 0'# D 2
D %$ D 0* -''% "
)% # !$ ; ;C

&
416 - #% - #" E% @??F-
'* % " # "
G%%%%%
%H; 777 ' 0" ) 1
'' A8?IA883AA@
486 - #%
:%# !#- ;
0 EJ% " %
%''"!J %#+#%H ;
C:K?50" 1??5
456 L
0 + & -
E0-!L
-:F- '* H
:# -) 8B9'' 1A9I8?83AA9
- 480 -
P2-07
Analysis for optimal operational amplifier of transimpedance amplifier

Chang-In Park, Kwang-Jin Kim, Chang-Gun Kim, Byung-Hee Son, Jun Yin
and Young-Wan Choi
School of Electrical and Electronics Engineering, Chung-Ang University, 221 Heuksuk-Dong,
Dongjak-ku, Seoul, 156-756, Korea
ychoi@cau.ac.kr
Abstract
Bandwidth of the lock in technique is an important
factor in photonic bio-sensor, and is determined by the
bandwidth of a transimpedance amplifier (TIA).
Bandwidth and noise gain of a TIA with operational
amplifier are affected by the junction capacitor (CD) of
photodiode (PD), frequency response of op-amp, and
feedback component. This paper shows that the TIA
has trade-off relation between bandwidth and noise
gain. It is indicated that design of optimal TIA should
be the selection of op-amp proper for a given input
capacitance.
input capacitance (CIN) and feedback capacitance (CF).

TIA bandwidth is affected not only RF, CIN and CF but
also GBWP (gain bandwidth product) of op-amp. TIA
has relatively a wide bandwidth due to the influence of
the GBWP with op-amp. NG (noise gain) is decided by
1of (feedback factor). [2], [3], [4]
CF
RF
Iin
Keywords: Noise gain, Bandwidth, Transimpedance

amplifier, Junction capacitance
PD
Op-amp
CIN
Vout
VCM
1. Introduction
Figure 1. TIA using op-amp
3. Relationship of NG and bandwidth

G
85.5 k 249 k 745 k 2.27 M
80
77
GBWP 78.5 MHz

GBWP 7.85 MHz
GBWP 785 kHz
GBWP 78.5 kHz
60
Gain(dB)
Recently, detection systems for photonic bio sensor

have been intensively studied. High sensitivity in the
detection system is required for high resolution. Lockin measurement has been proposed as a detection
technique for high sensitivity. [1] A transimpedance
amplifier (TIA) is used as I-V converter in front-end of
the detection systems for photonic bio-sensor, because
the output signal from optical biosensor is current
signal. Particularly, TIA needs to be designed carefully
since it determines the bandwidth of the detection
system.
.
40
20
2. TIA principle
0
Figure 1 shows circuit of the TIA using op-amp.

Mathematically, TIA gain is decided by input
impedance and feedback factor. However TIA gain can
be estimated by the feedback resistance (RF) because
feedback resistance (RF) is very large compared to the
- 481 -
10
100
1k
10k 100k 1M 10M 100M 1G
Frequency(Hz)
Figure 2. TIA 3-dB bandwidth according to

increase of GBWP
ICEIC 2015
In order to evaluate the relationship of NG and

bandwidth, we perform simulation by changing the
condition in GBWP of op-amp using matlab. Figure 2
shows the nonlinearity of the increase in TIA
bandwidth. This nonlinearity is caused by the limitation
of CF depends on fixed CIN. These simulation results
indicate that the TIA bandwidth has a limitation,
although GBWP continually increase.
GBWP 78.5 MHz
GBWP 7.85 MHz
GBWP 785 kHz
GBWP 78.5 kHz
GBWP 78.5 MHz
GBWP 7.85 MHz
GBWP 785 kHz
GBWP 78.5 kHz
50
Op-amp
40
Gain(dB)
30
harmonic frequency for portable sensors. Electronics Letters

2010. 07.
[2] Jerald G. Graerme, Applications of Op Amps.
McGRAW-HILL. 1999.
[3]G Philip C. D.Hobbs, Photodiode Front Ends The REAL
Story. Optics & Photonics News April 2001.
[4]
TEXAS
INSTRUMENTS,
AN-1803 Design
Considerations for a Transimpedance Amplifier.
Application Report, 2008.
i
20
10
Noise gain
0
-10
-20
1
10
100
1k
10k 100k 1M 10M 100M 1G
Frequency(Hz)
Figure 3. Noise gain according to increase of

GBWP
Figure 3 shows the change in the NG by the GBWP
of op-amp. These simulation results indicate that the
NG of TIA also increases with the change of the
GBWP. NG is decided by 1 of The is also affected
by the CF. For this reason, increase of NG is caused by
the restriction of CF depends on fixed CIN.
4. Conclusion
This paper simulated that the TIA has the trade-off
relation between bandwidth and NG. The simulation
results show that the TIA should be designed in
consideration of a fixed CIN in order to have high
bandwidth and low noise gain. It is applied to design an
optimal TIA in a photonic bio-sensor system.
Acknowledgement
government (MSIP) (No. NRF-2012R1A2A01011488)
References
[1] H -H Son, I I Jung, N P Hong, D G Kim and Y W
Choi, Signal detection technique utilizing lock-in 2C
- 482 -
P2-08
Position Estimation Method Using Magnetic Field Map and INS

Han-Sol Kim1, Hyo-Jun Son1, Kwang-Il Han and Kwang-Ryul Baek1
1
Department of Electrical Engineering, Pusan National University, Busan, 609-735, Korea
hsv138@pusan.ac.kr
method result has many candidate positions as shown

in figure 5.
Abstract
This paper proposes position estimation method
using magnetic field map and INS. Absolute position
can be estimated by the magnetic field map method.
However, a different position can be estimated
incorrectly by noise. In order to solve this problem,
this paper proposes method of improved accuracy by
integration of magnetic field map method and INS.
Keywords: Magnetic field map, absolute position,
position estimation, INS
1. Introduction
In indoor, a geo-magnetic field is distorted by pillars
and steel structure [1-2]. So, the magnetic field that is
measured by mobile robot is not same at each position.
The measured magnetic field at whole point of desired
region create magnetic field map. So, a mobile robots
absolute position can be estimated by the magnetic
field map method. However, many candidate positions
can be estimated by sensor noise. This paper proposes
improved position estimation method using magnetic
field map and INS.
Figure 1: Real position of mobile robot
2. Position estimation
In this paper, the mobile robot has INS and
magnetic field map method system. INS estimate
relative position. This method can be divergence by
cumulative error. The magnetic field map method
estimated absolute position. This method can estimate
many candidate positions. In order to solve these
problems, this paper proposes integrated method of
INS and magnetic field map method.
The mobile robot moves circular motion as shown
in figure 1. The INS result is divergence as shown in
figure 2. The Magnetic field map method uses two
maps as shown in figure 3-4. The magnetic field map
- 483 -
Figure 2: Estimated position using INS
ICEIC 2015
Table 1: Statistics of sensor noise

Accelerometer
Gyroscope
Magnetic sensor
Standard deviation
4.7mg
0.6
0.173uT
Table 2: Statistics of the position error

Proposed method
Figure 3: Horizontal direction Magnetic field map
Mean
81.1484
Variance
7.2520e3
The integrated method is processed in the following

sequence. First, the mobile robot estimate candidate
region by INS. Last, the magnetic field map method
estimate mobile robot position around candidate region.
The integrated method result is shown in figure 6.
3. Simulation
Figure 4: Vertical direction Magnetic field map
The mobile robot has 3-axis gyroscopes, 3-axis

accelerometers and 3-axis magnetic sensors. An each
sensor noise distribution is assumed Gaussian
distribution and 0 mean. The each sensor standard
deviation is shown in table 1. The mobile robot moves
circular motion around the center of the map.
Simulation result is shown in figure 6 and table2.
4. Conclusion
Figure 5: Estimated position using a magnetic

sensor
The integrated method of magnetic field map and

INS is verified by simulation. The result of simulation,
a proposed method has low position error. However, a
proposed method is unlikely to divergence than INS.
And result position is only one. Improving the
performance of the position estimation using magnetic
field map is our further work.
References
[1] Brandon Gozick, Kalyan Pathapati Subbu, Ram Dantu,
and Tomyo Maeshiro, Magnetic Maps for Indoor
Navigation , IEEE Transactions on Instrumentation and
Measurement, VOL. 60, NO. 12, pp. 3883-3891, December
2011.
[2] Han-Sol Kim, Woo-Sung Moon, Woo-Jin Seo and
Kwang-Ryul Baek, Position Estimation Using Magnetic
Field Map, Journal of Control, Robotics and Systems, VOL
19.4 pp. 290-298, April 2013.
Figure 6: Estimated position using proposed

method
- 484 -
P2-09
Application of relay-feedback to air-foil bearing BLDCM

Yeon-Keun Jeong, Han-Sol Kim, Dong-seok Lim and Kwang-Ryul Baek
Pusan National University, Republic of Korea
busker@pusan.ac.kr
Abstract
Motor is used many application and important to
control depending on the application. Now, control
method is many. In this paper, we suggest control method
and auto-tuning method for air-foil bearing motor. Air-foil
bearing motor is used industrial application as air blower,
compressor, etc. Auto-tuning method, relay-feedback, was
used to motor control with consider characteristic of airfoil bearing motor.
Keywords: Auto-tuning, Relay-feedback, Air-foil
1. Introduction
The Blushless Direct Current (BLDC) motor is used in
industrial application system. Usually, PID controller is
widely used in BLDC motor control. PID coefficients are
calculated based on system model. However, it is difficult
to analysis model of motor. Usually, engineers determine
PID coefficients by experiment and investing many time.
Air-foil bearing motor is used many industrial application
system as blower, compressor, etc. Characteristic of airfoil bearing motor is changed rapidly. So, it is necessary to
adaptive control.
Auto-tuning is a powerful control technique to solve the
above problem, which is based on an adaptive estimation
algorithm[1]. Auto-tuning method is widely used to
Ziegler-Nichols type. Ziegler-Nicholss auto tuning
method is separated self-oscillation feedback and step
response feedback. In this paper, we used relay feedback
method of the self-oscillation feedback method to occur
oscillation.
2. Auto-tuning
Figure 1. Relay feedback auto-tuning scheme

speed is increased. After that, error is negative and relay
output change to negative. If relay output is negative,
motor speed is decreased. If error is positive, relay output
changed to positive and motor speed is increased. This
process shown in Figure 2.[2]
We can determine ultimate coefficient and oscillation
period from relay output and plant output as motor speed.
Ultimate coefficient is
Ku
4a
a : plant output ' s amplitude
(1)
u : relay output ' s amplitude

Tu
y(t)
u(t)
u
Figure 2. Oscillation curves of relay output

and plant output
After get ultimate coefficient and oscillation period, we
can determine PID coefficient by using Ziegler-Nicholss
PID coefficient table. (Table 1) Engineer can choose PID
coefficients with control type.
Figure 1 is relay feedback auto-tuning scheme. In first

operation, switch is connected to relay and get PID
coefficients. In second operation, switch is connected to
PID controller and start control.
Relay input is velocity error, relay output is target current
. Initial relay output is positive. After system delay, motor
- 485 -
Kp
Ki
Kd
-
P control
0.5*Ku
PI control
0.45*Ku
1.2*Kp/Tu
PID control
0.6*Ku
2*Kp/Tu
Kp*Tu/ 8
Table 1. Ziegler-Nicholss PID coefficient
ICEIC 2015
torque
Flight point
ref
J0
J1
Figure 3. Result of traditional method and

relay feedback method
speed
outside
Figure 3 is result of traditional method and relay feedbac

k method. Relay feedback method is high performance bett
er than traditional method. That analysis is shown TABLE
2. However, the main inconvenience of the pumping meth
od as traditional method, which can be damageable for the
process if the oscillation amplitude reaches a high level. So,
we proposed relay feedback method.[3]
In general, relay feedback method is set reference value
to 0. However, difficult to control motor to change motors
rotation. In this paper, we suggest improved relayfeedback method. That is relays reference point is biased
value not zero.
center
Location of shaft
Figure 4. Torque-speed curve and flight point
5. Conclusion
In this paper, we proposed relay-feedbacks reference
point from characteristic of air-foil bearing motor. So,
system process is shown Figure 5. This process is used to
unknown plant that rapidly change characteristic system as
centrifugal compressor with air-foil bearing motor.
START
3. Air-foil bearing motor
MAINTENANCE
ref
Air-foil bearing motor is widely separated two-state by

shaft location. By shaft location, air-foil bearing motors
characteristic is change. In the beginning, shaft location is
outside and converge to center while rotate. Figure 4 is airfoil bearing motors characteristic of torque-speed. In
initial operation, torque is constant. By increasing motor
speed, torque is decrease likes precipice. When torque
decrease rapidly, that point is shaft location center, flight
point.
Therefore, we set relays reference value to flight point.
We should know flight point. First, ref - 0 is constant to
J0. At the flight point, torque is decrease rapidly and to
be ref - 1= J1. Then 0 is which was constant is change
to J1, we can know flight point from J change. J is mass
is changed?
NO
YES
RELAY FEEDBACK
DETERMINE
PID COEFFICIENT
SPEED
CONTROL
Figure 5. System process
moment of inertia. is acceleration.

Traditional method
Relay feedback
method
Settling time
4.3s
2s
Over shoot
19%
2.438%
Steady-state
average speed
2002.806 RPM
2000.365 RPM
Ripple error
1.455%
0.907%
TABLE 2. Compare result of Traditional method and

Relay feedback method
References
[1] Y. A. R. I. Mohamed, Adaptive self-tuning speed control for
permanent magnet synchronous motor drive with dead time, IEEE
Transactions on Energy Conversion, Vol. 21, No. 4, December 2006.
[2] Zhuquan Shen, Lina Wang, Kun Xiao, Relay Auto-tuning of Twostage Matrix Converter based PMSM drives, Electrical Machines and
Systems(ICEMS), August 2011.
[3] F.Leonard, R.Oubrahim, TWO STEPS RELAY AUTO-TUNING IN
THE PRESENCE OF STATIC LOAD DISTURBANCE, Conf. Publ. No.
- 486 -
P2-10
An improved adaptive on-time control scheme for reducing

switching frequency variation in valley current mode buck converters.
Hyeok-Kyu Kwon, DongKeon Lee, Suncheol Yang, Raehong Kim, Hang-Geun Jeong
Chonbuk National University Electronic Engineering
hgjeong@jbnu.ac.kr
Abstract
In this paper, an improved adaptive on-time control
circuit is proposed to reduce the switching frequency
variation against the input voltage change in valley
current mode buck converters. The existing adaptive
on-time circuit suffers from the non-ideal inputvoltage-to-current conversion characteristics due to
the diode connection used in the current mirror. In this
paper, the current mirror is operated in the linear
region to reduce the voltage across the current mirror,
thus making the voltage across the conversion resistor
close to the input voltage. The proposed converter has
been designed with a 0.35m process technology. The
nominal switching frequency is 2MHz. The input
voltage is 3.3V and the output voltage is 1.8V. The
output ripple voltage is about 10mV with a 4.7F offchip capacitor and 4.7H off-chip inductor. The
steady-state switching frequency of the proposed
converter has a variation of less than 0.1% when input
voltage is varied from 2.8 to 3.8V.
Keywords: PMIC, DC-DC Buck Converter, Adaptive
on-time(AOT), Valley current control. Switching
frequency variation.
1. Introduction
Recently, portable electronic devices are in great
demand. Switching mode dc-dc converters that have a
high efficiency are essential in these devices for
maximizing battery use time.
The typical voltage mode DC-DC converters have a
slow transient response. To improve transient response,
various techniques have been reported[1]-[3]. One of
the techniques is a current mode constant on-time
control method[4]. However, constant on-time control
converter suffers a switching frequency variation when
the input voltage is changed. To solve this problem,
adaptive on-time control(AOT) has been used. In the
typical implementations of the adaptive on-time circuit,
a diode-connected MOSFET is used to generate a
current inversely proportional to the input voltage.
Thus the generated current can significantly deviate

from the ideal inverse relationship.
In this paper, an improved adaptive circuit is proposed,
in which the diode-connected MOSFET is replaced by
a MOSFET operating in the triode region. The
improvement has been verified through circuit
simulations.
2. Valley current mode control with

adaptive on-time
A. Valley current mode dc-dc converter
Various control techniques can be used in a current
mode converter. One of the techniques, a peak current
control is unstable when the duty ratio is larger than
0.5. So, for stability, this method needs a slope
compensation[4] while a valley current control does
not need slope compensation. As a result, the valley
current control can operate with fast transient
response[5].
The block diagram of the buck converter and its
waveforms are shown in Fig. 1. Like conventional
current mode converters[6], the proposed valley
current mode converter uses, as the control
signal(reference current ), which is the output of
error amplifier [1]. When the power transistor is off,
the inductor current decreases. Once the inductor
current becomes lower than the control signal, the
comparator signal is generated. This signal changes the
input of SR latch, S to high level. As a result, the
output of SR latch, Q is triggered from low to high.
The SR latch signal turns on the transistor and is
used as the input signal of the adaptive on-time
generator. At this time, the inductor current
increases. The on-time is determined by the adaptive
on-time circuit. After the on-time elapses, the output
signal of the adaptive on-time generator resets the SR
latch, and the SR latchs output Q goes to the low state.
Consequently is turned off, and decreases again.
In this way, the valley current mode buck converter
can control the output voltage.
B. Adaptive on-time generator
- 487 -
ICEIC 2015
Buffer
Fig. 2 The ideal adaptive on-time generator circuit.
equal to the capacitor charging time and can be

written as in (1).

(a)
As shown in Fig.1 (b), the steady-state switching

frequency can be expressed as in (2).

Hence, the switching frequency can be obtained

from (1) and (2), and can be written as in (3).

As a result, steady-state switching frequency is

independent of the input voltage and the output
voltage .
3. Proposed adaptive on-time generator

h. Basic idea
(b)
Fig. 1 (a) The block diagram of the proposed buck converter
and (b) Its waveforms.
Typical current mode converters use a constant ontime control. But a constant on-time control has a
problem that the switching frequency varies when the
input voltage is changed. To solve this problem, an
adaptive on-time control that adjusts the on-time has
been used[5]. Fig.2 shows the ideal adaptive on-time
generator circuit. In this circuit, a capacitor is charged
with a variable current source that is inversely
proportion to the input voltage, and the on-time is
determined by comparing the capacitor voltage with
the output voltage. In Fig.2, the turn on-time is
The designed adaptive on-time generator circuit is

shown in Fig. 3. In order to copy current for the
capacitor, the conventional adaptive on-time generator
circuit uses a current mirror. In this case, the switching
frequency variation occurs because of the gate-source
voltage of in the current mirror when the input
voltage is changed (the gate-source voltage of
NMOS is about 0.6-0.7V). So, the conventional
converter switching frequency is not defined as in
(3) but as in (4).

The proposed circuit does not use diode-connection

for reducing switching frequency variation when the
input voltage is changed. Rather is operated in the
- 488 -
ICEIC 2015
linear region and the voltage across the resistor is
close to ( in the range of several or several tens
of mV). For copying a current, a negative feedback is
used instead of current mirror in the proposed circuit.
As a result, the proposed converter switching
frequency can be written as in (5).
input voltage . The switching frequency of the

proposed circuit is shown in (5). is a function of
and . By expressing as a function of , the
switching frequency can be defined as a function of
the input voltage .

B. Analysis
In order to determine the switching frequency
variation in each circuit when the input voltage is
changed, the switching frequency is expressed as
function of the input voltage .
In the conventional circuit, the switching frequency
can be expressed as in (4). The current flowing
through the resistor is equal to the drain current of
( . It is written as in (6).

This equation can be rewritten as in (7).

Therefore be obtained as in (8).

In (8), are determined by

the design. Because is operated in the saturation
region, can be chosen between the two solutions.
Consequently can be defined as a function of the
Equation (11) is used to define as a function of

the input voltage .
3. Simulation result
The proposed valley current mode dc-dc converter is
designed in a 0.35 m CMOS process. The input
voltage is 3.3V and the output voltage is 1.8V.
The nominal switching frequency is 2MHz. The
output ripple voltage is about 10mV with a 4.7F offchip capacitor and 4.7H off-chip inductor. The
designed adaptive on-time generator circuit is shown in
Fig. 3. The converter can operate either with the
conventional adaptive on-time circuit or with the
proposed adaptive on-time circuit.
Fig. 4 shows the steady-state wave forms of the
inductor current when the input voltage is varied. From
this figure, the switching frequency can be determined.
As a result, the switching frequency of the
conventional circuit is much lower than nominal
switching frequency and has a variation of more than
10%, while the switching frequency of the proposed
circuit is close to the nominal switching frequency and
has a variation of less than 0.1% when the input
voltage is varied from 2.8 to 3.8V.
4. Conclusion
Fig. 3 Designed adaptive on-time generator circuit.
In this paper, an improved adaptive on-time circuit is

implemented by operating the current mirror in the
linear region with a negative feedback instead of a
simple diode connection. The designed circuit was
verified by circuit simulations. As a result, the
switching frequency of the proposed circuit is close to
the nominal switching frequency and has a variation of
less than 0.1% when the input voltage is varied from
- 489 -
ICEIC 2015
(a)
(b)
(c)
(d)
(e)
(f)
Fig. 4 The steady-state waveforms of inductor current., (a) Conventional AOT at input voltage 2.8V. (b) Proposed AOT at
input voltage 2.8V. (c) Conventional AOT at input voltage 3.3V. (d) Proposed AOT at input voltage 3.3V. (e)
Conventional AOT at input voltage 3.8V. (f) Proposed AOT at input voltage 3.8V.
2.8 to 3.8V. Fig. 5 shows comparison results of steadystate switching frequency variation when input voltage
in varied.
Acknowledgment
This work was supported by the Brain Korea 21 PLUS
Project, National Research Foundation of Korea, and
the CAD tools were supported by the IC Design
Education Center(IDEC), Korea
References
[1] J. Abu-Qahouq, H. mao, and I. Batarseh, Multiphase
voltage-mode hysteretic controlled dc-dc converter with
novel current sharing, IEEE Trans. Power Electron.,
vol. 19, no.6, pp.1397-1407, Nov. 2004.
[2] S. C. Tan, Y. M. Lai, M. K. H. Cheung, and C. K. Tse,
On the practical design of a sliding mode voltage
controlled buck converter, IEEE Trans. Power Electron.,
vol. 20, no. 2, Mar. 2005, pp. 425-437.
[3] X. Duan and A. Q. Huang, Current-Mode variablefrequency control architecture for high-current lowvoltage dc-dc converters. IEEE Trans. Power Electron.,
vol. 21, no.4, pp. 1133-1137, July, 2006.
[4] C.F. Lee and P.K.T. Mok, A monolithic current-mode
CMOS dc-dc converter with on-chip current-sensing
technique, IEEE J. Solid-State Circuits, vol.39, no. 1, pp.
3-14, Jan. 2004.
[5] H.-C. Lin, B.-C. Fung, and T.-Y. Chang, "A current
mode adaptive on-time control scheme for fast transient
dc-dc converters," IEEE Int. Symp. Circuit Syst., pp.
2602-2605, May 2008.
W.Erickson and D. Maksimovic, Fundamentals of Power
Electronics. Norwell, MA: Kluwer, 2001.
Fig. 5 Comparison results of steady-state switching

frequency variation when input voltage is varied.
- 490 -
P2-11
Implementation of Fully Digitalized Switch-mode DC-DC Converter without

ADCs and Its Application to LED Driver
Jae-Hyoun Park*, Hyung-Do Yoon
Korea Electronics Technology Institute
jhpark@keti.re.kr
Abstract
For application to an LED driver, a new digitalized
switch-mode DC-DC converter is implemented using a
-processor and a comparator, without any ADC used.
The -processor has a digital counter and a PWM
generator. The proposed buck type converter can
operate as a constant off-time mode as well as a fixed
frequency mode. A delay routine added in the digital
counter prevents system instability caused by a high
speed clock.
Keywords: LED driver, DC-DC converter, digitalized,
without ADC
1. Introduction
Basically, a DC-DC converter is a core technology
of an LED driver, of which the main part has been
designed by an analog system [1]. The analog control
systems suffer from design complexity in spite of their
obvious advantages of a low cost and a wide bandwidth
[2]. Some attempts about digital control systems have
been successfully reported [2, 3]. Advantages of these
digitalized systems are high noise immunity, robust
design, and design flexibility [2, 3]. Furthermore, more
advanced and complex control algorithms such as
power management interfaced with sensors can be
implemented using digital technologies [3]. The
majority of the digitalized DC-DC converter is realized
using an analog-to-digital converter (ADC) which has a
quite large amount analog block [2, 3]. To obtain the
basic advantages of digital control systems, those
systems should be realized without any ADC used.
Recently, LED system lighting or smart lighting has
been spotlighted, which includes wire and/or wireless
communications and processor control parts based on
multiple sensors. This LED lighting requires not only a
simple LED driver but also digital processors to realize
complex functions, which is good reason for need of an

LED driver based on a digitalized DC-DC converter.
In this research, a new digital control algorithm for a
switch-mode DC-DC converter is proposed. The
proposed algorithm is verified through a fabricated
evaluation system which makes a special feature of
using a -processor without ADCs. For system stability,
a delay routine is added in the digital counter and a
constant off-time mode as well as a constant frequency
mode is realized. Additionally, this converter is applied
to drive a multi-string LED load.
2. Overall System Configuration

A schematic of the proposed converter with an LED
load is shown in Fig. 1, consisting of a -processor and
a comparator. The -processor has digital up/ down
counters and PWM generators and plays essentially the
same role as a pulse-width-modulation (PWM)
controller of a conventional DC-DC converter. This
converter forms a buck converter with peripherals such
as switching devices, an inductor, and a capacitor.
A flow chart for the proposed algorithm is shown in
Fig. 2. After power-on-reset, PWM switching
frequency or off-time is properly set according to an
operation mode. Simultaneously, the bit size of the
digital counter, which will affect the PWM resolution,
is determined by the ratio of clock frequency and PWM
frequency. And then the output voltage is compare with
the target voltage or reference voltage VREF. If the
output voltage should be increased or the comparator
output is high, the digital counter is up-counted and its
binary value is converted to a PWM signal which has a
duty ratio directly proportion to this binary value. The
switching devices are controlled by this PWM signal.
Thus, the output voltage of the buck converter is
increased. Conversely, the output voltage should be
decreased or the comparator output is low, the digital
counter is down-counted and then the other processes
are nearly the same.
- 491 -
ICEIC 2015
Fig. 3. Photograph of the fabricated evaluation

system and its LED driving result
VDDH = 50V, 7-sereis LED
Fig. 1. Schematic of the proposed DC-DC converter
(a) Constant frequency mode

VDDH = 50V, 13-series LED
(b) Constant off-time mode

Fig. 4. PWM signal as a function of supply voltage for
constant frequency mode and constant off-time mode
Fig. 2. Flow chart of the proposed converter

The photograph of the fabricated evaluation system
with four-string buck converters and its LED driving
result are shown in Fig. 3. In this system, PWM
frequency for a constant frequency mode and off-time
for a constant off-time mode are set to 250kHz and 2s,
respectively. The bit size of the counter is set to 6-bit.
The PWM signals controlled by this digitalized
converter are shown in Fig. 4. According to the ratio of
the output voltage and the supply voltage VDDH, the
duty ratio of the PWM signal is well controlled whether
a constant frequency mode or a constant off-time mode.
Fig. 5 is the PWM signal jitters as a function of
delay time. Because these jitters are caused by
oscillation of the counter value owing to high speed
clock, a delay routine can reduce these jitters. At
32TCLK delay, this converter has few jitters except a 1bit digital error, where TCLK is a clock period.
4. Conclusions
A new digitalized switch-mode DC-DC converter
without ADCs is successfully implemented and applied
to an LED driver. This digitalized converter can be
effectively applied to LED system lighting which
includes a control part for communications and
interface with multiple sensors.
(a) 4TCLK
(b) 32TCLK
Fig. 5. The jitters as a function of delay time
Acknowledgment
This work was supported by LED System Lighting
R&D program of KEIT [10042947].
References
[1] Y. Hu and M. M. Jovanovi, LED driver with selfadaptive drive voltage, IEEE Trans. Power Electron., vol.
23, no. 6, pp. 31163125, Nov. 2008.
[2] L. Guo, Implementation of Digital PID Controllers for
DC-DC Converters using Digital Signal Processors, Proc.
IEEE Electro /Information Technology Conf., pp. 306311,
May 2007.
[3] T. Jackum, G. Maderbacher, and R. Riederer, A
Digitally Controlled Linear Voltage Regulator in a 65nm
CMOS Process, Proc. IEEE Intl Conf. on Electronics,
Circuits, and Systems, pp. 984987, Dec. 2010.
- 492 -
P2-12

!
#" $%& '% (
! )

+* -
,

+//0/ $!(.
1

*

"! !!

"!#

$# %"'" ! &"
! ( #'! ! !' &
$'" !&&"
#""&&"!'+*,)
"! ! && " !'
! & & # "#
( & "! '(" &" !
" &" #" & " -#)
! ! # "
!'&!#!" " !
!'"#&#!)'"
&&' ! ! "
# " !&& & '"
( (!!!! &
%#! #"! ! ! #"
#"" )
!! &""
&"" !#"! '" " & !!
# ## ! & !#

(.!+/0,)
! ! ! ! &(! %
#! !! " #$" &
!'"##"!! %#!!
& # " # ! ! !
".! # ## #" !
$#)1&!#"&
%#!#"!'"!
' ! # #! ! !!
&(!')

$! %

1 & ! # &( &
!'!( 2/43&"
%"#$"" ##
2 3 &" 5 " (! 076
8 3 ) 1 #&
& (! ! #$" " 6)662%
6)667 9: ! /666 9: #'") &
'##& $! &" !
& ! ; '
#5 &! ( ; ( !
!&**=<=63>'
! & !! ( &! !
! ( "3 !
'!(")
?"3 &$! ! '!
(6)/6)=*)6/)60)6!=)6
&(@#&" ' )A
#" ! !' #3 !
#&! #)

&!

- 493 -
#" ! #& " &

!! &(! '
ICEIC 2015
! " "%

-# 1 B &
" ( C D) 1 " #"
"( !/8#"!!
$ & @6 E> ! ' (
&*=6CG*6FD!'!
' #"! ) 1
!$ !!
""! ( EB " &!
3& @
' & '! *%/
E>!!(2)777!C D<)
1"!!&
) 1 # '& #" #
##!"!"&
! &"" "'" "") A *
# # &
#!" &
(!/" !)A /
& # "
!! ' ##"" (
" !
)

' % $! + %

) *
,!-

! !'"#! %#!
! #& &
#"##!')A
%#! " ! !
(! " #$" & ! !
')"&
!' &$! ! " (
'! #'##"
& !' ! #
#' (!) I! "
! ## !
&&!'/!
&!(#")

.
%

' % "! ( )

*

)

+
H ' ## & #"! !

# # ! #! # ##
$#&&(!
!! (' &! /
! !! # ! &
#" ! ! &
##& "!(".&
!'#!)

1 3 ##! ( B'" E"

1" B#B)

+*, J B) E K1 ! &&
"L1)" '")00)=
##)**/=*M7@
+/,)J)E) ) ) ) B ) ) B ! ) )
KA( & " ! & !

L " & 27 ##)
*=*2/66@
+0, E) '%E; E) ! ) B! ! )
B!%!K"#!& L'") M ##)
20*/66@
- 494 -
P2-13
A 6-b 1-GS/s Adaptive Input Dynamic Range ADC

Using Double Reference-Level for Radar System
Hye-In Lee1, You-Sun Won1, Chung-Hwan Kim2, and Sang-Gug Lee1

Dept. of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, Korea
2
Wooriro Optical Telecom Co., LTD, Gwangju, Korea
Email: hyein_lee@kaist.ac.kr
2. Architecture
Abstract
This paper presents a 6-b 1-GS/s adaptive input
dynamic range using double reference level for a radar
system. For adopting the input dynamic range, the 1-b sub
ADC generates an output bit depending on an input signal
voltage, which selects one between double reference-level
ladders of the 6-b core ADC to determine the input
dynamic range. By the adaptive input dynamic range, the
ADC can reduce the quantization error for smallamplitude input signal while providing rail-to-rail input
dynamic range for wide-power range of radar echo signal.
Simulation results show that the proposed ADC achieves
7.01-bits of ENOB for a Nyquist 1.2 Vpp differential input
signal while consuming 134.1 mW of total average power
from a 1.5V supply.
Keywords: A/D converter, adaptive input range, extended
resolution, flash ADC, radar system, rail-to-rail.
1. Introduction
In recent years, interest in automotive-radar sensors has
been increased for drivers safety and convenience. A radar
echo signal has wide-power range since location and radar
cross section (RCS) of targets are unknown. Thus, an ADC
for radar is required to have wide input dynamic range to
digitalize an input in wide-power range. However, a least
significant bit (LSB), that is a unit reference voltage step,
becomes larger when an input dynamic range is extended
with same resolution of ADC. An ADC with large LSB can
cause loss of amplitude information of an analog input
signal. In many radar systems, time-domain information of
echo signal is used to detect location of target and the
number of targets. Therefore, a wide input dynamic range
ADC that can reduce the loss of time-domain information
of an input is required for radar system. This paper reports
proposed adaptive input dynamic range ADC using double
reference levels to reduce the loss of amplitude information
of radar echo signal.
(a)
(b)
Figure 1. (a) The block diagram of the proposed ADC
and (b) the adaptive input dynamic range depending on
input signal voltage.
Figure. 1 shows the architecture of the proposed
adaptive input dynamic range ADC. As shown in Figure.
1(a), the ADC consists of a 1-b sub ADC for deciding
input dynamic range and a 6-b core ADC for digitalizing
radar echo signal. As shown in Figure. 1(b), the proposed
ADC provides rail-to-rail input dynamic range for the wide
power range of input. When small input signal is entered,
thus wide input dynamic range is not required, the ADC
adopts the reduced input dynamic range for less
quantization error.
The differential input signals are connected to the input
nodes of two ADCs and the 1-b sub ADC compares an
amplitude of the differential input signals to half of fullscale amplitude. Then, this ADC generates one bit for the
6-b core ADC to adopt the input dynamic range. When the
input amplitude is larger than half of full-scale amplitude,
one bit become high then the core ADC has rail-to-rail
input dynamic range. While the input amplitude is smaller
than half of full-scale amplitude, one bit become low to
reduce the input dynamic range of core ADC by half of
rail-to-rail. Thus LSB of ADC is also reduced by half to
- 495 -
ICEIC 2015
reduce loss of amplitude information. Due to this operation,
for small-amplitude input signal, the ADC has same value
of LSB as one of 7-bit resolution in rail-to-rail input
dynamic range.
3. Design of the proposed ADC

The 6-b core ADC is adopted a flash architecture for
fast speed [1] and the comparator consists two stage of a
preamplifier and a dynamic latch. The preamplifier is a
switched-capacitor type for rail-to-rail operation [2]. The
1-b sub ADC consists two comparators with reference
voltages that are 3/4 VDD and 1/4 VDD and a digital
NAND gate. Two outputs of comparators are entered the
NAND gate and the NAND generates final output of the
sub ADC.
Figure 2. The reference generator of the proposed ADC.

Figure. 2 shows double reference-level ladders of the 6b core ADC for adaptive input dynamic range. As shown in
Figure. 2, the ADC utilizes two reference ladders
connected to the input node of the switched-capacitor
preamplifier for generating two input dynamic ranges. The
clock generator provides switch signals for the reference
generator by the output bit of the sub ADC.
A switched-capacitor preamplifier has two-phase
operation of sample mode and hold mode. In sample mode,
the input nodes of the preamplifier are connected to the
analog input signal. While, in hold mode, the input nodes
are connected to the reference ladder thorough the switch
of 2 or 3 . As shown in Figure.1 (b), when the input
voltage of the ADC is larger than 3/4 VDD and smaller
than 1/4 VDD, the clock generator provides VDD for 2
and GND for 3 to adopt rail-to-rail reference voltage. On
the other hand, when the input voltage is smaller than 3/4
VDD and larger than 1/4 VDD, the clock generator
provides GND for 2 and VDD for 3 to adopt the reduced
input dynamic range from 1/4 VDD to 3/4 VDD.
(b)
(a)
Figure 3. Simulation results. (a) rail-to-rail ramp input
test and (b) FFT spectrum for a Nyquist 1.2Vpp input.
Figure. 3(a) shows the results for a rail-to-rail ramp input.
As shown in Fig. 3(a), the total code of ADC is increased
from 64 of 6-b resolution due to the reduced LSB for
small-amplitude input signal. Figure. 3(b) shows the FFT
spectrums of the proposed ADC for a Nyquist 1.2 Vpp
differential input signal. The obtained SNDR/SFDR from
the proposed ADC and the 6-b rail-to-rail ADC, without
adaptive input range, are 36.02 dB/47.51 dB and 29.75
dB/40.97 dB, respectively. The peak SNDR and ENOB,
calculated from the obtained SNDR, are 43.98 dB/7.01 bits
and 37.71 dB/5.97 bit, respectively. Total average power
consumption is 134.1 mW from 1.5 V supply voltage
except clock buffers. The simulation results prove the
proposed ADC performs rail-to-rail operation while
increasing 1-b resolution for a small-amplitude input signal.
5. Conclusion
This paper presents a proposed 6-b 1-GS/s adaptive
input dynamic range ADC using double reference-level for
radar system. The ADC adopts the 1-b sub ADC and two
reference voltage ladders of the 6-b core ADC for changing
the input dynamic range depending on an input amplitude.
The ADC is suitable for a radar system due to that the
ADC can cover the wide power range of radar echo signal
and reduces the quantization error for small-amplitude
input signal to save envelop information with less loss.
Acknowledgment
MOTIE/KEIT. [10047107, 0.13um-CMOS 24GHz ISMband automotive short range radar]
References
[1] M. Choi and and A. A. Abidi, "A 6-b 1.3-Gsample/s
A/D converter in 0.35-m CMOS," IEEE J. Solid State

Circuits, vol. 36, no. 12, pp.1847-1858, December 2001.
The proposed adaptive input dynamic range ADC is

designed in a 0.13-m CMOS process with supply voltage
of 1.5 V. The simulation results are obtained at 1-GS/s.
[2] B.-S. Song, Micro CMOS Design. CRC Press, pp.120123, 2011.
- 496 -
P2-14
Design of Smart Driving Service using by Mobile Second Platform

Jonghwa Kim1, Songyi Kim1, Yesool Cha1, Byoungha Park1, Youngchoong Park1,
Kwang-Mo Jung1, and Seong-Dong Kim1
1
Department of Realistic Media Platform Research Center,
Korea Electronics Technology Institute, Seoul, Korea
{rmx2003, songyi828, art_world, bhpark34}@naver.com, {ycpark, jungkm, sdkim}@keti.re.kr
Abstract
The aim of this paper is to development of the smart
car service based on convergence open SW
Framework. We developed four major services and
designed flow and service activities of each services.
The services were designed as "smart start & pic-navi
", "UX mirroring", "turn up my mood", and "parking
concierge and monitoring". We hope contribute in
smart car business and advance the mobile second
convergence life through these services.
Keywords: Smart Car, Mobile Second Convergence
life, Smart Driving.
Figure 2: System Relation and Action
1. Introduction
Communication technology has been evolved
smartphone from wire telephone. Smartphone makes
new service converging with everything [1]. Through
this evolution, new era of mobile second convergence
life is emerging [2-3]. In this paper, smart driving
service using by mobile second platform was designed
and proposed.
The system structure was designed as figure 1. This

system was consist of low-end devices (second device),
high-end devices (first device), IVI(In-Vehicle
Infotainment) of car, and service platform. The service
platform was based on mobile cloud system. Relation
of part of system was shown as figure 2.
3. Service Structure
2. System Structure
Figure 3: Relation between User Flow and Service

Activities
Figure 1: System Structure
- 497 -
ICEIC 2015
To design smart driving service, user flow and
action was defined shown as figure 4. Service activities
were analyzed considering user flow. The relation
between user flow and service activities was shown as
figure 3. Four major services were designed as "smart
start & pic-navi ", "UX mirroring", "turn up my mood",
and "parking concierge and monitoring". In figure 5,
activities of each system and user action was designed
as example of smart start & pic-navi service.
5. Conclusion
This paper proposed smart driving service using by
mobile second platform. The smart driving service was
consisted by multiple devices and cloud platform. The
services were designed as "smart start & pic-navi ",
"UX mirroring", "turn up my mood", and "parking
concierge and monitoring". We hope that the objective
of car will change as for service using this.
Figure 4: User Flow of Smart Driving Service
Acknowledgement
This research was supported by the Industrial Core
Technology of SW Computing program through Korea
Evaluation Institute of Industrial Technology(KEIT)
funded by the Ministry of Science, ICT and Future
Planning(No.14-824-10-011, "Development of the
Smart convergence SW framework based on open
software for new convergence services in mobile
seconds branch")
References
[1] W. Grieve, and S. Levin, "From Clones To Packets: The
Development Of Competition In Local Residential
Telecommunications", TPRC 2005 The 33rd Research
Conference on Communication, Information and Internet
Policy, 2005.
[2] H. Jenkins, "Convergence Culture", New York University
Press, New York, 2006.
[3] D.H. Shin, W.Y. Kim, and D.H. Lee. "Convergence
Technologies and the Layered Policy Model: Implication for
Regulating
Future
Communications"
International
Communication Association. Communication & Mass Media
Complete, 2006
Figure 5: Smart Start & Pic-navi Service Activities
- 498 -
P2-15
Buck-Converter using DT-MOS Switch with Short Circuit Protection

Han-hee Cho, Dae-yeol Yoo, Chung-kwang Lee, Hyun-young Kim, *Yong-seo Koo
Dept. of Electronics and Electrical Engineering, Dankook University, Korea
*Corresponding author
chohh530@naver.com
Abstract
This paper is proposed DC-DC Buck-Converter with
DT-MOS (Dynamic Threshold-voltage MOSFET) Switch.
The proposed circuit is evaluated and compared with MOS
switch by both circuit simulation and device simulation.
DT-MOS switch reduces the output ripple and the
conduction loss through a low on-resistance. Therefore,
proposed circuit has a excellent performance efficiency
than converter with conventional MOS switch. Proposed
circuit has switching frequency of 1.2MHz, 3.3V input
voltage, 2.5V output voltage, and maximum current of
100mA. Also, this paper proposes SCP(Short Circuit
Protection)circuit in order to ensure the reliability.
the leakage current is overcame by minimizing body

leakage current that is a conventional DT-MOS fault
through deciding supply and the ground [1].
Figure 1. Proposed DT-MOS
Keywords: DT-MOS, DC-DC, SCP, Buck-Converter
1. Introduction
Recently, the importance for power management
IC(PMIC) is emphasized as battery-powered portable
electronics such as tablet, mobile phone are commonly
used. For miniaturization and high efficiency, power
supply of these devices is replaced Linear-type with
SMPS-type. SMPS(Switching Mode Power Supply) is able
to increase the switching frequency to reduce the size of
the energy storage element. However, the switching
operation of the high frequency causes switching losses,
inductor losses and conduction losses.
Figure 2. Comparison of Threshold-voltage
2. Dynamic Threshold-Voltage MOS

Figure 3. Comparison of I-V characteristics
The proposed DT-MOS in this paper can be seen in
Figure 1. When the proposed DT-MOS switch is turned-on,
the threshold voltage is lowered by NMOS connected to
the diode. Therefore, when the proposed switch is turned
on, it has a threshold voltage lower than standard switch.
When the switch is became OFF, body of PMOS and
NMOS is connected to each the power supply and the
ground. Therefore, Limitation of power supply voltage by
Simulation was performed in order to compare the I-V

characteristics by using the MOS and DT-MOS with the
same W/L ratio. As shown in Figure 2, DT-MOS has the
threshold voltage lower than MOS. Therefore, conduction
of a large amount of current is possible at the same voltage.
Figure 3 is an I-V characteristics graph with increasing
Vds. It is possible that the DT-MOS has higher driving
current capability than MOS as shown in Figure 3.
- 499 -
ICEIC 2015
3. The Design of Proposed DC-DC Converter

Figure 4 is function block diagram of the proposed
buck-converter. Proposed converter operate as PWM mode.
PWM waveform is applied to the gate of DT-MOS switch,
and ON-OFF of switch is determined. Thus, the output
voltage is formed. Feedback voltage formed by voltage
divider is compared to a reference voltage using error
amplifier. The comparator generates a pulse by comparing
the saw tooth wave and error factor. Pulses generated by
comparator generates a pulse which is applied to the
NMOS switch and PMOS switch via the logic controller.
[2].
Figure 6. Result of SCP simulation
Figure 7. Result of line / load transient response

Figure 4. Function Block diagram
6. Conclusion
4. SCP(Short Circuit Protection)

Figure 5 is a block diagram of SCP(Short circuit
protection). If the load-node is shorted, a current sudden
flows. Thus, the IC is damaged and destroyed. To prevent
this, If the output voltage falls below the set voltage,
decreases the frequency of the clock. As a result, it is
possible to prevent the phenomenon of the inductor current
runway and to reduce the power consumption.
In this paper, the DC-DC Buck-converter with DT-MOS

(Dynamic threshold-voltage MOSFET) switch. DT-MOS
switch reduces the output ripple and the conduction loss
through a low on-resistance. So, proposed Buck-converter
has a excellent performance efficiency than converter with
conventional MOS switch. Also, Proposed IC was
protected from short circuit using SCP circuit.
Acknowledgment
This research was supported by the MSIP(Ministry of
Science, ICT & Future Planning), Korea, under University
ITRC support program (NIPA-2014-H0301-13-1007)
supervised by the NIPA (National IT Industry Promotion
Agency).
This work was supported by the Industrial Core
Technology
Development
Program(10049095,
Development of Fusion Power Management Platforms
and Solutions for Smart Connected Devices) funded By
the Ministry of Trade, industry & Energy.
Figure 5. SCP Circuit
References
Figure 6 is simulation results of SCP. Figure 7 is

results of line / load transient response simulation. For line
transient response, when input voltage is changed from
2.7V to 4.5V, Output has ripple voltage of 33mV. For load
transient response, when load current is changed from
100mA to 40mA, Output has ripple voltage of 6mV.
[1] Ming-Xiang Lu, sub-1V voltage-mode DC-DC buck

converter using PWM control technique, IEEE, pp1-4, 2010
[2] Smith, T.A., Using the on-resistance of a power MOSFET to
control a DC-DC converter, IEEE, pp.731-733, 1998
- 500 -
P2-16
A Study on On-Board Energy Storage system for Energy Regenerated from

Electric Train
Hanmin Lee
Korea Railroad research Institute
hanmin@krri.re.kr
Abstract
Recently, saving energy in the electric railway
system is studied. For such new energy saving, the ESS
is considered for storing energy. The on-board energy
storage system is simple solution to store the braking
energy and recycle it to powering vehicle. The onboard energy storage system as one of railway power
traction system will be inside the electric train. This
paper specifically presents the simulation effects of
applying an on-board energy storage system to the
Daejeon Line in South Korea.
Keywords: Energy saving, Energy storage system, OnBoard, Electric Train
1. Introduction
Due to the recent trend toward environmental
preservation enforcing more strict energy savings, all
transportation systems should reduce their energy
consumption to the absolute minimum. High-efficiency
operation systems, energy saving methods, and CO2
emissions have become vital issues in the railway
system, as well as in the other major public
transportation systems. Recently, saving energy in the
electric railway system is studied. For such new energy
saving, the ESS is considered for storing energy.
Energy saving is possible by efficient use of
regenerated energy. Regenerated energy is recycled
amongst vehicles by mean of charge and discharge
corresponding to powering and braking of electric
vehicle operations. This energy saving contributes to
cut CO2 to reduce greenhouse gas emissions. Recycling
regenerated energy demonstrate significant effect on
peak cut of consumption energy in railway substation.
In lines in which regenerative vehicles are used,
regenerated energy is recycled amongst vehicles for
efficient use. However, about 40% of excess energy
generated by braking vehicles will be wasted when no
powering vehicle is existed within effective distance.

This dissipation constitutes resistance heat at electrical
brake and frictional heat at mechanical brake[1-3].
The on-board ESS(on-board energy storage system,
here after) is simple solution to store the braking
energy and recycle it to powering vehicle. The onboard ESS as one of railway power traction system will
be inside the electric train. This paper specifically
presents the simulation effects of applying an on-board
ESS to the Daejeon Line in South Korea.
2. On-Board ESS[3-6]
When the ESS is established in the substation, the
Fig 1 shows energy flows. This regenerative energy can
be used to feed electric trains which are accelerating at
the same time or saved to the ESS as shown in Fig 1.
When an electric train is braking, the other electric
train is fed by the regenerative train and the energy
storage system. This case has disadvantage. The energy
generated by braking train and or by the ESS flow
through the catenary. Energy loss by the catenary
resistance is about 10-25% of regenerative energy.
Fig. 1. Energy loss by the catenary resistance

In case of the on-board ESS, there is no loss by the
catenary resistance. The on-board ESS directly charges
and discharges the regenerative energy. The on-board
ESS operates in two modes.
- 501 -
ICEIC 2015
In energy saving mode, it absorbs the energy
generated by braking vehicles and stores it until the
storage unit can feed it back into the power supply
system at a later point when vehicles are accelerating.
As a voltage stabilizer, its energy content is constantly
kept at a high level and it discharges when the system
voltage falls below a specified limit. The system can
switch automatically between these two operating
modes so that it can adapt perfectly to the prevailing
operational requirements.
Fig. 3. Block diagram of energy flow

The energy is stored by the system. The system
reuse the energy when the electric train accelerates.
The energy flow of running electric train is shown in
Fig 4,5.
Fig. 2. Energy loss by the catenary resistance
In case of installing the system inside the urban
railway electric train, the regenerative energy is
charged in the system however the length of catenary is.
The system inside the urban railway electric train is
able to charge the energy occurred from 0km/h to
maximum speed. At current state, this system does not
need the design change and an additional construction
of catenary. It means that all kinetic energy is reused to
electric energy without effect circuit resistance and
running resistance.
The weight of on-board ESS increases weight of the
vehicle. Therefore, the weight of on-board ESS
increases a consuming power and the regenerative
energy. The efficiency of stored energy is still higher
than weight of the on-board ESS.
It is difficult to apply the on-board ESS the existing
urban railway electric train by restriction of the
location and space.
In case of establishing the on-board ESS in the
urban railway electric train, the block diagram of
energy flow is shown in Fig 3.
- 502 -
Fig. 4. Power flow without on-board ESS.
ICEIC 2015
Table 1. Location of station
Substation
Station
Km Post
Name
Panam
Km Post
Name
0
Gov. complex
10770
Galma
11300
Sinheung
940
Daedong
2210
Wolpyeong
12270
Daejeon
3240
Gapcheon
13290
Jungangno
4010
Yuseong
14570
Junggu
4730
Guam
15640
SeoDaejeon
5540
Natl Cemetery
16480
Oryong
6360
World Cup
17520
Yongmun
7830
Noeun
18340
Tanbang
9020
Jijok
19490
City Hall
9800
Banseock
20480
The alignment data (grad and curve data) are shown

in Table 2, 3.
Fig. 5. Power flow with on-board ESS.
TABLE 2. CURVE DATA
3. Train Performance Simulation
From[m]
To[m]
Curve[m]
From[m]
To[m]
Curve[m]
118
163
400
7638
7701
3002
435
554
498
8537
8597
300
A Train Performance Simulation is conducted on

the Daejeon Line. Detailed train behavior is simulated
under a variety of conditions including track layout,
vehicle data, and operating rules.
Daejeon Metropolitan Rapid Transit Corporation
operates a 20.5km-long single line from Banseok
Station to Panam Station. Trains are normally
composed of four cars with a regenerating brake system.
The headway during rush-hour is 5min. The headway
during off-peak hours is 10min.
Fig. 6. Daejeon line map

There are 22 stations shown in Table 1.
- 503 -
730
899
2002
8848
9002
200
1177
1373
248
9352
9387
300
1553
1750
509
9659
9779
400
2126
2299
616
10022
10042
50000
2621
2932
359
10122
10142
31153
3317
3408
1500
10298
10643
280
3510
3533
1500
11233
11339
2498
3659
3710
6000
11818
12055
1197
3881
3927
2500
12353
12741
402
4319
4344
250
12822
13028
1202
4531
4642
1200
13377
13649
797
4864
4912
1000
13717
14165
396
5150
5384
200
14804
14955
2502
5735
5766
1500
15255
15316
2502
5846
5877
1500
15697
15739
2000
6103
6134
2000
15804
15856
2500
6200
6231
2000
16128
16194
2500
6774
6796
10000
16213
16279
2500
6819
6841
10000
16551
17043
296
7125
7156
9998
18852
19137
396
7244
7266
10000
19177
19826
602
ICEIC 2015
7289
7311
10000
7526
7598
2998
20396
20462
800
TABLE 3. GRAD DATA.

From[m]
To[m]
Grad[]
From[m]
To[m]
Grad[]
500
850
-28
11580
11760
15
850
1040
-6
11760
12200
-9
1040
1320
-31
12200
12520
1320
2380
-4
12520
12925
2380
2680
-10
12925
13240
-8
2680
3580
-6
13240
13500
3580
3920
-7
13500
13860
3920
4080
13860
14200
4080
4540
20
14200
14670
-3
4540
4780
-2
14670
15120
16
4780
5180
15120
15540
5180
5470
-3
15540
16230
5470
6180
16230
6180
6840
6840
7560
7560
7660
SIV
120kVA
In the simulation, the general electric train without

the ESS and the on-board train with the ESS run on the
Daejeon line. Each train has same conditions. Each
train's the accelerating and regenerative power are
compared. Results are shown in Table 5,6. Table 5,6
shows that the average rate of energy saving is about
30%.
Table 5. Energy saving rate of on-board ESS(to
Banseock)
Train without ESS
section
Train with ESS
Saving
rate
Accel.
Regen.
Accel.
Regen.
[kwh]
[kwh]
[kwh]
[kwh]
Panam
Sinheung
17.4
-8.7
12.8
-8.6
26
Daedong
17.2
-13.9
11.9
-13.9
31
16410
Daejeon
19.3
-9.3
14.4
-9.3
25
16410
16700
Jungangno
16.8
-8.6
12.2
-8.6
27
-4
16700
16870
11
Junggu
22.2
-11
15.3
-11
31
7660
-6
16870
17460
-3
SeoDaejeon
16.4
-9.9
11.3
-9.9
31
7740
-6
17460
17620
Oryong
15.7
-9.3
10.8
-9.3
31
7740
7890
17620
17950
20
Yongmun
14.7
-9.4
10.1
-9.4
31
7890
8760
13
17950
18285
-3
Tanbang
25.6
-11.5
17.6
-11.5
31
8760
9220
-3
18285
18480
City Hall
18.9
-11.4
13.4
-11.4
29
9220
9600
-8
18480
18730
19
9600
9920
-6
18730
19320
Gov.
complex
15.3
-10.2
10.6
-10.2
31
9920
11240
-3
19320
19660
-3
Galma
13.6
-9.3
9.4
-9.3
31
11240
11440
-3
19660
20050
-8
Wolpyeong
20.1
-9.4
14.5
-9.4
28
11440
11580
20050
20200
Gapcheon
19.1
-8.9
13.5
-8.9
29
Yuseong
17.5
-9.5
12.1
-9.5
31
Guam
20
-9.2
13.8
-9.2
31
Nat'l
Cemetery
15.7
-9.4
10.8
-9.4
31
World Cup
16.3
-9.2
11.2
-9.2
31
The 4-car Vehicles run on the Daejeon line.

Vehicle's characteristics are shown in Table 4.
Table 4. Vehicle's characteristics
[%]
Characteristics
Noeun
18.5
-9.7
12.8
-9.7
31
Vehicle
4-car
Jijok
20.4
-9
14.1
-9
31
Tare weight (ESS)
16 ton/car (2 ton/car)
Voltage
DC 1500 V
Banseock
17.7
-9.4
12.9
-9.4
27
Maximum speed
80 km/h
Average
18.02
-9.82
12.64
-9.81
29.76
Service acceleration rate
3.0 km/h/s
Service deceleration rate
3.5 km/h/s
Jerk
Below 0.8 m/s3
Motor power
1680 kW(210 kW x 8 motors)
Table 6. Energy saving rate of on-board ESS(to Panam)

section
- 504 -
Train without ESS
Train with ESS
Saving
rate
ICEIC 2015
Accel.
Regen.
Accel.
Regen.
[kwh]
[kwh]
[kwh]
[kwh]
16.5
-9.8
11.4
-9.8
31
24.2
-9.4
18.3
-9.4
24
World Cup
Nat'l
Cemetery
Guam
19.7
-9
14.5
-9
26
15.7
-9.6
10.8
-9.6
31
13.1
-9.2
-9.2
31
Yuseong
25.1
-9.5
19.3
-9.5
23
Gapcheon
14.7
-9.4
10.1
-9.4
31
Wolpyeong
15.5
-9.2
10.7
-9.2
31
Galma
Gov.
complex
City Hall
23.2
-9.8
17
-9.8
27
14.7
-9
10.1
-9
31
16.6
-8.9
11.4
-8.9
31
Banseock
Jijok
Noeun
[%]
Tanbang
19.2
-10.8
13.3
-10.8
31
Yongmun
29.1
-11.9
22
-11.9
24
Oryong
16.8
-8.5
11.6
-8.5
31
SeoDaejeon
13.6
-9.3
9.4
-9.3
31
Junggu
17.1
-10.9
11.8
-10.9
31
Jungangno
18.2
-13.4
12.6
-13.4
31
Daejeon
15.9
-9
11
-9
31
Daedong
18.7
-8.8
12.9
-8.8
31
Sinheung
25
-10.6
17.3
-10.6
31
Panam
21
-9.1
14.5
-9.1
31
Average
18.74
-9.77
13.29
-9.77
29.52
Fig. 8. Saved energy graph (Banseock Panam).

Figure 9 shows the magnified section between
Yongmun and Tanbang.
These simulations are focused on the energy saving

rate. When the on-board train runs to Banseock station,
the average consumption power is 12.64kWh. When
the general train runs to Banseock station, the average
consumption power is 18.02kWh. The saved energy
rate is 29.76%. In case of the other direction, the saved
energy rate is 29.52%. This figure shows energy graph
of the general electric train without the ESS and the onboard train with the ESS. The on-board train's energy
are smaller than the general train's energy.
Fig. 7. Saved energy graph (Panam Banseock).
Fig. 9. Saved energy graph (Yongmun Tanbang)

If the on-board ESSs are applied for all trains in
South Korea, Much more energy would be saved.
Currently, trains in South Korea are 7,958 cars. the
total consumption energy for one year is about 200
million dollars per year.
The on-board train can save energy about 30% of
the consumption energy. So, the saved energy would be
about 60 million dollars per year.
The result indicates effect of the on-board ESS.
Application of the on-board ESS and efficient use of
regenerating energy cut CO2 emissions and affects
environmental preservation. the cost-effectiveness is
very positive. We can expect effects as following.
Management
-Saving energy
-Reduction of nominal capacity of substations
-Reduction of maintenance cost of power electronics
by stabilizing overhead
-Line voltage
- 505 -
ICEIC 2015
-Increasing electric brake by using on-board ESS.
Reduction of friction brake.
-Reduction of maintenance cost related to friction
brake; for brake lining,
-Brake disc
Stabilizing System
-Stabilizing overhead line voltage
-Reduction of power peaks
-Recovery of vehicles during power failure
Global warming
-Reduction of the CO2 emission
4. Conclusion
The on-board ESS is needed to be developed to use
regeneration energy when the vehicle is braking. The
on-board ESS is simple solution to store the braking
energy and recycle it to powering vehicle. The onboard ESS as one of railway power traction system will
be inside the electric train. This paper specifically
presents the simulation effects of applying an on-board
ESS to the Daejeon Line in South Korea.
In the simulation, the general electric train without
the ESS and the on-board train with the ESS run on the
Daejeon line. Each train's the accelerating and
regenerative power are compared. Results are that the
average rate of energy saving is about 30%. Therefore,
the on-board train can save energy about 30% of the
consumption energy. The saved energy would be about
60 million dollars per year in South Korea.
References
References should appear in a separate bibliography at
the end of the manuscript, with items referred to by
numbers in square brackets [1, 2-4]. Times New
Roman 10pt is recommended for references.
[1] Y.V. Bocharnikov, A.M. Tobias, C. Roberts, S.
Hillimansen, and C.J. Goodman, "Optimal driving strategy
for traction energy saving on DC suburban railways," IET
Electric Power Applications, Vol. 1, Issue 5, pp. 675-682,
Sep. 2007
[2] Hanmin, "Field test of energy storage system on urban
transit system", Journal of Energy and Power Engineering,
Vol. 4, No.11, pp. 52-57, 2010
[3] Hanmin Lee, Gildong Kim, Changmu Lee. "Analysis for
EDLC Application on Electric Railway System", PCC
Nagoya, 2007
[4] RRR, "Power recycle vehicle", 2005.
[5] Takechi KONISHI, Shin-ichi HASE, "Energy Storage
System for DC Electrified Railway Using EDLC", QR of
RTRI, Vol. 45, No. 2, May. 2004.
[6] Hase, S., Konishi, T., Okui, A., Nakamichi, Y., Nara,
H.,and Uemura, T. : PCC-Osaka 2002, Proc. Fundamental
Study on Energy Storage System for DC Electric Railway
System., 1456-1459, 2002.
[7] Hanmin Lee, Gildong Kim, Changmu Lee. "A study on
ontrol of Waste Energy from Electric Train ", ITC-CSCC,
2013
[8] Bih-Yuan Ku and Jen-Sen Liu, "Solution of DC power
flow for nongrounded traction systems using chain-rule
reduction of ladder circuit Jacobian matrices," 2002
ASME/IEEE Joint Railroad Conference, pp. 123-130, 2002
[9] J. Duncan Glover, Alexander Jusko, and Syed M. Peeran,
"Train Voltage Analysis for AC Railroad Electrification,"
IEEE Trans. Industry Applications, Vol 1A-20, Issue 4, Part
I, pp. 925-934, Jul. 1984
[10] P. Lawton, F. J. Murphy, "Hong Kong mass transit
railway power supply system," IEE Proc. Generation,
Transmission, & Distribution, Vol. 133, No. 7, pp. 462-468,
Nov. 1986
[11] Arthur R. Bergen and Vijay Vittal, Power Systems
Analysis 2nd ed., Prentice Hall, 2000, pp. 294-303
[2] Lynn Powell, Power Systems Load Flow Analysis,
McGraw-Hill, 2004, pp. 16-18
[12] Byoung-Kon Choi and Hsiao-Dong Chiang, "On the
Local Identifiability of Load Model Parameters in
Measurement-base Approach," Journal of Electrical
Engineering and Technology, vol. 4, No. 2, pp. 149-158, Jun.
2009.
[13] Hansang Lee, "A Study on Modeling for 1500V DC
Power-Supplying Railroad System Using EMTDC," Master
dissertation, Detp. Elec. Eng., Univ. Korea, 2005
[14] A. Adinolfi, R. Lamedica, C. Modesto, A. Prudenzi, and
S. Vimercati, "Experimental assessment of energy saving due
to trains regenerative braking in as electrified subway line,"
IEEE Trans. Power Delivery, Vol. 13, Issue 4, pp. 15361542, Oct. 1998
[15] P. Chowdhuri, "Study of Transient Voltages in Transit
Systems," IEEE Trans. Electromagnetic Compatibility, Vol.
EMC-17, Issue 3, pp. 140-149, Aug. 1975
[16] Chen Yihsu, Wang Lizhi, "A Power Market Model with
Renewable Portfolio Standards, Green Pricing and GHG
Emissions Trading Programs," Energy 2030 Conference,
Energy 2008 IEEE, Nov. 2008
[17] R. Gresesti, M.V. Cazzol, R. Vailati, and F. Zanellini,
"Impact of greenhouse gas emission constraints on the
electrical system of continental Europe," Powertech, 2005
IEEE Russia, Jun. 2005
- 506 -
P2-17
A 9-bit CMOS DDFS with Area and Power Efficient Architecture

Taegeun Yoo1, Yohan Hong1, Dong-Kyu Jung1, Dong-Hyun Yoon1, Hong Chang Yeoh2,
and Kwang-Hyun Baek1
1
Chung-Ang University, Seoul, Korea, 2Analog Devices Inc., San Jose, CA, USA
kbaek@cau.ac.kr
Abstract
This paper presents an area and power efficient direct digital
frequency synthesizer (DDFS) based on the nonlinear DAC with a
maximum operating frequency of 1.5GHz. The proposed
reordered current weight architecture is capable of segmenting a
nonlinear DAC with minimal hardware while maintaining good
phase-to-amplitude conversion accuracy. The 9-bit DDFS
produces a minimum spurious free dynamic range (SFDR) of
50dBc up to Nyquist frequency. The prototype DDFS is fabricated
in 90nm CMOS and achieves total power dissipation of 270mW.
The FOM of this chip is measured at 1435 GHz2ENOB/W.
Introduction
Even though, Direct Digital Frequency Synthesizers (DDFSs)
hold high multiple advantages over traditional Phase Locked
Loops (PLLs) in frequency synthesis, they have been held back by
high power consumption due to their complex phase-to-amplitude
mapping (P2AM) circuitry especially when operating at high
speed. Furthermore, complex P2AM designs also lead to higher
clock latency. While a low latency design has been proposed by
[1], Nonlinear DAC (NLDAC)-based DDFSs which remove the
P2AM completely can increase operating speed, lower area and
power consumption in addition to reduced latency. However, the
use of a single thermometer-coded design in NLDACs typically
restricts the resolution of these DDFSs to 6 bits or less thus
limiting their spectral performance. Since NLDACs have
non-uniform step sizes, a modified segmentation method is
required. This paper proposes an area and power efficient
decoding circuit which shows good spectral performance.
Architecture and Circuit Implementation

Fig. 1 shows the top level block diagram of the proposed 9-bit
DDFS. It consists of 3 major blocks, the phase accumulator
(PACC), the proposed hardware efficient segment decoder, and
the current weights matrix. The PACC is used to convert
Frequency Control Word (FCW) into phase information. To
achieve finer frequency resolution, this design uses a 24-bit
pipelined PACC with a 10-bit truncated output (tunable freq.
resolution of approximately 89Hz (=1.5GHz/224)). The phase
information is then converted into amplitude data using the
segment decoder and the current weights matrix. To implement
this conversion, the PACC output is separated into 3 sections. The
2 highest order bits are defined as the Quarter Compression Bits
(QCB), followed by 4 bits of Quarter More significant bits (QM),
and 4 bits of Quarter Less significant bits (QL). The QM and QL
are used to generate the first quadrant of a sine whereas the QCB
are used to transform the first quadrant data into the second, third
or fourth quadrant using quarter wave compression. This
compression technique uses 2 sets of XORs which precede (QCB
Bit 0) and follow (QCB bit 1) the segment decoder, and a 1-bit
DAC used to shift the analog output by 1 MSB. Finally, the
decoded quarter wave digital data is converted into analog output
through the current weights matrix with the 1-bit shift DAC.
The phase-to-amplitude conversion of an (M+N)-bit quarter
sine wave data using M-N segment (M-bit coarse segment and
N-bit fine segment) design can be represented by the following
equations.

CCoi represents the coarse current weight for coarse segment i,

FCoi,j represents the fine current weight for coarse segment i and
fine segment j, and k represents the input phase data. Each CCo is
defined by the summation of previous (2N-1) fine current weights
in addition to the 2Nth fine weight whereas the quarter sine

amplitude is defined by the summation of the coarse weights and
the fine weights. Every FCoi,0 is zero as the 2Nth fine weight is
added directly to the coarse weight CCoi as shown in Eq. (1).
Fig. 2 (a) shows the ideal current weights of an 8-bit quarter
sine wave with 4-4 segmentation. This table is generated using an
ideal 8-bit quarter sine wave. Even though, the coarse NLDAC
can be build using a single thermometer-coded design with current
weights shown in the ideal table in Fig. 2 (a), implementing the
fine segment is more challenging. Several solutions [2-4] have
been proposed to solve this issue, however they require more
complexity than this design. In this prototype DDFS, a modified
sine code using reordered current weights is used to overcome this
problem. The idea is to shift the fine current weights to the form
shown in the reordered table in Fig. 2 (b). By rearranging the
current weights in each column of the FCos in descending order,
column decoding can be easily implemented using the same
thermometer decoder used to decode the coarse segment.
The proposed hardware efficient 8-bit current weights
reordering segment decoder implementation is illustrated in Fig. 3.
The segment decoder consists of a coarse thermometer decoder
and a fine thermometer decoder along with a final decoder
consisting of AND gates. The final decoder is required because
the maximum current weights of some FCos are 2. By using 2
separate unary current switches following the output of these
AND gates QLW[x]_A/B, current weights of 0, 1 or 2 can be
realized. A decoding example for FCo15 is also shown in Fig. 3.
In this case, fine thermometer decoder output, QLT15 is ANDed
with coarse thermometer outputs, (QMT10)' and (QMT6)'
(inverted signals of QMT10 and QMT6) to decode FCo15. Only 9
columns of the FCos have a maximum current weight of 2
whereas the rest of the 6 columns are driven using a single AND
gate. This results in a fine unary DAC with 24 switches. It is
important to note that this decoding technique is nearly identical
to the decoder used in a 2 thermometer-coded linear DAC with the
addition of 24 AND gates to implement the nonlinear function.
Measurement and Comparisons

The prototype DDFS is fabricated in 90nm CMOS and operates
with a 1.2V digital supply and a 2.5V analog supply. All tests
were done using die-on-board configuration with an output
voltage of 800mV differential swing. Fig. 4 shows the dynamic
performance at various output frequencies when operating at
1.5GHz. The prototype DDFS shows the worst SFDR of 50dBc
and the worst SNDR of 42dB up to Nyquist. The relatively low
SFDR at low synthesized frequencies are mainly due to the
matching issues of the current sources. Fig. 4 also shows that the
SFDR when clocked from 0.9GHz to 1.9GHz with its output set at
1/3 its operating clock. Compared to recent high-speed DDFSs
with integrated DAC presented in Fig. 5, this design achieve 20%
lesser area and 23% lower power consumption. While it appears
that the lowered area and power consumption is achieved due to
reduced amplitude resolution when compared to [4], this
comparison is still valid as the 11-bit hybrid design requires more
amplitude resolution to achieve the equivalent theoretical ENOB
compared to this work due to the tradeoff made to reduce area and
power. While [2], [3] and [5] show higher operating speed due to
the use of SiGe, this design attains the highest operating speed
among CMOS-based DDFSs at 1.5GHz. Although [5] exhibits
low power dissipation with high operating speed, this is achieved
by reducing its FCW width as its PACC consumes about 50% of
the total power budget. This tradeoff however results in
significantly larger tunable freq. (2,916,352 Hz with 9-bit PACC
vs. 89 Hz with 24-bit PACC at 1.5GHz clock). Since reduction in
PACC also reduces the active area, the size of [5] would be
significantly larger when implementing a 24-bit PACC as the
- 507 -
ICEIC 2015
current 9-bit PACC takes up about 40% of the active area.
Micrograph of the die is presented in Fig. 6.
FCo15
(QMT10)c (QMT6)c
1
1
1
1
1
1
1
1
1
1
1
0
0
0
0
0
Final Decode AND gates

QLW_A
QLT
QMT_A
Conclusion
QLW_B
QMT_B
The proposed area and power efficient decoding technique is

capable of segmenting a NLDAC with minimal hardware while
maintaining an accurate conversion leading to the fastest
CMOS-based DDFS. This scheme can provide synergy with
compound semiconductors such as SiGe because of area and
power issues of these technologies.
QL
4b
QM
4b
Fine
Decoder
(Thermo)
QLT
Coarse
Thermo
Decoder
QMT
Final
Decoder
15b
To QLSB
current
switches
24b
To QMSB
current
switches
1
1
1
1
1
1
1
0
0
0
0
0
0
0
0
0
2
2
2
2
2
2
2
1
1
1
1
0
0
0
0
0
15b
Acknowledgement
This work was supported by the ICT R&D program of MSIP/IITP,
Republic of Korea (no. 2014-911-05-002)
Figure 3 8-bit reordered current weights segment decoding
References
[1] A. Willson, M. Ojha, S. Agarwal, T. Lai and T.-C. Kuo, A Direct
Digital Frequency Synthesizer with Minimized Tuning Latency of
12ns, ISSCC Dig. Tech. Papers, 2011, pp. 138-139.
[2] X. Geng, F. Dai, J. Irwin, and R. Jaeger, An 11-bit 8.6GHz direct
digital synthesizer MMIC with 10-bit Segmented Nonlinear DAC,
IEEE J. Solid-State Circuit, vol. 45, no. 2, pp. 300-312, Feb. 2010.
[3] D. Wu, G. Chen, J. Chen, X. Liu, L. Zhao, Z. Jin, A 6 GHz direct
digital synthesizer MMIC with nonlinear DAC and wave
correction ROM, IEEE Radio Frequency Integrated Circuits
Symp., pp. 421-424, June 2010.
[4] H.C. Yeoh, J. Jung, Y. Jung, and K.-H. Baek, A 1.3GHz 350mW
Hybrid Direct Digital Frequency Synthesizer in 90nm CMOS,
IEEE J. Solid-State Circuits, vol. 45, no. 9, pp. 1845-1855, Sep.
2010.
[5] C.-Y. Yang, J.-H. Weng and H.-Y. Chang., A 5-GHz Direct
Digital Frequency Synthesizer Using an Analog-Sine-Mapping
Technique in 0.35-um SiGe BiCMOS, IEEE J. Solid-State
Circuits, vol. 46, no. 9, pp. 2064-2072, Sep. 2011.
Figure 4 SFDR and SNDR performance of the DDFS at various

synthesized output frequencies and operating clock frequencies.
2b
QCB
15b
24b
QLSB
15b
QMSB
QCB
B1
QCB
B0
Current weights
matrix
implementation
4b
QM
24b
Hardware
efficient
segment
decoder
Quarter Wave
Transform II (XOR)
8b
QM:QL
Quarter Wave
Transform I (XOR)
24-bit Pipelined Accumulator
[2] JSSC'10 [3] RFIC'10 [4] JSSC'10 [5] JSSC'11 This Work
4b
QL
Process
SiGe
200GHz fT
SiGe
60GHz fT
CMOS
90nm
SiGe
60GHz fT
CMOS
90nm
FCW Width
11 bits
8 bits
24 bits
9 bits
24 bits
Amplitude
Resolution
10 bits
nonlinear
7 bits
nonlinear
11 bits
hybrid
8 bits
linear+tsc
9 bits
nonlinear
Max. Clock
8.6 GHz
6 GHz
1.3 GHz
5 GHz
1.5GHz
Active Area
Worst Case SFDR

(Nyquist Range)
1-bit
DAC
Digital Decoding
Analog
Out
FCW in
Figure 1 Top level block diagram of the proposed 9-bit DDFS

Ideal Current Weights
7.5 mm
4.8 mm2
with pads
1 mm
2.1 mm
0.8 mm2
40 dBc
31 dBc
@ 5GHz
52 dBc
45.7 dBc
50 dBc
3270 mW
350 mW
460 mW
270 mW
53
@ 5GHz
1208
1712
1435
Power Dissipation 4800 mW

FOM
(GHz-2ENOB/W)
182
*ENOB is calculated with SFDR as defined by [2]
Figure 5 Comparison with recent high speed DDFSs
(a)
Reordered Current Weights
Figure 6 Die micrograph of the prototype DDFS

(b)
Figure 2 8-bit (a) Ideal and (b) Reordered current weights table
- 508 -
P2-18
Temperature Sensor Fabrication on CVD Grown Thick graphene
Kyuhyun Kwack1, Wonha Jeon1, Yumee Kim1 and Kukjin Chun1

School of Electrical and Computer Engineering, Seoul National University, Korea
E-mail : kh_kwack@mintlab.snu.ac.kr
Abstract
For solving thermal issues in ICs or EV (Electrical
Vehicle) batteries, a temperature sensor embedded
graphene heat spreadr was developed. The temperature
sensor was fabricated on graphene heat spreader by
using semiconductor process. Because graphene on Ni
layer was used without any treatment as transferring
process, sequential fabrication process could be
compatible. Fabrication of a thin film sensor on CVD
grown graphene layer has the advantages for large
area graphene heat spreader with better thermal
distribution characteristics. TCR of 1 x 1 mm
temperature sensor on graphene is 1.68 x 103 ppm/.
Keywords: graphene, heat spreader, temperature
sensor
1. Introduction
Thermal issues become more critical in electrical
devices in automobile application as EV batteries or
power ICs of engine. In the case of EV batteries, the
market size is increasing every year, and the number of
EVs may reach about 9.5 million in 2020 [1]. LithiumIon battery has very important role in EVs not fewer
than an engine of gasoline vehicle because it is the
only power source. However, the lifetime is very
sensitive to its temperature which is occurred in
charging and discharging period. Moreover, the high
temperature can cause the thermal runaway and
explosion.
For solving thermal issues in EV, using heat spreader
with high thermal conductivity is a possible approach.
Graphene is the 2D allotrope of carbon with very high
thermal conductivity which is in the range of 3080
W/mK to 5000 W/mK [2]. So graphene can be a
suitable material to solve thermal problems in EVs
even with its strong physical characteristics.
In EV batteries, temperature sensing is also important

as heat spreading for the thermal management.
Because heat is generated locally in a battery cell, real
time and direct temperature sensing is needed.
Recently, many automobile companies like GE or
Fraunhofer are trying to measure the temperature of
batteries [3, 4]. However, their temperature sensing
systems are only for sensing temperature not heat
spreading. If temperature sensor can be integrated on
heat spreader, it has advantages in efficient heat
spreading and precise temperature sensing.
In this paper, we designed test devices to verify
graphene heat spreading and temperature sensing
simultaneously. Graphene heat spreader was grown by
chemical vapor deposition, and the temperature sensor
was fabricated on heat spreader directly utilizing
semiconductor processing equipment. So we could
verify the temperature decrease of heat source due to
heat spreading, and measure the real time temperature
by integrated sensor.
2. Design
A temperature sensor embedded graphene heat
spreader was designed and shown in Fig.1. The device
is supported by a PCB board w i t h JEDEC standard
[5, 6]. The 500 um t h i ck silicon was used a s the
substrate, where the area of 12 x 10 mm at the
center was removed to 50 um thick membrane to
minimize the heat spreading effect caused by silicon
substrate. Above the membrane, 400 nm of Ni layer
and 1um graphene was designed. We adopted
CVD processed graphene directly as heat spreader
without transfer process, because it is hard to get
less damaged transferred graphene in a large area
device.
We also designed the temperature sensor of RTD
(Resistance Temperature Device) type using
deposited platinum resistor in 1 x 1 mm size.
- 509 -
ICEIC 2015
A resistive heater was fabricated for providing heat to
the device. For the electrical insulation between
graphene and sensor, SiO2 layer was designed with 1um
thickness.
4. Fabrication
First of all, 400nm Ni layer is deposited on silicon,
and graphene layer is grown as heat spreader on Ni
layer. Because there was no removal process of Ni
layer, graphene layer can be less damaged. On the
graphene layer, SiO2 is deposited by CVD process for
electrical insulation. Thin Pt layer is also deposited
and patterned on the graphene simultaneously. After
the fabrication process, the TCR is first characterized
followed by checking the cooling effect of graphene.
5. Acknowledgement
(a)
This work was supported by the Hyundai Next

Generation Vehicle Technology, Hyundai Motor
Company, and the Inter-university Semiconductor
Research Center (ISRC).
References
(b)
Fig. 1. Test device schematic (a) top view (b) cross
section view
3. Simulation
The proposed device was simulated by using
ANSYS Icepak (ver. 13.0). In Fig. 2, heat source is
heated to 60, and we can simulate and analyze the
difference of the device between (a) without graphene
and (b) with graphene. The boundary condition is that
ambient temperature is 25G and laminar flow. From
the simulation, 1um thick graphene cools down the
heat source temperature from 60Gto 56.2.
60G
(a)
[1] White Paper on Global Electric Cars Market,

RNCOS, 2013
[2] S. Ghosh, Extremely high thermal conductivity of
graphene: Prospects for thermal management
applications in nanoelectronic
circuits,
Applied
Physics Letters 92, 2008.
[3] Control Enabling Solutions with Ultrathin Strain
and Temperature Sensor System for Reduced Battery
Life Cycle Cost, ARPA-E, U.S. Department of
Energy
[4] C. Kurtulus, Electric Vehicle Batteries: Moving
from Research Towards Innovation, SuperLIB,
Fraunhofer, 2013
[5] Woongkyu Choi, Thick Graphene Heat Spreader
for thermal management of ICs, ITC-CSCC, 2013
[6] JEDEC Standard No.51-2A
56.2G
(b)
Fig. 2. CAD Simulation of the device (a) no graphene

(b) with graphene
- 510 -
P2-19
A Design of 4-Gb/s, 380-W Low-Power Optical Receiver Front-End in 65-nm

CMOS Technology
Haram Ju, Gyu-Seob Jeong, Woorham Bae, and Deog-Kyoon Jeong
Department of Electrical Engineering and Computer Science and Inter-University
Semiconductor Research Center, Seoul National University
Seoul, Korea
E-mail : hrju@isdl.snu.ac.kr
Abstract
This paper presents a 4-Gb/s optical receiver front-end
circuit, which consists of a inverter-based transimpedance
amplifier (TIA) with resistive feedback for low power
consumption and bandwidth extension, a 4-stage CMOS
inverter-chain-based limiting amplifier (LA) with an offset
cancellation network, and an output buffer. Also, an
electrical photodiode (PD) model is implemented to
substitute for a commercial optical PD for demonstration of
the optical receiver front-end circuit. The combined TIA and
LA simulated in 65-nm CMOS exhibits a transimpedance
gain of 78.4 dB and a bandwidth of 1.94 GHz. The TIA
and LA blocks consume 199-W and 168-W at 1-V supply.
important to improve the energy efficiency of optical

receiver.
In this paper, design issues and implementations of low
power optical receiver front-end is proposed and simulation
results are presented. The block diagram of proposed optical
receiver front-end circuit is shown in Fig. 1.
PD
TIA
Buffer
LA
LPF
PD current
Optical input
160uW
Vcm
160uA
100uW
100uA
40uW
40uA
Offset cancellation circuit
Fig. 1. Block diagram of optical receiver front-end

Keywords: Low-power optical receiver, Optical front-end,
Transimpedance amplifier (TIA), Limiting amplifier (LA)
1. Introduction
As the demand for the high-speed data communication
has rapidly increased, optical interconnects regarded as a
new solution to support increasing capacity requirements
for short-reach data communications such as board-to-board
and chip-to-chip serial links [1], [2]. The optical fiber is free
from the bandwidth limitation comparison with the copper
cable. Also, we can reduce the design complexity and power
consumptions of interface circuits because various signaling
and equalizing techniques are hardly required for optical
communications [3].
Despite of inherently low power characteristics of optical
interface circuits, the TIA and LA blocks are critical power
consuming blocks for high-speed data transmission.
Moreover, because the maximum data rate of entire system
is often limited by the available bandwidth of the TIA, an
optical receiver front-end usually employs various
bandwidth extension techniques such as inductive peaking
to compensate dominant pole induced by large PD
capacitance. Therefore, it consumes additional power [4].
As a result, design optimization of TIA and LA is very
2. Design issues and implementation

2.1. Photodiode modeling
The electrical PD model is used to evaluate the optical
front-end circuits in simulation. The average level of PD
photo current is assumed to be 100 A, and the extinction
ratio of PD is modeled as 6dB, therefore, a peak-to-peak
current swing is of 120 A, as shown in Fig. 1. A
commercial optical PD can be finally modeled as a large
parasitic capacitance of 300 fF and two current sources, one
of which always turns on and the other turns on only when
the system transmits data of 1. The circuit implementation
of electrical PD is shown in Fig. 2.
- 511 -
1 : 3

Fig. 2. Circuit implementation of electrical PD model
ICEIC 2015
2.2. Transimpedance amplifier

The circuit implementation of the TIA is based on an
inverter with resistive feedback as shown in Fig. 3(a).
Increasing the bandwidth of the TIA permits more noise to
pass through the TIA while decreasing the bandwidth
introduces more ISI at the output node of the TIA. Therefore,
the TIA bandwidth is usually chosen to be 0.6 ~ 0.7 times
the bit rate to compromise between noise and ISI [4]. Thus,
the bandwidth of proposed TIA is fixed at about 2.4 GHz
for given data rate of 4Gbps as shown in Fig. 3(b). To
minimize the power consumption of TIA with fixed
bandwidth, the transistor widths ( ) and feedback
resistor ( ) is swept in SPICE simulation. Increasing
usually increases the gain of TIA while it decreases the
bandwidth of TIA. In addition, to keep inverting property of
the TIA, following condition (1) of should be satisfied.
The proposed optical receiver front-end is simulated in
65-nm CMOS technology. Fig. 4(a) shows the simulation
results of TIA, LA, and error amplifier used in offset
cancellation. The total power consumption of the optical
receiver front-end is about 380 W which is very low for
4Gbps data transmission. Fig. 4(b) shows the eye diagram
at output node of the output buffer which is a post-layout
simulation (POSIM) result.
Gain
Bandwidth
Power
consumption
TIA
37.8 dB
2.39 GHz
198.72 W
TIA + LA
78.4 dB
1.94 GHz
367.04 W
Error amp
20 dB
207.06 MHz
13.06 W
(a)
(1)
Finally, using these relations, we can easily find the

minimum value of the transistor widths to reduce power
consumptions of TIA while the fixed bandwidth of 2.4 GHz
and target SNR to guarantee BER of below are
satisfied. The feedback resistor ( ) is chosen to be 127 .
The transimpedance gain and power consumption of the
proposed TIA is 37.8 dB and 198.72 W, as presented in
Fig. 4.
(b)
Fig. 5. (a) Simulation results (b) Eye diagram (POSIM)
4. Conclusion
Fig. 3. (a) TIA (b) Simulated AC response of TIA

2.3. Limiting amplifier with offset cancellation circuit
The entire architecture of LA is shown in Fig. 4. Further
gain gathering is achieved by a 4-stage inverter-chain-based
post-amplifier. For more frequency compensation, inverters
with resistor feedback are added to LA. Also, an offset
cancellation circuit employs the RC filter as a low-pass filter
(LPF) and a current-mode logic (CML) error amplifier to
adjust the common level of LA to a switching threshold.
4-stage CMOS inverter-chain-based LA
out
TIA
FB out
LA out
LA out
VCM
FB out
RC filter (LPF)
A 4-Gb/s optical receiver front-end is implemented in

65-nm CMOS technology. As a result of the optimization of
power consumptions, the proposed optical receiver frontend circuit consumes a total power of 380 W. Also, the
gain and bandwidth of the proposed TIA and LA are 78.4
dB and 1.94 GHz, respectively.
Acknowledgement
This work was supported by MSIP as GFP / (CISS2012M3A6A6054191)
References
[1] D. Miller, Device requirements for optical interconnects to
silicon chips, Proc. IEEE, vol. 97, no. 7, pp. 11661185, 2009
[2] J. Kim, J. F. Buckwalter, A 40-Gb/s optical transceiver frontend in 45 nm SOI CMOS, IEEE J. Solid-State Circuits, vol. 47,
no. 3, pp. 615-626, 2012
[3] G. S Jeong, H. Chi, K. Kim, D. K. Jeong, A 20-Gb/s 1.27pJ/b
low-power optical receiver front-end in 65nm CMOS, IEEE
ISCAS, pp. 1492-1495, 2014
[4] C. W. Seng, T. Y. Sern, Y. K. Seng, A low power wideband
differential transimpedance amplifier for optical receivers in 0.18m CMOS, IEEE NEWCAS, pp. 1-4, 2013
Offset cancellation network (CMFB)
Fig. 4. Circuit implementation of LA
- 512 -
P2-20
Experimental Model of Wireless Optical Communication System for

Automotive Media Oriented Environment
Sangyub Lee, Chouljun Kang and Jaejin Ko
Korea Electronics Technology Institute
syublee@keti.re.kr
Abstract
For the media playing service needed to use high
bandwidth and display quality in vehicular
environment, it is required least scores of Mbps to be
formed communication link. Especially, either on
environment of wire or wireless communication,
customer wants to be in seamless network status.
Recently, on wired communication, MOST (Media
Oriented System Transport) network system satisfies as
an in-vehicle network has been adopted in all kinds of
cars. Under the condition of being linked with MOST
networks, proposed system will take role of
connectivity
with
WOC
(Wireless
Optical
Communications) device. In this paper, it has been
implemented the interconnection of hetero network
system and defined experimental model for automotive
media oriented environment.
Control Unit) problem related on vehicle movement

and safety in car, proposed WOC has to be checked as
a network access point like the MOST networks
equipped in car.
2. System of MOST-WOC
In describe in Figure.1, proposed network system is
consist of MOST devices with WOC module as an
access device in ring network. The proposed MOSTWOC network system which is linked with MOST
network system has the same as their data rate. It can
be 150Mbps uplink and downlink that make a variety
of utilizations as a means of internal wireless
communications in car.
Keywords: in-vehicle network systems, MOST, WOC,

automotive multimedia system.
1. Introduction
Lately, conventional car media system has been
adopted to wireless communications system such as
Bluetooth or Wireless LAN in order to transit the
media data source, but the environment of exchanging
multimedia streaming data in car is tough to be
operated without ceasing link connection because
vehicular space is small and its material cannot
progress wireless signals. Proposed MOST-WOC
system does not interfere with radio frequency systems
and avoids EM (Electro-Magnetic) compatibility
problems, thus it can be the only solution for streaming
service tool in automotive media environment. Before
being implemented automotive network for seamless
connectivity combined with wired and wireless
communication, experimental model has to be
considered as a valid system model in car. Though
multimedia network is not effect on ECU (Electronic
Figure 1. System model of MOST-WOC

Within a WOC device, the processing module
possesses the role of a two way bridge functions
between optoelectronic transceiver and the interior
network of the device. Figure 2 shows the platform for
the implementation of a typical processor style WOC
device. The WOC device provides the transmission of
converting data between optical signal and electrical
one. Simultaneously, this allows sending and receiving
the MOST data via EHC (External Host Controller) in
an efficient way. The basic system architecture of
MOST-WOC unit is shown in Figure 3. It is described
a device with an optic interface as the MOST side. The
- 513 -
ICEIC 2015
MOST optic interface transforms the light signal into
an electrical signal which transfers the data routing
module. When processing data are accessed to define
memory block, MOST frame involved in control,
streaming and packet data are transmitted to Head Unit
via internal interface bus system. And, the data
processing is realized in accessing to the WOC
interface module.
Figure 4. Conventional physical layer compliance

test on MOST networks
The conventional physical layer compliance test on
MOST networks system aims at testing complete
device and can be considered as a black-box test, since
only test points SP2 and SP3 can be tested. Figure 4
and Figure 5 show the setup for physical layer
compliance test.
Figure 2. WOC network interface module with

FOT(Fiber Optic Transceiver)
Figure 5. Setup of conventional physical layer

compliance test
Figure 3. Data processing based on the system
architecture of MOST-WOC
3. Experimental Model
The integration of processing platform and optic
modules is particularly challenging due to their
compatibility. An effective measurement of
compliance is to be adopted a certification test process.
It is called MOST compliance test. As described in
Figure 4, MOST compliance test process is divided
into three courses: device test on physical layer, higher
communication levels and application layer.
With regard to the physical layer compliance, the
measurement point is to check the signal characteristics
for constancy.
For the normal behavior, power, error, ring break
diagnosis and network management, higher
communication level compliance tests are performed.
Through the MOST compliance test setup, it is

validated checking lock capability for variation of the
optical input power and data consistency by
comparison of the DUT input and output data stream.
For the case of proposed experimental model, instead
of the connected optical cable, optical wireless network
devices are used as the test devices. To examine and
demonstrate compliance test, it is defined attenuation
level by interval replicated by power attenuation
between the test devices. As compared with Figure 6
and Figure 7, it is presented how equivalent
experimental model is comprised as same as MOST
compliance test. The stress pattern generator used in
this experiment generates optical signal satisfying with
MOST standardized data frame on SP2 as it is shown
in Figure 6. Comparable test model has a different
point on SP2 that the stress pattern generator transmits
the electrical MOST start frame signal and through the
developed MOST-WOC linked platform, it exchanged
electrical and optical signal equivalently.
- 514 -
ICEIC 2015
Figure 8. Developed MOST-WOC platform and

interface modules
Figure 6. Proposed physical layer compliance test
on WOC networks for experimental model
Figure 7. Proposed physical layer compliance test

setup for experimental model
4. Demonstration and results

During the experimental model test, the MOSTWOC components are tested in the context of the final
vehicle system. The focus of the proposed system test
is to test the interoperability of all MOST components
and WOC module. As shown in Figure 8, the
compatibility of the interlinked components under real
life conditions. Through demonstration set, it covers as
many situations as possible that occur in vehicular
environment. In this case, it is important that the
system results difference is caused carrying out WOC
compliance test is the chronological synchronization of
the different timing in access of interface bus and
memory described in Figure 9.
Figure 9. Comparison results of MOST and WOC

compliance test on SP2_UI_Undershoot
5. Conclusion
For the trend of car infotainment system is moving
to the high quality audio sound system, this paper is
introduced the development of the audio streaming
service based on wireless optical network system
called as WOC. Particularly, MOST-WOC, to be
optimized streaming data transmitting without ceasing
communication on vehicle environment is satisfied
with reducing the weight and ensuring the reliability
for the free of electro-magnetic problems. Especially,
in this paper, it is introduced the performance of
designed system based on MOST-WOC according to
the distance of WOC devices by setting up
- 515 -
ICEIC 2015
communication link. And it defines the test process of
WOC system which transmit the packets linked with
MOST networks. It is validated as an experimental
model for the compliance test with MOST networks
system.
Acknowledgement
This study was supported by a grant from the IT R&D
program of MOTIE/KEIT [10048285, Improving
Industrial Infrastructure through Embedded Software
Research and Development]
References
[1] Andreas Grzemba, MOST Book from MOST25 to
MOST150, MOST Cooperation, FRANZIS, 2011
[2] Otto Strobel, Rindha Rejeb and Jan Lubkoo,
Communication in Automotive System Prin-ciples, Limits
and New Trends for Vehicles, Airplanes and Vessels, IEEE
ICTON, pp1~6, 2007
[3] S. Godavarty, S. Broyles and M. Parten, Interfacing to
the on-board diagnostic system, Proceedings of IEEE
Vehicular Technology Conference, 52nd-VTC, vol. 4, pp.
24-28 , 2000
- 516 -
P2-21

- )
!

"

$#
%" $#&
( ')$"
+ **,
!

"

$#
%" $#&
( ')$"
+ **,

!

"
"

0
,
0 !! *;
!!
'
0 * 7
9

!0 0
'
!
!
*
# !!! !

!

<

*

!!

!
!!
!
!

*
##* $# " /$";> "=

?

'

'0
'

!! *
#* # $./ #

!!

!

! ' 0!'
!! , 1' '
234' !! , ! '
' *

!
!
, !# 254
0
!! !!

! 264*

, !0

0
7
! %!
&
%
!
&284*
0 9

!!

:

!!

;* 3 !!

*
@ ! !!

! !!
*

* ! ' , , '
,
!! #

! ! '3AA868B3'
= '#

C"%= #"') &'23AA868B3'. ! @D@!
. =
! .5. $
!$ 4
- 517 -
ICEIC 2015
!!
@; 5* 0
0
0 ' !
0
*

* # ,E 0

, ,*
0
,

, ,
0
* #
<

! * ; 0!'
, !'

F!G' F G' F G' F0
G'
F H G' * # ,'

I # ;*5

!
*

J
;*5

I # *

) ,
0

' ' ' F!G

!! '
F!G !
, *
0
!!
H * ; '
0 F# G'
F !G 0
F G
F!G
F G* @

'F !G'FG'FG*

!* I

'' '
*
!! * ;
0!' '
< D
'
' 1' H

*
, 0
!! !!* ,

0 .7

!! ,
!! * , !
!! ' ,
'
' ! ,
,
* ; 0!' F !G
0
! 1'
% ,& 1 ! *
7
!' F !G:

!!
*%#
!, &

# ;*3'

@; 5'

'

=*

, ! 0
'
0 0

*

0
0
0
< !
0 % 0
&* @

% &
'
0 9
* #

, ) -! ! ! ! '
! ! !% &*@

'
0 ! 0 !

*
! ' 0
!
!! *

!! 0

!
!

*#

' 0
!

*
###* I/#
# !!'
!

* @
! !
!!

! ! !

0

!
0

, ,
*
#
! ' , '

'!

!!!
!

*

234 (* " ' 7* ' #** ' F$ <

G = =

$ %==$&'5A3A!!*6K6L6KB*
254 -
)#= > ! (' =/ "$1#"
(""$ # $ / . =" . 7". 1#"
==.'35A36AMK85B'! *5A36*
264 - $) - -/(' F=" . . $ / ;$
$1#.#( "N @$" "$1#" /#( ""
$"(# #&'G35A363A3O8B'! *5A36*
284 =
' =' 7 ' "

.' >
.' F. !!
1
'G7 %"7"&'5A366P '
!!*5BOL5BB*
- 518 -
P2-22
Autonomous Navigation of the Mobile Robot using the Exterior Penalty

Function Method
Young-Jong Jung, Gon-Woo Kim
School of Electronics Engineering, Chungbuk Natl Univ.
E-mail address: gwkim@cbnu.ac.kr
Abstract
2.1 Cost Function for Reaching the Goal Position
We propose the autonomous navigation method

using the constraint optimization method. To
accomplish the global navigation task, we define the
optimization problem to minimize the cost for the pose
error between the goal position and the position of a
mobile robot with constraints to avoid the obstacles
using the exterior penalty function. We evaluate the
performance and the efficiency through the simulation
results.
In order to minimize the pose error between the goal

position and the position of a mobile robot, the error
function can be defined as e()=qR()qGoal where is
the position vector of the right and the left wheel of the
differential drive mobile robot, qR() is the current
pose of the mobile robot according to the fixed initial
frame and qGoal is the goal pose.
The cost function to be minimized can be defined
using the error function as
Keywords: autonomous navigation, mobile robot,

obstacle avoidance, constraint optimization
E( )
1. Introduction
The many researches in the autonomous navigation
have been performed using the various approaches [1].
The field of the autonomous navigation can be divided
into two topics, which are the path planning and the
path tracking. In this paper, we propose the composed
and efficient navigation algorithm using the constraint
optimization method.
In order to reach the goal position, we define the
cost function to be minimized with the pose error
between the goal position and the position of a mobile
robot. We also define the constraints to avoid the
obstacles. Finally, we define the constraints
optimization problem for the autonomous navigation.
Using the constraints optimization method based on the
exterior penalty function, the optimal speeds of the left
and right wheels can be directly found using the
Jacobian derived from the kinematic model [1].
2. Autonomous Navigation using

Constraint Optimization Method
1 T
e ( )e( )
2
(1)
2.2 Autonomous Navigation using the Exterior

Penalty Function Method
In order to avoid the obstacles, we define the
constraints to prevent the robot from approaching the
obstacles. The constraints optimization problem can be
define as shown below.
min2 E ( )
R
s.t.
d max Di ( )
(2)
for i 1,2, , n
where dmax is the marginal distance between the robot

and the obstacle and Di() is the quadratic form of the
distance between the robot and the ith obstacle.
The optimization problem can be redefined using
the exterior penalty function as
the
min F ( , rk )
where
F ( , rk ) E ( ) rk g j ( )
g j ( ) max( 0, d max Di ( ))
- 519 -
(3)
ICEIC 2015
rk is the positive penalty parameter and q is the
nonnegative scale parameter.
The iterative form of the wheel position value can
be calculated as
10
9
8
k 1 k k k k k
T
Y axis(m)
(4)
6
5
4
3
2
In order to evaluate the validity of the proposed

algorithm, we perform the simulation. Fig. 1 shows the
simulation result when the initial pose of the robot is [0,
0, 90] T (unit: [m, m, deg] T) and the goal pose is [10 10
0]T. The obstacles exist at [5, 5]T and [6, 6]T,
respectively. As shown in the simulation result, the
mobile robot can efficiently navigate toward the goal
pose without any collision with the obstacles.
1
0
0
10
X axis(m)
(a)
RMS error(m)
20
4. Conclusions
15
10
5
0
Heading direction(deg)
In this paper, we propose the efficient autonomous

navigation algorithm using the exterior penalty function
method and evaluate the validity and the efficiency of
the proposed algorithm. Next step is to adopt the
algorithm to the real mobile robot and to implement
and evaluate the sensor-based autonomous navigation.
References
5
time(s)
10
5
time(s)
10
100
50
-50
[1] G. W. Kim and Y. Y. Cha, Navigation of a Mobile

Robot Using Nonlinear Least Squares Optimization, Trans.
KIEE, Vol. 60, No. 7, pp. 1404-1409, July 2011.
(b)
Fig. 1. Simulation result: (a) Trajectory of the mobile
robot and (b) the pose error and the orientation
[2] R. M. Freund, Penalty and barrier methods for

constrained optimization, Massachusetts Institute of
Technology, 2004.
- 520 -
P2-23
An Efficiency Analysis of Buck Converter in PWM /PFM Mode

Jin Hwan Kim#*, Young Min lm*, Ji Hoon Kang*, Kang-Yoon Lee*
#
Samsung Electro-Mechanics CO., Ltd., Suwon, Korea
*
Thomas75@skku.edu
Abstract
An efficiency analysis of a high frequency buck
converter with Pulse Width Modulation (PWM) and
Pulse Frequency Modulation (PFM) Modes is
presented in this paper. The detailed loss analysis and
calculation has been conducted for buck converter of
portable system. The validity of this analysis can be
verified by comparing predict system efficiency with
the measured efficiency for a synchronous buck
converter in both PWM and PFM Modes.
In particular, the inductance model was applied in the

form of a third order polynomial equation was fitted by
real measured data of inductor
2
3
(1)
L( IO ) L0 L1 IO L2 I O L3 IO
(Ex.1uH: L0=1.0, L1=-0.824, L2=-0.0108, L3=0.0011)
3. Loss Analysis of Components

Fig. 2 is shown the loss distribution of buck converter.
This section explains the loss analysis of components
in PWM and PFM Modes.
Keywords: Buck, Loss Analysis, Efficiency, PFM
1. Introduction
To maintain high efficiency across the entire load
range, it is necessary to operate PFM for light load.
In this paper, the loss analysis and calculation has
been conducted for the PWM and PFM Modes. In
particular, to improve the accuracy predicts system, the
Inductance and core loss applied by modeling from real
measured data of Inductor.
Predicted efficiency within the whole operation range
is then compared to measured result.
Fig. 2. Loss distribution of Buck Converter
2. Circuit Model and Specifications

In this paper, we applied a synchronous buck
converter. The system block diagram and specifications
is shown in Fig.1. The power management IC including
MOSFETs applied TIs Product is TPS62065 and the
Inductor and Capacitor are applied the Samsungs
products.
Spec
Converte
r
MOSFET
Inductor
Cout
IC
VIN=
3.7
VOUT=
1.8
Fsw=
Co=
TH =
TL=
V F_L=
RDS_H=
RDS_L=
DCR=
ESR=
IQ=
MHz
3
uF
10
ns
10
ns
10
V
1
0.12
0.09
0.084
0.001
uA
18
3-1. PWM mode Inductor current

The PWM operation is skipped because the operation
was well known.
The duties (D), Inductor ripple current (IL), and
Inductor RMS current (IRMS) are described by the
following equations:
(VOUT I O RDS _ L )
(2)
D
(VIN I O RDS _ H I O RDS _ L )
I L
(VIN I O RDS _ H VOUT ) D
I L _ RMS
Fig. 1. Buck Converter System & Specification
- 521 -
(3)
FSW LO
2
IO
I L
12
(4)
ICEIC 2015
3-2. Active Component Loss
The total loss of a MOSFET is a combination of
conduction losses and switching losses. The conduction
loss is dissipated in series resistance and switching loss
is dissipated each switching cycle.
High and low side MOSFET loss is
V
2
(5)
PH _ Conduction I L _ RMS RDS _ H OUT
VIN
(V I
)
(6)
PH _ Switching in L _ RMS (TH FSW )
2
V
2
(7)
PL _ Conduction I L _ RMS RDS _ L (1 out )
Vin
(8)
PL _ Switching (VF _ L I L _ RMS ) (TL FSW )
The quiescent loss of PM IC is described by the
following equation:
PIC _ IQ I Q VIN
(9)
3-3. Passive Component Loss

The total loss of Inductor is combined of DC
Resistance (DCR) loss and core loss.
The DCR loss is described by the following equation.
2
(10)
PL _ DC I L _ RMS DCRL
(dt1, Vout value is given by specification of system)

(V I O RDS _ H VOUT )
(13)
I
IN
L _ PFM
; Tsw
; dt2
; T2
;N
F1 LO
Cout Vout
I 2
)
I O (1 O
I L _ PFM
(14)
I L _ PFM LO
(15)
VOUT I O RDS _ L
I L _ RMS
(16)
Vout I O RDS _ L
TSW T2
T1 dt2
(17)
2
I L _ RMS _ PFM
I L
(T T2 )
N 1
3
TSW
(18)
The loss of MOSFET, Inductor and Capacitor in PFM

mode can calculate using the equations (5), (6), (7), (8),
(10), (11), (12).
4. Calculated & Test Results

Fig.4 show the efficency comparison among foced
PWM, PFM and PWM calculated results and test result.
The Core loss model was applied in the form of the

Steinmetz equation was fitted by real measured data of
inductor
a
b
PL_Core Pc (I , f ) = ( K I f )
(11)
The ESR loss of capacitor is calculated using Eqs 12.

2
(12)
PC _ ESR I L ESRC
Fig.4. Efficiency Comparison
3-4. PFM Mode Inductor current

Typical inductor current and output-voltage wave
forms during PFM mode are shown in Fig.3. During
PFM operation, a nonlinear bang-bang control is
applied.
5. Conclusion
In this paper, the loss analysis and calculation has
been conducted for the PWM and PFM Modes. And
the validity of this analysis verified by comparing
predicted efficiency with the measured efficiency.
References
Fig. 3. PFM Waveform of Inductor Current & Vout

Inductor ripple and RMS current can be computed by
the following equations.
[1] Volkan kursun, and al., Efficiency Analysis of High

Frequency Buck Converter for On-Chip Integration with a
Dual-Vdd Microprocessor ESSCURC2002
[2] Yie-Tone chen and Cing-Hong Chen., A DC-DC Buck
Converter Chip with Integrated PWM/PFM Hybrid-Mode
Control circuit PEDS2009
[3] Jon klein, Synchronous buck MOSFET Loss
calculations with Excel model AN-6005 Application Note
[4] Maxim integrated, An Efficiency Primer for SwitchMode, DC-DC Converter Power supplies Application Note
App4266
- 522 -
P2-24
Clock-Less 8-bit Pipeline-Like Novel A/D Converter

Sang-Hoon Lee1, Jin-Tae Kim1, Jae-Roul Park1, Jong-Cheol Lee1, Jang-Kyoo Shin1, and
Pyung Choi1
1
School of Electronics Engineering,
Kyungpook National University, 80 Daehakro, Bukgu, Daegu, 702-701, Korea
tonightparty@nate.com
Abstract
In this thesis, a clock-less pipeline type A/D
converter having 8-bit resolution is designed. This
shows newly proposed architecture to convert the
analog input signal into 8-bit digital output. The
proposed A/D converter has advantage of smaller size,
higher speed and less power consumption than existing
A/D converter, because of the architecture using only
analog parts in the A/D converter that does not have
digital parts like clock generator, digital error
correction logic and so on. Also, because all structures
of each stage are identical, the proposed A/D
converter is easy to do apply to higher resolution over
8-bits. So, we can expect that it can be applied to any
signal processing circuit to be used in all of the parts
like image, medical treatment, military, technical
sector and so on.
Keywords: clock-less A/D converter, pipeline A/D
converter, A/D converter
Recently, the high performance of the A/D

converter has been required in the electronic device
market. Also the conversion time, small size, high
speed signal processing and low-power of the A/D
converter are being magnified as the important factor to
consumer and manufacturer. So, we introduce a novel
A/D converter without clock, like the pipeline A/D
converter having small size, high speed and simple
structure.
2. Description
Description System Architecture
The Clock-less 8-bit pipeline-like A/D converter

consists of eight single-stages and each single-stage
Vresidue
Vresidue
Vin
Vref
Stage 1
(Bit 7)
Stage 2
(Bit 6)
Vresidue
Vresidue
Stage 7
(Bit 1)
Stage 8
(Bit 0)
Compout1
Compout2
Compout7
Compout8
Latch
Bit 7(MSB) ~ Bit 0(LSB)
Fig.1. Block diagram of the clock-less 8-bit pipelinelike A/D converter

B.
1. Introduction
A.
determines one digital bit as shown Fig.1. The key

point is that the proposed A/D converter consists of
analog parts that does not have device to depend on
clock like digital block. Therefore, if input signal
enters, the proposed A/D converter operates all parts at
time.
Design and Implementation
Fig. 2 shows block diagram of the single-stage. The

single-stage to determine the most significant bit(MSB)
and other bit(s) consists of a comparator, a subtracter
and a 2-ch analog MUX. This stage operates all parts at
time if input signal voltage (Vin) enters. So, the
comparator outputs digital signal, high or low, to
compare Vin with reference voltage (Vref). Then output
signal becomes digital bit of the single-stage and uses
selection signal of the analog MUX. The subtracter
subtracts Vref from Vin. Therefore, to subtract signal
from Vin to Vref of the subtracter output (Vsub) and Vin
enter the analog MUX that outputs one of the both
signals through selection signal of the comparator
output. If the comparator output is high (=1), the
analog MUX selects and outputs Vsub. The other way, if
that output is low (=0), it selects and outputs Vin. Thus
- 523 -
ICEIC 2015
one of the single-stage determines 1-bit of the digital
signal. So, the output signal of the analog MUX is
multiplied by 2 and delivers the restored signal to the
original range to the next stage.
Comp out
Vin
1-Stage
(1-bit)
Vref
Vin
Vref
Comp
Vref
Vin
1-bit
Vout
Input of
next-stage
selection signal of the MUX is 1, output of the MUX

has Vsub signal : Vsub or Vin. So, the Vsub signal is 1V to
subtract Vref (=1.5) from Vin (=2.5). Similarly, the Vsub
signal (=1V) is multiplied and restored to 2V.
Additionally, segmenting the level, signal level is
shown in Table. 1.
Table. 1. Characteristics of the single-stage
Vin
Comp out
Subtracter
+
Vsub
Vin
Sel
MUX
X2
Vout
Fig. 2. Block diagram of the single-stage structure
Stage-1
Stage-2
Stage-3
Stage-4
out
Vsub
Sel
Vin
0.5
Low
Vin
0.5
Low
Vin
High
Vsub
High
0.5
Vsub
0.5
2.5
High
Vsub
High
1.5
Vsub
1.5
1.5
(Unit : Voltage)
Vref =1.5V
Vin
Bit 0
-Vref
X2
X2
1
As shown in Table. 1, that is expressed in the wave

form of Fig. 4. This is expectable the wave form of
three stages.
-Vref
X2
0
3V
Fig. 3. Concept to go through each stage about input

signal
Vref=1.5V
Prediction results
Vref=1.5V
Bit
0V
3V
Vref=1.5V
0V
Stage-2
Vin
Bit
Stage-3
Vin
Bit
Supposing the input signal is the ramp signal from

0V to 3V, the Vref is 1.5V to compare with the Vin in
the comparator. For example, if the Vin is 1V, output of
the comparator has low (=0) because that level is lower
the Vref and the MSB determines 0. Also since the
selection signal of the MUX is 0, output of the MUX
has 1V, the Vin signal among the input signal of the
MUX : Vsub or Vin. Then, the signal level lower the Vref
is multiplied by 2 and restored to the same range with
the original signal. So, multiplied 2V is processed in
the next stage. Else example, if Vin is 2.5V, output of
the comparator has High (=1) because that level is
higher the Vref and the MSB determines 1. Since the
Stage-1
Vin
0V
3V
3. Results
3.1.
Vout
Bit 1
Digital Bit 0
out
Low
3V
0V
MUX
1.5
Fig. 3 is concept to go through each stage about input

signal. As shown in block diagram of Fig. 4, last
multiplier expresses restoration process to original
signal range. Therefore, the process is same theory with
concept of the pipeline A/D converter.
Comp
Vref
Fig. 4. Expectable wave form of the three stages

In theory, as Fig. 4, output value and wave through
each stage can be expected to result.
- 524 -
ICEIC 2015
3.2.
Simulation results
Fig. 5 shows the simulation results of the single-stage

of the input, the output voltage and signal through the
comparator in the proposed A/D converter.
As shown wave form of Fig. 5 and Fig. 6, the wave

of the system is identified and verified. However,
because of the characteristics of the comparator, the
amplifier and the MUX, the maximum and minimum
value of the input range confirmed to reduce it.
4. Conclusions
The proposed A/D converter doesnt have the digital
part. So, stages to determine the digital bits dont have
influence on delay or standby status at the clock. Once
the input signal enters at a time, all part operates and
emits digital signal. In spite of increasing in resolution,
the size and power dissipation of the total system could
be the minimal in the stage(s) having the same structure.
Then the clock-less 8-bit pipeline-like A/D converter
has merits to emit digital code.
Acknowledgments
Fig. 5. Simulation result of the single-stage
Also, the results are similar to the prediction results, as
shown Fig. 4. The Vin is the ramp signal and the Vref is
DC signal. So, the comparator outputs the digital signal
to compare both signals, the selection signal of the
MUX and the digital bit, and determines 1-bit of the
MSB. Then, the MUX outputs one of the Vin and Vsub
through the subtracter. Finally output of the
MUX(=Vout) passes the next single-stage. The results
show output voltage of the comparator about the Vref
and that of the Vout, while the ramp signal puts from 0V
to 3V in the single-stage. Therefore, as above Fig. 5, if
the single-stage or several of stages determine the MSB
or other bits, the proposed A/D converter is possible
rapidly.
Fig. 6 is shown simulation result of the proposed
A/D converter. These waveform shows output voltages
of the each comparator about Vref that determine 8bits,
while the ramp signal puts from 0V to 3v in the singlestage.

government (MEST) (No. 2008-0062617), the BK21
Plus program in Korea and the Integrated Circuit
Design Education Center (IDEC) in Korea.
References
[1] Mitsuhito Mase, Shoji Kawahito, A Wide Dynamic
Range CMOS Image Sensor With Multiple Exposure-Time
Signal Outputs and 12-bit Column-Parallel Cyclic A/D
Converters, IEEE Journal Of Solid-State Circuits, Vol. 40,
No. 12, pp. 2787-2795, December 2005.
[2] S. Sheikhaei, S. Mirabbasi, and A. Ivanov, A 0.35um
CMOS Comparator Circuit for High-Speed ADC
Applications, IEEE International Symposium on Circuits
and Systems, ISCAS, pp. 6134-6137, May 2005.
[3] Richard E. Vallee and Ezz I. El-Masry, A Very highFrequency CMOS Complementary Folded Cascode
Amplifier, IEEE Journal of Solid-State Circuits, Vol. 29,
No, 2, pp. 130-133, Feb 1994.
Fig. 6. Simulation result of the clock-less 8-bit pipeline

-like A/D converter
- 525 -
P2-25
Human Detection and Tracking System using IR-UWB Radar

Ha-Jun Kim1, Beom-Hun Kim1, Hui-Seon Gang1, Suk-seung Hwang2, Goo-Rak Kwon1, and JaeYoung Pyun1
1
Dept. of Information & Communication Engineering, Chosun University, Korea
2
Dept. of Electronics Engineering, Chosun University, Korea
1
haku41@chosun.kr, godseng1210@chosun.kr, greenysun@chosun.kr, grkwon@chosun.ac.kr
jypyun@chosun.ac.kr and 2hwangss@chosun.ac.kr
unwanted signals. Then, the constant false alarm rate
(CFAR) is used for detection of objects. Finally, the
Abstract
This paper shows a real time human detection and
distance measurement system using impulse radioultrawide band (IR-UWB) radar. First, the IR-UWB
signal is applied for clutter reduction to reduce
unwanted signals. After that, the constant false alarm
rate (CFAR) is used for detection of objects. Finally,
the object distance is computed based on time of
arrival (TOA). In order to evaluate the performance of
proposed method, experiments are made with real IRUWB test equipment. The experimental results validate
that the implemented IR-UWB tracking system finds the
moving human with tolerable ranging errors of 30cm
in 6m distance. 1
Keywords: IR-UWB, clutter reduction, and human
detection.
1. Human detection and Tracking System

There are sensor systems to detect a moving target
in indoor environment. Ultrasonic, infrared rays, vision
camera, and impulse radars can be used for this
detection system. Among these sensors, impulse radioultrawide band (IR-UWB) radar sensor has the best
detection performance to find the location of target
within 10 m from the sensor irrespective of background
temperature and brightness [1].
Our system consists of the IR-UWB radar device
imbedded with NVA 6100 chipset and detection
software as shown in Fig. 1 [2,3]. The observed raw
signal is applied for clutter reduction to reduce
* corresponding author
This research was financially supported by the Ministry
of Education, Science Technology (MEST) and
National Research Foundation of Korea (NRF) through
the Human Resource Training Project for Regional
Innovation (No. 2012-04-A-03-025-12-010100)
- 526 -
Raw data
Clutter
reduction
Detection
(a)
(b)
Fig. 1. Human detection and tracking system using
IR-UWB, (a) signal processing steps, (b) captured
detection result.
Fig. 2. Experimental environments for the

evaluation of human detection and tracking system.
10000
10000
8000
8000
Distance (mm)
Distance (mm)
ICEIC 2015
6000
4000
2000
Real Target Position

Measured Position by Radar
Real Target Position

Measured Position by Radar
6000
4000
2000
0
0
50
100
150
200
250
300
10
20
30
40
50
60
70
80
Number of Frame
Time
(a)
(b)
Fig. 3. Measured distance of human on indoor hallway, (a) case for a target rocking back and forth while standing,
(b) case for a target moving and turning to the reverse way (at the speed of 0.25 m/s).
object distance is computed by multiplying the time of
arrival (TOA) by the speed of light (i.e. d c TOA,
where d is target distance and c 3108 m/s is the
speed of light). Fig. 2 depicts the experimental
environments for the evaluation of human detection
and tracking system.
Table 1 : RMSE result observed for a human

detection on indoor hallway
Distance
(m)
1
3
5
7
9
2. Experimental results and discussion

Fig. 3 shows the measured distance to a person
standing and moving on the indoor hallway with our
developed impulse radar system. The experiments are
performed three times and expressed as average of
them. In both target scenarios, it is clear that the
measured distance is very close to real target distance
when the reflected signal is strong. On the other hand,
the measured signal includes the more clutter signals,
when the target is standing in a far location. Table 1
describes root mean square error (RMSE) of the
estimated distance to a standing person compared to
real distance. The increment of RMSE can be observed
when the target location increases. As a result, we
found that our developed system has range precision of
30 cm error in 6m distance and 70 cm error in 10 m
distance.
The developed human detection and tracking system
needs more advanced signal processing steps for
localization and clutter filtering [4]. Also, the system
performance is expected to be enhanced with the
combination of other target detection sensors.
RMSE
(mm)
57
108
206
335
619
Distance
(m)
2
4
6
8
10
RMSE
(mm)
102
165
309
440
690
References
[1] R. J. Fontana, Recent system applications of short-pulse
ultra-wideband (UWB) technology, IEEE Transactions on
Microwave Theory and Techniques, vol. 52, pp. 20872104,
2004.
[2] V. H. Nguyen, D. M. Kim, G.-R. Kwon, J.-Y. Pyun,
Clutter Reduction on Impulse Radio Ultra Wideband Radar
Signal, Proceedings of International Technical Conference
on Circuit/Systems Computers and Communications (ITCCSCC), pp. 1091-1094, 2013.
[3] J. D. Taylor and D. T. Wisland, Novelda Nanoscale
Impulse Radar, Ultrawideband Radar: Applications and
Design, 1st ed., Taylor, J.D., Eds, CRC Press, pp. 373388,
2012.
[4] D. Kocur, M. Svecov, J. Rovkov, Through-the-wall
localization of a moving target by two independent ultra
wideband (UWB) radar systems, Sensors, vol. 13, pp.
1196911997, 2013.
- 527 -
P2-26
The development of Multiple Encoder Interface SoC for Industrial control

system
Abstract
2. Multiple Encoder SoC
In this paper, a multiple encoder interface chip

produced by Field Programmable Gate Array (FPGA)
will be introduced. This chip supports two kinds of
encoders. One is an Incremental encoder, and the
other is a Magnetostrictive encoder that communicates
by Synchronous Serial Interface (SSI). The chip also
supports a Series Peripheral Interface (SPI). The SPI
is used widely in industrial applications. SSI clock
speed, SSI data bits, selectable multi channels and
finally, whether to use Incremental or Magnetostrictive
encoders is selectable by using the SPI.
Keywords: Magnetostrictive encoder, Incremental
encoder, SoC, FPGA
Figure 1 (a), and 1 (c) depict one of the most

common incremental encoders, and outputs two square
waves including a phase difference of 90 degrees.
Figure 1 (b) shows the magnetostrictive encoder which
can measure the position value. It have a precisely
resolution about 0.5um, and has output of SSI 24bit ~
26bit selection of Gray / Binary format. Currently, the
magnetostrictive encoder is widely used for position
measurement in the industrial control system. Figure 1
(d) shows output signal of magnetostrictive encoder,
and the data is transmitted at significantly higher
speeds as shown in the waveform. Therefore, the
processing will have significant overhead, if the main
processor to process the interface.
1. Introduction
The encoder is the key part of the industrial control
systems. It allows the controller to have more precise
control by getting information including position,
pressure, velocity, and so on. Therefore, the efficient
selection of an encoder can lead to better results in the
industrial control areas. Incremental encoders which
generate a square wave are widely used in controllers,
and many Micro Processing Units (MPU) already have
the interface embedded. However, more precise
encoder that generate information linearly using SSI
based on magnetostriction are hard to control by MPU
because of the overhead [1-3]. Therefore, we propose a
dedicated encoder interface System-on-a-chip (SoC)
that is responsible for the processing of incremental
encoders and SSI encoders. The proposed encoder SoC,
which was implemented in FPGA, has 4 channels for
each encoder interface, and is compatible with
compact-PCI that has been used by many in the field of
industrial systems. In addition, the multiple encoder
SoC supports the SPI protocol [4], so the MPU which
does not support the compact-PCI can also be used.
(a)
(b)
(c)
(d)
Figure
1:
(a) incremental encoder, (b)
magnetostrictive encoder based on SSI, (c) output
signal of incremental encoder, (d) output signal of
magnetostrictive encoder
- 528 -
ICEIC 2015
Moreover, in the case of multi-axis control system,
there is a need to handle more than one encoder
interface. In this case, the MPU cannot process other
work, because the interrupt is executed too often. The
multiple encoder interface SoC has specifications
including four channels for each encoder, 24/25bit
selection, Gray/Binary selection, a Compact-PCI
interface, and the SPI interface, and was implemented
on Xilinx XC3s200A FPGA. Figure 2 (a) depicts the
overall block diagram of the multiple encoder interface
SoC, while the internal structure of the encoder
interface SoC is shown in Figure 2 (b).
The test bench for operationss of the encoder

interface SoC is shown in Figure 4 (a), and the encoder
output value during normal operation with MPC5554 is
shown in Figure 4 (b).
(a)
(a)
(b)
Figure 4: (a) two-axis test bench with SSI encoder,
(b) output signal of SSI encoder at 50 kHz
4. Conclusions
(b)
Figure 2: (a) overall block diagram, (b) internal
structure of the encoder interface SoC
Experiments were carried out in conjunction with
Freescale's MPC5554, as shown in Figure 3.
In this paper, we proposed a multiple encoder

interface SoC for multi-axis systems. It has a feature
that can be output by the Compact-PCI and SPI
protocols, and has the advantage of low overhead for
the main controller.
Acknowledgement
This work was supported by Industrial Technology
Innovation Program(Advance Technology Center
Program) funded by the Ministry of Trade, Industry
and Energy (MOTIE, Korea) (No. 10048277)
References
Figure 3: The experimental board
[1] Leens, F, An introduction to I2C and SPI protocols,

IEEE J. Instrumentation & Measurement Magazine, vol.12,
Feb. 2009, pp. 813
[2] IEEE Standard Serial Interface for Programmable
Instrumentation (Standards style), IEEE Standard 1174, 2000.
[3] R-Series SSI, 09-06 550989 Revision D, Temposonics.
[4] MUJ, Synchronous Serial Data Transmission, Revision
TR-ECE-TI-GB-0002-01, Apr. 2000.
- 529 -
P2-27
The OpenMP Implementation for ROS-based manipulation algorithms

Abstract
2. OpenMP Implementation for algorithm
Most computer systems have evolved into multicore

systems, these increasingly demand parallel software
designs. Besides general-purpose computers, most
computers including an embedded system and a robot
platform have a multicore system. One of the ways of
parallelizing a computer system with software is by
using OpenMP. ROS, originally developed as the
standard robot platform, is commonly used to support
many types of robots. In this paper, we suggest
extending parallel programming using OpenMP to the
mechanical manipulation of a robot and discuss the
performance improvement achieved by using OpenMP.
Keywords: OpenMP, Multi-core system, PR2, ROS,
manipulation
1. Introduction
Today, for programmers to obtain significant
improvements in response time, they need to rewrite
their programs to take advantage of multiple processors.
Moreover, to get the historic benefit of running faster
on new microprocessors, programmers will have to
continue to improve performance of their code as the
number of cores increases. There are many parallel
programming APIs and OpenMP is one example of a
parallel programming API which can be used in an
easy way [1-3]. A robot platform can also be a
multiprocessor architecture. ROS is a robot operating
system which can manipulate many robots, and it
contains mechanical manipulating algorithms, which
allow the manipulation of many types of robots. One of
the robots that can be manipulated by ROS is the PR2.
The processing unit of the PR2 is composed of eight
cores. Therefore, it can be inferred that parallelizing
the software of a robot platform including PR2 allows
it to definitely take advantage of the platform hardware.
In this paper, we modified packages involved in PR2
arm manipulation. In addition, we discuss the
improvement of performance of the robot arm
manipulation by using OpenMP.
ROS contains stacks that only support the PR2. It

also contains other general stacks that support PR2
manipulation. One of the stacks, pr2-arm-navigation, is
involved in PR2 arm manipulation, and this stack has
dependency on some other packages: move-arm,
trajectory-filters, planning-environment, collision-freearm-trajectory-controller, pr2-arm-kinematics, pr2arm-kinematics-constraint-aware. Therefore, all of
these packages are engaged in the arm manipulation of
PR2, so optimizing and parallelizing these packages,
can improve PR2 arm manipulation [3].
ROS has its own makefile system, rosmake. ROS
packages are built using CMake(Cross Platform Make).
Each ROS package is built by CMake instructions, so
by adding the needed OpenMP libraries to the CMake
instructions, the OpenMP API can be adopted in
rosmake. Robot mechanical manipulation algorithms
contain many loop statements, which can be easily
parallelized by the OpenMP API. The loop statements
have to be identified before parallelization.
For manipulating the PR2 arm in simple motion,
move-arm, a node in arm-navigation stack, coordinate
motion planning, trajectory filtering and control to
move the robot arm to the desired position in a
collision free manner. move_arm has two C++ sources
and two executable nodes. It has numerous joints and
links that are engaged in arm manipulation, algorithms
should include loop statements, which can be
parallelized by using the OpenMP parallel for pragma.
Experiments were performed on a system with a
2.7GHz Intel Core-i5 quad core processor and 4GB of
physical memory with Ubuntu 12.04. The ROS version
Fuerte Tutle was used for this experiment. Simulation
was executed in the Gazebo simulator. In the gazebo
simulator, using Python instructions, robots including
PR2 can be manipulated automatically and in userintended behavior performed. For the simulation, 6
instructions caused movements by setting the arms
- 530 -
ICEIC 2015
destination in Cartesian coordinates. To measure time
easily, instructions which log elapsed time information
were added.
Each instruction was carried out 14 times in a
sequential algorithm and two parallel algorithms. In the
Parallel 1 program only move-arm is parallelized, in
Parallel 2 the move-arm and pr2-arm-kinematics are
parallelized. For each algorithm, the instructions ware
fetched in an identical order because arm positions in
different Cartesian coordinates can result in different
manipulation times. Figure 1 shows the simulation
results. Parallel 1 indicates the move-arm parallelized
program and Parallel 2 indicates the move-arm and
pr2-arm-kinematics parallelized program.
was parallelized, the manipulation speed improved by

2.44% on average. When both move-arm and pr2-armkinematics algorithms were parallelized, the
manipulation speed improved by 3.337%. These results
show that as more algorithms in packages are
optimized for better performance, the supported robot
reaction can be manipulated faster.
Table 2: Elapsed time on move-arm and pr2-armkinematics parallelized program
Instruction
Right
Left
Elapsed (sec)
Improvement
up
1.768
3.525%
down
1.536
7.531%
right
0.478
0.015%
left
0.401
18.429%
away
0.603
8.029%
toward
0.693
-3.412%
0.219%
up
1.822
down
1.594
3.126%
right
0.446
-3.429%
3.336%
left
0.391
away
0.619
4.434%
toward
0.665
-1.938%
11.014
3.337%
Total
4. Conclusions
Figure 1: Simulation results plotted by MATLAB
The simulations indicated the improvement of PR2

arm manipulation can be achieved by just optimizing
the engaged algorithms, which is written in software
and applies OpenMP parallel programming to these
algorithms. PR2 has eight cores for the computing
system, so parallelizing the embedded algorithms can
be advantageous. This type of parallelization can be
extended to other movements, such as base movement,
and can be used in existing robots.
Table 1: Elapsed time on move-arm parallelized

program
Instruction
Right
Left
Total
Elapsed (sec)
Improvement
up
1.820
0.703%
down
1.541
7.786%
right
0.450
5.860%
left
0.477
3.442%
away
0.592
10.543%
toward
0.670
0.052%
up
1.817
0.514%
down
1.626
1.224%
right
0.399
7.304%
left
0.413
-2.045%
away
0.663
-2.412%
toward
0.660
-1.117%
11.126
2.440%
Acknowledgement
Research Program through NRF of Korea, funded by
MOE(NRF-2010-0020210)
References
The
experimental
results
show
different
improvement ratios for each instruction, and because of
the sensitivity of movements to the system status, an
instruction implemented in an identical order may have
different results. At first, when the move-arm package
[1] S. Akhter, and J. Roberts, Multi-Core Programming:

Increasing Performance through Software Multithreading, Intel Press, USA, 2006
[2] B. Chapman, G. Jost, and R. van der Pas, Using
OpenMP:
portable
shared
memory
parallel
programming, The MIT Press, England, 2008.
[3] B. Hayes, Computing in a parallel universe, 2007.
[4] PR2 algorithm descriptions,
http://www.ros.org/wiki/Robots/PR2
- 531 -
P2-28
The development of Multi-Axis Hydraulic Controller based on EtherCAT

Abstract
2. EtherCAT-based Hydraulic Controller
Hydraulic systems are more powerful than

conventional motor systems. Thus, hydraulic systems
are used in press machines and industrial heavy
machines in order to produce a large frame size.
However, these machines usually require over 100
axes for a precise frame shape. To solve this problem,
we propose a new hydraulic controller based on
EtherCAT, which has a real-time speed. Our hydraulic
controller can control up to 256 axes through
EtherCAT protocol, and accurately control each axis
using a high speed MPU.
Keywords: Hydraulic controller, distributed control,
EtherCAT
1. Introduction
Industrial motion systems have been used in
electronic motors due to their convenience and ease of
control. Many studies have recently been carried out to
analyze electronic motors and develop many
controllers [1-3]. Although electronic motor systems
have been widely used in many industrial communities,
hydraulic systems are used in other systems that require
more force. Hydraulic actuated systems are currently
used in a wide range of industrial applications, and they
continue to be popular and relatively inexpensive
power sources. These systems provide similar
performance to that of electric motors, including high
durability, the ability to produce large forces and
relatively quick response times [4], as well as the
benefit of lowering costs. The press machines of
hydraulic systems make frames or metal products. In
this case, they require a synchronization controller for
systems that have less than 16 axes. However, large
sizes ships frames and cars frames usually require
synchronization controllers that have more than 100
axes.
Therefore, we introduce the synchronized multi-axis
hydraulic controller based on EtherCAT and explain
each detailed part.
The EtherCAT protocol is optimized for process

data and is directly transported within the Ethernet
frame due to a special Ether type. It may consist of
several sub-telegrams, each serving a particular
memory area of the logical process images that can be
up to 4 gigabytes in size. The data sequence is
independent of the physical order of the Ethernet
terminals in the network; addressing can be in any
order. Broadcast, multicast, and communication
between the slaves are possible. Direct Ethernet frame
transfer is used in cases where maximum performance
is required, and the EtherCAT components are
operated in the same subnet as that of the controller.
However, EtherCAT applications are not limited to
a subnet: EtherCAT UDP packages the EtherCAT
protocol into UDP/ IP data grams as shown in Figure 1.
This enables any control with the Ethernet protocol
stack to address EtherCAT systems. Even
communication across routers into other subnets is
possible. In this variant, system performance obviously
depends on the real-time characteristics of the control
and its Ethernet protocol implementation.
Figure 1: EtherCAT Packet structure

Figure 2 shows the overall structure of the Hydraulic
controller based on EtherCAT.
- 532 -
ICEIC 2015
comparison between the state-of-the-art hydraulic
controller and our proposed controller.
Figure 4: The Extend Synchronization Control

Structure
Table 1: The comparison of specification between
conventional controller and proposed controller
Figure 2: The overall system structure

The hydraulic controller has two functions: the local
synchronization and the extend synchronization control.
Figure 3 shows the local synchronization control,
consisting of a master and a slave. The master uses
MPC8349 of Freescale Company. This master MPU
clock speed is operated at 556 MHz and supports a
memory management unit. In this master, we installed
real-time based montavista linux to efficiently manage
each slave. The EtherCAT master is also included. The
master and slave communicate via a PCI interface. The
PCI of the master manages each slave board.
The slave uses MPC5554 of Freescale Company.
The Slave MPU clock operates at a speed of 132 MHz
and includes SSI, ADC, DAC and Digital I/O. The
press machines current position is obtained using a
SSI encoder that uses the magnetic method. This SSI
encoder operates at 250 KHz and 25bit. In addition, the
slave input uses an incremental type encoder.
Sampling Time
Control Axis
Interface
Network speed
Master CPU speed
Slave CPU speed
MAC-8 [5]
1000us
2~32
Proposed
500us
2~256
Profibus DP,
CAN
EtherCAT
12Mbps
860Mhz
40Mhz
100Mbps
1260Mhz
132Mhz
3. Conclusions
We proposed a hydraulic controller based on
EtherCAT, which consists of EtherNET-based protocol
and fastest speed through industrial areas. Our
proposed controller can control more axes compared to
the conventional controller.
Acknowledgement
This work was supported by Fastech under Project
Number S-2014-1020-000
References
[1] R. Kelly, and J. Moreno, Learning PID Structures in an
Introductory Course of Automatic Control, IEEE Trans. on
Education, Vol. 44, No. 4, 2001
[2] A. Rubaai, Marcel J. Castro-Sitiriche, and Abdul R. Ofoli,
DSP-Based Laboratory Implementation of Hybrid FuzzyPID Controller Using Genetic Optimization for HighPerformance Motor Drives, IEEE Trans. on Industry
applications, Vol. 44, No. 6,
[3] W.J Wang; J.Y Chen, Compositive Adaptive Position
Control of Induction Motors Based on Passivity Theory,
IEEE Trans. on Energy Conservation, Vol., Issue 2, 2001
[4] R. Dorf and R. Bishop, Compositive Adaptive Position
Control of Induction, Modern Control Systems, AddisonWesley, 1995.
[5] Bosch Rexroth, VT-MAC8, http://boschrexroth.com
Figure 3: The local synchronization control

structure
Figure 4 shows the Extend synchronization control
structure. Each part has an EtherCAT slave module.
Each EtherCAT slave module sends its information to
the EtherCAT master. Table 1 depicts the result of
- 533 -
P2-29

!
"
## $ %#

&
#

%# $ '
#

! #
(' ##

$ #

$ ##

! ' #

#

!" #
!

$& %' &
( )
+ " !# *
! "
! -,./#
0! %"
-12/ "%
%! !
% ! ! %
#
%
" ! "
"#3+
"!%4 ' %!
%# !%4'%
%'!!'#
' !
& ! %
% "
#5'
% " "
% #
"!%
" ! ! '

!#
! !!

"
% ! # '
!%' ! ! "
!
! #
6' ! '
% # 3
" !%4
' !
' " ! '
# ! !
! %#
6! %" &
" "
' + %
% ! %
#
" #&
%$

& 87 9: 5 (%4
) ;' %' %%
4!879: %'

< ,# 4 !
& '
! % 90 (9
0) %% # 6
*=(*"=) <,
9,,> %
! ! &
%
#6
%"(0
<,) % *=
&! 6%#
- 534 -
ICEIC 2015
<# , $& "
9,,>"()#

3 %'
?
'#6 !%
0 % *=

& ! 6 %
&# 6 4 !
* ( *)
%
#
6 ! "
*=
!!% *=
"
#<@ ! "
!! *=
'! !
%' " # !
! "
! #
' *=
< .#
' ! !
,7A %" ! *=
&"#='
!
' % "
@A#
6! 4 %" ! *=

" ! "
#6%
() ! B ' &
"% < 1#
"% % % !
! "! #
<#1 %B'(5)! 9,,>

"#
'

C
! &' %
!? "
! "%# % !
+ !
' "
!' "
&'# "&
' % ! ! ! '
# < " "
% !
B ' %
!#
)
(
4 %' " 9'
'#
$
<#@ ! !#
<#. 9,,>0'!%!!

B#

-,/ D # 9 E $!!
$F $$$#
"#..#2#
,,@2,G>8#
-@/ 9 # * 9 # *' 6#
DE$!!0 F
$$$#
"#.2#8#,21H,22,
,G>>#
-./ 6#9#E !!I"!
F $

$"#.#.#,@.,.7,GG1#
-1/ # 5# 3 * # 9# 0# # #
J
!60J $$$
##
#"#
..#8,G>8
-2/ # <# "' #6# 0 E
F $$$##
#
,8 G8,7.
*,G8G#
- 535 -
P2-30

! !
!

! ! # "

$&'(()%
*
!
+ ! !
!
, * &'(()

" +&,
! (--
"
*&,.&,
) *(/
! *
!!
!)
! *

!
! ! "

!) !
!
"0,&'1234

"
!"#"!!" !" "
$% &" # % %# "
#
!$

%$&'
(!

" # "!"(!,!!
" " ,( 5-6 !("! %7% # " *
" # ! # !'" "
" ! ",! " # " *
"! ,, " ! ' # !'" (" ! " ,!
" !'!("""!"
! ,( 5-6! !'' ' " ,(
!!,"! ""283*
$

"#" ! ! ' " !" " "#
! ! ( " ) ' '!! ' !! "
!"*""! "!!!!(
", " '''+!!"! !*
- ., ' + ! ! " +
! " ( ) "" '' !
!'" !* $ % ' !" "
. ,( ," " ) /0 ! !
" , # '' 213* "! ,, "
#" " # ! !!" " "
''"%*
$

- 1!(!") '%'
" * $ !" % % # " + ,
#! "! ' %* " ! !
"45/, " ! #0 "*213
%$)$
!

- 8!(!" "" ' " #"
" # * - " ," !,, !! ' 9+
1:+ " " # "! " "," #" '
9:+/
+<"- ;0(""!" ,
," *"+#"!=:+ "#"
# ' -<" ! ! "( :+ " =:+*
#" " # !'' ! ' " ,(
!,""#!" !!!("
"!" ,,#">!"' "(!, "
- 536 -
ICEIC 2015
' 8 * " " " " ! '
+<""""'8 8!""*
"! ! " , ! " -<" #" !
=:+!"':+"+"#"! !
9:+!"'1:+*"!! ""'!
# " ! :+ " # " ! !
!'' ! ' " +& #" ' =:+ #
!# * # "! , ! (
! ",!
+<#!'"*
%$,
-$

*$
%$.!$

$

%$+$

- ;!(!" "" '#!'"
!*!#!'" !"! ",!
" * ?" "! ! " ,! " " #" '
! 1 ! " ! #" ' - "
!1''">!"' "8*
#" # !'" " # " !
,)7/8 80*
(# ! " " ' " ! "
,! " '((51 58
>!" " "" # ,( !!," !
) *6@"/10 , !"!"#
"("! ",! "

/10

?" " ," " $A A5B " !
!( - ; " ! " ,! ! " "
' ? ,! ! !( - =* ?
51! B<"!!""","#"
'
+<" ! 9:+* C !" # " !
'( " # ! ,( 5-6 1*
","#"'-<"! +,# /=:+0 ! !(
- 9*?58! B<"! !"
"","#"'
+<"!:+*$""""
! ,( 5-6 1 ! '' ( ! ,(
5-68!*!, "'( ! #
!'" !!!!.,""#"#*
"," ' ( ! # !'" /+<"0 ! 1:+*
? ( ! ,( 5-6 ! " ","
#"'-<"!:+*
"!,, "#"" # !!

' " ,"#"!!"*
",( !!,"#!" !! ! ",!!
""!#!'" *- C!(!
" " /89:: . 9:::0 ' !!" , "
(!' "%5:*;9, !!*

2.1113
%$/*
$0).11
(
"!
! ! (!!,, ""/!" '
%4-" ,0 "
B% !,, " , /A$ 8:1=
:;:1 1= 1::D0
!, #!"A$!,, ""!"
% #," /1::=E::E0
'"!" ' !" 46
4
213 ** ** % ** * *
* %
F$%!'" ' "#"!"!G
5%% A# *8:1;
283** **% ** **% ** *
*
% F$ $ % " ! " '
"#"!"H %6% 8:1=
2;3 $A C:IC F! $,," & ' "!" ,
% " '
+" &" # %H 8::D -
" % , "*
- 537 -
P2-31
A 30ps-LSB 1.63mW Time-to-Digital Converter Using an 8-bit SAR ADC

Kyoung-Tae Kim, Young-Ouk Kim, Yong Choi and Gil-Cho Ahn
gcahn@sogang.ac.kr
Abstract
This paper presents a time-to-digital converter
(TDC) using an 8-bit successive approximation
register (SAR) analog-to-digital converter (ADC). To
avoid the dead-zone effect, dual edge phase detector
(PD) is used. A pseudo-differential charge pump (CP)
is employed to convert timing information into voltage
level. A hybrid-RC digital-to-analog converter (DAC)
is used in the SAR ADC to minimize area. The
prototype chip implemented in a 0.18m CMOS
process achieves a time resolution of 30.5175ps while
consuming 1.63mW with a 1.8-V supply voltage.
a duty cycle of 50% reference clock (CLKREF). A time

interval between the two input signals (CLKREF,
TDCIN) is converted into a voltage by CP while the
CPRST signal is low. Then the CP output is sampled by
the following 8-bit SAR ADC at the falling edge of
SAR and quantized. 16-MHz non-overlapping clocks
generated from a 256-MHz external clock are used for
the operation of the proposed SAR ADC.
The time resolution of the proposed TDC is given by
TREF /2N, where TREF is the clock period of the
reference clock (CLKREF) and N is the resolution of the
ADC. Time resolution of the proposed TDC is
determined by the reference clock frequency and the
resolution of the following ADC.
Keywords: Time-to-Digital Converter (TDC), dual

edge phase detector (PD), charge pump (CP),
successive approximation register ADC
SAR ADC with hybrid RC DAC
Phase Detector and Charge pump

VDD
SAR
VDD
VREFP
VREFN
CLKREF
1,2
Clock
Generator SAR
CLKREF
VCMO
VREFN
VREFP
DNR
UPF
PD(F)
DNF
SW
SAR
SW
SAR
SW
SAR
SW
SAR
VREFP
SCN
SRN
SW
SAR
CPOUTN
UPR
PD(R)
CPRST
VCMO
8C
4C
2C
8C
4C
2C
cop
1,2
SAR
Logic
Dout
<7:0>
CPOUTP
R = Rising phase
F = Falling phase
RST = Reset
A time-to-digital converter (TDC) is originally

developed to quantize time intervals between two rising
edges in a number of measurement systems, e.g., timeof-flight (TOF) particle detectors, laser altimeters, UV
imagers [1]. As the required resolution of TDC is
increased, diverse techniques such as vernier delay line
[2], two-step TDC [3], and charge pump with analog-to
digital converter (ADC) [4] are presented. While the
first two techniques resolve the issue of limited
resolution in time domain, the last one uses charge
domain which provides a good trade-off between
resolution and power/area overhead. In this paper, we
propose a TDC using a dual edge phase detector (PD)
and an 8-bit SAR ADC.
DN
VCMO
TDCIN
MUX
1. Introduction
UP
CLKEXT
DN
UP
VREFP
VREFN
VCMO
SW
SAR
SW
SAR
SW
SAR
SW
SAR
SW
SAR
SRN
SCN
VREFN
VREFP
SAR
VREFN
Fig. 1. Block diagram of the proposed TDC

CLKEXT
CLKREF
TREF
TDCIN
UP
DN
CPOUTN
CPOUTP
CPOUTP
CPOUTN
VCMO
CPOUT
CPRST
(a)
2. Architecture.
TDCIN
CPOUT
The block diagram of the proposed TDC is shown in

Fig. 1. It consists of a dual edge PD, a charge pump
(CP), an 8-bit successive approximation register (SAR)
ADC, and a clock generator. A twice faster external
clock (CLKEXT) with a 1/2 divider is used to guarantee
CPRST
SAR
DOUT[7:0]
DOUT(n-1)
DOUT(n)
(b)
Fig. 2. Timing diagram of (a) PD+CP, (b) SAR ADC
- 538 -
ICEIC 2015
Comp
CAP Array
Charge Pump
SAR
Logic
Serial Data
Logic
Clock Generator
Fig. 4. Layout of the prototype TDC

CLK REF= 128MHz, Input Signal sweep
0
0.66
SNR=50.9dB
SNDR=50.5dB
DR=50.9dB
SFDR=62.0dB
THD=60.9dB
ENOB=8bit
-10
0.65
-20
0.64
-30
Magnitude [dB]
voltage of charge pump[V]
The timing diagram of the dual edge PD and CP is

shown in Fig. 2(a). A dual edge PD is used to reduce
the dead-zone effect. Among the rising and falling edge
PD outputs (UPR, DNR or UPF, DNF) one pair is
selected by TDCIN and transferred to the CP via MUX.
A time interval between UP and DN is converted into a
voltage with the CP and sampling capacitor of the
following SAR ADC. By using the CP control signal
(UP, DN) which is larger than half clock period of the
CLKREF, the dead-zone effect is alleviated.
A cascode pseudo-differential CP [4] with two
common-mode feedbacks (CMFBs) is employed as
shown in Fig. 3. Cascode current sources are used to
minimize the current variation resulted from the output
swing. The dynamic CMFB circuits are employed to
adjust the output common-mode level of the CP to be
VCMO during reset phase (CPRST = high).
An 8-bit SAR ADC is employed since its simplicity
and low power characteristics. To achieve small-area,
hybrid-RC DAC is employed. It consists of a 5-bit
charge-redistribution capacitive array and two 3-bit
voltage-scaling resistive arrays. The total number of the
unit capacitors is reduced by a factor of 2 3 compared to
the conventional capacitive DAC by using the 3-bit Rstring sub-DAC. To achieve further reduction of area,
the VCM-based switching is employed.
Phase
Detector
3. Circuit Description
0.63
0.62
0.61
-40
-50
0.6
-60
0.59
-70
-80
0.58
0.57
-90
1.6
1.7
1.8
1.9
2
2.1
2.2
2.3
Time [measurement from 50ps interval]
2.4
0.05
0.1
0.15
0.2
0.25
0.3
Frequency [MHz]
0.35
0.4
0.45
0.5
(a)
(b)
Fig. 5. Simulation results (a) Transfer curve of the
PD+CP, (b) FFT spectrum of the SAR ADC
Table 1. Design summary of the proposed TDC.
Process
Resolution
Sampling rate
Clock frequency
Power consumption
Size
0.18m CMOS
30.5175ps
1MS/s
128 MHz
1.63mW (@1.8V)
0.28mm2
5. Acknowledgment
The designed TDC was implemented in a 0.18m

CMOS process, and occupies 0.28 mm2 active die area.
The prototype chip layout is shown in Fig. 4. Fig. 5(a)
shows the CP output for the variation of time interval
between CLKREF and TDCIN with 50ps step. Fig. 5(b)
shows the simulated output power spectrum of the
proposed SAR ADC for a 150-KHz sine wave input
with 1-MHz sampling rate. The simulation result
indicates a signal-to-noise and distortion ratio (SNDR)
of 50.5dB, a spurious-free dynamic range (SFDR) of
62.0dB, respectively. Specifications of the prototype
TDC is summarized in Table 1.
This work was supported by IDEC and the Nuclear

R&D programs (No. 2013M2A2A4043699) of the
MSIP (Ministry of Science, ICT and Future Planning),
Republic of Korea.
VDD
<CMFB CIRCUIT>
CMFB
VCMO
BS<3>
outp outn
BS<3>
BS<3>
VCMO
References
[1] Y. Arai, T. Baba, A CMOS time to digital converter
VLSI for high energy physics, IEEE VLSI, pp. 121-122,
Aug. 1988.
[2] P. Dudek, et al, A High-Resolution CMOS Time-toDigital Converter Utilizing a Vernier Delay Line, IEEE
JSSC, vol. 35, No. 2, pp. 240-247, Feb. 2000.
BS<2>
[3] M. Lee, A. A. Abidi, A 9b, 1.25ps Resolution CoarseFine Time-to-Digital Converter in 90nm CMOS that
Amplifies a Time Residue, IEEE JSSC, vol. 43, No. 4, pp.
767-777, Apr. 2008.
CMFB
VINNB
CPRST
UP
outp
DN
outn
CPOUTP
VINN
CPRST
VINPB
VCMO
BS<3>
outp outn
VCMO
CPOUTN
DNB
UPB
VINP
BS<1>
CMFB
BS<0>
Fig. 3. Schematic of charge pump with two CMFBs.
[4] Z. Xu, S. Lee, M. Miyahara, A. Matsuzawa, A 0.84psLSB 2.47mW Time-to-Digital Converter using Charge Pump
and SAR-ADC, IEEE CICC, pp. 1-4, Sep. 2013.
- 539 -
P2-32

!
# "

"

$

)
( '
(
( &%*++
( -, - ,

( .

/

)
.#
( &0& &/ 0(
/
&))
(
)
,

.

. &0&
/ 1
( '

#
( '
*32 /
. (

7
65 4 #8 ## )

#)

35 9 ,(

/ .
(
-,)
(

"!"#
!

"!" $" ! "&&% '
&(& ('
''' ' &'' # )
&) ' ) "!" *
'' ) ' ) '''#
+' ' & )' '
& * & ) ''
"!" ' ' &
' ' &'' '& '
(& &')'( '',
-#
. ' && ) & '
"/00 $ )
'%&)
112"!" ' &'#
) ) & ' ('

''' )#9(''' ))
' * &(
) (' ''' ) &
'#
$ &%

. '
112 "!" ' & (
) &():
11;1;
'&(4:
; ' &'#:
36! & )
)"!" '')
11
& ''&' )

'&(#
' (

"###

&' ( &
' '!./ 43/
5 "/00,
0-#. '& '*&'
))'))) & '#
3 & ) ' ) & '
3/6)/! $36!% 7 )
''' ) & )
))'' '# (
' ' ( 8 ' )
- 540 -
% )*+,

) :
4'
:0
000 :&
:0?0=
:&
:0B
:&
0

.
;0

''
40
0
4
:9
:
9
9>3=;<11
4"@A@00!3:1?
9>3=;<
111

11"

C1B0
1!
"14
11
A20DB/1?;
ICEIC 2015
3' 36!

&&'"!"'&''' )
&) ) * & ' )
)')4E ' &'#
/. #

&
0)"):&#'' '
) ) "!" ' "/00
' ' ' ) 0 ,?-# '&)
' 36!)#
+, -&%+ &%,

$.#
+,(# &%+,
+, (# &%+.,
''))"!"''

/B<F& &B1
:'' )?#='')
& & C <F<
: D1 G ) (#
B ' ) &
))"!"# '&'
&' ( )
& 'F&.:'#

/.##
"(#

- 541 -
ICEIC 2015
. ' && ' &)

'&' ) 4E ' '''( )( '&'
'&$ &%'*
( '& &/(
'''# "!" &
$H1 G ) F %
&'# H '' '&' ' '&
'7& ) #
0 -(#

+, (#
1' (#

0. 23%
+, #
' ' ' &' )

''''7*) *& '
) )' ) &&# 4 &
F (' ) '''' ' ' &
( && 4E '7 '
' )5#
+, %5 #(

623%
423%#

& & )
'7& &B1:<
=1!" )7 '&(#D
- 542 -
ICEIC 2015
'' ''' ( ) &/(

'#
8(

' * ' & '&& J4
& ) !6 .@<. # ,9111
1
"&&
&()''-
.
7%(#
-(
23%

' '' ) ' )
&''#"!"& '
/B1 : ) '& 51 : )
'& $/B1 I 51% : ) '* ?1
!" ) ( '7 ' '
#

%" ((23%
'

'&

;
'*
:
,
- # "# : # K &
&&)4:/4: (''' ''L

9.

( /

&
# 9& &&# H/0
9 C #
1
?#

,- !./ 43/
5 K! *
)@ @7& L4& )4) '
4#
DD
#

,0- "/00 K )
@ @7& L ' #1
#

,?-#')#
E&&
9<
/B1:
9<
51:
?1!"
9<
51:
/B1:
=:'$''%
51:
/B1:
?1!"
=!"
=:'$''%

1 ((

& ' '
' ' "/00 ' &
) )'& ) "!" '
&'# ' && &' ' &
&& ) ) ) "!"# ' '
) ) "!" ' '
/B<
D1 G ) ( F &
& B1 :# ' )
&''# 9 & ' )
4E ' /B1 :)'& 51
: ) '& $/B1 I 51% : )
'* ?1!") ( '7 #
- 543 -
P2-33

$
% #"!
&
&'&
(%

& $ * &

& & & &) &

) '
&

& %
*& )'

&
& *
& &
&% &
& + (
'
' ) & & &% &
& +
*
*
& & ) ,
% %

&* & *

' & - ' &
&
&*
& *'

%
% &% &
' &'
&

% & . '

*
& % &
& &% '

% &
&

& ) %

' & %
&

& (

&

&

/ &
%

& & * ) , %

* / %
' % ) (
& *

%(
) && & + &

'
&% ' )
+ & && & * (
*

&*
' ' '&
& *

) % %

&

& &

&& & )
&
( *
/ % + & && & ) '
'

(
"10&

" ! # $%
"!#

# ' & $ &('&
$ * ') "&
' & '

& + * $ '' &
&& -,.) # & ' &
$ '' & ( )
# ' ''
& /& & &
' &
') # (
&
%* ( $
& $ ' $
*( & $ 0
& '' &
* & & ( -1%2.) #
+ &
' ( '
& '* $&
( ' (
$)-3. # ' (
&( ) " '
& '
)#4
&
' $)
# &
& ' & ) # *
& $* ( ( $
& ' ' +
&) # &
'& $ '(&-3.)
$!

5 ),* $
& ) 2762
6)8 : ,89 & *
'& $ 4' ) #
5+ &&& 4 ;
< ; =)#! &$
&&&
4 ) # +
4& ' ) #
- 544 -
ICEIC 2015
#?21651>,1' &55#<55

#= & + 6)18/)
# ' & ' / &
/ ' * * +
/)
# & $* ' ' &
(( $ '
+
& + & $ ) # 5 2
* ' + ') #
''&&$ 4 (
' & '& $ '&&
) # *&
& ' CCB) #
D8B&'&* 4 )
(!

5 ,)#5 @
!
5 1*' ' '$)
#'' &&
' ($)#'& '
( '' ' )

# + & $*
' ' & ( ( $
+ 55#<55 #=)
# /&&4 +
&& + ) # ''&
& $&
& ; ( ) #
* D8B &
* & )#+
& '*
$& & & )# $
* $ '(&'' )
-.0+)*,-/
5 1)A' ' '

%!'&

# & &
$ ; ( )
# ; < ; = &
$4* $&
& $* & )
#& '&+ )
# + '
' &
,)8/ $ ( ( $ ) # 1& 2&
& 3 ' & + & ,
'
' & + ' ' $
* 1& 2& & 3 ' &
+ & & ,)8/ $
( ( $ ) # +
/& $ &
& ; ( )

5 2)#' ''

# *
*&$ '' "#
GE!'?A#"F"#'H),6633C73
'H I !(' %
" ! J $ ''
; ( 'H ) 16,26311,613
'H I 5 !
$ 5 J & $
'' K
) & 'H )
16,367,D1662 'H I!
( '& J)

-,.L"
! ( I9 #
&$
JL ,CCD
-1.?)?
I & ( $9
" ! J 3, " "
# '')
,72%,7>A$166D)
-2. M"L; ) & I5 $ A' ?
5J'$1667)
-3. -K ) ? I# ! & (
9 9 J $ ?N
@ *% 166,)
- 545 -
ICEIC 2015

Poster Session
PS-3
Computer and Information, Emerging
Technologies, Signal Processing
P3-01
PCI Express Gen3 Switch Card Development by Using High-Speed Signal

Integrity Analysis
Won-ok Kwon, Young Woo Kim, Hagyoung Kim
Cloud Computing Research Department Electronics and Telecommunications Research Institute
161 Gajeongdong, Yuseong-gu, Daejeon, KOREA
happy@etri.re.kr, bartmann@etri.re.kr, h0kim@etri.re.kr
Abstract
This paper deals with high-speed serial system
design methodology by using PCI Express Gen3
system which is high-speed point-to-point serial
protocol. The high speed serial signals can be
analyzed by measure of loss, jitter and eye diagram in
the channel. This paper deals with signal integrity
analysis like as topology extraction, channel analysis,
extraction s-parameters from passive components,
calibration of transmitter buffer de-emphasis and
measurement of eye diagram through PCI Express
Gen3 server connecting switch system design.
passive components of the link are collectively called

the channel. To ensure signal integrity, it is important
to carefully design of passive interconnects [3]. The
signal integrity analysis of board level and system level
is necessary to make stable high speed serial system
especially PCIe Gen3 system [4]. This paper deals with
high speed board level design methodologies through
design of PCIe Gen3 switch card (PCIeLink) used
server system networks.
2. PCIeLink System
A.
PCIeLink card architecture
Keywords: high speed serial; PCI Express; eye

diagram; jitter; de-emphasis
1. Introduction
PCI Express (PCIe) protocol is widely used in
computer I/O interface since PCIe specification 1.0a
was announced in 2005. After that PCIe 2.0 and PCIe
3.0 is announced in 2007 and 2011 each. The PCIe 1.0
is 2.5GT/s bit rate and PCIe 2.0 is 5 GT/s which is
doubles the transfer rate compared with PCIe 1.0. The
PCIe 3.0 is speed up to 8 GT/s and it can support
double times bandwidth compared with PCIe 2.0 by
using 20 percent performance improved encoding
scheme[1],[2].
The PCIe protocol is used a low-voltage differential
signaling (LVDS) which is embedded clock signal and
lane x1, x2, x4, x8, x16 can be adjusted freely by
supporting a multi-lane in x32 bandwidth. The
maximum bandwidth is 8GB/s, 16GB/s and 32GB/s in
PCIe 1.0, 2.0 and 3.0, respectively. They are high
speed serial signal and electrical specifications for the
transceiver buffer, the transmission line and system
interconnections are defined in PCIe specification. The
Fig. 1 PCIeLink card interface
PCIeLink card is designed for the computer system

interconnect switch card using the PCIe Gen3 switch
chip as PLX PEX8725. The PEX8725 chip works
multi root switch and it can support 10 ports and 24
lanes. It can be configured various virtual modes as
well as basic mode [5]. Figure 1 shows the
configuration of PEX8725 chip in the PCIeLink card.
The station0 are connected x8 host interface, x4
QSFP+ interface and x4 loopback interface with
Station 1. The host interface ( ), QSFP +
interfaces() and the loopback interface () are all
connected PCIe Gen3 protocol therefore they must be
validated through the analysis of high-speed signals.
- 547 -
ICEIC 2015
This paper deals with host interface signal integrity
analysis which is the most important interface in the
system.
B. PCIeLink system configuration
Fig. 2 PCIeLink system configuration
Figure 2 shows PCIeLink system configuration. Host

server supports x16 PCIe Gen3 slot based on Xeon E52670 CPU and it is connected with PCIeLink switch
card through the riser card. Table I shows the
specifications of host server, riser card and InfiniBand
(IB) cable in detail.
TABLE I
PCIELINK SYSTEM CONFIGURATIONS
# of
Servers
PCIeLink
Switch
Host
Server
IB cable
Specifications
Company
PEX8725
PLX
CPU : Intel Xeon E5-2670

Motherboard: X9DRG-HTF
Server name: 1027GR-TRFT
MC2207130-003 (passive
copper cable), 3m
Supermicro
Mellanox
Fig. 3 Channel between PEX8725 and CPU
Figure 3 shows the channel topology between the

PEX8725 and CPU. The channel is consist of PCIe
transmit buffer (Tx), package (Tx Pkg) of PEX8725
chip, add-in card channel (Channel #1), PCIe riser
connector (Con #1), riser card channel (Channel #2),
the mainboard connector (Con #2 ), mainboard channel
(Channel #3) and receiver package (Rx Pkg) and
buffer (Rx) of Intel Xeon E5-2670. To measure the
signal integrity of the channel, first we extract the Sparameter for each element. The HSPICE models of
chip buffer are provided by each manufacturer [6], [7].
System signal integrity can be analyzed by measuring
of the eye diagram at the receiving packages.
B. Parameters extraction for signal integrity analysis
The HSPICE models of PEX8725 and Xeon CPU
transceiver is directly used for signal integrity analysis.
The S-parameter of channel # 1 in the add-in card can
be extracted from designed PCB file by using SIwave
EM analysis tool of ANSYS Inc. However, extraction
S-parameters from the mainboard and the riser card are
not available because they are not self-production but
the commercially buy product. Therefore, we used Sparameters of worst condition length and the number of
via to extract these two parameters. The transmission
line of mainboard is set to 12 inches and riser card is
set to 2 inches each. The mainboard routing path is
used with connector-via-micostripline-via route.
Table II shows the parameters of PCIeLink host
interface topology.
3. Signal Integrity Analysis of System
TABLE II
PCIELINK SYSTEM CHANNEL PARAMETERS
Host interface topology of PCIeLink system

The PCIe Gen3 signal has 125ps bit interval and it
can be allowed maximum channel length up to 14
inches for client and 20 inches for server each. Deemphasis of transmitter and receiver equalizer
adjustment is required for correction channel of the
PCIe Gen3 system.
Model
PEX8725
IC
Pkg
Add-in card
Riser card
Mainboard
Intel
Xeon
E5-2670
- 548 -
Paramet
er
TXDRV_Model
RXRCV_Model
Pkg_pex
HSPICE
model
S-parameter
Tx0~Tx
7
CON
TL
CON
Via
topentry_62mil
S-parameter
pcie_conn
Via_model
TL
S-parameter
12 inch
Via
PKG
Via_model
Pdg_pxp3_rev1p0
RXRCV_Model
TXDRV_Model
HSPICE
model
IC
2 inch
ICEIC 2015
C. PCIeLink channel signal integrity analysis
We perform channel simulation and get eye diagram
to analyze signal integrity by using these parameters.
The Ansys Nexxim transient analysis tool is used for
performing channel simulation [8].
Table III and figure 4 show signal integrity
simulation results. The simulation is measured eye
diagram parameters as eye height (H), eye width (W),
jitter, eye margin, the and jitter margin at receiver
buffer by changing level of de-emphasis and preshoot
in transmitter buffer.
(c) De-emphasis=0dB, Preshoot=0dB
TABLE III
RESULT OF SIGNAL INTEGRITY ANALYSIS
De-emphasis(dB)
Preshoot(dB)
Case1
Case2
Case3
Case4
Case5
-6
-4.5
-6
-3.5
3.5
3.5
H(mV)
85.7
52.9
69.7
19.8
W(ps)
89.5
65.3
88.3
37.5
38
63
39.3
93
Eye Margin(mV)
26.3
10.4
17.9
Jitter Margin(ps)
24.1
12
22.8
Jitter(ps)
(d) De-emphasis=-6dB, Preshoot=3.5dB
(e) De-emphasis=-3.5dB, Preshoot=3.5dB

Fig. 4 Eye diagram according to the de-emphasis and
preshoot
(a) De-emphasis=-6dB, Preshoot=0dB
(b) De-emphasis=-4.5dB, Preshoot=0dB
We can determine the signal integrity of the receiver

signal depending on the combination of the level of the
transmitter buffer preshoot and de-emphasis level and
the results in table III and Figure 4. As shown in the
results of the signal integrity, the simulation case 1, 2
and 4 pass the test mask but case 3 and 5 are not pass
the mask.
The PCIe Gen3 host channel can be set as follows
through the signal integrity analysis. First, it is possible
to obtain the best results if the signal at the transmitter
buffer set -6dB de-emphasis level. Second, the use of
the transmitter buffer preshoot function preferably does
not necessarily because of the loss of signal integrity.
In other words it is possible to obtain optimal result if
- 549 -
ICEIC 2015
transmitter buffer set -6dB de-emphasis and 0dB
preshoot level.
4. Conclusion
This paper deal with high speed signal integrity
analysis in PCIe Gen3 system. We describe the
procedure how to extract channel topology from target
system and how to get parameter to signal integrity
simulation especially. Then optimum length of the
channel and transmitter buffer setup has been described
through eye-diagram simulation. We calibrate the
transmitter buffer level of de-emphasis and preshoot
parameters then can find best combination from eyediagram simulation at transmitter buffer. In this paper
we only deal with host interface signal integrity
analysis but we will perform QSFP + interface and
loopback interface in next study.
Acknowledgment
MSIP/IITP. [2014044075002, Low-power and Highdensity Micro Server System Development for Cloud
Infrastructure]
References
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
PCI Express base specification revision 3.0, Nov. 10,

2010
PCI Express 3.0 Frequently asked question, PCI-SIG
Jason Boh, Signal Integrity Simulation of PCI Express
Gen2 Channel, XrossTalk Magazine, Jan. 2009.
Dilini Warnakulasuriyarachchi, Design and simulation
of a PCI express gen3.0 communication channel,
Massachusetts Institute of technology, May. 2010.
Express Lane PEX 8725-BA/CA 24-Lane, 10-Port PCI
Express gen3 multi-root switch with DMA data book
v1.1, June 2012.
PEX 87xx consolidated SERDES transceiver & package
HSPICE model user guide, PLX technology, Inc. 2011.
Intel Xeon Processor E5-1600, E5-2600, and E5-4600
product families HSPICE signal integrity model user
guide for PCI Express and DMI2 interfaces, Intel, Inc.
2012.
DesignerSI, SIwave, HFSS user document, ANSYS, Inc.
2011.
- 550 -
P3-02
Development of Recommendation System for Leisure Kayak Model Design

Jong-Dae Park, Joong-Duk Oh, Chan-Hong Park, Byeong-Ho Park, Hyeon-Kyeong Seong
School of Computer, Information, and Communication Engineering, Sangji University
joongduk@sangji.ac.kr, orient3690@sangji.ac.kr, pchnaya1@sangji.ac.kr,
eden200@sangji.ac.kr, hkseong@sangji.ac.kr
Abstract
Recently, demand for water leisure sports gradually
increases according to the change of given social
circumstance and the change of customer needs due to
the increase of free time and the increase of the
national income all over the world.. Therefore, in this
paper, we designed a kayak for water leisure by using
the collaborative filtering technique in order to make it
possible to actively cope with the change of increasing
customer needs for various hull designs. In the
collaborative filtering technique, Pearson correlation
coefficient was used in order to calculate user's
similarity weight. Besides, an analysis was made
according to the elements such as hull, body, and
propulsion system of kayak in order to select emotional
words according to the kayak design reflecting user's
preference. Besides, a kayak model in the aspect of
customer preference was presented through factor
analysis.
emotions were drawn out by factor analysis and

assessment, and a kayak design in terms of the
customer emotional preference was recommended.
Also, preferences were provided on the basis of the
data entered by the users in order to reflect their
preferences, from which the correlations between the
users were calculated, and accordingly the user group
with similar preferences formed. Finally, collaborative
filtering [2] was used to consolidate these preferences.
2. Design of a kayak for the water leisure

using collaborative filtering
2.1 Planning of the design of a the water leisure kayak
1. Introduction
A kayak design recommender system was designed

on the basis of the user preferences. For the
recommender system, the usage of a kayak and the
arrangement pattern of kayak components were
determined and then a kayak for the leisure activity
was selected. The model building process of the kayak
design recommender system in this study is shown in
Figure 1. A kayak hull model that a user wants can be
recommended through the correlation analysis of the
user data extracted from the aforementioned steps.
Recently, as the interest in the water leisure

increases, that in the water leisure equipment also
increases and with the increasing desire to express
individual personality and emotions, it has become
necessary to develop the equipment that satisfy various
demands of consumers [1]. Therefore, in this paper, a
kayak design recommender system for the water
leisure has been designed using collaborative filtering.
For the design of the kayak design recommender
system for the water leisure, the interaction that
situation-based emotions, patterns and inclinations are
analyzed and linked to design elements is needed. For
this purpose, the emotions associated with the kayak
design were selected through previous studies,
literature and consumer survey, from which preferred
Fig. 1. Kayak design recommendation system model

establishment process
Keywords: Kayak, Leisure Sports, Recommender

Systems, Collaborative Filtering, Similarity Weight
- 551 -
ICEIC 2015
2.2 Collection of the emotional factors of the kayak

design
2.4 A kayak design recommender system to which

the user preferences are applied
To collect the emotional design elements for the

kayak design recommender system, methods to extract
relevant words from the existing literature and to
collect words that kayak developers and designers use
were employed [3]. In order to select pairs of
adjectives expressing emotions, a total of 20 words for
emotions were selected, and a web survey was
conducted on water sport clubs, water leisure and sport
tourists, and students in relevant academic departments
at universities to determine the user words for
emotions. Words for emotions used in the survey are
shown in figure 2. For the emotional assessment of
users, words for emotions with respect to the kayak
design were randomly selected and arranged.
The kayak design recommender system proposed in

this study recommends a kayak hull deign through the
prediction after the calculation of correlations between
users using collaborative filtering. A user can log in the
system and enter his/her own selected emotional
orientation, and when data input is completed, a kayak
design recommendation is made through collaborative
filtering as shown in Figure 4. A group with similar
emotional orientation is formed and analyzed through
collaborative filtering of the preference data entered by
users, leading to the recommendation of the color list
of the hull, and the shape and pattern of a kayak. With
respect to the color of the kayak hull, a preferred color
is recommended by the kayak design recommender
system based on the user-entered preference data, and
then the user can select a color using the color slide of
the system.
Fig. 2. Emotional words applied to the kayak design

2.3 Prediction of the kayak design preferences
Collaborative filtering is a technique that
recommends an item considered to attract the interest
according to the preference of a user group containing
users with similar preferences. Figure 3 shows a
system chart of the recommendation process of a kayak
design. For the extraction of a recommended design
that users prefer, the number of similar users was
limited in order to address the complexity of the
calculation in extracting similar users and at the same,
to improve the accuracy of recommendation.
(a) case 1
(b) case 2
Fig. 4. Recommendation system for kayak design
G
Fig. 3. Recommended design selection through
collaborative filtering
- 552 -
ICEIC 2015
3. Evaluation and analysis

For the evaluation of the performance of the user
decision-making recommender system for the design
of a leisure kayak, mean absolute error (MAE) was
used [4]. MAE is a mean of absolute values of the
differences between the user-evaluated values and
predicted values in order to measure the accuracy of
the prediction. MAE allows to identify how accurately
an algorithm has made a prediction, which is presented
as the equation 1.
N
u ,d
M =
i =0
Pu ,d
(1)
In the above equation 1,

is the predicted
preference of a user u for a design d, and
is the
actual preference for the design that the user has
evaluated. N is the number of designs that have been
evaluated. With MAE, when the error between the
actual and predicted preferences is minimized, it can be
stated that the accuracy of the predicted value is high.
The system proposed in this study was evaluated
experimentally by increasing the number of users as
shown below. The number of users on the x-axis
represents users that have been evaluated, and the yaxis corresponds to MAE calculated from the equation
1. Figure 5 shows the MAE performance evaluation
according to the number of users.
users increases, it can be seen that MAE for each case

is steadily decreasing. Particularly, it was shown that
the accuracy in the case 3 was high, and on average,
the accuracy of prediction in the case 3 with increasing
number of users was approximately 1.62% and 15.5%
higher than those in the cases 1 and 2, respectively.
4. Conclusion
In this paper, a kayak for the water leisure was
designed using collaborative filtering in order to satisfy
changing demands of kayakers for the kayak design. A
kayak design recommender system was proposed for
the design of a kayak based on the preferences of users.
For the evaluation of the performance of the proposed
system, various recommendation methods were
comparatively analyzed through MAE in terms of the
accuracy, which showed that the prediction accuracy of
the proposed case 3 was the highest in the entire
sections. The system proposed in this study can
recommend the design according to the analysis of
various emotions of users, and subsequently provide an
optimal design prediction. Therefore, it is considered
that this system can be of extended use for the
development of differentiated IT convergence products
not only in the area of various equipment for the water
leisure but also in many of other areas.
Acknowledgment
This study is supported by the grant from the
National Sports Promotional Funds of the National
Sports Promotion Foundation on the basis of the
project Development of Multi-Functional Small
Portable Boats and IT Convergence Life Jackets Based
on Sport Science by the Ministry of Culture, Sports
and Tourism in 2013.
References
Fig. 5. MAE Performance Evaluation

In the case 1, pure collaborative filtering was applied
to the user evaluation data. In the case 2, collaborative
filtering in which the evaluation was performed with
filtered user evaluation values was used. In the case 3,
filtered user evaluation values underwent collaborative
filtering using real-time data depending on the user
situations. As shown in the figure, as the number of
[1] Y. S. Park, and S. I. Lee, "A Study on the Profits Return

Ways for Promoting of the Marine and Water Sports in
Korea", Korean Society of Marine Environment & Safety,
Vol. 19, No. 1, pp. 93-99, 2013.
[2] Q. Liu, E. Chen, H. Xiong, and C. H. Q. Ding,
"Enhancing Collaborative Filtering by User Interest
Expansion via Personalized Ranking", IEEE Transactions on
Systems, Man, and Cybernetics, Part B: Cybernetics, Vol. 42
Issue 1, pp. 218-233, 2012.
[3] J. H. Jung, and J. W. Kim, "Collaborative Filtering
Techniques Using Social Network Analysis for UCC
Recommendation", Korean Institute of Information
Technology, Vol. 11, No, 1, pp. 185-195, 2013.
[4] L. Mendo, "Estimation of a Probability with Guaranteed
Normalized Mean Absolute Error", IEEE Communications
Letters, Vol. 13, Issue 11, pp. 817-819, 2009.
- 553 -
P3-03
A Performance Study of
Asymmetric Octa-Core Digital Signal Processor Architectures
Jongbok Lee
Dept. of Information & Communications Engineering,
Hansung University, jblee@hansung.ac.kr
Abstract
In order to effectively exploit the multi-core
processor architecture, asymmetric type is known to
bring better performance than the symmetric one. This
paper compares the performance of the two octa-core
digital signal processors of which one is asymmetric
and the other symmetric. As the experimental result,
the asymmetric octa-core digital signal processor
achieves higher performance than the symmetric one.
and simple RISC-style cores. Each core has a L1

instruction cache and a L1 data cache. The L2 cache is
shared among the cores, which is connected to the main
memory. For the cache coherency of the L1 data cache,
Keywords: digital signal processor, asymmetric octacore processor.
1. Introduction
Since the programmable digital signal processing
system has become very important recently, its
performance can be increased by adopting multi-core
processor
architecture. Asymmetric multi-core
processors are known to have higher performance and
better efficiency then the symmetric ones.
In this paper, the performance of an asymmetric octacore digital signal processor has been studied and
compared with the symmetric one by developing the
trace-driven multi-core digital signal simulator using
UTDSP digital signal processor benchmark programs
as input [1].
2. The Asymmetric Multi-core Digital

Signal Processor Architecture and the
Simulator
Figure 1 shows the asymmetric multi-core digital signal
processor with N cores. It consists of a complex out-oforder core which can process multiple threads per cycle
MESI protocol is utilized.

Fig. 1: The asymmetric multi-core digital signal
processor architecture
. The multi-core simulation is performed by two stages.
The first stage is the generation of the instruction traces
of the input benchmark programs. The thread-level
parallelism is mapped onto each core. At the second
stage, the multi-core digital signal processor is tracedriven simulated by fetching the generated instruction
traces. Timestamp method is used for the management
of intra-core and inter-core data dependencies as well
as memory dependencies, while simulating the program.
Figure 2 depicts how the simulator works. Initialize
function intializes all the associated variables, and
Grouping, CreateWindow, and FetchOneInstr function
fetches new instructions every cycle. The instruction
fetched by GetNode function is renamed at Rename
function by receiving timestamps. After the instruction
is renamed, it is inserted into the instruction window by
Insert function. At the Issue function, the instruction in
- 554 -
ICEIC 2015
the window can be retired so long as the corresponding
functional unit is available and its timestamp is less
than or equal to the current cycles timestamp. For the
multi-core simulation, Grouping function fills an
instruction into n-cores, and Issue function deletes
instructions according to their timestamps. This process
is repeated until all the fetched instructions are deleted
so that all the instruction windows are empty. Then, the
cores are filled again with instructions by Grouping
function. Since the cycle is incremented for each
process, the core which spends the longest cycles
determines the global cycle. If the total number of
executed instruction is divided by the number of the
global cycles spent, the performance can be obtained.
Initialize
Grouping(1)
Grouping(N)
Create_Window(1)
Fetch_One_Instr(1)
Get_Node(1)
Create_Window(N)
Fetch_One_Instr(N)
Get_Node(N)
Rename(1)
Rename(N)
Insert(1)
Insert(N)
Issue(1)
Figure 3 presents the simulation results of running nine
UTDSP programs on the two octa-core digital signal
processors. The asymmetric octa-core digital signal
processor consists of an out-of-order core and seven
RISC cores. On the contrary, the symmetric octa-core
digital signal processor has eight identical cores which
can process only one thread per each core. For the fair
comparison, they are selected to have a similar
hardware budget. As the result, the geometric mean of
the symmetric octa-core digital signal processor results
in 2.5 IPC, where as that of the asymmetric one brings
3.6 IPC. It can be seen that the asymmetric architecture
achieves 1.4 times higher performance than the
symmetric architecture.
Issue(N)
Mem_Process(1)
Mark_Node(1)
Mem_Process(N)
Mark_Node(N)
Delete_Node(1)
Delete_Node(N)
Analysis
Fig. 2: The flow chart of the multi-core DSP

simulator
3. Simulation Environments
The UTDSP digital signal processor benchmark
programs used for the experiment are compress, edge
detect, FFT, FIR, histogram, IIR, lpc, multiplication,
and spectral estimation. These are used as input for the
multi-core digital signal processor. SimpleScalar is
utilized for generating 100 million instruction traces,
and the thread-level parallelism is mapped onto each
core [2].
The number of simulated DSP cores are eight. For
the complex core, each thread consists of eight
instructions in maximum and up to three threads can be
fetched, decoded, executed, and written back per cycle.
Whereas for the RISC-style, only one instruction is
processed per cycle. The L1 instruction cache and L1
data cache is 64 KB, and it is designed as 2-way set
associative. Tasks are predicted using the Two-level
Adaptive Task Prediction scheme, and the task address
cache has the size of 2048 entries.
Fig. 3: The performance comparison results of the

octa-core digital signal processors
5. Conclusions
In this paper, the performance of an asymmetric octacore digital signal processor has been studied by
developing a trace-driven multi-core digital signal
processor simulator with UTDSP program. The
asymmetric architecture shows better performance over
the symmetric one. For the future research, we will
study on the asymmetric multi-core digital signal
processor architectures with a various number and the
different types of core.
References
[1]http://www.eecg.toronto.edu/~corinna/DSP/infrastructure/
UTDSP.html
[2] T. Austin, E. Larson, and D. Ernest, "SimpleScalar : An

Infrastructure for Computer System Modeling," Computer,
vol. 35, no. 2, pp. 59-67, Feb. 2002.
- 555 -
P3-04
A Practical Video Fragment Identification Approach

Xun Jin1, Jongweon Kim2
Dept. of Copyright Protection, 2Dept. of Content Copyright
Sangmyung University, Seoul, Korea
jinxun@smu.ac.kr, jwkim@smu.ac.kr (Corresponding author)
1
Abstract
2. Video format identification
In this paper, we propose a method of video fragment

identification for video contents. To identify a video
fragment, we must decompress it according to its format
first. Therefore, we classify the format features by using
optimized discriminative subspace clustering (ODiSC)
in advance. The K-nearest neighbor (KNN) algorithm is
used to identify the format of a fragment. Then fragment
recovery procedure is implemented by adding a
maximum similar header (MSH) in front of the fragment
to recover the video content. The key frame is detected
by measuring mean value and standard deviation. The
video feature is composed of edges of several frames.
Motion vectors are used to classify the video features for
effectively matching the features.
Keywords: Video Identification, Subspace Clustering,
Fragment Recovery, Motion Vector.
Recently, most of researches in format feature

extraction are statistical approaches, such as Shannon
entropy, N-gram analysis and byte frequency
distribution [2]. All of the video formats involve high
compression method and entropy coding, thus those
features are not suitable for distinguishing the formats
of video fragments. Therefore, we use the
synchronization pattern (SP) which is a hybrid approach
combines both structural and statistical features together
as the format feature. The SP is classified by ODiSC
which is derived from discriminative subspace
clustering [3]. To optimize the classification results, we
use a position based evolutionary algorithm to correct
the classification errors. After extracting a SP from a
fragment, it is identified by performing KNN with
classified features.
1. Introduction
3. Video fragment recovery
With the rapid growth of multimedia transmission

and evolution of network technology, video distribution
has become much more popular and easier than ever. In
the meantime, numerous problems about video
identification have been caused recently, such as
privacy invasion, copyright infringement or computer
forensic. For instance, movie files or private video files
are split into several fragments to be distributed through
the Bittorrent. Because of the high capacity of video
frames, it is inefficient to identify the entire frames of a
video file. Hence, identifying a few of frames is a more
desirable solution. However, researchers have been
presented various approaches of video identification
under a hypothesis that the videos were decompressed
correctly [1]. In practical terms, we have to decompress
the video fragment according to its format first.
Therefore, we introduce the format identification and
fragment recovery methods. Then we propose the video
identification method.
A video fragment is randomly split from a video file,

which means it loses many video data, especially
metadata. Because of losing the metadata, many video
fragments failed to be decompressed. To increase the
probability of recovery, we add a MSH in front of the
fragment.
Many kinds of video file headers are collected from
video samples which have various property of
parameters, such as frame width, frame height, bit rate,
frame rate, etc. Each type of parameter has various
values. We select the value which has the maximum
probability of occurrence in its parameter. The headers
which have that value are moved to the front of the
header group. Which means, the headers are rearranged
according to the descending order of the probability of
value occurrence. According to the identified format of
fragment, we search the corresponding group for the
MSH by decompressing the added fragment.
- 556 -
ICEIC 2015
4. Video identification
Table 1: Precisions of the format identification
Due to the huge amount of frames in a video file,

generally, the video features are extracted from the key
frames. We use a simple and fast scene change detection
method to select key frames with the mean value and
standard deviation. Several kinds of video features can
be extracted from video data, such as histogram, edge,
object or color layout. In this paper, the video feature is
the accumulated Canny edges [4] of several frames. To
identify the features efficiently, we classify the features
by using the motion vectors.
First, each color frame is converted to a grayscale
frame and the mean value and standard deviation of the
converted frame are calculated. If both of them are
greater than threshold values, the frame is defined as a
key frame. Then we resize the grayscale frame to
128 128 . The motion estimation used in this
approach is the adaptive rood pattern search algorithm.
The cost function is mean absolute difference which is
the most popular and less computationally expensive
method. We define a macro block size as 32 32, thus
there are 16 macro blocks in a resized frame. We define
each motion vector of a macro block as a node and
construct a classification tree with 16 levels. The frames
used in the motion estimation are th key frame and the
frame before the + 1th key frame.
The video feature is constructed as follows. First, we
extract the Canny edges from resized grayscale frames.
Then those of the th key frame to the next frames
are accumulated to obtain AE. We calculate three
threshold values from the normalized AE using Otsus
method. Then we define the threshold values as
quantization levels and quantize the normalized AE.
Finally, the quantized features are sent to the
corresponding nodes.
The format identification experiments were
concentrated on three video formats: AVI, MP4 and
RMVB. The samples used for classifying were
randomly selected from 150 video files and 50 nonvideo files such as EXE, PDF and ZIP without header
or footer. The samples used for identifying were
randomly selected from other 100 video files and 30
non-video files. The Table 1 shows the precisions of the
format identification results. The Table 2 shows the
probabilities of fragment recovery of AVI and RMVB
with multiple fragments. The precisions of video
identification are shown in Table 3 with different size of
fragment. The total duration of this experimental videos
is about 20 hours and the size of the video features is
about 50MB.
Length
512KB
256KB
128KB
AVI
98.75%
97.5%
96.25%
MP4
95.24%
92.86%
90.48%
RMVB
90.24%
87.8%
76.83%
Non-video
96.83%
96.04%
96%
Table 2: Probabilities of recovery

Number of fragments
AVI
RMVB
1
90%
78%
2
92.5%
82%
3
94%
89%
Table 3: Precisions of video identification

Length
Precision
4MB
64%
5MB
69%
6MB
80%
7MB
84%
8MB
92%
6. Conclusion
In this paper, we propose an approach of video
fragment identification in practical terms. This approach
is composed of format identification, fragment recovery
and video identification. The experimental results show
the precision of format identification remain above 90%
with the size of 512 KB, those of video identification is
about 90% with the size of 8MB and the probability of
recovery of AVI is about 90%.
7. Acknowledgments
This research project was supported by the Ministry
of Culture, Sports and Tourism (MCST) and the Korea
Copyright Commission in 2014.
References
[1] J. Su, Y. Huang, H. Yeh and V. Tseng, Effective contentbased video retrieval using pattern-indexing and matching
techniques, Expert Systems with Applications, Elsevier Ltd,
pp. 5068-5085, 2010.
[2] S. Fitzgerald, G. Mathews, C. Morris and O. Zhulyn,
Using NLP techniques for file fragment classification,
Digital Investigation, Elsevier Ltd, pp. 44-49, 2012.
[3] V. Zografos, L. Ellisy and R. Mester, Discriminative
Subspace Clustering, Computer Vision and Pattern
Recognition, IEEE, pp. 2107-2114, 2013.
[4] H. Chen, S. Tsai, G. Schroth, D. Chen, R. Grzeszczuk and
B. Girod, Robust Test Detection in Natural Images with
Edge-Enhanced Maximally Stable Extremal Regions, Image
Processing (ICIP), IEEE, pp. 2609-2612, Sept 2011.
- 557 -
P3-05
Outlier Detection in Wireless Sensor Networks Using Trend Pattern

Kwangsoo Kim1, Marie Kim1, Seong-Il Jin2,*
1
Electronics and Telecommunication Research Institute
2
Chungnam National University
{enoch,mariekim}@etri.re.kr, sijin@cnu.ac.kr (Corresponding Author)
Abstract
A diverse set of applications using Wireless Sensor
Networks have been implemented in over the past
decade years. It is important to detect data outliers to
increase the reliability of a system using the networks.
This paper proposes a novel method to detect
abnormal sensing values. The method uses the fact that
sensing values generated in a factory or a building are
repeated daily according to its operation. We use the
trend of sensing values. This method detects the
outliers whose values are changed slightly.
collecting the indoor temperature of a factory and the

other collecting the temperature in molten metal
generate very different sensing values although they are
close to each other as well as sense the same sensing
type. On the other hands, temporal methods also
consider a sensing value which is significantly different
from others in the history data generated at one sensor
node. However, this method cannot detect outliers
whose values are slightly changed. Figure 1 shows this
kind of outliers which are not discussed in previous
works. The range of indoor temperature for one day
shown in Figure 1 is between 25 and 122 .
Keywords: outlier, sensor network, trend.
1. Introduction
Recently, Internet of Thing (IoT) is one of the most
interesting fields. In the IoT world, things around the
environment in which we live exchange actively their
data with others. Thus, they become both a data
provider and a data consumer simultaneously. The two
important functions in the IoT are sensing and lowpower communication. They are included in a sensor
node. A lot of sensor nodes are located at our living
places (e.g., offices) or things (e.g., manufacturer
machinery). In office they collect the environmental
data such as temperature, humidity, etc.; in machine
they collect the number of items produced, operating
speed, etc. However, they can generate wrong data due
to their malfunction. Therefore, it is very important to
detect abnormal data in order to increase the reliability
of a system which uses the sensor nodes.
Outlier detections have been studied extensively in
spatial and temporal methods [1]. Spatial methods
assume that all sensor nodes within a group generate
similar values. The methods determine a value which is
significantly different from others in a group as an
outlier. However, this assumption cannot be applied for
a factory and a building. For example, one sensor
Figure 1. Temperature data including outliers

which change slightly
In this paper, we propose a novel outlier detection
method which uses a trend from the history data
generated at one sensor node. This approach can detect
outliers whose values are slightly changed as well as
can be applied to the cases which the spatial methods
fail to detect. We have two assumptions. One is that
sensing values generated in an office or a factory have
a daily pattern according to its business hours. The
other is that sensor nodes work well at the beginning as
they are passed the quality test and the nodes might be
failed after a certain amount of time has elapsed.
2. Trend Detection
In this section, we introduce a trend detection
method that is used to detect the outliers. The term
- 558 -
ICEIC 2015
trend describes that a data sequence has a specified
direction and a trend is classified as upward,
downward, or no change according to the changing
pattern of the data sequence. An upward trend indicates
that the data sequence is increasing in a specified time
period, whereas a downward trend indicates that it is
decreasing during the time period. No change indicates
that there is little change in the data sequence. We use
the Mann-Kendall test as a trend detector. The MannKendall test [2] is a non-parametric test to detect a
trend in a time series of data that is ordered in time. It
is based on a statistical parameter S. Each value of the
data sequence is compared to others that occur after it
in the data sequence. The statistical parameter S is
defined as
S ( X ) in11 nj i 1 sign( x j xi )
(1)
where X is the data sequence that is the target of trend

detection, n is the number of values in the data
sequence, and xi and xj are values of data points. The
sign function is defined as
1, if x j xi 0
sign( x j xi ) 0, if x j xi 0
1, if x j xi 0
(2)
The sign of S indicates the direction of the trend. A

positive S indicates an upward trend, a negative S
indicates a downward trend, and a value of zero
indicates that the data sequence does not change. The
total comparison of Mann-Kendall test is equal to
n 1
k 1 k , where n is the number of values in the data
sequence.
To detect outliers, we calculate the correlation value
between the trend pattern which has been generated
today and that which was generated yesterday.
Figure 3 indicates the moving window. The moving

window considers that most of the sensing values are
normal data. However, the proposed method considers
most of the sensing values are outliers. From the figure,
we can clearly see that the proposed method detects
most of outliers.
Figure 2. Outlier detection results
4. Conclusion
This study provides an initial basis for practitioners
to select a suitable outlier detection method based on a
trend extracted from a sequence of sensing data that are
generated in a building or a factory. In this paper, the
outliers whose values change slighted. This kind of
outliers are not detected by previous methods. We
compare our scheme to a conventional method that
uses temporal data change to detect outliers. An
experimental evaluation on real data sets shows that
our approach detects most of the outliers that the
conventional method fails to detect. By detecting the
outliers, we can improve the reliability of a system
using sensing values.
Acknowledgment
This work was supported by the ICT R&D Program of
MSIP [Project No. I0114-14-1016, Development of
Smart Factory Platform for Small and Medium sized
Manufacturing Enterprises] and the Creative Vitamin
Project.
References
To show the practical significance of our approach,

we performed experimental evaluations of the proposed
method. We apply the proposed method to the data
shown in Figure 1 which represented the indoor
temperature generated at the mote number 1 installed in
in the Intel Berkeley Research lab [3]. We can clearly
see in Figure 1 that the indoor temperatures have
increased continuously. The temperatures above 40
may be outliers.
We compare the number of outliers detected by the
proposed method with that of the moving window. The
comparison result is shown in Figure 2. MW in
[1] K. Ni, N. Ramanathan, M. N. H. Chehade, L. Balzano, S.

Nair, S. Zhedi, E. Kohler, G. Pottie, M. Hansen, and M.
Srivastava, Sensor Network Data Fault Types, ACM
Transactions on Sensor Networks, Vol.5, No.3, Article 25,
May 2009.
[2] T. Partal and E. Kahya, Trend analysis in Trukish
precipitation data, Hydrological Processes, 2006, Vol. 20,
pp.2011-2026.
[3] http://db.csail.mit.edu/labdata/labdata.html
- 559 -
P3-06
KVM-Based Virtual Machine Cache using I/O Access Pattern

Taehoon Kim, Jaechun No*
College of electronics and information engineering
Sejong University
hont2005@naver.com, jano@sejong.ac.kr
Abstract
We present a VM cache mechanism that has been
developed to deliver high I/O performance while
alleviating the communication cost between the shared
storage and the host server. The VM cache analyzes
the user I/O access pattern and accumulates the
execution history information to determine the effective
cache capacity. The performance result using
postmark benchmark shows that VM cache can achieve
30% of I/O bandwidth improvement.
Keywords: VM cache, user I/O access pattern.
When user logs in to a VM at the first time, all

directories and files that user has accessed are
automatically mounted from the shared storage using
NFS and are listed on the cache UI. The second
component is the file I/O watcher. It monitors and
analyzes user I/O access pattern on VMs, while
predicting the next I/O behavior using the application
execution history information.
The third component is the replacement module that
determines the effective VM cache capacity by
integrating with the real-time monitoring information.
The monitoring information is collected from VM and
the host server, using /proc and libvirt.
1. Introduction
As the technology of cloud computing is rapidly
improving, VDI (Virtual Desktop Infrastructure)[1-4]
is receiving the great attention from IT markets, due to
its advantages such as software management and
resource utilization. However, one of the shortcomings
of VDI is the communication cost between the shared
storage where operating system images and application
data are stored and the host server.
In this paper, we present a VM cache that has been
combined with a light-weight, real-time monitoring
module. The primary objective of our VM cache is to
determine the effective virtual cache size, based on the
analysis of user I/O access pattern and the
accumulation of application execution history
information. Also, by combining with the real-time
monitoring module, our VM cache can effectively
determine the virtual cache size on the host server.
We evaluated VM cache using postmark benchmark

[5]. Fig.1 shows I/O bandwidth while varying file sizes
from 4KB to 1MB. The x-axis represents the ratio of
not cached to cached. For example, (100:0) implies the
entire files to be produced during transactions are all
brought from the shared storage. In the figure, as the
percentage of files being accessed from VM cache
becomes high, better I/O bandwidth is produced.
2. VM Cache Implementation
Fig. 1. Postmark I/O bandwidth
VM cache is composed of three components. First,

cache UI lists files having been accessed by VM users
and being prefetched at VM mount.
4. Conclusion
*Jaechun No is the corresponding author.
- 560 -
ICEIC 2015
In this paper, we present a VM cache, which is
integrated with the real-time monitoring module.
Although VDI has several advantages such as software
management and user data protection, its
communication cost between the shared storage and the
host server can significantly degrade I/O bandwidth on
VM. We tried to alleviate this overhead by adapting
VM cache mechanism. The performance evaluation
shows that the effective VM cache can not only
improve I/O bandwidth but also increase resource
utilization by effectively managing the limited
resources to be allocated to VMs.
Acknowledgment
This work was supported by the Industrial
Convergence Strategic Technology Development
Program, Grants no. 10045299, funded by the Ministry
of Science, ICT and Future Planning, Korea 2013. Also,
this work was supported by the MSIP(Ministry of
Science, ICT & Future Planning), Korea, under
the Establishing IT Research Infrastructure Projects
supervised by the NIPA(National IT Industry
Promotion Agency)(I2221-14-1012).
References
[1] P. Barham, B. Dragovic, K. Fraser, S. Hand, T. Harris, A.
Ho, R. Neugebauer, I. Pratt, A. Warfield, Xen and the art of
virtualization, ACM SIGOPS Operating Systems Review,
Vol. 37, No. 5, pp.164-177, 2003.
[2] G. Wallace, F. Douglis, H. Qian, P. Shilane, S. Smaldone,
M. Chamness, W, Hsu, Characteristics of backup workloads
in production systems, Proc. of 10th USENIX Conference
on File and Storage Technologies (FAST12), San Jose, USA,
2012.
[3] C. Tang, FVD: a High-Performance Virtual Machine
Image Format for Cloud, Proc. of the 2011 USENIX
annual Technical Conference, Berkeley, USA, 2011.
[4] R. Spruit, VDI Smackdown, White paper, v. 1.4, Aug.
2012.
[5] J. Katcher, PostMark: A New File System Benchmark,
Technical
report
3022,
available
at
http://www.netapp.com/technology/level3.
- 561 -
P3-07
NeoESPA - A New Evaluation System for Programming Assignments

Xiao Liu, Yeoneo Kim, Hwan-Gue Cho, Gyun Woo
Department of Electrical and Computer Engineering Pusan National University, Busan, Korea
{liuxiao,yeoneo,hgcho,woogyun}@pusan.ac.kr
several new tools for helping course assistors and
educators to manage their courses conveniently.
Abstract
Managing computer programming assignments and
evaluating submitted programs is an important role for
educators in computer science. This paper introduces
neoESPA, an automatic source code evaluation system
for programming assignments. The neoESPA supports
the overall procedure for evaluating source codes
submitted by students. It also provides the functionality
of detecting code plagiarism among source codes. This
ability contributes a fair scoring for student codes.
Keywords: source code assignment management,
source code plagiarism
1. Introduction
There are lots of important things should be noticed
during teaching a programming course such as
distributing handouts, posting announcements, etc.
Most of these works can be performed using web
technologies, but the most important and time
consuming work is to check programming assignments
and to rate scores to the submitted programs,
meanwhile detecting whether there exist code
plagiarisms among the source codes or not. It could be
a quite hard work to check all the code assignments and
measure each of their run time, not to mention checking
the outputs of code assignments are correct and
detecting code plagiarisms which are more difficult [1].
There are several similar systems [2-3] that can
evaluate a program code as services, one of them
named ESPA. Our purpose is to optimize ESPA to a
more powerful and useful system.
ESPA is an abbreviation of Evaluation System for
Programming Assignment [2]. It is a web service that is
working on evaluating program code and rating score
automatically and also can manage scores of each
student who submitted code files on ESPA and detect
code plagiarisms. The purposes of this paper are to
develop a new version of ESPA with full of functions
which old version of ESPA has, in addition, to build
2. Development Process
Since the ESPA system is running on the Internet,
neoESPA will still support services as a Web service,
Users can access the system through Web browsers
after log-in. And system administrator can manage all
the databases such like students information,
assignment files, and standard output results files. Also
administrators are able to upload handouts, post
announcements, answer questions which asked by
students. The results of plagiarism detection will also
can be checked on Web pages. In addition, neoESPA
provides several tools to help teaching assistors or
professors managing their courses such like calculating
scores for the whole semester at the end of the semester
for each of the students, and sorting their scores to
make it easily to give them composite scores.
Figure 1: System architecture
2.1. Introduction to Template and Layout

The main views of neoESPA are based on the Ink
Interface Kit. Ink is an open source interface template
and available under the MIT license [4]. It uses a
combination of HTML, CSS, and JavaScript to offer
modern solutions for building layouts, display common
interface elements. NeoESPAs back-end runs on a
Linux server and mainly written by PHP, to create web
pages script programs at the back-end will print Ink
HTML source codes to front-end for browsers to
analyze.
- 562 -
ICEIC 2015
Responsive web design (RWD) is a web design
approach responds to the needs of the users and
devices theyre using [5]. RWD is a common technique
in Web site design recently, the neoESPA is also
designed for satisfying multiple platform to access such
as iPad, PC, smart-phone, etc.
2.2. Posting Assignments

The assignment management system of old version of
ESPA seems like not stable and has several problems at
security. It stored assignment introduction files and
request details in a folder with ESPA system files
together, it could be a huge problem when someone
who isnt administrator but got permission can access
this folder. In neoESPA, the assignment details are
stored on a mysql server which only can be modified
by administrator with an independent password and it
will be denied when someone wants to access the
mysql server from external IP addresses, these features
can protect important files such as assignment details
away from someone who tries to access the mysql
server illegally.
2.3. Submitting Programs

For implementing real-time compiling source code
files after submitting code files, neoESPA has a script
program written by PHP to execute the system
commands to call the compilers which are installed in
the server system. PHP provides a function named
exec() to execute system commands. After users
upload source code files and select filename extension
by browsers, the script program starts running on the
server side, getting the extension and calling a
corresponding compiler to compile source code files.
Until writing this paper, the files which neoESPA is
capable to compile include .py, .c, .cpp, and .java.
Meanwhile by getting the homework number which
is user has posted from the browser, the script program
reads the corresponding input-file of homework from
database to execute compiler with input-file and
compare the output with standard output file. After
comparing output the script program will save the
result on database and post to browser. NeoESPA also
supports several new functions related with code file
management and source code compiling such as its
more perspicuity file structure and is able to process
multiple code files at a same time. NeoESPA also
could print out the compile error messages to web
pages when there are errors caught during compiling.
After all of the students submitted their codes or passed
deadline of submitting assignment, the plagiarism
detecting function will start scanning all code files to
figure out whether there is plagiarism exited. If there is
plagiarism exited among codes, both of suspicious
codes will be marked and their rated scores will be

restored as 0.
3. Comparison
By comparing with ESPA and Web-cat Table 1
illustrated the differences and advantages of neoESPA.
Table 1: Difference among similarly systems
ESPA Web-cat neoESPA
supported languages
4
4
4
plagiarism detection
O
X
O
data storage strategy
file
DB
DB
All of them are functionally similar but the first two
both have some disadvantages such like ESPA does not
use database which is less secure at Web security and
since Web-cat dose not has plagiarism detection, itll
not be very suitable for course management.
4. Conclusion
Overall, the neoESPA will provide a set of
comprehensive services including course management,
code assignments rating & compiling, code plagiarism
detection, semester grades calculation, etc. It will be a
very capable, useful and stable Web service system to
help teaching assistors and professors to manage their
programming classes and help students to write code in
a more standard way.
Acknowledgment
This work was supported by BK21PLUS, Creative
Human Resource Development Program for IT
Convergence.
References
[1] B. Cheang, A. Kurnia, A. Lim, and W. Oon, On
automated grading of programming assignments in

an academic institution, Computers & Education,
Vol. 41, No. 2, pp. 121131, 2003.
[2] J. Ji, S. Park, G. Woo, and H. Cho, Source code
management system for e-learning based
programming education, in Proceedings on
Digital Information Management, (ICDIM07),
pp. 362367, 2007.
[3] S. H. Edwards and M. A. Perez-Quinones, Webcat:
automatically
grading
programming
assignments, in ACM SIGCSE Bulletin, Vol. 40,
No. 3, ACM, pp. 328328, 2008.
[4] Sapo, create responsive web interfaces quick and
efficiently, http://ink.sapo.pt.
[5] E. Marcotte, Responsive web design, Editions
Eyrollers, 2011.
- 563 -
P3-08
A Roofline Model of Consumer Preference in Embedded systems

Abstract
This research suggests an efficient guideline for
consumers or architecture engineers regarding the
type of mobile embedded system that is appropriate for
consumers. Many mobile companies frequently release
new smart phones with high performance CPUs,
GPUs, memory, and other IPs. However, hardware
performance has already exceed the specificationsdesired or needed by the common consumers, so in
response, we provide an insightful hardware
performance guideline using a roofline model.
Keywords: roofline model, consumer preference,
embedded systems
call to their family, listening to their favorite music,

and searching for some information. In such cases,
neither a high performance smart phone nor complex
applications are needed. If architecture engineers
understand that specific groups frequently used
applications then they can easily find a balance
between performance and power. In this paper, we use
the roofline model to propose a CPU, power
characteristics, and frequently used android application
intensity for an embedded system. Using this model,
we suggest a guideline for determining the best system
for a specific consumer.
2. The Roofline Model
1. Introduction
The performance of recent smart phones has
increased as fast as that of desktop PCs to serve
consumers who want to operate highly complex
applications. As proof, many mobile companies have
released new smart phones with state-of-the-art APs
(Application Processor), consisting of a multi-core, a
high performance GPU, and many dedicated IPs.
However, mobile companies still continue to make new
high performance APs and advertise new products
based on these new APs.
Consequently, the consumer believes the new
product is much better than the previous one. However,
even the newest of mobile embedded systems continue
to suffer from battery problems as well as power
consumption problems due to high performance loads
and complex system behavior. To solve this problem,
many architectural engineers have studied DVFS
algorithms and big.LITTLE technology [1].
Nevertheless, finding a balance between performance
and power in limited battery conditions is a very
difficult problem. Therefore, we ask the question,
Why does the common consumer need to use a high
performance system? Some people already use
systems of sufficient performance to support their
normal applications. Indeed, many older men and some
women just use simple applications for making a phone
The roofline model, which evaluates multicore

performance, presents an insightful guideline to
programmers and architecture engineer [2]. The X-axis
represents the operation intensity and the Y-axis shows
the attainable performance in GFlops/s. Operation
intensity is measured in Flops/Byte, which means the
number of FP operations performed per byte of
memory traffic transferred. Traffic is between cache
and memory, not between processor and cache. The
attainable performance of a program is bounded by the
peak Flop rate, the bandwidth, and the flop/byte ratio.
The following equation determines peak Flop rate.
Gflops/ s = min{
PeakGflop / s
PeakMemoryBW * flop / byte
(1)
3. Proposed Method
The operation intensity and attainable performance
of the peak and slope are evaluated by a microbenchmark program. In conventional research,
performance is calculated just by using a hardware
manual or using a small benchmark program like as
SPEC. However, we focus on the real-application of
android, frequently used by consumers, and capture the
PMU (Performance Monitoring Unit) register [3] in the
embedded system. In order to select the most
frequently used applications, we assume the following.
A 20 to 30-year-old man prefers Web browsing
application.
- 564 -
ICEIC 2015
A 20 to 30-year-old woman wants to talk friends
using an SNS application and listen to her favorite
music.
A 40 to 60-years-old man prefers to make a phone
call.
Figure 2: Application intensity with roofline model
Figure 1: Experimental Environment

We operate the application to estimate the voltage
and current of a real system, we do not use theoretical
parameters. To measure the voltage and current, we use
an Analog-to-Digital Converter with a hardware circuit.
To avoid input saturation, we use the following Rshunt
equation.
100
(2)
= 3.2 VDD
Rshunt (max)
Power (max)
We performed an experiment on two, real target
boards with the Android OS. Figure 1 presents the
overall experiment environment. All the results are
averages of the measured data. Never-used applications
and drivers were uninstalled to remove experimental
system variables. Figure 2 shows the roofline of realapplication intensity. System #2s peak performance is
lower than system #1s performance because of the
shortage of cores. MP3 and phone call applications
showed lower performance than the others applications,
which means these applications required lower CPU
utilization and memory space, In this case, a 40 to 60year-old man would be satisfied with using system #2
or a system with lower performance. Interestingly a
WEB application exists between the peak points of
system #1 and system #2; in this case, system #1 would
be suitable to operate a WEB application more
smoothly, so a 20 to 30-year-old man should use
system #1.
Figure 3 shows the average power parameter of each
application between systems. As we expected,
applications that have more operations requires more
power. When a woman uses system #2, they can save
power by about 10%. If consumers or architecture
engineers can understand the most frequently used
applications, then they can save battery power by
purchasing or designing an appropriate product.
Figure 3: Application with Power consumption
5. Conclusions
We proposed a consumer preference based systems
by using the insightful roofline model. We assumed
that some consumers are using over-specified devices
that do not match their-application needs. The most
frequently used real-applications and their power
parameters were evaluated. We verified some
applications already have a sufficiently powerful
environment. Through this method, we hope to provide
architecture engineers with more flexibility in their
design of APs or other IPs for reduction of power
consumption.
Acknowledgement
MOE(NRF-2010-0020210)
References
[1] J. Goodacre, The homogeneity of architecture in a
heterogeneous world, International Conference on
Embedded Computer Systems, 2012
[2] S. Williams, A. Waterman, and D. Patterson. Roofline:
an insightful visual performance model for multicore
architectures, Commun. ACM, 52(4):65-76, 2009
[3] A. Gutierrez, R. Dreslinski, T. Wenisch, T. Mudge, A.
Saidi, C. Emmons, and N. Paver. Full-system analysis and
characterization of interactive smartphone applications, In
Proceedings of IISWC'11, 2011.
- 565 -
P3-09
An FPGA-based String Matching using Automatic HDL Code Generation

1
HyunJin Kim, 2Kang-Il Choi

1
School of Electronics and Electrical Eng., Dankook University,Yongin-si, Rep. of Korea,
2
Advanced Communications Research Lab., ETRI, Daejeon, Rep. of Korea.
1
hyunjin2.kim@gmail.com
Abstract
This paper proposes a field-programmable gate
array (FPGA)-based string matching engine that is
implemented using the high-level hardware description
language (HDL) code generation. The generated HDL
code is compiled by the commercial electronic design
automation (EDA) tool. Therefore, target patterns can
be configured into any FPGA device. In the
implementation, each target pattern is compared with
input data, respectively. The registers are inserted in
the combinational path. Because logic optimization is
performed by the commercial tool, the implementation
flexibility of the proposed scheme can be increased.
respectively. In order to generate the matching index

for the longest matched pattern, the priority encoder is
provided, where the pipelined structure is constructed
with the register insertion. The main advantage of the
proposed string matching engine is the fact that the
logic optimization can be provided by the vendors tool,
which increase the flexibility of the realistic
implementation.
2. Proposed FPGA-based string matching

Start
Keywords: FPGA, HDL, and string matching.
1. Introduction
The string matching engine is an essential device to
analyze data in many application fields such as network
security, computer vision, bioinformatics, etc. In the
string matching engine, if input data is matched with
target patterns, the matching indexes are outputted. To
increase the performance, the hardware-based string
matching engine can be preferred. Especially, due to
the updatability of target patterns, the FPGA-based
string matching can be adopted.
Several previous works were developed with block
memories in the FPGA device [1-2]. However, the
logic elements were not used efficiently. Other
previous works such as [3] were related to the lowlevel string matching architecture, which cannot use the
flexibility of the FPGA device sufficiently.
This paper adopts automatic register transfer level
(RTL) HDL code generation of the string matching
engine. Because the generated HDL code is compiled
by vendors EDA tool, the proposed string matching
can be applied to any FPGA device. In the generated
module, each target pattern is compared with input data,
No
Priority
Construction
Patterns
HDL Code
Generation
Pipelined Cycles
FPGA Compilation
Hardware
Specification
Spec. Met?
Yes
End
Fig. 1 Proposed implementation process.

Figure 1 shows the process of implementation of the
FPGA-based string matching engine. As shown in Fig.
1, a set of patterns are analyzed and several actions are
performed in the priority construction; firstly, duplicate
patterns are removed in order to make the unique set of
target patterns. Then, according to the pattern length,
the priority encoding table is constructed, where the
longest pattern has the highest priority. In the HDL
code generation, the Verilog HDL code is generated
with the information of the unique set and priority
- 566 -
ICEIC 2015
encoding table. In order to insert registers among the
long delay path, the option of the number of pipelined
cycles is provided. In the FPGA compilation, the
information of target device and optimization goal is
chosen in the compilation tool. If the compilation
results meet the specification, the configuration data is
obtained; otherwise, the HDL code generation should
be renewed to meet the specification. If the obtained
area is larger than that of one FPGA device, two or
more than two FPGA devices are adopted. In this case,
by dividing a set of target patterns into subsets,
modules for multiple FPGA devices are obtained.
Input Data
Shift Register
Pattern Comparators
Pipelined Registers
Priority Encoder
Matching Index of Longest
Matched Pattern
Fig. 2 Block description of a generated module.

Figure 2 shows the block description of a generated
module. Input data are provided into a shift register in
each cycle, where the number of registers is the same
as the longest pattern. Then, the parallel data from the
shifter register are compared in the parallel
comparators. When a pattern is matched, non-zero
pattern matching index is provided. If a pattern is the
suffix of other patterns, multiple non-zero pattern
matching indexes can be generated. In this case, the
priority encoder outputs only the matching index of the
longest matched pattern. In this case, because the long
combinational path degrades the maximum operating
frequency, pipelined registers can be inserted. For
example, as shown in Fig. 2, registers are inserted
between pattern comparators and priority encoder,
which can be written in the generated HDL code.
The generated HDL code was compiled by Alteras
Quartus II, where target device was Stratix IV
EP4SGX230KF40C2. In the experiments, four rule sets
from the Snort were adopted. Table 1 shows the
experimental data, where the number between round
brackets is the number of patterns in a rule.
Table 1 Experimental data with Snort rule sets

rule
Flow Elapsed
Time (mm:ss)
Logic
Utilization
Combinational
ALUTs
Dedicated
logic registers
Fmax (MHz)
backdoor
(955)
chat
(49)
deleted
(615)
spyware
(2299)
4:55
1:43
4:43
22:40
6%
<1%
4%
12%
8,008
498
5,734
16,300
1,718
360
1,204
3,064
123.03
404.37
177.18
62.24
Considering flow elapsed time, the compilation time

was acceptable for the updatability of large rule set. In
addition, the combinational logic was critical in the
logic utilization. Considering the logic utilization and
the number of patterns, the target device was suitable
for any rule sets. From Fmaxs for rule sets, it was
concluded that when the number of patterns was small,
the hardware complexity was decreased.
Even though the operating frequency in a module
was not satisfied, if hardware modules were
implemented in parallel, the throughput can be
enhanced. Considering the implementation process and
experimental data, it is concluded that the proposed
scheme can provide the FPGA-based string matching
with high updatability and flexibility in the
implementation process.
Acknowledgement
This work was partly supported by the ICT R\&D
program of MSIP/IITP, Republic of Korea. [14-00005-001, Smart Networking Core Technology
Development] and Basic Science Research Program
(NRF) funded by the Ministry of Education. (NRF2014R1A1A2A16055699).
References
[1] L. Tan, B. Brotherton, and T. Sherwood, Bit-Split
String-Matching Engines for Intrusion Detection and
Prevention, ACM Trans. Architecture and Code
Optimization, vol. 3, no. 1, pp. 3-34, 2006.
[2] H. Kim, H.-S. Kim, and S. Kang, A Memory-Efficient
Bit-Split Parallel String Matching using Pattern Dividing for
Intrusion Detection Systems, IEEE Trans. Parallel and
Distributed Systems, vol. 22, no. 11, pp.1904- 1911, 2011.
[3] I. Sourdis and D. Pnevmatikatos, Fast, Large-Scale
String Match for a 10Gbps FPGA-based Network Intrusion
Detection system, Field Programmable Logic and
Application, Lecture Notes in Computer Science, vol. 2778,
pp. 880-889, 2003.
- 567 -
P3-10
3DSHU&DOFXODWRUXVLQJ'HSWK,QIRUPDWLRQE\D.LQHFW

-DHKR/LP 6XQJ:RRQJ6KLQ -RQJ:RQ3DUN
(OHFWURQLFVDQG7HOHFRPPXQLFDWLRQV5HVHDUFK,QVWLWXWH(75,
&KXQJ1DP1DWLRQDO8QLYHUVLW\&18
MKOLP#HWULUHNUVVKLQ#HWULUHNUMZSDUN#FQXDFNU

$EVWUDFW

+HUHLQ ZH GHVFULEHW KHS DSHUF DOFXODWRUXV LQJ
GHSWKLQIRUPDWLRQE\D0LFUR VRIW.LQHFWDQGDNH\SDG
SDWWHUQ SULQWHGS DSHUZLWKR XW LQSXWGHYLFHV7K LV
FDOFXODWRUXVHVWKHFRORULPDJHE\D5 *%VHQVRUDQG
WKHG HSWKP DS E\ DGH SWKV HQVRU7K H FRORUL PDJHL V
SURFHVVHGE\ LPDJH SURFHVVLQJDO JRULWKPVDQ GW KHQ
WKH NH\SDGS DWWHUQLVH[WUD FWHGLQ W KHU HVXOW7K H
FKDQJHRIGHSWKYDOXHVRINH\SDGEXWWRQVSRVLWLRQVFDQ
WHOOXV Z KDWW KHEX WWRQL V SXVKHG 7KH UHVXOWV RI WKLV
UHVHDUFKLQGLFDWHGWKDWWKHSURSRVHGFDOFXODWRUZRUNV
ZHOO,W D OVRV KRZVW KDWR EMHFWVPR WLRQL QDQ LPDJH
FDQLVEDVHGRQWKHFKDQJHRIGHSWKYDOXHVRQDGHSWK
PDS

.H\ZRUGVGHSWKPDS.LQHFWFDOFXODWRUQRQFRQWDFW
LQWHUIDFHLPDJHSURFHVVLQJ

LQ'HSWK6WUHDPQRLVH7KHNH\SDGSDWWHUQSULQWHGRQD
SDSHULVVLPLODUWRLWR ID FRPSXWHUNH\ERDUG7KHVL]H
RIWKHNH\SDGLVZLGWKRIFHQWLPHWHUVE\KHLJKWRI
FHQWLPHWHUVWK HJDS E HWZHHQWKHE XWWRQVR IWK H
NH\SDGLVFHQWLPHWHUV7KH.LQHFWLVORFDWHGDERYH
GHJUHHVDQGWKHGLVWDQFHEHWZHHQWKH.LQHFWDQGWKH
NH\SDGLVFHQWLPHWHUV
,QWURGXFWLRQ

5HFHQWO\QR QFRQWDFW LQWHUIDFHV DUHX VHGWR FR QWURO
D V\VWHP DV SURFHVVLQJL PDJHVY LDD FDPHUD LQP DQ\
VPDUWGH YLFHVFHOOSKRQHVW DEOHWV7 9VR U VRPHWKLQJ
>@%XWLQ W KHVHFDVHV LQWHUIDFHV DUH SRRU DW
UHFRJQLWLRQ UDWHV EHFDXVHWK HUHDU HUHI OHFWLRQ
VFDWWHULQJDQ GLQ WHUIHUHQFHR I OLJKW LQ WKHLU
HQYLURQPHQW7KHU HIRUHLIDG
GLWLRQDOO\ GHSWK
LQIRUPDWLRQLVXVHGWKHSHUIRUPDQFHRILQWHUIDFHVZLOO
EH LPSURYHG> @,Q WKLVSDS HUZH ZLOOLP SOHPHQW WKH
SDSHUFDOFXODWRUDQGFRQILUPWKLVDVVXPSWLRQ
([SHULPHQW6HWWLQJV

0LFURVRIW.LQHFWLVXVHGWRWDNH5*%FR ORULPDJHV
DQGGHSWKLQIRUPDWLRQ>@7KH.LQHFWLV FRQWUROOHGE\
2SHQ1,R SHQVRXUFHG ULYHUG HYHORSHG LQ 3ULPH6HQVH
2SHQ1,L VFRP SDWLEOHZLWK RWKHU GHSWKFDP HUDV$VXV
;WLRQRUVRPHWKLQJDQGPRUHUREXVWWKDQ.LQHFW6'.
)LJXUH7KHEORFNGLDJUDPRISDSHUFDOFXODWRU
V\VWHP
,PDJH3URFHVVLQJ

)LUVW RIDOOZHQ HHG WRLQ LWLDOL]H WKH .LQHFW GHYLFH
XVLQJ2SHQ1,WRJDWKHUVHQVRUGDWD7KHFRORULPDJHLV
WDNHQE\WKH5*%VHQVRUDQGGHSWKYDOXHVDUHJDWKHUHG
E\ WKHG HSWKV HQVRU7 KHQW HPSODWHP DWFKLQJL V
SHUIRUPHGWRU HGXFHW KHUHJ LRQ RI LQWHUHVW >@ 7KH
WDUJHW RIW KHP DWFKLQJL V WKHNH\S DGS DWWHUQR QWK H
SDSHU2QWKHRWKHUKDQGWKHFRORULPDJHLVFRQYHUWHG
WR JUD\VFDOH 7KHQWK H FRQYHUWHGJ UD\VFDOHLP DJHL V
ELQDUL]HGEDVHGRQWKUHVKROG:HFDQILQGDQGVDYH
- 568 -
ICEIC 2015
WKH FHQWHU SRLQWR IHDFK EXWWRQXV LQJ ODEHOLQJ

DOJRULWKPR QW KHE LQDU\LP DJH: H DVVXPH WKDW WKH
PLGSRLQW RIW KHG LDJRQDOOLQ HRI DE ORELVWKHFHQ WHU
SRLQWRIDEXWWRQ
)LJXUH,QSXW5*%'HSWKLPDJHDQGUHVXOW

GLVSOD\

&RQFOXVLRQ
)LJXUH7KHSURFHGXUHRILPDJHSURFHVVLQJ
-XGJHPHQWIRU3XVK(YHQWV

7KH GHSWK YDOXHVR IHDFK EXWWRQDU HU HSHDWHGO\
VDYHGIR UWK UHHVHFR QGV7K HP HDQVR IV DYHGY DOXHV
EHFRPHWKH VWDQGDUGG HSWKY DOXHV ,QS UDFWLFHW KH
GHSWKYDOXHRIWKHSXVKHGEXWWRQZKHQDILQJHUSXVKD
EXWWRQLVOHVVWK DQW KHVWDQ GDUGG HSWK7K HU HDVRQ LV
WKDWWKHGLVWDQFHEHWZHHQWKH.LQ HFWGHSWKVHQVRU DQG
WKHR EMHFWLVDV FO RVHUDV WKH WKLFNQHVV RI WKH ILQJHU
7KXVL IW KHGH SWKYD OXHD VW KLFNQHVVRI WKH ILQJHU LV
SHUIHFWO\ FRUUHFWW KHUHDUHQ RHU URUV, QWKLV SDSHU WKH
GHSWK YDOXH LVEH WZHHQ DQG $VD UH VXOWL WL V
MXGJHGWKDWWKHEXWWRQLVSXVKHGZKHQWKHGHSWKYDOXH
NHHSVDV VPDOOHU DV a WKDQW KHVWDQG DUGI RU
VHFRQGV,IWKHHYHQWRFFXUVWKHQXPEHURURSHUDWRURI
SXVKHGE XWWRQ LVGL VSOD\HGRQ RX UP RQLWRUD QGW KH
SDSHUFDOFXODWRULVZRUNLQJ

([SHULPHQWVDQG5HVXOWV

:HLP SOHPHQWHG WKHSU RSRVHG PHWKRGDQG
SHUIRUPHGP DQ\H [SHULPHQWVL QG LYHUVH OLJKW
HQYLURQPHQWV $VDUHVX OWZHFR XOGFR QILUPW KDWW KH
SDSHU FDOFXODWRULVZRU NLQJ %XWWK HUHZHUHHU URUV LQ
WKHU DQJHR IDE RXW SHU FHQW7K HUHDVR QVDUHWKDW
VDPHE XWWRQZD VF RQWLQXRXVO\SXV KHGR U WKH EDFN RI
WKHKDQGZDVUHFRJQL]HGDVDILQJHU
,QWKLVSDSHUZHSURSRVHGWKHSDSHUFDOFXODWRUXVLQJ
D .LQHFWDQG N H\SDG SDSHUDQG S UDFWLFDOO\
LPSOHPHQWHG,WGLGQWQHHGDFRQWDFWLQWHUIDFHDQGZDV
UREXVWLQFKDQJHRIOLJKWHQYLURQPHQW%XWLWDOVR KDG
HUURUVWKDWVDPHEXWWRQZDVFOLFNHGRUWKHEDFN RIWKH
KDQG ZDV UHFRJQL]HG,I WKHVH HUURUVDUH LPSURYHGLQ
WKHIXWXUHZRUNLWZLOOEHDEOHWRKHOSGHYHORSHDV\DQG
FRQYHQLHQWQRQFRQWDFWLQWHUIDFHV

$FNQRZOHGJHPHQWV

7KLVZRUNZDVVXSSRUWHGE\WKH,&75 'SURJUDP
RI0 6,3,,73> ' HYHORSPHQW RI WDFWLOH
LQIRUPDWLRQV WRULQJD QG SOD\LQJ SODWIRUP EDVHG RQ
IOH[LEOHVHQVRUVIRULPPHUVLEOHPHGLD@

5HIHUHQFHV

>@$H N\XQJ.D QJ- LQPR. LP 6XQJZRQ 0XQ DQG
+\XQJMH&KR ,P DJH3UR FHVVLQJEDVHG ,QWHUIDFH IRU
&RQWUROR I ,QWHUDFWLYH'&RQ WHQWV3U RFHHGLQJVR I
WKH.RUHD0XOWLPHGLD6RFLHW\&RQIHUHQFHSS
0D\

>@6+ DQ- & KRL DQG -, 3DUN 7ZRKDQGEDVHG
LQWHUDFWLRQ PHWKRG XVLQJDK \EULGFDP HUD 3URFR I
,3,8

>@KWWSZZZPLFURVRIWFRPHQXVNLQHFWIRUZLQGRZV

>@ *21=$/(=5DI DHO&'
LJLWDO ,PDJH
3URFHVVLQJUGHG3UHQWLFH+DOO-DQXDU\
- 569 -
P3-11
The Development of Mobile Telepresence based on

Distributed Telepresence
Seunghan Choi, Kim Do-Young, Kim Yeong-Jin
ETRI
SmartWork Research Team, Wired&Wireless Convergence Research Department
Daejeon, Korea
e-mail : {shchoi, dyk, yjkim}@etri.re.kr
Abstract This paper propose the study of Mobile Telepresence

service based on Distributed Telepresence. The distributed
telepresence architecture has the advantage of supporting largescale telepresence services and is proper to the environment of a
variety of services, and a variable number of mobile devices
compared to hardware-based centralized telepresence. ETRI
Distributed Telepresence is proper solution to cloud-based
telepresence service.
Keywords- Smartwork, Telepresence, MCU, Distributed, Mobile
I.
(b)
INTRODUCTION
Figure 1. MCU-based Centralized Telepresence Architecture
In this paper, S/W-based ETRI Distributed Telepresence

system is the solution that can solve all the problems that the
existing hardware-based centralized telepresence system[1][2].
It has the capability that media traffic(video/audio, etc.) is
distributed by DP(Distributed media Processor). As a result, it
supports large-scale network for telepresence. Also, It is
proper to the environment of a variety of services, and a
variable number of mobile devices compared to hardwarebased centralized telepresence. Nowadays, Cloud-based service
is deployed in all various service. The scalability is one of the
important elements for cloud-based service. In other words,
ETRI Distributed Telepresence is proper solution to cloudbased telepresence service.
In existing H/W MCU-based centralized telepresence

system(Fig. 2), all participants send the video and audio
packets to MCU(Multipoint Controller Unit). And then, MCU
decodes, mixes and re-encoding incoming video and audio
packets. Problems of MCU-based centralized telepresence
system are as follows:
z Increase in delay : If there are to perform
simultaneously multiple encoding / decoding
(transcoding) multipoint video signals, the delay due to
increased user experience (UX: User Experience)
adversely affects to users.
z Increase in internet traffic : Video traffic of all
participants is concentrated in to the MCU, so, the
internet traffic increases. Increased internet traffic
affects the loss and loss of video traffic. As a result, this
can affect the scalability problems.
II.
THE DESIGN OF DISTRIBUTED TELEPRESENCE

ARCHITECUTRE INCLUDING MOBILE SERVICE
z Increase of investment costs : MCU model,

configuration, depending on the per-port cost from $ 10
to $ 1k. It can be applied in a limited number of sites,
but the cost of thousands of sites are difficult to apply.
z Operating costs : the cost of hardware maintenance
costs, and power consumption is expensive.
z Time to deploy : new installation or additional
expansion ports to apply the system takes a few weeks
time. soS there is not proper to varying service coverage
(a)
- 570 -
ICEIC 2015
required, or the number of sites in the environment of

mobile terminal to change a lot of time applying service
Figure 4. The SIP procedure for joining in the conference in the environmnet
of mobile service interworking
Fig 5. represents the SIP[3] procedure for joining in the

conference in the environment of mobile service interworking
Figure 2. ETRI Distributed Telepresence Architecture

(a) Mobile Gateway
S/W-based ETRI Distributed Telepresence system is the

solution that can solve all the problems listed above that the
existing hardware-based centralized telepresence system. ETRI
Distributed Telepresence system consists of Distributed
Telepresence Platform Manager, MC (Multipoint Controller),
and several DP (Distributed media Processor). Manager
operates the meeting management capabilities. Media
controller(MC) controls signaling packets of all telepresence
clients, and Distributed media processors(DP) relay entire
audio and video traffic of all telepresence clients. As a result, it
supports large-scale network for telepresence. The video and
audio traffic distributed by DP is reduced compared to the
centralized telepresence. Also, because ETRI Distributed
Telepresence system is implemented in software, Installation
and operating costs is reduced compared to hardware-based
centralized telepresence. It is proper to the environment of a
compared to hardware-based centralized telepresence.
(b) Mobile Telepresence

Figure 5. The Mobile Telepresence Prototype
Fig 6. represents the prototype of Mobile Telepresence

interworking with distributed telepresence system. (a)
represents the operation of mobile gateway that performs
mixing video/audio streams and transfers signaling. (b)
represents the conferencing using mobile telepresence. The
mobile telepresence application was developed based on
Android smatrphone Samsung GalaxyS3.
III.
Figure 3. The prototype of implmented ETRI distributed telepresence client
CONCLUSION
We propose the study of Mobile Telepresence service based

on Distributed Telepresence. The distributed telepresence
architecture has the advantage of supporting large-scale
telepresence services and is proper to the environment of a
compared to hardware-based centralized telepresence. ETRI
Distributed Telepresence is proper solution to cloud-based
telepresence service.
Fig 3. represents the prototype of implemented ETRI

distributed telepresence client.
ACKNOWLEDGMENT
MSIP/IITP. [11-921-05-001, Development of Immersive
Smart-work Core Technology for Collaboration among
Multiple Parties].
REFERENCES
[1]
[2]
[3]
- 571 -
Junchao Li, Weimin Lei, Journal of Networks, Vol.5, No.6, A

comparison of Multimedia Conferencing Frameworks, Jun.2010
M. Barnes, C. Boulton, and O. Levin, A Framework for Centralized
Conferencing, RFC 5239, IETF, June 2008.
J. Rosenberg, A Framework for Conferencing with the Session
Initiation Protocol (SIP), RFC 4353, IETF, Feb. 2006.
P3-12
An Innovative Diagnosis Mechanism for Rule Anomalies among Firewalls

Chi-Shih Chao
Feng Chia University, Taichung, 40725 Taiwan, ROC
cschao@fcu.edu.tw
Abstract
While configuring firewalls, firewall rule ordering
and distribution must be done very carefully on each of
cooperative firewalls. However, network operators are
prone to incorrectly configuring firewalls because
there are usually hundreds of thousands of filtering
rules (i.e., rules in the Access Control List file; or ACL
for short) which could be setup in a firewall, not
mention these rules among firewalls could affect
mutually. To speed up the crucial but laboring
inspection of rule configuration on firewalls, this
paper describes our developed diagnosis mechanism
which can speedily figure out anomalies among
firewall rules with a brand-new data structure
Adaptive RAR tree (or ARAR tree). With the aid of this
data structure and its associated algorithms,
significant improvement has been made in the field.
Keywords: Defense in depth, firewall rule anomalies,
ARAR tree, diagnosis re-use.
1. Introduction
Network firewalls and their associated filtering rules
should be discreetly deployed and configured for
cooperative, integrated, and in-depth network security
protection. Still, in a large and complex enterprise
network equipped with numbers of firewalls, it is very
likely for a network manager to make mistakes while
setting the firewall rules (i.e., ACL rules) since
maintaining the security consistency between
firewalls rule configuration and the demands of
network security policies is always time-consuming,
laboring, and error-prone.
The security inconsistency typically can be revealed
by either the occurrence of anomalies between the
firewall rules or demand-mismatching of network
security policies. E. Al-Shaer et al. formally define an
anomaly as a duplicate or multiple rule-matching for a
packet in a rule set. Based on the concept, they further
define several different intra-/inter-ACL anomalies
among the firewall rules [1]. Nevertheless, because a

Finite-State-Machine (or FSM)-based comparison
between each pair of rules should be conducted for
anomaly checking, their anomaly diagnosis will meet
an inefficiency when the number of rules or firewalls
gets large.
To lower the comparison times between firewall
rules needed in [1], Y. Yin et al. [2] segment the IP
address space formed by the source and destination
networks into blocks where each block is precisely cut
out by the IP addresses in the <conditional field> of
each firewall rule. Utilizing these varying-sized blocks,
a SIERRA tree is built and two conflict rules would be
hanged on the same branch. The network manager just
needs to do the anomaly inspections/checking on rules
in the same spatial block(s), instead of wasting time to
conduct a comprehensive pair-wise rule comparisons.
Yet, this approach would lead to a fatal drawback in a
networking environment with frequent rule updates. A
clean-slate reconstruction of the SIERRA tree is very
possibly unavoidable when a rule deletion or insertion
is performed. Once one rule changes, a change for the
whole spatial rule relationship would occur, and the
corresponding data structures could be reconstructed.
This drawback also means the local diagnosis results,
i.e., the intra-ACL rule diagnosis results, can hardly be
re-used for the diagnosis of inter-ACL rule anomalies.
In this paper, we introduce a brand-new data
structure ARAR tree and its associated methods
which are used to achieve feasible and efficient rule
anomaly diagnosis.
2. ARAR tree
In our work, the IP address ranges of the source
network domain and destination network domain of a
designated route are employed as two axes to form a
rectangle traffic plane. Referring to the coding tree
widely used in data/video compression, the traffic
plane will be split recursively as well as exponentially
if a block finds there are more than two rules within it
(Fig. 1), rather than being split into a matrix containing
- 572 -
ICEIC 2015
fixed-sized blocks as done in our previous work [3].

With the fields of <source_IP> and <destination_IP>,
the IP address space of each ACL filtering rule can be
represented as a smaller rectangle and drawn on some
proper place of this plane where the corresponding
location of each rule will be recorded in our ARAR
tree as shown Fig. 2.
To isolate the inter-ACL (or even inter-firewall) rule

anomalies, in our approach, it can easily be achieved
by simply re-using the ARAR trees built for the
diagnosis of intra-ACL (or intra-firewall) rule
anomalies. We can first do the intra-ACL anomaly
diagnosis for rules inside two designated firewalls
individually, which can lead to the construction of two
ARAR trees separately for the diagnosis of intra-ACL
rule anomalies. Later, to obtain the diagnosis of interfirewall rule anomalies between these two firewalls,
tree integration can be made by adjusting the tree
nodes
level/height and collecting the leave
belonging to the same branch of the two individual
ARAR trees and putting them together under the same
branch of a new ARAR tree for inter-ACL rule
anomaly diagnosis. And then, following the same logic
in our diagnosis for intra-ACL rule anomalies, the
pair-wise comparisons for the diagnosis of inter-ACL
rule anomalies would only be conducted for those rules
which are under the same branch of the integrated
ARAR tree for inter-ACL rule anomaly diagnosis.
4. Conclusion and future work

Fig. 1 Exponential splitting on a traffic plane
With the implementation of the ARAR tree, our

anomaly diagnosis mechanism for firewall rules meets
the planned requirements: Efficiency, expandability,
and feasibility. Our experimental results also show our
diagnosis is 10 times faster than that of [1]. By far, in
addition to the system migration to IPv6 networking
environment, we also want to add more novel
ingredients to complete our system, e.g., behavior
mismatching between two firewalls. At length, we
acknowledge the support of MOST, ROC, under
contract MOST-2221-E-035-100 for this work.
References
Fig. 2 The corresponding ARAR tree of Fig. 1
3. Diagnosis with ARAR tree

From Fig. 2, it can be found that there are nine
leaves, which
branches containing more than one
indicates merely the IP address spaces of those rules in
these branches intersect with one another and hence
incur intra-ACL rule anomalies. So, we simply have to
do the pair-wise rule comparisons for anomaly
checking on the rules at the same branch within these
nine branches. Comparing to [1], without the ARAR
tree, three times rule pair-wise comparisons are
required for anomaly checking.
[1] E. Al-Shaer, H. Hamed, R.Boutaba and M. Hasan,

Conflict Classification and Analysis of Distributed
Firewall Policies, IEEE Journal on Selected Areas in
Communications, Vol. 23, Issue 10, pp. 2069-2084, 2005.
[2] S. Thanasegaran, Y. Yin, Y. Tateiwa, Y. Katayama and
N. Takahashi, "Topological Approach to Detect
Conflicts in Firewall Policies," International Workshop
on Security in Systems and Networks, Proc. of 23rd IEEE
International Parallel and Distributed Processing
Symposium, SSN-1569173665-paper-3.pdf, 2009.
[3] Chi-Shih Chao, "A Novel and Feasible System for

Rule Anomaly and Behavior Mismatching
Diagnosis among Firewalls," Springer LNEE234,
2013-05.
- 573 -
P3-13
Distance Measurement to Specific Object by Extraction of Geometrical Feature

Change in the Zooming Images
Seung Ho Han*, Hiesik Kim*, Ki Doo Kim* and Jae Hong Joo*
* Dept. of Electrical and Computer Engineering, University of Seoul
shhan87@hotmail.com,drhskim@uos.ac.kr, uosjae@gmail.com
object and calculate pixel data from specific object.
1.
Introduction
Nowadays, when the army tries to measure the

distance to hit the exact target with heavy weapons in
military mission for striking long distance targets such as
a tank, they use some sensors such as infrared, laser
sensor. When this sensor measures distance, they use
time or value of energy loss while returning energy to
sensor such as infrared, laser. This method calculates
very accurate and reliable value.
In these devices by using optical or radio, there is a
risk of exposure to detection devices which is used
enemy. And these devices appear many inconvenient
points of the equipment, such as the size increases
because they are used with an image recording device
used in not only the sensor but also to measure the
distance. These facts can fail the mission in the wars. If
location of friendly forces is detected by enemys
equipment, enemy can kill ally and interrupt allys
mission.
In this paper, we propose a method which calculates
distance from recording equipment to specific object
based on pixel data from images without using energy
beam. Frist, we recognize specific object in images. And,
we calculate actual distance based on pixel data from
recognized object in images using proportional constant.
2.
Method
2.1
Algorithm overview
If we take a picture, it isnt shown three-dimension
such as space. It is shown two-dimension. However,
when we take a picture using video equipment, the
enlarged or reduced ratio is steadily increased or reduced
because the ratio of zoom lens of video equipment and
the size of the object in images is fixed. So, we can
calculate distance from equipment to object. First, we
calculate proportional constant based on distance and
scale from image that is taken a reference object. Second,
we calculate pixel data of object which you want to
know at different scale. And then, we can calculate actual
distance of object using calculated ratio from reference
Fig. 1 Flow chart for measuring specific object

2.2
Calculate ratio from reference object
First, we select reference object which is known actual
size. Second, we take a picture at different scale. And we
measure objects pixels in pictures.
Reference objects width is 20cm, distance from video
equipment to object sets 50cm, 100cm each experiment.
And zoom level sets 1-level, 3-level, 5-level.
Presenting Author, shhan87@hotmail.com
- 574 -
(a) zoom level 1
(b) zoom level 3
(c) zoom level 5
Fig. 2 Standard Object (50cm)

Table. 1 Pixel Data Based on Magnification (50cm)
Zoom level
Pixel(px)
369
486
675
ICEIC 2015
(a) zoom level 1
(b) zoom level 3
(c) zoom level 5
Fig. 3 Standard Object (100cm)
equipment to specific object on the image capture by

using the video image processing was suggested for field
application. This device and experiment result showed a
reliable field distance measurement. This new
technology measurement equipment can be widely useful
application in military operation in field.
Table. 2 Pixel Data Based on Magnification (100cm)

Zoom level
Pixel(px)
180
247
338
4.
Based on the pixel values calculated, to step

magnification if the value of the pixel of the shot at the
stage of 3 magnification, the pixel value when taken in
step 1 the scale of the reference object at a distance of
each There is variation in the pixel, is calculated as
follows when it is increased to 3 step 1.
Based on calculated pixel data, if we express that
value is pixel data of zoom level 1 and
data of zoom level 3,
calculate as :
value is pixel
, variation of pixel data, is
If this variation is same when zoom level increases 1

step, each steps variation of pixel data is square root :
This research was supported by the Korea Research

Foundation project, Improve the Accuracy of Glucose
Concentration
Measurement
Using
Raman
Spectroscopy Serial Number 2013R1A1A2063634.
References
(1) Matthias Jungel, Heinrich Mellmann, and Michael
Spranger,
Improving
Vison-Based
Distance
Measurements using Reference Object, HumboldtUniversitat zu Berlin, Kunstliche Intelligenz Unter den
Linden 6, 10099 Berlin, Germany
(2) Rupert Genseberger, Measuring distance by parallax
method, EAAE Summerschools Working Group
Centre for Science and Mathematics Education,
Utrecht University (The Netherlands)
By using this variation, we convert that 1cm distance

from video equipment to object :
2.3
Calculate distance from video equipment to object
If we get ratio using this rule through the adjustment
of the zoom level, we can calculate distance value by
using ratio. If we express that
is pixel data of
specific object from zoom level
and
is pixel
data of specific object from zoom level

, we can
calculate M, distance from video equipment to object :
3.
Acknowledgment
Conclusion
A measurement method to the distance from video
- 575 -
P3-14
Pharmaceutical Drug Management System Implementation based on EPCIS

Event Data
Beomjin Kim and Sunshin An
Korea University
bjkim@dsys.korea.ac.kr
Abstract
This paper proposes unit-level pharmaceutical drug
ID assignment rules for serialization and anticounterfeiting and management system architecture for
traceability.
Keywords: RFID system, RFID tag, GTIN, Electronic
Product Code, EPCIS (Electronic Product Code
Information Service), Serialization, Track & Trace.
1. Introduction
EPCIS is a flexible standard that have numerous
options for business needs in order to accommodate
different applications and environments. Nonetheless,
there still needs to be a certain level of consistency in
terms of how the standards are implemented by
individual trading partners in order to serve supply
chain issues like pedigree and track and trace. And
EPCIS does not provide that unique serial number
provisioning and item management method. We need
additional architecture design and implementation.
2. Pharmaceutical Industry Issues
RFID/Barcode interoperability, and GS1 provides

information to end users and solution providers that use
GS1 data carriers including barcodes and radio
frequency identification (RFID) tags, specifically, data
carriers that include serialized data [2]. The best
practice recommendations in this paper are derived
relevant GS1 Standards including the GS1 General
Specifications [9], the GS1 EPC tag data standard [5]
and EPC tag data translation standard in GS1 System
Architecture.
C. Track & Trace
In order to prevent counterfeit products from getting
into hospitals, pharmacies and patients, a national
requirement to traceability prescription drug packages
is coming down the pike.
D. Anti-Counterfeit
Anti-counterfeiting is a global problem. The
purpose of an anti-counterfeit feature is primarily to
enable the authentication of an item, by industry
investigators, or by wider public customer. The second
function may be to act as a deterrent to anyone
considering counterfeiting a product based on the
difficulty or cost involved set again.
3. Management System Implementation
A. Identity & Serialization

RFID system requires that all items have a unique
ID so that it can be identified or counted; so brand
owners are faced with the challenge of managing and
encoding unique serial numbers across their global
supply chains.
B. Interoperability
There is a new and valuable resource available for
anyone who needs to make use of both GS1 RFID and
GS1 barcodes on any product.
It is called
A. Unique Random Number Sequence Generation

All items must have unique ID for identity and
random ID for anti-counterfeiting. There are ways to
generate generating unique random sequence. FisherYates shuffle [7] is one of them. But Fisher-Yates
shuffle is not appropriate for large random number
such as SGTIN-96 code scheme (serial part: 38-bit)
following the encoding rules in the EPCglobal Tag
Data Standard [5] because we could begin with an
array containing all possible 32-bit integers that would
require 16 GB of memory.
- 576 -
ICEIC 2015
We propose another approaches based on quadratic
residue [8] and add seed assign method for multi
devices. When p is a prime number and p 3 mod 4,
the quadratic residues Qr(x) of integers x are all unique
and give us one-to-one permutation on the integers less
then p.
Qr(x) = x2 mod p
Qr(x) = p (x2 mod p)
(2x < p)
(else)
C. EPCIS-based Pharmaceutical Drug Management

Each party in the supply chain must capture and
share a certain set of EPCIS events [3]. The words,
Commission, Pack or Ship defined in core
business vocabulary [4], mean why the EPCIS event
is generated. The approach used is based on
identification of states and events in drug and mapping
these events to the EPCIS standard [3].
Traceability Module
Quadratic residue function is applied to SGTIN-96.

Commission
38 bits
( 0 ~ 274,877,906,943(10) )
Seed
Ship
Receive
Ship
EPCIS
EPCIS
EPCIS
...
...
...
Manufacturer
Wholesaler
Unique Pseudo-Random Number
7 bits
( 0 ~ 127(10) )
Commission
31 bits
( Representable range of integer x: 0 ~ 2,147,483,647(10)
Prime number p: 2,147,483,647(10) )
Pack
Ship
Receive
Unpack Pack
Retailer
(Pharmacy, Hospitals, ...)
Ship
Receive
Unpack
Dispense/
Destroy
Fig. 3: Traceability support system architecture
Fig. 1: Quadratic residue application to SGTIN-96
The maximum representable number of SGTIN-96

is 2147483647. Fortunately, 2147483647 is a prime
number. If 2147483647 is not a prime number, we can
choose another one, 2147483629, biggest but smaller
than 2147483647 and p 3 mod 4.
Seed is an ID that identifies all devices generating
serial number. In figure 1, maximum 128 devices (7
bits) can generate unique random number at the same
time.
B. RFID/Barcode Interoperability
Generated serial number of Pharmaceutical drug
item in Fig. 1 can be changed to GS1-128 barcode [9]
form that the length of serial number is 20 digits.
38 bits
( 0 ~ 274,877,906,943(10) )
Seed
Dispense/
Destroy
Receive
Each EPCIS have queries associated with schedules

can be registered. These scheduled queries send EPCIS
event data that only related to traceability.
Acknowledgment
Foundation of Korea(NRF) grant funded by Korea
government (No. NRF-2012K1A3A1A09026959).
References
[1]http://www.gs1us.org/DesktopModules/Bring2mind/DM
X/Download.aspx?Command=Core_Download&EntryId=25
9&PortalId=0&TabId=785
[2]http://www.gs1.org/sites/default/files/images/gsmp/kc/RF
IDBarcodeInterop-Guideline-i1-final-Publication.pdf
Unique Pseudo-Random Number
[3]http://www.gs1.org/gsmp/kc/epcglobal/epcis
12 digits
( Representable range: 0 ~ 999,999,999,999(10) )
( Usable range: 0 ~ 274,877,906,943(10) )
Unused
[4]http://www.gs1.org/gsmp/kc/epcglobal/cbv
[5]http://www.gs1.org/gsmp/kc/epcglobal/tds
Seed + Unique Pseudo-Random Number
[6]http://www.gs1.org/gsmp/kc/epcglobal/tdt
20 digits
( 0 ~ 99,999,999,999,999,999,999(10) )
[7]http://en.wikipedia.org/wiki/Fisher-Yates_shuffle
Fig. 2: RFID/Barcode serial number interoperability
[8]http://en.wikipedia.org/wiki/Quadratic_residue
All 38 bits in SGTIN-96 convert to 12 digits in

barcode.
[9]http://www.gs1.org/docs/gsmp/barcodes/GS1_General_S
pecifications.pdf
- 577 -
P3-15

!!

"

# $

%

% %
&#

!

!"

"#
!

!"!"

$!!
"&!#%

$
!!

($')
!"!! !"!!

!"!!

#
*" " $$

" $$

!"!!"
)

$ " "
$ "!"
!!
"$
'+
!

&
,

-%
#

!$! " "
$ .

!
( "

"
! )"
!
!

$ (

#
%
!! "
"
!
! $ /!
0
/!! (0#
1"
("
!!
! $ !" !
!
"
2
!($

3
$
$!
!
! !

2!(
$$""

!45#
1"
$ $
$ !

!($(

#
6
"
(

$ !
!
$

#
1" $
($
(
" "" 3

!"

"
"
" !

"# 1" 3

"
($"

$.

)#
6
$ " $$!
$
"( "

,%-
$$
$!
!#
"# $ !
$$

1"
"
(.!

!"
"!" " " $

!
( !!
"

"# 1" "
"
"!

"(#1"

$ $
$
""
"!
!#6$"
"
)
$
$
"!

"
!(475#
1"!"

"

"!!

#1" ""

" " # 1"
" "
!
(" 3
$( ( (
"
(.!
(.! "

"485#
9 "
: % 4& 5 , ;7< =
&;7<- "
& 4>5 "
("$""
:"&"#
1"$"
" $(

($"$
$"
:#
*
""
($:"
,;7<>- : ( " " 3

(
"
' ,;7<>-
>
"
2 "
! (

$ " ("

# 6
"
- 578 -
ICEIC 2015
"
!$"
$!
:
!
(: 4 2 7 2 > 2 5 #
1 $
: ( !

(

" ( !
( " "

!
$ " !

!# 1"

( !
(
"$
$!'

,-
( @( ( 7 ( ? #

A "
$!
: $ " "
( $'
,7-
( )4$ 7 $ 8 $ B $ 5
(

9 %

# 1"
!
$ 3

3

# 1" !"

:! (
,-#
,-%
C"&,;7<=&;7<-"
("$""
:$ (
"&"
#1" "
:$
( !
((
$
$$

$!
:#
9 "
: % 4& 5 "

,!-K
,-L
9 #%

$""
!$
$'

*

&
&
,8-
)# !
&
" 2
#
1"
"$""
!$

$'
*
#

,B-

*
,(-K

*$ "

: % 4& 5
"
" ! (
" !"

$ " !
!
(

" ""!

"
"
$

!
"
( (
" "
"!
$ ('

,D-
& %

" EF " "
"#
1" $
! $ " 3
!
(
(
( "
!

(
"
! !! (
%3
,G-# 1"
! ! (

!$
';4>#H>#I<>#>5

,G-

,J-
&' #

6
"
(

$!
!
$

!"

"# 1"
"
" " " !(

$ " !"

"

"!

"#
*+N&C%M%N1
1" (
! $
6
+ 1!"
M

$
("
$16

%

,&16%-
%

45+"

6
A
. ,+ -
.

.
-
L 7>>#
475#A# O##
P#K#A

L#P#"E&
"
!
$!
:"(

""3
F%

!
!

Q#8BN#7#GD GJ
7>>H#
485 K9 "
C
C

#N#
"
E*$ ))!"

"
!

("$

!
F6

$
%

!
!
1!"
Q#7N#D#
H7 HH7>>#
- 579 -
P3-16
Stacked Piezo-Energy Harvesters by the Tape Casting Process

Dong-Jin Shin1, Jung-Hyuk Koh1*
1
School of Electrical and Electronics Engineering, Chung-Ang University, Seoul, Korea
jhkoh@cau.ac.kr
Abstract
In this paper, multi-layer piezoelectric energy
harvesters based on the PZT ceramic actuators will be
presented. The piezoelectric energy harvesters can be
used as the power sources in sensors and microsystems.
Multi-layer piezoelectric energy harvesters were
fabricated by Pb(Zr,Ti)O3 based ceramic actuators.
Pb(Zr,Ti)O3 ceramic powders were prepared by using
the
conventional
ceramic
powder
process.
Subsequently, PZT ceramic actuators were prepared
by using the tape-casting process which process used
in the production of thick film ceramic from ceramic
slurry. PZT ceramic actuators were attached on the
metallic bottom electrode with poled states. Symmetric
upper electrodes were attached on the other side. The
structures were filled with Polydi-methylsiloxane
(PDMS). Consequently, the piezoelectric energy
harvesters were manufactured with single-layer,
double-layer and triple-layer devices, respectively.
Multi-layer piezoelectric energy harvesters were
compared and discussed with several analysis methods.
Properties of the piezoelectric material were discussed
including X-ray diffraction (XRD) analysis and
scanning electron microscopy (SEM) measurement.
Also, comparative analyses were carried out and will
be discussed in both of simulation and experimental
aspects.
Keywords: Piezoelectric energy harvesting, PZT,
Actuator
1. Introduction
Over the past decade, piezoelectric actuators have
been used in place of conventional actuators across the
industry. As contrasted with conventional actuators
using electric current, hydraulic fluid pressure, or
pneumatic pressure, piezoelectric actuators have many
features which are fast response time, low electrical
noise, precision control, lightness and a simple
structure. Also, piezoelectric actuators of multi-layer

structures by tape-casting process have the advantages
of high density, large planar electromechanical
coupling factor (Kp), and high mechanical quality
factor (Qm) [1]. Accordingly, piezoelectric actuators
have attracted a lot of interest in the research and
industry. Recently, the development of wireless sensor
systems and small electronic devices has been
interrupted by the absence of more powerful batteries
such as large volume, limited lifetime, and efficiency.
Owing to these problems, the energy harvesting has
received significant attention as the auxiliary power.
Energy harvesting can be divided into five main
categories such as light, wind, heat, RF, vibration
according to energy sources. If sustainable vibration
energy exists in surrounding environment, piezoelectric
energy harvesting using vibration energy is hardly
affected by environmental conditions among other
energy harvesting methods. In addition, piezoelectric
energy harvesters have three times higher energy
density as compared to electromagnetic and
electrostatic energy harvesters using vibration energy
[2]. However, piezoelectric ceramics of the energy
harvesters have the brittleness [3] and lower current
level because of voltage driven devices. We choose a
1-3 polymerceramic composite structure and to
supplement brittleness of the ceramics. To improve the
performance of converting the mechanical-energy into
electrical energy, we considered high conversion
materials (high piezoelectric constants, high
piezoelectric voltage constants) and impedance
matching [4]. Lead zirconate titanate (PZT) is one of
the most representative piezoelectric ceramic materials.
In comparison to lead free piezoelectric materials, the
piezoelectric materials based on PZT exhibit the
superior piezoelectric and electrical properties. PZT
ceramics have been researched for applications such as
sonar devices, actuators, sensors, transformer, and
ultrasonic transmitters [5-10]. Also, there include a
high piezoelectric charge constant (d33), a high
dielectric constant, high coupling, high charge
sensitivity, high density, and low mechanical loss [11-
- 580 -
ICEIC 2015
12]. In this paper, multi-layer piezoelectric energy
harvesters based on the PZT ceramic actuators by tapecasting process were fabricated. To enhance conversion
efficiency, we conduct impedance matching through
analysis of electrical properties. Several important
considerations in designing of energy harvesting are
explored, including properties of materials, structures
of the devices, load impedance matching, energy
storage.
5. Main text
Figure 1 exhibits the schematic view and image of
multi-layer piezoelectric energy harvesters based on the
PZT ceramic actuators. The internal electrodes of the
PZT ceramic actuators were connected in parallel.
After the poling process, the PZT ceramic actuators
were attached to the aluminum substrate (2020 mm).
Also, the external electrodes of same polarity were
extrinsically contacted in parallel. Subsequently, the
empty spaces among the PZT ceramic actuators were
filled with PDMS. Subsequently, the single layer, the
double- and triple- layers were connected to parallel
with the electrodes in the same polarization direction.
These structures of the multilayer piezoelectric energy
harvesters were designed for increasing the capacitance
of the energy harvesters.
Fig. 1. Schematic view and image of multi-layer

piezoelectric energy harvesters based on the PZT
ceramic actuators.
F. Richards, Efficiency of energy conversion for

devices containing a piezoelectric component, J.
Micromech. Microeng. 14 (2004) 717721.
[5] X. Zhao, H. Gao, G. Zhang, B. Ayhan, F. Yan, C.
Kwan, and J. L. Rose, Active health monitoring of an
aircraft
wing
with
embedded
piezoelectric
sensor/actuator network: I. Defect detection,
localization and growth monitoring, Smart Mater.
Struct. 16 (2007) 12081217.
[6] J. J. Tzen, S. L. Jeng, and W. H. Chieng, Modeling
of piezoelectric actuator for compensation and
controller design, Precision Engineering 27 (2003) 70
86.
[7] M. I. H. Yaacob, M. R. Arshad, and A. Abd. Manaf,
Modeling of circular piezoelectric micro ultrasonic
transducer using CuAl10Ni5Fe4 on ZnO film for sonar
applications, Acoustical Physics 57 (2011) 151158.
[8] S. J. Choi, H. S. Lee, and W. K. Moon, A micromachined
piezoelectric
hydrophone
with
hydrostatically balanced air backing, Sensors and
Actuators A 158 (2010) 6071.
[9] J. H. Hu, H. L. Li, H. L. W. Chan, and C. L. Choy,
A ring-shaped piezoelectric transformer operating in
the third symmetric extensional vibration mode,
Sensors and Actuators A 88 (2001) 7986.
[10] I. S. Kim, M. S. Kim, S. J. Jeong, J. S. Song, and
H. K. Joo, Properties of step-down multilayer piezo
stack transformers using PNN-PMN-PZT ceramics
with CeO2 addition, J. Korean Phys. Soc. 58 (2011)
580584.
[11] A. Abdullah, M. Shahini, and A. Pak, An
approach to design a high power piezoelectric
ultrasonic transducer, J. Electroceram. 22 (2009) 369
382.
[12] S. Priya, Advances in energy harvesting using low
profile piezoelectric transducers, J. Electroceram. 19
(2007) 165182.
References
[1] H. C. Song, H. C. Kim, C. Y. Kang, H. J. Kim, S. J.
Yoon, D. Y. Jeong, Multilayer piezoelectric energy
scavenger for large current generation, J. Electroceram.
23 (2009) 301304.
[2] S. R. Platt, S. Farritor, and H. Haider, On lowfrequency electric power generation with PZT ceramics,
IEEE/ASME
TRANACTIONS
ON
MECHATRONICS 10 (2005) 240252.
[3] D. J. Shin, W. S. Kang, J. H. Koh, K. H. Cho, C. E.
Seo, and S. K. Lee, Comparative study between the
pillar- and bulk-type multilayer structures for
piezoelectric energy harvesters, Phys. Status Solidi A
211 (2014) 18121817.
[4] C. D. Richards, M. J. Anderson, D. F. Bahr, and R.
- 581 -
P3-17
Harvesting Piezoelectric Energy using (1-x)(Bi,Na)TiO3-x(Bi,K)TiO3 Leadfree Ceramics
Gun-Hyun Lee1, Young-Hoon Kwon1, Jung-Hyuk Koh1*

School of Electrical and Electronics Engineering, Chung-Ang University, Seoul, 156-756,
Korea
jhkoh@cau.ac.kr
Keywords: Piezoelectric ceramics, Energy harvesting
poled. Also, BNT shows a relatively high reverse

piezoelectric coefficient (498 pm/V) at high electric
fields. The high inverse piezoelectric effects can cause
very large strain values. However, this relatively large
strain can only be observed at high electric fields
because of the large coercive electric field. Therefore,
many attempts have been made to improve the
properties of BNT. BNT-(Bi,K)TiO3 (BNT-BKT)
shows excellent piezoelectric properties with 0.16 x
0.20. In addition, BNT-BKT ceramics could be
reduced the coercive electric field (Ec = 4 kV/mm) by
lower Ec of BKT. In this study, the piezoelectric and
dielectric properties of (1-x)BNT-xBKT (x = 0.12, 0.14,
0.18, 0.20, 0.30) ceramics will be investigated.
1. Introduction
2. Experimental
Recently, harvesting energy from renewable sources

has been intensively studied in view of finding
replacements for fossil fuels. Energy harvesting
involves extracting energy that is usually wasted in the
environment. It can involve the transformation of
mechanical energy to electrical energy. The behavior
and the efficiency of energy harvesting devices depend
on environmental conditions. However, piezoelectric
energy harvesters remain unaffected by environmental
factors as long as ambient vibration exists. Therefore,
much research has been directed toward piezoelectric
energy harvesting.
Bismuth sodium titanate (BNT) is a representative
lead-free piezoelectric ceramic. BNT ceramics show
excellent piezoelectric properties for piezoelectric
energy harvesting, such as a large remanent
polarization (Pr = 38 C/cm2) at room temperature and
high Curie temperature (Tc = 320 C) and can
potentially replace lead-based piezoelectric ceramics.
However, the BNT ceramics exhibit a high coercive
electric field (Ec = 73 kV/cm), which is difficult to be
The (1-x)BNT-xBKT ceramics (x = 0.12, 0.14, 0.18,

0.20, 0.30) were fabricated using the conventional
mixed oxide method. The raw materials, i.e., Bi2O3
(99.9%), Na2CO3 (99.0%), K2CO3 (99.5%), and TiO2
(99.9%) powders, were weighed in stoichiometric
quantities and ball-milled with zirconium balls (10 mm
in diameter) for 24 hrs using a planetary mill. After
drying, the mixture was calcined at 850 C for 2 hrs.
The calcined powders were mixed with a binder
(polyvinyl alcohol) and pressed using a pressure of 2
metric tons into discs 12 mm in diameter and about 1
mm in thickness. The discs were sintered at 1175 C
for 2 hrs and cooled to room temperature in air. The
upper and lower faces of the sintered samples were
attached to electrodes with silver paste. The samples
were poled at 80 C in silicone oil by applying a direct
current (DC) electric field of 4 kV/mm for 15 min.
The crystalline properties of the (1-x)BNT-xBKT
ceramics were analyzed by X-ray diffraction (XRD,
Bruker-AXS; New D8-Advance). The piezoelectric and
dielectric properties will be discussed.
Abstract
The piezoelectric and dielectric properties of (1x)(Bi,Na)TiO3-x(Bi,K)TiO3 (x = 0.12, 0.14, 0.18, 0.20,
0.30) lead-free ceramics were investigated . Specimens
were prepared by the conventional mixed oxide method
and sintering at 1175 C in air. The 0.8(Bi,Na)TiO30.2(Bi,K)TiO3 ceramics show excellent piezoelectric
and dielectric properties. Specimens with optimum
composition showed a piezoelectric charge constant
d33 of 166 pC/N, a dielectric constant r of 1291, and
generated power output of 37.49 nW/cm2.
- 582 -
ICEIC 2015
20
30
40
2 (deg)
50
220
112
211
201
002
200
111
110
0.70BNT-0.30BKT
0.80BNT-0.20BKT
0.82BNT-0.18BKT
0.86BNT-0.14BKT
0.88BNT-0.12BKT
100
Intensity (arb. units)
3. Results and discussion
60
70
Figure 1. The XRD patterns of the (1-x)BNT-xBKT

ceramic samples in various compositions.
The XRD patterns obtained from the (1-x)BNTxBKT ceramics (0.12 x 0.30) with Cu-K
radiation were shown in figure 1. Figure 1 shows the
XRD patterns with 2 ranging from 20 70 . Each of
the ceramics exhibited a single perovskite phase and
any secondary phase was not observed. In the case of
samples with x > 0.12, XRD peaks slightly shifted to
lower angles compared with the 0.88BNT-0.12BKT
pattern, indicating an increase in the lattice parameters.
As is known, the A-site cation of the perovskite
structure is occupied by K+ and Na+ [1]. By increasing
the concentration of BKT, Na+ ions are substituted by
K+ ions. In addition, the theoretical coordination
number of the A-site cations is 12 and the ionic radius
of K+ (1.78 ) is larger than that of Na+ (1.39 ).
Therefore, due to the differences in the ionic radii of
K+ and Na+, the lattice parameters were increased with
increase in the BKT compositions.
1400
170
55
1000
110
25
800
80
600
50
0.10
15
0.15
0.20
0.25
0.30
4. Conclusions
The (1-x)BNT-xBKT (0.12 x 0.30) lead-free
piezoelectric ceramics were fabricated by a
conventional mixed oxide method. The XRD patterns
showed that the (1-x)BNT-xBKT samples show
tetragonal and rhombohedral structures depending on
the composition. The samples with x = 0.20 showed the
maximum values of d33, r, generated power output and
FOM, which were 166 pC/N, 1291.32, 37.49 nW/cm2,
and 2.41 pm2/N, respectively. Therefore, (1-x)BNTxBKT piezoelectric ceramics with x = 0.20 seemed to
be the best candidates for use in piezoelectric energy
harvesting devices.
References
35
FOM (pm /N)
45
2
140
Power (nW/cm )
1200
Dielectric constant
Power
FOM
d33 (pC/N)
Dielectric constant
d33
Figure 2 shows piezoelectric and dielectric

properties of (1-x)BNT-xBKT ceramics in various
compositions (x = 0.12, 0.14, 0.18, 0.20, 0.30). For the
various specimens, the d33 values varied from 107 to
166 pC/N. The maximum values of d33 of 166 pC/N
was achieved for the 0.8BNT-0.2BKT specimens. The
value of r of the (1-x)BNT-xBKT ceramics were
measured at 1 kHz at room temperature. The r value
was increased with increase in x up to x = 0.20 and the
maximum value of 1291.32 was achieved. The
generated output power was increased with increase in
x, and slightly decreased on further increase in x. This
behavior is similar to the variation of d33 and r. The
FOM increased with increase in x and the maximum
value (of 2.41 pm2/N) was achieved at x = 0.20. With
further increase in x, the FOM value decreased steadily.
Since the FOM value is strongly dependent on the d33
and g33 values, the 0.8BNT-0.2BKT ceramics showed
the highest value. Therefore, among the various
ceramic samples considered in this study, the 0.8BNT0.2BKT samples showed the best piezoelectric
properties and are potentially excellent candidates to
find application in piezoelectric energy harvesting
devices.
[1] M. Otoniar, S.D. kapin, M. Spreitzer, D. Suvorov,

Compositional range and electrical properties of the
morphotropic phase boundary in the Na0.5Bi0.5TiO3
K0.5Bi0.5TiO3 system, J. Eur. Ceram. Soc., 30, pp.971-979,
November 2010.
BKT composition
Figure 2. d33, r, generated power output and FOM

of the (1-x)BNT-xBKT ceramics.
- 583 -

P3-18

!%"$ #

#$" ! !$

#/# #$# $"$'!$)" $'
&

% &''(
'')+,*%-.)+*%-.
&
2
!1
/!0)+/!,/!*%-.
/!/.)+/!/!*%-. & 23
3
& &
!%
&
'(
''
/!0)+/!,/!*%-.
/!/.)+/!/!*%-.'( & 2

3 &'&
4445!% &'3
'&&

2
'(
..
/7'6, & ' $'..!08
& : 9&44!0

'&;.! &4!<'&46,

''24!<7=6 &42
3
' !-

'&(

&'
'

&''( ''

/!0)+/!,/!*%-./!/.)+/!/!*%-. & !

($)'!% $"!"!"$# "
+*,

&$#"#"!% $"""'#$#
'#$$)(*)+*)+,-.(,0/$#!"'#$
#$" $ "$"1/" #11$"$ $$
!"1$"6.)547 645)238$"1$1!"$ "
9:;) "#$"#"1$$$$" #11$"
/$<**
.=*8># /#? $ $ /#11$"
/'+=*8>9<;)" $' $"!"1$$'$#
" +**$"1$1!"$ "$' "## !
$<***$" .**8>9.;)@ #0/$#
> "$1!"$ "(6.<*8>,##" $' "
"1$! "%$B".4C>A1<"'
D3).EA11$"1$1!"$ "9=;)
"1#'"# ! "%$$1!"$ "
:4+8> 1$#$"!"$ ##
!% $"$ $"#9+;)""$"#$
#1!$1$" #$1!"'$"!"##$#
'#!"!"$#)" 1$"$ 1$$(,
$"!"1$$'$#"$$$)
" $' $"!"1$$'$"
/ $+**:3+*"#!$' 92;$"1$1!"$ ")
&$#'#$$$$$
"#$" $' $"!"1$$'$
"#$!$ $ $! $
"#/$#$#1
!"'#$#$" $ "'#1 "1!#$)&$#
!!""!"$$!$1%$$#$"
$1!"$ "$!% $"!"!"$# "
*)53(*)+*)+,-.
*)*.(*)+"*)+,-.!% $"
"1#$'""'#$")
-*. "

*)53(*)+*)+,-.
*)*.(*)+"*)+,-.(
,"1#"!"!"/'$ "1
#$"$? #$100#1$)<-.
<>-.>-.">-.-<"1! #$
#$"$1$" #)<-.<>-.-.!"#
"$$#$1$""1 "/
1 "<=$F"-</ $

$4**8>"<"#)&$>-.">-.-.
!"#"$$#$1$""1
"/
1 "<="#$F"-</ $
$5**8>"<"#)#!"#"
#$1$" 10$/$$1!#$

/ 1 ""<="#)"
!"#"10$! ' (BE@,
/" 0 !"## "<5=GB#$"
$"$$1!"$ "#""1::<+$:<<+8>
(::<+::+*::3+:<**:<<+8>,)
*/"

H ":0! #$'"$..!I1$

"1## $$#$"
$1!"$ ")' #..!I1""#
$"##$"$1!"$ "$"#
"101 1' #:*4!>A..)5<J
<33)5*"#!$' $:<**8>)' ..!
I1""#$"#$#$"
- 584 -
ICEIC 2015
$1!"$ ""1:<**$:<<+8>!##/ /

$$"/ $$$'!"$1!$#
$'"#$")

0+*1%"1

"1 "" 2 1 "
4 "$ 315*765*8 5*8

5*5 5*85*8

)

H "<##$'"$$" $' $"
!"1$$'$$ $"!""$$ "
1"$#(H-G,$
"1##$"$
"$$1!"$ "#)' #$" $' $"
!"1$$'$$ $"!""$$ "
1"$#(H-G,""#$#$"
$1!"$ "#"#"1::<+$:<**8>)
101 1' #$" $' $"!"1$$'$$
$"!""$$ "1"$#(H-G,
"$:<**8>"2:.):=<+)=4KA1<
<):+!1<A"#!$' ) $#'$$$$
"1#1! /$/#$"$:<**L>##
!% $"!"!"$#)!% $"
!"!"$#"#$#$"$1!"$ "#
"#"1:<**$:<<+8>)
%

%
%

!
"$#

%

%

0-*1" #"#$1
") 1
0
915*765*8 5*8
5*5 5*85*8

)
:*"
-!$1 1 $"!% $"!"!"$#"

'$
"1##$"$:<**L>)
!$1 1#1! #0/$" $'#$
55)<4JM"2:.):=..:*4!>AH-G<):+
!1<A!..)5<JI1<33)5*"$ $"
!"<+)=4KA1<)
/

9:;>)
)> )
)>N)
))
K)> O
$#G-!#$"$1!"$ "$
1"#$" $ "$
"!% $""1
*)+*)+-.P>2
% !!).5
=+@!" <*:*)

9<;&)B)B"B)B)"'E)@)&# !'E)G)D"'
)E)F$#'OB "$#!#$"#$## 1
/#1 $$$$P? !!).5+

.53) ":54*)

9.;E)@)&# !'OH"" $"*)+*)+-.
*)+*)+-.!"'#$#$"# # $#P
? !!):<.
:=3)G"<**+)

9=;)@)1 #E)@)# !'@)&)@"'#)
)"O"" $"1! 01!#$P
>!
@!4!!)<2+:
<2+=):52:)

9+;) " 1 )$)OQ! "%$
$1!"$ "!% $"!"!"$#(:A<:A<,-.
(:A<:A<,-.
(:A<:A<,-.
"!% $"
"1#P&!A!!)::3
:<*)Q1/"<**5)

92;) ) $ )$ )E 1OQ $"
!"!"$#A! 1"1!#$PB!!&! !!)
.553
=**:G"<**3)
- 585 -
P3-19
Effects of BaTiO3 on Piezoelectric Properties of (1-x)(Bi0.5Na0.5TiO3)x(BaTiO3) Lead Free Ceramics for Energy Harvesting
Woo-Seok Kang, Jung-Hyuk Koh*
School of Electrical and Electronics Engineering, Chung-Ang University, 84 Heukseok-Ro,
Dongjak-Gu, Seoul, 156-756, Korea
jhkoh@cau.ac.kr
Abstract
Piezoelectric materials with high dielectric permittivity
have been attracted attentions for the piezoelectric energy
harvester applications. High dielectric permittivity can be
employed to increase generated energy capability. In this
paper, lead free (1-x)(Bi0.5Na0.5TiO3)-x(BaTiO3) (x = 0, 0.02,
0.04, 0.06, 0.08, 0.10) ceramics were prepared by mixed
oxide sintering method. Fabricated ceramics were calcined
at 850 ~ 900 C for 2 hrs and sintered at 1150 ~ 1200 C for
2 hrs, respectively. The crystalline and dielectric properties
have been investigated. Furthermore, piezoelectric
properties were also investigated and discussed. Besides, to
find optimized piezoelectric properties with strong
ferroelectricity, X-ray diffraction (XRD) analysis were
performed. In this experiment, We will show optimized
conditions for the energy harvester applications based on (1x)(Bi0.5Na0.5TiO3)-x(BaTiO3) lead free ceramics.
Keywords: Energy harvesting, lead-free, Piezoelectric.
1. Introduction
Lead-free materials have been getting a lot of
attentions. Among the numerous lead-free ceramics,
Bi0.5Na0.5TiO3(BNT) based ceramics can be one of the
great candidate as alternatives. BNT is ferroelectric
compound having Bi3+ and Na+ on the A-site of ABO3
perovskite structure and rhombohedral symmetry and
also has a large remanent polarization (Pr = 38 C/cm2),
high curie temperature (Tc = 320 C) [1,2]. But the
pure BNT ceramic has weak piezoelectric properties
with high coercive field (Ec = 7.3 kV/mm). Therefore,
it is difficult to make a poling process. This BNT
ceramics show relaxor properties with diffuse phase
transition (DPT) behavior from ferroelectric
rhombohedral to nonpolar tetragonal transition [1,3,4].
So many research have been done by different method
to modify and improve the piezoelectric properties of
BNT ceramics by substitution or addition with BaTiO3,
(Bi0.5K0.5)TiO3, NaNbO3, BiFeO3, (K0.5Na0.5)NbO3 [1014]. Among these, Bi0.5Na0.5TiO3-BaTiO3 (BNT-BT)
ceramic shows high strain due to the A-site is
substituted by Ba2+. The effect of substitution with Ba2+

at (Na0.5Bi0.5)2+site contributes to the decrease of curie
temperature and improvement of sintering and
piezoelectric properties and large displacement under
DC electric elds, so could be used as actuators [3,5].
BNT and BT ceramics have rhombohedral and
tetragonal structure, respectively. As well-known,
morphotropic phase boundary (MPB) provide
improved poling and piezoelectric properties [3]. For
these reason, we will discuss on the optimized
conditions for the BNT-BT ceramics and their
piezoelectric properties.
2. Experimental
Lead free (1-x)(Bi0.5Na0.5TiO3)-x(BaTiO3) (x = 0, 0.02,
0.04, 0.06, 0.08, 0.10) ceramics were prepared by
mixed oxide sintering process. At first BNT has been
synthesized. Na2CO3(99.9%), Bi2O3(99.9%) and
TiO2(99.9%) were used as raw materials. The raw
powders were mixed in ethanol using zirconia balls for
24 hrs and dried at 120 C for 24 hrs. It was
precalcined at 780 C for 2 hrs. Synthesized powder
and BaTiO3(99.9%) powder were mixed at the mole
rate. The mixed powders were ball milled and dried
again. Calcinations was carried out at 850~900 C for 2
hrs. For sintering process, prepared powers were
pressed at 2.0 MPa with PVA bind solution. The disk
samples were sintered at 1150~1200 C for 2 hrs and
then polished for parallel surface. The silver electrodes
have been painted on the samples top and bottom
surface. The painted samples were poled with the
electric field of 5 kV/mm in silicone oil bath at 70 C
for 1 hr.
3. Result and discussion

Fig.1 (a) shows there XRD pattern of the (1x)(Bi0.5Na0.5TiO3)-x(BaTiO3) (x = 0, 0.02, 0.04, 0.06,
0.08, 0.10) ceramics. The rhombohedral symmetry of
BNT ceramic at room temperature can be characterized
by a (003)/(021) peak splitting between 39 and 41 and
a single (202) peak between 45 and 48. The
rhombohedral (003)/(021) peak splitting remain until
the BT concentration x reaches 0.06 ~ 0.08 and more
- 586 -
ICEIC 2015
are replaced by the (111) peak. Fig. 1(b), shows that
(202) peak became a (002)/(200) peak splitting
between 45 and 47, which confirms a tetragonal phase
appears and increases continuously as x increases.
20
30
(211)
(202)
(021)
(003)
(101)
Intensity (a.u.)
(101)
(111)
(110)
0.90BNT-0.10BT
0.92BNT-0.08BT
0.94BNT-0.06BT
0.96BNT-0.04BT
0.98BNT-0.02BT
Pure BNT
40
50
60
-2(deg)
Figure 1 X-ray diffracion patterns of (1-x)(Bi0.5Na0.5TiO3)-x(BaTiO3) ceramics (x=0,

0.02, 0.04, 0.06, 0.08, 0.10).
It suggests that the MPB of rhombohedral and

tetragonal exist at 0.06 x 0.08 and then the BNTBT ceramic becomes a pure tetragonal structure over x
= 0.10.
5.65
93.5
Relative density
Density
Density (g/cm3)
5.60
92.5
5.55
92.0
5.50
Relative density (%)
93.0
References
[1] C. Xu, D. Lin, K.W. Kwok, Structure, electrical
properties and depolarization temperature of (Bi0.5Na0.5)TiO3BaTiO3 lead-free piezoelectric ceramics, Soild State
Sciences, pp934-940, November 2007
91.5
0.00
0.02
0.04
0.06
0.08
Fig.3 shows the BT concentration dependences of the

piezoelectric properties and electromechanical
coupling factor of BNT-BT ceramics. Because of the
large Ec, pure BNT ceramic is difficult to pole and
exhibits poor piezoelectricity. However, by introducing
the BT dopant to BNT ceramics, the increased
resistivity helps to make poling process easier than the
pure BNT ceramics. Therefore, the piezoelectric
properties were improved by increasing the BT dopants.
Tendency of electromechanical coupling factor is
similar
to
piezoelectric
constant.
The
electromechanical coupling factor was reached
26.57 % when the BT dopant is around 0.06 %.
(1-x)(Bi0.5Na0.5TiO3)-x(BaTiO3) (x = 0, 0.02, 0.04,
0.06, 0.08, 0.10) lead-free piezoelectric ceramics were
prepared successfully by mixed oxide method. The
ABO3 perovskite structure is confirmed by the XRD
analysis. The BNT-BT ceramic shows better
piezoelectric properties when BT content is around
0.06 %. By introducing the BT content to the BNT
ceramics, the piezoelectric properties were improved
by increasing the resistivity. Therefore, piezoelectric
constant d33 is 107 pC/N and electromechanical
coupling factor kp is 26.57% when BT is around
0.06 %
0.10
Figure 2 Densities of (1-x)BNT-(x)BT ceramics as a function of BT compoxition x, x =

0, 0.02, 0.04, 0.06, 0.08, 0.10.
Fig.2 shows the relative density and experimental

density, both were increased with increasing BT
content until x=0.06. BNT-BT ceramics become more
densed due to decreased porosity. The experimental
density of BNT-BT ceramics reach to the 93.3 % of
theoretical density. We believe that BNT-BT ceramics
prepared by mixed oxide methods were well prepared
for the piezoelectric applications.
[2] S.K. Acharya, S.K. Lee, J.H. Hyung, Y.H. Yang, B.H.
Kim, B.G. Ahn, Ferroelectric and piezoelectric properties of
lead-free BaTiO3 doped Bi0.5Na0.5TiO3 thin films from
metal-organic solution deposition, J. Alloys Compd, pp204209, June 2012
[3] M. Cernea, C. Galassi, B. S. Vasile, C. Capiani, C.
Berbecaru, I. Pintilie, L. Pintilie, Structural, dielectric, and
piezoelectric properties of fine-grained NBTBT0.11 ceramic
derived from gel precursor, J. Eur. Ceram Soc, pp23892397, March 2012
0.40
0.35
kp
d33
[4] T. Oh, M.H. Kim, Materials Science and Engineering B,

Phase
relation
and
dielectric
properties
in
(Bi1/2Na1/2)1xBaxTiO3TiO3 lead-free ceramics, pp239-246,
February 2006
105
0.30
d33
kp
90
0.25
75
[5] M. Cerneaa, E. Andronescuc, R. Radua, F. Fochib, C.

Galassib, Solgel synthesis and characterization of BaTiO3doped (Bi0.5Na0.5)TiO3 piezoelectric ceramics, J. Alloys
Compd, pp690-694, October 2009
0.20
0.15
0.10
0.00
60
0.02
0.04
0.06
0.08
0.10
Figure 3Electromechanical coupling coefficient and piezoelectric constant of kp and d33

of (1-x)BNT-(x)BT ceramics as a function of BT composition x. x = 0, 0.02, 0.04, 0.06,
0.08, 0.10.
- 587 -
P3-20
Experimental results on 3-D respiratory motion prediction with EKF-GPR

algorithm
Waqas Bukhari and Sun-Mog Hong
School of Electronics Engineering, Kyungpook National University, Deagu, Korea
waqas@knu.ac.kr and smhong@ee.knu.ac.kr
Abstract
Real-time prediction of respiratory motion has
received much attention over the last two decades in
radiotherapy for compensating for the targeting error
of the treatment beam due to respiratory motion. EKFGPR is a recently proposed prediction algorithm for
respiratory motion. This algorithm utilizes a modelbased extended Kalman filter and a model-free
Gaussian process regression (GPR) by combining
them in a cascade structure. In this work, we report
our experimental results of EKF-GPR for the
prediction of respiratory motion in 3-D space by
applying the algorithm independently along each
coordinate. We employ a large database of 304
respiratory motion traces for experiments and show
that the EKF-GPR reduces the RMS error of no
prediction to around 55%.
Keywords: Respiratory motion, Kalman filters,
Gaussian processes, Multi-output regression.
1. Introduction
Respiration-induced motion in thoracic and
abdominal tumors often exceeds 20 mm which can
significantly compromise the conformal dose delivery
[1]. Adaptive radiotherapy aims at compensating this
motion for conformal dose delivery with minimal
normal tissue exposure. The motion compensation
requires image acquisition and processing to locate the
tumor position, and mechanical control to direct the
treatment beam towards the tumor. These processing
and control steps introduce systematic delays which
can be up to several hundred milliseconds. Tumor
motion over these delays should be compensated. To
this end, a prediction framework is needed to predict
the respiratory motion over these delays [1, 2].
An empirical study assessed the range and dynamics
of respiratory motion at tumor sites by acquiring
electronic portal images (EPIs) from 97 patients [3]. A
mean displacement of 12.5 mm, 9.4 mm, and 7.3 mm

was reported along superior-inferior, anterior-posterior
and left-right. A maximum displacement of 34 mm, 22
mm and 12 mm along superior-inferior (SI), anteriorposterior (AP), and left-right (LR) was also reported.
Most studies develop algorithms for 1-D prediction of
respiratory motion and report their prediction
performance over 1-D representation of respiratory
motion traces [1]].
EKF-GPR is a recently proposed algorithm for 1-D
prediction of respiratory motion [2]. In this work, we
evaluate the performance of EKF-GPR for the
prediction of respiratory motion in 3-D space by
applying the algorithm independently along each
coordinate.
2. EKF-GPR algorithm
EKF-GPR algorithm utilizes a model-based
extended Kalman filter (EKF) and a model-free
Gaussian process regression (GPR) by combining them
in a cascade structure [2]. This structure is motivated
by the observation of correlation between the
prediction error of the EKF prediction and its state
estimates. EKF-GPR algorithm, shown in Figure 1
exploits this correlation. Specifically, the EKF-GPR
algorithm first employs an extended Kalman filter
based on local circular motion (LCM) model, which we
call LCM-EKF to predict the respiratory motion. Then
the EKF-GPR utilizes a model-free Gaussian process
regression (GPR) to estimate and correct the error of
the LCM-EKF prediction.
Gaussian process regression (GPR) is a
nonparametric Bayesian technique for regression [4]. It
provides flexible framework for the optimization of the
model hyper-parameters from the training data. Its
Bayesian formulation yields the predictive distribution
over the test inputs. Predictive mean is normally used
as the point prediction and the predictive variance
estimates the uncertainty in prediction.
- 588 -
ICEIC 2015
Figure 1 EKF-GPR algorithm
We employed a large database of 304 real
respiratory motion traces from a group of 31 patients to
evaluate the prediction performance of EKF-GPR
algorithm. We evaluated the algorithm at lookahead
lengths of 192, 384 and 576 ms after down-sampling
the traces to 5.2Hz for conformity to the kV/MV
imaging standards. In 3-D prediction, we define the
prediction error as the Euclidean distance between the
measurement and the prediction. We employ root mean
square (RMS) prediction error as performance metric
and use no prediction for the baseline comparison.
Note that a scheme of using the current measurement as
the lookahead prediction is called no prediction [2].
We performed numerical experiments over the traces
and computed the (trace-wise) average RMS prediction
error by averaging over all the traces. The results show
that EKF-GPR reduces the RMS errors to 55%, 53%,
and 54%, respectively, at lookahead lengths of 192,
384, and 576 ms in percent ratios relative to no
prediction.
We present the patient-wise RMS error of EKFGPR at lookahead length of 576 ms with respect to
RMS error of no prediction in Figure 2. In the figure,
we note that the patient-wise RMS error of EKF-GPR
is scattered around 50% RMS error of no prediction.
Similar observations hold at lookahead lengths of 192
and 384 ms as well. In our previous study on 1-D
prediction of respiratory motion using EKF-GPR over
PCA-processed 1-D traces, the ratio of RMS prediction
error of EKF-GPR to that of no prediction was around
50% [2]. The increase in percent ratios for the 3-D
prediction is attributed to the fact that EKF-GPR
prediction is more accurate in relative to no prediction
for traces with a large excursion. Note that the
excursion of a PCA-processed trace is greater than or
equal to that of its original 3-D trace in any direction in
the 3-D space.
Figure 2 Patient-wise RMS prediction error
4. Discussion
Experimental results of EKF-GPR are reported for
the prediction of respiratory motion in 3-D space. In
the future, we plan to employ Gaussian process
regression networks [5] to compensate the LCM-EKF
prediction error in 3-D space in a integrated manner.
Acknowledgement
This work is supported by the IT R&D program of
the Korea Ministry of Science, ICT and Future
Planning (MSIP)/KEIT (10041145, Self-Organizing
Software Platform for Welfare Devices).
References
[1]. C. Ozhasoglu and M. J. Murphy, Issues in
respiratory motion compensation during externalbeam radiotherapy, Int. J. Radiat. Oncol. Biol.
Phys., vol. 52, pp. 13891399, 2002.
[2]. W. Bukhari and S.-M. Hong, Real-time
prediction and gating of respiratory motion using
an extended Kalman filter and Gaussian process
regression, Physics in Medicine and Biology, vol.
60, no. 1, pp. 233-252, 2015.
[3]. S. C. Erridge, Y. Seppenwoolde, S.H. Muller, M.
van Herk, K. D. Jaeger, J. S. Belderbos, L. J.
Boersma and J. V. Lebesque, Portal imaging to
assess set-up errors, tumor motion and tumor
shrinkage during conformal radiotherapy of nonsmall cell lung cancer, Radiotherapy and
Oncology, vol. 58, no. 66, pp. 75-85, 2003.
[4]. C. E. Rasmussen and C. K. I. Williams, Gaussian
processes for machine learning, MIT press, 2006.
[5]. A. G. Wilson, D. A. Knowles and Z. Ghahramani,
Gaussian process regression networks, Proc. Intl.
Conf. Machine Learning (ICML), 2012.
- 589 -
P3-21
A Wearable Brain-Machine Interface System for Real-time Driver Drowsiness

Detection
Gang Li, Boon Leng Lee, Wan-Young Chung
Pukyong National University, Busan, South Korea
ligang@pknu.ac.kr, boringdragonlee@gmail.com, wychung@pknu.ac.kr
Abstract
This study proposes a fully wearable BrainMachine Interface (wBMI) system for real-time driver
drowsiness detection aimed at shifting driver
drowsiness detection from in-vehicle to on-body lifesaving technology. The proposed system consists of a
Low Energy Bluetooth-enabled, EEG sensorembedded headband and a machine learning model
[support vector machine (SVM)]-enabled wrist-worn
receiver device, smartwatch, which serves as a Datato-Knowledge platform transforming the raw EEG
data to useful driving status. To evaluate the system
performance, a one-hour monotonous driving
simulation experiment was conducted. Experimental
result shows 95.22% detection accuracy by using a
conventional video-based method (PERCLOS) as a
reference. This result indicates that the proposed BMI
system is an effective, simple, and inexpensive
wearable solution for detecting driver drowsiness in
actual environments.
Keywords: Wearable device, Brain-Machine Interface,
Driver Drowsiness Detection, Artificial Intelligence.
1. Introduction
Currently, driver drowsiness detectors using
portable or in-vehicle Brain-Machine Interface (BMI)
system based technology have been proposed [1,2].
However, the drawbacks, such as cumbersome-to-use
and the higher risk for distracted driving, limit invehicle BMI systems success in an actual environment.
In order to avoid these disadvantages, a fully wearable
BMI (wBMI) system is presented in this study.
2. System Design
Fig. 1. The system diagram with data collection and signal processing
procedures.
Fig. 1 shows the proposed wBMI system, which

consists of a wireless EEG headband and an Androidwear-OS-based smartwatch (Samsung Gear Live). The
wireless EEG headband is powered by a 3.6 V lithiumion rechargeable button-cell battery and incorporates
conductive fabric-based dry EEG electrodes and an
EEG bio-potentials conditioning circuits as well as an
inexpensive and lightweight open-source hardware
based EEG data sampling platform. The sampled EEG
data are then wirelessly transmitted to the smartwatch
via a Bluetooth Low-Energy (BLE) device. The
smartwatch extracts FFT-based EEG features
comprising , , power percentage and provides a
neurofeedback tool for driver self-tracking. Moreover,
the smartwatch runs the EEG features through a SVM
model in order to detect drowsiness in a more objective
and reliable way. If SVM recognizes a drowsy driving
status, a vibration warning, which is produced by the
built-in vibration sensor of the smartwatch, can be
activated.
- 590 -
ICEIC 2015
3. The Prototype of Proposed BMI System

Fig. 2 shows the graphical user interface (GUI) of
the smartwatch application, termed Brainwatch and
the prototype of the proposed BMI system. The green
and red filled circles in smartwatch GUI represent alert
and drowsy driving status respectively. The pie chart,
which consists of wave (quiet purple), wave (blood
red) and wave (fresh green), is used as a visual
neurofeedback tool to help drivers self-track mental
status and further self-regulate their driving behaviors.
Fig. 3. Example of experimental setup for evaluating drowsiness
detection.
model) for final test. In final testing session, the best

classification results are 95.22% accuracy, 100%
sensitivity and 93.8% specificity (see Table 1).
Table 1: Independent classification performance of
SVM classifier with single power percentage and
linear model
(a)
No.
Age
Sex
Sens%
Spec%
Acc%
16
26
100
91.84
92.45
17
28
100
97.3
97.62
18
25
100
82.05
88.1
19
25
100
97.83
97.92
28
20
Overall
100
100
100
93.8
95.22
5. Conclusion
(b)
Fig. 2 (a) The smartwatch GUI and (b) The prototype of the proposed
wearable driver drowsiness detection system
4. Driving Simulation Test and Results

Twenty subjects participated in the monotonous
driving simulation experiment (see Fig. 3).
Experimental data from fifteen subjects (subjects 1-15)
was used for training. The remaining five subjects
(subjects 16-20) were used for final testing. In training
session, the best accuracy was found to be 100% (in
linear kernel of C=0.1, RBF kernel g=0.1 and C=0.1,
and Poly kernel d=1 and C=0.1) when single power
percentages were used in the SVM inputs. Based on
these results we choose the simplest model (linear
The design and implementation of a fully wearable

BMI system is described in this study. The proposed
wearable BMI system combines wrist-worn smart
device and wearable EEG sensing device as well as
artificial intelligence model together aimed at providing
an effective solution for on-body driver drowsiness
detection.
References
[1] C. T. Lin, C. J. Chang, B. S. Lin, S. H. Hung, C. F. Chao
and I. J. Wang, A real-time wireless brain-computer
interface system for drowsiness detection, IEEE TBioCAS,
IEEE, pp. 214-222, August 2010.
[2] Y. T. Wang, C. K. Cheng, K. C. Huang, C. T. Lin, Y. J.
Wang and T. P. Jung, Cell-phone based drowsiness
monitoring and management system, Proceeding of
BioCAS Conf, IEEE, pp. 200-203. November 2012.
- 591 -
P3-22
Energy Transmission for Wireless Sensor Network using Power forming

Cheolung Cha1, Young Chul Noh2
Korea Electronics Technology Institute1, Doosan Infracore2
cucha71@hanmail.net, cucha@keti.re.kr
Abstract
In this paper, a power forming for wireless energy
transmission was studied and demonstrated using a
2X2 array antenna at ISM band. To improve the
transfer and conversion efficiency, matching circuits
from antenna to rectifier and rectifier to load were
designed and fabricated. Through this approach,
14mW of electrical power was obtained.
Figure 1. Test setup for the arrary antenna
Keywords: array antenna, energy transmission, beam

forming
1. Introduction
Several wireless power transmitting methods such as
inductive coupling, magnetic resonant coupling and
microwave-based transmission have been introduced
and studied. The main issue is the extension of power
transmission distance between power transmitter and
target devices. The inductive and magnetic resonant
coupling power transfer methods have higher
transmission efficiency compared to microwave-based
transmission method. However, they can cover only
short range. In this paper, a power steering technique
for microwave-based power transmission was studied
and demonstrated using a two-by-two micro-strip
arrayed patch antenna at 2.4GHz.
2. Design and Fabrication

(1) Antenna Design and Fabrication
In this research, a 2x2 micro-strip array patch
antenna was designed and fabricated in Figure 1 and 2.
Four patch antennas are fed at their edges by microstrip lines that are of equal length from the port to
preserve equal phase.The array patch antenna is printed
on Teflon substrate that has a dielectric constant (r) of
2.5. The substrate thickness (h) is 3mm and the
conductor thickness (T) is 35um.
Figure 2. Radiation pattern of the array antenna
The impedance matching was accomplished by

connecting a micro-strip feed line of 155 impedance
to a patch. The ZA is matched to the lines with Z01
(155 ).
(2) Rectifying Circuit Design and Fabrication
The rectifying circuit consists of a matching circuit
and a rectifier (HSMS-2850 schottky detector diode of
Avago technologies) was optimized through simulation
and fabricated in this research. The Rs is series
resistance and Cj is junction capacitance. The junction
resistance (Rj) is in equation (2).
- 592 -
ICEIC 2015
In this case, the ideality factor (k) is 1.06, the saturation
current (Is) is 3x10-6[A], Ib is externally applied bias
current in amps, T is temperature (C). The value of Cj
approximates with 9k.
Rj
8.33 105 nT 0.026
at 25C
I s Ib
I s Ib
(2)
Figure 5. The simulated and measured return loss (S11) of
rectifying circuit
Figure 3. The schematic of rectifying circuit
The matching circuit consists of micro-strip

transmission lines (TL) and open-stub. The width of
transmission line is 2mm and the width of short-stub is
2.4mm. The length of TL1, TL2 and TL3 are 12.5mm,
11.8mm and 19mm. the length of short-stub is 5mm.
The rectifying circuit has a return loss of -28.3dB at

2.4GHz. It reaches the simulated result of return loss.
To measure the microwave-DC conversion efficiency,
we used the fallowing equation. The conversion
efficiency of the antenna is defined as follows.
2
VDC
/ RL
P
100[%] DC 100[%]
Pin
Pin
(4)
5. Results
where Pin is the received power, the VDC is the DC

voltage which is measured in load resistance, and the
RL is the load resistance.
The Fig. 5 shows the simulated and measured return

loss (S11) of 2x2 micro-strip array patch antenna. The
return loss of 2x2 micro-strip array patch antenna is
obtained about -26dB at 2.4GHz. The simulated result
and measured result have the difference of 20MHz
resonance frequency. The gain of 2x2 micro-strip array
patch antenna is 12.5.
The microwave-DC conversion efficiency from antenna

to rectifier and rectifier to load were measured and
analyzed. As the result, we obtained the microwave-DC
conversion power of about 14mW, voltage of 1.5V,
when input power is 27dBm. The experimental
distance was about 2m. The microwave-DC conversion
efficiency of rectifying circuit was 30%.
Acknowledgment
This research was supported by Small and Medium
Business Administration and Ministry of Trade,
Industry and Energy.
References
Warren L. Stutzman and Gary A. Thiele, Antenna
Theory and Design, WILEY, 1998.
[2] J. R. James and P. S. Hall, Handbook of
Microstrip Antenna, Peter Peregrinus, 1989.
[3] William C. Brown, The History of Power
Transmission by Radio Waves, IEEE Trans. on
MTT., Vol. 32, NO. 9, Sept. 1984.
[4] International Telecommunication Union, Radio
Communication Study Groups Wireless Power
Transmission, Document 1/11-E, 18 November
1996.
[1]
Figure 4. The simulated and measured return loss (S11) of
2x2 micro-strip array patch antenna
- 593 -
P3-23

! "
#
"

!

! $ !

" !

!

"

!#$ ! "$
#
# !
%#!" &
!
"

' ! "(
"
((#"
#
# ! (
# !
# "#
"&'
"
!
"
$# #
"#
(
%#
$ ! & ) (# $ !
%#"*
""$ "%& #
#

"! ,++ #
**++
##-
" .0 /
(
%$ ! "#

"
#
# "%" #
%& 0# $ ##

"#"
( 4
# 1+&+320 # # !
#" #
1++ #

15,+ %
%#
"#"
#
"

"&6
"!%#

"#
$ %
#% "7
( $
! &
# "%%%
%
"
%#
# !#

! !7#
"!%#

($ ! "&
8 %
%
"!#
( "
"!%#
# #
" 4"
# #
( !
#
(
4$ "
#! "
%# "##" " # )&
#

$( # ((#$ ""
( %
%
" !#

%(
!# "!#
(
($$ ! "&
8 ! !7#
%
4! " (
!# "

!4 #

%#!7#
%
4!# +-$4"
%" #"
2
(("##"
#
"$4"
%" #" $ ! # %
&

$ # !4
( +-
!4 #
$4"

"9%
#"4 "%
4!&
8 ! $ #
(# #
# !"# #
( # "#" 4
4# # $
"!%
# !:;&
8 %
%
"!#
#! "
%# "##"#

! !7 #
"!%#

( $
! "" " # "" $
! $
! #
4<#
#
#
#! &
8 "#
("!4
"" # "%%""(

"=

=" %

"
% = !4
($ ! ".'/
= 9
(
. /
= 9
(' #" . % /
. / =' #
((2
:+;"##
( # #

. / =""$
!
( # #

&. / =""! #

' . / =%

"!%#
%
( # #

( =%
#
( #
) =!9!!< ##
( #
. / =! < ##
( # #

* =#
#
"#( #

8
4>#$
(# %
4!"#
! !7

* %
./
* !
' . / . / &

8
"# #"(
# %
4!=
#

. / . / &. /

- 594 -
./
ICEIC 2015
$
!

8!

5
*
,
B
E
3
D
+

5
*
,
B
E
3
D
+

5
*
"!
,
+
,
5
,
E
E
3
+
*
+
5E
B
5+
5+
5+

+
3
*
E
$
#
%&

8!
'

5
*
,
B
E
3
D
+

5
*
,
B
E
3
D
+

5
*
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+

+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
5
+
+
+
+
+
+
+
+
+
+
+
+
+
+
*
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
,
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
$
'

8!
'

5
*
,
B
E
3
D
+

5
*
,
B
E
3
D
+

5
*
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+

+
+
+
+
+
+
+
+
+
+
+
+
*
+
5E
B
5+
5+
5
+
+
+
+
+
5
,
+

+

,
5
,
E
E
B
+
+
+
+
+
+
+
+
+
+
+
+
+
*
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
,
+
+
+

+
+
+
+
+
+

+
+
+
+
+
+
+
E

+
3
*
B

*
. / )

.5/

8 %

"!%#
% % "
%

# ! < ##&
(

.*/
' . /
. /

8 "# " (#
( ) # "%# #
# ( #

%#!7#
# <" " # # #
" #
"
%#!! "
#
%
"
# 4
! # " #
" "## . #
"
#
/ 4# 4 ! # %
%#

( "
#
"
(
! "##"#" # #
%#
"& ) "
!
" #
#

%#$ 9%
#$ " #

(# %!#"%&
8
"# " #
4 ! !7 (
$
! # #! #$
$ #

" %
& 8 (# "" ( #
(
#
! !7#
%
4!"$ <#
./&
'
(&

8 %
! " ## #4 "
4
?%#!7#
8
4
9:;&
845"#
%#!
!!#! #" &
)
*

# "%%%
%
"
%#
# !#

! !7#
"!%#

($ ! "&
8 %
%
"!#
( "
"!%#
# #
" 4"
# #
( !
#
(
4$ "
#! "
%# "##" " # )&
#

$(# ((#$ ""
(%
%
"!#
"!#

"%(
!# ,$ ! "&
)@ A?066A8
8 "
" "%%
# 4 # 8

$#

! .++*3+B 8 $
%! #
(
0
$
!%
# #

( $
! (
-"$ # "$/
( C# "#
(8 "# 6
.?86
/
+

8 #"#""#!
""#"
(,$ ! #"&
8 ""! %
(""(
# ) ""
"
84&8 #!"#% #$"

&
:;&6&
4+
) ,

.$
- )"
-0"

(""
D3D&
:;#4
4?%#!7#
8
4
9
##%=22&!#
"&
!2 %2"2 9& #!
- 595 -
P3-24
Analysis of Digital Development Process (DDP) for Intravascular Ultrasound

(IVUS) Image
1
Seon Mi Ji, 1Sung Min Kim, 2Soo Chan Kim, 1Jong Seob Jeong*
Department of Medical Biotechnology, Dongguk University, Seoul 100-715, Republic of Korea
2
Department of Electrical, Electronic and Control Engineering, Hankyong National University,
Anseong-si, Gyeonggi-do, Republic of Korea
jiseonmi1118@dongguk.edu, *jjsspace@dongguk.edu
Abstract
Digital Development Process (DDP) can be used as
a post-processing method of ultrasound images. It has
been used as one of the reconstruction procedures of
the IVUS (Intravascular ultrasound) image. DDP has
three parameters having an effect on the result of DDP.
However, the previous papers related to it had
insufficient information about setting these DDP
parameters. So we studied DDP parameters by
analyzing the graph and images, and suggested proper
values of them. Besides, we verify the effect of DDP by
comparing DDP with log-compression.
Keywords: Digital Development process, IVUS,
Ultrasound, Image processing, Contrast.
1. Introduction
Digital Development Process (DDP) has been used
as one of the procedures reconstructing IVUS
(Intravascular ultrasound) images. This method can
improve the contrast and brightness of the IVUS
images. Although it can be applied usefully as an image
processing method, it has insufficient information
about setting the DDP parameters [1-2]. So we studied
the DDP parameters and determined appropriate values
of the DDP parameters. Additionally, we compared
DDP with log-compression method.
2. Method
DDP is applied by processing an equation (1)
including three parameters.
Yij = k[Xij/({Xij}+a)]+b
(1)
In equation (1), {Xij} means blurred version of input
image Xij and DDP parameters are k, a, and b. As
the result image Yij is affected by these parameters,

setting the proper value of these parameters is
important. We analyzed changing tendency of graph
and image according to value of the DDP parameters.
Without blurring step, DDP equation can be induced as
below,
Yij = [-ka/(Xij+a)]+b+k
(2)
And the equation (2) has a hyperbolic graph having
asymptotic curves (X=-a, and Y=b+k). As a ratio of
input to output value is not constant and the ratio can
be changed by asymptotic curves, DDP can control the
brightness and contrast of the images by varying the
DDP parameters. So we analyzed the changing
tendency of DDP graphs. However, it is not complete
analysis because it excludes the blurring step and it
couldnt provide a criteria to decide propriety of DDP
parameter values. Therefore, we analyzed the changing
tendency of result images according to the DDP
parameters and decided proper range of value of the
DDP parameters. DDP without blurring step presents a
similar graph to logarithmic graph and DDP has a
similar effect to log-compression method which is
increasing the middle values of the image. And logcompression method is usually used as one of the postprocessing steps of ultrasound B-mode images. So, we
compared the DDP graph and result image with the
image processed log-compression method.
3. Results
According to the changing tendency of graphs, the
parameter a controls the ratio of input to output
values, and b controls a whole range of the data, and
k controls maximum value of the data. The value of
parameter a is appropriate in range about 0.05 ~ 0.1
as shown in Figure 1. The Figure 1 is acquired by
applying a vector into DDP equation. X-axis means
- 596 -
ICEIC 2015
input vector and Y-axis means output value. And it is
appropriate to have the parameter b in range about 0
~ 0.1, and the parameter k in range about near 1.
Figure 1. The graphs before processing DDP and

after processing DDP according to parameter a
values (b=0.001, k=1).
When the parameter a is 0.1, b is 0.0001, k is 1, a
result image is following as shown in Figure 2
.
4. Conclusion
In this study, we analyzed the proper values of the
DDP parameters and suggested them. It is appropriate
to have the value of parameter a in a range about 0.05
~ 0.1, parameter b in a range about 0 ~ 0.1, and
parameter k in a range about near 1. Among these
parameters, a is most important parameter because it
controls the slope of the curve of DDP equation. Out of
the range of parameter a, the result images become
too dark or too bright. And we compare the result
image processed DDP with the image processed logcompression method. As a result, DDP can improve the
edge of the image unlike the log-compression. So the
result image processed DDP has more sharpened edges.
Acknowledgements
This work was supported by International
Collaborative R&D Program (N01150049) funded by
the Ministry of Trade, Industry & Energy (MOTIE),
Korea (N01150049, Developing high frequency
bandwidth [40~60MHz] high resolution image system
and probe technology for diagnosing cardiovascular
lesion and the Pioneer Research Center Program
funded by the Ministry of Education, Science and
Technology (2009-0082947).
References
Figure 2. Original image (left) and DDP processed
image (right), when a=0.1, b= 0.001, k=1.
DDP and log-compression can have a similar effect
increasing the low and middle values of input image.
However, DDP can improve the images to have more
sharpened edges compared with log-compression
processing image. It is below as shown in Figure 3.
[1] K. L. Caballero, J. Barajas O. Pujol, O. Rodriguez, and P.

Radava, In-vivo IVUS Tissue Classification: A Comparison
Between Normalized Image Reconstruction and RF Signals
Analysis, Proceeding of Progress in Pattern Recognition,
Image Analysis And Applications, pp. 137-146, 2006.
[2] K. L. Caballero, J. Barajas, O. Pujol, O. Rodriguez, and P.
Radava, Using Reconstructed IVUS Images for Coronary
Plaque Classification, Engineering in Medicine and Biology
Society, 29th Annual International Conference of the IEEE,
pp. 2167-2170, 2007.
Figure 3. Result image processed log-compression

(left) and result image processed DDP (right). Its
original image is Figure 2.
- 597 -
P3-25
Pulse Compression Technique for Calibration Curve to Derive Accurate

Temperature Variation in Therapeutic Ultrasound
Su A Lee, Jong Seob Jeong*
Department of Medical Biotechnology, Dongguk University, Seoul 100-715, Republic of Korea
leesua809@dongguk.edu, *jjsspace@dongguk.edu
Abstract
In this study, to obtain precise temperature
distribution by using the relationship between
ultrasound echo shift and temperature variation, a
pulse compression technique was proposed and the
performance was experimentally demonstrated by
comparing with sinusoidal signal.
Keywords: Calibration curve, Chirp, Echo shift, Pulse
compression technique, Temperature estimation.
1. Introduction
For an accurate measure of temperature in
therapeutic ultrasound, a calibration curve derived by
both variations of speed of ultrasound and tissue
expansion has been investigated by using very short
duration pulse. However, it may suffer from attenuation
and distortion of received signals affecting the
sensitivity and location of echoes critical to calculate
the parameters for the calibration curve. To
compensate this problem, a chirp signal with pulse
compression technique was employed for the proper
analysis of calibration curve versus temperature. Also,
a sinusoidal signal was used to evaluate the
performance of the proposed method.
2. Method
A. Pulse Compression Technique
Pulse compression is a signal processing generally
used for improvement of detection performance
without increasing peak transmit power. The
fundamental chirp waveform was designed having a
sweep range from 2 MHz to 8 MHz for 5 s. Note that
time-reversed transmit waveform was used as a
matched filter. Time responses of chirp and pulse
compressed signal are represented in Figure 1.
Figure 1. Time response of Chirp signal before (a) and after

(b) pulse compression.
B. Experimental Setup
5 MHz ultrasound transducer was used for
transmission of the chirp signal. Two baths were used
for measurement of pulse echo signal and heating the
target, respectively. A tissue holder with a rectangular
window was made of plastic, and a liver tissue was cut
down matching with the tissue holder. The target was
degassed first and moved to the holder. Our work was
begun by transferring the specimen from the heating
bath to the measurement bath. Data saving was
immediately done, and it was repetitively conducted at
intervals of 5 C in the range of 25 C ~ 70 C.
The experiment was conducted by using the chirp
signal with pulse compression technique to increase
peak amplitude of the echo signal in the high
temperature range over 50 C. The sinusoidal signal
was employed as a control to evaluate the performance
of the proposed method. The experimental results
about signals propagated through the sliced porcine
liver were illustrated in Figure 2. The peak amplitude
of compressed signal was higher by 16.73 times at 25
C, and 2.71 times at 70 C compared to those of the
one-cycle-sinusoidal signal. In the case of 70 C, the
peak amplitude of the sinusoidal signal was too small
to be measured of its peak location.
- 598 -
ICEIC 2015
Figure 2. Experimental results of pulse-echo ultrasound

signal to compare of amplitudes according to the temperature
rising: With sinusoidal signal at 25 C (a), and 70 C (b), and
with chirp signal at 25 C (c) and 70 C (d).
4. Conclusion
In this study, two types of ultrasound waveforms
including sinusoidal and chirp signal were applied and
their difference was observed conspicuously. When the
pulse compression technique was applied to the
received signal, somewhat high differences in
amplitude between sinusoidal and compressed signal
was observed from 25 C to 70 C. Therefore, the
proposed method has a potential to enhance the
detection ability for generation of calibration curve.
Acknowledgements
This work was supported by Basic Science Research
Program through the National Research Foundation of
Korea (NRF) funded by the Ministry of Education,
Science and Technology (2012R1A1A1044159).
References
[1] U. Techavipoo, T. Varghese, Q. Chen, T. A. Stiles, and G.
R. Frank, Temperature dependence of ultrasonic
propagation speed and attenuation in excised canine tissue
measured using transmitted and reflected pulses, J. Acoust.
Soc. Am.,115, pp. 2859-2865, June 2004.
[2] Remi Souchon, Guillaume Bouchoux, Eva Maciejko,
Cyril Lafon, Dominique Cathignol, Michel Bertrand, and
Jean-Yves Chapelon, Monitoring the formation of thermal
lesions with heat-induced echo-strain imaging: a feasibility
study, Ultrasound in Med. & Biol.,31, pp. 251-259, 2005.
- 599 -
P3-26
A Study of Inversion Layer Ultrasonic Transducers with Different Active

Materials
Jin Ho Sung, Chan Yuk Park, Sung Min Kim, Jong Seob Jeong*
Department of Medical Biotechnology, Dongguk University, Seoul, 100-715, Republic of Korea
madeinjinho@dongguk.edu, *jjsspace@dongguk.edu
Abstract
Recently, a study of ultrasonic transducer with
inversion layer has been widely investigated. Inversion
layer, kind of multi-layer, has inverted domain in an
active material, so both odd-order and even-order
thickness-extensional mode can be simultaneously
excited. Using this characteristics, an ultrasonic
transducer with inversion layer can obtain high
frequency and broad bandwidth. Typically, the study of
inversion layer is usually investigated with single
active material like LiNbO3. Therefore, in this paper,
we evaluated the feasibility of inversion layer
transducer with different active materials by using
FEM (finite element method). PMN-PT and PZT-5H
were used for active material, and the results show that
inversion layer ultrasonic transducer with different
active materials has 12 MHz higher center frequency
and 16 % wider -6 dB fractional bandwidth than
uninverted one.
Keywords: Inversion layer, High-frequency, Broad
bandwidth, FEM
1. Introduction
In medical ultrasound image, image resolution plays
an important role to diagnosis, so high frequency
transducers with broad bandwidth are needed. Since the
inversion layer technique can satisfy both high
frequency and broadband characteristics, using this
technique is in the interest.
The inversion layer technique is one of the multilayer techniques and there are two opposite domain in
single active material. Therefore, when electrical
energy is applied to the active material, the strains of
dominant layer and inverted layer react opposite
direction. Accordingly, an inversion layer is able to
operate even-order thickness mode excitation as well as
odd-order one [1].
There are many researches about the inversion layer

with LiNbO3. By using proper matching and backing
layers, high frequency broadband transducer can be
obtained with the inversion layer [2]. Although many
studies about inversion layer have been investigated,
most studies have been focused on the same active
materials. In this paper, we investigated the feasibility
of inversion layer technique using two different active
materials such as PMN-PT and PZT-5H, and evaluated
the performance by using the FEM (finite element
method).
2. Method
PZFlex (Weidlinger Associates, Los Altos, CA)
software was used to evaluate the performance and
feasibility of the inversion layer with different active
materials. PMN-PT and PZT-5H were used for active
material because those materials are widely used for
broadband ultrasonic transducer. The inversion layer
ratio (t1/t) was 0.3 and we only considered front-side
inversion in this paper where inversion layer transducer
has the broadest bandwidth. t1 is the inversion layer
thickness and t is the total active material thickness.
The simulated total thickness of active layer was 100
m (PZT-5H: 70 m, PMN-PT: 30 m) with 3 mm
diameter. The acoustic impedance of the first and
second matching layers were 7.3 MRayl and 2.59
MRayl, respectively, and a backing layer has 16 MRyal
acoustic impedance. Electrical impedance measurement
and pulse-echo simulation were conducted and the
simulation results of PZT-5H /PMN-PT inversion layer
were compared to PZT-5H/PMN-PT uninverted layer
which has same poling direction.
Figure 1 shows PZT-5H electrical impedance. When
t1/t is 0, there are only odd-order thickness mode
excitation and when t1/t is 0.3, there are even-order
- 600 -
ICEIC 2015
thickness mode excitation as well as odd-order one.
PMN-PT also had same feature.
Table 1. Simulation result of pulse-echo response.
Uninverted Layer
Center
Frequency
[MHz]
20
-6 dB
Bandwidth
[%]
52
Inversion Layer
32
68
PZT-5H/PMN-PT
Layer
4. Conclusion
Figure 1. Electrical impedance of PZT-5H plate

with different thickness of inversion layer.
Figure 2 shows electrical impedance of PZT5H/PMN-PT uninverted and inversion layers. It shows
that inversion layer with different active materials can
also generate inversion layer effect. In the case of
pulse-echo simulation, the inversion layer with
different active materials increased a center frequency
by 12 MHz, and -6 dB bandwidth by 16 % in
comparison with the uninverted layer. The center
frequency and -6 dB bandwidth were summarized in
Table 1.
In this paper, we evaluated the feasibility and

performance of inversion layer using two different
active materials, PZT-5H and PMN-PT. The results
show that the effect of inversion layer also appears in
the different active materials and it effectively
increased the center frequency and -6 dB fractional
bandwidth. Therefore, high frequency broadband
ultrasonic transducer may be obtained with inversion
layer not only using single active material, but also
using different active materials.
Acknowledgements
This work was supported by R&D Program of
ministry of Trade, industry and Energy/Korea
Evaluation institute of industrial Technology (Grant No,
MOTIE/KEIT 10048528, Development of ICT based
Wireless Ultrasound Solution for Point-of-Care
Applications) and the MSIP (Ministry of Science, ICT
and Future Planning), Korea, under the C-ITRC
(Convergence Information Technology Research
Center) support program (NIPA-2014-H0401-14-1002)
Promotion Agency).
References
[1] K. Nakamura, K. Fukazawa, Y. Yamada, and S. Saito,
Broadband ultrasonic transducers using a LiNbO3 plate with
a ferroelectric inversion layer, IEEE Trans. Ultrason.
Ferroelectr. Freq. Control, vol. 50, pp. 1558-1562, Nov.
2003.
[2] Q. F. Zhou, J. Cannata, and K. K. Shung, Design and
modeling of inversion layer ultrasonic transducers using
LiNbO3 single crystal, Proc. of Ultrasonics international
(UI05) and World Congress on Ultrasonics (WCU), vol. 44,
pp. e607-e611, Dec. 2006.
Figure 2. Electrical impedance of PZT-5H/PMN-PT

plate: (solid line) uninverted layer and (dashed line)
inversion layer.
- 601 -
P3-27
Development of a Dementia-screening Application using Urine Test and

Depression Check in a Smartphone
Myeon-gyun Cho
School of Information and Communication, Semyung University, Jecheon, Chung-buk, Korea
Email: mg_cho@semyung.ac.kr
Abstract
Dementia once occurred is known to be mostly
irreversible but can be treated only if it is detected
early. In addition, Dementia can be detected by
albumin level in urine test and predicted by Depression
in the elderly. In this paper we have developed
Dementia screening application (App) using urine-test
strip and Depression checking program in smart phone.
In particular, we present an innovative and still
experimental tool to support screening of Dementia by
means of urine test and depression symptom. If we
tried to forestall, ease and cure Dementia with the
proposed application, the social losses from Dementia
would be minimized as a result.
Keywords: Dementia Screening Application, Urinetest, Smartphone, Depression
1. Introduction
Dementia is a general term for a decline in mental
ability severe enough to interfere with daily life.
Memory loss is an example. Alzheimer's disease and
vascular Dementia are the most common type of
Dementia [1][2]. Lately, Dementia has caused a social
problem due to the rapid expanding of population
aging. However, if it is possible to detect the vascular
dementia in its early stage, the onset and progression of
Dementia could be prevented [3][4].
New study has found that low amounts of albumin
in the urine, strongly predict faster cognitive decline in
older women. Especially, group in which albumin was
detected in urine test revealed that scores of verbal
fluency test has dropped rapidly. Therefore,
incorporating information about albumin along with
kidney function should help clinicians identify patients
at high risk for Dementia [5][6]
Depression is also a common problem in older
adults. Unfortunately, all too many depressed seniors
fail to recognize the symptoms of depression and try to
cure them, but the depression can also occur as part of
medical problems such as Dementia [7][8]. Thus,
Depression in elderly patients, especially late-onset

appears to be a strong predictor of Dementia [9][10].
Since it is difficult to diagnosis Dementia in one
way, we are attempting to increase the accuracy with
adapting diversified methods. Thus, in this paper we
have developed Dementia screening application (App)
using urine-test strip and Depression checking program
in smart phone.
2. Dementia Screening Method

Figure 1 shows the structure of Dementia screening
method which is composed of Depression checking
part and Urine test for chronic-disease part. If we
explain in more detail, Depression checking part
comprise questionnaire, text message check, mobility
monitoring and call frequency check. Meanwhile,
albumin detection, diabetes mellitus check and
hypertension check compose urine test for chronicdisease part. At last, the final DSI(dementia screening
index) is calculated from DI(depression index) and
CI(chronic-disease index). By doing this, we can figure
out the seriousness of Dementia for the old with their
smart-phone, regardless of time and place.
- 602 -
[Fig. 1] Structure of Dementia Screening Method
ICEIC 2015
3. Development of Dementia Screening

Application (App) for Smartphone
3.1 Depression checking Apps for smart-phone [8]
- Questionnaire based on K-BDI (Beck Depression
Inventory) with 21 questions on smart-phone (D 1)
- Text recognition for negative emotion check from
SMS(short message service) and SNS(social
network service: face book) of user(D2)
- Mobility check from GPS in smart-phone (D3)
- Frequency of call check for testing sociality(D4)
[Fig. 3] Urine Test App. for Chronic-disease Index

3.3 Implementation of Dementia Screening Apps
using Urine test and Depression Checking Apps
The final DI is calculated by equation (1),

=
(a1=0.3, a2=0.3, a3=0.2, a4=0.2)
The proposed Dementia screening App is composed

of 2 component Apps (Urine Test and Depression
Check), and these are shown in figure 4.
(1)
and the Depression checking App considering 4

parameters referred in equation(1) is shown at fig 2.
[Fig. 4] Component Apps of Dementia Screening App

CI and DI are deducted by urine test and Depression
checking App respectively. Final DSI (Dementia
screening index) is shown as an equation (3).
[Fig. 2] Depression checking Apps for smart-phone

3.2 Urine Test Apps for Albumin Detection
Urine tests are very useful for providing
information to assist in the diagnosis a wide range of
diseases [11]. Small amounts of albumin in the urine
can strongly predict faster cognitive decline in the
elderly [5][6]. Therefore, urine test also can give some
information about chronic disease such as Diabetes and
Hypertension.
- Urinary albumin-to-creatinine ratio > 5 is a warning
sign for cognitive decline (U1)
- Diabetes mellitus is detected from glucose (U2)
- High blood pressure can be monitored (U3)
The final CI(Chronic disease index) is calculated by
equation (2).
=
(b1=0.7, b2=0.2, b 3=0.1)
(2)
Figure 3 shows the process of checking albumin using

urine test strip and smart-phone.
= F DI + F CI
(F1=0.4, F 2=0.6)
(3)
Table 1: Decision of 3 Screening Stages

DSI value (100)
DSI < 40
40 DSI < 70
70 DSI
Screening stages
Normal stage
Warning stage
Critical stage
According to DSI, the seriousness of Dementia can

be screened by 3 stages as shown in Table 1. We set
threshold values for classifying Dementia stage 40 and
70. However, these parameters can be changed after
clinical trials.
In this paper, we have presented an innovative and
still experimental tool to support screening of
Dementia by means of urine test and depression
checking program. However, the proposed Apps still
need to be revised to enhance accuracy for screening
Dementia, and more elaborated clinical trials should be
performed to guarantee validity of the paper.
- 603 -
ICEIC 2015

This paper presented a novel approach to smartphone as a diagnostic tool for Dementia using Urine
test and Depression check. It has been successfully
implemented on smart-phone with android program
and also registered in play store. Although we didnt
provide rigorous verification for Dementia screening,
the proposed App did help the smart-phone to be a
Dementia-screening method for the elderly.
Current implementation of Apps for the proposed
algorithm opens space for further improvements like
prevention and treatment for Dementia. Beside these
improvements, clinical trials of proposed Apps should
be performed in order to verify the validity of
Dementia Screening as an accurate and appropriate
diagnosis-tool for Alzheimers disease or Dementia.
After performing the clinical trials, weight parameters
such as an, b n and Fn will be optimized.
If we tried to forestall, ease and cure Dementia with
the proposed application, the social losses from
Dementia would be minimized as a result.
[6] S. Tanaka, K. Motoi, M. Nogawa, T. Yamakoshi, K.

Yamakoshi, Feasibility Study of a Urine Glucose Level
Monitor for Home Healthcare Using Near Infrared
Spectroscopy, Engineering in Medicine and Biology Society,
International Conference on, pp. 6001 6003, 2006.
[7] M. Oyama-Higa, Teiijun Miao, J. Tsujino, Akira Imanishi,
"Possibility of mental health self-checks using divergence of
pulse waves, Systems, Man and Cybernetics, ISIC. IEEE
International Conference on., pp. 3952 3960, 2007.
[8] Myeon-gyun Cho, Development of Diagnosis
Application for Depression on Smart-phone, ICEIC 2014,
pp. 557 558, Jan. 2014.
[9] A. F. Jorm, Is depression a risk factor for dementia or
cognitive decline?, Gerontology, Vol. 46, pp. 219-27, 2000.
[10] DAV Espiritu, H Rashid, B.T. Mast, J. Fitzgerald, J.
Steinberg, P.A. Lichetnberg, Depression, cognitive
impairment and function in Alzheimers disease,
International Journal of Geriatr Psychiatry, Vol. 16, pp.
1098-1103, 2001.
[11] Jong-il Hong, Byoung-yong Chang, Development of
the smart phone-based colorimetry for multi-analyte sensing
arrays, Lab on Chip, Vol. 14, pp. 1725 1732, Feb. 2014
5. Acknowledgement
Research Program through the NRF funded by the
Ministry of Education, Science and ICT & Future
Planning (NO. 2012R1A1A1001704)
References
[1] K. H. Lee, C. Y. Kim, S. H. Kim, Diagnosis and
Treatment of Dementia, Journal of the Korean Physical
Therapy Science, Vol. 9, No. 3, pp. 171-178, 2002.
[2] H. Y. Jung, S. G. Kim, Y. H. Jun, Changes in Diagnosis
and Evaluation Method for Dementia : A Literature Review,
Psychiatry of the elderly Vol. 9, No. 2, pp. 94-101, 2005.
[3] J. H. Lee, Treatment of Vascular Dementia, Journal of
Neural Assoc., Vol. 21, No. 5, pp. 445-454, 2003.
[4] G. Waldemar, B. Dubois, and M. Emre,
Recommendations for the diagnosis and management of
Alzheimer's disease and other disorders associated with
dementia: EFNS guideline, European Journal of Neurology,
Vol. 14, No. 1, pp. 126, 2007.
[5]
http://www.eurekalert.org/pub_releases/2010-11/asonpit111010.php., American Society of Nephrology, accessed
Dec 2013.
- 604 -
P3-28
Nondestructive Hybrid Sensing Method Based on Optoacoustic Waves for

Internal Feature Extraction and Interface Analysis
Jae-Ho Han*, Seung-Beom Yu, Chang Shi, and Seungbae Ji
Department of Brain and Cognitive Engineering, Korea University, Seoul, Korea
*
Corresponding author: hanjaeho@korea.ac.kr
Abstract
A nondestructive characterization method is one of
the key issues for evaluating the damage to mechanical
and biomedical materials such as metallic solids and
tissues. In this presentation, we demonstrate a
noninvasive hybrid sensing method based on
optoacoustic wave, which can be applied to target
specimens using a pulse laser and ultrasound detection
in vivo to detect the positions of internal features.
Keywords: Acoustic Signal Processing; Biomedical
Electronics; Characterization; Sensors.
1. Introduction
Nondestructive matter and tissue evaluation
has been a critical issue in industrial and
biomedical applications for identifying specific
features in solid materials and biological tissues
such as internal damage and cancers, respectively.
In addition to ultrasonography and optical
imaging modalities such as diffuse optical
tomography and optical coherence tomography,
optoacoustic imaging can overcome shallow
imaging depth resulting from highly turbid media
as well as low image contrast due to speckle
artifacts [1-4]. Optoacoustic imaging involves the
detection of ultrasonic waves as pressure
converted from thermoelastic expansion by the
absorption of short-pulsed laser beams in the
target object [5-8]. The detection process can
either be performed based on the optical or
electrical domains. For instance, by using the
optical method for detecting ultrasound signals,
there is no issue with contact between the
specimen and the sensor as in traditional
sonography. Therefore, a minimally invasive
depth-resolved cross-sectional image with

excellent contrast and resolution, in addition to
scalable imaging depth and without speckle
artifact can be obtained using optoacoustic
imaging [9-12]. In this work, we will present the
optoacoustic method as an emerging modality for
future use in brain-computer interfaces.
2. Experiment
A Q-switched pulsed laser based on Nd-YAG
with a variable repetition rate was employed in
this experiment as an illuminating light source.
The beam size had been reshaped to a point
source for excitation of the target where the laser
irradiation pulse energy was kept at
approximately a couple of mJ to prevent ablation
of the sample and to satisfy the related exposure
regulation. Instead of sensing the ultrasonic signal
generated by the transformation of heat or
thermal expansion due to the absorption of light
in the specimen, an optical interferometer was
used as a receiver so that the internal features or
displacement characteristics could be acquired in
an optical method without introducing bulky
conventional piezoelectric transducer components.
Thus, robust optical instrumentation is possible in
the design and alignment of tools for measuring
acoustic waves. Besides, integration with imaging
optics is also feasible for multi-modality
biomedical imaging such as optical coherence
tomography where the same type of Michelson
interferometer is utilized. Preliminary results are
shown in Fig. 1 where a sample structure with a
semi-solid gel is used as an optoacoustic phantom
matter to mimic biological tissue. Fig. 1(a) shows
- 605 -
ICEIC 2015
the photograph of the sample phantom used and

Fig. 1(b) is the amplified signal results where the
two peaks indicate the reference and the surface
of the target sample, respectively. Considering the
speed of the acoustic wave, the corresponding
distance of ~31 mm agrees well with the designed
dimension between the reference and the target
gap where the measured errors have fundamental
resolution in the tens of micrometers.
3. Conclusion
In summary, we have demonstrated a novel
nondestructive optoacoustic method that is a
hybrid sensing modality utilizing the merits of
optics and ultrasound to characterize materials.
As has been experimentally proven, we can
precisely determine the gap or displacement in
specimens using the proposed method. This
emerging modality of sensing and imaging can be
applied to both industry and biomedicine for
future use.
Acknowledgement
This work was supported by Samsung Research
Funding Center of Samsung Electronics under Project
Number SRFC-IT1301-02. Correspondence and
requests for materials should be addressed to Prof. JaeHo Han.
References
[1] S. Jiao, M. Jiang, J. Hu, A. Fawzi, Q. Zhou, K. K.
Shung, C. A. Puliafito, and H. F. Zhang,
Photoacoustic ophthalmoscopy for in vivo retinal
imaging, Opt. Express, vol. 18, no. 4, pp. 3967-3972,
2010.
[2] C. Li and L. V. Wang, Photoacoustic tomography
and sensing in biomedicine, Phys. Med. Biol., vol. 54,
pp. R59-R97, 2009.
[3] W. Wei, X. Li, Q. Zhou, K. K. Shung, Z. Chen,
Integrated ultrasound and photoacoustic probe for coregistered intravascular imaging, J. Biomed. Opt., vol.
16, 106001, 2011.
[4] X. L. Den-Ben and D. Razansky, Adding fifth
dimension to optoacoustic imaging: volumetric timeresolved spectrally enriched tomography, Light: Sci.
Appl., vol. 3, e137, 2014.
(a)
(b)
Fig.1 Results of optoacoustic sensing obtained from
a phantom: (a) photograph of the specimen; (b)
measured positions of the targets.
[5] G. E. Santagati and T. Melodia, Opto-ultrasonic
communications
for
wireless
intra-body
nanonetworks, Nano Commun. Netw., vol. 5, pp. 3-14,
2014.
[6] X. L. Den-Ben and D. Razansky, Functional
optoacoustic human angiography with handheld video
rate three dimensional scanner, Photoacoustics, vol. 1,
pp. 68-73, 2013.
[7] L. Nie, Z. Guo, L. V. Wang, Photoacoustic
tomography of monkey brain using virtual point
ultrasonic transducers, J. Biomed. Opt., vol. 16,
076005, 2011.
[8] C. Zhang, C. Li, L. V. Wang, Fast and Robust
Deconvolution-Based Image Reconstruction for
Photoacoustic Tomography in Circular Geometry:
Experimental Validation, IEEE Photon. J., vol. 2, pp.
57-66, 2010.
[9] G. S. Filonov, A. Krumholz, J. Xia, J. Yao, L. V.
Wang, and V. V. Verkhusha, Deep-Tissue
Photoacoustic Tomography of a Genetically Encoded
Near-Infrared Fluoresecnt Probe, Angew. Chem. Int.
Ed., vol. 51, pp. 1448-1451, 2012.
[10] D. Razansky, A. Buehler, and V. Ntziachristos,
Volumetric real-time multispectral optoacoustic
tomography of biomarkers, Nat. Protoc., vol. 6, pp.
1121-1129, 2011.
[11] L. Vionnet, J. Gateau, M. Schwarz, A. Buehler, V.
Ermolayev, and V. Ntziachristos, 24-MHz Scanner for
Optoacoustic Imaging of Skin and Burn, IEEE Trans.
Med. Imag., vol. 33, pp. 535-545, 2014.
[12] B. Wang, L. Xiang, M. S. Jiang, J. Yang, Q.
Zhang, P. R. Carney, and H. Jiang, Photoacoustic
tomography system for noninvasive real-time threedimensional imaging of epilepsy, Biomed. Opt.
Express, vol. 3, pp. 1427-1432, 2012.
- 606 -
P3-29
Automatic Flower Image Segmentation Using Color Similarity and Watershed

Algorithm in Natural Background Image
Hosung Lee, Hyo-Haeng Lee, Kwang-Seok Hong
College of Information and Communication, Sungkyunkwan University, Suwon 440-746, South Korea
eho723@skku.edu, hyohaeng@skku.edu, kshong@skku.ac.kr
Abstract
In this paper, we propose a flower image segmentation algorithm which is based on the watershed
algorithm and color similarity. The segmentation
algorithm selects the initial markers, without the need
for the user to perform any drawing. To automatically
select the initial markers, Automatic seed selection and
color similarity are used. Automatic seed selection is
used to find marker candidates, while color similarity
is used to select the initial marker within the marker
candidates. A segmentation experiment was conducted
with a flower dataset containing 81 different flower
species with 56 images per category. The result of the
experiment showed that, using the proposed method,
the flower image segmentation rate was 75.41%, which
is 3.22% higher than when using a fixed marker.
flow chart of the proposed algorithm. First, the seeds

which will be used as marker are detected from the
input image using Automatic seed selection [2]. In
these seeds, the base background marker and base
object marker are chosen. We then find the seeds that
have a similar color to that of each base marker. The
similar colored seeds are then included in the marker.
These markers are used for the watershed algorithm.
Keywords: Segmentation, Flower, Watershed, HSI.
1. Introduction
Most flower segmentation algorithms need a
training process [1] from the image set or pointing part
of the object and background for detecting a flower
from a natural background. However this process is
inconvenient for the user. This paper proposes a flower
image segmentation algorithm which uses color
similarity to address this inconvenience. The proposed
algorithm utilizes the fact that a flower usually has an
obtrusive color. Using the difference between the
flower object color and the background color, it detects
the flower object from the background. In addition the
proposed algorithm works automatically without the
need for any training or pointing by the user.
2. Segmentation algorithm
Fig. 1 Flow chart of proposed algorithm

In the base marker selection, the base background
marker is the largest seed and include most of the outer
line pixels. The base object marker is the nearest seed
from the center.
In the marker extension, the color distance is
calculated for selecting the seeds that have a similar
color. The color distance is calculated using the HSI
color model. The HSI color model has a cylindrical
coordinate system. The color distance D12 between
color1 and color2 is then calculated using Eq. 1.
The proposed algorithm selects a background

marker and object marker using distance in the HueSaturation-Intensity(HSI) color model. Fig. 1 shows a
- 607 -
D12 ( S1 cos( H 1 ) S 2 cos( H 2 )) 2

( S1 sin( H 1 ) S 2 sin( H 2 )) 2 ( I 1 I 2 ) 2
(1)
ICEIC 2015
The distance D12 changes with the range of H, S and

I value. We need to fix the range for the fixed value of
D12. In this paper, we refer Chao-Yu and Shen-Chuan
[3] and a number of experiments using flower images.
The results show that, the range [H(0~360), S(0~6).
I(0~5)] is similar to that for a human' eye, and we thus
use this range for the experiment in this study.
Fig. 2 Original image
In this study, we experimented with a flower dataset
that contains 81 different flower species with 56 images
per category using the proposed algorithm. For
comparison of performance, we also used fixed
markers which are drawn mostly from the outer part of
a image and in the middle of the image. In Fig 3(a), the
rectangle outline is the background marker and the
circle is the object marker.
Parts of the experiment image are shown in, Figs.
2~4. Fig. 2 shows the original image for the input,
while Fig. 3 shows the fixed markers and output image
using the markers. Fig. 4 shows each markers selecting
process and output image using the proposed algorithm.
(a)
(b)
Fig. 3 (a) Fixed markers (b) Output image
(a)
Table 1: Result of experiment
Detection rate
(detect / total)
Proposed
algorithm
75.42%
(3421/4536)
(b)
(c)
(d)
Fig. 4 (a) Detected seeds (b) Base markers
(c) Extended markers (d) Output image
Using fixed
markers
72.20%
(3275/4536)
Acknowledgments
The result of the experiment shows that, using the

proposed method, the flower image segmentation rate
was 75.41%, which is 3.22% higher than when using
the fixed markers.
4. Conclusion
In this paper, we proposed a Flower image
segmentation algorithm based on color similarity which
can segment a flower without the need for training or
additional information from the user. The result of the
experiment using the proposed algorithm shows that
higher performance can be achieved than that using the
watershed algorithm that uses fixed markers. However,
in some cases in which the flower and background have
a similar color or the flower has more than two colors,
the detection rate is low. Another process which the
number of colors of the flower.

MOE(NRF-2010-0020210) and Basic Science Research Program through the National Research Foundation
of Korea (NRF) funded by the Ministry of Education,
Scienceand Technology (2014023704)
References
[1] Y. Chai, V. Lempitsky, and A. Zisserman, "Bicos: A bilevel co-segmentation method for image classification", In
Proc. ICCV, Nov. 2011.
[2] F. Y. Shih, and S. Cheng, "Automatic seeded region
growing for color image segmentation", Image Vis.
Computing, vol. 23, Issue 10, pp. 877-886. Sep. 2005.
[3] Chao-Yu Chi, and Shen-Chuan Tai, "Perceptual Color
Contrast based Watershed for Color Image Segmentation",
In: systems, man and cybernetics, 2006, SMC'06. IEEE
International Conference on, vol. 4, pp. 3548-3553. Oct.
2006.
- 608 -
P3-30
Copy-Rotate-Move Detection Using Compensation of Pixel Shift by Rotation

Jong Ju Jeon, Sang Ho Park, and Il Kyu Eom
Image Signal Processing Lab., Dept. of Electronics Engineering, Pusan National University
{triplej, propia, ikeom}@pusan.ac.kr
Abstract
rotation by
In this paper, we present a new copy-rotate-move

forgery detection method using the compensation of
the shifted pixel points due to rotation. Our method
generate various versions of a suspicious image using
rotating angles and pixel shifts. Jaccard similarity is
used to match the copied regions. Experimental
simulation shows that our proposed method is good to
detect the copy-rotate-moved regions.
Keywords: copy-rotate-move forgery, compensation
of pixel shift, Jaccard similarity.
1. Introduction
These days, digital image processing techniques has
been developed dramatically. Therefore, even nonspecialist can easily manipulate image using common
image editing tool such as Photoshop. For this reason,
the image authentication has become an important
issue to prevent from misusing maliciously forged
images. One of the popular image manipulation
method is a copy-move forgery. In this forging method,
a part of an image is copied and is pasted to the other
part of the same image. The copied part is generally
rescaled or rotated before paste operation. This fact
makes it difficult to detect the forged regions.
Recent researches for detecting the copy-move
forgery focus on the rotating pasted regions [1-3]. A
copy-rotate-move detection method using the Zernike
moments was presented in 2013[1]. This method
requires various rotation-invariant transforms that can
increase the computational complexity. Davarzani et al.
reported a copy-move forgery detection using
multiresolution local binary patterns [2]. However, this
algorithm showed low copy-rotate-move rates. A
clustering based approach for detecting copy-rotatemove forgery was proposed using scale invariant
feature transform (SIFT) [3]. This method requires
high computational cost.
In this paper, we introduce a new copy-rotate-move
detection scheme using the compensation of the shifted
Fig. 1. Pixel position shift due to a rotation

pixel points due to rotation. Our method is simple and
generates good detection results.
This paper is organized as follows. In section 2, the
proposed method is described. Experimental results are
presented in section 3. Finally, concluding is described
in section 4.
2. Proposed method
For digital images, a rotation operation causes
spatial location shifts of pixels shown in Fig. 1. Let
be a pixel value at a location
. It can be
changed its value as
and shifted its location as
by rotation.
and
is shifted position and position, respectively. The
shifted position is ranged by
.
This effect makes it difficult to detect the rotated
blocks.
In this paper, we generate various rotated and
shifting compensated images to detection copy-rotatemoved blocks of an image. For a given suspicious
image , we obtain rotated images according to the
rotation angle . That is,
(1)
where
is a rotated version of ,
is an angle
segment, and is the number of rotated images. For
each , we generate
shift compensated images as
follows.
- 609 -
ICEIC 2015
Fig. 2. Top: Forged image with rotation angle (b) 0 (c) 10 (d) 30 (e) 45 (f) 90, Middle: detection results
using SIFT-based method [3], Bottom: detection results using the proposed method.
(2)
where
and
is uniformly quantized value of
and
. In this paper, we set a quantization
level as . Therefore,
shift compensated images are
generated. Finally, for a given image , totally
images are obtained to detect copy-rotate-move blocks.
To find copy-rotate-moved points, we define two
matching index
and
. If a
,
pixel
assumed to be moved to
then both
and
is set to 1.
Otherwise, both
and
is set to
0. The values of
and
are
obtained by using Jaccard similarity. It is a statistic
used for comparing the similarity and diversity of
sample sets. The Jaccard similarity between finite
sample sets, and is defined as the size of the
intersection divided by the size of the union of the
sample sets as follows.
,
(3)
where and
is a overlapped
block of and
, respectively. In this paper, we determine two blocks
are matched when
. That is, if
seven pixels of nine pixels are equal, the pixel is
considered to be moved. As the last step, we choose
the one of the pair of
and
with the maximum matching points.
To verify our proposed method, we generate 16
copy-rotate-move forged images with different rotation
angles. For obtaining , we use
. This means
that totally, 72 rotated images are calculated to find

forged region. And we set
. Finally,
images are generated to estimate copy-rotate-moved
blocks.
Fig. 2 shows the copy-rotate-move forgery
detection results using existing SIFT-based method [3]
and our proposed method. As shown in Fig. 2, SIFTbased method detect a little points for copy-rotatemoved block. On the other hand, our method can
exactly detect forged blocks.
4. Conclusion
In this paper, we introduced a new copy-rotatemove forgery detection method using the
compensation of the shifted pixel locations due to
rotation. Our method showed good detection results.
The demerit of the proposed algorithm is that the
computational cost is high due to various versions of a
suspicious image. Our next step is to reduce
computational cost.
References
[1] S. J. Ryu, M. Kirchner, M. J. Lee, and H. K. Lee,
"Rotation invariant localization of duplicated image
regions based on Zernike moments",
IEEE
Transactions on Information Forensics and Security,
vol. 8, no. 8, pp. 1355-1370, 2013.
[2] R. Davarzani, K. Yaghmaie, S. Mozaffari , and M.
Tapak, "Copy-move forgery detection using
multiresolution local binary patterns", Forensic
Science International, vol. 231, pp. 6172, 2013.
[3] Amerini, Irene, et al., "Copy-move forgery
detection and localization by means of robust
clustering with J-Linkage", Signal Processing: Image
Communication, vol. 28, no. 6, pp. 659-669, 2013.
- 610 -
P3-31
Detection of Leukocyte Motions in a Microvessel

Eung-Kyeu Kim*, Hoon-Kyeu Lee
Dept. Of Infor. and Commu. Eng., Hanbat Natl University*, Trismed Co., Ltd
kimeung@gmail.com*, trismed@kornet.net
Abstract
In this paper, we propose a detection method of the
leukocyte motions in a microvessel by using the spatiotemporal images. The motions of leukocytes that
adhere to blood vessel walls can be visualized as they
move along the blood vessel wall contours in images.
We use the constraint that the leukocytes move along
the blood vessel contours to generate a spatiotemporal
image, and the leukocyte motions are detected by using
the methods of spatiotemporal image analysis. A result
of experiments, the proposed method can stably detect
the leukocyte motions even when multiple leukocyte
traces intersect each other.
Keywords: Leukocyte, Microvessel, Spatiotemporal
image, Spatial axis
1. Introduction
One of the important areas in computer vision is the
feature detection. Many researchers have done a great
deal of efforts to solve this problem like the detection
of leukocytes particularly[1]. Also, dynamic analysis
of the behaviours of blood cells and blood vessels is
one of the very important topics in the physiology
research field. In order to study the flow dynamics of
leukocytes and the interaction of leukocytes and blood
vessel walls it is necessary to measure the velocity and
the flux of leukocytes[2,3]. However, in the
conventional research, such measurement methods
have been performed manually like counting the
number of video frames. Therefore, the accuracy of the
measurement and the amount of data to be collected
have been limited. The aim of this research is
especially to detect the motions of leukocytes that
adhere to a microvessel walls. Although several image
processing systems have been developed for the
measurement of erythrocyte velocity, platelet adhesion,
and arteriolar vasomotion[4], these systems use simple
image processing techniques such as differential
operation, frame subtraction, and edge detection.
The motions of leukocytes that adhere to blood

vessel walls can be visualized as they move along the
blood vessel wall contours in a sequence of images.
Here, we use the constraint that the leukocytes move
along blood vessel wall contours to generate a spatiotemporal image and then detect the motions of
leukocytes by the methods of spatiotemporal image
analysis[5,6].
2. Detection of a blood vessel Region

Fig. 1 shows a frame of the microscopic image of a
rat mesentery microvessel with moving leukocytes.
The image size is 400200 pixels. The frame interval
of the sequence of images is 1/30 sec. The sequence of
images consists of 100 frames. It is not easy to find
leukocytes from only one frame, whereas we can
observe the motions of leukocytes that adhere to
microvessel walls from continuous video images.
Fig. 1. The 31th frame of microscopic image of microvessel
The constraint that we use for the detection of a

blood vessel region is that blood cells are flowing continuously in a blood vessel region while other regions
remain stationary. So, the time variance of the gray
level tends to be large in the blood vessel region and
small in other regions.
The time variance image,
is defined as
.
Where,
and
is
frame of the sequence of images,
( )
. We try to detect a
blood vessel region[7] by simply thresholding the time
variance image,
. Fig. 2 shows the detection
result of a blood vessel region.
- 611 -
ICEIC 2015
The output image of the orientation-selective filter
was thresholded and skeletonized. We experimented by
using three different threshold values. We show the
result images of thresholding and skeletonizing in the
(a) series and (b) series of Fig. (7) through Fig. (9), respectively.
Fig. 2. Detection of a blood vessel region
Fig. 3 shows examples of generated spatiotemporal
images. The horizontal axis is the spatial axis.
Fig. 3(a). Spatiotemporal image Fig. 3(b). Spatiotemporal image

that spatial axis is near
that spatial axis is a
a blood vessel wall
little far from a blood
contour
vessel wall contour
Fig. 7. Detection of candidate segments of leukocyte

traces when threshold at 500 including 100
4. Conclusions
Fig. 3. Generated spatiotemporal images

In fig. 3(a), there are three leukocyte traces. Two of
them cross each other. As the approach method to this
problem, First, we detect curve segments which may
have come from leukocyte traces. Second, we select
and group the detected segments in order to isolate and
detect an individual leukocyte trace and then use the
orientation-selective filter to enhance the leukocyte
traces. One of the most well known filters for this
purpose is the Laplacian of Gaussian filter[8].
Fig. 5 shows the spatiotemporal image after the
orientation-selective filtering.
Fig. 6 shows the output image of the conventional
filters, that is, the output results of Laplacian of
Gaussian and directional second derivative of Gaussian
filters. The width of this filter was 8 pixels.
We proposed a detection method of the leukocyte

motions in a microvessel by using the spatiotemporal
images. The motions of leukocytes that adhere to blood
vessel walls can be visualized as they move along the
blood vessel wall contours in images. We use the
constraint that the leukocytes move along the blood
vessel contours to generate a spatiotemporal image,
and the leukocyte motions are detected by using the
methods of spatiotemporal image analysis. A result of
experiments, the proposed method could stably detect
the leukocyte motions even when multiple leukocyte
traces intersect each other.
References
[3] H. Komatsu, A. Koo, and P. H. Guth, Leukocyte
flow dynamics in the rat liver microcirculation,
Microvascular Research, Vol.19, pp.45-70, 1990.
Fig. 5. Spatiotemporal image after orientation-selective

filtering
Fig. 6. Output results of Laplacian of Gaussian and

directional second derivative of Gaussian
[4] S. Wolf, O. Arend, H. Toonen, B. Bertram, F. Jung, and

M. Reim, Retinal capillary blood flow measurement
with a scanning laser ophthalmoscope , ophthalmology,
Vol.98, No.6, pp.996-1000, 1991.
[5] Eung-Kyeu Kim, Jae-Won Lim, Automatic Detection
Method of
Leukocyte Motions, IEEK Summer
Conference 2013, Vol.36, No.1, pp.754-756, 2013.
[6] Eung-Kyeu Kim, Hoon-Kyeu Lee, Spatiotemporal
Image Generation Method for Measuring Leukocyte
Motion, IEEK Fall Conference 2013, pp.577-579, 2013.
[8] Eung-Kyeu Kim, Extraction and Complement of
Hexagonal Borders in Corneal Endothelial Cell Images,
The Journal of the IEEK, Vol.50, No.3, March 2013.
- 612 -
P3-32

&%&$" !#$

, &
& &
*
$+%!
*2-
-!,*& ''
- *
$3%! 4 " ' *
* ! ,
- *
&**&*!

&$"%!#
'
& !()
* '
* - $+%! ,
-
!
. '*
*/&-0
/*$1%!.
*& '
&&
* 2 -
* ' $3%!
* - ' *& /
. ! * '
!** '**
.
* ! ,
.-

"$

#

'( %( ( ) ) & *

)+%% , %&% ))
)& ) * % )
& *
% ) - & *
) %( %( ( ) ) '
) %( % )
% - %&% ) *
& ) .& , *
%&% , %%, )) - & %(
% * ) ))
* & * & ))
)&) )-)& %

* ' ' '

*!

!!! !!!

4!"*

, * 567*8
-5"8!

5"8

9 ' -* -

! 9 '
58 ! 4 +
'&! ,
3.!
- 613 -
ICEIC 2015
%

%

'%

&%

4!+:58". 58+. 58

1. 583.
* '

- * 2!
2
! , 2-
* *
2!** '&**
. ' &
-
* 2
!,**-
&* ** *
& &! '
***-**
.*!

//&/'0%
4!1 *-*'!,
*-*&
!,*.-*'
.-*
!

(&) (') (-)
(*) () ()
(&) (') (-)
(&) (') (-)

(+) (,) (.)
0
0
//&/'0%
//&/'0%
//&/'0%
//&/'0%
!!!
//&/'0%
//&/'0%
!!!
(*) () ()
(*) () ()
(&) (') (-)
(&) (') (-)
(+) (,) (.)
!!!
!!!
!!!
!!!
//&/'0%
//&/'0%
//&/'0%
//&/'0%
'0%
!!!
(*) () ()
(*) () ()
3
(&) (') (-)
(+) (,) (.)
(&2 ')0%
(2 ')0%
2
(*) () ()
3
3
(+) (,) (.)
//&/'0%
(+) (,) (.)
&0%
(2 )0%
(&) (') (-)
//&/'0%
//&/'0%
!!!
0
(&) (') (-)
0%
(*) () ()

(+) (,) (.)
//&/'0%
(*) () ()
2
//&/'0%
(2 )0%
(+) (,) (.)
0%
(*) () ()

(+) (,) (.)
(&) (') (-)

(+) (,) (.)
//&/'0%
(&) (') (-)
(*) () ()
2
(+) (,) (.)
(*) () ()
2
(&) (') (-)
0%
0%
(*) () ()
3
/0%
(+) (,) (.)
4!1
*-*
(&) (') (-)

(+) (,) (.)
4!3# .-*!
43' *
.-* ! 4 3 ' & 3

'*&+
' +
'- '*&1
!;.
- ! ,
*2-5685+8!
5
,''**-<
,-&*5"==3"?>@8
- -'A-5 A 8!

$"% * ! B<&- , #
; )
&!? ? **!33".3?? +="+!

$+%( ! !:B;*
* ) AAA

5+8
*(; +=="

$1%
' 4! : B<. / **)

<EE;F (!"D518 **!+=C.+"+ "@D3!
&4

# **
$3% F!!9! G B< <0 ;
*&*!<
) *; +==C!
- 614 -
P3-33
Stretchy Multivariate Polynomial Regression

Kar-Ann Toh
School of Electrical and Electronic Engineering
Yonsei University, Seoul, Korea 120-749
Email: katoh@yonsei.ac.kr
AbstractThis paper proposes a novel solution for stretchy
regression learning. The solution comes in primal and dual closedforms similar to that of least squares and least norm regression.
Essentially, the proposed solution stretches the covariance computation by a power term thereby compresses or amplies the
estimation. Our empirical evidences on both synthetic data and
real-world data show effectiveness of the proposed method for
stretcheable learning.

1
Theorem 1: Suppose (PT ) k1 P is of full rank, then
for all k > 1 and under the limiting case of 0,

1
1
1
= (PT ) k1 P
(PT ) k1 y
(2)
is the global minimizer of
min y Pkk .
(3)
I.
I NTRODUCTION
The Weierstrasss approximation theory states that polynomials can approximate any continuous function on a closed
and bounded interval to any degree of accuracy. However,
on top of the commonly encountered heavy computational
requirement, the large number of polynomial expansion terms
arising from high dimensional systems and high model orders
often gives rise to an under-determined system when the
number of training samples is small [2].
In this work, we attempt to handle the resulting over- and
under-determined systems through coefcient stretching [3]. A
novel solution in primal and dual closed-forms are proposed
to stretch the regression beyond existing frameworks. Our
contributions of this work include: (i) proposal of a smooth
and closed-form stretchy regression for stretcheable learning;
and (ii) proposal of an input transformation to facilitate
computation of power roots which further stretches possible
compressive learning.
II.
P ROPOSED C OMPRESSED R EGRESSION
Consider a real k > 0 dened on a modied p-norm (in

a loose sense) when the absolute operator for each parameter
i is replaced by a differentiable function f (i ):
k :=
D
1/k
f (i )k
(1)
i=0

where f (i ) = + i2 + , > 0.
In order to stretch the learning parameters beyond existing
2 -norm, we seek to minimize y Pkk with respect to
with the hope of possible sparsity when k 1. We will need
the following notations for our subsequent development.
Denote the Hadamard product between vectors a Rp
and b Rp as a b. Also, by denoting the elementwise
operation using , we write respectively the elementwise
power of matrix/vector as Ak /bk and the elementwise
partial derivative of a wrt b as a/b. We are now ready to
derive a deterministic solution for the minimization problem.
Proof:

k/4

k/4 T
Let e := [ (y1 pT1 )2 +
, ..., (ym pTm )2 +
] ,
then we can write y Pk = (eT e)1/k and
y Pkk = eT e.
Take the rst derivative of the cost function y Pkk
and set it to zero gives:
T
e e = 0

k2 1
= 0.
kPT (y P) (y P)2 +
Under the limiting case of 0, we have
PT (y P)
k 1
0.
Taking element-wise power 1/(k 1) on both sides of the

above equation gives
1
T k1

P
(y P) s = 0
(4)
where s is a scaling factor. Finally with some algebraic
manipulation we have

1
1
1
= (PT ) k1 P
(PT ) k1 y.
(5)
The global optimality comes from the convexity of yPkk
for k > 1. Hence the result.

Next, we proceed to convert the above solution in the
primal space to its dual form. Based on the matrix identity
(I + AB)1 A = A(I + BA)1 for scalar 0 and by
1
putting A = (PT ) k1 and B = P, the solution (5) under
primal space can be re-written in its dual space as

1
1
1
= (PT ) k1 P(PT ) k1
y.
(6)
In our experiments, we shall adopt (6) when dealing with
under-determined systems and shall adopt (5) when dealing
with over-determined systems.
- 615 -
ICEIC 2015
A. First Quadrant Transformation
B. Dexter data
Consider a stacked set of raw training input data given

by X with its rows and columns denoted by xi and xj
respectively. A standardization is rst performed for each data
column by a z-score normalization based on the statistics of
training set (xj and xj ):
The dexter data set to be experimented here is taken

from the NIPS 2003 feature selection challenge. Although
the challenge was ended in December 2003, the data sets
are nevertheless available for benchmarking with the test set
withheld by the organizer. The user is given only a training set
and a validation set, each containing 300 samples. The input
dimension for the data is 20,000. Since a polynomial expansion
is way beyond our currently available computing platform,
we use a linear model with intercept in this experiment. The
parameters (a = 0.2, b = 0 and q = 1.3) are chosen
empirically for this feasibility study.
xj = (xj xj )/xj , j = 1, ..., d.
(7)
Then, an exponential function is adopted to map the standard = exp(axj + bj ).

ized data into the rst quadrant using x
Here, we note that the exponential transformation serves
two purposes: rst quadrant transformation and data warping.
The main reason for rst quadrant transformation is to handle
the power term (k) smaller than 2 where complex number
arises in the proposed stretchy regression. The data warping
mechanism twists the original data such that large values
are differentiated far more than small values or vice versa.
This twisting further stretches (or compresses) the relative
difference among the input variables on top of the stretchy
regression.
dexter
1.4
Estimated values of weight coefficients
III.
Fig. 3 shows the estimated coefcients which are sorted

according to their magnitudes. This estimation gives a 6%
validation error with AU C = 98.52%. When only the top 10%
of largest coefcients are used for estimation, the validation
error is 6.33% with AU C = 98.13%. This example shows the
feasibility of using the proposed stretchy regression for feature
extraction.
E XPERIMENTS
1.2
1
0.8
0.6
0.4
0.2
0
0.2
0.4
0
A. Synthetic Data
0.5
1.5
Sorted weight coefficient index
2
4
x 10
Fig. 3. Linear model: estimated coefcient values versus ordered parameters

for dexter data.
In order to understand the stretching capability as well as

the underlying decision boundary of the proposed method, a
synthetic data example is studied in this section. This example
consists of data with four training samples with overlapping
class distribution. We believe this example represents fundamental components of physical data distribution to help our
study.
IV.
C ONCLUSION
A regression which stretched beyond existing frameworks

was proposed in this paper. Essentially, an analytical closedform estimation solution with feature warping capability was
derived in primal and dual forms analogous to that of ridge
regression. Since the solution is operated upon positive and
real input values, an exponential transformation was proposed
to convert the inputs to the rst quadrant of real axes. Our
experiments show effectiveness of the proposed method in
compressive regression.
Fig. 1 shows the decision boundary plots of a 3rd-order

polynomial model learned at k = 1.2. Fig. 2 show the variation
of learned polynomial coefcients ( = [0 , ..., 9 ]) for the
3rd-order system corresponding to different k values. These
results show convergence to sparse solution when k 1.
ACKNOWLEDGMENT
Class1 data
Class2 data
Stretchy Polynomial (3rdorder)
The author is grateful to Professor Lei Sun and Professor

Zhiping Lin for their very motivating and helpful discussions to rene this research. This research was supported
by Basic Science Research Program through the National
Research Foundation of Korea (NRF) funded by the Ministry
of Education, Science and Technology (Grant number: NRF2012R1A1A2042428).
0.25
0.2
0.15
0.1
0.05
0.05
0.1
0.15
0.2
0.25
0.3
Fig. 1. Decision boundaries (at threshold levels {1, 0.5, 0, 0.5, 1}) of a
3rd-order polynomial model learned from 4 overlapping data points at different
k = 1.2
R EFERENCES
[1]
order=3, datasize=4
100
Estimated values of polynomial coefficients
:1
:x
0
1
[2]
2:x2
100
:x
:x2
:x2
3
4
5
200
:x2x
:x
:x3
:x3
6
7
8
300
1
1
x2
1
2
[3]
400
500
1.75
1.5
k value
1.3
Fig. 2.
Estimated coefcient values versus
(k {2, 1.75, 1.5, 1.3, 1.15}) based on 4 training data samples
1.15
value
- 616 -
W. R. Wade, An Introduction to Analysis, 2nd ed. Upper Saddle River,

NJ: Prentice Hall, 2000.
K.-A. Toh, Q.-L. Tran, and D. Srinivasan, Benchmarking a reduced
multivariate polynomial pattern classier, IEEE Trans. Pattern Analysis
and Machine Intelligence, vol. 26, no. 6, pp. 740755, 2004.
T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical
Learning: Data Mining, Inference, and Prediction. Canada: Springer,
2001.
ICEIC 2015

Poster Session
PS-4
Telecommunications
P4-01
A Study on Capacity Enhancement Factors in Ultra Dense Networks

ByungCheol Lee, Hoon Kim*
Incheon National University
{LEE_BC, hoon}@incheon.ac.kr
Chanho Yoon
Electronics and Telecommunications
Research Institute
chyoon@etri.re.kr
Abstract
With a huge and rapid growth of wireless traffic
along with the tremendous spreading of smart-phone
usage and the generalization of internet services,
future wireless networks are facing a challenge to
achieve thousand times of capacity enhancement.
Enhancing the wireless network capacity up to
thousand times order will be achievable through some
of potential next generation network technologies
including ultra dense network(UDN). This paper
addresses some fundamental issues on the capacity
enhancement in UDN. The capacity enhancement
factors for UDN will be introduced, while their
impacts on the system capacity or user data rates and
some of related approaches are tentatively addressed.
Keywords: future network, ultra dense network,
capacity enhancement factor, areal capacity
1. Introduction
Fig. 1 5G requirements (METIS) [4]
network capacity up to thousand times with a huge

number of connected devices in a dense area will be
achievable through some of potential next generation
network technologies. UDN is being regarded as a key
potential approach to achieve capacity improvement,
and this work addresses the basic concept and some
factor regarding the capacity enhancement.
2. UDN
The communication network and service

environment of 2020 will be infinitely richer and more
complex than that of today with a huge and rapid
growth of wireless traffic [1]. For the new era of
wireless environments, appropriate novel network
requirements, technologies and architectures are
expected to be introduced. 5G Infrastructure PublicPrivate Partnership (5G PPP) which is one of the
initiatives for the next generation wireless network
development has addressed high level key performance
indicators (KPI's) such as providing 1000 times higher
wireless area capacity, saving up to 90% of energy, and
facilitating dense deployments to connect over 7
trillion devices serving over 7 billion people.
Meanwhile, ITU-R WP5D initial studies developed
potential KPIs including maximum/user throughput,
transmission delay, mobility, number of connections,
energy efficiency, and areal capacity for the next
generation wireless networks. Enhancing the wireless
UDN basically considers a network environment

where a huge number of traffics or nodes exists in a
small region and also implies the network architecture
or the corresponding technologies to achieve the
capacity enhancement for the environment. A 5G
targeted project, named mobile and wireless
communications enablers for twenty-twenty (2020)
information society (MEITS) has addressed the key 5G
requirements as shown in Fig. 1, where UDN is
considered as one of key technical approaches for the
objectives of data rates, capacity, etc.
Fig. 2 indicates the change of the required system
capacity as the network density grows in the future
wireless networks [5]. It is emphasized that the
satisfaction of per-user rate demand is getting more
important in the dense wireless network. To achieve
the target capacity enhancement of 5G in terms of
system capacity, per-user rate, and so on, there can be
- 618 -
ICEIC 2015
some related factors, introduced in the next section.
capacity enhancement in the next generation wireless

networks. Basically more than 10 times of capacity
improvement can be achieved by the bandwidth
extension and cell splitting. Spectrum sharing and
carrier aggregation are also one of solutions can be
applied for the next generation wireless networks while
mitigating the intercell interference or improving
signal quality for cell edge users.
Fig. 2 Capacity scaling with user demands (WWRF) [5]
3. Capacity enhancement factors of UDN

This
section
addresses
several
enhancement factors regarding UDN.
capacity
A. Traffic and node distribution

The number of users and cells and their locations
may affect the system capacity and user data rates.
The more the user, an improved capacity can be
achieved from the multi-user diversity, while
converges to a certain value of system capacity when
the mutual interference arises. The more the cell, the
larger the link gains due to the smaller distance
between the cell and the users, and accordingly the
system capacity can be improved. Regarding the cell
locations, it will be much better for the cells to be
located good to provide line-of-sight (LOS) link
between the cell and the user. But when the interfering
cell is also in the position of LOS to the same user, it
can be a severely interfering source to the user, so a
careful deployment design of cells or interference
mitigation scheme will be required in that case. Hence
a careful examination on the system capacity and user
data rate and their limitations is necessary with an
increase of cell and user node densification.
And there can be so many different of data types
time-varying from diverse terminals. The data size can
be very dynamic and the load handled by the cell and
backhaul nodes will be also very dynamic for some
cases. Therefore, how efficiently support this variant
traffic and load needs to be considered, and not only
the deployment of anchor cells but also the
wired/wireless backhaul nodes, and the route capacity
are to be considered for UDN capacity.
B. Spectrum utilization
Adoption of wide spectrum bands and even use of
mmWave transmission are under consideration for
C. Mobility management
To provide seamless services for mobile users, the
mobility management over the neighboring cells
should be supported in wireless networks. More users
and cells mean that the number of users requiring this
service as well as the number of cells exchanging the
signal and consumes more power and communication
links for mobility management, which may degrade the
system capacity. That is, the dense network can be a
good solution to extend the service coverage with high
data rate services, but it also may require more signals
and powers for seamless high data rate services
maintain the outage to be less than a certain level.
D. Interference management and link adaptation
As the network densification extends its area, the
interference problem become more critical due to the
close placement between cells and users, so
interference mitigation schemes are required.
Employing the traditional mechanisms such as fraction
frequency reuse (FFR) and inter-cell interference
coordination (ICIC) can be considered but it may not
so properly working in the dense and dynamic network
scenarios, so a careful examination on this and more
advanced schemes of interference management will be
required for some cases of UDN. Moreover, it is
important to provide LOS link conditions for high data
rate services. In the cases of NLOS condition or
abruptly varying conditions to NLOS from LOS due to
the obstacles, a fast link recovery to LOS link is
required to provide the service stably. Therefore, the
channel conditions and the link adaptation for LOS
communications need to be considered.
E. Multilayer/RAT co-existence
Dense networks are likely to encompass various
types of radio access technologies, so the scenarios of
UDN need to consider multi-layer/RAT environments
of small cells operating with macrocells, Wi-Fi, or both.
In this scenario, there are similar issues for the capacity
arising from the aspects of their distributions,
interference management, spectrum sharing, and
mobility management. Moreover, C/U plane splitting
becomes an issue of the next generation wireless
network design, by which the multi-layer/RAT
- 619 -
ICEIC 2015
coordination for interference management, backhauling,
and mobility control can be effectively performed.
4. Conclusion
This paper briefly addressed the role of UDN to the
next generation wireless networks and the capacity
enhancement factors of UDN. The thousand times
improvement in the wireless network capacity will be
achievable with the development of core technologies
of UDN. Our further works can be extended with more
detailed analyses on the impact of the capacity
enhancement factors to the capacity of UDN as well as
on the technical solutions regarding the issues.
ACKNOWLEDGEMENT
of MSIP/IITP. [14-000-04-001, Development of 5G
Mobile Communication Technologies for Hyperconnected smart services]
Fig. 3 Capacity enhancement factors of UDN
References
F. Air-interface spectral efficiency

Advanced transmission schemes such as TDD,
generalized OFDM, full duplexing, massive MIMO
and high frequency transmission are considered for
UDN environments. Also, advanced MAC for
efficiently reducing the overhead in short range
communications are under investigation. The effect of
these schemes when they are applied to UDN is
necessary to be examined[.
[1] http://5g-ppp.eu/wp-content/uploads/2014/02/Advanced5G-Network-Infrastructure-PPP-in-H2020_Final_November2013.pdf, Advanced 5G Network Infrastructure for the

Future Internet Public Private Partnership in Horizon 2020 Creating a Smart Ubiquitous Network for the Future
Internet".
G. Node coordination and cloud RAN

To handle issues regarding the capacity factors
ahead, it is important to apply an intelligent and
efficient coordination in the levels of cell, layer, and
RAT. Dynamic cell clustering for interference and
power
saving
and
management,
efficient
Macrocell/small cell cross-layer cooperation for C/U
plane splitting as well as user context information
exchange, data off-loading or user matching between
different RATs will be required to enhance the UDN
capacity while achieving good trade-off of the
advanced technologies for UDN.
[3] 3GPP TSG RAN TR 36.842 v.12.0.0, Small Cell

Enhancements for E-UTRA and E-UTRAN Higher Layer
Aspects, December, 2013
Fig. 3 shows the capacity enhancement factors

described above. The factors are expected to affect the
system capacity of UDN for the next generation
networks in terms of system capacity, user data rates,
and so on. They can be categorized into traditional
capacity issues, system environments and new
solutions approaches.
[2] 3GPP TSG RAN TR 36.872 v.12.1.0, Small Cell

Enhancements for E-UTRA and E-UTRAN Physical Layer
Aspects, December, 2013
[4] http://5g-ppp.eu/wp-content/uploads/2014/02/Advanced5G-Network-Infrastructure-PPP-in-H2020_Final_November2013.pdf, Advanced 5G Network Infrastructure for the

Future Internet Public Private Partnership in Horizon 2020 Creating a Smart Ubiquitous Network for the Future
Internet".
[5] http://www.whist.institut-telecom.fr/JBio2013/01sseiran.pdf, The 5G mobile and wireless communications
system.
[6] A. Osseiran, V. Braun, T. Hidekazu, P. Marsch, H.
Schotten, H. Tullberg, M. A. Uusitalo, M. Schellman, "The
foundation of the Mobile and Wireless Communications
System for 2020 and beyond Challenges, Enablers and
Technology Solutions, VTC Spring 2013, June 2-5, 2013
- 620 -
P4-02
Design of optical delay line architecture for automotive radar test system
Byung-Hee Son, Kwang-Jin Kim, Ye Li, and Young-Wan Choi
School of Electrical and Electronics Engineering, Chung-Ang University, 221 Heuksuk-Dong,
Dongjak-Gu, Seoul, 156-756, Korea
yhcoi@cau.ac.kr
Abstract
An optical delay line is designed and demonstrated
for automotive radar test system. Since the system is
designed with the optical fiber instead of the coaxial
cable, it has low loss and broadband characteristics.
The experimental results show that the value of S21
flatness is about 1.6 dB and the delay time is exactly
correct from 32 to 512 ns.
Keywords: Fiber optic delay line, automotive radar
test system, optical transceiver.
1. Introduction
Recently, automotive radar that is mounted on the
vehicle at various points (front, side, back) is studied as
a key element for the next generation intelligent
vehicles and intelligent transport system (ITS) [1]. In
accordance with each countrys reinforcement of
regulation for reducing the costs caused by vehicle
accidents, the importance of the anti-collision safety
system is growing. Accordingly, the demand of radar
test system (RTS) is also increased. In the RTS, the
most important part is the delay time generator for
accurate relative distance measurements. The coaxial
cable is used to make the artificial delay time in the

conventional RTS, however, the volume and power
loss of the system become larger when the delay
distance is longer than 50 m. In addition, it has a low
resolution because of narrow bandwidth. The optical
fiber is used to overcome limitations of the coaxial
cable. In the case of optical fiber, it has the advantages
in various points compared with coaxial cable [2]. The
RTS have to keep the uniform properties with the wide
bandwidth of input and output signal in order to have
high resolution without an error during the signal
processing, because it uses frequency modulated
continuous wave (FMCW) [3]. In this paper, an optical
fiber delay system is designed and demonstrated using
optical transceiver and optical cable for automotive
radar test system with compact and small size.
2. Optical delay line system

Optical delay line system is largely divided into
three parts, RF input part, time delay part and RF
output part. The intermediate frequency (IF) signal that
is down-converted from tens of GHz band is used as
the input signal on the RF input part. While the signal
is modulated into the distributed feedback laser diode
(DFB-LD) by the direct modulation, the various
Intermediate frequency : 3.7 GHz ~ 4.7 GHz
RF input
S/W
(1:2)
S/W
(2:1)
S/W
(1:2)
S/W
(2:1)
delay
line
delay
line
32 nsec
64 nsec
S/W
(1:2)
S/W
(2:1)
S/W
(1:2)
delay
line
128 nsec
S/W
(2:1)
S/W
(1:2)
S/W
(2:1)
delay
line
delay
line
256 nsec
512 nsec
Optical fiber
Laser diode
S/W
(1:2)
: Microwave Switch
delay
line
Figure 1 Block diagram of optical delay line architecture
- 621 -
Photodiode
: LD + Optical Fiber + PD + Pre
-Amp.
RF
output
ICEIC 2015
techniques like radial-stub and wideband tuning should

be applied to maintain the wideband characteristic. In
the time delay part, the distance of the optical fiber is
designed to be processed from 32 ns to 512 ns with 6.4
m resolution that considers the velocity of light (2
108 m/s) in the optical fiber. The delay line is doubled
at each step. In this case, the system could be
determined the distance from 0.2 m to 205 m. RF
output part is received the optical signal from the delay
line, then demodulated from optical signal to electrical
signal by photo-detector (PD) and trans-impedance
amplifier (TIA). The wideband characteristics should
be maintained in the RF output part as RF input part.
Figure 1 shows the block diagram of an optical delay
line architecture.
4. Conclusions
As shown in Fig.1, the RF input signal is modulated
to LD directly. The input frequency is from 3.7 GHz to
4.7 GHz that is intermediate frequency, and the RF
input power is 0 dBm. LD and PD module is set the
optimized condition before performing the experiments.
It was confirmed that the LD has the optimal
performance when the input current is 17 mA.
0
-10
dB [S(2,1)]
The optical delay line architecture for automotive

radar test system is designed and realized using the
optical fiber instead of coaxial cable. The input-output
characteristics and time delay are measured with
realized optical delay line system in 3.7 ~ 4.7 GHz.
The experimental results show that the flatness of
input-output signal is 1.6 dB, and the delay time is
exactly correct.
$FNQRZOHGJHPHQW
-5
7KLV ZRUN ZDV VXSSRUWHG E\ WKH 1DWLRQDO 5HVHDUFK

)RXQGDWLRQRI.RUHD15)JUDQWIXQGHGE\WKH.RUHD
JRYHUQPHQW06,31R15)5$$
-15
-20
-25
-30
-35
32ns
64ns
128ns
256ns
References
512ns
-40
3.7 3.8 3.9 4.0 4.1 4.2 4.3 4.4 4.5 4.6 4.7
Frequency [GHz]
Figure 2 Measured input-output characteristics of

optical delay line system
500
Delay time [ns]
Fig.2 shows the measured S21 of the input-output

signal. The signals go through switches, LD-PD
modules and optical fibers. The flatness of S21 is about
1.6 dB because the signals are not been matched
exactly at the using frequency. Since the flatness of the
components are not uniform in the whole frequency, it
is hard to reduce the fluctuations. The experimental
results is enough to satisfy the demand of
automotive radar test system. 7KHH[SHULPHQWDOUHVXOWV
RIGHOD\WLPHZLWKRSWLFDOGHOD\OLQHV\VWHPDUHVKRZQ
LQ)LJ7KHVLJQDOVKDYHDPHDQHUURURIQVWKDW
FRXOG QRW EH DIIHFWHG WKH V\VWHP ,W LV D XQLIRUP
FKDUDFWHULVWLF LQ FDVH RI FRQVLGHULQJ WKH UHVROXWLRQ RI
WKHV\VWHP
[2] Granot E, Weber R, Tzadok S, Fibers vs coax for RF

delay line applications, IEEE International conference on
microwave communications antennas and electronics systems
COMCAS, 2009
32ns
64ns
128ns
256ns
512ns
400
[1] Tuominen, Anu, and Toni Ahlqvist. "Is the transport

system becoming ubiquitous Socio-technical roadmapping as
a tool for integrating the development of transport policies
and intelligent transport systems and services in Finland."
Technological forecasting and social change, vol. 77, no. 1,
pp. 120-134, 2010.
300
[3] Zhang, Cemin, et al. "Accurate UWB indoor localization

system utilizing time difference of arrival approach." Radio
and Wireless Symposium. IEEE, 2006.
200
100
0
3.7 3.8 3.9 4.0 4.1 4.2 4.3 4.4 4.5 4.6 4.7
Frequency [GHz]
Figure 3 Measured delay time of optical delay line

system
- 622 -
P4-03
Content aware video transmission scheme based on JPEG compression

Artem Lenskiy, Soonuk Seol
Korea University of Technology and Education (KOREATECH)
Cheonan, Chungnam, Rep. of Korea
lensky@koreatech.ac.kr, suseol@koreatech.ac.kr
Abstract
The paper proposes a novel video transmission
protocol that applies JPEG compression algorithm.
The protocol is designed to be superior over the
MJPEG compression scheme. In our scheme, video
frames are divided into blocks and every block is
separately compressed using JPEG algorithm. Thus, in
comparison to MJPEG, our scheme does not drop the
whole frame in case of lost packets. We also do not
include JPEG header in each packet, thus significantly
reducing the transmission overhead. The other
advantage of the proposed protocol is content aware
transmission. Every packet carries the compression
parameter that is set by the sender based on the
importance of an image patch that packet carries.
Keywords: Content-aware compression, MJPEG,
video transmission
1. Introduction
The wide spread of video codecs with temporal
compression such, as H.264 [1] or generally MPEG4
family is associated with high compression ratios and
low compression artifacts. However, there are a
number of use-case scenarios when video codecs
without inter-frame predictive coding are preferable.
The most common codec where each video frame is
separately compressed is MJPEG [2]. One of the
advantages of the MJPEG codec is more consistent
packet size and thus required bandwidth does not vary
regardless of the video content. MJPEG guaranties the
quality of each video frame. On the other hand, lost
packets in H.264 transmission will lead to corruption
of a number of consecutive frames.
Unlike H.264, MJPEG codec is more robust to lost
packets. If a packet carrying JPEG data is lost, only
one, corresponding frame is rejected.
In this short communication we propose to further
improve robustness to lost packets. The proposed
transmission scheme does not reject the whole frame in
the case of lost packets. This is especially important in

wireless networks, where the packet loss rate is high.
It is known that MJPEG codec uses quantization to
mitigate the increased bandwidth but at the cost of
picture quality. In this paper, we propose utilizing
region of interest[3] (ROI) to set different tables of
quantization parameters depending on the importance
of image content. This method allows us to assign low
compression level for more important parts and high
compression for less important. JPEG supports 100
compression levels thus multi-level compression is
applicable to a single picture.
2. Protocol description
In the proposed scheme, the sender divides each
frame into non-overlapping blocks, adds header
information and then sends this datagram to the
channel as a part of an RTP packet. The header
occupies 32 bits and consists of the three fields (fig. 1):
a sequence number (22 bits), compression parameters
(7 bits) and a block size (3 bits). The header is
followed by a blocks payload.
10!
3
0
31!
RTP!header!
Sequence!
number!
Compression!
parameters!
Block!
size!
JPEG!scans!
Figure 1: Protocol syntax

A receiver extracts the sequence number that
occupies 22 bits and calculates the position of the
block as follows
where w is an image width, s is a block size and n is a

sequence number. The next seven bits carry
compression parameters. Because we applied JPEG to
compress the block data, and JPEG supports 100
different compression levels, these seven bits are just
enough to code the JPEG level. The last three bits are
used to calculate a block size. The block size is coded
as s = 2r, where r is the decimal representation of the
last three bits of the header. Thus, seven different block
sizes can be used for coding, e.g., 1, 2, 4, 8, 16, 32, 64,
and 128.
- 623 -
ICEIC 2015
Every block is compressed independently and
contains enough information to be decoded. Thus lost
blocks will not affect any other blocks of the frame.
The payload of each block contains only JPEG
scans (fig. 2); no quantization parameters, image size
nor other information is transmitted.
price we pay for the robustness to lost packets, and yet

is negligible.
In the second experiment we utilized ROI based
compression, to demonstrate that every block is free to
have its own compression level.
Figure 2: Structure of JPEG stream

The JPEG headers are generated on a receiver side
for each compression level and a block size. Then
based on the received block header, correct JPEG
header is concatenated.
The compression parameters vary depending on the
blocks content. There could be two scenarios. In the
first scenario, compression is adjusted based on a
compression error. The quality parameter is selected to
achieve a certain error. In the second scenario the
compression level is selected based in the importance
of the content that block contains. For example, blocks
belonging to a facial region get a low compression, i.e.,
higher quality (fig. 3).
We conducted two experiments. In the first
experiment all blocks were compressed with the same
level of compression. The goal of the experiment was
to see how PSNR changes with different compression
levels and compare it to PSNR of the original JPEG
compression (Table 1). The dimensions of the video
frame used in the experiment are 640x480 that
corresponds to uncompressed image size of 900
Kbytes. We selected block size of 32 x 32 pixels.
Table 1: Comparison JPEG and block-based JPEG
q
Compr.
Compr. PSNR PSNR
size (prop.),Kb size,Kb (prop.)
100
162.4
161
48.2
48.3
80
28.9
25.2
41.8
41.9
60
20.6
16.8
39.7
39.8
40
17.2
13.4
38.3
38.4
20
13.9
10
35.4
35.5
10
11.8
8
31.3
31.4
The parameter q defines the quality of the
compressed image. Higher values of q correspond to
better image quality. The qualities in terms of PSNR of
the compressed images are the same, however the size
of the original JPEG compressed image is slightly
smaller, especially for lower values of q. This is the
Figure 3: (top) Original frame, (bottom)

compressed frame
In figure 3, the background of the bottom video
frame is compressed with q = 5, the facial region is
compressed with q = 20 and the eyes are compressed
with q = 60. We selected very severe compression of
the background to make the difference in compression
visible.
4. Conclusion
In this paper we have proposed to use JPEG
compression for every image block with our own
simplified header instead of transmitting the whole
JPEG header. In such way the transmission scheme is
robust to packet loss and every block can have its own
compression level based on the importance of the
region.
References
[1] T. Wiegand, G.J. Sullivan, G. Bjontegaard, A. Luthra,
Overview of the H.264/AVC video coding standard,
IEEE Transactions on Circuits and Systems for Video
Technology, vol.13, no.7, (2003), 560 - 576.
[2] L. Berc, W. Fenner, R. Frederick, S. McCanne, P.
Stewart, Request for Comments: 2435: RTP Payload
Format for JPEG-compressed Video.
[3] Artem Lenskiy and Soonuk Seol, Video transmission
using multi-level content aware compression based on
object detection, Contemporary Engineering Sciences, to
be appear, 2014
- 624 -
P4-04
Micromachined Composite Right/Left-Handed Unit Cell using Gold-Coated

Silicon for V-band Applications
Kyeongseob Kim, Ik-Jae Hyeon, Chang-Wook Baek and Sungjoon Lim
School of Electrical and Electronics Engineering, Chung-Ang University, Seoul, Republic of
Korea
kks6695@naver.com, sungjoon@cau.ac.kr
Abstract
In this paper, a micromachined composite right/lefthanded (CRLH) unit cell is presented for V-band
applications. The proposed CRLH unit cell is
composed of a gold coated silicon and its left-handed
characteristic is verified by a dispersion diagram.
observed that the LH characteristic occurs at lower than

60 GHz while the RH characteristic at higher than 60
GHz. The balanced condition is satisfied at 60 GHz.
Keywords: Composite right/left-handed (CRLH)

transmission line (TL), micromachining.
1. Introduction
The concept of a left handed (LH) metamaterial was
first proposed by Veselago in 1968, who investigated
the electrodynamics of hypothetical materials with
negative permittivity and permeability [1]. When the
LH metamaterial is realized in a transmission line (TL),
a parasitic right-handed (RH) is unavoidable. Therefore,
a composite right/left-handed (CRLH) TL provides LH
characteristics as well as RH characteristics at higher
and lower frequencies, respectively [2]. The CRLH TL
has been applied into a backward-wave directional
couplers (Caloz et al., 2004), tunable radiation angle
and beamwidth antennas (Lim et al., 2004), zerothorder resonator antennas (Sanada et al., 2004) etc. In
this paper, we propose the micromachined composite
right/left-handed (CRLH) unit cell using the gold
coated silicon. Gold is coated on the top surface of
silicon.
2. Design and Simulation Result

The proposed CRLH unit cell is designed using a 30m-thick low resistive silicon on a glass substrate as
illustrated in Fig. 1. The conductive patterns are
realized on the top of silicon substrate. The series
capacitance of the CRLH unit cell is realized by the
interdigital capacitor. The shunt inductance of the
CRLH unit cell is realized by the narrow stub which is
connected to the ground through a copper via. The
simulated dispersion diagram is plotted in Fig. 2. It is
(a)
(b)
Figure 1. (a) Proposed CRLH unit cell and (b) side
view of the model of CRLH unit cell.
Figure 1. Dispersion diagram of the CRLH unit cell.
3. Acknowledgement
government (MSIP) (NRF - 2012R1A2A2A01011017).
4. References
[1] V. Veselago, The electrodynamics of substances with
simultaneously negative values of and , Sov. Phys.-Usp.,
vol. 10, pp. 509-514, Jan.-Feb. 1968.
[2] A. Sanada, C. Caloz, and T. Itoh, Characteristics of the
composite right/left-handed transmission lines, IEEE
Microw. Wireless Compon. Lett., vol. 14, no. 2, pp. 68-70,
Feb. 2004.
- 625 -
P4-05
Delay Performance Analysis of Cross-layer Retransmission Schemes

for Real-time Services
Kwang-Chun Go , Hye-Rim Cheon , Mi-Jeong Hoh , and Jae-Hyun Kim
Department of Electrical and Computer Engineering, Ajou University
Agency for Defense Development
{light3754, hyerimn1, jkim}@ajou.ac.kr, mijeong@add.re.kr
Abstract
This paper analyzed the delay performance of the
wireless communication systems that adopts the crosslayer retransmission schemes. The delay performance
is important to guarantee the quality of service (QoS)
requirements. The results of this paper can be used for
selecting an appropriate cross-layer retransmission
scheme.
Keywords: Delay, Cross-layer, Retransmission
1. Introduction
In the wireless communication networks, different
types of services are available. Each service class is
mapped to the quality of service (QoS) requirements
according to their characteristics. Especially, the delay
performance is very important to guarantee the QoS
requirements for real-time services. Table I represents
the delay requirements for each service class based on
packet delay budget and packet error loss rate between
end terminals [1].
To satisfy the delay requirements for users, it is
important to improve the reliability of packet
transmission, and so far, various methods have been
proposed for this purpose [2], [3]. A cross-layered
retransmission scheme, which is a method for
improving the transmission performance of a packet
over a wireless channel, is a retransmission scheme
combined with adaptive modulation and coding

(AMC).
However, existing works focused on improving the
spectral efficiency rather than improvement of
performance at the application layer. As a result, the
performance at the application layer may be decreased.
This may not meet the minimum delay requirements of
each service class. Therefore, the delay performance
analysis for each service class is required to select an
appropriate cross-layered retransmission scheme and
system parameters according to the characteristics of
each service class. In this paper, we analyze the endto-end delay performance at the transport layer.
2. Performance analysis
2.1 System model
To analyze the end-to-end delay performance, we
define the system structure as shown in Fig. 1. The
HARQ type II and the stop-and-wait ARQ are used at
the PHY layer and the data link layer, respectively.
The transmission control protocol (TCP) Reno is used
for transmission control of a segment at the transport
layer [4]. Also, we adopt the Rayleigh fading channel
model as wireless channel model and the cross-layer
retransmission schemes as reliable transmission
protocols [5], [6].
Table 1: Delay requirements for each service

Service class
Conversational voice
Interactive games
Web-browsing
Delay requirements
<150 ms preferred
<400 ms limited
<200 ms
<2 s preferred
<4 s acceptable
TCP Reno
Transport
Layer
Data Link
Layer
PHY Layer
Stop and Wait ARQ
HARQ Type II
Data Link
Layer
PHY Layer
Transport
Layer
Backbone
network
Data Link
Layer
PHY Layer
AMC
(Feedback Channel)
Transmitter
BS
Figure 1: System structure
- 626 -
Server
ICEIC 2015
combining gain is beneficial for decreasing PLR. For

this reason, the average transmission delay of the AMC
combined with HARQ in the lower SNR region is
smaller than that of the AMC combined with ARQ
because of the soft combining gain.
280
HARQ+AMC
ARQ+AMC
Average Transmission Delay(msec)
260
240
220
4. Conclusion
200
180
In this paper, we analyzed and evaluated the

average end-to-end transmission delay at the transport
layer. From the evaluation results and Table I, we
inferred that the HARQ combined with AMC can be
used for Interactive games and Web-browsing and the
ARQ combined with AMC can be only used for Webbrowsing service. Consequently, the analytical model
can be used to design the cross-layer retransmission
schemes for each service class.
160
140
120
100
0
10
15
20
25
30
Average SNR(dB)
Figure 2: Average end-to-end transmission delay

2.2 Delay performance analysis
The average transmission delay of a packet can be
calculated by using the one way transmission delay,
round trip delay, and average transmission number,
and it is given by
Dtrans Done way Dround N 1 N packet ,
(1)
where Done way , Dround , and N packet denote one-way

packet delivery time, round-trip delivery time, and the
number of packets that compose an TCP packet,
respectively. N denotes the average transmission
number of a TCP packet, and it is expressed as follows
N
1 PER
Nt
(2)
1 PER
where PER and N t denote the average PER of a TCP
packet after finishing retransmission procedures and
the maximum number of transmissions of a TCP
packet.
3. Evaluation results
We evaluate the average transmission delay
between end terminals until successful delivery of a
TCP packet. We assume that the delay offset of an
HARQ downlink acknowledgement packet is used for
calculating average transmission delay of a TCP
segment at the transport layer and its value is one
frame long.
Figure 2 represents the average transmission delay
at the transport layer. The average transmission delay
of the AMC combined with HARQ is lower than that
of ARQ at an average SNR of lower than 14 dB.
Because the HARQ uses soft combining to recover the
retransmitted packet, the system can achieve
combining gain. In the low SNR region, the soft
Acknowledgement
This work has been supported by National GNSS
Research Center program of Defense Acquisition
Program Administration and Agency for Defense
Development.
References
[1] ITU-T Recommendation G. 1010, End-user multimedia
QoS categories, 2001.
[2] W. Hong, Y. ShuYa, H. Ning, and Z. Liang, A Crosslayer Design Combining Method of AMC with HARQ based
on LDPC Codes, in Proc. ICCCAS 2008, Xiamen, China,
pp. 25-27, May 2008.
[3] Aniba G and Aissa S, Cross-layer Designed Adaptive
Modulation Algorithm with Packet Combining and
Truncated ARQ over MIMO Nakagami Fading Channels,
IEEE Trans. Wirel. Commun., vol. 10, no. 4, pp. 1026-1031,
Apr. 2011.
[4] W. Stevens, TCP Slow Start, Congestion Avoidance, Fast
Retransmit, and Fast Recovery Algorithms, IETF RFC 2001,
1997.
[5] Q. Liu, S. Zhou, and G. Giannakis, Cross-layer
Combining of Adaptive Modulation and Coding with
Truncated ARQ over Wireless Links, IEEE Trans. Wirel.
Commun., vol. 3, no. 5, pp. 1746-1755, Sep. 2004.
[6] D. Wu and S. Ci, Cross-layer Combination of Hybrid
ARQ with Adaptive Modulation and Coding for QoS
Provisioning in Wireless Data Networks, in Proc.
IEEE/ACMQShine06, Waterloo, Canada, vol. 191, pp. 1-9,
Aug. 2006.
- 627 -
P4-06
Hybrid Transport Method on the Multipath Communication

Ji-Su Kim, Jin-Ki Kim, Jae-Hyun Kim
Ajou University
soo@ajou.ac.kr, kjkcop@ajou.ac.kr, jkim@ajou.ac.kr
Abstract
We propose a hybrid transport mode based on a
multipath communication that determines how data
packets should be transmitted over multiple paths in
order to achieve maximum throughput and guarantee
service quality requirements. The proposed scheme
sends identical packets over multiple paths to improve
reliability; likewise, different packets are sent to
improve throughput. Numerical results indicate that
the hybrid transport mode achieves maximum TCP
throughput when the proportion of same and different
packets is adjusted according to link conditions.
Keywords: Multipath, Diversity, Multiplexing
1. Introduction
In recent years, mobile devices equipped with
multi-network adapters have come into wide use.
Moreover, various commercial mobile communication
networks have come to coexist. As a result, multiple
paths for single or multiple flows for a service can be
simultaneously exploited. Multipath communications
have the obvious benefits of high reliability and the
ability to achieve high throughput. Furthermore,
multipath communications lead to more efficient use of
networked resources. Such advantages lead us to study
multipath communication schemes [1], [2].
Conventional methods used to split data into
multipath sub-flows are categorized as either a
diversity transport mode (DTM) or multiplexing
transport mode (MTM). In DTM, the sender transports
the same packet over multiple paths to ensure
reliability, which in turn, reduces the packet error rate
(PER). However, similar data rates between multiple
paths are required to achieve diversity gain. Therefore,
the data rate of DTM is restricted by the lowest data
rate among multiple paths. In contrast, MTM does not
require symmetric data rates for multiple paths to attain
multiplexing gain. However, due to congestion control

of TCP, if at least one out of multiple paths is
unreliable, the total throughput of the connection may
be degraded.
To overcome these problems, we propose a hybrid
transport mode (HTM) that maximizes the efficiency
of TCP multipath communications. The proposed
HTM employs both the diversity and multiplexing
transport modes and optimizes the usage ratio between
these two modes to maximize TCP throughput for
given link capacities. In this paper, we only focus on
transport methods and assume that a suitable scheduler
is used for TCP. In order to evaluate the performance
and to obtain the optimal usage ratio, we derive the
throughput model of the HTM for TCP considering
low-layer (e.g., MAC protocol layer, PHY layer) link
conditions. By numerical analysis, we find that the
TCP throughput is bounded by the low layer condition
or the congestion window size and the HTM can
achieve higher throughput than the MTM by
optimizing the usage ratio between the DTM and
MTM.
2. Hybrid Transport Mode

The HTM exploits both diversity and multiplexing
transport modes for one service. The data rate of HTM
is made up of a combination of DTM and MTM data
rates. To improve the reliability, a sender
simultaneously transmits the same packets over
multiple sub-flows using DTM resources. Moreover, a
sender may transmit different packets over multiple
sub-flows, which allows them to attain higher
throughput. Based on available resources, HTM can
control the connection-level throughput and PER by
allocating the data rate to each mode to meet the
requirements of an application service. Here,
connection-level refers to the TCP connection
consisting of multiple TCP sub-flows. The tradeoff
relationship between the throughput and PER, however,
- 628 -
ICEIC 2015
Fig. 1. Data rate use for HTM

is very complex. Preventing a packet error can lead to
an improvement in TCP throughput by maintain the
size of the congestion window (CWND) from
shrinking. According to low-layer link conditions, a
more efficient transport mode should be used to obtain
maximum MPTCP throughput.
Figure 1 shows how HTM uses the data rates of
multiple paths when the number of multiple paths is
two. Let R0 denote the data rate allocated for DTM.
3. Numerical Results
Figure 2 shows the TCP throughput as a function of
the MAC layer PER, p, and . Here, is the DTM
portion of the link that has the minimum data rate. As
becomes smaller, the data rate of MTM increases.
On the other hand, as becomes larger, DTM attains
a larger data rate. Thus, MTM is used exclusively
when is 0, and DTM is used exclusively when is 1.
The total throughput of HTM is divided into the
throughput of DTM and MTM. The TCP throughput,
which considers the low-layer link condition, is
related to the PER and throughput of the MAC
protocol layer. Based on the TCP throughput, the total
throughput of HTM can be analyzed by the behavior
of the diversity and multiplexing transport modes.
DTM prevents a decrease in the TCP CWND size by
reducing the PER. Consequently, this leads to an
increase in the TCP throughput. On the other hand,
MTM reduces the TCP CWND size; however, it
increases the TCP throughput by transmitting different
packets on different paths simultaneously. As a result,
MTM has a larger throughput gain than DTM in the
low PER region. Meanwhile, DTM increases the TCP
throughput more than MTM in the high PER region.
Thus, the amount of gain obtained by each mode is
different according to the communication link
condition. This suggests that the efficiency of
Fig. 2. TCP throughput versus PER and

multipath communication varies depending on the
allocation of limited resources to a particular
multipath transport mode.
4. Conclusion
We proposed a hybrid transport for multipath
communication. The HTM uses both diversity and
multiplexing transport modes simultaneously. We
found that HTM attains the maximum TCP
throughput when the usage ratio of the diversity and
multiplexing transport modes is modified. Finally,
HTM achieved not only the maximum throughput but
also minimized the PER at the connection level. Thus,
the proposed scheme can be exploited to guarantee
quality of experience (QoE) by service type.
Acknowledgement
government (MSIP) (No. 2013R1A2A1A01016423) and (No.
NRF-2014R1A2A2A01002321)
References
- 629 -
[1] S. Venkatesan, A. Lozano, and R. Valenzuela,

Network mimo: Overcom- ing intercell interference
in indoor wireless systems, in Signals, Systems and
Computers, 2007. ACSSC 2007., Nov. 2007, pp. 83
87.
[2] U. Jang, H. Son, J. Park, and S. Lee, Comp-csb for
ici nulling with user selection, Wireless
Communications, IEEE Transactions on, vol. 10, no.
9, pp. 2982 2993, september 2011.
P4-07
Electronically Switchable Metasurface for Absorption and Reflection Modes

Minyeong Yoo and Sungjoon Lim
School of Electrical and Electronics Engineering, College of Engineering,
Chung-Ang University, Seoul, Republic of Korea
sungjoon@cau.ac.kr
Abstract
In this paper, we present a novel electronically

switchable metasurface that provides absorption and
reflection modes depending on bias voltages of pin
diodes. The metasurface is designed by a periodic split
ring resonator loading the pin diode. When the pin
diodes turn on, the metasurface is working as the
absorber. When the pin diodes turn off, the
metasurface is working as the reflector The
performance of the proposed metasurface is
demonstrated from both full-wave simulation and
measurement.
Fig. 1. Fabricated switchable metasurface

prototype
Keywords: Active metamaterial, Absorber, Switchable
1. Introduction
A metasurface can be designed by a periodic

arrangement of extraordinary resonators. Depending on
permeability and permittivity of the metasurface, it can
operate as the absorber [1], and so on. However,
conventional metasurfaces have been studied only for a
single application. In practical wireless environments,
there are diverse situations. For example, in an air-toair battlefield, an aircraft receives various radar signals
without identification of friend or foe (IFF).
In this paper, we propose a novel multi-functional
metasuface that can switch between the reflection and
the absorption modes for various X-band environments.
The function of the proposed metasuface is
electronically controlled.
2. Design and Result
In order to electronically control the impedance of

the metasurface, a split ring resonator (SRR) is used for
the unit cell of the proposed metasurface. In order to
electronically switch the absorption and reflection
modes, a single pin diode is loaded on the central wire
of the SRR where strong surface current is flowing.
When the pin diode turns on, the surface current on the
central wire of the SRR is flowing so that the proposed
metasurface operates as an absorber. On the other
hands, when the pin diode turns off, the surface current
on the central wire of the SRR cannot flow so it
operates as the reflector. Fig. 1 shows the fabricated
prototype of the proposed metasurface.
Fig. 2 shows the simulated and measured reflection
coefficients of the proposed metasurface. The proposed
Fig. 2. Simulated and measured reflection

coefficients of the switchable metasurface.
metasurface shows -22.4 dB of reflection coefficient at
10.97 GHz when the pin diodes turn on. When the pin
diodes turn off, the reflection coefficient is changed to 0.28 dB at 10.97 GHz. The absorptivity can be
calculated from transmission and reflection coefficients.
The calculated absorptivity from the measured Sparameters is 99.4% and the reflectivity is almost
100% without attenuation.
Acknowledgement
This research was partly supported by the

MSIP(Ministry of Science, ICT&Future Planning),
Korea, under the ITRC(Information Technology
Research Center) support program (NIPA-2014H0301-14-1015) supervised by the NIPA(National ICT
Industry Promotion Agency) and Basic Science
Education, Science and Technology (2011-0022562).
References
[1] N. I. Landy, S. Sajuyigbe, J. J. Mock, D. R. Smith and W.

J. Padilla, Perfect Metamaterial Absorber, Phys. Review
Letters, vol. 100, no. 20, May 2008.
- 630 -
P4-08
Performance Analysis of Reliable AL-FEC Mechanism

for SOTM systems in DVB-RCS Networks
Kyu-Hwan Lee , Hyun-Ki Jung , Mi-Jeong Hoh , and Jae-Hyun Kim
Department of Electrical and Computer Engineering, Ajou University
Agency for Defense Development
{lovejiyoon7, happy8076, jkim}@ajou.ac.kr , mijeong@add.re.kr
Abstract
Satellite
In this paper, we propose a reliable application

layer forward error correction (AL-FEC) mechanism
for SOTM systems in DVB-RCS networks. In particular,
the proposed reliable AL-FEC mechanism uses a twoway acknowledgement (ACK) exchange mechanism.
Through the performance evaluation, it is shown that
the proposed AL-FEC mechanism outperforms TCP in
terms of the goodput and the resource efficiency.
SOTM AL-FEC data &

S-ACK
Terminal
R-ACK
Application (FTP)
Application (FTP)
FEC Framework
FEC Framework
FEC
Generation
Constant
TX Rate
FEC
Generation
UDP
Keywords: AL-FEC, SOTM, DVB-RCS
Constant
TX Rate
UDP
IP
IP
MAC
MAC
PHY
1. Introduction
Ground
Station
PHY
SOTM Link
Fig. 1. System model of the proposed mechanism.
Satellite on the move (SOTM) systems is used in

commercial and military communications because they
offer the high speed wireless link to moving vehicles
such as maritime vessels, trains, and land vehicles
through a satellite [1]. However, the link between the
SOTM terminal and the satellite can experience a
temporary outage owing to channel blockage due to
pointing errors of the antenna on account of the rugged
terrain and obstructions such as high buildings and
trees. It can cause packet loss in the satellite link [1].
In the satellite communication, the channel coding
and the retransmission scheme are used to treat
erroneous packets. However, these techniques have the
limitation in the SOTM networks [2]. Recently, an
application-layer FEC (AL-FEC) is applied to satellite
communications for SOTM terminals [3]. The AL-FEC
mechanism can not only correct for packets lost owing
to channel blockage with its flexible time diversity and
flexible amount of protection but also achieve the high
throughput by eliminating the retransmission delay.
In digital video broadcasting-return channel via
satellite (DVB-RCS) networks, satellite terminals (STs)
request the resources from network control center

(NCC), and the NCC then assigns the resources.
However, conventional TCP cannot fully use assigned
resource from NCC in the SOTM environment because
of the retransmission and congestion avoidance [4].
Therefore, in the proposed protocol, we propose a
reliable AL-FEC mechanism for SOTM systems in
DVB-RCS networks to enhance the goodput and the
resource efficiency. Furthermore, we compare the
performance of the proposed mechanism with TCP
through the performance evaluation.
2. Proposed Mechanism
The system mode is composed of a SOTM terminal,
a satellite, and a ground station as shown in Fig. 1. All
AL-FEC packets generated from the FEC framework
are transmitted to the user datagram protocol (UDP)
layer by constant transmission rate. In the link layer, we
assume that the satellite resource is enough to transmit
a file. The detailed procedures of the proposed
mechanism in the sender and receiver are as follows.
- 631 -
ICEIC 2015
TCP Reno
AL-FEC
0.8
Resource usage time (sec.)
Goodput (Mbit/sec.)
0.6
0.4
0.2
0
4
5
File size
Fig. 2. Average goodput (city, blockage fraction =

33%).
TCP Reno
AL-FEC
6000
4000
2000
0
9
x 10
8000
4
5
File size
9
x 10
Fig. 3. Average resource usage time (city, blockage

fraction = 33%).
Sender: Upon receiving a file from the application

layer, the FEC framework of the sender segments it
into k native packets. Next, the FEC framework
generates repair packets from the k native packets with
Raptor code [2]. After native and repair packet
generation, all the packets are inserted into the
transmission queue. The FEC framework transmits the
packets to the lower layer with a transmission (TX) rate
of RTX. When receiving the receiver-ACK (RACK)
message that indicates the completion of the file
reception from the receiver, the FEC framework
removes all packets from the transmission queue and
terminates the file transfer to the receiver. The sender
then sends the sender-ACK (S-ACK) that indicates the
reception of R-ACK to the receiver. If the sender
receives duplicated R-ACK, the sender retransmits the
S-ACK.
Receiver: Upon receiving packets from the sender,
the FEC framework of the receiver inserts the packets
into the reception queue. The FEC framework checks
whether the packets in the reception queue can be
decoded to a file by Raptor code. If the decoding is
completed, the receiver sends an R-ACK message to
the sender (ACK-based mechanism) and the file is
forwarded to the application layer. If the receiver does
not receive S-ACK message within round trip time
(RTT), it retransmits the R-ACK message to the sender.
In the performance analysis, we compare the
performance of the proposed AL-FEC mechanism with
that of TCP Reno [5]. We have implemented an eventdriven simulator in MATLAB. Channel blockage
statistics are based on the measurements in the field test
[2]. For SOTM nodes, fixed resources are allocated
from NCC. We consider city environment. Figs 2 and 3
show the average goodput and the resource usage time
in the SOTM environment. It is shown that the
proposed AL-FEC mechanism outperforms TCP in

terms of the goodput thanks to the transmission of ALFEC packets. In Fig. 3, the resource usage time of the
proposed protocol is less than that of TCP Reno. In the
retransmission of TCP in the satellite communications,
a long time is consumed by the timeout and congestion
avoidance mechanism owing to the long propagation
delay. Therefore, a wasteful use of resource is caused
by TCP because resources are continuously allocated
by SOTM regardless of the data transmission.
Consequently, the proposed mechanism outperforms
TCP in terms of the goodput and the resource
efficiency.
Acknowledgments
government (MSIP) (No. 2013R1A2A1A01016423) and
National GNSS Research Center program of Defense
Acquisition Program Administration and Agency for Defense
Development.
References
[1] W. M. Smith, Channel characterization and modeling
for satellite communications on the move in Proc. 2005
IEEE MILCOM, pp. 821 827.
[2] M. Luby, Raptor codes: Algorithms and applications,
in Proc. IEEE ICNC (Qualcomm Distinguished Lectures),
2012.
[3] Digital video broadcasting (dvb);upper layer fec for dvb
systems, ETSI TR 102 993, pp. 189, 2011.
[4] M. Luglio, C. Roseti, and F. Zampognaro, Performance
evaluation of TCP-based applications over DVB-RCS
DAMA schemes, International Journal of Satellite
Communications and Networking, vol. 27, pp. 163-191,
2009.
[5] M. Allman, V. Paxson, and W. Stevens, TCP congestion
control, RFC 2581, 1999.
- 632 -
P4-09
Novel Inter-Cell Interference Coordination Scheme Using Normalized

Intended Energy Distribution Index with Low Computational Complexity
Yeon-Jea Cho, Hyeong-Guen Yu and Dong-Jo Park
Department of Electrical Engineering
Korea Advanced Institute of Science and Technology
Daehak-Ro, Yuseung-Gu, Daejeon, Republic of Korea
E-mail: yeonjeacho@kaist.ac.kr
Abstract
This paper proposes a novel inter-cell interference
coordination (ICIC) scheme using normalized intended
energy distribution (NIED) indicator to improve the
performance of the conventional ICIC method with low
computational complexity at base stations (BS).
Figure 1. Proposed IED type-making algorithm
Keywords: Cellular networks, ICIC indicator, RNTP.
1. Introduction
In the LTE standard [1], the X2 interface is
specified for exchanging the Relative Narrowband
Transmit Power (RNTP) indicator for ICIC
information. This RNTP indicator takes a value of 0 or
1 and is transmitted to adjacent base stations for each
resource block (RB). This method has a difficulty of
performing precise power allocation according to the
channel state of mobile stations.
Recently, in order to improve the performance of
the conventional ICIC using the RNTP indicator, a new
ICIC framework was proposed in [2] introducing the
intended energy distribution (IED) indicator instead of
the conventional RNTP indicator. The IED is a Kdimensional vector quantized according to predetermined N IED types and its index is exchanged
between adjacent base stations. Here, K is the number
of RBs. However, it may lead to high computational
complexity to find the proper IED index from the IED
type table. The number of IED types, N, is
exponentially increased by the formula N 2B (or
B log 2 N ) where B is the number of bits allocated
for the ICIC indicator. Then, the computational
complexity at the base station is also exponentially
increased.
Figure 2. Lloyd-Max algorithm for scaling factor

In order to solve the complexity issue, this paper
proposes a novel inter-cell interference coordination
method using normalized intended energy distribution
(NIED) indicator for low computational complexity at
the base station.
2. Proposed NIED indicator

In the proposed scheme, the total number of bits, B,
allocated for the ICIC purpose is split up into two parts.
First and second parts use B1 and B2 bits for describing
the NIED types and their scaling factors, respectively,
where B = B1 + B2. Because the scaling factor is a
simple scalar value, the computational complexity for
finding a proper IED index is mainly caused by the first
- 633 -
ICEIC 2015
part, and the complexity is exponentially decreased by
two to the B2s times. Figure 1 shows the block diagram
of the IED type-making algorithm and this is an
application of the well-known Linde-Buzo-Gray (LBG)
vector-quantization (VQ) design algorithm and LloydMax algorithm [3]. The LBG VQ and Lloyd-Max
algorithms are performed to derive the optimal NIED
types and their quantization levels of the scaling factor,
respectively. In Figure 2, we show a more detailed
description of Lloyd-Max quantization for a scaling
factor. Finally, an indicator-making procedure using
the derived NIED and scaling factor types is described
in Figure 3. The notations related to the block diagrams
in Figures 1 ~ 3 are as follows:
Figure 3. Proposed indicator-making procedure
Figure 4. Average distortion vs. standard deviation
3. Simulation Result and Conclusion

In this paper, we suggested a novel ICIC method
using the NIED indicator that splits up the total number
of bits allocated for the ICIC purpose into the NIED
type part and its scaling factor part. For performance
verification, we use one million real Gaussian random
training vectors (M = 1,000,000) and compute the
average distortion for a performance measure versus
the standard deviation of training vectors which
changed from 0.01 to 0.2. Figure 4 shows that the
performance of the proposed ICIC using the NIED
indicator is better than that of the conventional ICIC
using the RNTP indicator and also comparable to [2]
despite its exponentially reduced complexity.
References
[1] Evolved Universal Terrestrial Radio Access (E-
UTRA), 3GPP TS36.423.

[2] Y.-J Cho, J.-H Lee and D.-J Park, New Framework
for Inter-Cell Interference Coordination, The 18th
IEEE International Symposium on Consumer
Electronics, pp. 1-2, June 2014.
As a performance measure, average distortion for the

proposed ICIC scheme is defined as
[3] G. Y. Linde, A. Buzo, and R. M. Gray, An
Algorithm for Vector Quantizer Design, IEEE

Transactions on Communications, pp. 702-710, Jan.
1980.
- 634 -
P4-10
Efficient Location-based Routing Protocol for Border Surveillance Wireless

Sensor Networks
Jaekeun Yun*, Daehee Kim*, Noureddine Boudriga** and Sunshin An*
*Dept. of Electronics Engineering, Korea University, Seoul, Republic of Korea
**Communication Networks and Security Research Lab., University of Carthage, Tunisia
*{jkyoon, dhkim, sunshin}@dsys.korea.ac.kr
**nab@supcom.rnu.tn
Keywords: WSN, Location-based routing, Border

surveillance, GPSR
But the location-based routing protocols have

several drawbacks. The drawbacks are to the following:
- Routing path is not optimized path.
- It has a void problem
Due to above drawbacks, we researched locationbased routing protocols.
Border surveillance is one of the most prominent
types of applications for which a WSN is configured to
monitor a given area against intrusions.
Sensors are deployed over the field-of-interest (FoI),
to sense the area and report their detection to a sink,
promptly and reliably. Therefore, efficient routing
protocol is one of the key technologies in border
surveillance wireless sensor networks.
1. Introduction
2. Basic idea
Wireless sensor networks (WSN) consist of a sensor

nodes equipped with one or more sensing. The sensor
nodes are used to gather information in various settings
including disaster monitoring, border surveillance and
battlefield. [1]
Wireless
sensor
networks
have
unique
characteristics such as limited resources, high
redundancy and random deployment. Due to above
reasons, traditional routing protocols are not suitable
for WSNs. Therefore, we did a research established
routing protocols. The location-based routing protocol
is the most appropriate routing protocol for wireless
sensor networks. The location of a packet's destination
and positions of the candidate next hops are sufficient
to make correct forwarding decisions, without any
other topological information. The advantages of the
location-based routing protocols are following:
- No need to message exchange for route
maintenance.
- Easily adapt to topology change.
- No need to information of entire network.
We present efficient location-based routing protocol.

The proposed method is GPSR (Greedy Perimeter
Stateless Routing)-based. [2] The GPSR is locationbased routing protocol. In GPSR, each node needs only
knows its 1-hop neighbors position. Each node
transmits a beacon to the broadcast MAC address,
containing only its own identifier and position. A
sender selects a closest node to the destination out of
neighbors, until the destination is reached. The GPSR
protocol has two problems. The first problem is
optimization path problem. A sender selects a closest
node to the destination out of 1-hop neighbors. The
selected node repeats the process, until the destination
is reached. However, a selected path may not be the
optimization path. The second problem is void. A
sender doesn't transmit the message to the destination,
since closer nodes to the destination don't exist out of
its 1-hop neighbors. Some other mechanism must be
used to forward packets in these situations.
Abstract
Recent advanced in wireless sensor networks had
let to many new research. Wireless sensor networks
are large gathering of sensor nodes with limited
resource. Due to limited resource and limited
communication range, efficient routing is the central
issue to design wireless sensor networks. We propose
location-based
routing
protocol
for
border
surveillance system. Our proposal method is enhanced
GPSR.
3. Proposed method
- 635 -
ICEIC 2015
Dashed lines are GPSR

routing path.
Solid arrow are our
proposal method path.
S is source node.
D is destination node.
b
V
U
void
Y
Z
X
Z
Fig. 2. It is an avoidance manner to void state using

the 2-hop neighbor information.
Fig. 1. Compare the proposed method with GPSR.

The proposed method is using location information
of 2-hop neighbor nodes at the sender. We assumed
two mechanisms. Each node can know its location
information. And, it is possible to know the location
information of the destination via the location-based
service.
A. 2-hop neighbor discovery
Each node sends its own neighbors' lost to its
neighbors. A neighbor list includes information (ID,
location). A node that receives a beacon message can
know all 2-hop neighbors location information.
B. Routing decision method
Now, a sender knows the location of a destination,
1-hop neighbors and 2-hop neighbors. A sender selects
neighbor which is a closest node to the destination out
of 2-hop neighbors. A sender transmits the message to
a closest node to the destination out of 2-hop neighbors.
Figure 1 shows example our proposal. In GPSR,
node S selects node X. Node X is closer to node D than
W. But node Y is closer to node D than node Z. So we
proposed to consider method 2-hop neighbors location
information for search closest node to the destination.
In this case, proposed method is efficient at the
optimization path problem.
The void problem can be divided into two situations.
The situations are void avoidance and void state. In
GPSR, if closer to destination do not exist out of 1-hop
neighbors, a void occurs. In our scheme, if only closer
nodes to destination exist out of 2-hop neighbors, a
void occurs. Using 2-hop neighbors' location
information, we can reduce the void probability. The
void state also exists in our proposal method. Closer
nodes to destination do not exist out of 2-hop
neighbors. A sender node sends the void information to
its previous node. After a previous node on the routing
path receives the information, it finds closer nodes to
destination out of 2-hop neighbors. This procedure is

repeated until if finds a closer node.
A. Shorter path length
Since our scheme makes use of 2-hop neighbors'
location information, it can provide better routing path.
B. Smaller void occurrence probability
Since a closer node to the destination exists out of
2-hop neighbor of a sender, our scheme reduces the
probability of void occurrence.
C. Low energy consumption
Our scheme uses the same number of beacons as
GPSR. However, the beacon message has more
information. But, since our scheme provides shorter
path and smaller void occurrence, our scheme will be
more energy efficient.
5. Conclusion
Our proposal method is finding a closer node to the
destination out of 2-hop neighbors of a sender. Our
proposal method shows a better performance than
GPSR in terms of routing path selection and void
problem. Especially, in Border surveillance WSN, our
proposal method is efficient because it uses smaller
number of hops to the destination.
Acknowledge
Foundation of Korea (NRF) grant funded by Korea
References
[1] I. F. Akyildiz et al., Wireless sensor networks: a survey,
Computer Networks, Vol. 38, pp. 393-422, March 2002.
[2] B. Karp and H. Kung, GPSR: Greedy perimeter stateless
routing for wireless networks, in Proc. MobiCom, 2000, pp.
243254.
- 636 -
P4-11
New Control Method between Smart Devices Using High Frequencies

MyoungBeom Chung, Hyunseung Choo
College of Information and Communication Engineering Sungkyunkwan University
Suwon, Republic of Korea
nzin@ssu.ac.kr, choo@skku.edu
Abstract
We propose a new near control method for smart devices
using high frequencies. High frequencies are mixed control
signals using a range of 1822 kHz within the audible
frequency range. The proposed method uses only the
microphone and speakers of the smart devices, so no extra
communication modules or communication servers are
needed. In addition, the proposed method can be used by
most smart devices regardless of OS. To evaluate the
efficiency of the proposed method, we developed a music
control application and music player application applied the
proposed method. Then, we experimented with the developed
applications at various distances and achieved a control
success rate of 97%. Therefore, the proposed method could
be a useful method for near control between smart devices.
Keywords: Wireless communication, High frequencies.
1. Introduction
We propose a near control technology using high
frequencies based on the internal microphones and
speakers of smart devices. High frequencies are sound
signals which most people cannot hear and are between
18 kHz and 22 kHz of the audible frequency range. We
use these high frequencies as control signals. Earlier
research using high frequencies applied ultrasonic
waves used by bats for measuring the distance to
objects or finding obstacles, and most researchers
studied tracing the position of people in indoor
environments using high frequencies [1, 2]. Bihler
named high frequencies ultrasound waves and used
them to trigger signals for data transmission to smart
devices [3]. In this paper, we seek to improve the high
frequencies of Bihler and to apply them as control
signals between smart devices at a near distance. The
high frequencies used by Bihler could introduce errors
from sounds in the environment, so we protected
against error generation by using two high frequencies:
the first to control and the second to end it control
signal. The first uses a changeable frequency in the 18
22 kHz range, while the second uses a fixed frequency.
To evaluate the performance of the proposed method,
we developed a music remote control and music player
applications to which we applied the proposed highfrequency method. We conducted a control experiment
of the proposed high-frequency method using the two

developed applications at various distances. The results
showed a control accuracy of 97% within 5 m.
Therefore, the proposed high-frequency method is
useful in near wireless control between smart devices.
2. Control method using high frequencies

The range of proposed high frequencies is between
18 kHz and 22 kHz and two high frequencies are used.
The first high frequency carries control information, so
it uses one changeable frequency from 18 kHz to 22
kHz. The second high frequency sends only control end
information, so it uses one fixed frequency. The
generating time of the first high frequency is m seconds
and of the second high frequency n seconds. The
reason for using two high frequencies in order is to
prevent errors caused by unexpected noises in the
environment. Figure 1 presents an example of the
proposed high frequencies.
Control signals
kHz
21.0
20.0
19.0
18.0
17.0
0
18kHz 0.0
0.1
Received control signals

kHz
21.0
20.0
19.0
18.0
17.0
0
0.1
Decoded control signal
0.2
0.3
19kHz 0.0
0.4
0.5
18kHz 0.0
20kHz
0.6
19kHz 0.0
0.7
20kHz
Noise
0.2
0.3
0.4
0.5
Control
0.6
0.7
0.8
0.9
1 seconds
Noise
0.8
0.9
1 seconds
Control
Figure 1. Example of proposed high frequencies for

control between smart devices
As shown in Fig. 1, when the control device sends 19
kHz for the first high frequency over 0.2 s and 18 kHz
as the second high frequency over 0.2 s, the smart
device which receives the control signals completes
analysis of the high frequencies at 0.5 s and executes a
specific operation (). When the control signal sends
20 kHz over 0.2 s and 18 kHz over 0.2 s in order, the
smart device completes analysis of the high frequencies
at 1 s and executes operation (). In the example
presented, m and n seconds are both 0.2 s. Although
noise occurs from 0.4 s to 0.5 s of the control signal
and another noise occurs from 0.8 s to 0.9 s of the
control signal, the proposed high frequencies work well.
Figure 2 shows the work flow of the control method
using the proposed high frequencies.
- 637 -
ICEIC 2015
Figure 2. Work flow of proposed method

When the control device sends the first high frequency
(), the receiving device uses a fast Fourier transform
(FFT) algorithm to decide whether high frequencies are
from the surrounding environment (). If a high
frequency is detected, the receiving device repeatedly
checks if that same high frequency is sent consistently.
If the high frequency continues for m seconds (), the
receiving device stops checking the first high frequency
and waits for the second high frequency as the control
end signal (). Then, if the control device sends the
second high frequency (), the receiving device
recognizes the second high frequency over n seconds
() and executes a specific operation ().
3. Experiment with and analysis of the

proposed control method
The music remote control application sends the control
signal from the control device and has a toggle button, which
can play and stop songs on the receiving device, and a next
button, which enables moving to the next song (see Fig. 3(a)).
player application starts with the "Music Stop" (Fig. 3(b)).

And when it receives the high frequencies for playing songs
from the music remote control, the music player application
displays song information and plays the song (Fig. 3(c)).
We tested the accuracy of the proposed high-frequency
method when varying the distance between the music remote
control and player applications. The tested distance between
the smart devices was 1 m and 5 m, with 100 tests performed
at each distance using the play, stop, and next buttons. The
test environment was a laboratory with a quiet indoor
environment with a noise level of approximately 40 dB, the
average noise level in homes. Figure 4 shows the results for
distance from the control experiment.
Play
Stop
Next
Count
100
95
90
85
80
1m
2m
3m
Distance
4m
5m
Figure 4. Results of control operations using high

frequencies by distance between smart devices
The accuracy of all control operations within 3 m was
more than 95% and the average within 5m was more
than 95%. While the music player was playing, the
accuracy of the stop and next control was 97%.
4. Conclusion
In this paper, we have shown that the proposed method
can effectively control smart devices at a close range without
a socket server or pairing. This method can easily use any
OS, even if the smart devices have different OS. Therefore,
the proposed high-frequency method can be a useful
technology in networking fields, such as near wireless
communications and near control between smart devices.
Acknowledgment
This research was supported in part by MSIP and MOE, Korean
government, under IT R&D Program[10041244, SmartTV 2.0
Software Platform] through KEIT and Basic Science Research
Program(NRF-2013R1A1A2061478), respectively.
(a)
(b)
(c)
Figure 3. Applications used in the proposed method: (a)
Remote application, (b) Player application when a song
stops, and (c) Screen when a song is playing
The toggle button (), which starts and stops songs
(Fig. 3(a)), uses 19 kHz as the first high frequency and
18 kHz as the second. The next button () uses 20
kHz as the first high frequency and 18 kHz as the
second. We use 0.2 s as m seconds of the first high
frequency and 0.2 s as n seconds of second. The music
References
[1] V. Filonenko, C. Cullen, and J. Carswell, Investigating
ultrasonic positioning on mobile phones, 2010 International
Conference on Indoor Positioning and Indoor Navigation,
IEEE, pp. 1-8, September 2010.
[2] V. Filonenko, C. Cullen, and J. Carswell, Asynchronous
ultrasonic trilateration for indoor positioning of mobile
phones, Web and Wireless Geographical Information
Systems, Springer Berlin Heidelberg, pp. 33-46, April 2012.
[3] P. Bihler, P. Imhoff, and A.B. Cremers, SmartGuideA
smartphone museum guide with ultrasound control,
Procedia Computer Science, 5, pp. 586-592, April 2011.
- 638 -
P4-12
Securing an Infrastructure for Wireless Sensor Networks

Daehee Kim, Jaekeun Yun, and Sunshin An
Department of Electronics Engineering, Korea University, Seoul, Korea
{dhkim, jkyoon, sunshin}@dsys.korea.ac.kr
Abstract
In this paper, we propose a framework for securing
an infrastructure for wireless sensor networks which
manages sensor nodes efficiently, provides users with
enhanced services such as mobility and location based
services for wireless sensor networks, and offers open
interfaces to internet of things (IoTs).
Keywords: Infrastructure, wireless sensor networks,
security.
1. Introduction
We have already proposed an infrastructure for
wireless sensor networks (IWSN) which manages sensor nodes efficiently, provides users with enhanced
services such as mobility and location based services
(LBS) [1][2]. Furthermore, an IWSN offers open interfaces to internet of things (IoTs).
Figure 1 shows a simplified structure of the IWSN.
The IWSN consists of three layers of entities which
include users, an IWSN itself and wireless sensor networks (WSNs). Users are ones that want to get information from WSNs and the IWSN serves as an infrastructure to collect data from WSNs and deliver it to
users. WSNs actually gather a variety of information
required by users. In addition, the IWSN can support
mobility management of WSNs and LBS by interacting
with WSNs.
In this paper, we propose a framework for securing
the IWSN which not only authenticates and authorizes
users but also protects the IWSN and WSNs. The rest
of this paper is organized as follows. Section 2 discusses security requirements of the IWSN and Section 3
proposes how to secure the IWSN. Section 4 concludes
the paper.
2. Security requirements for an IWSN
Since the IWSN is composed of three parts of entities, there are three different interfaces which require
different security requirements. The first one is an interface between users and the IWSN. In this interface,
the IWSN has to authenticate and authorize users and
vice versa. Moreover, messages between them should
be confidential to themselves only. The second interface is one between servers inside the IWSN where
servers have to authenticate each other and the exchanged data must be encrypted so that data cant be
revealed to others except users. The last one is an interface between the IWSN and WSNs. They have to authenticate each other and the exchanged data between
them must be exposed to the outsiders.
3. Securing an IWSN
In this section, we propose a framework for securing
an IWSN considering both security requirements and
characteristics of each interface.
First, lets think about the interface between users
and the IWSN. Recently, most users make use of web
browsers as a client program, and thus, it is reasonable
HTTPS [3] to protect this interface. HTTPS can provide server-side authentication using a certificate which
is signed by root certificate authorities. Since the public
key of root certificates are preloaded in the web browser, users can verify the certificate of a main control
server (MCS) which is the main server in the IWSN as
shown in Figure 1. The MCS can authenticate each
user with the identity and the password which has been
already registered to the MCS using on-line or off-line
contact. After authenticating each other, the MCS
shares a symmetric key for encrypting data between
itself and users, and authorizes users according to the
user profile stored in the home location server (HLR).
Inside the IWSN, there are various servers to support users and manages WSNs as depicted in Figure 1.
The MCS control overall operations of the IWSN, the
HLR stores the information of each user, and the location management server (LMS) manages the location
- 639 -
ICEIC 2015
Users
Infrastructure for
WSNs
Home Location
Register
Main Control Server
Location Management Server
Gateway
Sensor node
WSNs
Figure 1. A structure of an infrastructure of wireless sensor networks

information of WSNs to support LBS. Since the IWSN
is supervised by one provider and uses the IP network,
using IPSec [4] is the best way to protect servers. More
specifically, we employ IPSec in the Transport Mode
because each server has the capability to perform IPSec
processing and can easily share the security associations between themselves. To support authentication
and confidentiality at the same time, ESP headers are
used in the IWSN.
WSNs interface with the IWSN via gateways as
shown in Figure 1. The gateway serves as a base station
which is responsible for WSNs. To authenticate each
sensor node, one master key is preloaded in each node.
Upon entering a new WSN, the sensor node sends a
join request message with its identity (ID), a nonce,
and a message authentication code (MAC) with its
master key to the new gateway. When the gateway receives the message, it searches for the master key of the
corresponding node with the ID and verifies the MAC
with the key. If the MAC is verified as valid, the gateway regards the node as the authenticated one and
sends a join accept message which includes the received nonce with a MAC using the master key shared
with the node. Upon receiving the message, the sensor
node also authenticates the gateway and starts to establish a symmetric key with the neighboring nodes.
fidentiality for each interface. With this security

framework, the IWSN can be applied to various useful
applications. Moreover, the IWSN will be integrated
with IoTs securely and gracefully.
Acknowledgements
Foundation of Korea (NRF) grant funded by Korea
References
[1] D. Ko, D. Kim, B. Kim, S. Kim, J. Jange, and S. An,
WiMoS: Wise mobile sensor networks a study on design of
infrastructure for supporting mobile WSNs in wide area, in
proceedings of High Performance Computing and Simulation, IEEE, pp. 431-436, 2012.
[2] D. Kim and S. An, Wireless sensor network infrastructure for vehicular ad-hoc networks, in proceedings of the 6th
Biennial Workshop on Digital Signal Processing for InVehicle Systems, IEEE, pp. 145-147, 2013.
[3] E. Rescorla, HTTP over TLS, RFC 2810, IETF, May
2000.
[4] S. Kent and K. Seo, Security architecture for the Internet
Protocol, RFC 4301, IETF, Dec. 2005.
4. Conclusions
In this paper, we have investigated how to secure
each layer of the IWSN. Our scheme provides the required security services such as authentication and con-
- 640 -
P4-13

!!"#$%&#'(#
$)*#"+$
&,-(-

$

/ 2

. / 02 .1
3 4 4 &
(/ &5 4#
3 0.671 &
(/ 8 & /
.67
( 4 & / 2 .
3

!"

$

$
$

$
/ 5

#

/

!" !

"

$#

%
!"

!"

')(&* +',-./ 0
!"

$

$

+1./
2
!"
!"
,

+3. $

/

/

!"

4
/ '/
,$

$

!4

$

!" /

$

-,! !" / $

,

/ 2 $
$

$
$

#$%$&'
((

((( '
" $

$
,

6 $ $

'/(/

978'- $

;
'/3(

:4
$

;
'/1=< +<./

;
$

$
$
$

-&&/

$
4
/-/
$

$
$
4
/1/
4
/ 1/

&/=( $

/

$ 4
/1
$

4
/ 3/ 2 $
- 641 -
ICEIC 2015

'<3>/< $

,
$ / 5 '-

#

$
/ 5

'&

'&&
$

$ / $

-1/',
$
/ 5

(
')<

$
$ $ 6 /
$

? $ $
$
,

$
/2 $
$ $

$

$,

!"
!

"
+',-./
#$,$-"('( $

)"

$# $ 0
@

7 A
4

B "

@
2
4 7

-&'1A4,-&'1''-&&=-=>/

*(
#$.$ " '' (

'/' "(#$%0$

+'./$ C47
, ,
0 2 7

7

CD :
$ /-3/
==,(=-&&>/
+-. E/ 5 9/ F CA
$,
!

G ! 0
"
,
C2GGG7 / /: /
/-1-&''/
+1. 9/ 5 "/ 7/ 4# / 7 H7

G

: @
I D/ @

"

/'/(1,'&&-&'-/
+3.!/: /: D/7#@/B
J/ C5

CB D//
7 / K ## B$ # K ?
/ %+ / -'>,--&
-&&=/
+<. G;
" :4
G;
" 978'-
$$$/
//#/

#$1$
' "'
( $

- 642 -
P4-14

##"!!#$
%
',+&+ +++*++*)+(+,!!
'!&+*++*+ +(+,!

%!&''

+ * + + +

,. + *+ +/#
+,++ 10 + +/
+2+ /# 10
+3 4+ 10++
+ +! . 56 +7
++#
# ,. ,! + /
+ + + 56 +
.+*.8++++++
+.+* 56! *
56 + +
/.+9++/#+

#$"# % '&( ##%!)+*
" (-,-
. '( )+*
##% &(' )+* )(( . +&( *'(!

(. ; ' . (- ( (
. .( 7 )+* - ' ( ##% . 1
( ( 0 ( ( 0 . - ( 0 ..(
.&( 0 '''7 % ' ( ( &(
(( ' '&. 0 ( ( '(( 0 ( ''' 7 < -
(( ('-&' --(##%. 1 ( (
' '. . - (7 % . 1 ( '
0 .( ##% &1 ' 9&- . ( - 1 ' -
''' ' -- ' ( - '&&(
(0(0 .( (200.( 17
##% 0 ' )+* . 0 ( )! )+*
02. )=!' - '''0 (')+*&.''7
% ( '( .( '(&' ( ( )+* &( '7
= '()'' .- )+*&- . '( ' ((
0 ( ##% ' ( ( ( ( ##% . 1
( (7 )( ( ##% . 1 ( ( ( )+*
. 0 ( 0( ''(7. &.(-''
' (.( ( ( ##% . 1 ( ( )=
'' ' ( .. ( ( . 1 )+*
&- . ( ( ' ((((##%' ( (7
%##%' ( (. 1'( ')=''
( ('(( ' '' ''.. (
()+*. 0 ( 0( ( ' ('((
##% . 1 ( (7 >& . 1 (
( ' '' '' ( ##% . 1 ( ( '
2- ( '2'( (( ( -'( &.( 0 (
( ' '' ''567
"!#$

/ ( &1 00 . ( ( '&( 0 #$"
(&2- 0' #$" - .
'( 3( ( .-- #$" #
% '&( ##%! ( - 0 44 56567 )(
&' (##%'. 1/ / ( ( -( !
-1-( (' '( .'( 3( &.''1
(&'(8'7
/ ( ' && &&' 00 . ( )+*
. ' 0 ##% ''( 2 -
. '( ( ' '' 0 .( ( . (-

9 '( ##% )+* &.''7 % ' && ' 3
' 0--': / '.( 2 0 11 ##%
( 9 '( ##% )+* &.'' -- 2 '. 27 /
'.( ( &&' )+* . ' .-
-
. '( ( ' '' . ' -- 2
&' (7/ '.( 80. .- ' --2
1 7

(!

' . )+* '. ( . .( '
'..''0- - 0 ( ( ' (( &.( ' . 1
20 (' 1-- 7? (+%%
( &
( ! ''- (( ( ( ' (( &.( ' (
1 ( (( ' '' -- ( &1 (
- 643 -
ICEIC 2015
;- (7 ( 1- 0 ( ' (( &.(' (
&&- .( ' ' 2- 2.' ( . 1
' &.'' - 1 - ' && ( -'(
&.('7
%. ()+*0 .( 0##%.--''-(
-(&.('(( 10(&-
(-
2.' ( ' ( . '
( & - .'
(( ' '' 7%. .1 (( '&2-
&&' ( &&- .( 0 -
. '( )+*
. '0##%7
( '(& 56(' . 2( &

(
()+*
02.- '!7

+"!) ( - 0( 0##%-
. '( )+*
-
#''

)
''
)=
''
/ 0(
,'. &(
/ .(' (( ( ##%

,-
. '( ' ( ( '&&('
)+*0- -. '( )+*
/ .(' ( @%$ ( (
)+*
. ( )+* 02. '
02.
' ( 0 ( ##%
( '(& . 1 ( (7
/ .(' ( - 2
. ( ( ' ((
) 1-
&.( '- 1 ( (
-
##% . 1 ( ( 0
( -&.'' 7
%2- '' 0( ( 2 (

##% )+* ' - ''' 0 -
. '(
)+* . ' (( . (' 0 (
9 '( ##%)+*' - '''7

)
*"!"9&-( 0(-
. '( ( ' ''
,!-+$

/ = 7 1- - '' ( 9
(-2- -( . 0 ( ;'( ( ' ''
&.( ( 1 ( ( . 17 /0 ( ( ' ((
&.( 1' -( ( 1- - 1 0 (
&.( 1' (.( ( ' ' '-''
'.7 %' ( .1 -( . 0 ( -'(
&.( '- 2 ( ( .. ( 0 ( - (
1 - 1 -(& 2.''-''7
' ( 21 -' ' ( ##%
. 1 ( ( (.(' ( -'' 0 &.( ( ( (
' ')=''((##%' ( ( (
( ( ( &0' ( 0-- -
. '(
( ' '' . ' :

# /
'+0+

*

1$

+.
'
*

2
+

*

1$+.
'
*
2

=..('( ( 0(+%%&
(
(
)+*02.- '!1-. 2 0((
' 2 .-' )+* 02. ( '(& 56!
( ( )= ''7 )+* 02. ( '(&
.'& ' ( ( ( '( ( 0 ' ( )=
'' ( ( ' 7 >' ( )+* 02.

/ ( ' && &&' 00 . ( )+*
. ' 0 ##%7 ? -' &&' ( 0
9 '( ##% )+* ' - &(.- 2
'0- 0( ( ( ' - ''' 0 (
&&' )+* . '7 % ( ' )+*
. ' . . ( 0 ( (00 .
'(0-- A.( ( ( ( 2 '2&( -
(( '&(. ( 7

.+*

% ' '. ' '&&( 2 ( #/$ # '( 0
. . /% =( $- ! (
/%+ '&&( & @/$)
48
44
8
4!
'&1 '2(@/$)

56 7 7$ ) 7

= 7: ##%: ) " #$" ( 0
#-( ,- 11(/ ( (7/ :/"""#-(
&&B4
BC1-74
#. 4!

56 /<D/" / 44B
00 . . .
- 1 ( ' 1 (' E $( : #$"
# % '&( ##%! 48!

56 /<D/" 44B
=,)# ) ( - (. - ' 0
#$"# % '&( ##%!- 48!7
- 644 -
P4-15
An Outlier-based Heavy User Detection and Penalization Algorithm

for the Fair Bandwidth Allocation in the Internet
Young-Min Kim, Hak-Suh Kim, and Hea-Sook Park
Electronics and Telecommunications Research Institute
injesus@etri.re.kr
Abstract
2. Proposed Algorithm
The rapid increase of Peer-to-peer (P2P) services

causes heavy users to consume much more network
resources. In order to detect such heavy users, this
paper proposes a new algorithm which considers both
the number of bytes and flows concurrently. Especially,
the algorithm takes the concept of outliers to detect the
heavy users more accurately. Simulation result shows
that the proposed algorithm can successfully provide
the fair bandwidth allocation to all the users by
penalizing the found heavy users under the network
congestion.
Keywords: user fairness, bandwidth allocation, outlier
detection, heavy user.
1. Introduction
Together with the growth of the Internet, there have
been continuous demands to achieve a fair bandwidth
allocation. In the past, an equal bit for each flow seems
to be fair. In this reason, many scheduling algorithms
had been proposed to provide an equal bit rate.
However, the emergence of P2P services changes
the concepts of fairness. Usually, the P2P services use
many more flows, typically 5 or 50 times than the
previous services [1]. That is, if preserving equal bit
rate for each flow, the P2P services uses the bandwidth
5 times more than the other services. In this situation,
when the congestion occurs, the other services except
P2P also experience the quality degradation although
they rarely use the network resources.
In this paper, we propose a new algorithm to prevent
the above problem. The concept of the algorithm is
simple: it just tries to discriminate heavy users who
consume a larger bandwidth while using many more
flows such as P2P services, and then penalize them. By
doing this, the network can prevent the heavy users
from consuming almost all of the network resources.
The proposed algorithm is mainly composed of two

parts: heavy user detection and its penalization.
2.1. Heavy User Detection
Previous research only concerns the used bytes of
each flow and hence the research does not applicable to
discriminate the P2P services which use multiple flows.
Comparison to that, the proposed method additionally
considers the number of flows per user simultaneously.
Especially, in order to distinguish heavy users more
accurately, the proposed algorithm adopts the outlier
technique which is used to find the abnormal samples
in the statistics. In addition, it uses two outlier methods
[2], modified z-score and boxplot, at the same time.
Figure 1 illustrates the pseudo code of the proposed
algorithm to distinguish heavy users, when the used
bytes per user are given to be B = {bi , i = 1, 2, , n} where
i is the index of users. At first, the algorithm applies
the modified z-score method to B = {bi } (line 2, 3), and
then also applies the boxplot method (line 5, 6). Each
method returns its own result ribyte _ z score , ribyte _ boxplot to
describe whether bi is a normal user or not (line 4, 6).
Based on these results, the algorithm decides the heavy
Require: B = {bi } , where i = 1, , n
1: for i = 1 to i = n do
2: compute MAD for the modified z-score method
3: compute z ( bi ) which is the z-score value for bi
4: ribyte _ z score = ( z ( bi ) 3.5 ) ?1: 0
5: compute the fence range for the boxplot method
6: ribyte _ boxplot = ( bi fence ) ?1: 0
7: ribyte = ribyte _ z score + ribyte _ boxplot
8: if ribyte = 2 then bi is super-heavy user.
9: if ribyte = 1 then bi is heavy user.
10: if ribyte = 0 then bi is normal user.
11: end for
Fig. 1. Pseudo code to distinguish heavy users when
the used bytes per user are given.
- 645 -
ICEIC 2015
Fig. 2. The simulated network
Fig. 3. The number of used bytes
users (line 7 ~ 10) in terms of B = {bi , i = 1, 2, , n} .

The above procedures are also applied into the flow
usages F = { fi } where fi is the used flows by user i ,
and computes ri flow to decide heavy users.
On the basis of ri flow and ri flow , the algorithm finally
decides the heavy user as the table below shows.
Table 1: Final decisions on heavy user
ribyte
ri flow
Final decision
Super heavy
Super heavy
Super heavy user
or heavy
Super heavy
Normal
Heavy user
Heavy
Super heavy
Super heavy user
Heavy
Heavy
Heavy user
Normal
Normal
Normal user
2.1. Heavy User Penalization
Once the super heavy or heavy users are chosen, the
algorithm determines the policy to penalize them. The
policy may adjust the drop rate of the packets or
prevent the generating new flows belong to them. This
algorithm takes the packet drop policy and its drop rate
is calculated as follows.
b med ( B )
, where med ( B ) is the median of B = {bi } .
dropi = i
bi
It means that the algorithm adjusts the number of used

bytes by user i to be the median value of B = {bi } .
In order to evaluate the performance, the proposed
algorithm was simulated using NS-2 simulator [3]
under the simple network as seen in Figure 2. There are
10 sources and 100 destinations; each source generates
the flow towards randomly chosen destination. The
inter-arrival and holding times of all flows are
exponentially distributed; and the size and inter-arrival
of the packets in the flow are also exponentially
distributed. Especially, source #0 has a much higher
probability to generate generates the flow than the
others. Accordingly, source #0 may be detected as a
super heavy user by the proposed algorithm.
Fig. 4. The number of dropped Bytes
Figure 3 illustrates the number of bytes used by each

user with respect to the simulation time. To improve
the readability of the graph, we only depict the ones of
source #0, #1, and #2. The fluctuation of the graph
originates in the dynamic natures of the simulated
environments. Especially, compared with the number
of used bytes by Src #1 and Src #2, the one by Src #0
tends to increase and then decrease. It implies that Src
#0 uses many bytes compare to the others; so, the
algorithm detects Src #0 as a super-heavy user and then
penalties it.
Figure 4, which illustrates the number of dropped
bytes per user with respect to the simulation time,
depicts the results got by the penalization. It shows that
the traffic by Src #0 is dropped because it was detected
as a super heavy user. After experiencing the drop, the
penalty is released because the used bytes of Src #0
decrease. Then, Src #0 tries to generate the traffic, and
then gets a penalty again after a while. Figure 4 depicts
this continuous tendency.
4. Conclusions
In this paper, we propose a new algorithm, which is
capable of detecting and penalizing heavy users, for the
fair bandwidth allocation to all users. The algorithm
especially uses the outlier techniques to detect the
heavy users more accurately. Simulation result shows
that the proposed algorithm successfully finds the
heavy users, and prevents them from consuming almost
all of the network resources.
Acknowledgement
of MSIP/IITP [KI10044556].
References
[1] Bob Briscoe, A Fairer, Faster Internet Protocol, IEEE
Spectrum, pp. 38-43, Dec. 2008.
[2] V.J. Hodge and J. Austin, A Survey of Outlier Detection
Methodologies, Artificial Intelligence Rev., vol. 22, no. 2 pp.
85-126, 2004.
[3] Network Simulator - NS-2 [Online]. Available:
http://www.isi.edu/nsnam/ns/
- 646 -
P4-16
A Relay Selection Method for Relaying Systems with

Simultaneous Wireless Information and Power Transfer
Sumaila Mahama and Kyoung-Jae Lee
Department of Electronics and control Engineering,
Hanbat National University, Daejeon, Korea.
E-mails: sumaila.mahama@yahoo.com, kyoungjae@hanbat.ac.kr
AbstractSimultaneous wireless information and power

transfer (SWIPT) is a promising new solution to provide a
perpetual lifetime for energy constrained nodes in wireless
networks. In this paper, we consider a wireless sensor relay
network, where a selected relay node forwards a radio
frequency (RF) signal from a source node to a destination
node by rst harvesting energy from the RF signal. We
propose relay selection schemes in order to obtain the best
average rate in the relaying SWIPT system. The simulation
results show that the throughput of the system increases as
the number of relay nodes increase.
Index TermsSWIPT, amplify-and-forward, outage probability, throughput, ergodic capacity.
I. I NTRODUCTION
Fig. 1. System Model
IRELESS communication networks have seen

tremendous growth over the past few decades. The
price paid for this enormous growth in communication
systems is an increase in their energy consumption. In line
with the contemporary trend towards renewable energy
sources, energy harvesting appears as a viable solution
to powering wireless network nodes [1][3]. Conventional
energy harvesting methods are based on solar, wind, vibration, and thermoelectric effects [2][5]. A new approach
to energy harvesting is simultaneous wireless information
and power transfer (SWIPT), which refers to using the
same radio frequency (RF) signal to transport both energy
and information at the same time.
In this paper, based on the analytic result in [6], we
study an amplify-and-forward relaying wireless sensor
network with SWIPT. The analytical expressions for the
achievable throughput derived in [6] is used to optimize
the relaying path for a delay-limited transmission mode.
Simulation results demonstrate that the throughput of the
system increases as the number of relays in the system
increase.
II. S YSTEM M ODEL
We consider the wireless sensor network shown in Fig.
1. It is assumed that the source node has no direct link
to the destination node. An intermediate relay node is
therefore selected to assist the information transmission
from the source to the destination node. The chosen
relay node rst harvests energy from the received RF
signal and uses the harvested energy for re-transmitting
the information. We assume that there is no instantaneous
channel state information (CSI) at the source or relay node.
This research was supported by Basic Science Research Program
through the National Research Foundation of Korea (NRF) funded by the
Ministry of Science, ICT Future Planning (NRF-2013R1A1A1060503).
Only the distances from the source to the relays, d1,i and
from the relays to the destination, d2,i will be exploited
for selecting the optimal relay.
An amplify-and-forward system with the power
splitting-based relaying (PSR) protocol in [6] is considered
in the relay node. The total transmission time T is divided
into two halves. T/2 is used for the S-R transmission and
T/2 is used for the R-D transmission. In the rst phase, a
fraction of the received signal power at the relay, P, is
used for energy harvesting. The remaining received power,
(1 )P is used for transmitting the information signal to
the destination, where 0 1 is the power fraction.
The received signal is amplied and forwarded to the
destination by the harvested energy. The baseband received
signal at the destination is then given by

|hi |2 i (1 i )Ps hi gi s

yd =
2
d
Ps |hi |2 (1 i ) + d
1,i d2,i
1,i r

signal part
(1)

Ps |hi |2 i gi zr
+
+ zd
2
d
Ps |hi |2 (1 i ) + d
2,i
1,i r

overall noise
where 0 1 is the energy conversion efciency, hi

and gi are the S-R and R-D channel gains respectively,
zr and zd are the overall AWGNs at the relay and
the destination nodes, respectively and r2 is the overall
variance of the AWGNs at the relay. The SNR at the
destination node, is given by (2), at the next page. For
a xed source transmission rate, R = log2 (1 + 0 ), where
0 = 2R 1. Thus, the outage probability pout is given
by pout,i = p(D,i < 0 ). From the results in [6], the
- 647 -
ICEIC 2015
D,i =
Ps2 |hi |4 |gi |2 i (1 i )

2
2 2
2
+ d
2,i d (Ps |hi | d1,i (1 i ) + d1,i r )
2
Ps |hi |2 |gi |2 d
1,i r i
(2)
throughput, i at the destination node with the i-th relay

is given by
i = (1 pout,i )R
1
T /2
= (1 pout,i )R
T
2
(3)
III. R ELAY S ELECTION S CHEMES

In this section, we propose two relay selection schemes
which depend on the relative distances of the relay nodes
from the source and destination nodes, d1,i and d2,i
respectively.
A. Maximum Throughput (MT) scheme
1) The transmitter estimates relay distance d1,i and d2,i
for i = 1, . . . , K.
2) Throughput values for each relay for all values of
0 1 are calculated from (3).
3) The highest throughput value for each relay, i is
obtained using exhaustive search (ES)
4) Find the optimal value of , i
5) The best relay is selected as iopt = argmaxi {i }
6) Obtain opt , d1opt and d2opt for the optimal relay.
The optimal value of , opt , can be found analytically by
line search (LS). This is implemented in this paper using
the golden section search method [7].
Fig. 2. Throughput at the destination node with respect to the number

of users
B. MinMax scheme
The selection algorithm is as follows:
1) The transmitter estimates relay distance d1,i and d2,i
for i = 1, . . . , K.
2) For each relay, the maximum of d1,i and d2,i is
calculated i.e di = argmaxi {d1,i , d2,i }
3) The optimal relay is selected as iopt = argmini {di }
The distances d1opt and d2opt of the selected relay are used
to obtain opt which is used to evaluate the throughput of
the system.
IV. S IMULATION R ESULTS
In this section, simulation results are presented to
evaluate the performance of our relay selection schemes.
Throughout the simulation we assume the same parameters
as used in [6]. Fig. 2 shows the throughput with respect
to the number of users. It is seen that the throughput
increases with the number of users. This is because, an
increase in the number of users increases the selection
diversity, which increases the system throughput. The MT
outperforms the MinMax scheme. This is because the MT
is obtained by an exhaustive search over all the relays.
However the MinMax scheme has a lower computational
complexity. The MT scheme with exhaustive search (MTES) achieves almost the same performance with the MT
scheme with line search (MT-LS). Fig. 3 shows the performance of the relay selection schemes with various values
of transmit SNR. As can be seen, the MT outperforms the
MinMax scheme.
Fig. 3. Throughput at the destination node with respect to the transmit

SNR
V. C ONCLUSION
In this paper, two relay selection schemes, MT and
MinMax, based on the PSR protocol for an amplifyand-forward wireless sensor network have been studied.
To determine the throughput at the destination, analytical
expressions for the outage probability is derived for the
delay-limited transmission mode. Simulation results indicate that the MT achieves a better performance than the
MinMax scheme.
R EFERENCES
[1] B. Medepally and N. B. Mehta, Voluntary energy harvesting relays
and selection in cooperative wireless networks, IEEE Transactions
on Wireless Communication, vol. 9, pp. 35433553, Nov 2010.
[2] C. K. Ho and R. Zhang, Optimal energy allocation for wireless
communications with energy harvesting constraints, IEEE Transactions on Signal Processing, vol. 60, pp. 48084818, Sept 2012.
[3] O. Ozel, K. Tutuncuoglu, J. Yang, S. Ulukus, and A. Yener,
Transmission with energy harvesting nodes in fading wireless
channels: Optimal policies , IEEE Journal on selected areas of
communication, vol. 29, pp. 17321743, Sep 2011.
- 648 -
ICEIC 2015
[4] J. Xu and R. Zhang, Throughput optimal policies for energy
harvesting wireless transmitters with non-ideal circuit power, IEEE
Journal on Selected Areas in Communications, vol. 32, pp. 322332,
February 2014.
[5] S. Luo, R. Zhang, and T. J. Lim, Optimal save-then-transmit protocol for energy hervesting wireless transmitters , IEEE Transactions
on Wireless Communications, vol. 12, pp. 11961207, March 2013.
[6] A. A. Nasir, X. Zhou, S. Durrani, and R. A. Kennedy, Relaying protocols for wireless energy harvesting and information processing,
IEEE Transactions on Wireless Communications, vol. 12, pp. 3622
3636, July 2013.
[7] W. E. Mayo and M. Cwiakala, Introduction to computing for
engineers. New York : McGraw-Hill, 1991.
- 649 -
P4-17
A Relay Selection Method Based on Ergodic

Capacity For Amplify-and-Forward MIMO
Relays
Roger K. Ahiadormey and Kyoung-Jae Lee
Department of Electronics and Control Engineering,
Hanbat National University, Daejeon, Korea.
e-mail: rogerkwao@gmail.com, kyoungjae@hanbat.ac.kr
AbstractIn this paper, we propose a simple relay selection

scheme based on ergodic capacity approximations for MIMO
amplify-and-forward relay networks. Simulation results show
the efcacy of the proposed method.
Index TermsMIMO relay, amplify-and-forward relaying,
relay selection, ergodic capacity, relay networks
I. I NTRODUCTION
N recent wireless communication systems, multipleinput multiple-output (MIMO) relay transmission is an

important technique to extend cell coverage and improve
link performance [1] [2]. The capacity of MIMO relays has
been studied and the ergodic capacity of MIMO amplifyand-forward (AF) relays has also been analyzed in various
asymptotic antenna regimes [3]. A relay selection method
is one of the popular approaches to overcome fading
effects in a wireless relay channel due to its simplicity. In
single-input single output (SISO) relaying systems, various
relay selection schemes have been investigated [4] [5].
In this paper, we propose a relay selection scheme for
MIMO AF relay networks. Our relay selection scheme
selects the relay which maximizes the ergodic capacity
between the source and the destination using the distance
information at the relay users. First, we derive expressions
of the asymptotic ergodic capacity in the presence of
pathloss using the distances at the relay users between
source and destination. Then, we propose a relay selection
scheme based on the derived expressions which does not
include channel state information (CSI) at the source. This
algorithm is compared with a simple minmax distancebased relay selection algorithm which is a sub-optimal
scheme.
This paper is organized as follows. Section II describes
the system model for the MIMO AF relay network.
In Section III, we revisit ergodic capacity expressions
and propose a new relay selection scheme. Section IV
presents the simulation results. The paper is terminated
with conclusions in Section V.
II. S YSTEM M ODEL
In this section, we describe the system model for the

wireless relay network shown in Fig. 1. The source and
through the National Research Foundation of Korea (NRF) funded by the
Ministry of Science, ICT Future Planning (NRF-2013R1A1A1060503).
Fig. 1. MIMO AF Relay Network
the destination are equipped with M and L antennas

respectively. The i-th relay user is equipped with Ni
antennas and operated in the time duplex (TDD) halfduplex mode. We assume that there is no direct link
between the source and the destination. Also, it is assumed
that the relays and the destination have full CSI, and the
source does not know the CSI.
In the rst time slot, the source transmits its signals
s to the K different relays. For the i-th relay, the Ni
dimensional received signal vector ri at the relay node
is given as ri = Hi s + ni for i = 1, , K where Hi is
the Ni M channel matrix from the source to the
i-th relay. The received power at the relay node from the
source is given by S1,i PT where S1,i = dp
1,i denotes the
propagation pathloss with the pathloss exponent p due to
the distance d1 ,i between the i-th user and the source.
The received signal at the destination y in the second
time slot can be denoted by y = Gi Fi Hi s + Gi Fi ni + zi
where Gi is the L Ni channel matrix between the
i-th relay and the destination, and zi is the complex white
Gaussian noise vector with zero mean and the covariance
matrix z2 IL . Fi is an Ni Ni weighting matrix. The
- 650 -
ICEIC 2015

L
S1,i S2,i PT PR Ni (bM N k + aM N )
1
Ci =
log2 1 +
L
2
n2 z2 LM + n2 S2,i PR Ni M + z2 S1,i PT i=1 (bM N i + aM N )
k=1

M
1
S1,i S2,i PT PR Ni (bLN k + aLN )
Ci =
log2 1 + 2
2
z M (S1,i PT Ni + n2 M ) + n2 S2,i PR M (bLN k + aLN )
(1)
(2)
k=1
received power at the destination is given by S2,i PR

where S2,i = dp
2,i .
The instantaneous capacity of MIMO AF relay systems
was given in [3]. The ergodic capacity E|C| can be found
by taking an expectation over all channel realizations. The
ergodic capacity was analyzed in the asymptotic regime for
three cases to obtain the closed form expressions in [3].
III. A NALYSIS AND R ELAY S ELECTION
In this section, we review the closed form expressions
for the ergodic capacity of MIMO AF relay systems in
the large antenna regime and propose new relay selection
schemes. We derive the expressions with pathloss for the
asymptotic cases in Theorem 2 and Theorem 3 in [3]. The
two cases provide good approximations for the ergodic
capacity.
IV. S IMULATION R ESULTS

In this section, we present the simulation results for the
performance of the two relay selection schemes. In our
simulation, we assume that PT = PR = P and n2 = z2 =
1, and the signal-to-noise ratio (SNR) is dened as P /n2 .
The source antenna is set at 4, the destination antennas at
6 and p = 4 is the pathloss exponent.The antennas for the
relay users range from 1 to 16. Relay users are randomly
generated with a uniform distribution. After relay selection
in the two schemes, the simulation results are plotted by
using monte carlo simulations.
Fig. 2 shows the average ergodic capacity performance
with the transmit SNR. From the gure, we see that the
approximate ergodic capacity based relay selection clearly
outperforms the simple minmax based relay selection. The
approximate ergodic capacity based relay selection offers
increased performance at high SNR.
A. Large Source and Relay, and Small Destination Antennas

The receive power at the i-th relay and the destination
are S1,i PT and S2,i PR and Theorem 2 is now given by
(1) at the top of this page. This approximation is used for
the case when M L.
B. Small Source, and Large Relay and Destination Antennas
Similarly, Theorem 3 is also given by (2) at the top of
this page. This approximation is used for the case when
M L where aM N , bM N , aLN , bLN and k are constants
dened as in [3]
C. Relay Selection Using Approximate Ergodic Capacity
The relay selection algorithm is summarized as follows;
1) Select the relay with the maximum ergodic capacity
using (1) or (2) as
i = argmax{E|Ci |}
i
D. Relay Selection Using Minmax Algorithm

The sub-optimal minmax relay selection criteria is considered. The relay selection algorithm is summarized as
1) Select the relay with
i = min max(d1,i , d2,i )
i
The relay i is selected to transmit the signals from the

source to the destination.
Fig. 2. Ergodic Capacity vs Transmit SNR
V. C ONCLUSION
In this paper, we have investigated a relay selection
scheme in one way MIMO AF systems. We have proposed
a simple relay selection scheme based on ergodic capacity
analysis and compared with a minmax scheme. Simulation
results have been presented to conrm the performance of
the two schemes.
R EFERENCES
[1] T. M. Cover and A. A. El Gamal, Capacity theorems for the
relay channels, IEEE Transactions on Information Theory, vol. 25,
pp. 572584, September 1979.
[2] B. Wang, J. Zhang, and A. Host-Madsen, On the capacity of MIMO
relay channels, IEEE Transactions on Information Theory, vol. 51,
pp. 2943, January 2005.
- 651 -
ICEIC 2015
[3] K.-J. Lee, J.-S. Kim, G. Caire, and I. Lee, Asymptotic ergodic
capacity analysis for MIMO amplify-and-forward relay networks,
IEEE Transactions on Wireless Communications, vol. 9, pp. 2712
[4] Y. Jing and H. Jafakhani, Single and multple relay selection
schemes and their achievable diversity orders, IEEE Transactions
on Wireless Communications, vol. 8, pp. 14141423, March 2009.
[5] Y. Jing and H. Jafarkhani, Network beamforming using relays with
perfect channel information, IEEE Transactions on Information
Theory, vol. 55, pp. 24992517, June 2009.
- 652 -
P4-18
'
!
&##(#! !

!))*(**$!#
+-,.+,#

!/0+,12+5346

8#8

!!
"7(#
!+-/

$#&
.
*
7+-/

$#&
0
*
7 !!#7+-/

$#&
2
*
7+-/

$#&
6
*
7 !!#
"(
"7+4&3$#&
/96:
!+;
<+=>06?+<#@:/
!/+&/.?:
!

! ! # "#
$
& '
& !% !
# " !
( ) #
#* " & #
+
+" #(

8
8A(1* A81
8!&
#+"
" "
#$!#
B
&
% ## %/ $ # %

"
& -"

! CD+
9= !
#

"+
!" #
"
" -"
*-
E*# "- F
%
&#!

&
#"
E
"
"F
"
$
&
!
# #!
#
% ## + % ## 0?2+ % ## 8+
"
-"
*- ## "# " "

!!##
"C.D
##EF! &! "
%"
! &
" % ## ! &
#" & $#

#%"! & ##! &
""#
!$!% ##
!%"
" #!&
# "
# % #
" "$! ## #

#
& %! #
!!""! &
# ## G#
-"

#
% ##
### " "

###! &+
#
! &

#" #
% ## %/+ !
!!
%
"$! =

#"#
2>=- #C0D8##" &%/
#
$
#
!
# !
#
#

$ %%
!#+ "! %
+ ! #!&+
"
!!
#!
-"
"$!#!
!#%% ##
%/ #

" $ ""
!
" !!
% # %/# #
B" # !
## #
#+ -"

!
""
#
"
" E-"
!
/ !
! F
#!#B#
"

#
!/# %/
& -"

"

C2DA##
"
"%
#""
#
!!
# % !
" 7
! #
%/ !
# %
# #!&
%"$!#
"$!#+
##%+
#$! ## E#F C2HD % "$!# !

!
"

#+ "$!# # "#!$
! +

"
!$

! +
" #
#

!! # # "$!
& !

%
#

& 1!

"$!
# !
" "
+
&
!$

!!
%"$!# "
"$!%

!$
"!
!!
&

#
#
!$
"
"$!#
&!!
"! &%!
"$!#
#
A&
&
#

&
"!!
%
""$!#
- 653 -
ICEIC 2015
!!
% ! "$!#
" "#+ #!
#
7#
#+ &##$!#! "#
8#!#
#
#
" " #$!
"
&B" &
!
#
"
"#%

"
#! "$!#

$B#" "#$!# "$!#

#!
"#
"

!!$&"

# "$!#"!
#
! ""
!!
% "#
"#
!

! "! "
"! "$!#
#
! "$" "#$!#
$"#
#"#
#%
##+
/
#
# !#

" ##

!!

$ &
"

8##"

# "+ !
# # #! +

# ==I !"! !!
!!

%
$

!

. #%#

%/ ! " !
"$!#+! "#+
" "#
8 #
+ % $"

"## !
"

!

###
"%" "$! E!
"+ ! "$!F #"
!

))*(* E*
( *$!F #!#+ !
#
)*(*C0D
#

#"+%
"""$!#
)*(*
# " !
##!
%
!
!
!

"%"""
!

!#!#
!
"
"

#
""%# "!#"!"#% ##
/
" !
!!
!& " !
!

!

"%"#
#&#$!
"
&
88 A(7( 3( A7(8A8 1A37*
(17-1A37(71( 71 A811(1A1 1
!"+8
#%
#"#"#

!!
"

" #$! " A# #
#
!!
%"$!#!
#
#
/&
"

#

"

# !!#
B & 8
# ## $ #

###
!!
""
#$! $
#

####
"
#$! $
+ # "
# #$!
$

A"+ 8#!#
# ## "

!!

##

#!!#$!#
"B##

""

#

"#
!8##

$")
" #
#$!# 8#!#
"
!
"$! B## !!

% #+ 8#!# # "
!!
%
" #$! $
"

#

#"#+""

#
#

"
+
#
#
"
6. &#

&
"+
! "$! " # " "

! 8!
"$!
G
+"$!

+
" "$! ! #

# %
#
"#" #
!!
$&
"

%
"#$!"

. 7
%/ &
- &# "$!#

!!"
"
B#"#$!
# # #+&#
#
B# #$!
" $"#
#
"#
#+ /
#+8
#+
"

!
# !" % "$!#
#
-"
*- #
A*-
#"! #!#
#

!
" & "$!#+

!

!
#!# %
/ "$! #
"
%"$!!
!!0#%#

#!
!
# "$! *+ *.+ *0
#
#"
"
!$""

% "$! 3
# #% 0 #
+ % *2 #
% "$!
!
# % &

!!
&%
/%#
$
"+"

##"## &#!#
#!
!
#!"$!#
""
&
"<# "

#

##$"
"$
!+
""
%#
###
"

##"$!! #
- 654 -
ICEIC 2015
+
*2
+
E F

*.
J
E

*

+
E F F +

3

7

*0
+
!

+
!

E F

0 7
!/
%
!J
888 A7 311J51(71( 71 A818J

1'
"#! 'E
#
!'F
+
%
#""'

4# #
#

#"
<
#<#
4#
#"#
"

# #

/A
#+
#
$

!

#
!
"

((<
#
"

#

"

# #B"
<#
+*(<#

"

#

"

# #
!

##"
< #
(<+
# #$!

# #
##"
!#
<#
'<+

#
#
#
! '
! #
<
#

"#"$"EF
+
+ + +
+

+ + +

+
+ +

A
8#%#

!/
%
!8
#
0+"
""
#
J+#
"

"<# "

# #
8
#
#

""#
"

#
+!
"'++#$!

(<+!
!
!
"
#E.F
#"EFA+%
!#"#$!

#
#+#$!

"$!#

"<#"
&!
!
!
"
#E0F
A788
)
#
E3M*F
E*M3F
E3M*.F
*E*.M3F
7E3M*0F
E*0M3F
JE*2M3F
!!" E2F+ '+

#
$
% =
"
$
'+ # !
!
"
# + #$!

!#

#*(<
#
"

$# &+
%$
'+#$

"
#=+#$!

!
#

# ((<
#
A
. #%#

!
#"#
J*20
!!"A
.+$"$!*2#
!
"
#"

# ##
#
##

J "$! 3+ #$!
#

##"

# #
#

"

((<
A+ # #$
# #
# !
#

"

#
##" 3%$+
##""

#
# #

((<+ # #
# "

"

!
""

# #
"""#
J
A
#+'# ##
=+##
#"$

##""

# #
###
"""
#
J
% #
$ " "+ $
#

#!#

!
"+
"" %
#
% ## 3%$+
# "

#"#!
#
#
&
"
!

!#!
"#
#+$#
#

##"
##

"

+

## A+ % % !

" # ""
# "#
"
!

!#!#
!#
#!$ &+
"#

$ " $" $
# #$!#
!

!#

#"
""

!
#
+%"###$!!
##
#"
"

!#
"%#'N!
##" &
#
!!
##
"#"

'
#"#
"$"" &# /+ + 8+

"
7K-711 48J7A(8 57K8A8J

(77(L7*A(7-
,+

2=- #
2=- #
2=- #
2=- #
2=- #
2=- #
2=- #

H=- #
H=- #
H=- #
H=- #
H=- #
H=- #
H=- #

H=- #
H=- #
H=- #
H=- #
H=- #
H=- #
!/"
A78
- "

0==- #
.2=- #
>=- #
.=- #
H=- #
=- #
#
'
E3M*F
E*M3F
E3M*.F
*E*.M3F
7E3M*0F
E*0M3F
JE*2M3F
- 655 -
7(L8 7(A71A37A(7-A3A3L777(7
*,A7*1(A3775**7*A(7-J
.
2=2=2=2=2=2=2=-
#
#
#
#
#
#
#
.
H=H=H=H=H=H=H=-
#
#
#
#
#
#
#
.
620620620620620620620-
&/
#
#
#
#
#
#
#
=69
=69
=69
=69
=69
=69
=69
ICEIC 2015
A7888
7((81(8A5*1'-8N A1A(7(
-1*7**7L8 7

%#

3#
=

.
0
0
! )
% !

/

8
8#!#
1*$!#
&#0

=.
=2
=H
=>
=>
8#!# $
+ 8
" 8#!#
#
"#
$ " #$! $
# A+ & #

"

#"#"
#"

" + 8#!#

# " #

# " "
#
#$! A+
##$!#
# """
'A
"$! "#
%
## "$! &

!#
&
#8#!#
#"

##&A
0#%#
&
"
$

'N!
##
!!"
! %
# "#
"
"$!
8#"
+"$!# "!
!

%'N!
## &#'N!
##%$
!!

! # !
" 8 !
!
" 'N!
## #

'N!
##+ "$!
"!
## !#

# ! ""

! A
+ "$!#

#
" !$ "

#

##" "

8
!
!
" 'N!
## # ##
'N!
##+
! B# #
<!"& ##"
+ "$!#

##

#"
$#
'N!
##+
"
!
#$!!
###"
" &'N!
##8"$"
'N!
## "
"
# "+ ((< !

!$" ((<N!
##
# E6F & # "" 'N!
##
$# &%(<+O
"'+O% !
##%
EHF
"E9F &#*(<
"((<N!
## &EHFEF+
# ## " 'N!
## "
"

#"
" !
!
"
#E>F
N E F N
+ E N F
+
N

2

""
%
!J
!

N

+
+ !

E N F

N +
.
.
E3M*F
E*M3F
E3M*.F
*E*.M3F
7E3M*0F
E*0M3F
2=2=2=2=2=2=-
H=H=H=H=H=H=-
#
#
#
#
#
#
#
#
#
#
#
#
.
H=H=H=H=H=H=-
#
#
#
#
#
#

0
0
.
.

&#0
&/0
=>
=>
=H
=H
=2
=2
=
=
=
=
=
=
&
!!" A
2+ #
# # H+
!
#
#
##"
"

H=- #A+'!
##
#2#%#

#
"""
%
!J

!$

!##%2+%
##
#

J %! "$! *2
# "$! 3
#
!!" % #
# P

#"
" !$"
8#!
#+*2B#
"

# #
#
#
P

!
" "
# #
J A
6
#%#
!
# % *2 B## % #!# %

! J "+ A
H #%#

*2 #

!
"

"

# #
##"#
#P

# % #
&

!
" #

#!#+ &
##
## #

#!#+&
!
#!###
#

% #
# #+
!
" #!#

#

'N!
##+ #
P " $

#!#

!
" #
J 8
*A(A7A3A*7L8 7(78J7*
#
'
+
A
2#%#"

#

#
##"
#
#
#" #"
A
"

#

#
##""$!##0H=- #
A78L
A7L
% N "
N #

#

$
!
- 656 -
7K-7A3A*2(7'7AA371 A8117
(71( 71(A37A(8 J
#
'
.
.
E3M*F
E*M3F
E3M*.F
*E*.M3F
7E3M*0F
E*0M3F
JE*2M3F
2=2=2=2=2=2=2=-
H=H=H=H=H=H=H=-
#
#
#
#
#
#
#
#
#
#
#
#
#
#
.
H=H=H=H=H=H=
#
#
#
#
#
#

0
0
.
.

=
&#0
&/0
=>
=>
=H
=H
=2
=2
=.
=
=
=
=
=
=

ICEIC 2015
A7L8
# '
7K-7A3A*28(78J7*1-7*A1A1A371 A7**A1AA17*A(7-
.
E3M*F
E*M3F
E3M*.F
*E*.M3F
7E3M*0F
E*0M3F
JE*2M3F
2=2=2=2=2=2=2=-
0
.
H=- #
H=- #
H=- #
H=- #
H=- #
H=- #

.
#
#
#
#
#
#
#
H=H=H=H=H=H=H=-
#
#
#
#
#
#
#
1 0
.
6H.6- #
6H.6- #
6.6- #
6.6- #
2>96- #
2>96- #
26- #

0
0
.
.

=
&#0

2.0 3
=>E6H- #F
=>E6H- #F
=HE6.- #F
=HE6.- #F
=2E2>- #F
=2E2>- #F
=.E22- #F
&/0
=>.6
=>.6
=H.6
=H.6
=2096
=2096
=.6

%"#+'N!
### ##
'N!
##+#
P"
$
!
"#!#
####
J
8L 8-A81(7A**8 81
!

$ $

!
#" "+ % !#" % #!
# '
$# # #
# *' " %!
!
#!#
#" !

'+
"
#!" #
7*' E7
!"F " %!
!

#!#
#"'N!
##"##!
##"
"$!&
"
#"
##"#

6#%#!
#'$
&!
##*'
"7*
' #!# 8 !
# % *' "+ 7*'
"!
"
'$
#"$!#+
#!#++
"!
#H=#!"#+
!# #

" #!
!

# #% H
A+ # "
" 'N!
##
$

!
!#

L
1 81
8 #
+ %
$ #"
#!
!

"
###
"%"""&
"$!
" )*(*
# "

$ 7#*' "
/#

'

#
& " $#
"#!
+$%#
"

#
#"
"#
$"
"#$!

!
#
&+$"#
!"
!A#
#
#%#
#" " !
$
!
# % !$
"+
"
"

#"
### "#
"
"$!#
417*J-7A
A# #
! %
# #"
&
#! !!
(#
!

(#
! "

4
E(F "" & -#& 7"!
E(
.==?==?0>.>F
"
& -8E-#& !!+
8 A
"
F+ 4
+ "
8A( E $!8
A! &(#
! F
#
E8.=23=2=2==?F #$#" &
8E

8A8"#&!&F
(77(7 7
CD -"

!+Q))%%%%"
+.=
C.D -"
- (
# !6+ R*# " "
!!## !
E- F% ##%/#+S.==?
C0D ## 4& *$ # !!
%/ #+ ##
$#

##!!
+($#+.==
C2D -"
+ R-"
!
/ ! ! EF+S -"

!!
*
=+.==9
C6D
$+,"+

/
+J
""
+L+

+4+
" A
+ RA -1-"
#!!

%"
"
"# "%/#+S8777 !
#-

G+$ 22+H+

+1"-1,-/0,

!!"!"#
&$%#' )(
*!""-,+' )(
.!" +' )(

+2
+3
+.
+
+(
+
+4
+5
+*

6
!"

! &7*'
EAQA
!
F
H '

! &*'
"7*'
- 657 -
ICEIC 2015
.>02+.==H
CHD L#$#/&+L-+&
/$+8+
$++-++
"J
+
*+ R"&
! % ## % "# "
! +S 8777 A
#
!# - + $ 9+ +
0.H+.==>
- 658 -
P4-19

!"#$

"
%
&'()

+
'
*, , -. / 0

'1*(2 ( -. / 0
$
+
, , -. / 0
&
+
, , -. / 0
)
+
, , % 3'1( 0
5
44 54
7#(#66 968:5
44 665
4

;

4=>

1(

44

'4
' => 0

(
(
( (( ?( (
2 4 ' ( ( ( @ 0
0
# (

20 !
4
1( (( 0 0 (
(
A 0
4
0 !
" 2
2 (( <+-
(
BC
2 ='>
! BC4 3 (( (0
( (0 A ((

(0
2 4

='> @
( ?D43

( ( (0
A
(
2
( !

B$"EC4 3 0 (

(
"

F
B8"GC4
' ( ! 0? 2

2

2
?
( 4H2(
( A0 (
2

( A 44
''4
'.1<+/1'<.
4 2

1( !
( !((F4(
=>4' 20

4=>

1( A0

4=$>

1(
((
42 !4
'.<-'3'1,<I,1/-,.'.D

1(2A (2

- 659 -
ICEIC 2015
4 A0

3 (! 4 ! ! ( (
(
(6BCJ6K0BC
J ((( ( ( 41(
( ( 0 04 H (

20 (2

6
4=&>
!

1(2A (2

3 (! =&> ( (

2

41( A0 20

4=)>

4=G>

1(

4&4
3(!4$!!((

2
( ! ( 2!( ( ( 0

(
2 4

4& 2

1( !
( !((F4(
=G>41( 20

4=9>

1( A0

4$ A0 2

1 ( 2 ( =)> (

@( A !(
6

4=6>

1(
(( 4)4
BC 4=E>
1(
2

4=8>

6

1( 2 2 ! (! (
2 ( (
A 4
13,'4
./-,<13D,
4) A0
- 660 -
ICEIC 2015
3 (! 4 ) ! ! ( (

(
(6BCJ6K0BC
J ( ( ( ( ( 4
1( (
0 2
0 =6>4 H
(
20 (2

6

13,''4
./-,<13D,
4=>

6

3 (! => ( (
2

41( A0 20

" "
#$

1(2A (
2

4=>
3 (! 4 E ! ! ( (

(
2
( ! (2!(( ( 0

(
2
4
1(

0 20 ( (
D (
2
4

%

=)>
% #

& # % 4

#
1(

484

48
2

1( !
%(
! #%
!( !((F4(

=)>41( 20
&

4E A0 2

1 ( 2 ( => (

@( A !(
6

4=$>
1( A0
&

4=8>
&

1(
(( 4G4
1(
2

6

4=E>

4=&>

1( 2 2 ! (! (

2 ( (
A 4
- 661 -
ICEIC 2015

4G A0

3 (! 4 G ! ! ( (
(
(6BCJ6K0BC
J ( ( ( ( ( 4
1( (
0 2
0 =8>4 H
(
20 (2

&
&

6

4
$

6
$
$

$
=G>

&

./-,<13D,
4=9>

13,'''4
3 (! 4 9 ! ! ( (

(
2
( ! (2!(( ( 0

(
2
4
1(

0 20 ( (
D (
2

(( 4
1 ( 2 ( =9> (

( A !(
6

4=>

1( 2 2 ! (! (

2 ( (
A 4
3 (! =G> ( (

2
2

4 1( A0
20

1(
2

6 $ 6

49 A0
2

4=6>
'''4 I,<-3.,
1(
( 0 (

2
( A 4 1(

2

2
4 64 1(
2
(2
202GBC
(
2
( 2

20 2 9 BC ( A0 B6
64 C4 , 0
2 (( (

@(2
2

(
2
(! ( 2

(2
4
- 662 -
ICEIC 2015
% =.>20(- 0,=."669"
669$GG> 20 ( -'I=- 0 '1
I > % ( "'1=
'
1( 0 ( >

=.'I3"6&" 6&6"&"669>

20
(
.'I3=. '1 ' 0 I

30> 20 (
. ( % D 66"
66)8) !(( ( ( ! @ (
4
46I

2

'L4 <./'<.
H 2
2

2
?(
0
4H 2( (
A0 (
2

( A 4 (
(
A 0
2

20 (
@ ? (("

!

4
3%.<H,+D-,.1
1( ( ! 20 (
I
( ( ( . (
,,,.,
BC %" ( 1?"+ (( M3 0

/ + H - - N ',,, 1
0
;'O I L 4)).464$&E"$)G
.
2 66G4
BC P M3 .! " -
- ' 1( @ N
' ," ( .! + ,0

1( 48E"89664
B$C < !
N
(OFF!!!440 4FRF
LQ.F2
Q 4
B&C 32 0 -4 * H0 4 M
N L'
I =>4$)K)699E4
B)C
4 M3 < ( .
N
',,, 1 3 , 9=&> 49EK$6&
984
BEC L H D4* I4M3L'I0
( -
'
3 0N '
L G=$>
488KG9994
B8C I4 M 1
'
I N

D ('
I E=>46K)9G4
BGC

4 * ! +4 M

D N '
I 496K99GE4
- 663 -
P4-20
RF Output-Threshold Maximal-Ratio Combining for Massive MIMO Systems

Sung-Kyung Jo, Kyung-Tae Jo and Young-Chai Ko
School of Electrical Engineering, Korea University
<skjo1010, reminiscence, koyc@korea.ac.kr>
Abstract
In this paper we propose the RF output-threshold
maximal ratio combining (RF OT-MRC) as a low-power
and low-complexity beamforming (BF) scheme. In our
proposed RF OT-MRC, the signals received from
multiple antennas are combined at the RF domain using
the minimum number of RF chains while the combined
signal meets a certain required signal-to-noise ratio
(SNR) threshold value. We confirm from our simulations
that the proposed RF OT-MRC uses less average
number of RF chains compared to conventional RF BF
depending on the SNR threshold value.
Keywords: Massive MIMO, pilot contamination,
matched filter detection, and zero-forcing detection.
1. Introduction
Simply installing the additional antenna provides the
diversity gain or/and spatial multiplexing gain
depending on the transmission scheme. As such having
many antennas at the base stations (BS) so called
massive multi-input multi-output (MIMO) is considered
to be an enabling technology for the next generation
wireless systems. Note that massive MIMO means the
system equipped with typically more than 100 antennas.
Although there are many benefits from massive MIMO
such as the improvement of data throughput and the
energy efficiency, there are also practical issues to be
solved for massive MIMO to be deployed in reality. One
of those are the pilot contamination which limits the
performance of massive MIMO if it is not overcome and
many intelligent and simple schemes have been
introduced to relax the effect of pilot contamination on
the performance [1]. On the other hand, the hardware
complexity by having multiple antennas is also very
critical issue in practice. Since combining the signals
from large arrays of antennas at the baseband (BB)
domain need to employ the same number of analog-todigital converter (ADC)/digital-to-analog converter
(DAC) and thus requires the clock speed of BB
MODEM run times compared to the single antenna
case, where is the number of antennas. For example,
with 20MHz signal bandwidth, the required ADC/DAC
sampling rate is 40M samples/sec by Nyquist sampling

rate [2] and the clock speed of BB MODEM in the unit
of bits per second needs to be 40M times quantization
size of ADC/DAC. If we have 100 antennas for massive
MIMO, the required clock speed of BB MODEM
becomes 100 times faster giving 20G to 32G bits/sec,
which is not practical for the implementation in the
current state of art technology. To cope with this
hardware issues, many low-complexity designs have
been introduced [3]. The main purpose of those is to
reduce the number of ADC/DACs as possible so thus
the requirement of the clock speed of BB MODEM can
be minimized while the benefits from having many
antennas are maximized.
In this paper we propose the low-complexity antenna
combining scheme, where the signals received from
multiple antennas are combined in the RF domain using
the RF blocks such as phase shifter (PS), variable gain
amplifier (VGA), and combiner, which is the same as
the scheme that we proposed as the name of RF
beamforming (BF) in [4]. However, note that our
proposed scheme in this paper aims at using the number
of RF chains minimally by comparing the combined
SNR with a certain threshold and thus the number of RF
chains to be used for RF combining is also minimized
while the SNR requirement is satisfied. Since the
combined output signal is compared with the threshold
as a way of maximal-ratio combining (MRC) on the RF
domain, we call our proposed scheme as RF OT-MRC
which is different from our original BB domain OTMRC scheme in [5].
2. Mode of Operation
Let us assume that the channel knowledge is perfect.
This assumption can be realized by applying the channel
estimation technique presented in [6]. Let us denote the
SNR of the received signal from the antenna as .
The mode of operation is depicted in Fig. 1, where the
phase and the amplitude gain are controlled at PS and
VGA, respectively. Each of the discrete PSs and each
of the VGAs are followed by the low-noise amplifier
(LNA). The signals at the VGA are combined at the RF
combiner. Then our proposed RF OT-MRC is
performed as follows.
- 664 -
ICEIC 2015
l
L
Step 1
LNA
PS
110
VGA
RF OT-MRC
BB OT-MRC
RF full-MRC
BB full-MRC
100
LNA
PS
VGA
.
.
.
.
.
.
.
.
.
LNA
PS
VGA
.
.
.
.
.
.
.
.
.
LNA
PS
VGA
Step 2
Mixer
ADC
Step l
No
Baseband
Average number of RF Chains
MODEM
i 1
th
Yes
Use one more antenna for RF combining

until it is larger than the threshold.
l l 1
Keep its current mode.
Fig. 1 Structure of the proposed RF OT-MRC
90
80
Target BER
= 10-5
70
60
Target BER
= 10-3
50
40
30
20
10
Step 1: Use one single antenna, which is arbitrarily

selected, and compare the SNR of the received signal
with the threshold. If it is larger than the threshold, keep
its current mode. Otherwise, go to Step 2.
Step 2: Use one more antenna for RF combining and
perform the comparison of the combined SNR with the
threshold. If it is larger than the threshold, keep its
current mode, otherwise keep increasing the number of
antennas until it satisfies the threshold.
We perform the simulations over Rayleigh fading
channels for 100 antennas massive MIMO systems
using 64-QAM with the SNR threshold considering the
target bit error rate (BER) which is set to 103 and
105 . In Fig. 2, we show the average number of required
RF chains versus the average SNR per branch [dB] with
the different schemes such as RF/BB OT-MRC and
RF/BB full-MRC. We can see that RF/BB OT-MRC
systems require less RF chains, while RF/BB full-MRC
systems use all RF chains. Note that the requirement
with respect to the clock speed is relaxed by applying
the OT-MRC scheme. Also, we find out from Fig. 2 that
BB OT-MRC requires less RF chains than RF OTMRC. However, RF OT-MRC uses a single ADC,
whereas BB OT-MRC uses the same number of RF
chains and ADCs. Therefore, we can definitely reduce
the power consumption in RF OT-MRC.
4. Conclusions
We proposed RF OT-MRC scheme which has a
strong advantage that the scheme uses only single ADC
without the need to use multiple ADCs. We showed that
the usage of RF chains can be minimized which reduce
the power consumption of the network. We only
consider the single data stream case and it can be easily
extended to the multiple data streams by having the
same number of ADC/DACs as the number of data
streams which is on our on-going research problems.
0
0
10
15
20
25
30
Average SNR per branch[dB]
35
40
Fig. 2 Comparisons of the average number of RF

chains among the proposed RF OT-MRC, BB OTMRC, RF/BB full-MRC scheme, with the target
BERs, and , respectively.
Acknowledgment
Science, ICT and Future Planning), Korea, under the
support
program
(NIPA-2014-h0301-14-1042)
Promotion Agency) and in part by Communications
Research Team (CRT) of DMC R&D Center, Samsung
Electronics Co., Ltd.
References
[1] K. Appaiah, A. Ashikhmin, and T. -L. Marzetta, Pilot
contamination reduction in multi-user TDD systems,
IEEE Communications (ICC), pp.1-5, May 2010.
[2] Y. Geerts, M. Steyaert, and W. Sansen, Design of multibit delta-sigma A/D converters, Springer, 2002.
[3] O. Oliaei, Beamforming mimo receiver with reduced
hardware complexity, Proc. IEEE Inter. Symp. on Cir. and
Sys.(ISCAS07), pp. 669-672, May 2007.
[4] Y. -W. -J. -D. Fredrick, S. Jeon, and T. Itoh, A smart
antenna receiver array using a single RF chain and digital
beamforming, Proc. IEEE Micro. Symp., pp. 311-314,
June 2002.
[5] Y. -C. Ko, H. -C. Yang, S. -S. Eom, and M. -S. Alouini,
Adaptive modulation with diversity combining based on
output-threshold MRC, IEEE Trans. Wireless Comm.,
vol. 6, no.10, pp.3728-3737, October 2007.
[6] K. -T. Jo, Y. -C. Ko, and H. -C. Yang RF beamforming
considering RF characteristics in MIMO System, Inform.
and Comm. Tech. Convg., pp. 403-408, November 2010.
- 665 -
P4-21

!

! "# $ $ "

# ## ##%&!&'(
) " "
* &!&'
+ $ $
# ,# $ *"
" +
" " " $
$ "- "
" $ $
"
" +

"# $

&% '
! " !
!
# $&'% # #
( )
) ( !
! * + "
! -,.* &!
! +( #!
" ) #!
" # (
( " ( #
/ " !
!-0.*1
) ! # # !
" $1
'%
!
*

(! " )! # +
!*(
$%"# 3245 #
(# *
"#5#
! #)((
5 045
#* 6 +(

# (
#(" (
)
" " (+! # ((
* " "
! ((
( ( #
!!#(( (
*
(( " " #
! (
" "
'*
7 " ( (

'(*
(% )

&' 1

(!* 7
8 #"

$,%
9 #" &'

8
(! "
$%"5 6
# *
9 "

!# *
(%&% ) *

+
7! (
" "
'
(( #
# * :

!
! (+4 #*9
( ! ( 5
( ! # $% 4
#* 7
*
- 666 -
ICEIC 2015

1" ! "
( * 7 (
#"

" : *

0*
$0%
&! " #

$0% 5 *:
""

$3%

#"
"
&'*
: *,* (" !":

#: ! ">
*
(%(% ) *

+
7 (
$;0;%8 "#8
* :
! !
(+4 #"
*
$=%

$0% # "

< # $=%
5 #
*
,% # )

-! *+
<"'*0*0
5 !
! 1*9"
( ( # )
"
' (*
9
" +( )
# *
7 " #
" (
#
: *0*&8 #:
.%' *'

"(
(" !
*9"(:
8
* " #! # : "
( #* : *, "
(" # &' "*
/%+ '
(( " " (
! "
'
#!
'(*
' * 9
( ( # )
#!*
0 #
7 " 8 " (( #! 7 ?; (
'@/7@* -02,=2==22>22= 1+ 4
9
<1'!" A@ .
*
-,.*B*1 A*4*
7*
* 5 CA !
'( A!D !
'! C
!
-.* *>, *= ((*,=3>,==E <( 02,3

-0.*! '*7*& 8 *;##
6
/;
1" 8F"!<;9
!
/0.* *3, 0 ((*,>2,G,

:#*02,3

- 667 -
P4-22
A vertical handover management scheme based on decision modeling in

heterogeneous wireless networks
Murad Khan, Junhyung Kim, Jeongbae Yun, Keuchul Cho, Paul Chiedozie Uzoh, Cao Zhenbo, *Kijun Han
School of computer Science and Engineering, Kyungpook National University, Daegu, South Korea
{mkhan, jhkim, jbyun, k5435n, upaul, zbcao@netopia.knu.ac.kr}, *kjhan@knu.ac.kr
Abstract
Providing
a
continuous
connection
in
heterogeneous wireless networks is a challenging job
to accomplish. Therefore, to provide a generic
connectivity in heterogeneous wireless networks, we
proposed a vertical handover decision scheme. The
proposed scheme performs handover triggering using
Simple Additive Weighting (SAW) on the bandwidth of
a Point of Attachment (PoA). The network selection is
performed using Technique for Order of Preference by
Similarity to Ideal Solution (TOPSIS) approach on
different parameters such as delay, jitter, Bit Error
Rate (BER), packet loss ratio, communication cost,
response time, and network load. The proposed scheme
is compared with IEEE 802.21: Media Independent
Handover (MIH) standard in the context of handover
delay and handoff rate. The proposed scheme is tested
in different mobility scenarios, and it is shown that our
scheme provides a superior performance over the MIH
standard.
Keywords: Vertical handover, SAW, PoA, TOPSIS,
MIH standard
1. Introduction
Forth generation (4G) mobility models proposed
mobility management that supports the interpretability
between
different
wireless
technologies
in
heterogeneous wireless networks [1]. Now-a-days, the
numbers of smartphone users are increasing rapidly
due to which a competition has begun between
different internet and data service providers for
providing higher data rate with low cost. The
technologies such as IEEE, WiMAX, and Cellular i.e.
3G and 4G modified their technologies in order to
support high data rate and internet services. Similarly,
a few new concepts such as Cyber Physical System
(CPS), Internet of Things (IoT), and Machine to
Machine (M2M) communications came into existence.
Considering an example of how IoT systems can get
benefit from the heterogeneity of the networks like a
user and its home appliances are connected to a WIFI

network when the user stays at home. When the user
leaves its home then it switches to a cellular network.
Thus, the interconnectivity of these networks provides
the user control its home appliances and so on.
However providing continuous connectivity across
heterogeneous networks is still a challenging job. In
the last decade, several schemes have been proposed to
provide soft connectivity between these networks.
Providing a generic handover model is depending on a
number of parameters. These parameters include RSS,
SINR, bandwidth, data rate, velocity of Mobile Node
(MN), user preferences, and etc. But using such wide
range of parameters increases the complexity and
overhead during a handover process. Resulting, in high
handover delay and failed handovers. Therefore, a
handover decision model is required which reduces the
complexity and overhead cause by setting these
parameters.
In order to understand a handover decision model in
detail, we give an overview of the hierarchy of the
handover management process. The Mobility
management is categorized in to two different parts i.e.
handover management and location management.
Handover management enables an MN to switch
between different or same networks. The user can able
to transfer an ongoing session from one Access Point
(AP) or Base Station (BS) to another AP or BS. The
handover management is further divided into two types,
i.e. soft and hard handover. In the case of hard
handover, when the connectivity between an MN and
the AP or BS drops below a certain threshold the MN
breaks the connection with the current AP/BS and then
search for the available networks. Once the MN finds
new AP/BS then it make connection with it. In the case
of soft handover, the MN first makes a new connection
with new AP or BS and then breaks its connection with
old network. The traffic during handover is redirected
through new connection. The soft handover is further
divided in three categories i.e. horizontal, vertical, and
diagonal. In horizontal handover, an MN Perform a
handover between the APs or BSs of the same network.
This type of handover requires less handover delay
- 668 -
ICEIC 2015
compared to the other types of handover. In vertical
handover the MN perform handover from one AP or
BS to another AP or BS of a different network. In case
of vertical handover the route to destination is remain
the same and only the interface is changed. In diagonal
handover an MN performs handover similar to vertical
handover but the interface and route to destination is
changed. The diagonal handover is already
implemented by different operators and manufacturer
for technologies such as WIFI and GPRS. In all these
types of handover, the vertical handover is the most
recent and advanced technique. The services of such
handover are adopted by different operators and the
researchers are working hard to integrate it with new
technologies such as IoT and M2M etc.
In 2008, the IEEE published a new standard called
IEEE 802.21: Media independent handover to provide
support to the mobile user to seamlessly move across
cellular networks and all families of IEEE technologies.
[2]. MIH established the connection between lower
layers and upper layers by concatenating a new logical
layer between these layers. The Interconnections and
the exchange of messages are mainly performed
between by MIH function. The MIH function lies in
the heart of MIH logical layers. The MIH also uses
different events and services to support smooth transfer
of messages between different entities. However,
researchers tries to enhance the working of MIH
standard, still it contain different issues such triggering
handover on the basis of the RSS and etc. Using, RSS
for handover triggering leads to different issues such as
too late, too early, and wrong cell handovers.
Moreover, the vertical handover is further divided into
three phases such as 1) handover triggering, 2) target
network selection, and 3) handover execution. In
handover initiation phase, an MN initiates handover
when its current connectivity drops below a predefined
threshold. Recently, researchers proposed different
parameters instead of RSS such as velocity, bandwidth,
and data rate etc. traditionally, most of the schemes are
based on RSS but later on researchers identified
different problems caused due to RSS.
2. Related Work
The decision of handover and selection of target
network in heterogeneous networks is a challenging
job. The main problem facing by researchers are the
difference between the functionalities, services, and
operation of these technologies. Most of the traditional
schemes are based on a single parameter for network
selection. But with the passage of time research
explored that a single parameter is not enough to select
a target network [3]. Therefore, employing a single
parameter does not fulfill requirements of different
applications running on an MNs device. In the last

couple of years, the researchers are trying hard to
present a scheme which can enable handover on the
basis of multi-criteria of a network. These criteria are
including
bandwidth,
delay,
jitter,
BER,
communication cost, and etc.
A utility based handover decision scheme has been
proposed in [4]. The proposed scheme initiates a
handover on the basis of user requirements.
Furthermore, the network selection is performed by a
proposed terminal-based selection scheme. The
proposed scheme modified the RSS for handover
initiation and power saving interface management. The
proposed power saving interface management
significantly minimized the energy requirement during
a handover process. As discussed earlier, the RSS is
suffered from different problems; therefore, employing
this scheme for decision modeling in heterogeneous
networks can generate high packet loss and can
increase the number of failed handovers. A similar
scheme has been proposed in [5]. The proposed
approach enables a network to uniformly distribute the
resources among different users in a heterogeneous
wireless environment. The network is able to provide a
user with the support of enabling handover based on
the resources allocated to a user. These utility based
functions do not provide an optimal network for
handover because they do not offer independence
among network selection criteria.
Multi-attribute decision making (MADM) is a
concept of organizing different attribute for selecting a
network among different networks. MADM works by
selecting different user attributes (A=Ai, i=1, 2, 3 n)
and comparing it with the network attributes (C=Cj,
j=1, 2, 3 m). The weights (W=w1, w2,wm) are
assigned to user attribute in order to presents the
significance of these attributes. A scheme based on
similar approach called Enhanced-SAW (E-SAW) has
been proposed in [6]. The working of the proposed
scheme is divided into two parts. In the first part, the
elimination of those networks is carried out, which do
not satisfy minimum user requirements. The network is
restricted to a specific criterion by applying a threshold
mechanism. In the second part, the MN define its
prefer criteria for network selection and then broadcast
it to the available networks. Once the networks get the
MNs criteria, they use these criteria in decision
function and send the final value to the MN. The MN
then rank the available networks on the basis of final
values obtain from these networks. The proposed
scheme has still many challenges which need to be
addressed for example the tradeoff between different
criteria is not clearly defined. A similar scheme based
on the Weighted Product Method (WPM) has been
proposed in [7]. They assigned the weights to the
- 669 -
ICEIC 2015
criteria for network selection on the basis of the
Quality of Context (QoC). The proposed approach
efficiently solved the dynamic decision making
problem in fast user movement.
With the passage of time different decision
modeling techniques have been proposed. These
techniques contain the well known and famous
decision modeling such as TOPSIS [8], Grey relational
analysis (GRA) [9], VIKOR [10], and ELECTRE [11].
All of these schemes gets different criteria and then
rank the available networks on the basis of decision
functions and matrices. In above literature review, we
discussed the famous decision models used for
selection of a network. The working of these decision
models can be made more accurate by providing a
handover triggering technique. If a handover is
triggered at appropriate time then it can help in
reducing handover time and delay and a user can get
full benefits of the resources offered by a network.
3. Proposed Scheme
The proposed approach works in two stages where
in stage one, a handover triggering mechanism is
designed to reduce false handover indications and in
stage two, a network selection scheme is developed to
provide an MN with appropriate network.
3.1. Handover Triggering

An optimal handover triggering scheme is very
much important for reducing false handover
indications. As already stated, there are a number of
parameters available for handover triggering. We
proposed a novel approach for handover triggering
based on the bandwidth consumed by the applications
running on an MNs device. We compute the
bandwidth requires by different applications running
on an MNs device. Each MNs application requires a
particular bandwidth for communication with an AP or
BS. We define a threshold (predefined threshold) on
the lowest possible bandwidth acceptable for all
applications. The MIH_LINK_GOING DOWN event
of MIH standard is based on the RSS from current
network. We modified the structure of the
MIH_LINK_GOING DOWN event and we add
bandwidth for handover instead of RSS. To properly
handle this process, we categorize different
applications using by an MN into different sets. These
sets contain VoIP, Streaming, and elastic applications.
Each set is provided with a particular weight on the
basis of its priority level. We used WPM decision
model to compute threshold ( ) based on the
bandwidth using by different applications. The is
compare with a predefined threshold for initiating
handover. After comparing, we get three cases 1) If it
is less than the required bandwidth then the MN

initiates a handover process, 2) If it is greater and near
to the predefined threshold then it speed up the
computation of , and 3) if it is greater and not near to
the predefined threshold then it slow down the
computation of . Following equation is used for
threshold calculation.
=
=1
(1)
Where , w, and ABW represent the threshold value,

weight of a particular application, and application
bandwidth, respectively.
We used the weights available in [9] for different
applications.
3.2. Network Selection

After handover triggering phase the MN immediately
selects a target network for handover. We proposed
network selection decision by using TOPSIS. We
proposed seven different contexts for selecting the best
network. These contexts include delay (), jitter (),
Bit Error Rate (BER) ( ), packet loss ( ),
communication cost ( ), response time ( ), and
network load (). The network which provide with the
minimum output of all the proposed contexts is
selected for the handover. Because all of the contexts
used in proposed network selection is indirectly
proportional to the QoS of a network. The working of
TOPSIS is further divided in following parts.
3.2.1. Computing decision making matrix
In order to select a network for handover, we
considered seven different criteria listed above for
network selection. These contexts are used to rank the
available networks. We integrate the MADM method
with TOPSIS in order to optimize the working of
TOPSIS. Let N represents a particular network and M*
represents the normalized decision matrix as follows.
xij
C1
1
= 2
C2
1
2
C3
1
2
C4
1
2
C5
1
2
C6
1
2
C7
1
2
N1
N2
(2)
Nm
Where C represent the contexts used for network

selection.
Let Cj = max1im xij and Cj = min1im xij
denote the maximum and minimum value of a contexts
in a network, respectively and the superscript (*) is
used to represent the value of a context after
normalization.
- 670 -
ICEIC 2015
In order to determine the negative and positive ideal
situation of a network, every criterion of the network
must be assigned with a particular weight. These
positive and negative ideal situations further help in the
selection process of an optimal network. The Weighted
matrix (Z) represents each context with their respective
weights.
1 1 2 1 3 1 4 1 5 1 6 1 7 1
1 2 2 2 3 2 4 2 5 2 6 2 7 2
=
1
2 3 4
5
6 7
(3)
3.2.2. Calculating Ideal Situation

The context chosen for the selection of an optimal
network is indirectly proportional to the QoS of a
network, therefore, the maximum and minimum value
in each column of matrix Z represent the negative (I-)
and positive (I+) ideal situation, respectively. The
situations are defined in following relations.
+ = min |
= max |
= 1 , 1 , , 7
= 1 , 2 , , 7
(4)
(5)
where J = 1, 2, 3, . . . ,7
The main idea of the TOPSIS is that the best criteria
must closest to the reference ideal situation and worst
criteria must be farthest from it.
Therefore, it is important to calculate the distance of
each criterion from the positive (H+) and negative ideal
situations (H-). These positive and negative ideal
situations are computed using following relations.
+ =
7
=1
, = 1, 2, ,
(6)
7
=1
, = 1, 2, ,
(7)
3.2.3. Ranking Available Networks
a high coverage area with high speed. In second

environment, the same numbers of nodes are sent to
smaller coverage area with low speed. In third
environment, two time greater number of nodes are
deployed in heterogeneous networks environment with
a speed of ranging from 10 to 100 km/h. The proposed
scheme is tested on different number of nodes ranging
from 10 to 100. As already discussed, we use three
different types of applications i.e. audio and video call
(VoIP), multimedia streaming, and elastic.
We consider a heterogeneous network environment
with three different types of network i.e. UMTS, WIFI,
and WiMAX as shown in Figure 3. Initially, the MN is
connected with AP1. The MN starts movement in the
direction of the BSw1, AP4, and Ap5. The MN
periodically checking the bandwidth required for
different applications. When the bandwidth drops
below the predefined threshold it starts searching for
the available networks. The MN uses the proposed
network selection scheme to rank the available
networks. The BSw1 has high rank for the current
applications running on MNs device as shown in
Table 2 (a) and thus the MN selects BSw1 for
handover. We are testing the handover of an MN in
three different types of networks, therefore, the
network with high, medium, and low ranks are
assigned with a value 1, 2 and 3, respectively.
The initial values are manually assigned to each
network from Table 1. These values are randomly
generated and are uniformly distributed among the
available networks. These values are later on change
during simulation with the context of the user. The
communication cost is supposed on the basis of the
architecture of the underlying technology. In case of
UMTS its value is high and similarly low in case of
WIFI. The initial response time is kept low and as
more number of nodes joins the network it is gradually
increased. The values of delay, jitter, BER, and packet
loss is taken from [9].
MNs direction
Using the ideal situation, an MN computes the degree

of each network and then decides one network is an
optimal one. The MN ranks the available network and
then selects one with the best values among available
networks. The calculation of the degree of a network is
carried out using following relation.
=
++
MNs Connection
AP 4
BSw1 has high
BSW 1
AP1 has high
AP 5
AP 10
AP 6 has high
AP 1
BSc3 has high
AP 6
BSC 3
BSC 1
AP 11
AP 3
AP 2
AP 12 has high
AP 7
(8)
AP 9 has high
BSC 2
AP 12
AP 9
BSW 2
BSW 2 has high
AP 8
The performance of the proposed scheme is tested

in three different types of mobility environments. In
first environment, different numbers of MNs are sent to
- 671 -
AP 14
AP 13
Figure 1. Simulation Scenario
ICEIC 2015
220
Table 1. Initial values assigned to each parameter

c
UMTS
802.11
n
WiM
AX
100
10
kbps
100
80
sec
0.04
0.03
ms
300
150
ms
50
30
%
2
1
180
per
106
100
20
160
Handover Rate
Proposed Scheme
MIH standard
200
140
120
100
80
60
40
70
0.03
5
100
20
0.5
40
15
20
0
0
20
40
60
80
100
Number of MNs
We analyze the movement of an MN with different

speeds and different applications in the scenario
presented in Figure 3. In following Table 2, four
different handovers are shown for the sake of clarity
with the ranking of each network for a particular
application running on MNs device during handover.
Table 2 (a). First Handover (Web browsing)
VoIP Streaming Elastic applications
BSw1
1
2
1
AP 4
3
2
2
AP 3
2
3
3
Figure 2. Handover rate

The proposed scheme require less handover time
because of the network selection on the basis of
TOPSIS. The proposed scheme and MIH standard is
tested in different scenarios with different speeds of
MN i.e. 10 to 100km/h. The proposed scheme suffered
stays for longer time in a network because of the
appropriate network selection. The MIH standard is
select a network on the basis of RSS which leads to
inappropriate network selection. The comparison of
handover is shown in following Figure 6.
Proposed Scheme
MIH standard
1.2
Table 2 (b). Second Handover (VoIP application)

AP 6
1
2
1
AP 5
2
3
3
BSc 2
3
3
2
Handover delay (sec)
1.0
0.8
0.6
0.4
0.2
Table 2 (c). Third Handover (messaging)

BSw 2
2
2
1
AP 12
2
2
2
AP 13
3
3
2
0.0
0
10
20
30
40
50
60
70
80
90
100
Velocity (km/h)
Figure 3. Comparison of handover delay
5. Conclusion
Table 2 (d). Fourth Handover (Streaming)

AP 9
1
1
1
BSw 2
2
3
1
AP 14
2
2
1
Moreover, we conducted several simulations to test the
accuracy of the proposed scheme against the MIH
standard. During simulation, we gradually increase the
number of MNs and analyze the handoff rate. The
number of handovers in case of MIH standard is high
compared to the proposed scheme. The number of
unnecessary handovers is reduced because of the
proposed handover triggering phase. Figure 4, shows
the handover rate in case of proposed scheme and MIH
standard. In case of proposed scheme, handoff rate is
significantly reduced due to the proposed triggering
technique.
In this article, we proposed a handover decision

model based on multi-criteria. The decision of
handover triggering is performed using SAW decision
model. The proposed handover triggering technique
considers bandwidth for handover initiation. If the
bandwidth coming from an AP or BS is not enough to
hold an ongoing connection and it is drops below a
predefined threshold then the MN initiates handover.
Moreover, the network selection is performed using
TOPSIS that is based on delay, jitter, Bit Error Rate,
packet loss, communication cost, response time, and
network load. We consider only those parameters
which are indirectly dependent on the QoS of a
network. Similarly, the proposed handover triggering
scheme provide an MN with enough time to select an
optimal network based on multi-criteria decision
model. The proposed scheme is tested in different
heterogeneous scenarios and the results obtain are
compared with the MIH standard. The handover delay
- 672 -
ICEIC 2015
and handoff rate is significantly reduced. Simulation
results show that the proposed scheme performs
superior than the MIH standard.
Acknowledgements
This work was supported by the Ministry of
Education, Science Technology (MEST) and
National Research Foundation of Korea (NRF)
through the Creative Human Resource Training
Project for Regional Innovation (2014).
of MSIP/IITP. [10041145, Self-Organized
Software platform (SoSp) for Welfare Devices].
This study was supported by the BK21 Plus
project (SW Human Resource Development
Program for Supporting Smart Life) funded by the
Ministry of Education, School of Computer
Science and Engineering, Kyungpook National
University, Korea (21A20131600005).
References
[1] Q-T. Nguyen-Vuong, N. Agoulmine, and Y.
Ghamri-Doudane, "A user-centric and contextaware solution to interface management and
access network selection in heterogeneous
wireless environments," Computer Networks, vol.
52, no. 18, pp. 3358 - 3372, Dec 2008.
[2] IEEE 802.21, "IEEE Standard for Local and
metropolitan area networks - Media Independent
Handover Services," Institute of Electrical and
Electronics Engineers, New York, USA, Draft
May 2008.
[3] T.-C. Chu and Y. Lin, "An extension to fuzzy
mcdm," Computers & Mathematics with
Applications, vol. 57, no. 3, pp. 445 - 454, Feb
2009.
[4] Q.-T. Nguyen-Vuong, N. Agoulmine, and Y.
Ghamri-Doudane, "A user-centric and contextaware solution to interface management and
access network selection in heterogeneous
wireless environments," Computer Networks, vol.
52, no. 18, pp. 33583372, Sep 2008.
[5] J. Gozalvez, M. C. Lucas-Estan, and J. SanchezSoriano, "Joint radio resource management for
heterogeneous wireless systems," Wireless
networks, vol. 18, no. 4, pp. 443 - 455, May 2012.
[6] S. Maaloul, M. Afif, and S. Tabbane, "Vertical
Handover Decision Policy Based on the End
User's Perceived Quality of Service," in 27th
International
Conference
on
Advanced
Information Networking and Applications
Workshops (WAINA), Barcelona, 2013, pp. 493 498.
[7] P. TalebiFard and V.C.M. Leung, "A dynamic

context-aware access network selection for
handover
in
heterogeneous
network
environments," in IEEE Conference on Computer
Communications
Workshops
(INFOCOM
WKSHPS), Shanghai, 2011, pp. 385 - 390.
[8] V. Kantubukta, S. Maheshwari, S. Mahapatra, and
C.S. Kumar, "Energy and quality of service aware
FUZZY-technique for order preference by
similarity to ideal solution based vertical handover
decision algorithm for heterogeneous wireless
networks," IET Networks, vol. 2, no. 3, pp. 103 114, Sept 2013.
[9] M. Khan and K. Han, "An Optimized Network
Selection and Handover Triggering Scheme for
Heterogeneous
Self-Organized
Wireless
Networks,"
Mathematical
Problems
in
Engineering, vol. 2014, p. 11 pages, June 2014.
[10] M.M. Alkhawlani, "MCDM based Joint
Admission Control for Heterogeneous Wireless
Networks," in Seventh International Conference
on Computer Engineering & Systems (ICCES),
Cairo, 2012, pp. 3 - 8.
[11] F. Bari and V. Leung, "Application of ELECTRE
to Network Selection in A Hetereogeneous
Wireless Network Environment," in IEEE
Wireless Communications and Networking
Conference (WCNC), Kowloon, 2007, pp. 3810 3815.
- 673 -
P4-23
Cross-Layered Packet Length Aware Sleep Algorithm

for the Efficient Video Streaming Service
Taewook Chung, Chulho Chung, Jaesoek Kim
School of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea
{cobain, chulho729, jaekim}@yonsei.ac.kr
Abstract
2. Motivation
In this paper, we proposed a new packet length

aware sleep algorithm with the cross-layer approach
for the efficient video streaming service. In conventional
layered video streaming service system, each video
codec and communication layer could not share the
information. With the cross-layer approach, however,
inter-communication among the several layers makes
synergy of the video streaming service. We propose an
efficient power management technique in the crosslayer video streaming service system. In the proposed
cross-layered system, transmitter could reflect to
transmit video data with information of the video
streaming characteristics. Using the proposed
technique we reduce the power consumption about 45%
in the video streaming service system.
Keywords:
Cross-Layer,
Video
Communication System, Sleep Mode
To reduce power consumption, most mobile devices

use basic power management modes as in Fig.1. Data
transfer occurs at active mode and idle mode; the power
consumption is highest at active mode as actual
transmission or reception occurs in this mode. The idle
mode of a terminal is not a required guard interval or
transfer process during packet transfer; however, this is
a mandatory waiting period required as a network
component. During idle mode, the power consumption
is lower than in the active mode[2]; however, the PHY
layer transmission part is always operating and standby
power consumption for maintaining modem power
occurs continuously.
Streaming,
1. Introduction
In early communication system were put into place,
their main purpose was the transmission of the limited
data amount such as text based HTTP, e-mail, etc[1]. At
that time, only low-speed communication of several
kbps was possible. With the development in
communication technology, the absolute amount of
transferrable information has increased and a network
large enough to cover the worldwide established. At the
same time, display technology has evolved for mobile
terminals. It developed continuously and high resolution
displays are now being used on mobile communication
terminals as well. The combination of these two entirely
different technologies has realized the users desire for
high resolution video streaming service; a lot of related
research on video and communication technology has
been carried out. And the cross-layer approach is rising
for the video streaming services which are vulnerable in
wireless/mobile communication[2].
Figure 1 General Power Save Mode

The instantaneous power consumption is highest at
active mode; however, unless a special power
management method is applied, the power consumption
at idle mode takes up a large overall share. For this, the
power management part of many communication
systems offers a sleep mode. During sleep mode, the
terminal can shut down the modems power for a certain
time and save significantly more power than the idle
mode.
The video streaming service has two important
features. One is that 30-60 images are continuously sent
each second. If the video cant be sent continuously, the
- 674 -
ICEIC 2015
video cannot be replayed correctly even if the data
transfer speed is sufficient. On the other hand, if the
transfer speed is sufficient, it often occurs during
transfer that the terminal stays at idle mode. The second
is that the size of each image differs very widely. These
feature of video transfer mean that more efficient power
management is possible in video transfer systems; for
this, information sharing between codec layer and
communication layer, that is, a cross-layer approach is
necessary.
A cross-layer approach is necessary to utilize the
videos bit stream characteristics in the communication
layer; we propose a Video/Network Cross Layer
(VNCL) packet. In most cases, one single video frame
is sent as multiple communication packets. Here, the
VNCL packet has additional information such as total
number of video frames and frame size. Based on this
information, the time which can be moved to sleep mode
during packet transfer can be calculated for accurate
sleep mode transition timing.
Expected Sleep time is applied in the MAC layer
and calculated by
=
() ()
For the evaluation of proposed algorithm, we
simulated with raw format full HD video reference:
Riverbed.yuv, Rush_hour.yuv, and station2.yuv.
All raw format video data are encoded by H.264/AVC
codec. And the simulation is based on the power
consumption model of IEEE802.11n[3]. Table shows
the simulation results.
Table 1 Simulation Results
Power
consumption
Conventional
Proposed
Gain
Riverbed
Rush_hour
Station2
0.84 W
0.75 W
10.81%
0.60 W
0.30 W
49.10%
1.01 W
0.33 W
67.45%
We can see the performance of our proposed

protocol from the simulation results. Its enhancement is
depend on the characteristics of the video data, but our
proposed algorithm reduce overall the power
consumption about 45%.
5. Conclusion
is a frame interval which is calculated from the

frame rate of video frame. is the time at which the
packet to send. () is the expected time for the
remaining packet of current video frame.
In this paper, we used a cross-layer aspect approach

for achieving higher power efficiency at a video
streaming service system and proposed a packet length
aware sleep mode transition algorithm based on VNCL
packets. As a result, we were able to confirm that the
power consumption decreased by about 40% than
conventional video streaming service systems. And we
will research for the efficient architecture and system
design of the cross-layer video communication system.
References
Figure 2 Packet Length Aware Sleep Algorithm

The figure 2 below shows an operation example of
Cross-Layered Packet Length Aware Sleep Mode
reflecting the algorithm above. When the video frame is
transferred to the communication layer, it is sent while
being divided into VNCL packets; the information on
the estimated point of current frames transfer being
completed is sent to adjacent devices. In addition, if
retransmission occurs due to errors during packet
transfer or an arbitrary packet is dropped, the relevant
values are updated before sending each packet to enable
more accurate sleep mode transition time.
[1] Kleinrock, L. History of the Internet and its flexible

future, Wireless Communications, IEEE Vol.15 No.1, IEEE,
pp. 8-18, Feb 2005
[2] Shakkottai, Sanjay and Rappaport, Theodore S and
Karlsson, Peter C Cross-layer design for wireless networks,
Communications Magazine, Vol.41 No.10, IEEE, pp. 74-80,
2005
[3] Ki-Young Jang, Shuai Hao, Anmol Sheth, Ramesh
Govindan Snooze: Energy Management in 802.11n WLANs,
Proceedings of the Seventh Conference on emerging
Networking EXperiments and Technologies, ACM, pp. 12,
2011.
Acknowledgement
This work was supported by the Technology Innovation
Program, 10035389, funded by the Ministry of
Knowledge Economy (MKE, Korea).
- 675 -
P4-24
Dual-Embedded Dual-Loop Perturbation for Switchable Circularly Polarized

Square Loop Microstrip Antenna
D.-H. Lee1, E. Lim2, D. Choi2, H.-M. Yang1, D.-W. Chung1, and S. Pyo2
1
LEO Satellite Mission Operation Department, Korea Aerospace Research Institute (KARI)
Department of Information and Communication Engineering, Hanbat National University
spyo@hanbat.ac.kr
Abstract
This paper reports a switchable antenna based on a
novel dual-embedded dual-loop perturbation for
circular polarization diversity. The perturbation can
generate both of circular polarization senses and
alternate polarization by controlling the states of
switches. Experiments of the implemented antenna
demonstrate good polarization controllability which
well agree the corresponding simulation results.
Keywords: Circular polarization, switchable antenna,
dual-embedded dual-loop perturbation
polarization consists of two loops with different

electrical lengths which are loaded at the opposite plane,
that is, the small loop is etched in the front patch plane
and the large one is embedded in the ground plane.
Diodes determine the dominant loop of the dual-loop.
When the bias is applied, the large loop is connected to
the ground and inactivated. However, the small one is
dominantly operated. Thus, the right-handed circularly
polarized (RHCP) wave can be generated. When the
bias is not applied, the operation is vice versa.
Accordingly, the left-handed circularly polarized
(LHCP) wave can be achieved.
1. Introduction
It is well known that reconfigurable antennas provide
communication system capability to improve by
avoiding polarization mismatch losses and reducing
multipath fading interferences [1]. Especially, the
satellite and terrestrial data-link in S-band requires
different frequencies with opposite polarization senses
for alternating the transmitting and receiving operation
[2, 3]. In this paper, a switchable microstrip antenna
with dual-embedded dual-loop perturbing element is
proposed for circular polarization diversity. Details of
operation principle, antenna design and measurement
are addressed in the following sections
2. Antenna Design and Analysis

Fig. 1 shows the configuration and the operation
mechanism of the polarization-switchable square loop
microstrip antenna with the proposed perturbation. The
detail dimension of the design are also illustrated. As
shown in Fig. 1, the proposed perturbation with two pin
diodes for generating and alternating circular
Fig. 1. Configuration and operation mechanism of

the proposed antenna
- 676 -
ICEIC 2015
Axial ratio (dB)
Fig. 2 shows the simulated electric current density on

the front patch in both on- and off-states for RHCP and
LHCP modes, respectively. As discussed from previous
section, two CP senses are achieved by choosing the
loop size of the dual-embedded dual-loop perturbation.
To demonstrate the feasibility of the proposed
perturbation, the antenna is implemented on 1.6 mmthick FR4 substrate. The quarter-wave impedance
transformer is used as matching network. The pin diodes
of BAR64-02V is mounted in the large loop and to block
DC current, two capacitors are installed. The simulated
and measured reflection coefficients of the implemented
antenna are shown in Fig. 3. The cases for the diodes are
turned on and off by 0.7 V and 0 V, respectively. The
antenna shows 10-dB impedance bandwidth of 125
MHz with respect to 5.20 % at on state for RHCP mode
and 107 MHz with respect to 4.32 % at off state for
LHCP mode. Figs. 4 and 5 show the radiation
performances of the implemented antenna, that is, axial
ratio, gain and patterns.
on state (sim.)
on state (mea.)
off state (sim.)
off state (mea.)
12
8
4
-4
-8
Antenna gain (dBic)
15
3. Simulated and Measured Results
-12
2.24
2.32
2.40
2.48
2.56
2.64
Frequency (GHz)
Fig. 4. Axial ratio and CP gain of the proposed

antenna
T= 0 ( +z )
330
T= 0 ( +z )
30
300
330
60
30
300
60
( +y )
270
-40 -30 -20 -10
240
120
210
150
180
(a)
( +y )
90 270
-40 -30 -20 -10
240
90
120
210
150
180
(b)
Fig. 5. Measured linear spinning radiation patterns

at yz-plane; (a) on-state for RHCP at 2.37 GHz and
(d) off-state for LHCP at 2.48 GHz
(a)
Measured results prove that broadside radiation with

good CP characteristics are obtained.
4. Conclusion
(b)
Reflection coefficient (dB)
Fig. 2. Simulated electric current distribution on

square loop; (a) RHCP mode at on-state and (b)
LHCP mode at off-state
0
In this work, the reconfigurable circularly polarized

patch antenna perturbed by dually embedded dual-loop
is demonstrated. The proposed perturbation provides
excellent controllability for polarization diversity with
different resonant frequencies.
-5
References
-10
[1] Y. J. Sung, T. U. Jang, and Y.-S. Kim, A reconfigurable

microstrip antenna for switchable polarization, IEEE Microw.
Wirel. Compon. Lett., vol. 14, no. 11, pp. 534-536, Nov. 2004.
-15
on state (sim.)
on state (mea.)
off state (sim.)
off state (mea.)
-20
-25
2.0
2.2
2.4
2.6
2.8
3.0
Frequency (GHz)
Fig. 3. Reflection coefficients of the proposed

antenna
[2] F. Yang and Y. Rahmat-Smaii, A reconfigurable patch

antenna using switchable slots for circular polarization
diversity, IEEE Microw. Wirel. Compon. Lett., vol. 12, no. 3,
pp. 96-98, March 2002.
[3] J. R. James and P. S. Hall, Handbook of microstrip
antennas, Peter Peregrinus, London, 1989.
- 677 -
P4-25
Design of High-Efficiency Co-Designed Load Modulation

Power Amplifier Using Tunable Matching Network
Taeyeop Kwon and Jinho Jeong
tykwon@sogang.ac.kr, jjeong@sogang.ac.kr
Abstract
In this paper, design procedure of load modulated
power amplifier (PA) is presented to enhance power
added efficiency (PAE) at back-off power regions. The
designed amplifier is composed of high-efficiency
harmonic-tuned PA and output tunable matching
network (TMN). The impedance tunability is
implemented using varactor diodes, of which the
capacitance can be controlled by the envelope signal,
so that TMN presents the optimum load impedance at
all envelope amplitudes. The designed PA using
commercial GaN HEMT operates at a frequency of
1.85 GHz with 6 W maximum output power.
Experimental result shows that the designed TMN
allows an efficiency enhancement of 14.5% at 4.5 dB
back-off and more than 10% at both 7 dB and 10 dB
back-off regions.
Keywords: Load modulation, high-efficiency power
amplifier, tunable matching network
1. Introduction
Recently, many communication standards, such as
LTE, WiMAX, etc., were developed, and they use
modulation signals with high peak-to-average ratio for
higher data rates. Consequently, efficiency of power
amplifiers (PAs) at back-off power regions is as
important as that at peak power. Accordingly, many
architectures such as envelope tracking (ET), envelope
elimination and restoration (EER), Doherty PA (DPA),
load modulation PA, etc., were developed. Among
these techniques, ET [1] and EER systems modulate
output supply voltage to get high efficiency. But, these
topologies consist of extra circuits like envelope
detector or envelope amplifier, leading to high circuit
complexity. DPA [2] also has some disadvantages such
as narrow bandwidth owing to a quarter-wave
transmission line and poor linearity due to peaking
amplifier. In this paper, load modulation [3] technique

is chosen for high efficiency PA with simple structure
and easy implementation, compared with other
methods to attain high efficiency.
2. Design methodology
Control Voltage
Co-designed
Power Amplifier
RF
Input
Input
Matching
Network
Tunable
Matching
Network
RF
Output
Fig. 1. Block diagram of load modulated PA

Fig. 1 shows an overall block diagram of designed
load modulated PA. Output TMN is controlled by the
envelope signal of RF input. It allows high efficiency
operation even at low power regions. Design procedure
of load modulated PA is presented below.
Firstly, high-efficiency harmonic-tuned class-AB
PA was designed at 1.85 GHz using Cree CGH40006P
GaN HEMT. To determine optimum source and load
impedances of PA for high efficiency, multi-harmonic
source-pull/load-pull simulations were performed at
drain bias voltage of 28 V. We considered a fundamental impedance at the source side, because harmonic
source impedances have little effect on the efficiency.
On the other hand, impedances at fundamental, 2nd, and
3rd harmonic frequencies were considered at the drain
side.
- 678 -
Table 1. Optimum source/load impedances

Frequency
(GHz)
1.85 (f0)
3.70 (2f0)
5.55 (3f0)
Optimum load
impedances ()
ZL1,opt = 22 + j27
ZL2,opt = j46
ZL3,opt = j76
Optimum source
impedances ()
ZS1,opt = 16 + j57
-
ICEIC 2015
Output
Matching
Network1
Tunable
Matching
Network
Output
Matching
Network2
Output
Zout
Fig. 2. Output tunable matching network of load
modulated PA
Fig. 2 shows a schematic of designed output TMN.
It is used as a part of output matching networks. .
80
PA without TMN
Load modulated PA
70
PAE (%)
Table 1 shows the optimum source and load impedances obtained from multi-harmonic source-pull/loadpull simulations using Agilent ADS. The simulation
showed a maximum PAE of 85% at the peak output
power of 39 dBm.
Next, output TMN was designed using varactors of
which the junction capacitance is controlled by the bias
voltage. The varactors modeled by a variable capacitor
with a minimum capacitance (Cmin) of 4.7 pF and a capacitance ratio (Cmax/Cmin) of 8. This varactor has a high
breakdown voltage about 60 V, hence it is suited for
high power applications.
60
50
40
30
20
10
22
24
26
28
30
32
34
36
38
40
Output power (dBm)
Fig. 4. PAE versus output power of PA without

TMN and load modulated PA
Fig. 4 shows measured PAEs of two PAs, PA
without TMN and load modulated PA. It is shown that
load modulated PA achieves higher efficiency than the
PA without TMN. Load modulated PA shows the
maximum output power of 37.7 dBm with a PAE of
75.5%. Load modulated PA improves the PAE by
14.5% at 4.5 dB back-off power, compared with the
PA without TMN. It also shows more than 10%
improvement at both 7 dB and 10 dB back-off regions.
4. Conclusion
In this paper, a design procedure of load modulated
PA was presented. The achieved result shows that PAE
increased 14.5 % maximally at 4.5 dB back-off region.
Acknowledgement
Zout,opt
Zout,locus
-1
-0.5
0.5
Fig. 3. Optimum impedance variation depending on

output power.
Fig. 3 shows impedance variation according to
output power. Zout is load impedance looking into TMN
as shown in Fig. 2. Zout,opt is optimum Zout found from
the load-pull simulation, and Zout,locus is input impedance of the designed TMN. This figure shows that the
designed TMN can provide the optimum impedances
for high efficiency over a wide range of output powers.
3. Measurement results

Foundation of Korea(NRF) grant funded by the Korea
government(MEST) (No.NRF-2012R1A1B3000836).
It was also supported by ICT R&D program of MSIP
/IITP (12-911-01-109 / Spectrum sharing techniques
based on cooperative sensing and DB for CR-LTE
systems).
References
[1] F. Wang, A. Yang, D. Kimball, L. Larson, and P, Asbeck,
"Design of wide-bandwidth envelope-tracking power
amplifiers for OFDM applications," IEEE Trans. Microw.
Theory Tech., vol. 53, no. 4, pp. 1244-1255, Apr. 2005.
[2] A. Z. Markos, K. Bathich, D. Gruner, A. Al Tanany, and G.
Boeck, "Design of a 120 W balanced GaN Doherty power
amplifier," in Proc. German Microw. Conf., Mar. 2011, pp.
1-4.
[3] C. Fager, H. Cao, T. Eriksson, R. Jos, H. Nemati, A. Soltani,
and H. Zirath, "High efficiency transmitter using varactor
based dynamic load modulation," in Proc. IEEE Int. Microw.
Series on RF Frontends for Soft. Defined Cogn. Radio
Solutions, Feb. 2010, pp. 1-4.
- 679 -
P4-26
A Quality Estimation Model for UHD Video Service in IP Lossy Network

Jaehyung Bae*, Hong-Shik Park**
Information and Communications Engineering
KAIST
*fuelbill@kaist.ac.kr, **park1507@kaist.ac.kr
Abstract
This paper proposes the quality estimation model for
High Efficiency Video Coding (HEVC) video streaming
services over IP network. The final aim of the paper is
to develop an assessment framework of video quality
that is applicable and simple enough so that the quality
assessment process can be operated in real-time and
guarantee high reliability for problem diagnosis.
Keywords: Video quality, Ultra High Definition
(UHD), HEVC, Packet loss distortion, Hybrid model
factor is depending on which option is applied and

respectively, the propagated distortion becomes
different [2].
When we lose consecutive m packets, the overall
distortion by a loss event can be given by
= ,
where is the weight factor used to calculate the

affected number of packets by the loss event and coding
options.
Then, the expected video distortion of the
reconstructed video sequence can be given by
1. Introduction
Recently, UHD becomes to take an outstanding and
future-oriented position in video technologies.
Therefore its not difficult to say, in decades, most of
internet traffic is forecast to be UHD video traffic [1]. In
this paper, we propose a quality estimation model for
this advanced codec-based video streaming service.
2. Quality Estimation Model
= = .
= =
(1)
Table 1 Emulation profile with different conditions

Type
Source
For UHD service, HEVC provides three different

coding options: intra only, low delay and random access.
The number of error propagated frames and weight
(5)
To evaluate the model, we define the emulation

profile of the video stream as Table 1.
Then, the distortion by the propagated error at frame

+ is approximately given by
(2)
2552
3. Emulation of Model
+ = .
(4)
where denotes the probability of m packet losses in

is the average number of
the video sequence and

packets affected over the video stream.
Finally, we can get the log scaled model and denote
it as the video quality estimation model (VQEM) given
by
= 10log10
The mean squared error (MSE) calculates differences

between a source frame and a decoded frame. Instead,
we assume the sizes of all packets in a GOP are identical.
Therefore, when a single packet loss occurs in a frame,
we get the distortion value as
(3)
Codec
Option
Packet Loss
Criteria
Football, Tulip, Space_A, Space_B,
Shuttle, Spring
HEVC
All-intra, Low-delay, Random-access
Burst Random Losses (By Emulator)
The emulation test-bed is configured as a serverclient (push-pull) model. At the send point, the video
server initiates push-based transmission of a video
stream into the network. The server has the capability to
encode the video stream in different formats and is
- 680 -
ICEIC 2015
connected to an intermediate node that emulates the

effect of packet loss.
4. Result and Analysis

To show how accurately the model assesses video
quality, we consider objective MOS as the target
parameter to avoid inaccuracy and lots-of-time
consumption of subjective MOS test.
One of the possible estimation methods for objective
MOS is to use the PSNR to MOS conversion map in [3].
As a mapping result, we can get VQEM, the average
PSNR and MOS. We can also calculate projected MOS
values of the equation from the relationship between
Acknowledge
This research was funded by the MSIP(Ministry of
Science, ICT & Future Planning), Korea in the ICT
R&D Program 2014 [1391104001, Research on
Communication Technology using Bio-inspired
Algorithm]
References
[1] Cisco visual networking index: forecast and methodology,
2011-2016, Cisco Public, May 2012.
[2] J J. Nightingale, Q. Wang, and C. Grecos, "HEVStream: a
framework for streaming and evaluation of high efficiency
video coding (HEVC) content in loss-prone networks,"
Consumer Electronics, IEEE Transactions on, vol.58, no.2,
pp.404-412, May 2012.
[3] Zhang et al., Mobile WiMAX field trial test through
multimedia performance evaluation, in EURASIP Journal on
Wireless Communications and Networking, Feb. 2012.
Figure 1 Correlation between Projected MOS and

Average MOS.
From Figure 1, we can see that VQEM has robustness
in estimating the objective MOS for different featured
datasets; source type and coding option.
5. Conclusion
In this paper, the light-weight objective metric model
has been proposed for assessing UHD video stream for
the burst-lossy network. As there still exist technical and
economical limitations, to activate UHD services over
not only wired but also wireless environment,
maintenance of quality of HEVC video services will
become a challenge for ISP. The proposed VQEM can
estimate video quality with proper reliability and has
real-time capability suitable for practical applications
we expect to expand the model to cover the specific
configurations of video delivery schemes for network
providers.
- 681 -
P4-27
Characterization of computer generated hologram for use of LCoS-based

wavelength selective switch
Yong-Min Lee1 and EunSang Jang2
1
Dept. of Information Display, Sun Moon University, Asan, Chungnam, Korea
Email: ymlee@sunmmon.ac.kr, Phone: +82-41-530-2349
2
East Photonics, Yuseong-gu, Daejeon, Korea
Email: allch@eastphotonics.com
Abstract
This paper presents characterization of LCoS-based
WSS which is core technology for the next generation
ROADMs. We produced a computer generated
hologram using the Gerchberg-Saxton algorithm to
operate the five-port WSS, and examined the
performance of the hologram patterns.
Keywords: wavelength selective switch, liquid crystal
on silicon, computer generated hologram.
1. Introduction
With increasing interest in reconfigurable optical
adddrop multiplexers (ROADM), liquid crystal on
silicon (LCoS) based wavelength selective switches
(WSS) become attractive as a key component of the
ROADMs.[1-3] LCoS-based technology have several
advantages such as flexible spectrum coverage,
robustness, and adaptive alignment.
By introducing computer generated hologram
(CGH) design technique [4], the LCoS based WSS can
be capable of deflecting an input signal to multiple
output ports. We examine the usability of the CGHs for
the proposed WSS.
A laser diode light gets into an input port of the

fiber collimator array and become linearly polarized
light after passing through the YVO4 crystal and the
HWP. The input light is separated into multi
wavelength light lays via the prism and the grating lens.
Depending on an image pattern on the LCoS module,
the incident multi wavelength light lays at the LCoS
module are reflected back to the one of output ports of
the collimator array with different angles respectively.
To produce the image patterns of LCoS module, we
used CGH technique with Gerchberg-Saxton algorithm.
We developed a Matlab program to produce a binary
phase hologram which redirects incident light to the
one of the output ports. With the proposed architecture,
input light can be transferred to an arbitrary output port
by changing the LCoS image pattern.
2. Proposed architecture
Figure 1 illustrates the schematic diagram of the
proposed WSS system which consists of a collimator
array, a prism, a grating lens, a focal lens and LCoS
module. The collimator array consists of an input port,
five output ports, an YVO4 crystal and a half wave
plate (HWP). The LCoS module consists of an array of
1920 1080 pixels on a pitch of 8.4 m.
- 682 -
Figure 1: Configuration of the wavelength

selective switch (WSS).
ICEIC 2015
Figure 2 shows the measurement setup for
reconstruction of the original image using the CGH
pattern displayed on LCoS device. A laser beam is
linearly polarized to produce a vertically polarized
collimated source. The beam is projected via a beam
splitter towards the LCoS device that reflects the beam
back to the beam splitter. The reflected beam produces
a reconstructed image on CCD camera.
(c)
Figure 3:
(a) Original image to be encoded (b) CGH pattern
(c) Simulated reconstructed image
It is under way to get actual reconstructed images
using the experiment setup as shown in Fig. 2.
Figure 2: Measurement setup.
4. Conclusion
Figure 3 shows the experimental results of the
reconstruction of the original image using binary CGH
pattern. Fig.3 (a) shows the original image for optical
interconnect switches and Fig. 3 (b) depicts a binary
CGH pattern of the original image. Fig. 3(c) shows the
simulated reconstructed image from the binary CGH
pattern. As shown in Fig. 3, the reconstructed image is
identical to the original image and verified the
usefulness of our developed CGH generation program.
It is natural that the twin image appeared in the
reconstructed image due to the Fourier inverse
transformation.
The usability of the designed binary-phased

computer generated holograms for the control of an
LCoS based WSS was successively demonstrated. As a
future work, the twin image problem appeared in the
reconstructed image can be resolved by applying
multiple level phase CGHs.
References
[1] N. Collings, T. Davey, J. Christmas, D. Chu, and B.
Crossland, "The applications and technology of phase-only
liquid crystal on silicon devices," J. Display Technol., vol. 7,
No. 3, pp. 112-119, 2011
[2] O. Gerstel, M. Jinno, A. Lord, and S. J. Ben Yoo, "Elastic
optical networking: A new dawn for the optical layer," IEEE
Commun. Mag., vol. 50, pp. S12-S20, 2012
[3] M. Johansson, S. Hard, B. Robertson, I. Manolis, T.
Wilkinson, and W. Crossland, "Adaptive beam steering
implemented in a ferroelectric liquid crystal spatial-lightmodulator free-space, fiber-optic switch," Appl. Opt., vol. 41,
no. 23, pp. 4904-4911, 2002
(a)
(b)
[4] B. R. Brown and A. W. Lohmann, Computer-generated

binary holograms, IBM J. RES. DEVELOP., March, pp.
160-168, 1969
- 683 -
P4-28
ALBMesh+: A proposal of Load Balancing Routing Algorithm based on Ant

Colony Optimization for 802.11 based Multi-Channel Multi-Radio Wireless
Mesh Networks
Eun-Jung Lee, Young-Min Kim*, Hong-Shik Park
Korea Advanced Institute of Science and Technology, *Electronics and Telecommunications
Research Institute
freakone@kaist.ac.kr, *injesus@etri.re.kr, park1507@kaist.ac.kr
Abstract
In this paper, a new load balancing routing
(ALBMesh+) algorithm is proposed for enhancing the
network throughput in 802.11 based multi-channel
multi-radio wireless mesh networks. In order to
achieve this, the ALBMesh+ that can automatically
distribute the traffic load using the well-known ant
colony optimization is proposed. It is expected that the
proposed algorithm could provide a useful tool for
network operators to increase the network throughput.
Finally, both of routing algorithms are hard to adapt the

dynamic network status; because they lack the selfcapability to overcome such situation.
To solve the problem, a novel load-balancing
routing algorithm (ALBMesh+) is proposed. For the
enhancement of the network throughput through the
load-balancing, ALBMesh+ considers the delay as well
as the link quality. In addition, ALBMesh+ uses the
well-known Ant Colony Optimization (ACO) technique
[3] for the self-adaptability in MCMR WMN.
2. Related works
Keywords: Ant colony optimization, multi-channel
multi-radio wireless mesh network, load balancing
routing algorithm.
1. Introduction
Recently, the enhancement of the network
throughput in Wireless Mesh Network (WMN)
becomes a key issue as the mobile traffic exponentially
increases [1]. To improve the network throughput, the
Multi-channel Multi-radio (MCMR) technology should
be applied to WMN, and some algorithms at the
various network layers try to consider this technology.
In particular, the routing algorithm is one of the key
are to enhance the network throughput in MCMR
WMNs. Although the previous work [2] considers the
MCMR environment, they still have some limitations
as follows. First, the most used link quality aware
routing algorithms can induce the network congestion
as well as the degradation of quality of services.
Because, they tend to choose the specific node which is
the highest link quality, thus, this choice consequently
leads to above mentioned problems. Second, the traffic
load aware routing algorithms to solve the problem
lead to decrease the network throughput; because, they
only consider traffic load without the link quality.
To increase the network throughput, the two

approaches exist: the link quality aware routing
algorithms and the traffic load aware routing
algorithms.
The link quality aware routing algorithms use the
link quality metrics such as Hop count, Expected
Transmission Time (ETT), Expected Transmission
Count (ETX), Weighted Cumulative ETT (WCETT),
modified ETX (mETX), Interference Aware Routing
Metric (iAWARE), Airtime, and Adaptive SituationAware (ASA) routing metric [1]. In general, these
metrics measured by considering the hop count, error
rate, bandwidth, packet size and interference, and they
are used to the routing cost for the routing algorithms.
Although they successfully choose the highest quality
of a path, they can easily cause the network congestion.
Different from the above approach, the traffic load
aware routing algorithms evenly distribute the traffic to
prevent the network congestion. The WCETT-LB
(WCETT Load Balancing) in [2] considers the traffic
load in the link quality metric. In addition, it can
effectively be aware of the network congestion owing
to the periodic monitoring the buffer length. Although
this approach effectively resists the network congestion,
it can severely decline the network throughput.
- 684 -
ICEIC 2015
3. ALBMesh+
time, the node also updates Rij and Qij using ASAi j
Basically, the proposed ALBMesh+ employs one

single artificial ant colony on 802.11 based MCMR
WMN. Fig. 1 shows the logic of the ALBMesh+ in a
wireless mesh node, and each node has the three data
structures as follows.
- Residual delay statistic ( Rij ): the statistic about
and d i j , respectively according to [3].
the measured residual delay by artificial ants which

explore current node i toward neighbor j N i where
Set 3) Route Decision process

When a packet arrives at node i, the node calculates
the weighting factor from the local traffic load. And
then, it also calculates the routing probability using the
E.q. (2). After that, the node determines the next hop,
which has the highest probability, and transmits a
packet to the determined next hop.
N i is the neighbors of current node i.

- Link quality statistic ( Qij ): the statistic about the
measured ASA value by artificial ants. Note that, ASA
is defined in [4].
- Pheromone table ( Pij ): the set of pheromone trails.
idj
idj idj +
where,
I infij
ri j
(1)
and I inf is defined in [3].

ij
pidj =
idj
1
+ (1 ) j
k
Qid
id
k Ni
indicates the learned desirability that ants or flows
(2)
f (i, j )
where =
f (i, k )
at current node i go toward node d through neighbor j .
k Ni
Note that, f (i, j ) means the traffic load of node i

toward the neighbor node j.
4. Conclusions & Future Works

In this paper, the ACO based load balancing routing
scheme was proposed to improve the network
throughput for 802.11 based MCMR WMNs. Through
the ALBMesh+, the network status information such as
delay and ASA can be automatically measured by the
artificial ants. In the near future, we plan to simulate
the proposed algorithm using NS-3 simulator.
Acknowledgement
Figure 1. The logic of the ALBMesh+ in a node i

Based on this structure, the operation of the
ALBMesh+ consists of the following three steps.
Step 1) Measurement process
First, forward ants are periodically generated from
source to destination, and they measure the delay and
ASA value through some path in a network.
Step 2) Updating process
Whenever a backward ant arrives at node i, the node
calculates the ri j ( = d i j ASAi j ) from the
measured information such as delay ( di j ) and ASA
value ( ASAi j ), and updates Qij and Pij using this
value. In particular, the pheromone value ( id ) in
j
Pij
is updated according to the following E.q. (1). At that
This research was funded by the MSIP (Ministry of

Science, ICT & Future Planning), Korea in the ICT
R&D Program 2014 [1391104001, Research on
Communication Technology using Bio-inspired
Algorithm].
References
[1] M. Elias, et. al., Routing Metrics and Protocols for
Wireless Mesh Networks, IEEE Network, Jan. 2008, pp. 612.
[2] Ma, L. and Denko, M.K., A Routing Metric for LoadBalancing in Wireless Mesh Networks, International
Conference on AINWA20 07.
[3] M. Dorigo and T. Stutzle, Ant colony optimization,
The MIT Press, 2004.
[4] G. Lian et. al., Adaptive Situation-Aware Load Balance
Scheme for Mobile Wireless Mesh Networks," MobiWorld
Workshop at INFOCOM 2011.
- 685 -
P4-29
A Dual-Band Printed Antenna for WBAN Smart Wristband Applications

Wonseok Lee and Jaehoon Choi
Department of Electronics and Computer Engineering, Hanyang University
lewis@hanyang.ac.kr, choijh@hanyang.ac.kr (corresponding author)
Abstract
A dual-band printed antenna for smart wristband
applications is proposed. At first, an antenna operating
at 2.45 GHz is designed using rectangular slot on the
top side of the FR4 substrate, and parasitic element
connected to the ground is added to enhance the
bandwidth in 2.45 GHz ISM band. Another parasitic
element is located nearby the feed structure to cover
5.8 GHz ISM band. The overall dimension of proposed
antenna is 40 mm 20mm 1 mm. The 10-dB return
loss bandwidth is 6.5% and 4.8% at 2.45 GHz and 5.8
GHz ISM bands, respectively.
shown in Fig. 1 (b) and (c). The dimension of the

proposed antenna is 40 mm 20 mm 1 mm and a
FR4 substrate with a relative permittivity of 4.4 is used.
The rectangular slot on the top of the substrate excited
by T-shaped coupled feed at the bottom generates a
resonance at 2.45 GHz. Using the parasitic element
connected to the ground, an additional resonance is
generated. Therefore 10-dB return loss bandwidth
becomes wide enough to cover 2.45 GHz ISM band.
Another parasitic element located at the upper edge of
the bottom substrate is used for 5.8 GHz ISM band.
1mm Thick FR4 Substrate
0.6
0.4
Keywords: WBAN, dual-band, printed antenna,

smart wristband
0.6
0.4
37.5
Slot
1. Introduction
20
z
Owing to its variety of potential applications such as

medical, health, and entertainment, wireless body area
network (WBAN) has received great attention [1].
In WBAN applications, the smart wristband has
become popular because of its simple and elegant
design with smart features. Currently, smart wristband
has optical sensors. It can check the body condition and
sends collected information to personal server to
provide individual health care.
In this paper, a dual-band printed antenna for
WBAN wristband applications operating in 2.45 GHz
and 5.8 GHz industrial, scientific, and medical (ISM)
bands is proposed. Considering circuit implementation,
the antenna is designed to use as little space as possible
from the upper edge of the FR4 substrate.
Unit : mm (a)
Metal Area
40
14.5
5.5
Feed
0.5
8.3
1
1.5
7.6
z
x
Unit : mm (b)
Parastic element for 5.8GHz

Parastic element for 2.45GHz
Feed
2. Antenna geometry
The geometry of the proposed antenna is shown in
Figure 1. There is a slot on the top of the FR4 substrate
as shown in Fig. 1 (a). A T-shaped coupled feed with
two parasitic elements are located at the bottom as
Line Width : 0.2

Gap : 0.2
(c)
Figure 1: Geometry of the proposed antenna

(a) Top view, (b) Bottom view, (c) Feed structure
3. Simulated result
- 686 -
ICEIC 2015
Return Loss [dB]
Fig. 2 shows the simulated return loss characteristics

of the proposed antenna with and without parasitic
elements. The first resonance generated by the slot on
the top of the substrate (without parasitic elements) has
1.7% 10-dB return loss bandwidth at 2.45 GHz. When
the parasitic elements are located nearby the feed
structure, additional resonances are generated.
Therefore the proposed antenna satisfies the required
bandwidths of both 2.45 GHz and 5.8 GHz ISM bands.
The simulated 10-dB return loss bandwidths of the
proposed antenna are 6.5% in 2.45 GHz ISM band and
4.8% in 5.8 GHz ISM band, respectively.
Fig. 3 shows the simulated return losses of the
proposed antenna on the phantom and in free space.
The proposed antenna is placed 10mm away from the
surface of a two-thirds muscle-equivalent phantom (r =
35.7, = 1.5 S/m at 2.45 GHz and r = 32.66, = 3.47
S/m at 5.8GHz) to analyze the antenna performance on
the human body [2]. The dimension of the phantom is
200 270 60 mm3. Due to the effect of the phantom,
the bandwidth at 2.45 GHz is reduced to 5.8% while
the bandwidth at 5.8 GHz is increased to 5.3%.
Fig. 4 shows the simulated 3D radiation patterns of
the proposed antenna in free space and on the phantom.
The peak gains of the proposed antenna are -2 dBi at
2.45 GHz and 3.2 dBi at 5.8 GHz in free space. The
peak gains are increased to -0.46 dBi at 2.45 GHz and
7.77 dBi at 5.8 GHz on the phantom.
5.8 GHz
ISM
Band
2.45 GHz
ISM
Band
10
20
30
2.2
w/o parastic elements

with parastic elements
2.3
2.4
2.5
5.7
2.6
5.8
5.9
6.0
Frequency [GHz]
Figure 2: Simulated return loss of the proposed

antenna with and without parasitic elements
Return Loss [dB]
2.45 GHz
ISM
Band
5.8 GHz
ISM
Band
10
Phantom
20
10
270
30
2.2
60
200
Unit : mm
2.3
2.4
2.5
2.6
on the phantom
in free space
5.7
5.8
5.9
6.0
Frequency [GHz]
4. Conclusion
Figure 3: Simulated return loss of the proposed

antenna on the phantom and in free space
(a)
In this paper, a dual-band printed antenna for

WBAN smart wristband applications is proposed. The
proposed antenna has enough 10-dB return loss
bandwidths to cover 2.45 GHz and 5.8 GHz ISM bands
in free space and on the phantom. The radiation
patterns of the antenna are outward directional on the
phantom. All results indicate that the proposed antenna
is a good candidate for WBAN smart wristband
applications.
(b)
Acknowledgement
This work was supported by Samsung Electronics.
References
(c)
(d)
Figure 4: Simulated 3D radiation patterns of the

proposed antenna
(a) free space @ 2.45GHz, (b) on the phantom @ 2.45GHz,
(c) free space @ 5.8GHz, (d) on the phantom @ 5.8GHz
[1] P. S. Hall and Y. Hao, Antennas and propagation

for body-centric wireless communications, Artech
House, Norwood, Mass, USA, 2006.
[2] Gabriel C 1996 Compilation of the dielectric
properties of body tissues at RF and microwave
frequencies Armstrong Laboratory, Brooks Air
Force Base, Tech. Rep. AL/OE-TR-1996-0037
- 687 -
P4-30
OFDMA Based Optical Access Transmission

Using an Injection-Locked Fabry-Perot Laser Diode
Seung-Min Yang, Sang-Min Jung, Sang-Kook Han*
Department of Electrical & Engineering, Yonsei University,
Shinchon-Dong, Seodaemoon-Ku, Seoul 120-749, Korea
skhan@yonsei.ac.kr
real valued OFDM signals. The proposed technique is
verified through experimental demonstration.
Abstract
We propose a technique to enhance the modulation
bandwidth in OFDMA-PON uplink transmission. An
IL-FP-LD was adopted to enhance the modulation
bandwidth in colorless based optical access scheme.
Through this technique, the number of ONU within a
wavelength can be increased in OFDMA PON.
Keywords: OFDMA-PON; IL-FP-LD; DMT
1. Introduction
Recently, orthogonal frequency division multiple
access (OFDMA) based passive optical network (PON)
system has been researched to accommodate the
explosive increase in data traffic. OFDMA-PON can
provide heterogeneous service and higher optical
spectral efficiency and flexibility by employing
dynamic bandwidth allocation (DBA) and adaptive
modulation format. [1]
With regards to OFDMA-PON studies, there is a
critical issue that implementation of high-capacity
transmission and increase of the number of ONUs for
uplink transmission. The most researched optical
component for uplink transmission in single fiber
loopback system is RSOA. However, the RSOA has
limited bandwidth (about 1~1.2 GHz) so it is difficult
to transmit high speed data and to accommodate many
ONUs.
In this paper, we proposed an OFDMA-PON uplink
transmission system, based on an IL-FP-LD. We could
expand modulation bandwidth through proper
controlling of injection-locked fabry-perot laser diode
(IL-FP-LD) [2] and it leads to improvement of
transmission capacity for uplink transmission.
Furthermore, in an aspect of cost effectiveness and
colorless characteristic, the IL-FP-LD is suitable to
PON system. This proposed technique was conducted
by employing discrete multitone (DMT) to generate
2. Experiments
Fig 1 shows proposed experimental setup for the
verification of OFDMA-PON uplink transmission
system using IL-FP-LD. The seed source from OLT
passed through EDFA, VOA and OBPF to adjust the
injection ratio and compensate for the attenuation
arisen from optical link. Polarization controller (PC)
was used to optimize injection-locking. After locking,
IL-FP-LD was modulated by the DMT signal with
QPSK symbol mapping on the subcarriers. The number
of DMT subcarriers was 256 and the FFT size was 512
due to Hermitian symmetry. We varied injection ratio 15 dB to -3 dB and bias current of slave LD from 16.4
mA to 24.19 mA to find optimized and stable channel
state. After 23km uplink transmission, the injectionlocked optical source passed through gain saturated
SOA to suppress the OBI and RB noise. The isolators
and circulators were used to prevent reflective factors
arisen from optical link. After direct detection, the
DMT signal was demodulated by offline processing.
3. Discussion
Fig 2 shows the frequency response of IL-FP-LD
according to the injection ratio. As the injection ratio
increased, relaxation oscillation (RO) frequency is
increased but the peak power of RO frequency (which
is related with RIN) is decreased. It result in stable
channel state and consequently we could get more
modulation bandwidth. Fig 3 shows the frequency
response of IL-FP-LD according to the bias current of
slave LD. When the bias current increased, the RO
frequency is increased and the 3dB bandwidth is
improved. From the two results, we determined the
injected power and bias current of slave LD about -10
dBm and 21.02mA, respectively.
- 688 -
ICEIC 2015
Fig. 1. Experimental setup for the OFDMA-PON uplink transmission system based on IL-FP-LD
The modulation bandwidth enhanced 1.2 GHz to 3.5
GHz and reduced the RIN about 13dB. After achieving
the stable channel state, we transmitted the DMT signal
for the OFDMA-PON uplink transmission. Fig 4 shows
the BER curves against the received optical power. The
2.79 Gb/s (DC to 1.4 GHz) DMT signal from the
ONU1 and 3.98 Gb/s (1.45 GHz to 3.5GHz) DMT
signal from the ONU2 were transmitted successfully.
4. Conclusions
We have proposed and demonstrated OFDMA-PON
uplink transmission system based on IL-FP-LD. The
characteristics of IL-FP-LD are validated and we could
expand the modulation bandwidth by increasing the RO
frequency and reducing the noise floor. As results, we
achieved 3.5 GHz modulation bandwidth and it leads to
6.77 Gb/s uplink transmission over 23 km of SSMF
successfully.
Fig. 3. Frequency response of IL-FP-LD according

to the bias current of slave LD
Fig. 4. BER curves against received optical power
Acknowledgement
MSIP/IITP, Republic of Korea, [13-911-05-002]
Fig. 2. Frequency response of IL-FP-LD according
to the injection ratio
References
[1] W.W. Chonggang et al., Optical orthogonal frequency
division multiple access networking for the future Internet,
J.OPT.COMMUN.NETW, vol.1, no.5, pp. A236-46, Jul
2009
[2] T.B. Simpson et al., Enhanced modulation bandwidth in
injection-locked
semiconductor
lasers,
IEEE
Photon,Technol,Lett, vol.9, no.10, pp. 1322-4, Oct 1997.
- 689 -
P4-31

!!! # " !#

!! $%#!" !#
&! " !#

,44!(0+9? !,#4"4 !

#! ,#:A;'
!

" #"$ $ #

%
( ! " 4"4 ?'B , +7

$
$
"
4 ! ! # !' 0! 10 4 ! !
#% &$"
,"! ,4 !!!,4"

$$#

!!4 '+ ! !
!"$ $' % #
!(
$ )
! !!4!!,+7 " !'(
%
# $ * $
44!9 ,!4! 4>#,4

%
#+ "
, 4 4 "! 4 ! !
,
"" % $ $ '
$

$
#
8 !! ! ,4 ! " !!4'
$ #
$# $#
# ! 84 ! ! ! !

,4 ! 4 ,4 ! ! !#
-% !' .#
!"$' /
!! "#4!:B;'

'! '
C " !44 ! 4" !# ! !

! 4!' (! ! ! ! ! "
('
(&+*)+()&
,4 ! 4 4! 4 ! ! ! !
&* !')! !,4!
! &", .--/ , ! 10
! " ! 4 ! ,!# ! !
2 ! 1!4 04 ! 3 " (0+
,4 :/;'
2(! !4 " ! 04 ! + !3 !4
= ! !!! !,4 ! !4,#
.5 ' 6 ! ,4 !#
,4 ! ! ! ! ! 4
10 +7 " 8 ! 4! ! , ! !!4
! ! , , ,4 ! ! ,! !
! 10 " ! , !, !
8 &* !' 4 ! ! ,!
7# , 4:9;'
44!" 4" !# ! !" ! ,#
8 ,4 ,!!! '
< 4 ! ! ! ,4 ! (0
( ! ! ,! !
+2(! !4 " ! 04 ! + !3
44!"4" !#! ! ! ! !!
! 0+ 204 !4 + 3 )=1
!" ! ,! ! ! '
2)! =># " 1!8 3 !4 , 4
C 8! ! 4"4 !
! ! # !' + ! !
!'
,4 ! ,44!,!4!4 !+7

+7 ? ! /1@ ,44! 4 ! , ! !
! !> 4 ! !" !>
'=># !(0+
)=1 , !! 4 ! ! ! 4

4 4 , !
= 9 10 " 4 (0+ !4'
"! :.;:?;' 9 ! ! 4 ! +7 ,4 !
) 4"44!9? ! './A'* 4
" , ,4 ! " !! !
- 690 -
ICEIC 2015
! ! 4 ! ,4 ! "
"& ! 4 !!!:9;'
( 4 ! " ! !

,4 !# ,4 4 ! !
4!! ! !4,!4! 4, !
' ! !" !4 ! " !
'
= A 4! ! !! ,4 !4
! ') !44 " 1%GH66
24"4 4 4 3 ! 4! 4 4 './A "4
4 '+84, " 1%G."44
1%GH66 24"4 4 4 3 4 ! 4! 4 '
!!! 4 E61IE%$!!
!" !4)=1

= '9(0+ ",4
= . 9? !/1 @,44!#6

44 +7444!'D#04!
+7 !+7 ! 4! !! E%$4/AE61
!4:F;'
= 'A !,4 ! # !
'(1%D1&+6+()&)=)&G1&+1)0(D+7
""$

= B IC,4 ># !'
= '.) ! "44,4"
!

" !
= ? ,4 (0+'+! !!
#! !8 4!!*4 4! !!
4!! #4 !,!4,#!!"!> '
6 ! ,! ! 4! # ! 4
>#!")=1! #'
= 'B !,4 ! # !
= '?=!,(0+
6! ! *= ! ! !!4 ! ! !
4 )=1 44! ! ! ! ! ,
4"44!!4 !66!44!"4
! 1%G.2 './A3' =# ! 4 4 "4
4 #4 D' 64 ! "4 !! !
" !4!!*G0!! '
+ ! ! ! ! (*
- 691 -
ICEIC 2015
(I= 4 ! ! " ! "

4 %G2! 43 !' )
!% !,4:J;'
!$#

) ! " 4 ! !! !
4! ! ! &* " !,
,4 ! !')! !!!!,
10 " 4! ! ! ! 4
! ! &* 4! !' 6 9 K
! ! ! 4 4 ! !
!" ,#!!!'+!4!
4" !#!4! !,#!)=1 '
"4 !==+2 !=! 3!,!!

!
!' =# ,! ! 4 !
8 4 4!! ! ,

4'
= F !! ! " !

! 4" !#'
= 'F+" !4" !#

= '/!! !4" !#
= / ! ! ! ! !

4" !#2++3' 6 !! ! ! ,4
!4!! '+,4 >!293
! !!4!! !4#'
" !4 ? # 4" !# ()2

! !!3 1*28 ! , 3 4
6! ! ' + 6! ! ? #
,!!,!!/40 !!!0*L 4!
! ! '
C ! !!"4" !# !'
+ !4 !,!!4" !#"4 !
! 4! 10 " ! ! 0!!
!,!!!'+,!4 #
!, 8&*4"! !,
,4 ! 4 '
= J ! ! ,! !20*3 D2
!31*28!, 34"!
!4 !"#'

( >! 293 4

! 4! !
,4 !!4!! 4

!"#'& '
( 10 " " ! 4! !
4
>!2.3'+ !!
8@4 &*' C 4
! 4!
! '

( / ! !! !
4

! "4 10
!
- 692 -
= 'J+&*
! D ! !" !4 ! "4
ICEIC 2015
!1*,!!"4" !# !

!8 ! 4" !#!'+D41*,!
! ! ,! 9'B40 ! ! 0* L
"! !' (! !! ,! !
,!! ?'B 40 ! ! ,# 8 !
44!!,!!! '
= 5 %0 ! 4 4 " ! !4 !
4! !!!!! ,!!
!4,4'+ !! !"!#
!#"8!4 "
!4!!! !% '
! 4" !# ! ,! ! 4! !

! ' (! 8! ! ! # !
! 4 ! ! ! !" ,4 !
# ! !! , "4 # !
(0+ 4! # "
>!#'
*=*&
:9; DG D 1, 04 !
+ #+4 '9B./1#.--J
:.; $ (0+M'..?9'.---
:?; &')1'+41'$4+' !
! (0+ 4 !
! ! 4 !! !!" ,4 !
# ! ! ('
(!! ! ),N! ' F/ FF
9555
:A; +,! +' 6 ! ' % =N! 1'
$ &' ' C4 +' O8! !4#
4!" # ! # ! (0+ 4
, !O 6! 4 % ! !#
(!!# '9/5F9F--.--F
= '5) !%0!4

= 9- ! 10 " ! (0+
!'
:B; 4

$# $
# N (0+ ' 9B99B. #
.--F
:/; 6! ' 1' O6 ! ! 4" !# !>
! O !4 6
! ( 7' 9/ ( J '
9AB99ABJ955J
:F; #'+$'(0P+%
'95?Q95A.--J'/
:J; 1G !+ !R*=44
.--/'?'?ABQ?BB
:5; 04 G' ' 4 =' # =' ! '''
O* ! !(0+ # !! ! !4 !+7
!4# 4 ! 0@ O 04 ! (
+ ! 7'B.( 9'?JAA.--/
= '9-108!!!(0+ !

(! ! !!!!4 !! ! ! !
4 ! ! ,
8 , ,!! ! #' ( ! ! !
(0+ !!! 4! 4 #4'
')&D()&
1 ! 10 ! ", ! !! 4
4 " ! !! !"! ' (4
! " ! , ! !"
- 693 -
P4-32
An Efficient Method for the Recognition of ISAR Images

Sang-Hong Park1, In-O Choi2, Yong-Hee Lee2, Joo-Ho Jung2, and Kyung-Tae Kim2
1
Department of Electronic Engineering, Pukyong National University, Busan, Korea
2
Department of Electrical Engineering, Pohang University of Science and Technology, Pohang,
Gyungbuk, Korea
radar@pknu.ac.kr, 913book@daum.net, darklyh, jungjh68 and kkt @postech.ac.kr
Abstract
This paper proposes an efficient classification
method of the inverse synthetic aperture radar (ISAR)
image, which is invariant to the translation and the
rotation. The rotational invariance is acquired by the
two-dimensional Fourier transform and the
translational invariance is obtained by searching for
the minimum distance of the maximum correlation of
the image. Simulation results obtained by using the
ISAR images demonstrates the effectiveness of the
proposed method.
frequency domain. To obtain the rotational invariance,

the ISAR image is transformed to 2D frequency
domain (u, v) and polar mapped by using the following
polar grid [2],
(umn , vmn ) (uc , vc ) (rm cos n , rm sin n ) , (1)
Keywords: Radar, ISAR, Classification

(a) Original image
(b) Rotated image of (a)
Figure 1. Original and rotated images of F-14
1. Introduction
Inverse synthetic aperture radar (ISAR) image [1] is
a two-dimensional image obtained by coherently
processing the radar signal received at various aspect
angles. Because of using the electromagnetic wave, this
image can be applied regardless of weather and daynight conditions. However, a major difficulty arises in
the classification of the ISAR image because of the
translation and the rotation caused when the ISAR
image is obtained. In this paper, we propose an
efficient method to classify ISAR images, which
obtains the translational and the rotational invariance
by using the two-dimensional (2D) Fourier transform
(FT) of the ISAR image. Classification result using the
measured ISAR image demonstrates the effectiveness
of the proposed method.
(a) 2D FT of original image (b) 2D FT of rotated image
2. Proposed method
The proposed method utilizes the characteristic of
the 2D Fourier; the translation and the rotation in the
image domain are phase multiplication and rotation in
- 694 -
(c) Polar mapping of (a) (d) Polar mapping (b)

Figure 2. 2D FT and polar mapping of Fig. 1
ICEIC 2015
conducted in a compact range by varying the frequency
from 8.3 to 12.3 GHz with an increment of 10 MHz.
The 2D FT of the ISAR image rotated by
60clockwise is rotated and shifted by the same rotation
angle in the (u, v) and (r, ), respectively (Fig. 1 and
Fig. 2). The re-rotated image counterclockwise is
almost identical to the original image (Fig. 3). As a
result, the classification results obtained for various
SNRs were close to 100 % (Table 1), demonstrating
the effectiveness of the proposed method.
Figure 3. Re-rotated image of Fig. 1b. The target has
the same pose as in the original image.
4. Conclusion
Table 1. Classification results for various SNRs

SNR
Classification ratio (%)
0
94.9
5
96.5
10
98.1
15
100
20
100
25
100
30
100
where (uc, vc) is (0, 0) Hz and rm and m are the
distance and the angle from the center. Then, the
relative rotation of the two polar-mapped images I1 and
I2 can be found by the maximum correlation in
direction as follows:
(2)
r arg max Cor ( I1 , I 2 ( )) ,
where Cor is the correlation operator and I2()is the

shift of I2 in direction by .
After finding the relative rotation angle r, the test
ISAR image in the (u, v) is rotated by r in the opposite
direction and classified by using the largest matching
score as follows:
M N
MS max IRtr x i, y j IRte i, j , (3)

i 0 j 0
where M and N are the number of rows and columns in

the ISAR image. IRtr and IRte are the training and the
test ISAR images, respectively. Because of the huge
computation time of (3), (3) is operated in the
frequency domain.
In this paper, we proposed an efficient method to

classify the ISAR image that achieves rotational
invariance by using the rotational characteristic of 2D
FT. The rotational was transformed into the shift in
polar mapped image and the rotation angle was found
by using the maximum correlation in direction.
Finally, classification was conducted by using the
matching score of the rotated test ISAR image and the
training image. Experimental result using the measured
data demonstrates the efficiency of the proposed
method.
Acknowledgement
Education,
Science
and
Technology
(2012R1A1A1002047).
References
[1] C. C. Chen and H. C. Andrews, Target-motioninduced radar imaging, IEEE Trans. Aerosp. Electron.
Syst., vol. 16, no. 1, pp. 2-14, Jan. 1980.
[2] S. H. Park, H. T. Kim, and K. T. Kim, Cross-range
scaling algorithm for ISAR images using 2-D Fourier
transform and polar mapping, IEEE Trans. Geosci.
Remote Syst., vol. 49, no. 2, pp. 868-877, Feb. 2011.
To demonstrate the efficiency of the proposed
method, we conducted the classification test for various
values of signal-to-noise ratio (SNR) using the
measured radar signal of five aircraft models, F4, F14,
F16, F22, F117 and Mig29. Measurement was
- 695 -
P4-33
Design of a Dipole Antenna for WBAN Applications

Do-Gu Kang and Jaehoon Choi
Department of Electronics and Computer Engineering, Hanyang University
choijh@hanyang.ac.kr (corresponding author)
Abstract
In this paper, a dipole antenna with parasitic
elements for WBAN Applications is proposed. By
adopting
parasitic
elements,
dual-resonance
characteristic is achieved. To analyze the antenna
performance on a human body, the proposed antenna
located on a human equivalent flat phantom is
simulated. A return loss characteristic of the antenna
is insensitive to the existence of the phantom. The
antenna has radiation characteristic suitable for onbody communication applications.
Keywords: Dual-resonance, dipole antenna, WBAN
(a)
1. Introduction
With the recent development of wireless
communication technology, wireless body area network
(WBAN) has received great attention [1]. WBAN
devices can be classified depending on location: inbody, on-body, and off-body [2]. To increase the
efficiency of an on-body communication link between
two on-body devices, an antenna should have radiation
characteristic along the body surface like that of a
vertical monopole. But, the large height of the vertical
monopole is not suitable for on-body applications.
In this paper, a low-profile dipole antenna which
radiates along the body surface for 5.8 GHz ISM
(industrial, scientific, and medical) band WBAN
applications is proposed.
2. Antenna geometry
Figure 1 shows the proposed antenna that consists of
a dipole radiator, two parasitic elements, and a slot.
The dipole element and two parasitic elements are
located on the top of an FR4 substrate (r = 4.4) with 1
mm thickness. Two parasitic elements are used to
increase the bandwidth by generating additional
resonance. The electrical length of the proposed
(b)
Figure 1: Geometry of the proposed antenna (a)
Top view, (b) Bottom view
antenna is increased by adding a slot on the ground
plane. The ground plane is located on the bottom of the
substrate with a total size of 41 48 mm2.
In order to analyze the performance of the antenna
on a human body, the human equivalent flat phantom
having a dimension of 200 270 60 mm3 is utilized.
Electrical properties of the human phantom are equal to
those of a human tissue (r = 48.2, = 6 S/m). The
- 696 -
ICEIC 2015
Figure 4: Simulated radiation pattern of the

proposed antenna at 5.78 GHz
Figure 2: Simulated return losses of proposed
antenna on the phantom and in air
minimum radiation forward the normal to the phantom

surface (zenith direction) and the maximum radiation at
= 315. The peak gain and radiation efficiency
respectively are 3.45 dBi and 20 % at 5.78 GHz.
4. Conclusion
In this paper, a low-profile dipole antenna for onbody WBAN applications is proposed. The proposed
antenna on a human equivalent phantom has wide
bandwidth (5.602 GHz 5.838 GHz) covering 5.8
GHz ISM band by using parasitic elements. Return loss
characteristic is insensitive to the existence of the
phantom. The antenna provides the radiation along the
near surface direction for on-body communication.
Consequently, above advantages make the proposed
antenna be a good candidate for WBAN applications.
Figure 3: Return loss bandwidth enhancement for

the proposed antenna
Acknowledgement
separation distance between the phantom and the
antenna is 10 mm.
3. Simulated result
The simulated return losses of the proposed antenna
on the phantom and in air are shown in Figure 2.
Simulations were carried out by using HFSS [3]. A 10
dB return loss bandwidth of the antenna is 0.236 GHz
covering 5.8 GHz ISM band (5.725 GHz 5.825 GHz).
The return loss characteristic is insensitive to the
existence of the phantom.
The return loss bandwidth enhancement for the
proposed antenna is illustrated in Figure 3. A first
resonance (f1) of the dipole combines with the second
resonance (f2) formed by the parasitic elements, which
accomplishes dual resonance characteristic.
Figure 4 illustrates the simulated radiation pattern of
the proposed antenna at 5.78 GHz. The antenna has the

government (MSIP) (No. 2010-0017934).
References
[1] S. L. Cotton and W. G. Scanlon, A statistical
analysis of indoor multipath fading for a
narrowband wireless body area network, IEEE
International Symposium on Personal, Indoor and
Mobile Radio Communications, pp. 15, 2006.
[2] P. S. Hall and Y. Hao, Antennas and propagation
for body-centric wireless communications, chapter
1, Artech House, Norwood, Mass, USA, 2006.
[3] ANSYS Inc., Ansoft high frequency structure simulator
(HFSS), ver.15, ANSYS Inc., Ansoft Corporation,
Pittsburgh, PA.
- 697 -
P4-34
Generation of Correlated Underwater Acoustic MISO Channel Signal and Its

Ergodic Channel Capacity
1
Joonsuk Kim1, Il-Suek Koh2, and Yongshik Lee1

Department of Electrical and Electronic Engineering, Yonsei University, Republic of Korea
2
Department of Electronic Engineering, Inha University, Republic of Korea
jskim85@yonsei.ac.kr, ikoh@inha.ac.kr, and yongshik.lee@yonsei.ac.kr
Abstract
Multi-Input and Single-Output (MISO) underwater

acoustic channel signal is generated. BELLHOP is
used to estimate deterministic parameters and the
scattering coefficient of the time-varying PiersonMoskowitz rough surface is used to model the
fluctuation of the reflected signal by the ocean surface.
The spatial correlation is applied so that correlated
MISO channel signal can be achieved. The generated
signal envelopes and the ergodic channel capacity are
provided as results.
Keywords: Underwater acoustic communication,
channel capacity, channel modeling, multi-input and
single-output.
1. Introduction
Underwater acoustic channel has been studied to
understand the nature of the underwater. T. C. Yang
has suggested the spatial correlation model in the
underwater obtained by experimental data recorded
with multiple hydrophones [1]. Moreover, a stochastic
model of signals reflected by the ocean surface has
been proposed [2]. The proposed method is expected
to be used in generation of time-series channel signal.
In this paper, generation of Multi-Input and SingleOutput (MISO) channel signal is proposed. The
required channel information is estimated from
BELLHOP, a ray-based popular deterministic underwater acoustic channel simulator. The scattering
coefficient of the time-varying Pierson-Moskowitz
(PM) surface is used to model the signal fluctuation
due to the ocean surface. The generated MISO channel
signal is made correlated by multiplying a matrix,
which created by the spatial correlation model
proposed in [1]. Finally, generated MISO channel
signal and its ergodic channel capacity curves are
provided.
Fig. 1. BELLHOP simulation result: (a) eigen-ray plot, and (b)

rms power of channel impulse response.
2. SIMO Channel Signal and Its Channel

Capacity
Consider the Wide-Sense Stationary Uncorrelated
Scattering (WSSUS) condition, then the channel signal
of the Single-Input and Single-Output (SISO) is given
by
N
h t an n t exp 2 f c n ,
(1)
n 1
where an and n are the root-mean-square (rms) power

and the mean propagation delay of the nth multipath
component, respectively [2]. fc is the carrier frequency
and N is the total number of multipath components
observed in the channel. n(t) is the fluctuation of the
nth multipath component and is modeled by complex
Gaussian random process with unit variance [2].
BELLHOP model is used to estimate an and n, and its
result is shown in Fig. 1. The sound speed profile is
- 698 -
ICEIC 2015
measured with expendable bathythermograph (XBT)

and taken into account in the simulation. Fig. 1 (a) and
(b) are the eigen-ray plot and its rms power of the
channel impulse response. The depths of the
transmitter and receiver are 60 and 30 m, respectively,
and the horizontal distance is set to 800 m. The
bathymetry b(x) is given by
x 375
(2)
b x 135 25 cos 2
,
500
where the unit of b(x) and x is both m. x is the range

domain in Fig. 1 (a). Generating n(t) from [1], the
SISO channel signal (1) is obtained.
Now, the SISO channel signal is expanded to MISO
channel signal. Let M be the number of transmitters.
Generate M of SISO channel signals with same
deterministic parameters, then define a row vector v of
signals as
(3)
v h1 t h2 t
hM t ,
where hi(t) is the channel signal from the ith transmitter
to the receiver. Note that elements in (3) are
uncorrelated. For the simplicity, assume that each
transmitter is vertically distributed with the spacing of
c, where c is the wavelength at fc. Then, the spatial
correlation coefficient R is given by [2]
r12
r1M
1
r
1
r
2M
,
(4)
R 21
1
rM 1 rM 2
where
i j 2
rij exp
(5)
.
Applying the Cholesky decomposition to R, the

coloring matrix L is provided such that
R LLH ,
(6)
where the superscript H is the Hermitian transpose.
Finally, a correlated MISO channel signal vector v is
given by
(7)
vT LvT ,
where the superscript T is the transpose operator.
Fig. 2 shows the comparison between v and v in (7).
Here, M is set to 2. As can be seen, the envelopes from
v are very similar, compared to those from v. The
ergodic channel capacity of v is given by
C log 2 1 v H v M ,
(8)
where is the mean signal-to-noise ratio (SNR) and

X is the time average of X. Fig. 3 shows the
calculated capacity from v and v. As can be seen, due
to the loss of the diversity gain, the capacity of v is
lower than that of v.
Fig. 2. Envelopes of correlated MISO channel signals.
Fig. 3. Ergodic channel capacity: uncorrelated and

correlated from v and v, respectively.
3. Conclusion
Generation of correlated MISO underwater acoustic
channel signal is demonstrated. The channel capacity
can be easily estimated using the generated channel
signal.
Acknowledgment
This work was supported by ICT R&D program of
MSIP/IITP. [12-911-01-108, Massive MIMO technology based on space-polarization division multiple access for super-macro cellular system]
References
[1] T. C. Yang, A Study of Spatial Processing Gain in
Underwater Acoustic Communications, IEEE J. Ocean.
Eng., vol. 32, no. 3, pp. 689709, Jul. 2007.
[2] J. Kim, I.-S. Koh, and Y. Lee, Short-term fading model
for signals reflected by ocean surfaces in underwater acoustic
communication, IET Commun., to be published.
- 699 -
P4-35
A Dual-Polarized Antenna for MIMO Communication

Jungje Ha and Yongshik Lee
Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Republic of Korea
E-mail address: yongshik.lee@yonsei.ac.kr
Abstract
In this paper, a dual-band and dual-polarized
antenna is demonstrated for a massive Multi-Input
Multi-Output (MIMO) application. The antenna is
composed of ground slot and rectangular patch, thus
its composite structure has dual-band characteristic
that can be applicable to carrier aggregation. Due to
perfectly symmetric structure and differential feed, two
orthogonal polarized waves can be provided with good
cross-polarization performance. The proposed antenna
is designed and simulated for the verification. As a
result, the antenna exhibits gains of 5.5 and 8.9 dBi
with good cross-polarization ratios of 27 dB and 35 dB
at each operating frequency, and therefore it is an
attractive candidate to base station for MIMO
communication.
(1850-1990 MHz) [3]. The simulated results exhibit the

gains of 5.5 and 8.9 dBi with cross-polarization ratios
of 27 and 35 dB at each center frequency.
W2
W1
Ls
Lp
Lg
(a) Patch on layer 1
(b) Ground slot on layer 2

Patch
W2
Layer 1
+V1
-V2
+V2
-V1
Ground slot
H1
Layer 2
Keywords: Dual band, dual polarization, patch, slot
H2
Differential
feed
Reflector
(c) Ground slot beneath

(d) Side View
layer 2
Fig. 1. Configuration of the proposed antenna. (W1 =125
mm, W2=135 mm, Lg=100 mm, Lp=58 mm. Ls=70 mm,
H1=10 mm, H2=50 mm.)
1. Introduction
Development of new base-station antennas has
become one of the most important tasks in
contemporary antenna engineering. Multiple Input
Multiple Output (MIMO) applications have been
suggested as an effective way to increase the channel
capacity by exploiting multipath scattering effects [1].
In addition, multi-band antenna can further enhance
channel capacity, by applying it to carrier aggregation
with MIMO simultaneously [2].
In this paper, a dual-band dual-polarized antenna is
demonstrated for Carrier Aggregation & MIMO
application. The antenna consists of composite
structure with slot and patch, which operated at each
resonant frequency. Also, due to exactly symmetric
structure and differential feed, the proposed antenna
provides two orthogonal polarized radiations with high
cross polarization levels at each band. For the
verification, an antenna is designed and simulated,
which operates at GSM (880960 MHz) and UMTS
2. Antenna Configuration
In this paper, shown in Fig. 1, an antenna is
proposed to have not only dual-band behavior, but also
dual-polarization operation. The antenna configuration
is composed with two well-known resonant radiators
which are sharing the microstrip feed. Both radiators
consist of ground slot and patch which operate at lower
and upper frequency, respectively. Also, this proposed
antenna is fed by microstrip line beneath layer 2, a pair
of crossing ports in layer 2 facing each other forms a
differential port for each polarization. A verticallypolarized wave is radiated when +V1 and V1 are driven
with a phase difference of 180, while a horizontallypolarized wave is generated when +V2 and V2 are
excited with a phase difference of 180. Finally, a
- 700 -
ICEIC 2015
reflector is put with distance of H2=50 mm to reduce
backward radiation at lower passband.
When the lengths of each radiator Ls and Lp are
around half wavelength, both can resonate at each
frequency [4]. While selecting feed position in ground
slot affect dominantly matching performance at lower
frequency, but air gap H1 is the most important
parameter for matching at upper frequency. In addition
to both resonators, the rectangular shaped ground on
layer 2 also generates another resonant mode, thus the
antenna enhance the bandwidth of lower passband.
Shown in Fig. 2(a), while upper passband has only on
resonant mode, but the lower passband has two modes;
slot mode and ground mode.
Reflection (dB)
-10
-20
-30
0.5
1.0
1.5
2.0
Frequency (GHz)
2.5
3.0
(a) Reflection
Isolation (dB)
-90
0o10
-60
dB
90o
60
-10
o
120o E plane-120
(Co-)
0
o
-10
-120o
dB
30o
-10
60o
90o
-20
o
-90o
-20
-150
-20
0o10
-20
30o
-120o -20
-90o
-60o
60o
-20
-10
-30o
30o
-10
-60o
-30o o
dB
90
10 dB
150o
180o
o
@ 0.9 120
GHz
E plane (X-)
H plane (Co-) -150o
H plane (X-)
-10
0
120o
10 dB150o
180o
@ 1.9 GHz
Fig.
gain pattern (thicker) of the proposed
10 dB 150o
-150o 3. Simulated
o
antenna180with cross polarization level (thinner).
4. Conclusion
In this paper, a dual-band, dual-polarized antenna
for MIMO applications is proposed with an extension
of carrier aggregation. A design provides dual
polarizations in both of the bands: GSM (880960
MHz) and UMTS (1850-1990 MHz) with good
impedance matching. In addition, good crosspolarization characteristics is provided because of its
symmetric structure and differential feed. With these
good performance, therefore, the proposed antenna is
very attractive candidate as a base station antenna for
B4G/5G communication system.
0.0
0o10
-30o
-80
Acknowledgements
-100

MSIP/IITP.
[12-911-01-108,
Massive
MIMO
technology based on space-polarization division
multiple access for super-macro cellular system]
-120
0.0
0.5
1.0
1.5
2.0
Frequency (GHz)
2.5
3.0
References
(b) Isolation
Fig. 2. S-parameters of the proposed antenna
3. Design example of the proposed antenna

The proposed antenna is designed with center
frequencies of 0.9 and 1.9 GHz and each sheet in Fig.
1(a)-(c) is fabricated on an FR4 substrate from Taconic
with a thickness of 1.0 mm and a relative permittivity
of 4.4. The layouts are optimized in full-wave
simulator, HFSS [5], and the final structure is
constructed, as shown in Fig. 1(d). Fig. 2 shows the
simulated differential-mode S-parameters. Also, the
gain patterns are provided with cross-polarization
levels in Fig. 4. For radiation pattern measurement, a
dual-band balun might be facilitated for the differential
excitation [6].
[1] L. Mouffok, A. C. Lepage, J. Sarrazin, and X. Begaud,

Compact Dual-Band Dual-Polarized Antenna for MIMO
LTE Applications, International Journal of Antennas and
Propagation, vol. 2012, no. 398423, Sep. 2012.
[2] A. J. Alazemi,G. M. Rebeiz. "A 1.6 2.7 GHz tunable
dual-band 4G-LTE antenna for carrier aggregation" 2014
IEEE Antennas and Propagation Society International
Symposium (APSURSI), pp. 781-782, Jul. 2014.
[3] V. Deillon, J.-F. Zrcher, and A. K. Skrivervik, A
compact dual-band dual-polarized antenna element for
GSM/DCS/UMTS base stations, Microwave and Optical
Technology Lett., Vol. 40, No. 1, 2933, Jan. 2004.
[4] C. A. Balanis, Antenna Theory: Analysis and Design,
John Wiley & Sons, New York, pp. 96-98, 1982.
[5] High Frequency Structure Simulator v10.0, Ansoft
Corporation, Pittsburgh, PA, 2005.
[6] H. Zhang, Y. Peng, and H. Xin, "A Tapped SteppedImpedance Balun With Dual-Band Operations" IEEE
Antennas and Wireless Propagation Letters, VOL. 7, pp.
119-122, 2008.
- 701 -
P4-36
Miniaturization of Transmission Line Using Shunt Capacitors with

Minimized Bandwidth Shrinkage
Taejun Lim, Yongshik Lee
Department of Electrical and Electronic Engineering, Yonsei University Republic of Korea
yongshik.lee@yonsei.ac.kr
2. Miniaturization Using Shunt Capacitors
Abstract
This work presents a simple method of
miniaturization using shunt capacitors with minimized
bandwidth
shrinkage.
The
deterioration
in
performance due to miniaturization can be relieved by
adjusting the location of capacitors and it can also
minimize bandwidth shrinkage. The ideal circuit
simulation results of a miniaturization of quarter
wave-length transmission lines with various loading
location and its application to Wilkinson power divider
shows the validity of this method.
Keywords: Wilkinson power divider, miniaturization,
miniaturized transmission line, minimized bandwidth
shrinkage, shunt-capacitive loading.
Fig. 1. Schematics of (a) quarter-wavelength

transmission line, (b) miniaturized transmission line
with two shunt capacitors
1. Introduction
The reactive loading method is one of the popular
methods of miniaturization for transmission line [1-3]
due to its simplicity. They have been applied to various
circuits consisting of quarter-wavelength transmission
lines such as impedance transformer, Wilkinson power
dividers [1], filters [2], and so on [3]. However,
because it is based on mathematical equivalence at
design frequency, the method suffers from bandwidth
shrinkage after miniaturization. It can be relieved by
loading more reactive elements and/or other structure
modification, but it requires high fabrication cost
and/or complex design procedure.
In this paper, the simple method of miniaturization
by shunt capacitors that allows minimized bandwidth
shrinkage is presented. Based on this method, the
benefit of reactive loading method such as low cost
fabrication, and design simplicity can be maintained
and the performance degradation can be reduced.
Fig. 1 shows the schematic of a conventional

quarter-wavelength transmission line and miniaturized
transmission line with two shunt capacitors which are
loaded symmetrically. The miniaturized transmission
lines are of characteristic impedance ZC and electrical
length 1 or 2. Then, total length = 21+ 2 must be
shorter than 90 to miniaturize.
The conditions for miniaturization can be obtained
by equating two ABCD matrices of circuits in Fig. 1.
The design parameters are
ZC Z 0
2(1 sin 2 1 )
sin (21 ) sin 2 2 sin 2
2
2
2
1 sin(21 2 ) sin (21 ) sin 2
.
2
2
ZC 0 sin (1 2 / 2) sin (1 2 / 2)
(1a)
(1b)
3. Minimization Method of Bandwidth

Shrinkage
- 702 -
ICEIC 2015
Fig. 2. Imaginary part of Y21 of conventional

(=90) and miniaturized transmission lines of
=30 (thicker lines), 60 (thinner lines) for P=15,
72, and 90%
The proposed miniaturization method can provide
exactly same performance at design frequency F.
However, because there is no consideration about
performance at other frequencies, there is degradation
in performance. As can be seen in (1), the design
parameters are function of 1 and 2. Then, for same
miniaturization length , the performance of
miniaturized transmission line is changed with respect
to loading location P, which is
P
2
1 2
100 (%).
(2)
Fig. 2 shows the performance of conventional and

miniaturized transmission lines. As shown, the
performances of miniaturized transmission lines at
design frequency (F=1) are exactly same with
conventional
transmission
line
regardless
miniaturization length and loading location P.
However, there is difference between the performance
of conventional and miniaturized transmission line at
other frequency. It seems to minimize by loading
specific location around P=72%.
The bandwidth enhancement can be shown in Fig. 3,
which compares the performance of miniaturized
Wilkinson power divider with various loading location.
As shown, the performance with P=72%, which
perform the most similar with conventional
transmission line, also provide minimized bandwidth
shrinkage than other loading locations.
Fig. 3. Ideal circuit simulation results of Wilkinson

power dividers based on conventional quarterwavelength (=90) and miniaturized (=30)
transmission lines.
4. Conclusion
This work demonstrates the simple method of
minimizing bandwidth shrinkage due to miniaturization
using shunt-capacitive loading. By adjusting the
loading location of two shunt capacitors, performance
of miniaturized line can be improved and there is a
location that can reduce the performance degradation
than other loading locations.
5. Acknowledgment
MSIP/IITP.
[12-911-01-108,
Massive
MIMO
technology based on space-polarization division
multiple access for super-macro cellular system]
References
[1] M. C. Scardelletti, G. E. Ponchak, and T. M. Weller,
Miniaturized Wilkinson Power Dividers Utilizing
Capacitive Loading, IEEE Microw. Wireless Compon. Lett.,
pp. 6-8. January 2002.
[2] J.-H Park, S. Lee and Y.Lee, Extremely Miniaturized
Bandpass Filters based on Asymmetric Coupled Lines With
Equal Reactance, IEEE Trans. Microw. Theory and Tech.,
pp. 261-269. February 2012.
[3] W. Nie, S. Luo, Y.-X. Gue and Y.Fan, Miniaturized
Rat-Race Coupler With Harmonic Suppression, IEEE
Microw. Wireless Compon. and Lett., pp. 754-269.
November 2014.
- 703 -
P4-37
An Optimal LED Module Intelligent Systems for

Smart Emotional-Lighting Control
Eun-ja Jo, Su-Jeong Yun, Jun-young Jang, Chi-Ho Lin
School of Computer, Semyung University
jjonja@hanmail.net, sjbaby79@naver.com, win4723@nate.com, ich410@semyung.ac.kr
time through measured information from multiple
sensor.[5-7]
Abstract
In this paper, we proposed optimal LED module
intelligent systems for smart emotional-lighting control.
Optimal LED module intelligent systems for smart
emotional-lighting control is controlled automatic and
manual control of smart devices that can confirm the
selection, and according to the choice of the current
was defined intensity level of lighting equipment
sensitivity. The proposed optimal LED module
intelligent systems are generated automatically pattern
when run the program. And it was distributed
uniformly of the illuminance by changing the lighting
pattern of the illumination device. An efficiency
verification results of LED module intelligent systems
for smart emotion-lighting control, were possible to
improve the luminous efficiency with a minimum of
interference to internal heat generation of the LED
module through to lighting control by environmental
information around of the LED lighting device. And it
was reduce to energy consumption.
2. An optimal LED module intelligent system

An optimal LED module intelligent system. We
proposed reverse and rotation algorithm of a patterns
operate lit from four different patterns in one rotation.
First pattern in the matrix of a magic square is
completely symmetrical lighting pattern. Second
pattern moves to reverse to first pattern. Third pattern
is rotation to 90 from second pattern. And fourth
pattern is reverse from third pattern. But luminous flux
is reduced by compared existing system because used
to half LED of all LED. It needed to placement for
high-brightness LED lamp by supplement. Fig. 1
shows the optimal LED module control algorithm.
Keywords: LED, Lighting Control, Pattern, Emotion Lighting,

Control System.
1. Introduction
Modern society is increasing a life time of the
interior space due to urbanization and changes in the
industrial structure. Lighting is requiring various
changes depending on the user's actions in each area.
Users are different perceive the environment and
things, according to light quality and quantity,
projection method. Lighting have an effect on directly
and indirectly any behavior in space. LED is currently
being evaluated as candidates light source for the next
generation. [1-4]
This paper proposed an optimal LED lighting
control algorithm in order to complementary to
disadvantages of the existing lighting device. Such
algorithm has reduce heat of LED, that divisions
pattern structure to using a magic square and performs
pattern lighting. And we designs the LED lighting
control system to obtain low power and energy
efficiency by control to lighting pattern of LED at real
Fig. 1. An optimal LED module control algorithm

A magic square is an arrangement of integers from 1 to
n2 in a square n x n, such that the n numbers in all
rows, all columns, and both diagonals sum to the same
constant. Fig. 2 shows the pattern array storage.
Fig. 2. Pattern array storage

Proposed algorithm considered to fully symmetric
algorithms of a magic square. Such algorithm is not
- 704 -
ICEIC 2015
changes almost to illumination that equals life-cycle of

LED and distribution light evenly. Because all the
LED evenly cross lighting for pattern to rotate 90
degrees or reverse. It can create a fully symmetrical
pattern using a magic square. If pattern become
completely symmetric, illumination can be distributed
evenly for become change pattern. The illuminance
distribution indicates the two-dimensional or spatial
spread and change of illuminance. The status of
illuminance distribution is important since, even if the
average illuminance is equal, the illuminance
distribution looks very different according to the
distribution status. Fig. 3 shows a rotation & reverse
algorithm.
Fig. 3. A rotation & reverse algorithm

Changes in the pattern and the color of the LED
lights is three won cannibalism of light Red, Green,
Blue and second mixed color Cyan, Yellow, Magenta
and third mixed color is White. Fig. 4 shows a color
change in a gradual.
Red Green
Green Blue
Blue Red
Fig. 5. Compare of Results
4. Conclusions
In this paper proposed algorithm of this paper was
compared with existing full-light approach. With the
result, luminous flux of light reduced about 25%.
Power consumption reduced about 0~30% and heatvalue reduced about 8.8~31.6%. In addition, it was
increasing life-cycle of the LED, and energy efficiency.
If pattern used a magic square applied to a variety of
lighting devices then can efficiency from power
consumption and LED life-cycle is maximized.
Therefore, in this paper proposed an optimal LED
lighting control algorithm to reduce power
consumption is expecting to improvement on lighting
control technology of lighting industry.
ACKNOWLEDGMENTS
This research was supported by the MSIP(Ministry
of Science, ICT and Future Planning), Korea, under
the Human Resource Development Project for SoC
support
program
(NIPA-2014-H0601-14-1001)
supervised by the NIPA(National IT Industry
Promotion Agency).
Fig. 4. Gradual color change
References
[1] Tahidul Islam, Insoo Koo Autonomous Indoor Lighting

Device Control System Based on Wireless Sensor Network,
The Journal of The Institute of Internet, VOL. 11 No. 4,
August 2011, pp.31-38
[2] King-Tong Lau, William S. Yerazunis, Roderick L.
Shepherd, Dermot Diamond, Quantitative colorimetric
analysis of dye mixtures using an optical photometer based
on LED array, Sensors and Actuator B: Chemical, Vol.114,
No.2, pp.819-825, 2006.
[3] Jin Choo, Bohyeon Yoo Study on Application of
Emotional Lighting based on the theory of physiological
function by light KSBDA, Vol.12, No.3, 2011
[4] Takahashi, S, Effects of color lighting on emotionalexpression judgment and personal impression, Fuzzy sets
and Systems, v31, pp.14-15, 2007
[5] J. H. Baek, LED lighting guideline according to Space
and user type in indoor, Design Studio Lighn, 2011.
[6] D. H. Jung, S. J. Lim and S. K. Oh, Design of RGBW
LED System Based on Intelligent Algorithm, KIEE, 2012
An optimal LED lighting control algorithm to

reduce power consumption performs cross lighting
unlike regular full lighting. Because, such algorithm
has benefits to lower power consumption increases
module life-cycle and low heat. The frequency in use
of each LED to analyze whenever the individual were
to increase. As a verification result could obtain
modules has equal LED life-cycle by equal to lighting
it. LED lighting device shows to luminous flux of
73(lm), heat of 57( ) and power consumption of
3.15W as in all lighting used existing method. Other
hand, LED lighting device using a magic square shows
to luminous flux of 62.5(lm), 45.5( ) and power
consumption of 24.9W. Fig. 5 shows a differences in
the existing system and the proposed algorithm.
- 705 -
P4-38
A New Vehicle Image Compensation Enhancement Algorithm

based on An Efficient Shaking Elimination of Image
Eun-Ja Jo, Su-Yeon Song, Sung-IL Hong, Chi-Ho Lin
School of Computer, Semyung University
jjonja@hanmail.net, davinchy00@hanmail.net, megadriver@hanmail.net, ich410@semyung.ac.kr
Abstract
In this paper, we propose a new vehicle image
compensation enhancement algorithm based on an
efficient shaking elimination of image. The proposed a
vehicle image compensation enhancement algorithm
was elimination to the vehicle image shake using
motion compensation and motion estimation. And,
algorithm was calculated the histogram of pixel values
from each sub-image by dividing the image as the
constant size areas in order to image enhancement.
Also, it had enhancement to the image by adjusting the
gradient. In this paper, the proposed image
enhancement algorithm was demonstrated effectiveness
when compared to existing vehicle image stabilization,
because the elimination of shake for the vehicle images
used real-time processing without using a memory.
Keywords: Motion Vector, Histogram, Motion
Removal, Image Enhancement, Merging, Calibrated
1. Introduction
In recent, the imaging information using the imaging
sensors can improve to the driver's situational
awareness ability with assisted to driving stability. The
vehicle image stabilization technique is a technique to
obtain an image without blurring and sharp through
image stabilization when camera shakes as the external
factors such as wind or vibration, a hand shake. Its
importance is increasing in various driver assistance
systems such as automatic driving, lane detection,
navigation tracking of pedestrians and the vehicles. In
addition, the imaging stabilization algorithms
implementation and chip development, the requirements
for improve stability have being increasing through the
driver situation awareness [1-4].
The Lucas-Kanade Optical flow using a gyro sensor
is occurred a problem for the decreased of the rotation
angle accuracy by continuous accumulation of errors.
When it is applied to the vehicle, it is difficult of
determine the exact value, because the absolute position
of camera movement cannot be configured easily at the

image stabilizer time. Therefore, the research for solve
the problem has been advanced [5-6].
In this paper, we had been analyzing the efficiency
and the performance evaluation by propose an efficient
vehicle image compensation algorithm using motion
elimination image in order to solve the problem.
2. A new vehicle image compensation

enhancement algorithm
The proposed a vehicle image compensation
enhancement algorithm was constructed of the vehicle
image shake removal part and the vehicle image
compensation part. The motion estimation and shake
elimination of the vehicle image shake removal part was
configure as of local motion vector estimation, irregular
local motion vector detection, global motion vector
estimation, function of shake elimination. The vehicle
image compensation part was configure as the image
merge function through image dividing, contrast
enhancement control, boundary artifacts elimination.
Fig 1 shows the proposed a new vehicle image
compensation enhancement algorithm. In the input step
of Vehicle Image Sequence, original image was loaded
as input which used to stabilize the shake vehicle image.
Fig. 1. Vehicle image compensation enhancement algorithm
The propose vehicle image compensation

enhancement algorithm was estimated about any move
and change by compared the previous and current
frames for predict the movement in many areas through
local motion vector estimation, and was calculated the
pixel values of each macro block area position. The
ILMV was judgment using the mean and standard
deviation of measure LMV. LMVs were used median
- 706 -
ICEIC 2015
filter except ILMV through judgment of an accurate
GMV using low computational repeat. The shake was
calibrated as the four directions for adjust shaking of
vehicle imaging using a measuring GMV.
The image divide step of shake elimination image
was divided into certain area of the image in order to
the image shaking stabilizer, and it calculated the
histogram of the pixel values from each sub-image. The
contrast enhancement control step slowly adjust the tilt
of the histogram by decentralize to the histogram form
that concentrated to a specific value for result of the
shaking of the image at the histogram of the pixel
values measured. The elimination of boundary artifacts
using bilateral weighting scheme was adjustment of
histogram gradient by luminance limit, and determined
concentration of histogram gradient by concentration
limit. The luminance limiting step adjust the tilt
depending on the value of the brightness of the image.
The concentration limiting step determine the
concentration of histogram. The population limiting
step reduce the number of pixels in the inclination of
the CDF. The merging step created a weight by the
three criteria for the boundary artifacts removal, and the
inclination was re-generated by multiplied of weight.
And, next step were improved the histogram of each
sub-image. Also, it was decreased the number of pixels
by pixel concentrate limit, and merged of image by
enhance histogram of each sub-images.
Fig. 3. The comparison example for color level
Table 1: The memory and system requirements
4. Conclusion
In this paper, we proposed a new vehicle image
compensation
enhancement
algorithm.
The
experimental results of the propose algorithm was able
to obtain a restored result of the less noise and the
naturalness through comparison of luminance and color
levels, and it was demonstrated the efficiency. The
proposed imaging processing techniques is can enable
the implementation of a low cost without incurring
additional costs because the infrastructure has already
been built.
Acknowledgment
Human Resource Development Project for SoC support
program (NIPA-2014-H0601-14-1001) supervised by
the NIPA (National IT Industry Promotion Agency).
Fig. 2. The boundary artifact remove method
References
3. The experimental results

The proposed algorithm were determined as
compared with other algorithms for the effectiveness
analysis that the detail of the entire image, noise, and
naturalness. Fig 3 shows Comparison of color level.
The hat in the square was restored most closely to the
source that the detail of the cap itself into the results of
the proposed method. Experimental results in color
levels was possible to obtained of restored more
excellent as compared with other algorithms that detail
of the image entire, the noise, naturalness. Table 1
shows result by compare the memory usage and system
requirements of the propose algorithm to the existing
algorithm. The propose algorithm was obtained the
results that does not use the memory, because it was
done vehicle imaging stabilization in real-time.
[1] Oh, J. S., Sim, K. B., Digital Image Stabilization

Technique of Robot Using Motion Sensor, Trans. of the
KIIS, Vol. 19, No 3, pp.317~322, June 2009.
[2] Chang. J. Y., Hu, W. F, Cheng, M. H. and Chang. B. S.,
Digital Images Translational and Rotational Motion
Stabilization Using Optical Flow Technique, Trans. of KIEE,
Vol. 48, No. 1, pp. 108~115, Feb 2002
[3] H. C. Chang et all, A robust and efficient video
stabilization algorithm, Proceedings of IEEE ICME, pp.2932, June. 2004.
[4] L. Luo, J. Chong, Real-Time Digital Image Stabilization
for Cell Phone Cameras in Low-Light Environments without
Frame Memory, ETRI Journal, Vol. 34, No. 1, pp138-141,
Feb. 2012
[5] Lucas, B. & Kanade, T., An iterative image registration
technique with an application to stereo vision, Proceeding
DARPA Image Understanding Workshop, pp121-130, Apr.
1981.
- 707 -
ICEIC 2015

Poster Session
PS-5
Signal Processing
P5-01
Fast Intra Coding Method with Reduced RDO Complexity Using Regional
Edge Information in HEVC
Byungjin Chung and Changhoon Yim
Department of Internet and Multimedia Engineering, Konkuk University, Seoul, Korea
cyim@konkuk.ac.kr
Abstract
In this paper, we propose a fast intra coding method
based on regional edge information to reduce the
computational
complexity
of
rate-distortion
optimization (RDO) process in HEVC. If first performs
edge detection in sub-regions and estimates the
angular direction from the gradient values. The
proposed method reduces the number of prediction
modes for RDO process using the extracted angular
mode information. If there are many overlapping
modes in different sub-regions, the number of
prediction modes is greatly reduced. If there are few
overlapping modes in sub-regions, it performs the
RDO computation as the existing method. Simulation
results show that the computation time is reduced
significantly, while the compression performance is
similarly maintained.
directions. The other two modes are DC mode and

planar mode. It is necessary to calculate the RD costs
of 35 prediction modes for each CU in rough mode
decision (RMD) process. Through the comparison of
Hadamard transform cost in RMD, the HEVC selects
candidate modes. The selected candidate modes and
the most probable mode (MPM) are compared in the
full rate-distortion optimization (FRDO) process to
determine the best prediction mode. The HEVC
reduces the excessive computations for RDO through
RMD, but it still requires about 20% of computation
time for intra mode encoding [4].
2. Proposed Method
A. Extraction of local edge information
0
Keywords: High efficiency video coding (HEVC),

intra prediction, rough mode decision, rate-distortion
optimization (RDO).
Fig 1. Division of into four sub-regions

for the extraction of regional edge information.
1. Introduction
High efficiency video coding (HEVC) was recently
approved as a new video compression standard [1].
The HEVC could achieve improvements of
compression efficiency about 40~50% compared with
the existing H.264/AVC standard. The HEVC employs
the quad-tree structure in coding unit (CU), prediction
unit (PU), and transform unit (TU) [2, 3]. The HEVC
can go through recursive division process from 64 64
size to 8 8 size for each CU, and it determines the
best size of CU through rate-distortion optimization
(RDO). By the flexible size of CU, HEVC improves
the prediction accuracy. However the computational
complexity is greatly increased because there can be
many possible combinations of CU sizes.
While the H.264/AVC offers 9 possible prediction
modes, the HEVC provides 35 possible prediction
modes for intra coding. There are 33 possible
directional modes that include horizontal and vertical
Let represent the current PU at depth level k for

RMD process. The is divided into four subregions . The with i = 0, 1, 2, and 3
represents the left top, right top, left bottom, and right
bottom sub-region in . Sobel operation is used to
extract edge information in each sub-region. Let
S (, ) and S (, ) represent the horizontal and
vertical gradient values at coordinate (, ) by Sobel
operation. The magnitude is calculated as
(, ) = 2 (, ) + 2 (, )
(1)
Let represent the maximum value of (, ) in

. The threshold for edge information in is
defined as
- 709 -
= 3=0
(2)
ICEIC 2015
The extraction of edge information is defined as
If > , then = 1
Otherwise, = 0
(3)
If
= 1 , then it is considered that there exists
salient edge information in . The angle (, ) is
calculated for the coordinate (, ) with the maximum
(, ) in as
(, ) = arctan ( )
The proposed method shows very small difference

with the results of HM-13.0, while it gives the
reduction of computation time by 18.61% in average.
Table 1: The comparison of BD-PSNR, BD-rate,
and ATS between the HM and the proposed method
Class
Traffic
BasketballDrive
BQTerrace
B
Kimono1
ParkScene
FourPeople
C
Johnny
Average
B. Proposed prediction mode selection method
= 3=0
(5)
When the number of sub-regions with salient edge

information is four, it can have up-to twenty prediction
modes. The selected modes go through steps that
remove the overlapping modes in . After removing
the overlapping modes in , the planar and DC modes
are included in . The horizontal and vertical
directional modes are also included in , if it does not
contain these directional modes.
The proposed method is developed by modifying the
reference software for HEVC, HM-13.0. The
simulation is performed by applying the QP values of
22, 27, 32 and 37 for Class A, B, and C video
sequences.
To evaluate the reduction of computational time, it
calculates the average time saving (ATS) as
ATS(%) =
.(.).()
.()
100
(6)
Table 1 shows the simulation results of BD-PSNR

(dB), BD-rate (%), and ATS (%). The BD-PSNR
decreases very little from -0.01 to 0.08 (dB), and the
BD-rate increases from 0.52 to 1.51 (%).
BD-PSNR
(dB)
(4)
The proposed method reduces the number of

prediction modes in RMD process. The directional
prediction mode is selected for the with = 1.
The proposed prediction mode selection method
includes 2 left and 2 right neighbor directional modes
for the with = 1. Hence 5 directional mode is
selected for the with = 1.
Let represent the set of selected modes in .
Let represent the collection of modes in .
Sequence
-0.06
-0.03
-0.03
-0.01
-0.02
-0.08
-0.06
-0.04
BD-Rate
(%)
1.11
1.07
0.69
0.52
0.58
1.40
1.51
0.98
ATS
(%)
-20.31
-19.00
-18.66
-16.67
-15.28
-20.66
-19.70
-.18.61
4. Conclusion
The proposed method reduces the computational
complexity for HEVC intra coding computational
complex by reducing RDO complexity based on
regional edge information. The BD-PSNR decreases
about -0.04 dB, and the BD-rate increases about 1%,
while the encoding time is reduced about 19%.
Acknowledgements
Education, Science and Technology (2011-0009426),
and by BK21 Plus. This research was also supported
by the IT R&D program of MSIP/KEIT (10044667,
Live encoder for 4K UHD and N screen real-time
broadcasting based on HEVC codec that reduce
transmission bandwidth doubled compared to H.264
codec).
References
[1] JCT-VC, High Efficiency Video Coding (HEVC) text
specification draft 10 (for FDIS & Consent), JCTVC-L1003,
Joint Collaborative Team on Video Coding (JCT-VC) 12th
Meeting: Geneva, Jan. 2013.
[2] G. J. Sullivan, J.-R. Ohm, W.-J. Han, T. Wiegand,
Overview of the high efficiency video coding (HEVC)
standard, IEEE Trans. Circuits Syst. Video Tech., vol. 22,
no. 12, pp. 1649-1668, Dec. 2012.
[3] J. Lainema, F. Bossen, W.-J. Han, J. Min and K. Ugur,
Intra coding of the HEVC standard, IEEE Trans. Circuits
Syst. Video Tech., vol. 22, no. 12, pp. 1792-1801, Dec. 2012.
[4] F. Bossen, B. Bross, K. Suhring, D. Flynn, HEVC
complexity and implementation analysis, IEEE Trans.
Circuits Syst. Video Tech., vol. 22, no. 12, pp. 1685-1696,
Dec. 2012.
- 710 -
P5-02
Tool-Mediated Haptic Surface Recognition

Jun-Yong Lee, Qing-Fu Han, Hyoung-Gook Kim
Kwangwoon University, Republic of Korea
{jasonle88, qingfu33, hkim}@kw.ac.kr
trained texture. The classifier is critical in the design of
texture classification systems.
Abstract
This paper aims to understand how meaningful
information can be extracted from the acceleration
signals in order to use it as useful features to classify
or recognize the object surface texture efficiently. The
database includes recorded accelerations measured
during controlled and well-defined texture scans, as
well as uncontrolled human free hand texture
explorations for 43 different textures. Among the tested
features, best results are achieved using MelFrequency Cepstral Coefficients (MFCCs), leading to
a texture recognition accuracy of 80.2%.
To evaluate the audio features, one query is used as
test data and the other nine as training data and all of
the data are used in a tenfold cross validation. Each
feature is tested individually using the aforementioned
GMM model.
Audio Feature
MFCC
Rasta PLP
Spectrum Centroid
Spectrum Flatness
Chroma
LPCC
Spectrum Roll-off
Keywords: haptic surface recognition, audio features.
1. Introduction
Recently, there has been a strong focus on
understanding the vibrations that occur during contact,
especially during sustained interactions with a textured
surface. Haptics is a tactile feedback technology which
recreates the sense of touch by applying forces,
vibrations, or motions to the user. The human haptic
perception is composed of the kinesthetic and tactile
submodalities, which are both crucial for the perception
of objects and surfaces. To start with, we recorded
texture signals under controlled and uncontrolled
conditions for 43 different textures.
2. Haptic texture recognition

The system for haptic texture recognition is divided
into two modules which are haptic texture model
generation and haptic texture classification. In the
haptic texture, unlabeled texture signals are inputted to
a segmentation module, which segments stroking signal
and initial signal. The detected stroking signal is
transformed into feature extraction and is trained to
find decision boundaries. The haptic texture
classification finds the most likely class for a given
Precision (%)
80.23
58.19
17.57
16.89
8.49
5.74
5.28
MFCCs yield the best results of all tested audio

featureswith a precision of 80.23% and Spectrum Rolloff coefficients achieve only a very poor result of
5.28%
Acknowledgement
Education,
Science
and
Technology(NRF2013R1A1A2007601)
References
[1]S. Lederman and R. Klatzky, Haptic perception: A
tutorial, Attention, Perception, & Psychophysics, vol.
71, no. 7, pp. 14391459, October
2009.
- 711 -
P5-03
Pedestrian Detection Algorithm using GFB and Census Transform

Sewon Lee, Jin-won Jang, Hyo-Jun Son, and Kwang-Ryul Baek
Department of Electrical Engineering, Pusan National University, Busan, 609-735, Korea
sewon830@pusan.ac.kr
Abstract
This paper presents a pedestrian detection algorithm
using Gabor filter bank and Census algorithm. In
general, Gabor filter is a linear filter used for edge
detection, because frequency and orientation
representation of Gabor filters are similar to those of
human visual system. A Census transform is nonparametric local transform rely on the relative ordering
of local intensity value, so it is widely used for stereo
matching. Using above two algorithm, we propose a
strategy for detecting pedestrian in consecutive frames.
First, GFB(Gabor Filter Bank) and linearSVM(Support Vector Machine) is used for detecting
pedestrian in present frame. Second, CT(Census
Transform) and SAD(Sum of Absolute Difference) is
used for estimating the pedestrian-like area in next
frame. Finally, the proposed algorithm makes a
decision whether the estimated area includes pedestrian
or not.
Keywords: Pedestrian Detection, Gabor filter, Census
Transform
1. Introduction
As car industry is growing, pedestrian traffic accident
is increasing. To reduce the traffic accidents and the
severity of the pedestrian injuries, there have been many
researches such as road infrastructure improvement, car
structure improvement, and advanced driver assistance
system (ADAS) based on sensor network. There are
many sensors to detect the pedestrian, for example, IR
sensor, LADAR, proximity sensor, temperature sensor,
image sensor, and so on. Among them, the image sensor
is the most intuitive and includes much more
information compare to the other sensors. Furthermore,
because vehicles equipped with image recording device
is generalized, it is essential to study the pedestrian
detection using an image sensor.
Figure 1: Steps of the image processing [1]

In this thesis, we propose a pedestrian detection
algorithm using GFB and CT. The algorithm is divided
into two parts, detection part and estimation part. GFB
is used for detecting pedestrian, and CT is used for
estimating the ROI. The detection part which includes
GFB-based pedestrian detection algorithm is our
previous work, so the details of the algorithm are left out
from this paper [1]. Figure 1 and 2 are steps of the image
processing and result images from our related work,
respectively. In estimation part, we adopt CT and SAD
which are widely used for stereo matching. We use these
two algorithm for matching pedestrian area within the
two consecutive frames.
As using the above estimation process, the overall
processing time for detecting pedestrian in moving
image is drastically decreased.
Figure 2: Result of pedestrian detection [1]
- 712 -
ICEIC 2015
not decrease the accuracy. Census transform accords
with our objective. In the results, the overall processing
time for detecting pedestrian in moving image is
drastically decreased.
2. Pedestrian Tracking in Moving Images
Figure 3: Sequence of the system design

The proposed system design to detect pedestrian in
moving images is shown in Figure 3. First, GFB and
linear-SVM is used for detecting pedestrian in present
frame. Second, CT and SAD is used for estimating the
pedestrian-like area in next frame. Finally, the proposed
algorithm makes a decision whether the estimated area
includes pedestrian or not. In order to detect pedestrian
in consecutive frames, above steps should be performed
iteratively.
CT is non-parametric transform. () maps the
local neighborhood surrounding a pixel P to a bit string
representing the set of neighboring pixels whose
intensity is less than that of P. The CT can be specified
below [2].
R ( P) ( P, P [i, j ])
[ i , j ]D
(1)
Figure 4: Process of the proposed algorithm
The SAD is an algorithm for measuring the similarity

between image blocks. In the result of SAD, the
minimum value of the result is the position of
pedestrian-like area. The SAD can be specified below
[3].
( i , j )W
I1 (i, j ) I 2 ( x i, y j )
Table 1: Processing time comparison

GFB based detection
Full image ROI based
300ms
60ms
(2)
References
3. Experiment and result

We obtained moving images(640 480 pixels)
which include pedestrian. In Figure 4, there are two
consecutive frames (n-1 frame and n frame) for
illustrating our algorithm, and we evaluate the
performance of the proposed algorithm by comparing
our previous work to the proposed algorithm in Table 1.
4. Conclusion
We present a pedestrian detection algorithm using
Gabor filter bank and Census algorithm. Our previous
work which uses GFB and linear SVM has high
accuracy but the processing time is relatively slow. To
improve the performance of the GBF based algorithm,
we should adopt fast matching algorithm which does
Proposed algorithm
Full image ROI based
180ms
36ms
[1] S. Lee, J. Jang, H. Son and K. Baek, Pedestrian Detection

Algorithm using a Gabor Filter Bank, Journal of Institute of
Control, Robotics and Systems, Vol. 9, pp. 930-935, 2014.
[2] R. Zabih and J. Woodfill, Non-parametric Local
Transforms for Computing Visual Correspondence, In
Proceedings of European Conference on Computer Vision, pp.
151-158, 1994.
[3] S. Vassiliadis, E.A. Hakkennes, J.S.S.M. Wong and G.G.
Pechanek, The Sum-Absolute-Difference Motion Estimation
Accelerator, Euromicro Conference, Vol. 2, pp. 559-566,
1998.
- 713 -
P5-04
Formant refinement algorithm using K-means clustering

for HMM-based speech synthesis
Sunghee Jung, Sangjun Park, Keunseok Cho, Minsoo Hahn
Dept. of Electrical Engineering, KAIST, 373-1 Guseong-dong, Yuseong-gu, Daejeon, Korea
{belovedengineer, psj, kscho83, mshahn2}@kaist.ac.kr
Abstract
In this paper, a new algorithm for refining the
formants of synthesized speech is proposed. With the
formant information of semivowels and vowels stored
in the pre-generated K-means codebook, post-filtering
is applied on synthesized speech to improve its clarity
and naturalness. In a subjective test executed, the
proposed algorithm had shown better preference.
Keywords: formant refinement, HTS, speech synthesis
1. Introduction
HMM-based Speech Synthesis System (HTS) has
been widely used to generate synthesized speech.
Though it has its advantages over the traditional
corpus-based speech synthesizer, such as its
compactness and adaptability to hand-held devices, it
also has shortcomings such as over-smoothed spectra
and vocoded speech quality [1]. One of the
fundamental reasons for these limitations is that this
system is based on a probabilistic model. For many
cases, there are not enough training samples to
generate the probabilistic models differently for each
acoustic context. Consequently, the synthesized speech
hardly demonstrates the differences in formant energy
level and the speech quality becomes degraded.
Currently, smoothed formant is refined simply by
multiplying a constant to the spectral feature, Melgeneralized cepstral coefficient (MGC) at once. This
algorithm does not reflect the smoothing tendency of
each phone. Therefore in this paper, it is proposed to
apply the post-filtering in an optimal way for each
frame to model the spectral shape closer to that of
human voice and improve its naturalness and clarity.
2. Formant refinement algorithm
The post-filtering was applied upon frames of

semivowels and vowels which are significantly
affected by formant information [2]. To begin with,
formant information is extracted from the training data
and synthesized speech to generate the codebook and
match proper codeword for each synthesized speech
frame. The extracted formant information for
generating the codebooks are bandwidths, locations
and energy ratio of all formant peaks normalized with
the energy of the first peak. The ratio of the energy is
utilized instead of the energy itself, since the energies
of the formant peaks fluctuate frame by frame but the
ratio is considered to be subsistent feature of each
spectral shape. The K-means algorithm is adopted for
the codebook generation because of its low complexity.
After the codebooks are generated, Euclidean distance
between the formant features of each frame and all the
codewords of corresponding monophone are calculated
to select the codeword of the minimum distance. For
calculating the Euclidean distance, only 3 main
formant peaks are considered since other formants of
smaller energies, if any, are hard to detect from the
synthesized speech due to the smoothing effect during
the model training phase aforementioned.
After matching codewords are found for each
synthesized speech frame, the next step is to generate a
filter with the information from the codeword. In this
paper, the Bartlett window is applied as,
wi ( f )

f fi bi
rt 1
bi

, for f d bi
, otherwise
(1)
where i is the index for the formant peaks ranging

from 1 to 3, bi is the bandwidth of each formant peak
which is 3dB point of the formant peak energy by
definition, and rt is the energy ratio of the first peak of
- 714 -
ICEIC 2015
the matched codeword to the corresponding speech
frame t . rt does not vary for each of the three
formant in a codeword, since it is assumed that the
ratio between the formant peak energy is subsistent for
each codeword and need to be preserved. rt affects
In this paper, an algorithm for refining the formants

of the synthesized speech by applying codebook-based
post-processing is proposed. It resulted in enunciated
effects on otherwise smoothed speech frames.
60%
greatly on the energy of the frame and thus

discontinuity in rt makes the synthesized speech
50%
40%
sound unnatural. Therefore it is important to choose

proper rt to avoid discontinuity among frames and
30%
still reflect the unique formant energy level of that

frame. For this reason, rt of the maximum value
20%
10%
among neighboring frames of same monophone is

chosen as
rt
max
t s d t d te
pc(1)
t
ps(1)
0%
Proposed
Conventional
No preference
Figure 1. Preference test results
for ts d t d te
(2)
where t s and te are the starting and the end frame

index of a certain monophone, respectively.
pc(1)t and
ps(1)t are the energy of the first formant peak from

matched codebook and from the synthesized speech
frame, respectively.
Figure 2. Spectral shapes before and after applying

the proposed post-filtering algorithm
Acknowledgement
To evaluate the proposed algorithm, preference test

between the synthesized speech post-filtered by the
proposed algorithm and by the conventional HTS postfiltering algorithm was carried out. 1132 sentences
from the CMU ARCTIC database [3] were used for
training the speech synthesizer and 40 of them were
used to train the codebook of the proposed algorithm.
10 sentences among them were randomly chosen as
test sentences. Subject group were composed of 20
male and female listeners. Figure 1 shows the result of
the preference test. 52.5% of the subjects have
preferred the post-filtering algorithm of proposed
method. Figure 2 shows the spectral shapes of a speech
frame, before and after the proposed post-filtering is
applied. Refined formant peaks have been proved to
give clear and enunciated effect to the synthesized
speech. This effect is more frequently observed on
semivowels which are affected by formant degradation
the most in the course of HMM-based speech synthesis
procedure [2].

Education(NRF-2012009563).
References
[1] Kim, S. J., Kim, J. J., and Hahn, M. "HMM-based
Korean speech synthesis system for hand-held
devices." Consumer Electronics, IEEE Transactions on,
52(4), pp. 1384-1390, 2006
[2] Rabiner, Lawrence R., and Ronald W. Schafer.
"Digital processing of speech signals" Prentice Hall,

Inc, pp. 49-50, 1978
[3] Kominek, John, and Alan W. Black. "The CMU
Arctic speech databases." Fifth ISCA Workshop on
Speech Synthesis, 2004.
4. Conclusion
- 715 -
P5-05
Robust Audio Fingerprint Generation Based on Local Peak-Pairs

Hye-Seung Cho, Qingfu Han, Hyoung-Gook Kim
Kwangwoon University, Republic of Korea
{hye_seung401, qingfu33, hkim}@kw.ac.kr
used.
Abstract
This paper proposes a high-performance audio
fingerprinting system based on local peak-pairs in noisy
real-world applications. In the proposed method, audio
fingerprints are generated using the local peak-pairs of a
modulated complex lapped transformed spectrogram.
Experimental results confirm that the proposed method is
quite robust in different noise conditions and achieves
preliminary promising accuracy results.
Keywords: audio fingerprinting, local peak-pair,
modulated complex lapped transform.
1. Introduction
Audio fingerprinting techniques aim to identify short,
unlabeled audio clips in a fast and reliable way [1].
Various methods [1] have been proposed to satisfy the
several practical requirements for a successful audio
fingerprinting system. Among the various algorithms, the
system developed by Wang [2] has become a commercially
successful and widespread.
In this paper, based on the idea of Wangs method, an
effective audio fingerprint extraction method based on the
modulation complex lapped transform (MCLT) is proposed
to improve the robustness of the audio fingerprinting in a
real noisy environment for an audio-based content
identification system.
2. Proposed audio fingerprint generation
For our experiments, a database of 9,000 songs from
various genres (pop, rock, hip-hop, folk, jazz, and
classical) is used. The query sets are created by adding
various types of noise (babble noise, moving car noise,
white noise, street noise, and computer fan noise) from
clean to signal-to-noise (SNR) ratios 10 dB, 5 dB and 0 dB.
Table 1 shows the identification performance of the
proposed method for when the query length was changed.
The proposed scheme shows satisfactory performance with
4 and 5-second-long queries, showing the identification
rates above 90%.
Table 1: Performance evaluation
Averaged
identification
rate (%)
2 sec
Query length
3 sec 4 sec
5 sec
68.6
87.3
93.5
90.9
Acknowledgement
This research was supported by Basic Science Research
Program through the National Research Foundation of
Korea(NRF) funded by the Ministry of Education, Science
and Technology(NRF-2013R1A1A2007601)
References
The proposed method has three advantages: (1) MCLTbased spectral peaks are estimated and provided to
preserve the majority of the sound's peaks more
effectively than Fourier transform-based spectral peaks.
(2) Using emphasis filtering, the spectral peaks in the
high-frequency bin are enhanced for generating robust
peak pairs against attenuation distortions. (3) To obtain
salient peak pairs against different types of noise and at
different distances from the audio source, a dynamic
peak-picking threshold based on linear interpolation was
[1] V. Chandrasekhar, M. Sharifi, and D. A. Ross, Survey

and evaluation of audio fingerprinting schemes for mobile
query-by-example applications, 12th Int. Conf. Music
Information Retrieval, pp. 801-806, Oct 2011.
[2] A. Wang, An industrial strength audio search
algorithm, 4th Int. Conf. Music Information Retrieval, pp.
7-13, Oct 2003.
- 716 -
P5-06
Restricted Intra Block Copy Search for Fast Encoding of HEVC Screen
Content Coding
Jonghyun Ma, Xiangjian Wu, Youngwoong Kim, and Donggyu Sim
Kwangwoon University
mday519@kw.ac.kr, xjw0118@kw.ac.kr, mipjji@kw.ac.kr, dgsim@kw.ac.kr
Abstract
This paper proposes a fast Intra block copy (IBC)
search algorithm for fast encoding of high efficiency
video coding (HEVC) screen content coding (SCC). In
the proposed algorithm, one of block vector predictors
(BVP) is employed as an initial search point for early
termination of IBC block vector (BV) search. BV search
is firstly performed at the initial search point and if the
SAD value is less than a threshold, IBC BV search is
early terminated. Experimental results on SCM-2.0
show that the proposed algorithm reduces 14.65% of
IBC BV search time on average while the average BDrate loss is 0.30% under AI coding configuration of
HEVC SCC common test conditions.
(BVD) of the difference value between BV and BVP is

coded by the 3rd exponential golomb coding method.
IBC coding gives a lot of bitrate savings up to 44%
for some of screen content sequences, however; it also
increases the encoding time. The prospective primary
markets of HEVC SCC are desktop sharing, video
conferencing, and remote education in real time; thus,
fast algorithm for IBC is inevitable.
Keywords: HEVC; SCC; IBC; IBC search; fast

encoding
1. Introduction
Figure 1. An example of IBC.
The demand of screen contents is increasing in

various commercial markets since computer graphics
techniques and digital contents production tools have
been developing. The characteristics of screen contents
are different from natural videos; thus, conventional
encoders including the recent version of high efficiency
video coding (HEVC) cannot encode screen contents
efficiently [1]. In this regard, the study for screen
content coding (SCC) is now in progress as the
standardization of HEVC SCC, and intra block copy
(IBC) is one of the key techniques of SCC [2].
IBC is a block matching technique that generates
prediction values in a current frame using a block vector
(BV), and an example of IBC is as shown in Figure 1.
After finding a matched block, block vector prediction
method is performed to reduce BV information before
signaling it to the decoder side. Two block vector
predictors (BVP) are constructed for block vector
prediction method. Lastly, the block vector difference
This paper is organized as follows. Section II briefly

presents conventional IBC fast tools, Section III
describes the proposed algorithms. Experimental results
are given in Section IV, and the conclusion is given in
Section V.
2. Fast IBC methods

There are some conventional fast encoding methods
for Intra BC such as coding unit (CU) size restriction, 1D search, hash search, and early termination method [3].
CU size restriction is employed in IBC mode decision at
1616 and 88 CUs based on the result that IBC coding
performance is not efficient at larger CUs. 1-D search
method finds the matched block in the horizontal and
vertical directions for 1616 CU. Hash search method
is employed for 88 CU with 2N2N partition mode,
and it finds the matched block in the list of hash entries.
- 717 -
ICEIC 2015
Lastly, early termination method skips the IBC mode
based on the cost of the Intra coding mode. Although all
these methods are embedded in the current SCC
reference model (SCM) 2, the encoding time is still high.
Thus, to reduce the encoding time of Intra BC, the
following algorithm is proposed in this paper.
position. If SAD value is less than a threshold which is

empirically defined, the BVP is selected as a BV. If the
SAD value is bigger than the threshold, the conventional
search method is used. In this way, the proposed
algorithm reduces the computational complexity with
negligible coding loss.
3. Proposed algorithm
In the proposed algorithm, one of BVPs is employed

as an initial search point based on the statistical
experimental results. Table 1 shows zero BVD ratio of
three sequences on all-intra (AI) coding configuration,
which IBC mode is frequently employed [4]. As shown
in Table 1, zero BVD ratio is 53.19% on average, and it
means that the matched block is selected more than a
half rate at the position of BVP. In this regard, the
proposed algorithm sets one of BVPs as an initial search
point for early termination.
The proposed algorithm was evaluated with three

sequences: sc_flyingGraphics, sc_desktop, and
sc_console on SCM-2.0 AI coding configuration under
the HEVC SCC common test conditions [5]. Windows
7 (64-bits) OS over 3.30GHz quad core with 16GB
RAM is used for evaluating the proposed algorithm, and
Table 2 shows the experiment results of the proposed
algorithm compared to those of the reference software
SCM-2.0. BDR is BD rates and TS means that the time
saving of BV search time. As shown in Table 2, the
average time saving is 14.65% while the BDR is 0.30%
on average.
Table 1: The proportion of zero BVD

Sequence
sc_flyingGraphics
sc_desktop
sc_console
Average
Zero BVD ratio

55.91%
53.22%
50.44%
53.19%
Table 2: BD rates and time saving of the proposed

algorithm
Sequence
sc_flyingGraphics
sc_desktop
sc_console
Average
BDR(%)
0.46
0.24
0.20
0.30
TS(%)
12.90%
14.20%
16.84%
14.65%
5. Conclusions
In this paper, the fast IBC search method is proposed
to reduce encoding time of SCM encoder. In the
proposed algorithm, one of BVPs is selected as an initial
search point for fast IBC BV search. The experimental
results show that the IBC BV search time saving is 14.65%
on average with the average BD rate loss of 0.30%.
Acknowledgement
Figure 2. IBC BV search block diagram of the

proposed algorithm.
Figure 2 shows the flowchart of the proposed
algorithm. The white blocks are part of the conventional
method and the gray blocks are added for the proposed
algorithm. At first, BVPs are constructed and select one
of BVPs based on the SAD value between the current
original block and the reconstructed block at the BVP

Science,
ICT
&
Future
Planning
(NRF2014R1A2A1A11052210)
References
[1] High Efficiency Video Coding, Rec. ITU-T H.265
and ISO/IEC 23008-2, Jan 2013.
[2] Rajan Joshi, and Jizheng Xu, "High Efficiency
Video Coding (HEVC) Screen Content Coding: Draft 1",
- 718 -
ICEIC 2015
JCTVC-R1005, 18th JCT-VC meeting, Sapporo, June
2014.
[3] Rajan Joshi, Jizheng Xu, Robert Cohen, Shan Liu,
Zhan Ma, and Yan Ye, "Screen content coding test
model 2 (SCM 2)", JCTVC-R1014, 18th JCT-VC
meeting, Sapporo, June 2014.
[4] Jonghyun Ma, Yong-Jo Ahn, and, Donggyu Sim,
"Analysis of Intra block copy technology to improve
screen content coding", 2014 Korean Society of
Broadcast Engineers Fall Conference, Nov 2014.
[5] H. Yu, R. Cohen, K. Rapaka, and J. Xu, "Common
conditions for screen content coding tests", JCTVCR1015, 18th JCT-VC meeting, Sapporo, June 2014.
- 719 -
P5-07
Automatic Clustering of Speech Data Using MLLR Adaptation Technique

Sung Min Ban1), Bo Kyung Choi1), Ga Hui Lee1), Young Ho Choi1), Byung Ok Kang2),
Hyung Soon Kim1)
1)
Department of Electronics Engineering, Pusan National University,

Spoken Language Processing Section, Electronics and Telecommunications Research Institute (ETRI)
{bansungmin, choibok15, gahui122 , choiyh}@pusan.ac.kr, bokang@etri.re.kr, kimhs@pusan.ac.kr
2)
Abstract
This paper proposes a method that automatically
clusters speech data according to the similar
environmental extralinguistic characteristics for
speech recognition. Inspired by the Google's clustering
method that uses the Kullback-Leibler (KL) divergence
measure between the adapted Gaussian mixture
weights, Euclidean distance measure between the
adapted Gaussian means is used in proposed
clustering process. Our experimental results show that
the proposed method performs slightly better than the
Google's clustering method.
Keywords: Clustering, speech recognition, adaptation.
1. Introduction
The performance of speech recognition system is
degraded by the mismatch between the acoustic
conditions of the training and the testing environments.
Sources of this mismatch include additive noise,
channel distortion, speaker characteristics and speaking
style. To alleviate this problem, many techniques have
been proposed such as speech enhancement,
dereverberation, model adaptation, and so on. These
techniques are partially effective in a limited task but
not in all the applications.
In this regard, enough amount of speech database
can be an alternative solution to relieve this mismatch.
Generally, the more speech database is available, the
better speech recognition performs, but the
performance converges to a certain level. If speech
database is clustered according to a similar acoustic
characteristics and then multiple acoustic models are
trained, the performance of speech recognition can be
further improved by selecting the optimal acoustic
model for test utterance. Previous studies on this issue
are classified into two approaches: supervised and
unsupervised clustering. We focus on the unsupervised
automatic clustering approach without any information
about the recording environment. As researches in this

category, Google proposed a clustering method using
KL divergence between the Gaussian mixture weights
[1], and Microsoft proposed a method using i-vector
[2]. In this paper, employing the conventional model
adaptation technique, a simple clustering algorithm is
proposed.
2. Googles clustering method

Google proposed vector quantization (VQ) based
automatic clustering algorithm using KL divergence as
distance
measure.
Because
speech
contains
extralinguistic information as well as linguistic
information, Googles clustering method consider the
KL divergence between probability distributions of the
same context model in speech data. KL divergence is
approximated as follows:
M
D( pUs | psC ) wUs ,m log

m1
wUs ,m
wsC,m
(1)
where p Us and p sC are the s th Gaussian mixture model

(GMM) distributions adapted using the input utterance
and cluster data, respectively. For computational
efficiency, only weight parameters of acoustic model is
adapted, and KL divergence is obtained using the
weight distributions. wUs ,m and wsC,m are adapted weights
of the m th mixture component in the s th GMM. The
weight parameters are obtained using the expectationmaximization (EM) algorithm as
1 K w g (u )
(2)
wUs ,m Ms ,m s ,m s ,k
K k 1 ws ,l g s ,l (u s ,k )
l 1
where ws ,m is weight of m th mixture component in the
s th GMM and u s,k is the k th feature vector in K

observation vectors belonging to the s th GMM
observed in input utterance. g s ,m (u s ,k ) represents the
probability of observing u s,k in the m th mixture
- 720 -
ICEIC 2015
component of the s th GMM. Total KL divergence
DTotal ( pU | p C ) is determined by averaging the KL
100
divergences between the commonly observed GMMs in

both input utterance and cluster data.
Proposed clustering
Google's clustering
Multi condition
Clean condition
Word recognition rate (%)
95
3. MLLR based clustering

Maximum likelihood linear regression (MLLR) is
most popular speaker adaptation technique because it
can adapt all the parameters of acoustic model with
small amount of adaptation data [3]. Adapted mean
vector is estimated as
(3)
s W s
90
85
80
75
20 dB
15 dB
10 dB
5dB
SNR
where W is a transformation matrix to adapt original

mean vector s to s . s [1, Ts ]T is the extended
Fig. 1. Average speech recognition rate (%) over

various noisy condition according to SNR
mean vector of the s th GMM. The optimal W is

estimated by maximizing the predefined likelihood of
the observed vector.
In this paper, the adapted mean vectors are used for
automatic clustering, which can be carried out
independently of the linguistic information contained
in speech. As feature vector for automatic clustering,
supervector k is made of concatenating all the
adapted mean vectors as
T
T
T
(4)
k [1k , , ks , , kS ]T
recognition task and the 39-dimensional MFCC vectors

are used as feature vector. The proposed method is
compared with Googles clustering method using 7
clusters. In Fig. 1, averaged speech recognition rates
over all noise conditions are shown according to SNR.
Both the proposed method and Googles method
perform better than multi-condition trained model with
error rate reduction of 9.45% and 6.71%, respectively,
and the proposed method performs slightly better than
Googles clustering method.
where ks is the adapted mean vector for s th phoneme

using k th input utterance. S is the total number of all
phonemes included in the acoustic model. Using the
Euclidian distance between the supervectors of input
utterance and centroid of cluster data, VQ is performed.
If speech database is clustered according to a similar
acoustic characteristics and then multiple acoustic
models corresponding to the clusters are trained, the
optimal acoustic model is determined by the maximum
likelihood criterion as
(5)
arg max P(O | i )
5. Conclusion
In this paper, MLLR based clustering algorithm is
proposed considering both the speaker and the
environment information. Proposed method is carried
out without any information about the data acquisition.
The experimental results show that proposed clustering
method performs slightly better than Googles
clustering method.
Acknowledgement
where O is the observed feature vectors from test

utterance, i is the GMM distribution for i th cluster.
This work was supported by the ETRI R&D

Program of MSIP(Ministry of Science, ICT and Future
Planning), Korea [11921-03001, Development of
Beyond Smart TV Technology].
References
To evaluate the proposed clustering algorithm in this

paper, simulation DB is created by adding various
noise to clean speech at different SNR. As training and
test DB, phonetically balanced sentences DB and
phonetically balanced words DB are used, respectively.
Noise data is obtained from those included in Aurora 2
DB set. Among them, some noise types are used for
training DB, and the remainings are used for test DB.
Triphone based HMMs are used for the isolated word
[1] F. Beaufays, V. Vanhoucke, B. Strope, "Unsupervised

discovery and training of maximally dissimilar cluster
models", Proc. Interspeech, pp.66-69, 2010.
[2] Y. Zhang, J. Xu, Z.-J. Yan, Q. Huo, "An i-vector based
approach to training data clustering for improved speech
recognition", Proc. Interspeech, pp.1247-1250, 2011.
[3] C. J. Leggetter and P. C. Woodland, Maximum
likelihood linear regression for speaker adaptation of
continuous density hidden Markov models, Computer
Speech and Language, vol. 9, pp. 171-185, 1995.
- 721 -
P5-08
Weight-Based Classification of Road Surface Type Using Clustering

Hyungmin Kim*, Joongseok Song, Jong-Il Park1
Department of Electronics and Computer Engineering*, Computer Software
Hanyang University Seoul, Korea
hmkim@mr.hanyang.ac.kr*, jssong@mr.hanyang.ac.kr, jipark@ hanyang.ac.kr
Abstract
This paper proposes the classification of the road
surface which is based on weight-based clustering
algorithm using only vision sensor. The proposed
method is composed of two parts : generation of clusters
of database (DB) and classification of road type. The
clusters are generated by extracted four feature types :
peak position and frequency of fluctuation of histogram,
amount of edge, and saturation at asphalt, gravel, dirt,
and snow road surface images in DB. After generating
clusters, these are disposed into the four-dimensional
(4D) space. Then, the input road image which user want
to classify is also disposed into 4D space. The disposed
input image can be classified through the weights
calculated by using the distance between features of
input road surface image and vectors of clusters. In
experiment, we verify that the proposed method can
classify the road surface using only vision images with
about 91.25% accuracy.
Keywords: Road surface type classification.
1. Introduction
Recently, the intelligent vehicle technology using the
image processing is rapidly receiving attention as a
future technology of vehicles industry and IT
technology. Especially, the technique for classifying the
road surface type using only the image processing is one
of the important issues [1-4]. This can improve the
performance of an active safety system for drivers
comfort at paved road like highway or off-road like
gravel road and capability of autonomous vehicles. In
this paper, we propose the road surface classification
algorithm generated by weight-based clustering.
In section 2, we describe weight-based classification
of road surface type using clustering, chapter 3 shows
the experimental results. Finally, the conclusion of this
paper is described in chapter 4.
2. Road
algorithm
surface
type
classification
We assume that the road surface can be classified

according to four types (asphalt, gravel, dirt, and snow
road) [5] as shown in Fig. 1.
(a)
(b)
(c)
(d)
Fig. 1. Road surface type images. (a) asphalt road, (b)
gravel road, (c) dirt road, (d) snow road.
First of all, the clusters are composed of the peak
position and distribution of histogram, amount of edge
in image, and saturation feature. These are extracted
from database (DB) images which include asphalt,
gravel, dirt and snow road images. Then, the features of
an input image are extracted in each road type. Finally,
weights are calculated by distances between features of
input image and features of DB images.
As a result, the surface road type of input image is
determined by cluster with highest value among the
calculated weights. Figure 2 shows the overall flow of
proposed method.
2.1 Road surface type classification by

feature analysis
- 722 -
ICEIC 2015
Fig. 2. Overall flow of the proposed method.

Analysis of the road surface image data is as follows.
Saturation value of asphalt and snow road image are
higher than the other road type images. Also,
distribution of histogram at snow road image is heavy
fluctuating. Then, gravel road image has a lot of edge
and snow road image has a lot of white pixels.
We perform the following four operations to extract
the features of road surface images. First, we extract
edge image by using a canny edge detector [6] to obtain
the amount of edge which is extracted from histogram
of edge image. We find such that
=0 () = ,
Fig. 4. Analysis of fluctuation of histogram.

Frequency of fluctuation of histogram is extracted
by Eq. 2.
= =1 (),
(1)
where is histogram of edge image and is the

total number of pixels of image. It is used as an edge
feature. Figure 3 shows how to obtain the amount of
edge from an image.
(2)
where is scan line, is the number of scan line, and

count is function to count the number of frequency of
fluctuation.
Third, the index position of the peak of the
histogram is determined by Eq. 3.
= max(()), (0 < 256),
(3)
where is a histogram of image. Fourth, to analyze

the saturation component, RGB color space is converted
into HSV color space. The saturation value () at
position is extracted calculated by
3
() = 1 (()+()+()) [((), (), ())],

Fig. 3. Edge histogram of road surface image and
analysis amount of edge.
Second, the frequency of fluctuation of histogram is
calculated by horizontal scan line in histogram. As
shown in Fig. 4, the scan line can detect the points
located at high gradient position. The points are used for
estimating the frequency of fluctuating of histogram. To
reducing the influence of noise in classification, if the
distance between detected the points is lower than
threshold distance , those points are not counted.
(4)
Where , , are pixel values of each Red, Blue, Green
channel. The average of saturation value is
obtained by
1
= =0 (),
(5)
These features are normalized between 0 and 1 values.

Normalized results are reformed to vector type data V.
The vectors are disposed in 4D space which is composed
- 723 -
ICEIC 2015
of four axes. Each axis means four type features,
respectively.
2.2 Weighted based classification of road

surface type using the clustering
After disposition of features of database, the input road
image is also converted into features by section 2.1.
Then, this is also disposed to the same space as vector.
As shown in Fig. 5, the weights are calculated by using
distance ratio of three kinds of weights and the number
of supporting vectors. Each weight is calculated as
follows.
Suppose the supporting vectors used in the proposed
method are included in a range R. These vectors are
named as neighbor vectors where is an index of a
cluster.
The road type of input image is estimated to the type

of cluster which has the largest value among
final weights as shown in Eq. 10.
= max ().
(10)
3. Experiments and results

In this experiment, we used the DB which contains 320
road surface images, including four types image (asphalt,
gravel, dirt, snow). These are obtained from the internet.
The number of scan line is set to 10. Threshold of
fluctuation of histogram is set to 5, and threshold of
edge amount is set to 0.9. R is a volume which
has the 10 vectors close to . Figure 6 shows analysis
results of the road surface images data.
Red box in the Fig. 6 shows the typical properties of
four type features in DB. Gravel road image has a high
edge amount. Dirt and snow road image has a high value
of saturation and a frequency of fluctuation, respectively.
The classification accuracy is shown in Table 1.
Table 1: Accuracy of road surface classification
Asphalt
Gravel
Dirt
Snow
Fig. 5. Calculating weight between and vectors.

is a distance of between and center of
cluster . It is calculated by Eq. 6.
= ( )2
(6)
is a distance of between and . It is

calculated by Eq. 7.
= ( )2
(7)
is a distance of between and . It is

calculated by Eq. 8.
= (
)2
(8)
is the number of . The final weights () of

each cluster are determined by a combination of weights
calculated by the above formulas as shown in Eq. 9.
() =
Classified road surface

Asphalt Gravel
Dirt
95%
5%
5%
5%
90%
0%
0%
0%
95%
0%
5%
0%
Snow
0%
15%
0%
85%
The accuracies of asphalt, gravel, dirt and snow are

95%, 90%, 95%, and 85%, respectively. In experimental
results, the proposed method shows about 91.25%
accuracy on average. An error of classification was
occurred by uncommon cases in DB, including marred
asphalt, dirt roads containing small stones, and polluted
snow roads. Furthermore, we verified that the accuracy
could be influenced by quality of DB.
4. Conclusion
In this paper, we proposed a method of weight-based
classification of road surface type using the clustering.
The proposed method can be separated to two parts,
generating of clusters of DB, and classification of road
type. The clusters are generated by four feature types,
(9)
- 724 -
ICEIC 2015
CITRC (Convergence Information Technology
Research Center) support program (NIPA-2014-H040114-1001) supervised by the NIPA (National IT Industry
Promotion Agency)
References
[1] Ionut Gheorghe, Weidong Li, Thomas Popham,
Anna Gaszczak, Keith J. Burnham, Key Learning
Features as Means for Terrain Classification,
Advances in Intelligent Systems and Computing
Volume 240, pp. 273-282, 2014.
[2] Shifeng Wang, Sarath Kodagoda, Ravindra
Ranasinghe, Road Terrain Type Classification
based on Laser Measurement System Data,
Proceedings of Australasian Conference on
Robotics and Automation, 2012.
[3] Raj, A., et al., Vision based road surface detection
for automotive systems, Applied Electronics (AE),
International Conference on. IEEE, 2012.
[4] Angelova, Anelia, et al., Fast terrain classification
using variable-length representation for autonomous
navigation, CVPR'07. IEEE Conference on. IEEE,
2007.
[5] Yang, Hun-Jun, et al., Classification Algorithm for
Road Surface Condition, IJCSNS 14.1, 2014.
[6] Canny, John., A computational approach to edge
detection, Pattern Analysis and Machine
Intelligence, IEEE Transactions on 6, pp. 679-698,
1986.
(a)
(b)
(c)
(d)
Fig. 6. Analysis result of road surface type images. (a)
road surface images, (b) histogram of road surface image,
(c) histogram of edge image (d) saturation of road surface
image.
the classification of a road type is determined by the
weights calculated by distance ratio between an input
image and DB features in 4D space.
In experiments, we confirmed that the proposed
method has the accuracy about 91.25% on average.
However, the proposed method is only available for day
time since no DB used in experiment includes the road
image at night time. In near future, we are planning to
implement the practical DB which is available for daynight time.
Acknowledgment
Science, ICT & Future Planning), Korea, under the
- 725 -
P5-09
A Contrast Enhancement Algorithm Using Adaptive Threshold in Infrared

Image Environment
Sun-Mi Oh, Joongseok Song, Jong-Il Park
CSE, Hanyang University, Korea
{yessunmi,jssong,jipark}@hanyang.ac.kr
Abstract
In an imaging display device, there are two main
methods for contrast enhancement; Histogram
Equalization (HE) and Plateau Equalization (PE). The
HE method can cause color distortion and distortion
on moving objects because of the excessive brightness
enhancement. Due to this side effect, the PE method is
usually used for an infrared imaging system where
luminance histogram has been distributed in a specific
narrow region. The PE method uses a threshold and
the best value of threshold is usually determined
statically based on the experiment. However, it is
difficult to find the best value of the threshold since the
value should be constantly recalculated every new
video sequence. In this paper, therefore, we propose a
contrast enhancement algorithm using adaptive
threshold in an infrared imaging system. The proposed
method is based on the HE algorithm with a dynamic
search algorithm and uses an adaptive threshold value
according to an input video sequence. In order to
evaluate our method, we implemented a real test-bed
environment. The experiment results show that the
proposed method provides better image naturalness
and improves the overall contrast compared to the
conventional method in an infrared imaging system.
Keywords: Adaptive Threshold, Contrast
Enhancement, Infrared Image.
1. Introduction
The infrared image is usually used to track object or
heat. Since the luminance histogram of the infrared
image has been distributed in a specific narrow region,
it is necessary to enhance contrast in the infrared image.
One of the most common way to enhance contrast is a
Histogram Equalization (HE) method. The HE method
enhances overall image contrast by equalizing the
histogram of the image and increasing the dynamic
range corresponding to the image. This HE method is

simple and effective, but it can cause color distortion
and distortion on moving objects because of the
excessive brightness enhancement. To overcome this
limitation, a dynamic range separate histogram
equalization [1] has been proposed where it separates
the dynamic range of the histograms into some subhistograms and redistributes the pixel intensities based
on its area ratio. This method can suppress an
excessive luminance change, but it can cause excessive
compression on the dynamic range of the original
image when the area ratio of separate dynamic range is
concentrated in a specific area ratio. Due to the
excessive compression, it can decrease the bit
resolution of the image. Plateau Equalization (PE) [2]
has been proposed to solve above excessive
compression.
The PE method uses a threshold to prevent from the
excessive compression. Actually, the result of the
image enhancement is totally dependent on the
threshold in the PE method. Since the real world image
of the infrared system keeps change every time, it can
reduce the effect of contrast enhancement and cause
unnatural image if a static threshold value is always
used. Therefore, in this paper, we propose a contrast
enhancement algorithm using adaptive threshold in an
infrared imaging system. The proposed method is
based on the HE algorithm with a dynamic search
algorithm and uses an adaptive threshold value
according to an input video sequence.
This paper is organized as follows. We describe the
Plateau Equalization method and our proposed
approach in Section 2. In Section 3, experimental
results of comparison between conventional approach
and the proposed approach are given. The conclusion is
given in Section 4, respectively.
2. Contrast Enhancement Algorithm Using

Adaptive Threshold
- 726 -
SDR1
SDR2
SDR3
SDR4
Levels
(a) 1st iteration
2nd Iteration
SDR1
SDR2
3rd Iteration
SDR3
SDR4
SDR1
SDR2
SDR3
Levels
Frequencies
1st Iteration
Frequencies
Frequencies
ICEIC 2015
SDR4
Histogram Thresholding
SDR1
SDR2
SDR3
SDR4
Levels
Levels
(b) 2nd iteration

(c) 3 rd iteration
(d) histogram threshold
Fig. 1. Iteration method for setting up a threshold value of histogram
The conventional dynamic range separate histogram

equalization (DRSHE) has a static threshold for a
correcting factor and it can suppress dynamic range so
that it reduce the bit resolution of an infrared image. In
order to remedy this problem, we propose a contrast
enhancement algorithm using adaptive threshold in an
infrared imaging system. The proposed method is
based on the HE algorithm with a dynamic search
algorithm and uses an adaptive threshold value
according to an input video sequence of infrared
imaging system.
To extract an adaptive threshold for a dynamic
range separate histogram, we evaluate lots of different
types of video sequence in a real test-bed environment.
We implemented an infrared imaging camera with a
VGA (640x480) resolution based on the DM6446 of TI
DSP and conducted day and night experiment in indoor
and outdoor environments. During the experiment, we
conclude that 3 times iteration for extracting an average
threshold value is suitable for the 16-bit input video
sequence. The iteration method is explained as below.
In the first stage, the average histogram of the overall
image is configured as a first threshold value as shown
in Fig. 1(a). Based on the first threshold, the frequency
number of the histogram higher than the threshold
value are selected and averaged at the second stage as
shown in Fig. 1(b). This procedure is repeated 3 times
as shown in Fig. 1(c) and then a histogram finally
obtained by cutting off the histogram where the
frequency number of a histogram is under the average
threshold value calculated from the above 3 times
SSD 1
SSD 2
SSD 3
SSD 4
SDR1
SDR 2
SDR 3
SDR 4
ARSD1
RSDR1
ARSD 2
RSDR 2
ARSD 3
RSDR 3
ARSD4
RSDR 4
Fig. 2. Setting up a dynamic threshold value

procedure in Fig. 1(d).
As shown in Fig. 1(d), the overall sum of the subdynamic range (SDR) area is less than 1 because of the
continuous slicing procedure. To make the overall sum
of the SDR one, we compensate the redistributed area
ratio of SDR as shown in Eq. 1.
(1)
RSDRk means a redistributed area ratio of SDR at a

certain part k and m means overall image area of a
histogram where the value is under a threshold value.
When the overall dynamic range is normalized as one,
we configure the threshold value by sub-dividing
ARSDk according to the sub-dynamic range as shown
in Fig. 2
3. Experiment Results
In order to evaluate our proposed approach, we
implemented an infrared imaging camera with a VGA
(640x480) resolution based on the DM6446 of TI DSP.
Fig. 3 shows the overall performance evaluation among
(a) Contrast Stretching

(b) Plateau Equalization
(c) Proposed method
(d) PE vs. Proposed method
Fig. 3. Comparison between conventional approach and proposed method
- 727 -
ICEIC 2015
contrast stretching, plateau equalization, and our
proposed approach (DRSHE with adaptive threshold
value). As shown in Fig. 3(c), our proposed method
provides a better image quality compared to the other
approaches,
contrast
stretching
and
plateau
equalization as show in Fig. 3(a)-(b). We also
compared the robustness of noise between plateau
equalization and our proposed method. The right side
image of Fig. 3(d) provides better image quality
compared to the left side image since our proposed
method suppresses noise and enhances contrast by
using adaptive threshold value.
4. Conclusion
In this paper, we proposed a contrast enhancement
algorithm by using adaptive threshold in an infrared
image environment. As shown in experiment results,
our proposed method can suppress the excessive
luminance change and reduce noise in an infrared
image system compared to conventional methods. It
results in getting a clear infrared image and enhancing
the image contrast definitely due to the adaptive
threshold value. Furthermore, the proposed method can
be applicable in a real infrared device since the
complexity of the proposed method is simple and the
threshold values is adaptive to a input video sequence.
References
[1] G.H. Park, et al., A Contrast Enhancement Method
using Dynamic Range Separate Histogram Equalization,
IEEE Trans. on Consumer Electronics, Vol. 54, No. 4, pp.
1981-1987, 2008.
[2] H.G. Cho, et al., Application of Local Histogram and
Plateau Equalization Algorithm for Contrast Enhancement of
Real Time Thermal Image, The Transactions of KIEE, Vol.
53, No. 2, p76-85, 2004.
[3] H. Yuan, et al., An Adaptive Infrared Image
Enhancement Algorithm for Enhanced Vision System,
Journal of Computational Information System, 7 (11), 40904097, 2011.
[4] C. Wang, et al., Brightness Preserving Histogram
Equalization with Maximum Entropy: A Variational
Perspective, IEEE Transactions on Consumer Electronics,
Vol. 51, No. 4, pp. 1326-1334, 2005.
[5] S. D. Chen, et al., Contrast Enhancement using
Recursive Mean-Separate Histogram Equalization for
Scalable Brightness preservation, IEEE Transactions on
Consumer Electronics, Vol. 49, No. 4, pp.1301-1309, 2003.
- 728 -
P5-10

"
!#
!#
!#
"
# !#

$
! !

!

!

%!!
&#

! !

&%!

#

!!

!
#
! !

&

!
!
!#

&

' #
$

! &
& &

! (!
)

! !!
!

!#
&

!

!"

" !#

$

$

!

$
%
$!

!'&()

!
$
!
$

$

!

$ !
$

*

#

$

!

*

+

!

*

+ #
,

!

*
-
#

(.

/
#

#

"
$ %
$

12
1!2
12

12
12
0
& 12 1!2 12

1

!

2 12

'&)12

1
!

2

% #
0
&
$

!#

!#0

*

-
$ %

$
$

!

13402 #
5"&

1&2

#
!
!
%

340 ! #
$

!#

5",

1,2

#

!

*

#
5"(

- 729 -
ICEIC 2015

1(2

-$

!

! $
-
$ #

!
%!$

76
$

## "
$
"
$

%

!

$
#

0
&12*$

#
!

#

# #
$,(8
-$
76
'/)
* !

! #
5"
/

#"

#"

#" !

!

!
1/2

#" !

0
, * $

!

("

#

$
!

!

-
# $

$
!#

$

#

!

$

5"
/
-

#
0
,

!#

!

$
#

#% #
5"/

$ !!

-$
#

- !

&'
"

*$

$
# -

3
9 46 1

5-
: 52 ';) < 3=

!
-
=

-

'8)*

'&)$

&
-0
& #
$
!#
$

'&)
?*
# ! >1>

3*@0
2
3* 313$
*
32 1A%,B&/B/B&&/&BB&2
$
! A%1A
*

%2C

'&) D+
>
7 %# 6
E

E$+(
*
!
,(.*-=,,A(%3>,BB(
',) 6+ = E5-

E

*
! /
= ,( A ( 6#
!

,BB/
'() .$ * E4
$

$E$+(
*
!,(.*-,BBF
'/)>G
H
G > 0* E%

3

3
3 3
E
*
!/
=,FA
I6#!

.,BBJ
'8) =
>
E !

E%
"

8I,&(I
&8/,BB/
';) LKK$
K
!K KK
- 730 -
P5-11
Skin color segmentation using training set partitioning and multiple elliptical
Gaussian models
Young-Ji Yoon, Oh-Yeol Kwon, and Sung-Il Chien
School of Electronics Engineering, Kyungpook National University, Daegu, Korea
yoonyj@ee.knu.ac.kr, koy0606@ee.knu.ac.kr, sichien@ee.knu.ac.kr
Abstract
A Gaussian model is one of the effective methods of
modeling a skin color. We present a method of fitting
skin color by using multiple Gaussian ellipses, each
trained on partitioned training set. An input color pixel
is approved as a skin pixel or rejected as a non-skin
pixel by the use of multiple Gaussian ellipses, each
modeling a specific range of skin color.
Keywords: Skin color segmentation, Gaussian models
1. Introduction
Much research on the skin color detection has been
published [1-3]. Cheddad [1] proposes skin color
detection using an error signal (E) derived from the
gray and RGB values. The computation speed of this
method is fast but highly-saturated non-skin colors
tend to be detected as skin colors. Wang [2] proposes
skin color detection in HSV color space which consists
of hue (H), saturation (S), and value (V). This method
relatively shows good performance but it has a
problem of detecting a yellow-greenish non-skin color
as a skin color. Chai [3] proposes the skin color
detection method based on YCbCr color space.
However, this method has a problem to detect the
similar non-skin colors as the true skin colors.
For more effective skin detection, this paper
proposes we introduce an ES feature space in which
Cheddads error signal (E) is augmented by a
saturation (S) signal. To avoid the complexity of
training the Gaussian mixture model [4], we roughly
divide the training database into three partitioned
groups according to skin color tones, applying a single
Gaussian model to each the partitioned group in ES
feature space. With three elliptical Gaussian models,
the unknown input vector is compared to three centers
of Gaussian ellipses and will be classified as skin or
non-skin colors.
2. Skin color segmentation using multiple

elliptical Gaussian models
2.1. ES feature space and single Gaussian
model
Cheddad forwarded a skin-sensitive error signal [1]
having a specific range of the skin color so that RGB
of three dimension is transformed into the error signal
(E) of one dimension. However, since E value does not
consider saturation information, high-saturated reddish
non-skin colors tend to be segmented as skin colors.
Therefore, we propose the use of ES space in which
saturation (S) is added to the existing E.
Here, we gather the sample points of skin color
pixels in ES space from 140 images for a training
process. On the condition that the number of skin color
pixels is the same for each image, so we use about
17,000 points per one image and a total of 2,380,000
skin color pixels. In this paper, the skin color pixels
are modeled by the two-dimensional Gaussian density
distribution in ES feature space, which is given by [5]
p(x) =
1
exp( 2)
2| |
2
12
2 = (x)t 1(x) .
(1)
(2)
Here, x is an input vector in ES space and is

represented by [xE , yE ]t . is mean vector which is the
center of Gaussian ellipse, and is 2 2 covariance
matrix which decides size and shape of Gaussian
ellipse. is Mahalanobis distance and a set of the
points letting be constant constitutes an ellipse in
two-dimensional space.
2.2. Multiple elliptical Gaussian models and

classification rule
- 731 -
ICEIC 2015
(a)
(b)
(c)
Figure 1: Representative images of training database. (a) normal skin color tone images (Group A), (b)
reddish skin color tone images (Group B), (c) yellow-greenish skin color tone images (Group C).
The skin colors are widely distributed on ES feature
space, because we can observe a variety of skin tones
due to the influence of the various illuminants. Here
we roughly define three types of skin tones according
to skin colors affected by illuminant colors. The skin
tones are reddish, yellow-greenish, and normal skin
tones, respectively. We divide 140 images of the
training database into three groups. Here, 60 images
with the normal skin tones belong to group A, 40
images with the reddish skin tones belong to group B,
and the remaining 40 images with yellow-greenish skin
tones belong to group C. The sample images of groups
A, B, and C are shown in Figure 1. The skin color
pixels in each group are modeled by the single
Gaussian model in ES feature space. We find that a
prediction ellipse of 90% performs best for all three
partitioned training databases. For groups A, B, and C,
the corresponding ellipses in Figure 2 are shown in
pink, red, and green colors, respectively.
When an input color vector is given, we should find
the suitable Gaussian ellipse from these elliptical
models by selecting the Gaussian ellipse with the
minimum Mahalanobis distance between the given
vector and three ellipse centers. If the given vector is
inside the ellipse, it is determined as a skin color and
otherwise it is a non-skin color. Sometimes, it is found

that a part of hair or shadow region are sometimes
detected as the skin color when the luminance (Y) is
low. Therefore, we put a simple but important
condition for skin color. When luminance is quite low,
it seems that skin detection becomes quite unstable.
Skin color detection is accepted only when luminance
larger than 0.3.
1.0
0.8
0.6
S
0.4
Skin pixels (less than 10)

Skin pixels (more than 10)
90% Gaussian ellipse (Group A)
90% Gaussian ellipse (Group B)
90% Gaussian ellipse (Group C)
0.2
0.0
-0.2
-0.2
0.0
0.2
0.4
0.6
0.8
Figure 2: Overall distribution of skin color and

three Gaussian ellipses.
- 732 -
ICEIC 2015
(a)
(b)
(c)
(d)
(e)
Figure 3: Segmentation results. (a) original image, (b) Wangs method, (c) Chais method, (d) Cheddads
method, (e) proposed method.
3. Experimental results and discussion

For the evaluation purpose, we have built a test
database using 80 Asian and Caucasian skin images
which consist of 40 normal skin tone images, 20
reddish skin tone images, and 20 yellow-greenish skin
tone images. We now compare our skin color
segmentation with other methods: Wangs [2], Chais
[3], and Cheddads [1] methods.
First, we detect the skin colors of a single person in
an image and the results are shown in Figure 3, in
which the first, second, and third rows indicate normal,
reddish, and yellow-greenish skin tone images,
respectively. The performance of skin color detection
is relatively good for all methods in case of the normal
skin tone image. Wangs method has a tendency of
detecting yellow-greenish non-skin pixels as a skin
pixel. In contrast, Chais method can effectively
remove yellow-greenish non-skin pixels, but it tends to
detect highly saturated reddish colors as skin colors.
Cheddads method using a simple feature (E) cannot
reject the highly saturated reddish colors as non-skin
colors and is also weak in detecting yellow-greenish

colors. However, our proposed method can effectively
remove the highly saturated reddish color pixels due to
the saturation feature added and successfully detect the
yellow-greenish skin. Secondly, we include the skin
segmentation of several people in an image in Figure 4.
It is found that skin segmentation result shows similar
tendency with respect to a single person in a picture.
An accuracy rate [6] is a percentage rate indicating
how much skin and non-skin pixels are segmented
correctly. Table 1 shows accuracy rates of skin color
segmentation results for the testing images and shows
that the proposed method performs best.
4. Conclusion
For a data set of testing 80 images with three
different skin color tones, our method shows the
highest accuracy rate (92.66%). The experimental
results show that our proposed method with more
subtle decision boundary is improved more than 2% in
the accuracy rate compared to other methods tested.
- 733 -
ICEIC 2015
(a)
(b)
(c)
(d)
(e)
Figure 4: Segmentation result of several people. (a) original image, (b) Wangs method, (c) Chais method,
(d) Cheddads method, (e) proposed method.
[3] D. Chai and K. N. Ngan. Face segmentation using
skin-color map in videophone applications, IEEE
Transactions on Circuits and Systems for Video
Technology, vol. 9, no. 4, pp. 551-564, 1999.
Table 1: Accuracy rates for testing images

Wangs method
Chais method
Cheddad method
Proposed method
Accuracy rate (%)

90.48
88.18
84.03
92.66
Our proposed method especially show good

performance on detecting reddish and yellow-greenish
skin color tones.
References
[1] A. Cheddad, J. Condell, K. Curran, and P. M.
Kevitt. A skin tone detection algorithm for an
adaptive approach to steganography, Signal
Processing, vol. 89, no. 1, pp. 2465-2478, 2009.
[2] Y. Wang and B. Yuan. A novel approach for
human face detection from color images under
complex background, Pattern Recognition, vol.
34, no. 10, pp. 1983-1002, 2001.
[4] R. Hassanpour, A. Shahbaharami, and S. Wong,

Adaptive Gaussian mixture model for skin color
segmentation. In Proceedings of the World
Academy of Science, Engineering and Technology,
2008.
[5] S. J. Kang, O. Y. Kwon, and S. I. Chien. Preferred
skin color reproduction based on Y-dependent
Gaussian modeling of skin color, Journal of
Imaging Science and Technology, vol. 55, no. 4,
pp. 40504-1-40504-7, 2011.
[6] A. Conci, E. Nunes, J. J. Pantrigo, and A. Sanchez.
Comparing color and texture based algorithms
for human skin detection. In Proceedings of the
Tenth International Conference on Enterprise
Information Systems, pp. 168-173, 2008.
- 734 -
P5-12
Color Filter Array Interpolation using Guided Filter

Yonghoon Kim*, Dokyung Lee, Ung Hwang, and Jechang Jeong**
Department of Electronic and Computer Engineering, Hanyang University
charismakyh@gmail.com*
jjeong@hanyang.ac.kr**
Abstract
Most digital cameras exploit color filter array to
reduce the cost. The cameras capture only one of the
three color channels at each pixel position. To
interpolate missing pixel, many algorithms have been
proposed over the years. In this paper, we proposed
color filter array interpolation algorithm using guided
filter. The residual is difference between and originally
captured data and a tentatively estimated value, and
we estimate target pixel value of four directions by
using neighboring residual values. The directional
estimates are combined using the directional weight
based on inverse gradients. Experiment results show
the proposed demosaicking algorithm gives the best
performance in terms of both objective and subjective
quality compared with state-of-the-art demosaicking
algorithms.
Keywords: demosaicking, color filter array (CFA)
interpolation, residual interpolation.
1. Introduction
Single sensor digital cameras capture images with a
color filter array (CFA), and the most common CFA
pattern is the Bayer pattern shown in Fig. 1 [1]. For
each pixel position, only one color information of the
three color channels, red (R), green (G), and blue (B),
is captured. The color channels filtered out by the CFA
pattern need to be reconstructed exploiting the
originally captured color channels. The process of
generating a full three color image from a filtered
single channel input is called demosaicing or CFA
interpolation [2, 3].
Most of Bayer demosaicking algorithms first
interpolate G pixel values since G channel has the
double sampling rate compared with R and B pixels.
Most of the demosaicking algorithm exploits the color
differences between G and R or G and B. These color
difference information utilized in gradient calculation
j-2
j-1
j+1
j+2
i-2
i-1
i+1
i+2
j-2
j-1
j+1
j+2
i-2
i-1
i+1
i+2
(a)
(b)
Fig. 1 Bayer CFA pattern.

and color difference interpolation. The reason why the
color differences are used is based on the observation
that all color bands have very similar image structures
such as textures and edges [4, 5].
In past few decades, various demosaicking
algorithms [6-10] have been. These algorithms have
tried to improve the estimation performance based on
color difference model. Paliy et al. [8] exploits
directional approach with scale adaptive filtering based
on local polynomial approximation (LPA). In [9],
Pekkucuksen et al. proposed non-directional edge
strength filter (ESF) algorithm and they also proposed
multi-scale gradient (MSG) [10] to improve the
gradient estimation accuracy. These algorithms are
tested on Kodak image set which has high color
correlation, however these image characteristic do not
match on images captured with digital camera of today
[11]. Therefore, recently proposed algorithms uses
difference image set which has low spectral correlation
and highly saturated color. In [12], voting based
directional interpolation algorithm has been proposed
and it gives fine results. There is an approach using
guided filtering techniques. In [13] and [14], the author
proposed residual interpolation based on guided filter
[15]. Using the characteristic of this filter, tentative
image is generated, and calculate the residual between
original and tentative image. Using neighboring
residual information, the target pixel value can be
estimated.
- 735 -
ICEIC 2015
In this paper, we proposed a color filter array
interpolation method which uses the guided filter. We
adopt directional interpolation to increase the
performance of the interpolation. For G plane
interpolation, we use only G value as the reference
instead of using color difference which used in RI [13]
and MLRI [14]. The background and the details of the
proposed algorithm are given in section 2. In section 3,
experimental results tested on 18 IMAX images and
compared with 5 state-of-the-art demosaicking
algorithm and section 4 concludes the paper.
Vi , j = G iV, j Gi , j .
There is an assumption that difference between

tentative G and original G is similar in the given object.
Based on the assumption, the estimated G values for
the four directions are given as follows:
W
G=
G iH, j iH, j 1 ,
i, j
(3)
E
G=
G iH, j iH, j +1 ,
i, j
G= G iV, j Vi 1, j ,
N
i, j
2.1. Proposed algorithm
S
G=
G iV, j Vi +1, j .
i, j
The proposed algorithm is based on residual

interpolation technique. The residual interpolation
strategy utilizes the difference value between tentative
estimate and original image. The tentative estimates
can be obtained using guided filter [15]. This filter is
edge-preserving filter and has lower complexity than
joint bilateral filter which is widely used in denoising
area. Using the guided filter, we generate the tentative
G plane. The guided filter exploits a local linear model
between the guidance image I and the filtering output q.
The q is considered as a linear transform of I in a
window m,n centered at the pixel m,n:
qi , j am , n I i , j + bm , n , i m , n ,
=
(2)
iH, j = G iH, j Gi , j
After the guided filtering and directional green

pixel estimation process, the estimates are combined
using four directional weights. To calculated color
difference, we use Hamilton and Adams interpolation
filter which is defined as:
and using this filter, we generate vertical and horizontal

color differences. The color differences of both
directions are given as:
(1)
DiH, j = Z i , j Z f ,
where Z is bayer plane, the suffix (i, j) represents the

target pixel position, and DH and DV denote the color
difference of horizontal and vertical direction,
respectively. We calculate the gradients for the
directional weights which are given as:
2.2. Proposed Green Channel Interpolation

The bayer pattern has low sampling rate on R and B
pixels, therefore two cases are used based on pixel
position. Fig. 1 shows two cases of pixel position. In
case of Fig.1 (a), vertically upsampled R plane is used
for generating vertical tentative G pixel, and
horizontally upsampled B plane is exploited for
generating horizontal tentative G pixel estimation. In
case of the Fig. 1(b), B plane is utilized for vertical and
R plane is used for horizontal guided filtering process.
Using the tentative G value, we can generate the
directionally estimated G value at R and B position.
The residual values between tentative G and original G
value of vertical and horizontal direction are calculated
as follows:
(5)
DiV, j = Z i , j Z f T ,
where (am , n , bm , n ) denote linear coefficients based on

assumption that coefficients are constant in the local
window m,n. In the proposed algorithm, Ii,j is replaced
by R or B and qi,j is replaced by tentative G. Using the
guided filter, we can accurately interpolate G value by
exploiting sparse data which is used as a reference.
(4)
1 1 1 1 1
=
f [ , , , , ],
4 2 2 2 4
H
=
i, j
DiH, j 1 DiH, j +1 ,
V=
i, j
DiV1, j DiV+1, j ,
(6)
where H and V represent the directional gradients

of horizontal and vertical direction, respectively. The
weights for four directions are calculated as follows:
2
i +1 j + 2
wW =1 / W mH, n ,
i 1 m =
j
m=
j
i +1
wE =1 / W mH, n ,
i 1 m =
j 2
(7)
m=
j +1
i
i + 2 j +1
wN = 1 / WVm , n , wS = 1 / WVm , n .
j 1
i m=
j 1
i2 m=
m=
m=
Finally, we blend estimated G pixel values by

exploiting the four directional weights. The
reconstruction process is given as follows:
- 736 -
ICEIC 2015
Table 1: Average CPSNR of 18 IMAX images
VDI
LDINAT
No.
LPA
RI
MLRI
26.82
28.01
29.01
29.12
28.97
28.99
33.84
34.18
35.01
35.00
35.08
34.85
32.47
32.64
32.56
33.75
33.86
33.37
34.94
36.00
35.94
37.86
37.64
37.71
31.39
32.63
34.09
33.91
33.99
34.55
34.37
35.63
37.87
38.29
38.26
38.59
39.20
36.03
35.96
36.95
37.46
36.02
37.88
37.41
37.46
36.96
36.94
37.99
35.07
35.95
36.91
35.92
36.44
37.10
10
37.02
37.28
38.72
38.15
38.62
38.69
11
37.72
37.98
39.48
39.43
39.91
39.45
12
36.97
37.09
38.89
39.61
39.64
39.73
13
39.29
39.40
40.78
40.27
40.51
40.74
14
37.54
37.32
38.67
38.92
38.76
39.20
15
37.66
37.86
38.93
38.37
38.91
38.89
16
29.48
31.40
33.52
35.17
35.09
35.27
17
29.27
31.15
32.83
32.44
32.58
33.12
18
33.96
34.23
35.00
36.52
36.12
36.49
Ave.
34.72
35.12
36.20
36.48
36.60
36.71
G ={wW (3GiW,j + Gi , j 1 ) / 4 + wE (3GiE, j + Gi , j +1 ) / 4

+ wN (3GiN, j + Gi 1, j ) / 4 + wS (3GiS, j + Gi +1, j ) / 4} / w T ,
Prop.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
Fig. 2 Visual comparison for the flower region in

the IMAX dataset, (a) original image, (b) LPA,
(c) VDI, (d) LDI-NAT, (e) RI, (f) MLRI, and (g)
proposed.
(8)
wT = wW + wE + wN + wS ,
where G denotes the estimated green pixel. We

combine the four directional estimates and originally
captured G pixel using directional weights. By
blending estimates and original pixel value, missguided estimation caused by low correlation between
the color channels can be compensated. End of this
step, G plane is fully populated.
(a)
2.3. Red and Blue Channel Interpolation

After the G image is interpolated, R and B values are
generated by exploiting the residual interpolation
method which is proposed in RI. In this stage, instead
of using directional weight strategy, bilinear
interpolation is utilized for residual interpolation.
To evaluate the performance of proposed CFA
interpolation algorithm, we compare the proposed
method with 5 state-of-the-art algorithms such as local
polynomial approximation (LPA) [9], local directional
interpolation and nonlocal adaptive thresholding (LDI-
- 737 -
(b)
(c)
(d)
(e)
(f)
(g)
Fig. 3 Visual comparison for the T-shirt region in

the IMAX dataset, (a) original image, (b) LPA,
(c) VDI, (d) LDI-NAT, (e) RI, (f) MLRI, and (g)
proposed.
ICEIC 2015
NAT) [16], voting based directional interpolation
(VDI) [12], residual interpolation (RI) [13], and
minimized-Laplacian residual interpolation (MLRI)
[14]. We use and IMAX dataset which contains 18
images with a size of 500 500 pixels. These image set
has similar color characteristic with images which are
captured in digital camera of today.
To evaluate the objective quality, table 1 presents
the average CPSNR results where CPSNR is the
average PSNR of three color planes. It can be seen that
the proposed algorithm gives the best average CPSNR
performance. It gives 0.11dB higher CPSNR than
MLRI which gives the best performance among the
reference algorithms, and 0.23dB higher than RI. LPA
gives the worst results because it is specialized in
different image characteristic.
Fig. 2 shows the visual comparison result of the
partially zoomed image. From the subjective results, it
is obvious that the proposed algorithm outperforms the
others. The proposed algorithm successfully reduces
the color artifacts at the boundary of the flowers.
Except proposed algorithm, all demosaicking
algorithms generate wrong color at the edge region.
Same results can be found in Fig. 3. At the boundary of
the object where color changes abruptly, wrongly
estimated color value in LPA, VDI, LDI-NAT, RI, and
MLRI. Only the proposed algorithm gives the clean
image. From the both objective and subject results, we
can found that proposed CFA interpolation techniques
can reduce the demosaicking artifacts effectively and
sharply interpolate the image.
4. Conclusion
This paper proposed a CFA interpolation algorithm
by exploiting guided filter. The residual data can be
calculated using guided filter output and original value.
The proposed four-direction interpolation algorithm
generates target pixels which can react more flexibly to
characteristic of neighboring pixels than two-direction
interpolation technique. The experimental results show
that the proposed algorithm gives clean edge
representation and better overall image quality. In
terms of objective quality, the proposed method shows
the best results.
Acknowledgement
of Science, ICT & Future Planning), Korea, under the
"Establishing IT Research Infrastructure Projects"
Promotion Agency)(I2221-14-1005)
References
[1] B. E. Bayer, Color imaging array, U.S. Patent 3 971
065, July 1976.
[2] B. K. Gunturk, J. Glotzbach, Y. Altunbasak, R.
W.Schafer, and R. M. Mersereau, Demosaicking:color filter
array interpolation, IEEE Signal Processing Magazine, vol.
22, pp. 44-54, 2005.
[3] X. Li, B. Gunturk, and L. Zhang, Image demosaic-ing: a
systematic survey, Proc. of SPIE, vol. 6822, pp.68221J68221J-15, 2008.
[4] J.F. Hamilton Jr and J.E. Adams Jr, Adaptive color plan
interpolation in single sensor color electronic camera, U.S.
Patent 5629734, 1976.
[5] B. K. Gunturk, Y. Altunbasak, and R. M. Mersereau,
Color plane interpolation using alternating projections,
IEEE Trans. on Image Processing, vol. 11, no. 9, pp. 9971013, 2002.
[6] Z. Dengwen, S. Xiaoliu and D. Weiming, Colour
demosaicking with directional filtering and weighting, IET
Image Process., Vol. 6, no. 8, pp. 10841092, 2012.
[7] W. Chen, P. Chang, Effective demosaicking algorithm
based on edge property for color lter arrays, Digit. Signal
Process., vol. 22, no. 1, pp. 163169, 2012.
[8] D. Paliy, V. Katkovnik, R. Bilcu, S. Alenius, and K.
Egiazarian, Spatially adaptive color filter array interpolation
for noiseless and noisy data, Int. J. Imaging Syst. Technol.,
vol. 17, no. 3, pp. 105122, 2007.
[9] I. Pekkucuksen and Y. Altunbasak. Edge strength filter
based color filter array interpolation, IEEE Trans. Image
Process., vol. 21, no. 1 pp. 393397, Jan. 2012.
[10] I. Pekkucuksen and Y. Altunbasak, Multiscale
Gradients-Based Color Filter Array Interpolation, IEEE
Trans. Image Process., vol. 22, no. 1, pp. 157165, Jan.
2013.
[11] X. Li, B. Gunturk, and L. Zhang, Image demosaicing: a
systematic survey, in Proc. of SPIE, vol. 6822, pp. 68221J,
2008.
[12] X. Chen, G. Jeon, and J. Jeong, Voting-based
directional interpolation method and its application to still
color image demosaicking, IEEE Trans. Circuits Syst. Video
Technol., vol. 24, no.2, pp. 255262, 2014.
[13] Kiku, D., Monno, Y., Tanaka, M., and Okutomi, M.,
Residual interpolation for color image demosaicking, in
Proc. of IEEE Int. Conf. on Image Processing (ICIP), pp.
23042308, 2013.
[14] Kiku, D., Monno, Y., Tanaka, M., and Okutomi, M.,
Minimized-Laplacian Residual Interpolation for Color
Image Demosaicking, in Proc. of SPIE-IS&T Electronic
Imaging, pp. 90230L90230L8, 2014.
[15] K. He, J. Sun, and X. Tang, Guided image filtering, in
Proc. of the 11th European Conf. on Computer Vision
(ECCV), vol. 6311, pp. 114, 2012.
[16] L. Zhang, X. Wu, A. Buades, and X. Li, Color
demosaicking by local directional interpolation and nonlocal
adaptive thresholding, Journal of Electronic Imaging, vol.
20, no. 2, pp. 023016023016, 2011.
- 738 -
P5-13
Analysis of Micro Doppler Detection algorithms for Human Motion Gesture

in Software Defined Radar
1)
Jung S. Jung, 2)Myeong S. Park, 1)In S. Woo, 1)Young K. Kwag

1)
Korea Aerospace University, 2) Korea Aerospace University Radar Research Institute
E-mail address: jsjung@kau.ac.kr, msp.wise@gmail.com, iswoo@kau.ac.kr, ykwag@kau.ac.kr
Abstract
Receiver
SDR is consisted by antennas, radio frequency (RF)

daughter board, Universal Software Radio Peripheral
(USRP) N210, and host PC (personal computer) as
shown figure 2. Host pc is operated based on
FPGA & DSP
ADC
Antenna RF daughter board
USRP N210
Host PC
Figure 1. Block diagram of SDR system

Table 1: Hardware specification
Subsystem
2. Software Defined Radar Architecture
FPGA
MATLAB
1. Introduction
Radar systems have been employed in military
operation because of day and night and all weather
capabilities. Radar system is designed and implemented
considering system performance, the place and weight
available on platform, and power consumption. These
needs limit that radar is applied large application on
any platform.
In order to overcome constraints, software defined
radar is presented. It is a multifunctional system, where
most of the processing, like waveform generation, up
and down conversion etc. is performed by software.
Software defined radar (SDR) gives many advantages
such as multipurpose system, re-using the hardware,
easier implementation of signal processing algorithms,
faster development and cost reduction [1].
This paper presents SDR measurements by human
gesture using software defined radars. The hardware
descriptions are presented in section II. The test
environment is discussed and the results are analyzed at
time and frequency domain in section III, Finally,
conclusions are provided in section IV.
DAC
Transmitter
This paper describes the concept of software-defined

radar and presents test results detection of micro
Doppler by moving humans using software defined
radar system. The system is consisted of antenna, RF
daughter board, USRP signal processor board, and
Host PC. The various algorithms are applied to detect
human motion and performance is analyzed.
Keywords: Software defined radar, SDR, micro
Doppler detection.
Antenna
SBX
Daughter
board
USRP
N210
Parameter
Value
Band
2.42 ~ 2.48 GHz
Gain
8.9 dBi
Beam width
83 (H)
Size (W x H)
118 x 78 mm
Frequency range
400~4400 MHz
Power Output
20 dBm
Bandwidth
40 MHz
Noise figure
5 dB
ADC sample rate
100 MS/s @ 14bit
DAC sample rate
400 MS/s @ 16bit
Host sample rate
25 MS/s @ 16bit
Interface to host
1 Gigabit Ethernet
LabVIEW environment. USRP includes 100 MS/s dual

ADC, 400 MS/s dual DAC and Gigabit Ethernet
connectivity to stream data to and from host processors.
The model of RF daughter board is SBX. It operates in
wide frequency from 400 to 4400 MHz and provides
up to 100 mW of output power, and a noise figure of 5
dB. The specifications of hardware are listed in table 1.
- 739 -
ICEIC 2015
18
16
Time (s)
14
12
10
8
6
4
2
-50
-40
-30
-20
-10
10
20
30
40
50
Frequency (Hz)
Figure 2. Hardware configuration for test
Figure 4. Spectrogram of round-trip target

(a)
18
16
Time (s)
14
12
10
8
6
4
2
-50
-40
-30
-20
-10
10
20
30
40
50
20
30
40
50
Frequency (Hz)
Figure 3. Test environment

18
3. Experiment
(b)
16
14
Time (s)
The experiment will be performed for detection of

motion signature indoor. The system is realized by sue
of LabVIEW and USRP N210.
Figure 2 presents the hardware configuration. The
transmitted and received antennas are required for
bistatic radar operation, and designed as substrate
integrated waveguide (SIW) technique. The host PC is
used to generate the CW waveform and obtain the raw
data. The waveform is transferred to signal processor,
and digital waveform is converted to analysis signal by
DAC. The analog waveform is up-converted to
operation frequency by RF daughter board, and
transmitted signal is radiated through the antenna.
The basic performance test is performed by using
the target positioning system of LabVolt as shown in
figure 3. The distance between the antennas and target
is 3 m, and target was round 20 seconds at a speed of
30 cm per second. The iron plate with a size of
20x20cm and the known RCS of 1.2 dBsm, was used in
the experiment. The spectrogram of received signal is
presented in figure 5. Since the target round-trip
movement of 30cm/s, the frequency of +/-5 Hz is
occurred during 20 second.
Figure 5 indicates a spectrogram of walking human.
The one is slow walking human and the other is fast
walking human. The maximum Doppler difference
between slow and fast walking is 7 Hz that is 0.4 m/sec.
12
10
8
6
4
2
-50
-40
-30
-20
-10
10
Frequency (Hz)
Figure 5. Spectrogram of round-trip human, (a)

slow walking case, (b) fast walking case
4. Conclusion
The software-defined radar will make it easy to
apply multipurpose and high performance systems.
This paper will present the performance test results
about detection micro Doppler of moving human. For
performance evaluation, various scenarios will be
suggested and the results are analyzed by spectrogram.
The proposed method will be considered useful in
system for classification of human signature.
5. Acknowledgement
This work was partly supported by the ICT R&D
program of MSIP/IITP. [14911-01004, SDR Radar
Sensor Platform Development]
References
[1] D. Garmatyuk, J. Schuerger, and K. Kauffman,
Multifunctional software-defined radar sensor and data
communication system, IEEE Sensors Journal, vol. 11, no.
1, pp. 99106, 2011.
- 740 -
P5-14
Scene Boundary Detection in video

Ruichen Jin, Jongweon Kim(Corresponding Author)
Sangmyung University
kimyejin0602@gmail.com, jwkim@smu.ac.kr
Abstract
For video watermarking, detecting the scene
boundaries from the video frames is the very important
measure. Several algorithms have been proposed for
detecting scene boundary and classifying scene. In this
paper, we propose the adaptive method of scene
boundary detection to combine the frame difference
method and region matching method. The method
enhance the percentage of detecting scene boundary
and overcome some weakness.
Keywords: scene boundary, video processing, video
segmentation, key frame
1. Introduction
Recently, due to the widespread use of PC as
multimedia systems, the problem of illegal distribution
has become a social issue [1-4]. Especially, the videos
are distributed without the permission of copyrighter.
Detecting the scene boundaries is an important in video
processing. The common used methods are pixel
differences and histogram. Those are Simple and the
processing is faster than other methods, like
compression differences, motion vector and some
statistical etc. A shot is a series of frames that runs for
an uninterrupted period of time. A scene is a collection
one or more adjacent shots that generally thought of as
the action in a single location and continuous time.
There are many different types of boundaries between
with shots.
Smoliar [6] implemented this method with the

additional step of using 3by3 averaging filter before the
comparison to reduce camera motion and noise effects.
Histograms are the most common method used to
detect scene boundaries. The simplest histogram
method computes gray level or color histograms of the
two images. If the bin-wise difference between the two
histograms is above a threshold, the boundary is
assumed.
Difference methods applied to difference types of
scene change has the different work efficacy. For
example the conventional pixel-based techniques can
produce missed detections and false detections when
high motion and brightness variations are present in the
video. To increase scene change detection accuracy yet
maintaining a low computational complexity. We utilize
pixel difference to make the proposed method more
simple and fast. To overcome the disadvantages of pixel
difference by using a method for matching particular
regions.
3. Proposed Method
The steps for our proposed scene boundary detection
method are given in the following:
1.
2.
Compute gray-scale histogram of the each frame.

Take a position that has low distribution of
histogram. Make an n n pattern around that
position
Compute the absolute pixel difference. The
symbol c is the color type of the frame.
() =
2. Background and related work

3.
The fast and easy way to detect if two frames are
different is count the number of pixels change. The total
is compared against with threshold to determine if a shot
or scene boundary has been found. This method is
efficient to detect abrupt video scene change [5], but it
is sensitive to camera motion. Zhang, Kankanhalli, and
- 741 -
1
2
=1 =1 | (, , ) +1 (, , )|
Compute the sign difference of frame difference.

() = ( + 1) ()
4.
Transform the result by discrete cosine

transform to remove the high-frequency
component.
ICEIC 2015
We use the video with 350 frames, 8 scenes and 7
scene boundaries. The Scene segmentation positions are
22-23, 89-90, 144-145, 166-167, 189-190, 260-261, and
282-283. Figure 1 shows the result of experiment. The
pick refers to the extracted scene boundaries
boundary detection algorithm has the weakness that

produce missed detections and false detections when
high motion and brightness variations are present in the
video. Depending on the genre, the video has the several
difference effect, like abrupt shot transition and fade
in/out, dissolve, wipe, flash, light and so on. Robust to
the various effect, we need more improvement.
5. Acknowledgments
This research project was supported by the Ministry
of Culture, Sports and Tourism (MCST) and by the
Korea Copyright Commission in 2014.
References
Figure1. Detected scene boundaries
We have performed a series of experiments with
several types of video. Table 1 shows the information of
video sequence used in the experiments with Sequence
Type, number of frames and scenes.
Table 2 shows the value of Recall and Precision in
the experiments. As can be seen from Table 2, the recall
and the precision values are both above 70%.
Table 1: Video Sequence used in the Experiments
Sequence
Type
AD
News
Animation
Movie
Sports
Num. of
frames
520
365
755
653
1025
Num. of
Scenes
9
3
7
15
4
[1] J. Kim, N. Kim, N., Lee, D., Park, S., Lee, S.:
Watermarking two dimensional data object identifier for
authenticated distribution of digital multimedia contents.
Signal Processing: Image Communication 25, 559576 (2010)
[2] Y. Lee, J. Kim.: Robust Blind Watermarking scheme for
Digital Images Based on Discrete Fractional Random
Transform. Communications in Computer and Information
Science 263, 139145 (2011)
[3] Li, D., Kim, J. Secure Image Forensic Marking Algorithm
using 2D Barcode and Off-axis Hologram in DWT-DFRNT
Domain. Applied Mathematics & Information Sciences
(AMIS) 6(2S), 513520 (2012)
[4] Jin R., Kim, J.: A Digital Watermarking Scheme using
Hologram Quantization, SIP2012 Vol. 342 pp 3946, November 2012.
[5] X. Yi and N. Li, Fast ixel-Base Video Scene Chage
Detection, Circuits and Systems, 2005. ISCAS 2005, pp.
3443 - 3446, May 2005
[6] H. Zhang, A. Kankanhalli and S. Smoliar, Automatic
partitioning of full-motion video, Multimedia Systems, pp.
10-28, 1993
Table 2: Recall and Precision values achieved

Sequence
Type
AD
News
Animation
Movie
Sports
average
Miss
False
0
0
0
3
1
-
0
0
0
1
0
-
Recall
(%)
100
100
100
93.3
100
98.66
Precision
(%)
100
100
100
80
75
91.00
Fscore
100
100
100
86.1
85.7
94.36
4. Conclusion
In this paper we present an efficient method to detect
video scene boundary. In contrast to traditional scene
- 742 -
P5-15
Noise Power Scheduling for Online Secondary Path Modeling

in Multi-channel Feedback ANC Systems
J.B. Seo and S.W. Nam
Dept. of Electronics and Computer Engineering
Hanyang University, Seoul, 133-791 Korea
swnam@hanyang.ac.kr
Abstract
In this paper, we propose a new noise power
scheduling for online secondary path modeling in
multi-channel feedback ANC systems. The noise power
of the additive random noise signal is controlled in this
paper to reduce the residual noise in the error
microphones. Simulation results demonstrate the
effectiveness of the proposed approach.
secondary path. Moreover, the error signal ek (n) is

picked up by the error microphones and used to update
the adaptive filter coefficients. The objective of ANC is
to minimize the power of the measured error ek (n) [1].
J
ek (n) = d k (n) ([ y j (n) v j (n)] skj (n))

j =1
y j (n) = x Tj (n)w j (n)
(2)
w j (n + 1) = w j (n) + w x ' jk (n)ek (n)
(3)
x ' jk (n) = skj (n) x j (n)
(4)
k =1
Keywords: Feedback ANC, VSS-NLMS, Online

secondary path modeling.
(1)
x j (n) d j (n) = f j (n) + y Tk (n) s Tjk

k =1
(5)
1. Introduction
where d k (n) is the primary output signal and v j (n) is a
An active noise control (ANC) system is more

effective for reducing low-frequency noise signal than
passive noise control methods [1]. Recently, feedback
ANC systems have received much attention in noise
control and signal processing areas [2-3]. In practice,
filtered-x least mean square (FX-LMS) algorithms with
additive random noise signal based online secondary
path modeling (OSPM) have been utilized [4].
However, the additive random noise contributes to the
level of output residual noise and thus may degrade the
ANC performance of the system [4]. In this paper, we
propose a noise power scheduling for a multi-channel
feedback ANC system with OSPM. For that purpose, it
controls additive random noise power based on the
convergence status of adopted OSPM filters. The
proposed approach provides lower residual error than
conventional multi-channel feedback ANC system with
online secondary path modeling.
random modeling signal, uncorrelated with a primary

noise signal. In (4), x j (n) is the input signal of the
2. The proposed noise power scheduling

method for OSPM in multi-channel
feedback ANC systems
In Fig. 1, an 1x2x2 multi-channel feedback ANC
system with OSPM is described, where y1 (n) and
y2 (n) are adaptive filter output signal, S kj (z ) is the
secondary path, and S kj ( z ) corresponds to the estimated
adaptive filter w j (n) . The update equation of the

proposed approach can be given as follows:
v j ( n)
s kj (n + 1) = s kj (n) + sj (n) f k (n)
v Tj ( n) v j ( n) +
f k (n) = e k ( n) (v' k 1 + v' k 2 )

v' kj = s (n) v j (n)
T
kj
v j ( n) =
2
v max
j ( n) v j m ( n)
p j (n)
p j (n)
(7)
(8)
sj (n) = max j (n)
j ( n) =
(6)
(9)
(10)
(11)
+C
p j (n + 1) = p j (n + 1) + (1 )
v j (n)
v ( n) v j ( n) +
T
j
(12)
Here, v2max is a maximum value for the variance of

noise signal, max is the maximum value of the step
size, and is the regularization factor [5]. In (11), C
is the positive constant. The step size (n) varies
between 0 and max by
p (n)
. Also, the power of
noise signal v j (n) varies between 0 and v2max .
- 743 -
ICEIC 2015
Fig. 1. The proposed multi-channel feedback ANC system.
The performance of the proposed approach is
verified for an 1x2x2 multi-channel ANC system. The
noise signal comprises sinusoids of 100 Hz, 200 Hz,
and 300 Hz. The primary and secondary acoustic paths
are FIR filters of tap-weight lengths 256 and 128. The
control filters ( w1 (n) , w2 (n) ) and modeling filters
( s11 (n) , s12 (n) , s21 (n) , and s22 (n) ) are also selected as
FIR filters of tap-weight lengths 192 and 128, and
initialized by the values where the modeling error
reduces to -5dB [4]. Also, the mean square errors
(MSE's) of residual noises ( e1 (n) and e2 (n) ), as in Figs.
2-3, demonstrate that the proposed approach yields
better performance than the conventional method.
Fig. 3. MSE at the error microphone e2 (n) .

ACKNOWLEDGMENTS
This research was supported by Basic Science Research
Program through the National Research Foundation of Korea
(NRF) funded by the Ministry of Education, Science and
Technology (grant no. 2012R1A1A2005378).
4. Conclusion
References
In this paper, a noise power scheduling for online

secondary path modeling in multi-channel feedback
ANC systems is proposed. The simulation results
demonstrate that the proposed approach provides better
ANC performance than conventional multi-channel
feedback ANC system.
[1] S.M. Kuo and D.R Morgan, Active Noise Control SystemAlgorithms and DSP Implementations, New York: Wiley,
1996.
[2] B. Mazeaud and M.A. Galland, "A multi-channel
feedback algorithm for the development of active liners to
reduce noise in flow duct applications," Mechanical Systems
and Signal Processing, vol. 21, no. 7, pp. 28802899, Oct.
2007.
[3] N. Devineni, I. Panahi, and P. Kasbekar, "Predictive
multi-channel feedback active noise control for HVAC
systems," Proc. of the EIT2011, pp. 1-5, 15-17 May, 2011.
[4] H. Hassanpour and P. Davari, "An efficient online
secondary path estimation for feedback active noise control
systems," Digital Signal Processing, vol. 19, no. 2, pp. 241249, Mar. 2009.
[5] H.C. Shin, A.H. Sayed and W.J. Song, Variable stepsize NLMS and affine projection algorithms, IEEE Signal
Processing Lett., vol. 11, no. 2, pp. 132-135, Feb. 2004.
Fig. 2. MSE at the error microphone e1 (n) .
- 744 -
P5-16
A Least Square Fitting Method for Surgical Tool Tip Calibration
K. Y. Shin1, S. O. Jin1, K. C. Nam2, S. K. Yoo3

Korea Electrotechnology Research Institute, 2Dongguk University, 3Queens University Belfast
kyshin@keri.re.kr, sojin@keri.re.kr, kichang.nam@gmail.com, syoo02@qub.ac.uk
Abstract
Three-dimensional coordinate of the marker

attached to the surgical tool at the surgical navigation
is calculated by the stereo vision system. The markers
are used to calculate the end point of the surgical tool.
Due to motion blurring or systematic/random error of
stereo vision system, 3d positions of markers are
incorrect. This causes incorrect endpoint position of
the surgical tool. To solve this problem, in this study,
we calculate the positions of the new marker that is not
affected by the noise using a least square fitting
method.
between tool tip and attached marker which can be

formed as a vector [2, 3]. In the process, center
positions of the markers are unstable due to flashing
light and blurring caused by the motion of the tool.
This may degrade the accuracy of the estimated
positions of the end point. To mitigate this
shortcoming, in this study, we estimate the coordinates
of other frames based on the first frame using a least
square fitting method.
Keywords: Surgical navigation, tool tip, least-square

fitting, stereo vision
1. Introduction
Surgical navigation provides the improvement in
the accuracy and safety of surgery during the preoperation or the intra-operation. A surgical navigation
system consists of a stereo vision system for image
acquisition and surgical tools. The stereo vision system
can be divided into passive and active system
according to the use of infrared light. The passive
system uses a spherical marker that reflects light with
the use of infrared light whereas the active system uses
a marker that emits light like a light emitting diode
(LED) without the use of infrared light. These two
methods generally obtain an image of markers in the
stereo camera and calculate their three-dimensional
coordinates [1].
Markers are attached to the surgical tools and it is
especially important to track the end position of the
surgical tool. This is because the medial image matches
with anatomically correct position based on the
position of markers situated on the surgical tools [2, 3].
Moreover, the surgical procedure such as biopsy and
suction performs in the end point. Endpoint of surgical
tools is estimated by the three markers attached to
surgical tool. It is a procedure to find the relationship
Fig. 1 Pivot for tool tip calibration
2. Methods
The experiment has been implemented by pivoting
the tool as shown in Fig. 1. Please note that the pivot
tool is made from acrylic to reduce the error during
machining process [2, 3]. The images were obtained at
six different pivot points by a stereo vision system and
the least square fitting algorithm was employed to
minimize the error of the stereo vision system [4-6].
Fig. 2 Calculating new marker position using least

square fitting method
- 745 -
ICEIC 2015
The least square fitting method used in this study is
shown in Fig. 2. In this method, we defined the first
frame as static state and the others frames as dynamic
state. The vectors between each marker were
determined with the center point of three markers as
the origin in the static state. The local coordinate
system was generated at the center point of three
markers in the dynamic state. Then the rotation matrix
and the translation vector between each local
coordinates were calculated. New marker centers
(Mdynamic) in each frame were estimated by the rotation
matrix (R), the translation vector (t) and the center
point of static state (pcenter).
errors, hence the area of the triangle was not constant.

This causes that the end point of a surgical tool
becomes inaccurate. In this study, we mitigated these
errors using the least square fitting method. As a result,
the calculated areas of the triangles formed by the three
markers for six different pivot points were almost
constant. This study suggests that more accurate
position can be estimated by using the least square
fitting method.
References
[1] J. Collyer, Stereotactic navigation in oral and
maxillofacial surgery, British Journal of Oral and
Maxillofacial Surgery, vol. 48, pp. 79-83, Jan 2010.
To verify the algorithm, we compared the area of a

triangle formed by three markers. If the marker is
affected by the noise, the area of the triangle will be
changed. In other words, the area of the triangle is the
same in any position unless it is affected by the noise.
Vector product was used to compute the area of a
triangle formed by three markers.
3. Results
Fig. 3 shows six vectors produced from all set of
data. The area of each marker in the each pivot point is
calculated by cross product between two vectors. The
areas of a triangle formed by three markers at six
different pivot positions were not same before applying
least square fitting method. However, they were almost
the same after applying algorithm.
[2] W. Onprasery, S. Ongwattanakul, J. Suthakorn, A Novel

Method on Tool Tip Calibration for Biomedical Application,
The World Congress on Computer Science and Information
Engineering, pp. 650-653. 2011.
[3] W. Onprasery, S. Ongwattanakul, J. Suthakorn,
Implementation on a New Tool Tip Calibration Method for
Biomedical Application, Lecture Notes in Electrical
Engineering, vol. 129, pp. 385-392. Feb 2012.
[4] F. E. Veldpaus, H. J. Woltring, L. J. M. G. Dortmans, "A
Least-Squares Algorithm for the Equiform Transformation
from Spatial Marker Co-ordinates", Journal of Biomechanics,
vol. 21, pp. 45-54, 1988
[5] S. Umeyama, "Least-Squares Estimation of
Transformation Parameters between Two Point Patterns",
IEEE Transactions on Pattern Analysis and Machine
Intelligence, vol. 13, pp. 376-380, Apr 1991.
[6] A. Wolf, M. Senesh, "Estimating joint kinematics from
skin motion observation: modeling and validation",
Computer Methods in Biomechanics and Biomedical
Engineering, vol. 14, pp. 939-946, Nov 2011.
[7] R. L. Chatburn, Evaluation of instrument error and
method agreement, Journal of the American Association of
Nurse Anesthetists, vol. 64, pp. 261-268, Jun 1996.
Fig. 3 The triangle area before/after applying least

square fitting method
4. Conclusion
If the stereovision system has no errors, the
calculated area of a triangle formed by three markers is
always constant. However, it is inevitable to have a
systematic error and a random error in measurement
system [7]. Likewise, a stereovision system had these
- 746 -
P5-17

! #" "!$

%& &! ! ! && "
'! ! ! &
!! ! (" !
! & &! !
'!!*)'!!
!+',"!
" - " .
" &!& " "/
& '!"
"$&&!&"
' ("" " "& " !
! !& " & "
"!&,"
!

"$#!

&%'

$
# #

!
"

!%

#

(')&*
$
!
#

!

#

+

,* ##
(-)&

# #
./! $
&0 /
.

$
!

* 1! $

! #$ !
#
!

!

!
&

/
!
#

7
54.'-6&

! ! $

8
2*

!&
/#
! 8
2*
!&

!
#
*!
!

! #$ !

!

#
& 9/

! #$
!
#
!
##
3 #

! !
! $

!
#
& 3/# / : ;!
& *

!

#$

#
(<)&
!

*!&
$
/ #.
!
#

54.'-6

$
*!

& 3!

.
# !
#

!*
-&
=

-

& 9
!

$

/

& /
$
/

#

!

&
*
$
!

#
#

!
/

$
#

#
&
(%)

!

!

/!

*
/
#

& 2! !

!

& 3!
!

*

!
"

#

& !
! $

!
#
&
- 747 -
*(!

1
ICEIC 2015

& !
!
! *!
!

!
##
!# #
!
#

#.
$
#
# 'C

!
. *
&
+%

!# #
*
##/!
*
!

!

#

&&1

&2
##
!
##

(4)&
9

! #
-

*!

& /
*!
!

!

>1/&
8
/ /!

!

!

$

!
!

.
& *

!

!

!

$
& 2

!

!

&3!
*

!

/
!

#.

#
$
!

$
/
!7 /+!
# #
##
!
#.
<-,
* /!

.
&!

>

*

!

/ #

/

/!

!
#
$

!

* /& $

#

*! !*
-&

*+!8#
# #.
$

/%
*01

! # #
*
##

! #

$

$
&
2!
!
7
!
**!

7

<-A.-4A54.'-6!

#.
$
/<-#.

#
$

!!*
#

# 4
&9!*
4
!
#.
$

*

'C
&
!

! ##
! # #

!

#
#

& #

*

$
!

&3!
#7 #

>

##
!
"

&
1#
*(!?

#

*!
3!

! * / ##
/ !

0/ B +0B, = ?

!
D
+=?, !! !

?

3 "
?
$ +=&
-A'-'F69-A-5''E,&

,%-.

3!
##

!!# #
##
!

!!

.#

3 * #

$
!
#

&
<&<7:
@*

$
!

&
*

$

<-A.-4A

$
&B.
!
3

*

!

#.
& !
!
! !
##

!

!

!
#.

!

#

&
*

!

/ !

!
#
$
&9
*

! !

! !
$

3&3!
! 3 !*

41'AA

#

(') % 0!

&
G? ?
3

I
#
%$&CH
&-##&'<H'C4-AA4
(-) = $
F 3 G

I
!
BBB
#
8
/

#
%

?
$&'##&6656E<-AAC&
(<): ;!8!9$ 0
!

! D* 3
!
G

@

I
!
-AA5
BBB#
8
/

#
%

?
$&-##&'4E''4E6-AA5&
(4) & 1 G
! J 9 * /
.
!
#
I

#

%
?
+%?,-AAC
- 748 -
P5-18

!

!#" " !$

% " & '
#! !
)*( " " +', #! !
&$ )*( ! -
! !!!
." & !$
!! ! #! %
"!!
" ! %
/ &" ! "
10 ! &"
+',( #!!

#$!"

!"#
$
, 6 ' 0

% %, & $% ! !
%!" %%%, +

! & !
% $ 7
%
,&-

% ! & !
% &
$% % ! %&% +
8$$$ &&&,&
% ! % % $%+
% $$7 %"&
!
% % $ $$ +
% % %, $$
!%% !"+
&%'

!"%& (') !

$ % % $&
* $ % +
% $% % $ $$+
, $ $ & -
,$ $. +
% &
!" %
& ! 0 /% 0%
$ 1+ 2 $% & %
$$ ! & !
%+
0 , $ +
3 $ $ $, % $% %
% ! ! (4)
% $
$ +
) &"!&!
%$7
*%+
(%

0 & %
!"
%(5) % & * +
$ & % $ % %
% & % & , %&& !"+
- 749 -

) ("$%!"% &
%
ICEIC 2015

, %
!" & 5 $$ $$$
,%,+
$$%
$% & -
/- %% 1 % / 1 %
$ 64+

) *"
&&$
$

$ %& /51 % /41
& $, %%+
/51
/41

0 $$ $! !
!"
% %+
$! !
69 !,$ +

0 . % ! & !"
%!" ! $,%
! &%+
1%2 ) !

3 $ $
!"
% %+
3 & .$ % $%
$,%$5' %6/6 , 1
% % ! ! 5
&+
$$% %%&
$$ = & & $% %
% & $7 & % $
%" %+ 8 ,& &
$$ >
(9) %;(:)
*%+
!

& $$% !
> & ?% />?1 % @
6% & = /@61
"& 3, /@+
5A'5'C85A5B''D1+
3

) ."% &': %
.%/0+

0 $&% .$

6 # %+ 0 %
4+9;7< %-- ,% $%&$5'
$ % , %
6:+
(') > + E!

6
#E3 &-$ ,+:F
+5$$+'4F
':9> +5AA9
(5)

G ?&&
#6 &
!"#H
&3=???+,+'C+'$$+AA'
AAF> +5A'9
(4) =% ?! G
$7 H @ @ 'DD:+ %+ 3???
3 -&,+9+$$+'D95
'D9C@,+
'DD:
(9)J &-I
J+ G6 # % >

$ H3 -& 3- 5AAF
= ,++$$+''
'C5AAF
(:) # @+ + G & % ; %
& #H -$ %
5AA: - 5AA:+ 3??? -$
-&,+'+$$+CCB
CD4'DD:

) 1" & 0 %

- 750 -
P5-19
Iterative Reconstruction of a Signal from its Aliased Fourier Transform

Magnitudes
Wooshik Kim
Professor, Sejong University
wskim@sejong.ac.kr
transform,
Abstract
i.e.,
| X (k ) |
where
jIx ( k )
Phase retrieval is concerned with the reconstruction

of a signal from the magnitude of its Fourier transform.
In some physical phenomenon such as in X-ray
crystallography, the samples of its Fourier transform
magnitude do not satisfy the Nyquist sampling theory
and thus has aliasing problem. In this paper, we
consider this problem and present some simulation
results. After we briefly mention the characteristics of
the phase retrieval problems in X-ray crystallography
and the iterative algorithm, we present some results
after we apply this algorithm to the phase retrieval
problem
Keywords: Phase retrieval problem, Digital signal
processing, X-ray crystallography
1. Introduction
he phase retrieval problem is a problem of

reconstruction of a signal from the magnitude of
its Fourier transform or its Fourier intensity. This
problem arises in a variety of different applications
including X-ray crystallography [1], electron
microscopy, astronomy, optics, and signal processing
[2, 3]. Usually this problem is very difficult to solve
[1]. Theoretically speaking, two- or higher-dimensional
phase retrieval problems usually have unique solutions
within trivial ambiguity so that they can be uniquely
specified to within a trivial ambiguity [2]. So
researchers have tried to solve this problem by
proposing various methods. In our group, we have
considered the reconstruction of a signal from 3 kinds
of information, i.e., the Fourier transform magnitude of
the signal that we want to determine, a signal that is
assumed to be exactly known, and the signal that is
obtained by the addition of the two signals [3-5]. In
mathematical terms, the phase retrieval problem is the
problem of reconstructing x (r ) or its Fourier transform
phase Ix (k ) from the magnitude of its Fourier
and r and k are

X (k ) F{x (r )} | X (k ) | e
multi-dimensional coordinates in the spatial domain
and the frequency domain, respectively.
Among the phase retrieval problems arising in
physical environments, the problem arising in X-ray
crystallography is somewhat more different than those
arising in other fields such as optics, microscopy, and
astronomy [1, 4]. For example, while the phase
retrieval problem occurring in Optics and Astronomy
are 2 dimensional, the problem in the crystallography
is 3-dimensional. In addition to this, the basic
difference comes from the fact that while in the
problem of 2-D we can exploit twice the region of
support of the signal itself for processing the FTM, in
the phase retrieval problem in crystallography we are
not able to extend the region for processing beyond the
region of support of the signal [4]. This problem causes
the aliasing of the autocorrelation of the desired signal,
which takes twice the region of support of the signal.
In solving the phase retrieval problem, we usually
use two types of algorithms, i.e., the closed-form
algorithm and the iterative algorithm. In this paper, we
consider the iterative algorithm only. The iterative
algorithm is of the type that uses the output of the
algorithm at one stage as the input to the next one. This
type of algorithms has two important advantages over
the other one. One is that, at each stage of the
algorithm, we can put various constraints such as
positivity, a finite region of support, or magnitude
constraints. The other is that with control over the
number of iterations, these algorithms may be
terminated at any time before the effects of noises
become serious.
In [5], we proposed an iterative algorithm and
showed that if we apply this algorithm to a X-ray
crystallography-type problem, we might get the desired
- 751 -
ICEIC 2015
solution. Recently, we have proposed another iterative

algorithm which shows better performance [6]. In this
paper, we show some of the results after we apply the
new iterative algorithm to an X-ray crystallography
type phase retrieval problem
2. Phase retrieval problem in X-ray

crystallography
X-ray crystallography is a method of identifying the
structure of a molecule using X-ray by making its parts
into a form of crystal. If we have a molecule that we
want to identify its structure, then we break it and
make a crystal by proliferating its fracture. A crystal
has a repeating structure such that its diffraction
pattern that the diffracted x-rays are forming becomes
a Fourier transform of the structure of the crystal.
However, we can measure only the magnitude or its
intensity of the diffraction pattern, which is the phase
problem in X-ray crystallography [1,7].
3. Problems Associated
Crystallography
with
X-ray
There are some unique properties which exist in the

phase retrieval problems in x-ray crystallography [4].
Among these, we mention the two application-specific
properties that are relevant to the topic of this paper i.e.,
aliasing and atomicity. Other properties may be found
in [4]
Aliasing
To probe further, we compare this problem with the

one in Optics or Astronomy. In 2-dimensional phase
retrieval problems such as in Optics and Astronomy,
we can use a larger region of support for processing
than that of the region of the support of the desired
signal to avoid aliasing while we calculate the
autocorrelation function. On the other hand, in the
phase retrieval problem in X-ray crystallography, it is
difficult to avoid the aliasing problem. In other words,
we only get the aliased version of the autocorrelation
function in X-ray crystallography. This is important
because in solving the phase retrieval problem, we
usually use the fact that the autocorrelation can be
uniquely obtained from the Fourier intensity of a
desired signal, which is the square of the Fourier
transform magnitude of the signal. Especially, the
closed-form algorithms are very much dependent on
the autocorrelation function, which has twice the
region of support of the signal itself.
Figure 1 shows a model that represents the aliasing
problem in the crystallographic phase retrieval problem
[4]. (a) is a simplified model of a real 2-D crystal. As
we can see, the model is composed of the repetition of
the same pattern. The autocorrelation function of this
model is shown in (b). As we can see in this figure, the
autocorrelation function is overlapped each other and
have the aliasing problem. To avoid this aliasing, the
crystal should be apart at least the same support of the
model itself, as is shown in (c), which is virtually
impossible to implement in a real crystal. This model
and its autocorrelation function are shown in (c) and
(d), respectively.
The first property that the phase retrieval problems in

X-ray crystallography have is the undersampling or the
aliasing problem. In a molecule crystal, its structure is
compact in the sense that the molecules in the crystal
do not either overlap or there is no space between
molecules, we can say that between the samples in the
diffraction domain and the electron density of a crystal
the Nyquist condition is satisfied. Therefore, if we
know all the information of the diffraction pattern, we
can reconstruct the electron density. The problem,
however, comes from the phase problem. In other
words, we can only measure the magnitude of the
diffraction pattern not its phase. This is important in
the phase retrieval problem because the most
algorithms in this area use autocorrelations, which
require larger region of supports, not the Fourier
transform magnitude itself.
- 752 -
ICEIC 2015
X 0 (Z )
K (Z )
| Y (Z ) |2 | X (Z ) |2 | H (Z ) |2
E (Z )
1
e jM
)`
2 u max^H (Z
(Z )
(Z )
X
k
K k (Z )
X
k 1 (Z )
* (Z ) H (Z ) X
(Z ) H * (Z )
X
k
k
X k (Z ) E (Z )[ K (Z ) K k (Z )]
X k 1 (Z )
X k 1 (Z )
| X (Z ) | e
jI X ( Z )
X k 1 (Z )
xk 1 ( n)
F 1{ X k 1 (Z )}
xk 1 ( n)
k 1 (n)
x
T { xk 1 (n)}
k 1 ( n)
x
(Z )
X
k 1
Figure 1 Aliasing problem in the phase retrieval

problem in X-ray crystallography [4]
k 1 ( n)}
F{x
(Z )
X
k 1
Figure 2 Block diagram of Iterative Algorithm
Atomicity
The crystals including molecule crystals, are
composed of numerous atoms. This may make the
phased retrieval problem in X-ray crystallography
somewhat easy because this may make a sparse
problem so that the problem can be solved uniquely [9].
In mathematical terms, the crystal molecules can be
represented as
4. Simulation
We have applied this algorithm to the same x-ray
crystallography model that used in [4]. We used the
same crystallographic data we had used in the paper [7],
which we showed in Table 1. In this table, we
presented types of atoms, their atomic numbers and
coordinates
x(r )
Z G (r r ) ,
i
i 1
where x (r ) is the equation that represents the

structure of the molecule and r ,
Z i , and ri are a
multi-dimensional coordinate, the atomic number of

the atom at the position
ri .
3. Short introduction to new iterative

algorithm
The procedure for a simulation is as follows. First of

all, we generate a model crystal using the data in Table
1. Then, we generate a Fourier transform magnitude of
the crystal. Then we add an atom that has a big atomic
number, which we call a heavy atom and get its
Fourier transform magnitude. Starting with these two
Fourier transform magnitudes and the location and the
atomic number of the heavy atom, we run the iterative
algorithms.
The main block diagram of the algorithm is given in

Figure 2 [6]. This algorithm is basically comes from
the Gerchberg-Saxton algorithm and modified some
constraints. Compared with the old algorithm in [5],
the new algorithm made some improvement in
convergence by changing some parameters. Some of
the basic properties of the algorithm is shown in [6].
- 753 -
ICEIC 2015
Table 1 The composition of the molecule that we are

using here.
]

3

2

2

2

&

&

&

&

&

2

2

1

&

1
QXPEHU
[
DWRP
DWRPLF

DWRP
DWRPLF
[
QXPEHU

&

&

&

1

1

&

1

3

2

2

2

2

&

&

&

&

&

2

1

&

1

&

&

&

1

1

&

1

3

2

2

2

&

&

&

2

&

&

2

1

&

1

&

&

&

1

1

&

1

3

2

2

2

&

&

&

&

&

2

2

&

&

1

&

1

&

1

1

&

1

0J

:

:

:

:

0J

:

:

:

:

:

:

:

:

:

:

:

:

:

:

Figure 3 Convergence Properties of the Simulation
(a) Original data

:

:

:

:

:

:

:

:
In Figure 3, we compared the convergence

properties of the two algorithms, i.e., the old one and
the new one. As we can see in this figure, the new
algorithm converges better than the old one. In Figure
4, we have shown 3-D model of the crystal. As we can
see in this figure, the reconstructed values are at the
exactly same points and also have nearly the same
values at the same locations.
(b) Reconstructed data

Figure 4 3-D Display of the Results
5. Conclusion
In this paper, we have applied a newly developed
iterative algorithm for phase retrieval problem to a Xray crystallography model that has an aliasing problem.
- 754 -
ICEIC 2015
Although this model is much simplified compared with
that of a real model, we think that this result might be a
starting point of the future research.
References
[1] G. N. Ramachandran and R. Srinivasan. "Fourier
Methods and Crystallography". Wiley- Interscience, 1970.
[2] M.H. Hayes, "The Reconstruction of a Multidimensional
Sequence from the Phase or Magnitude of Its Fourier
Transform," IEEE Trans. on ASSP, April 1982, ASSP-30,
No. 2,pp140 - 154.
[3] W. Kim and M. H. Hayes. Phase retrieval using two
Fourier transform intensities." JOSA, A:7(3) 441-449. March,
1990.
[4] W. Kim and M. H. Hayes. The phase retrieval problem
in X-ray crystallography Proceedings, ICASSP, Toronto,
Canada. May 14-17. ppD:1765-1768..
[5] W. Kim and M. H. Hayes. 1990. Iterative phase retrieval
using two Fourier transform intensities." Proceedings,
ICASSP, Albuquerque, NM. April 3-6. ppD:1563-1566.
[6] W. Kim, A Modified Iterative Algorithm for Phase
Retrieval, JKPS, Vol. 61, N0. 4, pp 536-543, August 2012.
[7] R. P. Millane, Phase retrieval in crystallography and
optics", Journal of Optical Society of America, 1990, Vol.7,
No.3, pp 394411, March,
[8] Iterative Phase retrieval of a Undersampled Signal, 2014
97th Canadian Chemistry Conference, Paper#: 01431,
Vancouver, B.C. canada, Jun. 01-05, 2014.
Acknowledgement
through the National Research Foundation of Korea (NRF) funded
by the Ministry of Education, Science and Technology (NRF2013R1A1A2010664).
- 755 -
P5-20
An Adaptive Error Compensation Method for Thumbnail Generation in

H.264/AVC Bitstreams
Kyung-Jun Lee, Won-Jin Lee, Je-Chang Jeong
Department of Electronics and Computer Engineering
Hanyang University, Seoul Korea
kjlee8812@gmail.com, veronica0083@gmail.com, jjeong@hanyang.ac.kr
Abstract
To generate the thumbnail images quickly, it can be
generated from the H.264/AVC bitstreams directly
without inverse transform. However, it can be
degraded because of rounding and it will be
propagated to entire image. In this paper, we propose
an error compensation method for thumbnail
generation process considering error propagation. It
determines the compensation value using the error
distribution of each intra-prediction mode. And it gives
the adaptive weighting factor by considering the
distance to cover the error propagation.
error distribution for each intra modes and set the mean
and deviation value. And considering the error pattern,
we set the different weighting factors to determine
compensation value.
This paper is organized as follows. In Section 2,
related works are introduced. In Section 3, we describe
how to determine the compensation value of the
thumbnail image extracting from the bitstreams
directly. Section 4 shows the experiment results and
Section 5 concludes the paper.
2. Related Works
Chen described an intra-prediction as a matrix
multiplication for 9 modes [4]. The prediction block of
current block
can be calculated by following
equation.
Keywords: Thumbnail, H.264/AVC, Error

compensation
1. Introduction
Due to the development of the high resolution
images and video data, high coding efficiency is also
needed. H.264/AVC is one of the techniques which is
widely used for both of high and low bit rate
applications. And for fast searching and storing
purpose, some of generating thumbnails, which is the
reduced-size images, are proposed. It can give us
intuitive information of contents, so it is widely used
for video searching, browsing, and displaying.
The method that extracts thumbnails from the
bitstream directly is normally used. The DC coefficient
in the frequency domain is the representative pixel
value of a block, so the collection of them can be a
thumbnail of an image. Yeo and Liu [1] proposed a
method to make thumbnail images consist of DC
coefficients of a MPEG-1 frame, and it called DC
sequence. In the same way most thumbnail extraction
method from the bitstream of the MPEG-1/2 can make
various sizes images with reduced complexity [2, 3].
This paper proposes an adaptive error compensation
method for thumbnail generation. We consider the
(1)
After vertical and horizontal filtering operator, it

can be simplified as following equation in frequency
domain.
=
(2)
After doing the sum of

we can get DC coefficient.
prediction of next blocks.
- 756 -
(3)
(4)
and the error data,

and
are used for
ICEIC 2015
Because of integer operation of prediction,
transform, and quantization process in H.264/AVC,
floating point operation in thumbnail extraction
process makes some rounding errors. Yoon focus on
statistical pattern of truncated errors and set a random
variable r [5]. The compensation value s can be
determined that makes minimum variance of r. In the
same way, the representative value which is the mean
of distributed error will be determined.
Table 1: The size of the test images

Image
Album
Hirmer
Soccer
Beatles
TVshow
Table 2: Comparison result of the average

PSNR(dB)
Image
Album
Hirmer
Soccer
Beatles
TVshow
Figure 1. Partitioned image for different weighting

factors.
In the thumbnail generation process, next block use
the filtered current block. So the errors of current block
are applied in next blocks and it will be amplified. To
compensate this error propagation, we propose an error
compensation method which considers the pattern of
errors with pixel location in the image and determine
the adaptive weighting factors. The weighting factors
are set by considering the part of
as shown in
Fig. 1, and it will memorized in look-up table. Finally
we calculate the compensation values
by using
,
which are the average and deviation of intra
mode m, respectively.
(5)
The proposed method was evaluated by the
following conditions. We choose the test images
randomly and the five unofficial JPEG images (Album,
Hirmer, Soccer, TVshow, and Beatles) were used and
the size of the each images is shown in Table 1. We
generate three thumbnail images. FD (Frequency
domain) makes the thumbnail by extracting DC
coefficients and FFD (Fast generation method from
Frequency Domain) makes it by using the method
proposed in [5]. AFD (Adaptive FD) is the result of
our method.
Size
640x640
720x540
900x656
1024x768
1280x720
FFD[5]
34.24
33.69
33.74
32.45
34.45
AFD
35.27
35.02
34.32
33.35
35.76
+1.03
+1.33
+0.58
+0.90
+1.31
5. Conclusion
We proposed an adaptive error compensation
algorithm for thumbnail generation in H.264/AVC.
The method uses the error distribution data of each
intra prediction mode. It determines the compensation
value with the average, deviation value and the
weighting factor which is determined by considering
the location. It can successfully compensate the error
of thumbnail which is generated directly from the
bitstreams. It makes better result as shown in Table 2.
References
[1] B. Yeo and B. Liu, Rapid Scene Analysis on
Compressed Video, IEEE Trans. Circuits and Syst. Video
Technol., vol. 5, no. 6, pp. 533-540, Dec 1995.
[2] June-Hwa Song and Boon-Lock Yeo, Fast Extraction of
Spatially Reduced Image Sequences from MPEG-2
Compressed Video, IEEE Trans. Circuits Syst. Video
Technol., vol. 9, no. 7, pp. 1100-1114, Oct 1999.
[3] Sung-Joo Suh, Seong-Soo Chun, Myung-Hee Lee, and
Sang-Hoon Sull, Efficient Image Down-Conversion for
Mixed Field/Frame-mode Macroblocks, IEEE Electron.
Lett., Vol. 39(6), pp. 514-515, Mar 2003.
[4] Chen Chen, Ping-Hao Wu, and Homer Chen,
Transform-Domain Intra Prediction for H.264, IEEE
ISCAS, pp. 1497-1500, May 2005.
[5] Myung-Keun Yoon, Yeo-Song Lee, Chae-Bong Sohn,
Ho-Chong Park, Chang-Beom Ahn, and Seoung-Jun Oh, An
Efficient Error Compensation Method for Thumbnail
Extraction in H.264/AVC Bitstreams, THE KOREAN
SOCIETY OF BROADCAST ENGINEERS, vol. 13, no. 5, pp.
622-635, Sep. 2008.
- 757 -
P5-21
Combining Edge-aware Disparity Propagation and Iterative Voting for Stereo

matching
Eunah Choi*, Min Choi* , Changkyoung Eem*, Hyunki Hong**
*Dept. of Imaging Science and Arts, GSAIM, Chung-Ang University Seoul 156-756, KOREA,
**School of Integrative Engineering Chung-Ang University Seoul, 156-756, KOREA
eunazzy@cau.ac.kr, zizivebe@cau.ac.kr, richardeem@gmail.com,honghk@cau.ac.kr
Abstract
In this paper we combine edge-aware disparity
propagation and iterative voting with reliable disparity for
real-time stereo matching. Edge-aware method preserves
image structure in disparity propagation and iterative
voting with reliable disparity removes outliers in occlusion
regions. By implementing the entire algorithm on the GPU,
it can achieve about 13 frames per second for stereo
images with a resolution of 1024 768.
Keywords: Real-time Stereo Matching, Disparity
Propagation, GPGPU programming.
Figure 1 : Proposed method Flow chart
1. Introduction
Stereo vision is a technique to estimate the depth of real
scene like structure of the human vision system [1]. In
stereo system left and right views with parallax are
obtained. The goal is to determine disparities that are
indicating the difference in locating corresponding pixels.
The recovery of an accurate disparity map still remains
challenging, due to occlusion problems and sensor noise.
In addition dense stereo matching requires high
computation cost. This paper aims at computing more
reliable dense disparity map in real-time.
2. Proposed Stereo Matching Method

Stereo matching technique has the four steps. They are
matching cost computation, cost aggregation, disparity
computation/optimization and disparity refinement [1].
Figure 1 shows flow chart of proposed stereo matching
method. First, we obtain stable pixels by performing the
left-right consistence (LRC) check with initial disparity
maps. A new cost volume of stable pixel is constructed and
updated based on edge-aware disparity propagation (EDP)
[2]. Ground control points (GCP) are determined by using
[3]. Finally, iterative region voting is performed for
disparity refinement. Detailed process is described below.
2.1 Initial cost computation

In order to obtain initial matching cost, we employ
absolute difference (AD)-Census method [4]. Instead of
using a simple color difference between views, we
calculate the absolute difference of the Laplacian
transformed images. Since stereo cameras are separated
slightly from each other, brightness distributions of real
stereo views are different. By using brightness gradients by
Laplacian operation, we can alleviate the unwanted effects
by cameras parallax. Initial matching costs by AD-Census
are aggregated using a cross-based aggregation [5].
2.2 New cost volume construction
Every pixel in stereo image is classified into stable or
unstable pixel by using LRC check. Then we employ realtime EDP to construct a new cost volume (C) of stable
pixel [2]. Quadric new costs are computed at each disparity
level in C. Figure 2 show initial matching cost (C) and
new cost volume (C). In figures, the vertical axis and the
horizontal mean the cost value and the disparity level
respectively. Matching cost distribution of C becomes
more distinguished to determine reliable disparity. In this
example the maximum disparity level is 16. The new cost
volume is updated using edge-aware disparity propagation
[2].
- 758 -
ICEIC 2015
Figure 2: Initial matching cost (C) and new cost (C)

2.3 Refinement
The proposed method performs LRC check at each
pixel and then examines if its matching cost is significantly
smaller than the other competitors [3]. Iterative region
voting with the obtained GCPs and proper interpolation
process is employed [4]. For the noise reduction a median
filter is used in post-processing. Here the occlusion regions
are filled with reliable neighbor disparity values.
We have experiment in Intel core i5-750 2.67GHz and
Geforce GTX580 graphics card. In order to evaluate and
compare the matching accuracy performances in
quantitative measure, the standard stereo images in
Middlebury test are used as Table 1. Figure 3 shows the
disparity maps by the proposed method.
(c)
(d)
Figure 3: (a) stereo images, (b) ground truths, (c)
disparity maps by proposed method, and (d) disparity
map of real image sequence.
Table 1: Middlebury test result
Methods
Proposed method
RDP[4]
RealtimeEDP[3]
Middlebury Stereo Evaluation(Noncc)

Tsukuba
Venus
Teddy
Cones
1.22
0.97
1.29
0.29
0.21
0.25
4.49
4.84
5.67
2.38
2.53
2.27
4. Conclusion
Edge-aware disparity propagation and iterative voting
with reliable disparity are combined in crossed based
aggregation approach for real-time stereo matching. The
proposed method is implemented in GPGPU based CUDA.
Acknowledgments
(a)

MSIP/KEIT (10045289, Development of virtual camera system
with real-like contents).
References
(b)
[1] Scharstein, Daniel, and Richard Szeliski. "A taxonomy and

evaluation of dense two-frame stereo correspondence
algorithms." International journal of computer vision 47.1-3
(2002): 7-42.
[2] Sun, Xun, et al. "Real-time local stereo via edge-aware
disparity propagation." Pattern Recognition Letters 49 (2014):
201-206.
[3] Sun, Xun, et al. "Stereo matching with reliable disparity
propagation." 3D Imaging, Modeling, Processing, Visualization
and Transmission (3DIMPVT), 2011 International Conference
on. IEEE, 2011.
[4]
Mei, Xing, et al. "On building an accurate stereo matching
system on graphics hardware." Computer Vision Workshops
(ICCV Workshops), 2011 IEEE International Conference on.
IEEE, 2011.
[5] Zhang, Ke, Jiangbo Lu, and Gauthier Lafruit. "Cross-based
local stereo matching using orthogonal integral images." Circuits
and Systems for Video Technology, IEEE Transactions on 19.7
(2009): 1073-1079.
- 759 -
P5-22
Vision-based Gesture Recognition with RGB-D Sensors for Physiotherapy

Exercises
Young-Sook Lee 1 and Wan-Young Chung 2,*

Team for Next Generation U-Healthcare Technology Development, Pukyong National
University, Busan, 608-737, Korea
2,*
Department of Electronic Engineering, Pukyong National University, Busan 608-737, Korea
{yulisis1 , wychung2,* }@pknu.ac.kr
1
2. Materials and Methods
Abstract
Vision-based gesture recognition with RGB-D
sensors for the elderly and patients with chronic
diseases in exercise and rehabilitation is presented in
home healthcare environments. The research aims to
develop and design a novel system which allows
patients to do exercise and rehabilitation in their home
in order to enhance their compliance with the
rehabilitation exercise and their balance control. In
order to analyze balance, we proposed a human
gesture recognition technique using dynamic time
warping (DTW) that can be evaluated the similarity of
trainers activities and patients activities.
Keywords: DTW, Skeletal Information, Kinect RGBD Sensor, Healthcare System, Physical Rehabilitation.
1. Introduction
The human activity recognition systems have
become popular in computer vision research for
physical rehabilitation and exercise in home healthcare.
Impaired physical mobility is a condition in which an
individual has limited ability for independent physical
movement. It can be caused by a reduction in their
quality of life and a growing risk of serious diseases
and earlier death. In order to receive special care and
facilitate maximum recovery, patients need to travel to
the rehabilitation centers and may feel uncomfortable.
It is fundamental to find a way to improve the quality
of life of the patients facing their health problems
associated with decreased physical activity in their
body and increased health care costs. Rehabilitation
therapy can help decrease pain and enable patients with
chronic diseases to regain your independence in the
safest and most effective way possible. Previous works
have presented in the scientific evidence for physical,
cognitive and social health related benefits increased
exercise, especially in the elderly over the last few
decades [1].
The proposed system consists of a computer such as

a desktop or a laptop and Microsoft Kinect RGB-D
sensor to obtain skeletal data for extracting features is
illustrated in Fig. 1. Two sensors make up the depth
component of the Kinect: an infrared projector and a
monochrome CMOS sensor. Kinect motion sensorbased physical rehabilitation system is composed of
three main parts: feature extraction, skeletal detection
and tracking, and human activity classification.
Feature extraction is one of the major important
issues in the field of human motion tracking and
recognition. Kinect RGB-D sensor allows users to
control and interact with the console without the need
to attach markers on the body. The function of the
system using Kinect motion sensor enables to capture
the patients 3D joint positions as feature vectors and
record users execution of prescribed exercises. After
feature extraction, human activity detection and
classification methods are the next step under
consideration for human activity classification. To
achieve good recognition performance, it is essential to
choose a proper classification algorithm using the
selected feature vectors. Euclidean distance in the
traditional DTW is a commonly adopted used for
compared the difference between two time series
because it can be computed efficiently. However,
patients may perform the recorded trainers exercise
with different time length in a variety of scenarios for
rehabilitation. Therefore, this method is not suitable for
comparing two movements which have time series of
- 760 -
Fig. 1. Demonstration of the program running in our

proposed physical rehabilitation system during squatting.
ICEIC 2015
different length and sensitive to event small distortion
in time axis.
In this research, we employ DTW cost computation
using a weighting method in which each combination
of human body joint and gesture class is assigned a
specific weight. DTW costs to calculate between and
within class variations to find a weight for each body
joint according to each gesture. We assume that there
are two time sequences, and , of length n and m,
respectively, where = {1 , } and = {1 , }.
The matching cost for classification can be defined as
the minimal distance matrix between two sequences
and used for classification. To incorporate these
weights into the computation cost, the similarity
function is computed by:
( , ) = ( )
(1)
where is the distance between the training

gesture and a test gesture, and is the weight value for
each gesture. The final matching cost is calculated
based on dynamic programming using the follow
formulation:
(, ) = ( , ) + {(, 1), ( 1, ), ( 1, 1)} (2)
where the distance function of DTW varies with

the application.
The feasibility of the proposed Kinect motion
sensor based physical rehabilitation application is
tested in real time. To validate the overall performance
of the system, the proposed algorithm is applied to 216
gesture sequences including 32 test and 184 train
sequences. We have the optimal parameters obtained
from previous experiments. For each gesture class, we
(a)
(b)
(c)
(d)
(e)
(f)
Fig. 3. Examples of 3D trajectories of human joint positions

in 3D space when performing a human exercise Right single
leg stance. The left image and right image is the front and
the lateral view, respectively.
Table 1: System summary for recognition.
Technique
Traditional DTW
Proposed Method
Recognition rates (%)

64.1
97.3
have randomly selected 8 groups of samples from

original dataset as shown in Fig.2. Fig. 3 shows
examples of the 3D trajectories of human joint
positions when performing a human exercise
corresponding to Fig. 3(d). We implemented and tested
both the classical DTW algorithm and our proposed
algorithm. Our system summary for recognition rates is
illustrated in Table 1. The system shows good results
with the recognition rate of 97.3% because we used
DTW method using weighted values for each frame
and for each gesture. However, traditional DTW
method shows very low recognition rate because
distance gives equal weights to all dimensions of a
sequence. When performing the experiment, the
patients have to calibrate the Kinect sensor in order to
check their position. They go to the start menu and
calibrate the sensor moving their body until they can
detect the skeletal joint points on the screen.
4. Conclusions
This paper proposed a novel computer vision
algorithm which can evaluate a similarity between
trainers activities and patients activities using
dynamic programming with weight values. The system
is capable of identifying whenever the patient is doing
rehabilitation exercise correctly, warning them
otherwise and also recoding the statistics in a report for
a further professional analysis. This research aimed to
employ computer vision technology in designing a
system to help the elderly with motor disabilities or
patients with chronic diseases to increase the number
of exercises and improve the motor proficiency and
quality of life in their homes.
(g)
(h)
Fig. 2. Examples of a fully body tracking on our proposed
system for 8 rehabilitation exercises. (a) left single leg stance
type I, (b) left single leg stance type II, (c) left single leg
stance type III, (d) right single leg stance type I, (e) right
single leg stance type II, (f) right single leg stance type III,
(g) sit-to-stand, and (h) squatting.
References
[1] L. Bherer, KI. Erickson, and T. Liu-Ambrose, A Review
of the Effects of Physical Activity and Exercise on Cognitive
and Brain Functions in Older Adults, Journal of Aging
Research, pp. 1-8, 2013.
- 761 -
P5-23
Image Reconstruction Using Multiple Adaptive Regularization in Electrical

Impedance Tomography
Min Ho Jeon1, Bong Seok Kim2, Suk In Kang1 and Kyung Youn Kim1
1
Department of Electronic Engineering, Jeju National University, Ara 1 Dong, jeju City, 690-756,
Korea
2
BK21+ Clean Energy Convergence and Integration Center for Human Resources Training and
Education, Jeju National University, South Korea 690-756
kyungyk@jejunu.ac.kr
Abstract
2. Mathematical model
It is essential to find the suitable regularization
parameter to get good spatial resolution in electrical
impedance tomography. There is no certain method to
select the parameter. This paper presents a new method
with multiple adaptive regularization parameters. The
numerical experiment has been carried out to test the
reconstruction performance of the proposed method.
Keywords: electrical impedance tomography,
regularization parameter, Otsus method
1. Introduction
Electrical impedance tomography (EIT) is a
relatively new imaging modality where the conductivity
distribution is reconstructed based on current and
voltage data [1]. Even if EIT has some advantages such
as non-invasive and good temporal resolution, it still
remains a challenging problem to improve the
resolution of images due to its ill-posedness.
In order to solve the EIT problem, usually the
iterative Gauss-Newton (GN) method is employed to
estimate the conductivity distribution. It is known that
the GN method provides good performance compared
to other algorithms [2]. However, the performance of
the GN method depends on the selection of the
regularization parameter. Unfortunately, there is no
general way to determine the regularization parameter.
Usually, the regularization parameter is selected
empirically or is chosen by the L-curve method [3].
In this paper, to improve the resolution, multiple
adaptive regularization parameters are considered as
the diagonal matrix instead of the single parameter.
Adaptive regularization parameters are determined by
computing the conductivity norm errors at each
iteration step. The numerical experiment has been
performed to evaluate the performance of the proposed
method.
Forward problem in EIT calculates voltages on the

electrode using known conductivity distribution .
Equation (1) can be derived from the Maxwell
equations
in
(1)
(u ) = 0
with the following boundary conditions
u
(2)
l = 1, 2,...., L
u + zl
=
U l on el
n
u
(3)
e n dS = Il on el l = 1, 2,...., L
l
u
off el
(4)
=0
n
where Il is injected current through the electrodes el. u
is the electrical potential, Ul is voltage data, L is the
number of electrodes.
3. Inverse solver with multiple adaptive

regularization parameter
For solving the inverse problem, usually the
following objective function, including regularization
method with single parameter is considered
( )
=
1
U ( ) V 2 + R
2
(5)
In this paper, the regularization parameter is

considered as a matrix instead of a scalar. So, above
equation need to be changed as follows
( )
=
1
U ( ) V 2 + R
2
(6)
where U() is the calculated voltage and V is the

measured voltage. R is regularization matrix and is
the regularization parameter. For updating the
resistivity, the following GN method can be obtained
1
i +1 = i + J T J + ( R )T ( R ) J T {U ( ) V }+ ( R )T ( R )
where
- 762 -
NN
(7)
is the diagonal matrix with multiple
ICEIC 2015
800
adaptive regularization parameters, N is the number of

element. In the proposed method, two types of
regularization parameters are considered using the
following equation
=
A A
A
=
B B
B
in
2
500
550
(8)
200
(a)
(b)
800
NK
)( ))
( ) ( )
N
CC =
300
450
400
The performance of the proposed method (GNM) is

evaluated using numerical data, and the result is
compared with the conventional methods, i.e. GN
method with constant parameter, = 10 6 (GNC) and
GN method with the parameter based on the L-curve
method (GNL). Adjacent currents are injected into the
domain of 4 cm in radius through 16 electrodes.
Resistivities of the background and anomaly are
assumed to be 400 S/m and 800 S/m, respectively. For
noisy data, 1% relative noise is added to the simulated
voltage. The GN method is run by 10 iterations. For
numerical analysis, Image error (IE) and correlation
coefficient (CC) are employed as follows
600
600
400
A A
B B
4. Results
700
650
500
where B
and A
are conductivities in
the background and anomaly regions, respectively.
is mean of the conductivity. Moreover, to separate the
background and anomaly regions in the estimated
resistivity distribution, adaptive threshold value is
determined from Otsus method [4].
IE =
800
700
900
N(N-K)
900
750
i =1
((
700
700
650
600
600
550
500
500
450
400
400
300
350
(c)
(d)
Fig 1. Reconstructed image for case1. (a) true
image, (b) image by GNC, (c) image by GNL, and
(d) image by GNM.
CC
IE
0.16
0.9
0.15
0.85
0.14
0.8
0.13
0.12
0.75
0.11
0.1
0.09
0
GNC
GNM
GNL
2
GNC
GNM
GNL
0.7
Iteration number
0.65
0
10
10
Iteration number
(a)
(b)
Fig 2. Image error (IE) and correlation coefficient
(CC). (a) IE and (b) CC.
Acknowledgements
2 N
j
=j 1 =j 1
750
800
(9)
From figure 1, it can be noticed that reconstructed

image by GNM is better than other images. IE and CC
for simulated case is computed and plotted in figure 2.
In figure 2, it can be checked that image by GNM has
lower IE and higher CC as compared to other images.
5. Conclusions
Generally, it is not easy to find proper
regularization parameter in the EIT problem. So, a
new method with multiple adaptive regularization
parameters based on conductivity norm errors is
proposed to improve the image resolution. From the
numerical result, it is found that the proposed method
can improve the resolution of the reconstructed image.
This work was supported by Mid-career Researcher

Program through NRF grant funded by the MSIP (No.
NRF-2013R1A2A2A01068836).
References
[1] D. S. Holder, Electrical Impedance Tomography:
Methods, History and Applications, IOP Publishing Ltd,
2005.
[2] T. J. Yorkey, J. G. Webster and W. J. Tompkins,
Comparing reconstruction algorithms for electrical
impedance tomography IEEE Trans. Biomed. Eng., Vol. 34,
pp. 843-852, Nov, 1987.
[3] P. C. Hansen, D. P. OLeary, The use of the L-curve in
the regularization of discrete ill-posed problems SIAM J Sci
Comput, Vol.14, pp.1487-503, 1993.
[4] N. Otsu, A threshold selection method from gray-level
histograms IEEE Trans. Sys. Man Cyber. Vol.9, pp. 62-66,
Jan, 1979.
- 763 -
P5-24
Pedestrian detection Using individual feature information from multiple

pedestrian tracking process
Jeong-Muk Kim, Ramesh Kumar Lama, Dibash Basukala, Suk-seung Hwang, Jae-Young Pyun,
and Goo-Rak Kwon
Department of Information & Communication Engineering, Chosun university
grkwon@chosun.ac.kr
Abstract
We propose a method for detecting a pedestrian for
the individual person in the video. Pedestrians of each
individual are separated by using the learned classifier
and histogram of oriented gradient (HOG) feature
extraction. In the experimental results, motion vector
of mving direction and the color of each pedestrian is
used as the feature information for classifying the
pedestrians, and the shape information is used to
separate the body shape of a pedestrian.
direction of movement of pedestrians and the average

travel distance using the Motion Vector. Body shape
varies as a function of time, it must be taken features to
adapt to the environment. In order to obtain a
pedestrian by Body shape, it is necessary to accurately
position and number of objects present in the frame.
Therefore, the Clustering method is used for dividing
the area of each pedestrian. Then, to adapt to changes
in the shape of a pedestrian being tracked already, and
the model is updated by extracting the ROI region that
changes for each consecutive frame.
Keywords: Pedestrian tracking, HOG feature, Color

histogram, Motion Vector, Shape information .
1. Introduction
CCTV to provide video information, has been
changed to intelligent. Rather than simply providing
only the video information and it includes a plurality of
functions which detect situations of risk through the
analysis of the behavior patterns of pedestrian tracking
with automatic detection of the vehicle and
pedestrian[1]. In these systems, the pedestrian is an
element of significant interest. Then, by classifying
individuals by pedestrians in the scenario that has
detected two or more persons, and to obtain the
necessary information, will be a great help in the
investigation and prevention of crime [2]. This paper
proposes the pedestrians tracking method in this
situation using wearing color, motion vector, and shape
information as feature information for identifying an
individual based on the characteristics of the pedestrian
[3-4].
In this paper, we use the area of the pedestrian ROI
instead of the block. The ROI area of the pedestrian is
obtained by searching the the matching pedestrian area
of the previous frame and the current frame ROI area.
Than with using a large area and is obtained Searching
Range Motion Vector finds You can check the current
Figure 1. Proposed method of Pedestrian detection
2. Proposed Method
To detect the pedestrian many using the HOG. To
obtain a Shape information and wearing color in the
area of pedestrian longer detectable, and give out
Motion Vector pedestrian between each frame.
Tracking by detecting pedestrians by applying the
value of the pedestrian by ID using three pieces of
information. If it is in close proximity or overlap of the
pedestrian between, it becomes possible to determine
- 764 -
ICEIC 2015
whether comparison Matching the characteristic values

obtained when the detection fails or disappearing. In
the proposed method multiple pedestrians are detected
by using the HOG. Shape information is obtained from
wearing color and detected after pedestrian area,
pedestrian gets Motion Vector between frame by frame.
Using these three pieces of information each detected
pedestrian is assigned ID value. If overlap between the
pedestrian or close-up occurs, the HOG descriptor
ultimately fails to follow-up. In such scenario after
both pedestrians are separated from each other, the
feature of pedestrian of the current frame and previous
frame is matched. The original ID of the pedestrian is
assigned by matching the feature values.
a Network of Cameras, In 16th International Conference on

Digital Signal Processing, pp. 1-7, July 2009.
[2] B. Wu and R. Nevatia, Detection of Multiple, Partially
Occluded Humans in a Single Image by Bayesian
Combination of Edgelet Part Detectors, In 10th IEEE
International Conference on Computer Vision, Vol.1, pp. 9097, 2005.
[3] S. Park and S. Lee, Object Tracking with Probabilistic
Hausdorff Distance Matching, Lecture Notes in Computer
Science, Vol. 3644, pp. 232-242, Aug 2005.
[4] J. M Kim and G. R. Kwon, A pedestrian prediction in
the Presence of Occlusion Using Accumulated Motion
Vector, The Journal of Korean Institute of Information
Technology, Vol. 12, No. 9, pp. 45-51, Sep 2014.
3. Experiment Result
Looking the figure, an ID is given for each
pedestrian, to begin tracking. In situations where
pedestrians are close to each other, or the pedestrian
zone overlap is the HOG descriptor ultimately fail to
follow-up. However, after both pedestrians are
separated from each other, a distinction is possible by
using the feature data.
4. Conclusion
We used three different feature information to
classify each of the pedestrian in the context of
tracking the number of pedestrians. If pedestrians are
close or overlapped with each other close, and it
appears again without disappearing. The proposed
method distinguishes each pedestrian situation with
minimal confusion or failure in tracking. The proposed
method to improve more We proceed to the next can
be more precisely identify a pedestrian, each of the
study.
Acknowledgements
This research was financially supported by the
Ministry of Education, Science Technology (MEST)
and National Research Foundation of Korea (NRF)
through the Human Resource Training Project for
Regional Innovation (No. 2012-04-A-03-025-12010200). And this research was supported by the
MSIP(Ministry of Science, ICT and Future Planning),
Korea, under the Global IT Talent support program
(NIPA-2014-H0904-14-1003) supervised by the
NIPA(National IT Industry Promotion Agency).
References
[1] A. Alahi, Y. Boursier, L. Jacques, and P. Vandergheynst,
A Sparsity Constrained Inverse Problem to Locate People in
- 765 -
Figure 2 . Result of Pedestrian detection
P5-25
A Real-Time Eye Gaze Correction Method based on Head Pose Estimation

in a Calibrated Environment
Chia-Wei Lim, Moonsoo Ra and Whoi-Yul Kim
Department of Electronics Computer Engineering, Hanyang University, Seoul, Korea
chiawei@vision.hanyang.ac.kr, msna@vision.hanyang.ac.kr, wykim@hanyang.ac.kr
Abstract
An approach is presented for synthesizing virtual gaze
corrected views with the joint use of gaze correction and
head pose estimation. In this paper, the assumption that
the user interest moves accordingly with the head position
is made. Using a calibrated setup with two cameras
mounted on top and bottom of a camera rig, weighted
alpha blending is applied on the image pair with the
extend of correction depends on head orientation. To the
best of our knowledge, this is the first work to generate
natural and refined gaze corrected views using gaze
correction and head pose estimation.
Keywords: Gaze Correction, Head Pose Estimation
1. Introduction
With the great advancement in technology, there has
been an increasing demand for a more enhancing videobased communication platform such as video conferencing
and personal video calls. One of the key issues making a
significant difference between face-to-face and human
computer interface communication is the lack of constant
gaze interaction in the latter case. The persistent feeling of
disconnectedness ultimately hinders the establishment of
rapport and effective conveying of messages.
Over the decades, there are relevant studies which aim
to address the aforementioned issue. Generally, gaze
correction method fall into two categories: 1) monocular
camera based method, and 2) stereo camera based methods.
The former predetermined the desired position of a virtual
camera and rendered synthesized images with the eyes
gazing at the specific location in the space [1, 2, 3]. The
latter generated output views with reference to input
images captured from cameras located at different
positions [4, 5].
For researches using a monocular camera, Yip and Jin [1]
proposed an approach which performed face re-orientation,
warped the eyelids for the purpose of eyelid correction,
and added glares to the pupil. To target the gaze deviated
problem, Wolf et al. [2] presented a solution of artificially
replacing eyes with the most similar image in the database
of direct gaze images acquired through an initialization
phase. Recently, a model-based method is proposed by
Waizenegger et al. [3] to generate virtual views based on

the detection of eye position.
Using a pair of stereo cameras, Yang and Zhang [4]
proposed a solution to generate synthesized images with
the tracking of head pose based on a personalized face
model. Criminisi [5] later proposed a method of
synthesizing cyclopean views using left and right images.
The method was successful in dealing with occlusions to
generate high quality virtual gaze corrected images.
Nevertheless, the approaches mentioned above share a
common drawback: the synthesis of fixed gaze corrected
views invariant to head pose orientation. Head pose and
eye location are two contributing factors to a visual gaze.
Simplifying the problem of lack in gaze interaction by only
take into account the factor of eye location resulted in an
unnatural effect on the output images. This paper presents
a gaze correction algorithm using head pose estimation to
provide robust and refined gaze corrected views.
The rest of this paper is structured as follows: Section 2
describes about Active Appearance Model (AAM) [6].
Section 3 discuss about Region of Interest (ROI) extraction.
Section 4 explains the head pose estimation mechanism
with the joint use of AAM and Pose from Orthography and
Scaling with Iterations (POSIT) [7]. Section 5 gives the
algorithm overview. Section 6 discusses the result and,
Section 7 concludes the paper.
2. Active Appearance Model

In this section of the paper, we outline how AAM
implemented in the proposed method worked. The
intention is to provide an overview of the face tracking
scheme as some familiarity with it aids in understanding
the proposed gaze correction algorithm.
AAM is a model-based iterative matching algorithm for
image interpretation. The generative method describes a
deformable object by simultaneously describing the shape
and texture properties. To capture the variability of object
in these properties, an appearance model is built from a
representative training set during the training phase.
The shape of an object is commonly defined as the
quality of configuration points which is invariant under
Similarity Transformation (i.e., translation, rotation and
scaling). To derive a model fully capable of modelling the
- 766 -
ICEIC 2015
shape variation, the training set of AAM is a set of images
annotated with landmark points. These points are generally
marked at borders, vertexes, and corners as well as
augmented along the boundaries for a sparse description of
the target object. With each -point shape represented as a
T
vector given by
1, y1, 2, y2, , n-1, yn-1, n, yn) ,
a set of N training samples of such vectors xj is first
aligned into a common coordinate frame by Procrutes
Analysis [8]. Principal Component Analysis (PCA) [9] is
then performed to build a statistical shape model. The
model of statistical shape variation is, therefore, be
modeled with
where is the synthesized shape, is the mean shape, s is

a set of orthogonal modes of shape variation and s is a
vector of shape parameters vector.
For the purpose of building a statistical model of texture,
each training image is warped to match the mean shape,
using Delaunay Triangulation [10]. A linear transformation
is applied by normalizing the texture vector,
g1, g2,
, gm-1, gm)T. Applying PCA to the normalized texture
vector resulted in a statistical texture model. Hence, the
pattern of intensities of an image patch can be explained
using the model of statistical texture variation in the form
of
In addition to the previous procedure, a linear

correlation between perturbation in model parameters and
the induced residuals is learned in the training stage. As a
result of learning from a-priori knowledge on how to
adjust the model parameters, a rapid convergence during
fitting of the learned model to a new image leads to an
efficient run-time algorithm.
Using the method described above, a model of facial
appearance is built for face tracking purpose. An example
of AAM face tracking for an image is shown in Figure 1.
3. Region of Interest Extraction

Looking at images captured from the top and bottom
cameras as shown in Figure 2 led us to the following
observations. The view from the top camera which the
captured face appears to be looking downwards is in more
resemblance to face-to-face interaction as people often
communicate with their heads slightly tilting downwards.
Conversely, the bottom image may create an unnatural
view because bottom of the nose and jaw of the face can be
noticeably seen. Thus, our proposed method employed top
images as a reference for the synthesized views with eye
regions reconstructed from both cameras.
where is the new texture, is the mean texture, g is a set

of orthogonal modes of texture variation and g is a vector
of texture parameters.
The correlation between both variations is learned to
build a combined appearance model by applying PCA to a
concatenated vector comprised of shape model parameter,
s, and texture model parameter, g. This resulting in the
form of:
where
and
describe the modes of appearance
variation and c is a vector of appearance parameters
controlling both shape and grey-levels of the model. A
photo-realistic image can, thus, be generated for a given
vector, , by forming a synthesized texture, , and then
warping it using landmark points of the new shape, .
Figure 1. Example of face tracking. (a) Image with a

shape model fitted to the face. (b) Corresponding shape
model with 62 landmarks. (c) Corresponding shapefree texture patch.
Figure 2. System configuration. The framework is

formed of two cameras rigidly mounted on the top and
bottom of a camera rig. An illustration of image pair
captured from the cameras is shown side by side.
Due to AAM landmark-based nature, facial features
extraction is in ease by extracting the corresponding set of
indices from the shape model. As the landmarks are
marked on the inner eye contours, these points have to be
expanded as shown in Figure 1. The following steps are
taken to find the ROI of each eye: (i) Compute the
estimated eye center by averaging the set of landmarks. (ii)
Define the boundary points of a ROI by doubling the
Euclidean distance of each landmark to the eye center.
- 767 -
ICEIC 2015
Figure 3. ROIs for an image. (top) Features of the eyes

are represented in landmarks. (bottom) ROIs of both
eyes are bounded by red lines and expanded white dots.
The ROIs for an image is illustrated in the bottom view
of Figure 3 where the eye contour areas are fully enclosed
within the boundary lines. It will be demonstrated later that
gaze correction can be achieved by generating virtual
views in these hexagon-like regions.
4. Head Pose Estimation

In this paper, head pose estimation determines the
correction made to produce gaze corrected views. The
combined used of AAM and POSIT [10] contributed to the
finding of a head model, where the head pose orientation
can be found from three orthogonal axes (i.e. roll, pitch
and yaw). The pitch motion is of this paper interest as the
head pose along the vertical direction is utilized as
weighting factor for alpha blending.
For initialization, a subject is required to fixate the gaze
towards each cameras with head tilted along the direction
as shown in Figure 4. The pitch angle from the top and
bottom camera is computed as minimum head position, ,
and maximum head position,
The weighting factor,
,
which controls alpha blending of the image pair, is defined
as
,
where is the current pitch value and p determines the
decay rate of the exponential function. It was empirically
found that a value of 5 for p achieves the best result.
angle will be used to compute the weighting factor. After

performing histogram specification, alpha blending
algorithm is applied on the ROIs of the image pair.
For the purpose of gaze correction, the weights applied
on the bottom image,
and top image,
is specified by
,
,
where
is the weighting factor which control the
proportions of blending of the image pair, is the distance
between a point,
and the center of ROIs and
is
the maximum distance between the landmarks and
respective ROI centers.
Figure 5. Overview of the proposed algorithm.
With the current implementation on full 1280 x 720
input images on a 3.4 GHz Pentium PC, gaze corrected
video sequences has been produced at 17 frames per
second. Calibration only has to be performed once for a
given camera configuration. The duration of the
initialization process generally does not exceed three
seconds.
Figure 4. Geometrical illustration of pitch movement.
5. Algorithm Overview
The illustration in Figure 5 provides an overview of the
proposed algorithm. The range of head orientation is
determined in the initialization phase. Calibration is then
performed to rectify the image pair so that these images are
places on the same image plane.
The rectified top image will be presented without
alteration when face is not detected in the current image
pair. Otherwise, ROIs from both images is computed based
on the landmarks fitted to the face. Next, the current pitch
Figure 6: Contrast correction. (top) The gaze corrected

views without histogram specification. (middle) The
gaze corrected views with histogram specification
(bottom) The differences between each column views.
Notice that pixel differences with and without contrast
correction is small but significantly affects the
effectiveness of the proposed algorithm.
- 768 -
ICEIC 2015
As illustrates in the top row of Figure 6, the color
contrast between the modified region and the rest of the
image resulted in unnatural outcomes. A practical solution
is to bring the difference of color contrast of the ROIs
between the top and bottom images to the minimum, by
incorporating histogram specification, designed to alleviate
the illumination contrast before the alpha blending
algorithm. As a result, the difference in color contrast of
the ROIs with the surrounding is visibly reduced, leading
to prominent eye views.
Figure 7: Comparison of gaze correction. (top) Gaze

correction invariant to head pose orientation. (middle)
Gaze corrections with head pose estimation. (bottom)
The differences between the column views.
A comparison between weighted and constant alpha
blending algorithms is made as shown in Figure 7. The
leftmost view in the top row illustrated an apparent
synthetic outcome when the subject gazing towards the
camera direction. Compared to the weighted gaze
corrected view in the middle row, the eyes appeared not
proportion in size with unnatural upper eye lids. On the
contrary, the middle row shows a series of natural gaze
corrected eye views, indicating an improvement to the
existing method.
Table 1: Score results from 10 subjects
Subject
Score
1
9
2
10
3
8
4
6
5
10
6
9
7
7
8
9
9
8
10
10
Average
8.6
To evaluate the performance of the proposed gaze

correction algorithm, an experiment is conducted where 10
subjects are required to observe their gaze corrected video
streams and give a score from 0 to 10 with higher score
denoting more satisfactory result. The results are
promising, yielded an average score of 8.6 as shown in
Table 1.
7. Conclusion
A real-time gaze correction algorithm is proposed to
address the limitations arisen from the offset between the
position of a camera and the monitor screen. By using head
pose estimation as a weighting factor on the extent of gaze
correction, alpha blending algorithm is implemented on
images pairs acquired from top and bottom cameras. The
proposed method presented refined and realistic gaze
corrected views, successfully attained the goal to maintain
eye contact during communication.
Figure 8: Example of gaze correction. (top) Rectified

top input images. (middle) Gaze corrected output
images. (bottom) Rectified bottom input images. The
resulting algorithm, weighted alpha blending algorithm,
demonstrates results where the gaze corrected ROIs
fitted seamlessly into the images as shown in the middle
rows.
References
[1] Yip, B., and Jin, J.S., An Effective Eye Gaze Correction
Operation for Video Conference using Anti-Rotation Formulas,
In Proc. Of the 2003 Joint Conf. of the Fourth Int. Conf., pp. 699703, December 2003
[2] Wolf, L., Freund, Z., and Avidan, S., An Eye for An Eye: A
Single Camera Gaze-Replacement Method, In IEEE Conf. on
Computer Vision and Pattern Recognition, pp. 817-824, June
2010
[3] Waizenegger, W., Atzpadin, N., Schreer, O., Feldman, O.,
and Eisert, P., Model-Based 3D Gaze Estimation For Provision
of Virtual Eye Contract, In 19th IEEE Int. Conf. Image
Processing, pp. 1973-1976, October 2012
[4] Yang, R., and Zhang, Z., Eye Gaze Correction with StereoVision for Video-Teleconferencing, In Proc. 7th Europ. Conf. on
Computer Vision, pp. 479-494, May 2002
[5] Criminisi, A., Shotton, J., Blake, A., and Torr, P.H.S., Gaze
Manipulation for One-to-One Teleconferencing, Proc. Ninth
IEEE Int. Conf. on Computer Vision, pp 191-198, October 2003
[6] Edwards, G.J., Taylor, C.J., and Cootes, T.F., Interpreting
Face Images using Active Appearance Models, In Proc. Third
IEEE Int. Conf. on Automatic Face and Gesture Recognition, pp.
300-305, April 1998
[7] Dementhon, D.F., and Davis, L.S., Model-Based Object
Pose in 25 Lines of Code, In Int. Journal of Computer Vision, pp.
123-141, June 1995
[8] Goodall, C., Procrutes Methods in the Statistical Analysis of
Shape, In Journal of the Royal Statistical Society B, pp. 285-389,
1991
[9] Harold, H., Analysis of Complex Statistical Variables into
Principal Components, In Journal of Educational Psychology,
pp. 417-441, September 1933
[10] Shewchuk, J.R., Triangle: Engineering a 2D Quality Mesh
Generator and Delaunay Triangulator, In First Workshop on
Applied Computational Geometry, pp. 203-222, May 1996
[11] Martins, P., and Batista*, J., Accurate Single View ModelBased Head Pose Estimation, FG 08.8th IEEE Int. Conf. on
Automatic Face & Gesture Recognition, pp. 1-6, September 2008
- 769 -
P5-26
Development of a Red Apple Counting Algorithm Based on Apple Tree

Recognition
Donggi Kim, Hongchul Choi, Jaehoon Choi, Seong Joon Yoo, Dongil Han*
Department of Computer Engineering, Sejong University
s14110235@sju.ac.kr, maltessfox@sju.ac.kr, s041735@sju.ac.kr, sjyoo@sejong.ac.kr,
dihan@sejong.ac.kr
Abstract
This study proposes an algorithm for recognizing apple
trees in image and detecting apples to measure the number
of apples on apple trees. The proposed algorithm explores
whether there are apple trees based on the number of
image block-unit edges and then detect apple areas. In
order to extract colors appropriate for apple areas, CIE
L*a*b* color space was used to extract colors. In order to
extract apple characteristics strong against illumination
change, modified census transform (MCT) was used. Then
using AdaBoost Learning algorithm, characteristics data
on apples were learned and generated. With generated data,
detection of apple areas was made. The proposed
algorithm had a higher detection rate than existing pixelbased image processing algorithms and minimized false
detection.
Keywords: Crop yield estimation, Image segmentation,
Apple tree detection, Apple detection, Object detection
1. Introduction
In the area of evaluation of crops related to disasters,
humans have manually assessed the number of crops. As a
result, a lot of costs and time are incurred and the problem
of preciseness of evaluators has led to emergence of the
issue of fairness. However, image processing and machine
vision technologies have been developed and are presented
as alternatives for such problems. Most previous studies of
fruit area detection thus far have used pixel-based image
processing techniques to detect fruit areas and counted the
number of detected areas [1, 2, 3].
This study analyzed the shapes of apple trees with
edge-based preprocessing process and judged whether
there were apple trees, thereby recognizing apple trees.
The system in this study was designed as a structure to
detect apples on apple trees using learned data on apples
through AdaBoost Learning. When detecting apples on
apple trees, diverse detection errors occur unlike existing
object detection. Examples of apple detection errors

include detection errors from other objects with colors
similar to those of apples, fruit area detection errors
resulting from reflection of apples by a light source or their
shadows, and failure to detect fruits covered by other
objects such as leaves. This study extracted colors
appropriate for apple areas through CIE L*a*b* color
space in order to minimize errors detecting objects with
colors similar to those of fruits.
This study proposed an apple detection system
effective for illumination change by extracting information
on objects textures with MCT which reduced effects by
illumination change in order to prevent detection errors
from occurring by a light source.
2. Apple Detection Algorithm

2.1. Recognition of Apple Trees
Existing apple recognition systems had a problem of
false recognition by performance of detection algorithm
even though the input image was not apple trees.
In order to resolve such false detection and the problem
of un-focusing by camera, this study divided input image
into block units with preprocessing stage, extracted the
number of edges for each block, and judged whether they
were tree bocks. Apple areas had a smaller number of
edges than tree areas. There may be empty spaces within
tree areas and therefore the empty spaces were filled.
Finally, when tree candidate blocks have certain
percentages, they are judged as trees. Experimentally, 50
and 120 were applied to Th1 and Th2, respectively.
The proposed algorithm is described in Figure 1.
2.2. CIE LAB Color Space Analysis
In order to precisely detect apples from image, apple
areas and background areas should be clearly classified.
Accordingly, diverse color space models (RGB, HSI, and
CIE L*a*b*) were comparatively analyzed in order to
* Corresponding Author : Dongil Han(professor, Sejong University)
- 770 -
ICEIC 2015
examine color range appropriate for apple areas. Among
them, CIE L*a*b* color space similar to human
visualization model most clearly classified apples and
background areas. Using the L*, a*, and b* condition of
CIE L*a*b* color space, color range of red apple areas
was defined. Color ranges under the defined condition are
as follows.
According to the result of comparing existing research [1]

and the proposed apple detection system, the system
proposed by this paper had a higher detection rate by about
3.5% and its false detection was considerably reduced, as
shown in the table 1.
Table 1: Comparison of Results from an Existing
Method and the Proposed Method
0 L* 100
(1)
25 a*80
0 b* 60
No. of
images
No.
of
fruits
30
502
Ref[1]
Detection
False
rate, %
detection
77%
143
Proposed
Detection
False
rate, %
detection
80.68%
18
4. Conclusion
An existing apple detection algorithm was analyzed to
result in very high false detection rates due to colors
similar to those of apples, light sources, and shadows.
In order to solve these problems occurring during apple
detection, this study developed an apple detection
algorithm which can improve detection rates and also
drastically decrease false detection compared to existing
research.
This algorithm was to recognize apple trees first with
preprocessing
stage,
extract
appropriate
colors
corresponding with apple areas, conduct MCT, and use
AdaBoost Learning algorithm.
Figure 1: An Algorithm for Apple Tree Recognition
5. Acknowledgement
Figure 2: Apple and Background Areas in RGB,

HIS, CIE, and LAB Color Spaces
2.3. MCT
When MCT is applied to apple areas extracted from the
input image in order to minimize false detection due to
apple areas being reflected by a light source or covered by
shadows, effects of a light source are minimized and only
texture information on apple areas can be extracted.
(a)
(b)
(c)
(d)
Figure 3: MCT of Two Images with Different

Illumination Conditions : (a) Input Image 1 (b) Image 1
after MCT (c) Input Image 2 (d) Image 2 after MCT
3. Experiment
Apple detection performance was verified using about
30 apple images under diverse environments such as
different size and colors of apples and light sources.
This work was supported by a National Research

Foundation of Korea Grant funded by the Korean
Government (No. 2012-007498), also supported by the
ICT R&D Program of MSIP[I0114-14-1016, Development
of Prediction and Response Technology for Agricultural
Disasters Based on ICT] and the Creative Vitamin Project.
References
[1] Hanbyul Yeon, SeongJoon Yoo, Dongil Han, Jinhee Lim,
Automatic Detection and Count of Apples Using N-adic
Overlapped Object Separation Technology, Proceeding of
International Conference on Information Technology and
Management, November 2013.
[2] Qi Wang, Stephen Nuske, & Marcel Bergerman, E.A., Design
of Crop Yield Estimation System for Apple Orchards Using
Computer Vision, In Proceedings of ASABE, July 2012.
[3] Raphael Linker, Oded Cohen, Amos Naor, Determination of
the number of green apples in RGB images recorded in
orchards, Journal of Computers and Electronics in
Agriculture, pp. 45-57 February 2012.
[4] Y. Song, C.A. Glasbey, G.W. Horgan, G. Polder, J.A. Dieleman,
G.W.A.M. van der Heijden, "Automatic fruit recognition and
counting from multiple images", Journal of Biosystems
Engineering, pp.203-215 February 2013.
- 771 -
P5-27
Fast Stream Switch Method for Real-time Transfer Protocol

Daehyun Pak, Seongwan Kim, Kyungmin Lim, Changhyun Park and Sangyoun Lee
School of Electrical & Electronic Engineering at Yonsei University
{koasing, knauer, lkm1216, qkrckd2002, syleee}@yonsei.ac.kr
Abstract
With development of high speed wireless network
technology, Video-on-Demand (VoD) service is spread
widely. During VoD service, bit stream change may be
occurred, causing large delay of audio-video playback.
To reduce delay, a low-delay Real-time Transfer
Protocol bit stream change method has been proposed.
In this paper the method is modified to have a
backward compatibility with traditional RTP systems
while maintaining its performance.
Keywords: Video Streaming; Real-time Transfer
Protocol; Fast Stream Switch; H.264/AVC.
1. Introduction
With development of high speed wireless network
technology including Long Term Evolution and Mobile
WiMAX, mobile broadcasting market is growing
rapidly. Catching up with this trend, Video-on-Demand
service is also spread widely.
During Video-on-Demand service, bit stream switch
may be occurred due to network congestion, packet
error, user request or other reasons. In traditional Realtime Transfer Protocol system, whole network setup is
processed to handle these bit stream switch, causing
large delay of audio-video playback. The playback
delay reduces user comfortableness, therefore it is
encouraged to reduce the bit stream switch delay.
Previous work [1] has been proposed for low-delay
RTP bit stream change method. In this paper, the
method is modified to have a backward compatibility
with traditional RTP system. Then the proposed system
is evaluated and concluded.
video bit stream. RTP header fields provide useful

features for real-time streaming. For example,
Timestamp is used for synchronizing multi streams.
RTP provides flexible and extensible payload
adaptation using customizable PayloadType field in its
header. PayloadType field determines how payload
field is interpreted. The PayloadType values and
payload field structure of some common codecs are
defined in [3], and those of H.264/AVC is defined in
[4]. The values in range of 96 to 127 may be used to
stream data with user-defined structure.
RTP only describes how to deliver bit stream from
server to client. It does not provide any method to
control RTP session itself. To control RTP session,
server and client should establish other control channel.
Real Time Streaming Protocol (RTSP) [5] is widely
used for control channel, and user-defined data session
is applicable.
3. Proposed Method
When bit stream change occurs during audio-video
playback, traditional RTP system stops and runs whole
network setup process. These processes may be omitted
by exploiting RTP PayloadType field.
2. Real-time Transfer Protocol

Real-time Transfer Protocol (RTP) [2] is widely
used to stream audio and video data over the internet.
RTP defines common packet format for audio and
- 772 -
Before a RTP session is open, the server and

the client establishes a control session.
Through the control session, the server and the
client may check whether the proposed
algorithm is applicable, but it is not an essential.
After the RTP session is established, the server
and the client may request for stream switch to
each other. While keeping current RTP session,
the server and the client establishes a new RTP
session in background. The client keeps local
PayloadType database and decoder instance
map. Detailed process is shown in Fig. 1.
On successful setup, the stream is switched
without large delay and old RTP session is
closed safely.
ICEIC 2015
Fig. 1. Flowchart of Proposed Method

RTP session is measured. Total 100 trials are measured
and the delay is 75.55ms on average.
10
9
8
7
6. Conclusion
Count
6
5
In this paper, a fast stream switch

proposed. Previous work is modified
backward compatibility. The proposed
compatible with traditional RTP server
while maintaining its performance.
4
3
2
1
0
50
60
70
80
90
100
Delay (ms)
Fig. 2. Histogram of the delay
method is
to have a
method is
and client,
Acknowledgement
4. Backward Compatibility
It is not always guaranteed that both the server and
the client implement the proposed method. There are
two possible scenarios. First, the client implements
proposed method but the server doesnt. This is trivial
case because the client can works as traditional decoder.
Second, the server supports the proposed method
but the client doesnt. At the stream switch situation,
the server tries to send a request to client, but the client
cannot understand it therefore the client ignores it. The
server waits for the clients reply, consequentially it
times out. Finally the server stops the streaming and
begins whole network setup process as traditional
encoder.
The proposed system is implemented on the
Android device. Control session is implemented using
RTSP. The server and the client are connected within a
single WiFi network. Time delay between the last
frame of old RTP session and the first frame of new
This work has been supported by Institute of BioMedIT, Energy-IT and Smart-IT Technology (BEST), a
Brain Korea 21 plus program, Yonsei University
References
[1] D. Pak, S. Kim, K. Lim and S. Lee, Low-Delay Stream
Switch Method for Real-Time Transfer Protocol, Consumer
Electronics (ISCE 2014), The 18th IEEE International
Symposium on, pp.1,2, 22-25 June 2014
[2] H. Schulzrinne, S. Casner, R. Frederick and V. Jacobson.
RTP: A Transport Protocol for Real-Time Applications
[Online]. 2003, July.
Available: http://www.ietf.org/rfc/rfc3550.txt
[3] H. Schulzrinne and S. Casner. RTP Profile for Audio
and Video Conferences with Minimal Control [Online].
2003, July. Available: http://www.ietf.org/rfc/rfc3551.txt
[4] S. Wenger, M.M. Hannuksela, T. Stockhammer, M.
Westerlund and D. Singer. RTP Payload Format for H.264
Video [Online]. 2005, February.
[5] H. Schulzrinne, A. Rao, R. Lanphier. Real Time
Streaming Protocol (RTSP) [Online]. 1998, April.
- 773 -
P5-28
Depth
h Reliabilitty Measurrement forr Vehicle Stereo
S
Vision
Jaesu
ung Kim, Chhanghyun Paark,Junghyunn Kim and Sangyoun
S
Leee
D
Dept.
of Electrical and Electronic
E
E
Engineering,
Yonsei Univversity, Seouul, Korea
tusltifid@
@yonsei.ac.kkr,qkrckd20002@yonsei.aac.kr, jhkim__1012@yonssei.ac.kr,syleeee@yonsei.ac.kr
Ab
bstract
As the car
c spreadwid
dely, the imporrtance of driveers
and pedestrians safety is
i higher. Therre were alreaddy
many counntries where the vehicle equipped with a
vision systtem for Advancced Driver Asssistance System
ms
(ADAS) iss compulsory.. In the earlly day, vehiccle
detection and pedestria
an detection using a singgle
camera waas developed. Various methoodsusing stereeovision systtem have been
n studied nowaadays to preveent
accidents by detecting
g all objects with potentiial
r
However,, in the case of applicationns
collision risk.
using stereeo vision, the quality of deppth image is not
n
stable becaause of the matter
m
of data acquisition raate
and enviroonmental noise..
In thiss paper, we proposed Deepth Reliabiliity
Measurement (DRM) th
hat can improve the previouus
works whicch estimate thee road and minimize the erroor
rate of obsstacle detection
n.
o of the exprression of 3D data

d transform
med the
[2]is one
dense stereo into recttangular surfacce map.
All algorithms deescribed abovee were includeed the
assumpption that the depth image was quite acquired
exactlyy. If there is a problem wiith the depth image
causedd by environmeent and internaal defective of stereo
matchiing algorithm,, these approaaches were worked
w
ineffecctively.
In this
t
paper, we recognized thhe problems thhat can
occur when the depth
d
image has problemss and
propossed Depth Relliability Measuurement (DRM
M) that
can bee used for stochhastic approacch of next proccess in
obstacle detection.
n, Depth Reliaability
Keywordss: Stereo Vision
Measurement, ELAS, .en
npeda.. Database
1. Introd
duction
o ADAS, thee camera shouuld
In a larrge category of
have becom
me integral paart for protection of drivers as
well as peedestrian. With
h advances in camera sensinng
and patterrn recognition
n technologiees, vehicle annd
pedestrian detection usin
ng monocular vision
v
have beeen
mely active ressearch area inn the intelligeent
an extrem
vehicles. But,
B it was harrd to estimate the distance of
frontal obsstacle and hav
ve low detection rate. In thhe
field of veehicle industry,, it was also diifficult to acceept
on accountt of the high saafety standard.
In a recent years, a lot of researchers spotlighteed
f
solving these
t
problem
ms.
stereo vission system for
Typically, there was Daimlers
D
Stixxel[1] algorithhm
t form of veertical bars eveery
which wass expressed in the
obstacle acccording to sep
parate obstaclee boundary froom
road regioon. And the Digital
D
Elevatioon Map (DEM
M)
Figuure 1. 3D Geom
metry informatiion in stereo viision
( depth image
(a)
( Virtual imagee
(b)
Figure 2. Virtuual image from

m stereo vision
2. Virrtual Imagee Generation

n
t technical siide, the advanttages of stereo vision
In the
system
m were possible to obtain lefft and depth im
mageat
the sam
me time. Leftt and right im
mages were acquired
- 774 -
ICEIC 2015
from the each

e
camera, but
b depth imagge was obtaineed
from the stereo matching algorithmss using both of
o depth that is exactly whethher
them. Thuss, the quality of
or not can decide using left image. Figuure 1 shows thhat
ormation in sttereo vision annd
3D stereo geometry info
i
in stereeo
Figure 2 depicts depth and virtual image
he geometric transform,
t
deppth
vision systtem.Through th
image channged in virtual image. Previoously, this virtuual
image cooncept was used for stereo-analyssis
evaluation[3]. Taking the gain to
t
reduce thhe
computatioonal complexitty, we concenttrated on not thhe
prior but posterior processs.
3. Depth
h Reliability
y Measurem
ment
Figure 3. Deppth Reliability Measurement

M
w calculate thhe
As measurement of reliability we
Normalized Cross Correelation (NCC) metricsbetweeen
mage and thee virtual image foreachpixxel
the left im
intensity. The
T NCC is giv
ven by
,
1
| |
Ackn
nowledgemeent
Thiis work has been supportted by Instituute of
BioMeed-IT, Energyy-IT and Sm
mart-IT Technnology
(BEST
T), a Brain Korea
K
21 pluus program, Yonsei
Y
Univerrsity
Referrences
where and denote the means, and
a
and thhe
d
of each images. The set is a
standard deviations
subset of all
a pixel locatio
ons. It needs too be removed by
b
pixels haviing 0 intensity value of the deepth image.
4. Evaluation
In ordeer to evaluate the performannce of proposeed
algorithm, we used set 11 (wiper) stereeo images of thhe
Middleburry stereo websiite [4] and following computter
specificatioons (Intel core
c
i5 2500
2
CPU 3.330
GHz .3.600 GHz, RAM 4GB, 32 bit Window
W
7). We
W
choose wiper
w
sequencce representedd one of thhe
particular challenging scenarios.
s
In this paper we
w
pth image for stereo
s
matchinng,
obtained a generative dep
AS (Efficient Large-scale
L
Steereo) [5], whicch
called ELA
allows low
w computationaal complexity.
Figure 3 shows how the
t DRM welll represented thhe
state of unccertainty.
[1] Baddino, Hernn, Uwe

U
Franke, andd Rudolf Mesterr. "Free
space computation ussing stochastic occupancy gridds and
dynamiic programmingg." Workshop on
o Dynamical Vision,
ICCV, Rio
R de Janeiro, Brazil.Vol.
B
20. 2007.
2
[2] Oniga, Florin, andd SergiuNedevscchi. "Processingg dense
stereo data
d
using elevaation maps: Roaad surface, trafffic isle,
and obstacle
o
detecttion." Vehicular Technology, IEEE
Transactions on 59.3 (22010): 1172-11882.
[3]
Morales,
Sanndino,
Simonn
Hermann,
and
world
stereo-aanalysis
ReinhardKlette. Real-w
evaluattion.Springer Beerlin Heidelberg,, 2012.
[4]enpeeda.. (Environment Perception and
a Driver Assistance)
project,, The Universiity of Aucklandd, EISATS (.ennpeda..
11,
Sequennce
Analysis
Test
Site),
Set
http://w
www.mi.aucklannd.ac.nz/EISATS
S,
retrieved
2011
[online].
U
[5] Geeiger, Andreas, Martin Roser, and Raquel Urtasun.
"Efficieent large-scale stereo matchinng." Computer Vision
V
ACCV 2010.Springer
2
B
Berlin
Heidelbergg, 2011.25-38.
5. Conclusions
M method for outdoor vehiccle
We prooposed the DRM
stereo vision. This metriics used to minimize the fallse
positive obbstacle detectio
on and improvve previous roaad
estimation methods. By extension, it can be used for
f
t
frame hav
ving lots of errors value in
skipping the
obstacle traacking.
- 775 -
P5-29
Palmprint Recognition for Mobile Devices

Jin Su Kim, Jaihie Kim
School of Electrical and Electronic Engineering, Yonsei University,
Biometrics Engineering Research Center
jinsukim@yonsei.ac.kr, jhkim@yonsei.ac.kr
2. Proposed method
Abstract
For the protection of information stored in mobile
devices, palmprint recognition is considered one of the
effective solutions because palmprint image can be
easily captured using the built-in camera of the mobile
devices. In this paper, a hand-shaped guide window
based palmprint recognition method for mobile devices
is proposed. With the use of the guide window, fast
image acquisition and region of interest (ROI)
extraction methods are proposed. Also, to cope with
the slight variation in ROI images, block-level
orientation feature is proposed. A mobile palmprint
database was constructed using Samsung Galaxy S3
for the experiment and the matching performance of
the proposed method showed the equal error rate
(EER) of 2.88%.
Keywords: Palmprint recognition, mobile, biometrics,
Image processing
1. Introduction
Security of the personal information stored in mobile
devices is an increasing concern and palmprint
recognition is one of the solutions for it as the images
of user's hand can be easily captured using the
embedded camera of the mobile device. Compared to
the traditional touch-based palmprint recognition [1
5], mobile palmprint recognition is much complicated
because hand images are captured in an uncontrolled
environment. Consequently, there are following
difficulties in mobile palmprint recognition: limited
processing power, various hand pose, and complex
background. In this paper, by using a hand shaped
guide window, hand pose variation is reduced and hand
images are rapidly captured in video mode. To extract
ROI from the palm, two valley points in between
fingers are located rapidly by the proposed valley point
detection method. Block-level orientation code is
proposed to compensate slight translation in ROIs.
2.1 Profile line based fast image acquisition and

ROI extraction methods
In the fast image acquisition, a hand-shaped guide
window is provided on the screen of the mobile device
as in Fig 1 (a). The guide window restricts hand pose
variation and the hand image is automatically captured
in video mode when the hand is fitted to the guide. The
position of a hand is evaluated by the hand check
algorithm which checks the profile lines in two valley
areas. Firstly, user specific YCbCr skin-color is
extracted from the center palm region in Fig.1 (a). Two
profile lines, top and bottom profile lines, are drawn
near two valley areas and each pixel on the profile lines
are classified into skin and non-skin pixel by measuring
the Euclidean distance between the pixel's YCbCr
value and the user specific YCbCr value. Ngs adaptive
thresholding method [6] is employed to find a threshold
to classify skin and non-skin pixels. Example of a
profile signal is in Fig 1 (c). If following two
conditions are satisfied, the image is considered to have
a properly placed hand.
1. Each top profile line signal should show skin
backgroundskin pattern
2. All the pixels in each bottom profile line should
be skin pixels.
(a)
(b)
(c)
Fig. 1. Guide window and profile signal (a) guide
window (b) profile line in red (c) profile signal
To obtain the ROI, two valley points are detected by
using multiple profile lines in the valley area as in Fig 1
(b). A pair of finger contour points is obtained on each
- 776 -
ICEIC 2015
profile line by using the Ngs adaptive thresholding
method. Midpoints of all contour pair are used to find
the line crossing the valley point between two fingers.
The signal on this line is again used to locate the valley
point by using the Ngs method. ROI is extracted in the
central area of the palm by referring two detected
valley points.
2.3 Block-level orientation feature
The orientation information of a palmprint was first
used by Kong in the competitive code [3]. The
orientation of palmprint is extracted and compared in a
pixel level and it showed a promising performance. For
mobile palmprint images, which contain relatively
larger amount of translation and rotation, pixel level
feature extraction method is not suitable and blocklevel orientation feature is proposed. In the proposed
method, each pixel in the ROI is filtered by using
Gabor filters with six different orientations and the
orientation of the pixel is decided by the competitive
rule [3]. If a Gabor filter response at a sample point is
too small, that pixel is defined to have no orientation.
The ROI region of a palmprint image is divided into
8x8 sub-blocks and the orientation histogram of each
block is used as a feature. Orientation histogram of
each block is then concatenated to be a feature vector.
Such block-level feature is suitable for mobile
palmprint recognition which contains slight translation
and rotation. A ROI image, orientation map, and
extracted feature from one sub-block are shown in Fig.
4.
palm. Verification performance is measured by equal

error rate (EER) and the proposed system was able to
show the EER of 2.88%. The performance of the
previous pixel-level palmprint orientation feature
extraction methods [3], [4] on the constructed mobile
palmprint DB was also measure for comparison.
Table 1: Verification Performance
Compcode OLOF
Proposed
Method
Mobile DB 6.14%
5.14%
2.88%
Database
4. Conclusion
In this paper, we propose novel palmprint
recognition method for mobile devices. By providing
the hand-shaped guide window, hand pose variation is
restricted and hand images can be captured rapidly.
Also, valley points are detected rapidly by multiple
checking profile lines only in the valley area of guide
window. Block-level orientation feature compensates
slight distortions in ROI images caused by valley-point
variation. We constructed mobile palmprint DB using
Samsung Galaxy S3 and EER of 2.88% was achieved.
Acknowledgement
This work has been supported by Institute of
(BEST), a Brain Korea 21 plus program, Yonsei
University.
References
300
250
Number of Pixels
200
150
100
50
Orientation
(a)
(b)
(c)
Fig. 2. (a) Original ROI image (b) orientation map
and sub-block division (c) histogram feature from a
sub-block
3. Experiment
For the experiment, a mobile palmprint database is
collected by using a Samsung Galaxy S3. The database
consists of 8754 images from 120 hands and the hand
images are acquired with uncontrolled background and
hand posture. Embedded LED light is turned on to
provide the illumination. For verification, 1 palmprint
image is registered as a template image and compared
with the rest of the palmprint images. The matching is
regarded as genuine if both images are from the same
[1] D. Zhang, A. Kong, J. You, and M. Wong, Online

palmprint identification, IEEE Trans. Pattern Anal.
Mach. Intell., vol. 25, no. 9, pp.10411050, Sep. 2003
[2] X. Wu, D. Zhang, and K. Wang. "Palm line extraction
and matching for personal authentication." Systems, Man and
Cybernetics, Part A: Systems and Humans, IEEE
Transactions, vol. 36, no. 5, pp. 978-987, 2006
[3] Adams Wai-Kin Kong et al, "Competitive Coding
Scheme for Palmprint Verification", ICPR, 2004
[4] Sun et al, Ordinal Palmprint Representation for Personal
Identification, Proceedings of IEEE International
Conference on Computer Vision and Pattern Recognition,
Vol.1, 2005,
[5] Z. Guo, D. Zhang, W. Zuo, Palmprint verification using
binary
orientation
co-occurrence
vector,
Pattern
Recognition Letters, Volume 30, Issue 13, pp 12191227,
Oct. 2009
[6] Hui-Fuang Ng, "Automatic thresholding for defect
detection", Pattern Recognition Letters, Volume 27, Issue 14,
Pages 16441649, Oct. 2006
- 777 -
P5-30
Multi Feature Concatenation for Human Face Recognition

Jaesung Choi, Yuseok Ban, Hanbyeol Bae, Minkyu Lee, and Sangyoun Lee
School of Electrical & Electronic Engineering, Yonsei University
E-mail address : {ciyciyciy, van, ygbgamily00, minkyulee, syleee}@yonsei.ac.kr
Abstract
Recognizing a human face is very important issue in
computer application. To increase the performance,
innumerable research has been extensively studied.
Above all discriminant feature selection is the most
important process in face recognition system. In this
paper, we proposed a recognizing method by
concatenating pre-existing face descriptors on featurelevel. Our experimental result shows interesting results
about the recognition rate.
Keywords: face recognition, principal component
analysis
1. Introduction
Face recognition has been extensively researched in
the field of computer vision. Above them, effective
face feature extraction is one of key the issue in face
recognition. Among various studies, the appearancebased approaches added a new page to the history of
face recognition field. The traditional principal
component analysis (PCA) algorithm which uses
eigenface is one of the most famous methods [1].
However, the pixel intensity of PCA algorithm has
several limitations that it is sensitive to variations of
brightness and orientation.
To overcome conventional weaknesses, various
feature descriptors were developed. In recent years,
local binary pattern (LBP) [2] and histogram of
oriented gradient (HOG) [3] have been widely used to
represent human information. In comparison with pixel
intensity, these have many advantages about an
orientation and external light variations. Since the
traditional feature has only texture information.
In this paper, we proposed a new multi feature
combination method to overcome the mentioned
problem. We analyzed various feature-level
combinations for face recognition task. The
dimensions of each concatenated feature are reduced
using PCA. Consequently, discriminability is also

enhanced.
In Section 2, proposed method is described in detail.
The simulation result and conclusion will be described
in Section 3 and 4, respectively.
In Section 2, we describe the process of our face
recognition approach.
Our proposal face recognition method can be
divided into two steps, feature extraction, feature
concatenation. Before extracting face features, we
normalized the image size to 50x50. In sequence, the
pixel intensity, LBP and HOG feature were extracted
from normalized image for concatenation. In Figure 1,
we selected 5 radius of LBP and 2x8 HOG cell size
after the several experiment.
(a)
(b)
Figure 1. The rank curve with variations of LBP radius
(a) and HOG cell size (b)
Next, the calculated vectors was concatenated each

other on feature-level. Since the number of extracted
feature vector is three, the total number of cases of
combination is twelve. In this study, we just consider
four cases shown in Figure 2.
Finally, we adopted PCA to reduce the feature
dimension and enhance discriminant level. Because
extracted face feature descriptors have high
dimensionality, there is a need to minimizing the
overfitting problem.
- 778 -
ICEIC 2015
experiment, we founded that a part of our proposal

method was accuracy than existing methods.
In conclusion, our results provide engineers with
informative guidelines to research a face recognition
system. As future work, we will conduct recognition
test with a multi-feature combination at score level.
Acknowledgement
This work has been supported by institute of
(BEST), a Brain Korea 21 Plus Program, Yonsei.
University.
References
Figure 2. Our proposed feature-level combinations
To evaluate our approach, the AT&T database [4]
composed of 400 images of size 112x92 is used in a
3.4 GHz CPU and 16.00GB RAM.
The recognition result in Figure 3 shows accuracy
of our proposal method. Compared to the single
feature, our proposal concatenated feature produce
similar effects except some case.
[1] Turk, Matthew, and Alex Pentland. "Eigenfaces for

recognition." Journal of cognitive neuroscience 3.1 (1991):
71-86.
[2] Ahonen, Timo, Abdenour Hadid, and Matti Pietikainen.
"Face description with local binary patterns: Application to
face recognition." Pattern Analysis and Machine Intelligence,
IEEE Transactions on 28.12 (2006): 2037-2041.
[3] Dalal, Navneet, and Bill Triggs. "Histograms of oriented
gradients for human detection." Computer Vision and Pattern
Recognition, 2005. CVPR 2005. IEEE Computer Society
Conference on. Vol. 1. IEEE, 2005.
[4] ORL Face Database, AT&T Laboratories Cambridge,
http://www.cl.cam.ac.uk/research/dtg/attarchive/facedatabase
.html, 2005.
Figure 3. Comparative results with traditional and our

proposal methods
As we expected, the recognition result was best when

pixel intensity is used in combination with HOG. Since
the orientation information of HOG complements
texture information of pixel intensity. On the contrary
to this, we confirm that several cases lead to decrease a
face recognition performance.
4. Conclusion
This paper suggests a new feature extraction
method for human face recognition. After the
- 779 -
P5-31
Online Gesture Recognition Using Template Matching Method with Particle

Swarm Movement
Clementine Nyirarugira and Tae Yong Kim,
Graduate School of Advanced Imaging Sciences, Multimedia and Film,
Chung-Ang University, Seoul, South Korea.
rugiracle@cau.ac.kr, kimty@cau.ac.kr
Abstract
In this paper, we present an online dynamic gesture
recognition method derived from particle swarm
movement and template matching method for free-air
hand gesture recognition. The proposed method has a
promising recognition rate of 97.62% on pre isolated
gestures and 93% on stream gestures. It requires less
computation time which makes it a good candidate for
real time application.
Keywords: vision-based gesture recognition, template
matching, particle swarm optimization, HCI.
trajectory, by grouping together identical successive

quantized angles. MDSs are robust to variation in
gesture size and speed [1], which allows performing
gestures at variable speed.
Given samples from the same gesture category,
templates are generated by computing MDS for all
samples, aligning them, and then representing each
structure by one template, refer to Fig. 1, for an
example of resulting templates for digit 2.
1. Introduction
Vision based hand gesture systems offer attractive
human computer interfaces (HCI) due to their noncumbersome and natural way of interaction. In vision
based HCI, a camera device is used to acquire data. A
gesturing object such a hand is then segmented from
the rest of the image. Dynamic hand gestures encode
information by temporal trajectories [1]. A performed
trajectory is assigned to one of gesture categories in the
vocabulary, by a recognition algorithm. When a gesture
is recognized, the corresponding description is used to
relay a command.
In this paper, we adopt particle swarm optimization
(PSO) to the problem of gesture recognition. PSO is a
pattern search method [2]. In general, a PSO algorithm
is initialized with a group of N particles. Each particle
is characterized by its personal best position, which is
updated according to its fitness value (likelihood).
Within the gesture recognition context, we assign a
particle to each gesture template and allow it to evolve
through a deterministic matching process.
2. The proposed method

In this paper, gestures are represented by motion
direction segments (MDS) generated from 2D hand
Fig. 1. Templates of the digit 2 gesture

We apply the PSO as follows: given a gesture
vocabulary represented by a set of templates , i.e. the
solution space, and a trajectory to be classified,
represented by 1 ,...,T , the recognition process
is performed as follows:
(a) Initialize particles personal best positions,
i
Pbest Pbest
0
i 1
; where L 1,..., : # of particles
(b) Matching and personal best update

if T i i ; i L, T i , 1: T
P
best
i
Pbest
i
Pbest
1;
T i0
(c) The recognized gesture is then

Gbest
i
i0 arg max F Pbest
i
T i0
T
The fitness value should be above some predefined

threshold . The Pbest position in (1) depicts the
position of a particle within the template. The
movement of particles is local. The Pbest is updated
only when there is a match. The recognition is done
- 780 -
ICEIC 2015
using (2) to increase inter class separability. Notice that
we perform a segment matching instead of point
matching.
3. Experiment
To evaluate the performance of the proposed
method, we collected gestures video clips at 30 FPS
using Kinect v1, from five people, drawing in the air
digits 1~9 and nine HCI gestures, see Fig. 4. There
was no restriction made on gesturing speed or size.
Each video contains ten or more gestures. A gesturing
hand is segmented from the rest of the image by
thresholding depth histogram.
Next, we perform experiments on stream gestures.

Depth profile is used as an indicator of gesture
temporal segmentation; the resulting gesture segment
may have boundary noise (pre and post gesture
motions). The recognition rate on stream data drops
due to boundary noise. The LCS achieves a recognition
rate of 90.93% and the proposed achieves 92.64% on
digit gestures. Nevertheless, on a less correlated
gesture vocabulary (HCI dataset), LCS (96.11%)
outperforms the proposed (93.33%), as seen in Fig. 5.
Fig. 4. HCI gestures
Fig. 2. Recognition of pre-isolated digits gestures
Fig. 5. Recognition rate on stream HCI gestures
A 2-fold cross validation was performed. We use

the longest common subsequence (LCS) as a baseline.
We also implemented discrete HMM using Left to
Right topology and the number of states was set to the
number of MDSs. Fig. 2 shows results on pre isolated
digits, using 40 test samples for each gesture class. The
average recognition rates are 88.70%, 93.94%, and
97.62% for HMM, LCS, and the proposed,
respectively.
We successfully tested the proposed method on 2048

game1 through the simulation of the arrow keys, using
G1~G4 from Fig. 4, to move the tiles around.
4. Conclusion
The proposed method has comparative recognition
rate to the state-of-the-art methods and requires less
computational resources. It runs in real-time without
delay. In the future work, we plan to derive a forward
gesture spotting method that might be more appropriate
for big size gesture vocabularies.
References
Fig. 3. Processing time

Fig. 3 shows the average processing time on digit
vocabulary, which is the time elapsed between gesture
execution and its recognition result. The proposed
method requires less processing time, 35.8% and
74.6% of the time required by HMM and Segmentbased LCS, respectively, under similar conditions.
[1] C. Nyirarugira and T. Kim, Stratified gesture

recognition using the normalized longest common
subsequence with rough sets Signal ProcessingImage Communication (2014).
[2] T. Blakwell and J. Branke Particle swarm
optimization with composite particles in dynamic
environments IEEE Trans. System, Man and
Cybernetics, pp. 1634-1648, 2010.
- 781 -
http://gabrielecirulli.github.io/2048/
P5-32
Real-Time Video Monitoring System with Motion Detection

Seulkee Jung, Jihye Kim, Seongsoo Lee
Dep. of Electronic Engineering, Soongsil University
Seoul 156-743, Korea
sslee@ssu.ac.kr
Abstract
This paper describes the real time video monitoring
system with motion detection algorithm. The system is
to monitor multiple locations at the same time using
several cameras. In this paper, we use 4 VGA cameras
and FPGA with display monitor. When usual, a VGA
video image is displayed by collecting QVGA video
from 4 cameras. When motion is detected, the image of
the camera enlarges to VGA. This system shows low
HW resource utilization with maximum operating
frequency of 98MHz.
Keywords: Motion detection, Real-time monitoring
system, video.
1. Introduction
It needs to be more sensitive to the critical risk of
accidents in major infrastructure facilities such as
stations power plants, substations. But it is difficult to
monitor and cut the risk of accidents because it is hard
to access to the facilities. This paper proposes real-time
monitoring system using multi-cameras. The system
can make the monitoring system more efficient
because the video image of the camera enlarges to
bigger screen when motion is detected. We tried to
apply a simple calculation method to motion detection
with low memory usage rates.
2. Motion Detection Method

In the image compression of the video standards,
SAD is the important technique of motion estimation.
In this paper, we propose the motion detection method
by referring to the existing SAD technique [1]-[3].
Motion estimation searches for the block producing
the minimum SAD value between current frame and
reference frame to decide to motion vector. We
calculate only difference between current frame and
previous frame for motion detection. And instead of

calculating total differences, we use counters.
The used calculation unit for motion detection is
illustrated on Fig. 1. CB and PB symbolize current
block and previous block. ( , ) symbolizes position of
current frame and previous frame. Because noise can
be anything in camera, we define Margin value for
noise compensation and the count number increases by
1 whenever differences are bigger than the Margin
value.
3. Design of Monitoring System with

Motion Detection
Fig. 2 shows the proposed algorithm for motion
detection. After system starts, it checks sequentially
whether there is motion or not by comparing between
input data from VGA camera every frame. If
CNT(counter) is above Threshold value, this system
decides that there is motion. When usual, a VGA video
image is displayed by collecting QVGA video from 4
cameras. When motion is detected, the image of the
camera enlarges to VGA. At that time, the size of
video at other channels is reduced to QQVGA.
Fig. 3 shows the proposed HW architecture
consisting of main controller, memory, calculator, and
LCD controller. Main controller is used when setting
camera for display size and data format by I 2C
interface and it obtains image data from cameras.
Memory block is used as storage of image data from
previous frame for calculation. Memory stores only
one pixel per 44 pixels to increase memory
availability. Calculator block is used for comparing
between current frame and previous frame and send a
signal to Event generator when motion is detected.
LCD controller controls LCD and sends image data to
LCD.
- 782 -
ICEIC 2015
Figure 1: The calculation unit.
We completed RTL coding with Verilog-HDL and

we simulated and verified it with VCS. And we used
Spartan-6 SC6SLX75 of Xilinx for designing
Hardware. We verified that the system works stably at
48MHz when using Xilinx FPGA.
Fig. 4 shows the simulation result. o_data1 is image
data obtained from previous frame and cur_data is
image data of current frame. diff is computed by
comparing between o_data1 and cur_data. CNT is the
number of the differences. alarm1 of low active
becomes zero when CNT value is above the threshold
value (can be regulated). This simulation result shows
that there is motion at ch1.
Table 1 shows low utilization rates of Hardware
resource for Spartan-6 SC6SLX75 of Xilinx. The
maximum operating frequency is 98MHz.
Table 1: Hardware resources
Slice Logic
Utilization
Slice Registers
Slice LUTs
Occupied
Slices
Figure 2: The proposed algorithm.
Used
Available
1,014
1,468
530
93,296
46,648
11,662
Utilization
1%
3%
4%
5. Conclusion
Figure 3: The proposed HW architecture.
In this paper, we presented the design of real-time

monitoring system with motion detection. The system
works stably at 48MHz when using Xilinx FPGA. The
maximum operating frequency is 98MHz. So, this
design can be applied to a higher resolution. As this
system uses only about 4% of hardware resource of
FPGA, this system shows low utilization rates of
hardware. This system can be applied to facilities that
are inaccessible as a real-time monitoring system. If
connected by communication networks, it can also be
developed to a remote monitoring system.
Acknowledgment
Figure 4: Simulation result of entire system.
This research was supported by the System IC

Commercialization R&BD Program (10049498, 4K
UHD HEVC/VP9 SoC for Streaming Smart Device)
and the Industrial Core Technology Development
Program (10049095, "Development of Fusion Power
Management Platforms and Solutions for Smart
Connected Devices) funded by the Ministry of Trade,
industry & Energy.
- 783 -
ICEIC 2015
References
[1] D. Guevorkian. A. Launianen, P. Liuha, and V.
Lappalainen, Architectures for the sum of absolute
differences operation, Proceedings of IEEE Workshop on
Signal Processing Systems, p. 57-62, Oct. 2002.
[2] Dong-kyun Park, Hyo-moon Cho, Sang-bok Cho, Jonghwa Lee, A fast motion estimation algorithm for SAD,
ISIC '07. International Symposium on Integrated Circuits,
p.528-531, Sep. 2007.
[3] Hyeon-Cheol Yang, Seongsoo Lee, Motion Estimation
Algorithm to Guarantee Hard Realtime Operation, Journal
of IKEEE.Vol.17, p.36-43, Mar. 2013.
- 784 -
P5-33
Entropy Based Enhancement of Low Luminance Image

Se Eun Kim*, Yong Ho Moon**, Il Kyu Eom*
*Department of Electronics Engineering, Image Signal Processing Lab., Pusan National University
**Department of Informatics/ERI, Gyeongsang National University
kd99se@pusan.ac.kr, yhmoon5@gnu.ac.kr, ikeom@pusan.ac.kr
Abstract
In this paper, we propose an image enhancement
method using histogram matching and entropy-based
approach in the wavelet domain. We adjust the low
frequency component using the histogram matching
method and the high frequency components using the
maximization of the entropy. Experimental results
show that the proposed method displays good
enhanced image with low luminance.
The rest of this paper is organized as follows.

Section 2 explains the proposed method. Experimental
results and conclusion are presented in Sections 3 and
4, respectively.
2. Proposed method
In our method, the contrast enhancement is
performed in the YCbCr color space. First, each
component is transformed into the wavelet domain as
follows.
Keywords: Low luminance image, contrast

enhancement, histogram matching, wavelet transform,
entropy maximization.
1. Introduction
Images and videos have been used for private or
public purposes. However, in many case, we do not get
an image with desired brightness and resolution when
the illumination is low. Thus, many studies are being
progressed to improve the low luminance image using
various contrast enhancement and color adjustment
methods.
One of the popular contrast enhancement method is
to amplify sharpness at the edge by designing a
function that enhances contrast [1-2]. In [1], contrast
enhancement has been performed using entropy-based
approach. This method is based on the fact that the
maximum entropy can be obtained by uniform
histogram. The color image enhancement technique
using scaling the discrete cosine transform (DCT)
coefficients has been reported in [2]. This scheme
firstly changes DC components using well-known
enhancement methods and then adjusts AC
components according to the changed DC values.
In this paper, we present a new color image
enhancement method using histogram matching and
entropy-based approach in the wavelet domain. Our
method is performed at YCbCr color coordinate and
produce good enhanced image with low luminance.
, (1)
where
,
, and
is the transformed version
of ,
, and
, respectively. In (1),
indicates
wavelet subbands. For a given luminance image , the
histogram matching is performed to obtain an initial
enhanced luminance image. That is,
,
(2)
where
is an initially enhanced , and
is a
matching function. In this paper, we use
as a
Gaussian function.
There are various local contrast measures in the
transform domain [3]. In this paper, for a component,
we exploit a local contrast measure at a location
in the wavelet domain as follows.
,
, (3)
where
is the local contrast measure for
using the histogram matched luminance
.
In order to apply the entropy concept to contrast, we
divide image into
overlapping blocks. Then,
calculate the probability associated with contrast as
follows.
- 785 -
(4)
ICEIC 2015
(a)
(b)
(c)
(d)
(e)
Fig.1. Enhancement results, (a) Original image, (b) TW-CES-BLK, (c) DRC-CES-BLK, (d) SF-CESBLK, (e) proposed method
Table 1: Performance measure on enhanced
where is
block centered of
. From (4), we
image
can obtain the entropy
as the terms of
CEF [3]
GCF [4]
. Our aim is to amplify this
Proposed
method
2.3665
2.6724
entropy to change the local contrast defined in (3).
TW-CES-BLK
[2]
1.7341
1.6523
That is,
DRC-CES-BLK
[2]
1.8247
1.2165
,
(5)
SF-CES-BLK [2]
1.3282
1.4357
where is the changed probability associated with
contrast, and
is the amplifying factor. From the
4. Conclusion
equation (5), we will drop
, if there is no
confusion.
In this paper, we proposed a low luminance image
The value of shown (5) is calculated by the
enhancement method using histogram matching and
Newton method in this paper. From , we can find
entropy-based approach in the wavelet domain.
as
the value of a new contrast measure,
Simulation results showed that our method is effective
to enhance low luminance images.
),
(6)
where
and
. From (3) and (6), we obtain the
changed high frequency wavelet coefficient
using
, (7)
Finally, new luminance component of ,

is
calculated by the inverse wavelet transform of ,
, and . Chrominance channels are also
enhanced by using amplifying factor obtained by the
luminance channel.
To verify the performance of our method, we
compared our results to the conventional method in [2].
As shown in Fig. 1, our method is superior to the
conventional method. Table 1 shows the two objective
measures such as the color enhancement factor (CEF)
[3] and the global contrast factor (GCF) [4]. In
conclusion, our method shows better performance both
objectively and subjectively than the previous method.
Acknowledgement
Foundation of KOREA (NRF) and Center for Women
n Science, Engineering and Technology (WISET)
Grant funded by the Ministry of Science, ICT & Future
Planning of KOREA (MSIP) under the program for the
Potential female students with interest in Science
connecting with the community of Science and
Engineering.
References
[1] A. Khelaf, A. Beghdadi, and H. Dupoisot, Entropic
contrast enhancement," IEEE Trans. Medical Imaging, vol.
10, no. 4, p. 589-592, 1991.
[2] Mukherjee, Jayanta, and Sanjit K. Mitra, "Enhancement
of color images by scaling the DCT coefficients," IEEE
Trans. Image Processing, pp.1783-1794, 2008.
[3] S. Susstrunk and S. Winkler, Color image quality on the
internet, Proc. IS&T/SPIE Electronic Imaging: Internet
Imaging V, vol. 5304, pp. 118131, 2004
[4] K. Matkovic, L. Neumann, A. Neumann, T. Psik and W.
Purgathofer, Global Contrast Factor a New Approach to
Image Contrast, In Computational Aesthetics in Graphics,
Visualization and Imaging 2005, pp. 159-168, May 2005.
- 786 -
P5-34
Video Quality Assessment Method between DVD-Quality movie and CamQuality movie using Noise Detection
Hyungkwan Son, Yongseok Seo, Wonyoung Yoo
Contents Protection Lab, Electronics and Telecommunications Research Institute
{kwanson, yongseok, zero2}@etri.re.kr
Abstract
In this paper, we propose a new video quality
assessment (VQA) algorithm for estimating difference
between DVD-quality movie and Cam-quality movie.
This method is based on noise detection in the hue
channel of movie frames. Also, some image processing
method has been applied to detect the noise more
effectively. Experimental analysis has shown the
efficiency of the proposed algorithm.
CamRip is more dark, blurred, and has less consistency

of color than DVDRip. Due to these features, there are
some unnatural pixels that look like noises in the frame
of CamRip. Using these noises, we can find the
difference between CamRip and DVDrip. So, our
proposed algorithm focuses on detecting the noises
from frame of movie.
Keywords: Video quality assessment, Hue channel,

Noise detection, Robert filter.
1. Introduction
Figure 1: CamRip
Depending on the growth and development of film

industry, many movies are released in theaters each
year. At the same time, the pirated movies are made in
cinema using camcorder or smart phone and released.
These are usually called CamRip and have a lower
quality than original movie due to a lack of sources.
CamRips can quickly appear online and spread out
according to peoples upload and download. So, we
need to detect these illegal contents as quickly as
possible.
To protect the copyright of the original movie, our
new VQA algorithm is applied. The main purpose of
this algorithm is to find the difference between the
illegal movie and the legal movie. In this paper,
DVDRip, a final retail version of a film, is used for the
original or legal movie to be compared with the
CamRip. This paper is organized as follows. Section 2
presents the proposed VQA algorithm and Section 3
presents the experimental result. Section 4 concludes
the paper.
Figure 2: DVDRip
The flow of our proposed VQA algorithm is shown
in Figure 3. The color of input frame is originally
composed of RGB space. RGB (red-green-blue) color
model considered as the base color space for various
application [1], but it is poor color space to determine
specific color for recognition. For this reason, we use
HIS (hue-intensity-saturation) color model which is
based on the idea of human visual system [2]. Among
them, hue channel is used for our algorithm, since it
shows the unity of color very well. The hue can be
simply transformed from RGB space. The formulas
are:
2. The proposed method

Figure 1 and Figure 2 show difference between
CamRip and DVDRip in same scene of same movie.
- 787 -
ICEIC 2015
.
We calculate the noise ratio for the both movie
types and compare the two results of the noise ratio
about the same movie. The same section (about 5
minutes) of each of four movies are used for our
experiment. The experimental results of our algorithm
are shown in Table. 1
Table 1: Average noise ratio of DVDRip and
CamRip
Movie A
Movie B
Movie C
Movie D
Figure 3: Flow of proposed algorithm

And just like the statement above, Camrip has less
consistency of color than DVDRip. Such lack of unity
of color appear noise-like in hue image. So, the
proposed VQA algorithm has used edge detection
techniques for noise measure. There are many edge
detection algorithms have been developed for detecting
the true edges from an image. These algorithms use
different types of masks such as Robert, Prewitt, Sobel,
Laplacian filters etc [3]. Among them, robert filter has
the primary disadvantage that is its high sensitivity to
noise, because very few pixels are used to approximate
the gradient. Our algorithm uses the disadvantage of
robert filter to detect noise in hue image of movie
frame.
Once the edge detection method has been applied to
movie frames, the more clear difference between
CamRip and DVDRip has appeared. CamRip applied
edge detection method shows more rectangular edges
and weak edges from noises than DVDRip. The next
step of proposed algorithm is to calculate ratio of these
features in each frame of movie. Before calculating, we
convert edge detection image into simple binary image
using global fixed thresholding method. As a result,
two colors remain only in frame. One is the background
represented by black intensity pixel and another is the
edges of foreground and noises represented by white
intensity pixel.
In last step of our algorithm, we calculate the noise
ratio of movie frame. The detected noises are shaped
like salt of salt and pepper noise and they are size of
the one single pixel. We define the noise ratio formula
DVDRip
0.2650
0.0824
0.1871
0.3326
CamRip
0.4748
0.1684
0.2751
0.4741
As shown in the table, all of the average noise ratio

of the DVDRip is lower than CamRip at the same
section in the same movie. The proposed algorithm
exhibit competitive performance in distinguishing
between DVDRip and CamRip.
4. Conclusion
This paper presented a novel video quality
assessment algorithm between CamRip movie and
DVDRp movie. The experimental results show that
our algorithm has a nice advantage of finding the
difference between DVDRip and CamRip.
Acknowledgment
This research project was supported by the
Government Fund from Korea Copyright Commission
in 2014.[2012-cloud-9500:Development of contentbased usage control technology for clean cloud]
References
[1] Ibraheem, Noor A., et al. "Understanding Color Models:
A Review." ARPN Journal of Science and Technology 2.3
(2012): 265-275.
[2] Cheng, Heng-Da, et al. "Color image segmentation:
advances and prospects." Pattern recognition 34.12 (2001):
2259-2281
[3] Nahar, Mahbubun, and Md Sujan Ali. "An Improved
Approach for Digital Image Edge Detection."
- 788 -
P5-35
Penalty Added DTW Gesture Recognition Based on Velocity Orientation

Hyo-Rim Choi, Clementine Nyirarugira, TaeYong Kim
Graduate School of Advanced Imaging Science, Multimedia and Film,
Chung-Ang University, Seoul, Republic of Korea.
funappear@cau.ac.kr, rugiracle@cau.ac.kr, kimty@cau.ac.kr
Abstract
This paper presents a gesture recognition systems
based on Dynamic Time Warping (DTW) for game
interface. In order to improve the recognition rate of
DTW, we add penalty term in DTW algorithm. The
penalty term is based on the orientation histogram of
body joint's velocity obtained from Kinect. We also
organize the gesture set in subsets to reduce the
computational cost based on active joint.
Keywords: Dynamic Time Warping, Gesture
Recognition.
1. Introduction
Generally used game interface are mouse, joystick
or the keyboard, but for a more realistic gaming
experience, often special input device (For example,
light gun for shooting game and steering wheel for
racing game) are used. In the game environment where
devices are used for input a variety of actions is limited.
However using gesture recognition based on vision,
more varied and intuitive gesture can be accepted. This
paper presents a gesture recognition system using the
DTW algorithm [1] and Kinect. DTW is a widely used
template matching algorithm [2] and Kinect is a depth
sensor that is suitable for game interface. To improve
accuracy of DTW, we suggest Penalty added DTW.
And our clustered gesture set defeat computation cost
problem proportionally associated with size of gesture
database [3].
2. Gesture Recognition
The flowchart of the algorithm is shown in Fig. 1.
We first obtain and normalize the input sequence, and
then generate a velocity sequence. By calculating the
velocity in each sequence of joint, the active joint is
found, and then select clustered gesture set which
corresponds to active joint. The selected gesture subset
and input are compared using penalty added DTW.
Fig. 1. Algorithm flowchart
2.1 Generate Velocity Orientation Histogram

Using the Kinect SDK, it is possible to obtain
position data of the joint [4]. Kinect provides the
distance between user and sensor, position data are not
invariant. In order to get user invariant position data,
all joint position data are moved based on center of two
shoulders position. All position data are normalized
based on distance between two shoulders. Using the
velocity sequence of active joint, an orientation
histogram can be generated. In our experiments we use
a histogram having 8-bins and then a probability
histogram is generated from orientation histogram as
follows:
N
pn = hn / hn
(1)
n =1
p is probability histogram, h is histogram

n is index of histogram bin, N is number of
Where
histogram bin. Generated probability histogram is used

to add penalty in DTW. In order to have a low
computational cost, all of gesture in database are
clustered based active joint (each body part has a
unique subset corresponding to it) in our experiment,
the total number of clusters is six associated to the left
hand, right hand, head movement and two the feet.
2.2 Penalty Added DTW with Selected Gesture
Subset
DTW is a matching algorithm that allows a nonlinear
stretching of the sequence. When we compare
Sequence X and Y(X has M length, Y has N length),
we can generate a matrix g which is the accumulated
cost matrix.
- 789 -
ICEIC 2015
g (i, j 1)
g=
(i, j ) d (i, j ) + min g (i, j )
g (i 1, j )
(2)
d is Euclidean distance. In our method we suggest an

added penalty term in Euclidean expression. This
penalty is based on Bhattacharyya coefficient [5] of
two sequences probability histogram. The new
expression is following:
behind our method. This type of clustering is not good

at very huge data set with only one joint used. Our
future work is about building another cluster strategy
that can be used to solve the above said problem.
g (i, j )= d (i, j ) + ((1 BC (hist _ Ai , hist _ B j )) d (i, j ))

g (i, j 1)
+ min g (i, j )
g (i 1, j )
(3)
is the penalty adjustment constant value,

hist _ A and hist _ B are each sequences
histogram, d is Euclidean distance, BC is
Bhattacharyya coefficient. BC can be calculated as:
BC (hist _=
A, hist _ B)
hist _ An hist _ B n
Fig. 2. shows gestures from database red ones and blue ones are
input.
(4)
TABLE I.
n =1
n is index of histogram bin, N is number of

histogram bin. If two histograms are similar the return
value is 1. Otherwise the returned value is 0. The
selected gesture subset and input are compared using
the suggested method, when computation done on all
gestures in subset, gesture satisfying the threshold with
a smallest returned value is selected as the result.
AVERAGE PROCESS TIME AND ACCURACY
Method
Measurement
Average
Average
process time
Accuracy
DTW
101ms
0.943
Penalty Added DTW
107ms
0.995
19ms
0.917
21ms
0.991
DTW with Clustered

Gesture Sets
Penalty Added DTW with
Clustered Gesture Sets
If we only use very simple gesture, at that time the
original DTW is enough to archive the task, but if
added some more complex gesture (for example,
number gesture) the DTW accuracy in not good. When
input gesture is exaggerated, or too faintheartedly,
DTW show wrong result. See Fig. 2. Red gesture is
from database and blue one is the given input which is
the digit 3. Morphologically (c) show good similarity
between input and database but DTW distance of (a) is
smaller than in other cases, so the DTW gives a wrong
result. Using penalty based on orientation histogram,
the problem is relieved. Table I show Penalty added
DTW with improve accuracy and average process time
due to effective gesture clustering.
4. Conclusion
This work proposes a gesture recognition system
using Penalty added DTW. Experiment result show that
Penalty added DTW improved accuracy. Both penalty
term and gesture clustering strategy are the key points
References
[1] Sakoe,H. and Chiba, S. Dynamic programming
algorithm optimization for spoken word recognition,
IEEE Trans. on Acoust., Speech, and Signal Process.,
ASSP 26, 43-49, 1978.
[2] Lawrence Rabiner and Biing-Hwang Juang,
"Fundamentals of speech recognition", Prenticle Hall,
1993.
[3] Berkhin, Pavel. "A survey of clustering data mining
techniques." Grouping multidimensional data, Springer
Berlin Heidelberg, pp. 25-71, 2006.
[4] Webb, Jarrett, and James Ashley. Beginning
Kinect Programming with the Microsoft Kinect SDK,
Apress, 2012.
[5] Bhattacharyya, A. "On a measure of divergence
between two statistical populations defined by their
probability distributions". Bulletin of the Calcutta
Mathematical Society 35: 99109, 1943.
- 790 -
P5-36
Color Modification Detection Using CFA Pattern Decomposition

Jun Ryung Seo and Il Kyu Eom
Department of Electronics Engineering, Image Signal Processing Lab., Pusan National University
{ababkoko, ikeom}@pusan.ac.kr
Abstract
In this paper, we propose a color modification
detection method using decomposition of color filter
array pattern. We can detect color modification region
using the variance ratio of the original pixel values
and the color interpolated pixel values. Experimental
simulation shows that our proposed method can
effectively detect color modification region.
Keywords: Color modification, Demosaicing, CFA
(color filter array) interpolation, Bayer pattern, Highpass filtering, Decomposition.
Fig. 1. CFA pattern decomposition method
1. Introduction
According to the development of digital image
processing techniques, anyone can easily manipulate
an image using image editing tools such as Photoshop
and Light-room. Therefore, image forgery detection
has become an important subject to prevent from
misapplication of an image. Color manipulation, which
change hue component of an image is one of the
popular image forgery method. However, the research
on forgery of digital images by color modification is
very rare.
Recently, a color modification detection method for
measuring the change in the color filter array (CFA)
pattern [1] has been reported. This method presented
an intermediate value counting algorithm for
estimating the extent of color modification. It can
detect not only the changed change values but also the
changed color regions. However, this method has
demerits when the color interpolation is performed
using a wide range of pixels such as bi-cubic
interpolation [2] and median filtering [3].
In this paper, we present a new color change
detection method using CFA decomposition. Our
method is based on the variance ratio of the original
pixels and the interpolated pixels. Simulating results
will show that our proposed method can efficiently
detected the changed color regions.
The rest of this paper is organized as follows.
Section 2 explains the proposed method. Experimental
results and conclusion are presented in Sections 3 and

4, respectively.
2. Proposed method
Because one pixel in the charge-coupled device (CCD)
or complementary metal oxide semiconductor (CMOS)
has a wave value for only one color, the information on
the other two colors has to be estimated from the
samples of the neighboring pixels. This estimation
process is called demosaicing. Our method is based on
the fact that the variance of the original pixels is larger
than that of the interpolated pixels.
Let be a color component of an image, that is,
{, , } . The color component can be divided
into four decomposed images shown in Fig. 1.
Decomposition is achieved by means of a polyphaselike transform. Therefore, can be expressed as
= 1 + 2 + 3 + 4 .
(1)
Under the assumption of Bayer CFA pattern [4], 2

and 3 are original pixels (dark color), On the other
hand, 1 and 4 are interpolated pixels (light color).
Red and blue components can be grouped in the same
rule shown in Fig. 1.
- 791 -
ICEIC 2015
(a)
(b)
(c)
(d)
(e)
Fig. 2. (a) Original mage (bilinear interpolation), (b) Color forged image, (c) Forged region, (d) Previous
method [1], (e) Proposed method.
(a)
(b)
(c)
(d)
(e)
Fig. 3. (a) Original mage (bicubic interpolation), (b) Color forged image, (c) Forged region, (d) Previous
method [1], (e) Proposed method.
In general, the variance of the interpolated pixels is
smaller than that of original pixels. The following rule
is assumed when there is no image forgery. That is,
2
,
2
,
> 1,
(2)
2
2
where ,
is the variance of original
and ,
pixels and the variance of interpolated pixels,
respectively. When the color change is performed, the
relationship shown in (2), will be broken. Based on this
fact, we will present an effective color change
detection method.
First, we perform a high-pass filtering on a
suspicious image to reduce interpolated values. Next,
we divide the image into non-overlapped blocks.
For each block ( = 1, , ) , the color change
indicator () is obtained. () for each color
channel is defined by
() = {
1,
0,
2
,
()
2
,
()
(3)
otherwise
Finally, the color changed block C() is estimated by

fusing three color indicators as follows.
C() = () () ().
(4)
To prove the validity of our proposed method, we
perform CFA interpolation using bilinear and bi-cubic
interpolation methods. Next, we generate two color
changed image shown in Fig. 2 and Fig. 3. To detect
forged regions, we divide image into 32 32 blocks.

As shown in Fig. 2 and 3, our algorithm can detect
forged regions more exactly compared to the
conventional method [1]. In the case of the bi-cubic
interpolation, our proposed method has superior to
Chois algorithm [1].
4. Conclusion
In this paper, we presented a new color
modification detecting method using CFA pattern
decomposition. To detect forged image region, we
exploited the variance the ratio of the interpolated
pixels and the original pixels. Simulation results
showed that our method is effective to detect color
modification region.
References
[1] C. H. Choi, H. Y. Lee, and H. K. Lee, "Estimation
of color modification in digital images by CFA pattern
change, Forensic science international vol. 226, pp.
94-105, 2013.
[2] R. Keys, "Cubic convolution interpolation for
digital image processing IEEE Transaction on
Acoustics, Speech, and Signal Processing, vol. 29, no.
6, pp. 1153-1160, 1981.
[3] W. T. Freeman, "Median filter for reconstructing
missing color samples," U.S. Patent No. 4,724,395.
Feb 1988.
[4] B. E. Bayer, "Color imaging array," U.S. Patent No.
3,971,065. Jul, 1976.
- 792 -
P5-37
Performance Comparison of Precoding Schemes for Full Duplex

Communication in Full Duplex Two User MIMO Downlink Channel
Hyunjong Na and Chungyong Lee
Dept. of Electrical and Electronic Engineering, Yonsei University
nahyunjong@csp.yonsei.ac.kr, cylee@yonsei.ac.kr
2. System model
Abstract
We compare the downlink (DL) sum rates of
precoding schemes to cancel inter-device-interference
in full duplex two user multiple-input multiple-output
(MIMO) DL channel. The precoding schemes such as
null space projection (NSP), regularized zero forcing
(RZF), and maximum ratio combining at transmitter
(MRT) are applied. The simulation result shows that
the NSP precoding scheme has higher performance
than other two schemes.
Keywords: Full duplex, Inter device interference, Null
space projection, Regularized zero forcing, Maximum
ratio combining.
1. Introduction
Full duplex (FD) wireless communication system
that transmits and receives signal simultaneously has
potential to achieve double spectral efficiency.
However, a self interference coming from its own
transmitter degrades the performance of FD systems.
Thus, one of the main issues of FD communication
system is how to cancel the self interference [1].
Though the power of the self interference is much
higher than that of desired signal, many researches has
been focusing that the power of the self interference
can be decreased to the noise power [1-2]. In contrast
with bi-directional FD system, the inter-deviceinterference (IDI) is also main problem reducing the
performance in multi-user FD communication system.
Since DL users suffer from interference caused by the
signals of uplink (UL) users, then the signal to
interference and noise ratio (SINR) of DL user is
decreased. Thus, we apply precoding schemes to
manage IDI at UE, and investigate the DL performance.
Rx
Tx
UE1
F1,UE
H1
s k , BS
Fk , BS
H 2,1
H1,2
H2
Rx
Tx
UE2
F2,UE
Fig. 1. The two user FD MIMO system model

As depicted in Fig. 1, we consider a full duplex
MIMO wireless system, where BS communicates with
two FD users. The BS has N t transmit antennas, while
each user equips M t transmit antennas and M r receive
antennas. In Fig. 1, Hk
channel and H k , j
M r Mt
M r Nt
means the k -th DL
denotes IDI channel from
UE j to UE k , k j. We assume that all channels

follow the Rayleigh fading channel characteristics, and
all self interferences are perfectly canceled. In addition,
each node has full channel state information (CSI) for
desired channel, H k , and IDI channel, H k , j . Then, DL
received signal vector at UE k can be expressed as
yk
P
PDL
H k Fk , BS s k , BS UL H k , j Fj ,UE s j ,UE n k ,
Nt
Mt
where Fj ,UE
Mt Mt
and Fk , BS
Nt N s
(1)
are precoding
matrices at UE j and at BS for UE k , respectively. The

matrix Fk , BS is assumed a block diagonalization matrix
in order that the effect of IDI can be investigated more
detail by eliminating interference between DL signals.
The vectors s j ,UE M t 1 and sk ,BS Ns 1 represent
- 793 -
ICEIC 2015
transmitted symbols at UE j and at BS for UE k ,
respectively, where N s means the number of DL data
streams to each UE. The PUL and PDL indicate the
power of UL and DL signal, respectively. The vector
nk M r 1 denotes zero mean complex Gassian noise
with variance N 0 , i.e.
0, N0 .
We apply precoding filters such as MRT, NSP, and

RZF to manage IDI at each UE. The MRT precoder
maximizing signal to noise ratio (SNR) is designed as
(2)
Fk , MRC HkH, DL .
The NSP precoder to eliminate IDI channel can be
obtained by using null space of IDI channel:
H
H
H k , j U k , j k , j VkH, j U k , j k , j Vk1, j
Vk,0j , (3)
where the right singular vector, Vk ,0j , is used to the

NSP precoding filter, Fk , NSP Vk,0j . The RZF precoder
considering IDI and noise together is expressed as
1
H H
H
H SNR 1I A
H
k
k
k
Fk , RZF
,
(4)
RZF
0
I
H F
k , DL k , BS , A Nr
where H
, and RZF
0M r
0
Hk , j
is the power normalization factor. Then, the DL sum
rates of the schemes are
2

H F FH HH
CNSP log 2 det I k , DL k , BS k , BS k , DL , (5)

N0
k 1

2

H k , DL Fk ,BS FkH, BS H kH, DL
CRZF log 2 det I

N0 H k , j Fj , RZF FjH, RZF H kH, j
k 1

(6)
Fig. 2. DL rates applied precoding at UE

precoder can eliminate IDI perfectly. However, the UL
capacity is decreased since spatial dimensions of
transmit antennas are required to cancel IDI. The IDI
mitigation is slight when the MRT precoder is applied,
because the objective of MRT precoder is maximizing
SNR of desired channel. The DL sum rate of RZF
precoder has intermediate the performance since RZF
is the combination of NSP and MRT.
4. Conclusion
In this paper, we investigate the performances of
precoding schemes in FD MIMO two user DL channel.
The simulation result shows the NSP precoder has
highest performance because perfect IDI cancelation is
possible. The MRC precoder has lowest performance
since the MRC precoding scheme not consider IDI
channel but maximized SNR of desired channel only.
The RZF has middle performance out of those three
schemes.
, and
2

H k , DL Fk ,BSFkH, BS H kH, DL
CMRT log 2 det I

N0 H k , j Fj , MRT FjH, MRT H kH, j
k 1

(7)
In this section, we compare the DL performance of
the precoding schemes at FD two user system. Fig. 2
shows the sum rates of each precoding scheme, where
Nt 12 at BS and M t 6, M r 2 at each UE. The
DL power of BS is fixed with 30 [dBm] and the noise
power is 104 [dBm]. We set the path loss model as
[3]. The cell coverage is assumed 1km, and each user is
distributed uniformly. The NSP precoder has the same
performance with the non-IDI FD case because NSP
References
[1] J. I. Choi, M. Jain, K. Srinivasan, P. Levis, and S.
Katti, Achieving single channel, full duplex wireless
communication, in Proc. 16th Int. Conf on Mobile
Computing and Networking, 2010.
[2] D. Bharadia, E.McMilin, S. Katti, Full duplex
radios, Preceeding of ACM SIGCOMM, page
375~386, 2013.
[3] J. Xu, L. Qiu, and C. Yu, Improving energy
efficiency through multimode transmission in the
downlink MIMO systems, EURASIPJ. Wireless
Comm. and Network, vol. 2011, no. 1, p. 200, 2011.
- 794 -
P5-38
Image Restoration of Number Plate to Correspond to Moving Vehicles and

Low Illumination (ICEIC 2015)
Young-Min Jang1, Ji-Geun Kim1, Chang-Hee Park1, Sang-Bock Cho2
Department of Electronics Engineering
University of Ulsan
Ulsan, Republic of Korea
min-s2@nate.com, sbcho@ulsan.ac.kr
Abstract
The general vehicle black box recognizes only the
general surrounding environments. It is difficult to
recognize the images about a sudden illumination
change and low illumination. In this paper, we
propose a method to restore vehicle number plate
images to correspond to harsh road conditions in low
illumination circumstances and moving vehicles. This
paper describes firstly a normalized numeric image
descriptor used to assess the luminance and contrast
of the image. The proposed numeric image descriptor
can be used in the adaptive gamma process because it
suggests an objective basis of the gamma value
selection. Secondly, the image is restored number plate
based on motion estimation in a moving vehicle.
According to measurement results, the vehicle number
plate that camera in moving vehicle and low
illumination could not be identified is capable to
estimate by a proposed method.
Keywords: Vehicle black box; illumination; number
plate; gamma; motion estimation.
1. Introduction
The study for IoT (Internet of things) [1] has been
expanded to M2M (machine to machine) and V2V
(vehicle to vehicle) communication in intelligent
transport systems (ITS) using image processing based
on image information. Accurate image sensing is
required for this kind of technology. A typical camera
recognizes only the general surrounding environment.
But it is difficult for a camera to recognize the images
in a situation of illumination change and low
illumination. Further, in this situation, in case of an
accident is difficult to obtain the accurately
surrounding image information. Therefore, in this
paper, we propose to restore vehicle number plate

images to correspond to harsh road conditions in low
illumination circumstances and moving vehicles.
2. A Proposed Restoration Method

In the proposed method as shown in Figure 1, it can
be divided into gamma correction using normalization
of luminance and contrast, image registration using
motion estimation, optimal Image reconstruction.
Figure 1. Block diagram of a proposed method

Normalization of luminance (NoL) is weighted
representing the luminance of the image, where r k is
the k-th gray level and n k is the number of pixels with
a k-th gray level. Because luminance depends on the
image resolution, (1) is necessary for normalization.
As shown in (2), NoL value can be normalized by
dividing the image resolution from LD.
LD
L1
rk nk
0
(1)
k
NoL
1 L1
r nk
, 0 d NoL d 1
LN k 0 k
(2)
Contrast information may be represented by the

difference between the maximum and minimum values
of the pixels in the image. As shown in (3), c l is the
contrast of the l-th block, and b l is the number of
blocks of c l contrast value. In the same way, the value
of NoC in (4) can be obtained through the
normalization of (3).
- 795 -
ICEIC 2015
CD
B 1
cl bl
l 0
(3)
1 B 1
c b
, 0 d NoC d 1
L l 0 l l
NoC
Visual Studio 2010 and OpenCV 2.2, Intel (R)

Core(TM)2 Quad Q8400 CPU 2.66GHz. Table 1 is to
compare the original and result image.
(4)
Table 1: The comparison of original and result

image
The normalized equation (5) of image quality

concerning luminance and contrast is presented
through an arrangement of (2) and (4).
NIQ
Sample
Clip 2
(lowillumination)
(6)
x1,h
cos T1 sin T1
,R
x
cos T1
sin T1
1,v
4. Conclusion
Fourier domain can be described as shown in

Equation (7).
F1 ( u )
f x e
j 2 SuT x
dx
f r R( x x1 ) e j 2 Su x dx
T
(7)
e j 2 Su
x1
f r Rx' e j 2 Su x dx'
T '
If a reference image is decided, the reference image

is moved to each of grid coordinates in [(0,1), (1,0),
(1,1)], the candidate images that includes the minimum
weight between the reference image and candidate
images is found. Then, as shown equation (8), the
weight is obtained by substituting the common
distance.
Weight
Clip 3
(lowillumination)
f r R x x1 ,
xh
, x1
xv
x 2 x 1 y 2 y1 T 2 T1
2
Result
(5)
( NoL , NoC )
In the equation (6), f r (u) is a two-dimensional

reference image. f 1 (u) shows movement and rotated
images.
f1 x
Original
Clip 1
(highillumination)
(8)
Each of the x 1 , y 1 , 1 is a standard reference image.

The x 2 and y 2 show the estimate value of movement
amount. The 2 is estimate value of rotation. In order
to select optimal candidate image, using the Equation
(8) is calculated each x-axis, y-axis, rotation angle,
weight in candidate images.
The image used in the experiment was used 1.3Mega pixel CMOS image sensor and black box system
of dual-core processor based on ARM-9. Also, we
implemented this system using the environment of
In this paper, we propose method to restore vehicle

number plate images to correspond to harsh road
conditions in low illumination circumstances and
moving vehicles. The experiment respectively was
progress in the situation of low illumination and highillumination. According to measurement results, the
vehicle number plate that camera in moving vehicle
and low illumination, high illumination could not be
identified is capable to estimate by a proposed method.
Therefore, the proposed algorithm will be variously
applied to security images for the CCTV, vehicle
camera, the mobile in order to obtain correct images of
the surrounding environment.
5. Acknowledgement
This work was supported by the Industrial Core
Technology Development Program (10049009,
Development of Main IPs for IoT and Image-Based
Security Low-Power SoC) funded by the Ministry of
Trade, Industry & Energy.
6. References
[1] Wikipedia,http://en.wikipedia.org/wiki/Internet_of_Things.
[2] Alfredo Restrepo (Palacios), Giovanni Ramponi, Word
Descriptors of Image Quality Based on Local Dispersionversus-Location Distributions, 16th EUSIPCO, pp.25-26,
2008.
[3] P.Vandewalle, S.Susstrunk, M.Vetterli,A Frequency
Domain Approach to Registration of Aliased Images with
Application to Superresolution, 16th EURASIP Journal,
pp.1-14, 2006.
- 796 -
P5-39
A direct power measure method for LDO regulator of power management IC

Young-Min Lim1,2, Dong-Soo Lee1, Ji-Hoon Kang1, Dam Yoon1, Jung-Woo Ha2
and Kang-Yoon Lee1
1
Sungkyunkwan University, Suwon, Korea 2Samsung Electronics, Yongin, Korea
li94@skku.edu
As many electronics become Mobile, the need for

efficient power management through minimization of
current consumption and improved thermal control
arises. The battery life has been a major concern in
the designing of mobile devices. Towards this end,
DVFS (Dynamic Voltage and Frequency Scaling)
technique and enhanced PMIC consist of improved
DC-DC and LDO converters are used.
This paper describes a new thermal control for the
Application Processor using LDO regulator direct load
current measure circuit instead of the thermal
resistance check.
The proposed measure circuit can enhance thermal
control through rapid DVFS for quick clock and power
gating. Additionally, measured data can use power
budget check and interlocking current protection.
Keywords: Low-Dropout (LDO) regulator, DVFS
(Dynamic Voltage and Frequency Scaling), Clock
Gating, Power Gating
In this case, thermal control runs after the temperature

rises. The difficulty in cooling is caused by the slow
rate of reaction control by the Processor and finding the
exact cause of the heating problems.
PMIC
(Power Management IC)
Li-ion
Battery
Buck
Converter
LDO 2
LDO
3
(Application
Processor)
Figure 1. Block diagram of the combination of Buck

converter and LDO regulator at the PMIC
If the processor temperature rises suddenly, it is
difficult for the cooling control like the speed limitation
of the processor clock as shown in Figure 2. It can be
powered off or seriously lock-up the processor. [2]
1. Introduction
The clock speeds of the mobile processor are
progressively speeding up, but because of this very
progress, the power consumption is increasing and the
heat created in IC generates leakage of current and
thermal damage. Therefore, to realize the high
performance of the Application Processor, it is
necessary to utilize Thermal control and the Processor
management of DVFS for the TMU (Thermal Control
Unit) of the Battery Power. Recently, the
implementation of the Application Processor which
uses low Operating voltage and HKMG (High-k Metal
Gate) process and the efficiency of the Battery are
being raised through the combination of DC-DC and
LDO converter as shown in Figure 1. [1]
Conventional thermal control method is heat
monitoring by the thermal sensor on the major heating
points and then Thermal Throttling control at the TMU.
Load
LDO 1
Temperature
Abstract
Thermal
Throttling
Burn-out
Throttling
Thermal Regulation
Tripping
Power-off
Thermal Safe
Time
Figure 2. Dynamic thermal control concepts

With suggested direct measure data of LDO power, it
can predict the Application Processor Temperature
trend. Generally, the IC temperature is proportional to
consumed current of supply power. We analyze supply
current data from real-time measure and then the TMU
can control thermal throttling from the forecasting data
as shown in Figure 3.
- 797 -
ICEIC 2015
PMIC
Regulator
(DC-DC, LDO)
Load
(AP)
PMIC Control
N:1
Current Measure
OCP
Current
Mirror
ADC
(a) Sensing voltage vs. Full load (0 to 500mA)
I2C
Figure 3. The proposed LDO regulator current

measure concepts
2. Operation of the proposed regulator

Basically, the direct power measure circuit use
current mirror structure. Mirror current that is reflected
on LDO power Transistor is measured from converted
sense resistor voltage. This measured data is read by
ADC (Analog to Digital Converter). Digitalizing ADC
data is processed in real-time for thermal trend
checking.
We need to cancel out the body effect of the Mirror
Transistor for accuracy. This paper use OP-AMP of
virtual short technique as shown in figure 4.
In Figure 4, the circuit is the proposed LDO with
direct current measure structure. Mirror scaling rate is
1000:1. Optionally, if you want to enhance the
accuracy, Mirror rate can down scaling from 500:1 to
100:1. But Power loss rises when you reduce the scale
size.
VBAT
VREF
DC-DC converter
Output
MPOWER
+
-
Pass
Transistor
1:N
RLOAD
MSENSE
+
_
Error
Amp
Sense
Transistor
COUT
(b) Sensing voltage vs. Low load (0 to 5mA)

Figure 5. Output waveforms of the proposed circuit
result. w/o OP-Amp compensation(Blue line), w/
OP-Amp compensation(Red line)
The above review results are in line with the
targeted 5% accuracy, fulfilling the target and the
current used in the Mirror circuit is 5~20uA.
4. Conclusion
In this paper, by applying the Mirror circuit, the
Load current of the LDO was measured directly.
Through the proposed circuit, the Body effect
regarding the Accuracy loss is calculated and the
measured data is used to make faster thermal throttling
possible. Additionally the LDO Current Protection
circuit utilization is possible and the set development of
LDO block in Power Budget review application is
possible.
+
_
Acknowledgement
VSENSE
This work was supported by the Industrial Strategic

technology development program, 10043590 funded
By the Ministry of Trade, industry & Energy(MI,
Korea
Figure 4. The proposed LDO current measure

circuit schematic
The accuracy of the proposed circuit is 5%,
therefore by the level, the actual Processor of the
Temperature trend prediction is possible. However,
because of the low load current, the low noise
sensitivity allowed adjustments to the Mirror rate to be
confirmed.
In Blue line of Figure 5 (a), the OP-Amp is not used
for compensating the results from the experiment The
Red line of Figure 5 (a) is the final proposed circuits
measure results. Figure 5 (b) is the Sensing voltage
level at low load current with 200:1 scale.
References
[1] L. Yi-Ting, W. Chia-Ling, and C. Chin-Hong, An
integrated step-down DC-DC converter with low output
voltage ripple, in Industrial Electronics and Applications
(ICIEA), 2010 the 5th IEEE Conference on, 2010, pp. 13731378.
[2] Y. Se-Hyun, L. Seogjun, L. Jae Young, C. Jeonglae, L.
Hoi-Jin, C. Dongsik, et al., "A 32nm high-k metal gate
application processor with GHz multi-core CPU," in SolidState Circuits Conference Digest of Technical Papers
(ISSCC), 2012 IEEE International, 2012, pp. 214-216.
- 798 -
P5-40
Remote Inspection of Injected Sealant on Car Body Assembly by Using Small

Camera
Jae Hong Joo* , Hie Sik Kim* , Gi Doo Kim* , Seung Jae Lee* , Seung Ho Han*
* Dept. of Electrical and Computer Engineering, University of Seoul
uosjae@gmail.com, drhskim@uos.ac.kr, kdg69@korea.com, banana1976@naver.com,
tmdgh1203@hotmail.com
Abstract
A new real-time vision inspection technology was
developed and tested for sealant error detection. It is
used for remote and automated measurement of sealant
injection in the car body manufacturing process. To
prevent corrosion and assemble car body plates, the
perfect monitoring of sealant injection is very important
for the car under body and side body. For the first
research step process, possibility of reducing sealant
error was experimentally carried out. The continuous
measurement of the accuracy of sealant thickness from
sealant nozzle was designed newly and applied in
lab.The shape of the injected sealant beam on the iron
plate of the car body has a round form similar to thick
wire cross section shape.The measurement result showed
only 0.011 % thickness error comparing to the real object
wire diameter value. Thickness measurement system
application would reduce the big financial lost efficiently
in the car manufacturing.
1. Introduction
A new real-time vision inspection technology was
developed and tested for sealant error detection. It is
used for remote and automated measurement of sealant
injection in the car body manufacturing process. To
prevent corrosion and assemble car body plates, the
perfect monitoring of sealant injection is very important
for the car underbody and side body. The thickness of
sealant injection changes by some operation conditions
by sometimes. A constant thickness control of the sealant
is very required in the car body manufacturing process.
The fault sealant beam causes serious problems of weak
adhesion of body panels, water penetration and car body
corrosion.
In the case of sealant injection fault, the car body must
be abandoned in most case of sealant problems. It causes
a large financial lost in car manufacturing. For the first
research step process, possibility of reducing sealant
error was experimentally carried out. The continuous
measurement of the accuracy of sealant thickness from
sealant nozzle was designed newly and applied in lab.
The real time vision system and c-program algorithm were
developed and tested with sealant injection model of the
car body manufacturing process.
2. Thickness Measurement Using a Very

Small Camera System
2.1 The actual process environment
By real work line of car under body sealant injection,
two types of robots with arm of 6 axis freedoms were
applied in jointed process for injection nozzle and car
body movement each. The nozzle tip has a minimal
volume size under considering the narrow work space.
Under A type sealant process, the robot arm position is
fixed so that the sealant is injected on the car body
plates moving by a robot. It has equipped with four
nozzles. Under B type sealant process, the robot arm
moves to follow the necessary sealant line on the fixed
car body. This process shows often dropping some
sealant easily.
When sealant injection process of the under body is
started, the B robot arm will lift the whole car body block
and incline it in 25degrees inclination, then moves
by following the sealant line meanwhile the underbody A
robot arm will inject the sealant on the sealant line.
For car side body sealant process, two kinds of robots
arms are working together to sealant injection process of
the side body vehicle assembly process. Difference
between two processes is that. The robot arm handling
car underbody moves linearly. The injection nozzle robot
arm is moving 3-dimensionally along the sealant line of
the car body
In the both process, the distance of the nozzle tip and car
body plate keeps only 1~2mm, very close to each other.
The precision control of loading plate components is
necessary. During the nozzle is injecting the sealant,
the mount of sealant injection flow rate is sometimes more
than reference rate, or sometimes it just injects no sealant.
In this case of sealant error, the completed car has serious
defects of less adhesion, water penetration and corrosion
problems.
For the underbody sealant process, the hole size of the
nozzles has 3~9mm to generate same thickness sealant
beams on car body.
- 799 -
ICEIC 2015
laid across the image. The coin diameter is known and
fixed before experiment.
This distance measurement method by using one pixel
distance multiplied by the object pixel in image showed
effective and precision enough for the quality
control of sealant injection. The image processing
program to measure was developed from the scratch.
2.2 Development of Thickness Measurement Device

with Vision Recognition Algorithm
The shape of the injected sealant beam on the iron plate
of the car body has a round form similar to thick wire
cross section shape. A thick wire was applied as a
specimen of measurement model for the first step of the
research. The input image file of real time video of the
targeted object shape has the resolution of 3,264 x 2,448.
The pixel size was too big to handle in real-time
calculation, so the image resolution was reduced to 490 x
653 for the fast calculation. The large image size of over
3,000 pixels can cause long delay time and sometimes
malfunction often. The 3 colors image makes usually too
much effort by vision algorithm development. Then
original RGB image was converted into the gray scale
image for simple and fast calculation in image
processing. For the calibration of image in real size,
measuring the distance of any two points on various
input image, a reference known circle is helpful. The
four coins circles were used as a reference size. The 4
coins with known 18.0mm diameter were put on test bed
and used as measurement reference scale. The 4 circles
pixel sizes were applied as a linear scale on the image
screen by calculation. With help of coins pixel size in
diameter, the real distance of 1 pixel can be decided
along to image axis. By multiplying the real distance of
1pixel to wire thickness cross, which the A point to B
point in fig.6 can be calculated to its real thickness by
using image processing.
Compare this thickness with American wire gauge. We
can find how thick it is
3. Conclusion
The remote measurement device to detect the sealant
injection thickness on the car body was developed initially.
A cable wire was found as a good reference object in first
step instead of real sealant injection every experiment time.
The vision process showed the enough precision result of
the calculated thickness. And the measurement data were
transferred through internet with TCP/IP protocol
functions to the main system computer.
The result showed only 0.011 % thickness error
comparing to the real object wire diameter value. By
upgrading the image processing algorithm, this error can
be reduced more. The vision device will be developed
continuously. This system application would reduce the
big financial lost efficiently in the car manufacturing.
Acknowledgement
This research was supported by the Korea Research
Foundation project, Improve the Accuracy of Glucose
Concentration Measurement Using Raman Spectroscopy
Serial Number 201410312004 and [RCMS] the smart
base gas leakage detection equipment and performance
assessment technology development Serial Number
201411072001.
References
2.3 Remote Thickness Measurement Environment

and Experiment
The thickness of the injected sealant on the car body is
determined dominantly upon the nozzles diameter. But
all kind of nozzles sizes are not available by measurement
experiment at laboratory. The injection pump equipment
is so huge and needs too high cost to operate really in
lab. For the first research step, a cable wire
with
thickness of 0.05mm~11.68mm diameter would allow
a proper object shape instead of real sealant beam. The
American Wire Gauge was used to measure the reference
diameter value.
Some kinds of black colored wires were applied randomly
to be exposed by the small video camera, which
positioned about 130mm above the specimen table. By
capturing images, the wire thickness and reference coins
were arranged to be included in the images. The 4 coins of
known 18.0mm diameter around the wire could be well
defined and used as reference. By measure the four coin
size in pixel numbers, the linear scale can be
- 800 -
1)
Jeong-Pyo Lee., and Jong-Yeon Lee., and

Chang-Ho Hyun., 2012, "Coin Recognition and
Classification Using Digital Image Processing,"
Korean Institute of Intelligent Systems, Vol. 22,
No. 1, pp. 7~11.
2) Lu Zhiying., and Han Chunyan., and Lin
Lichen., 2012, Research on Automobile
Distance Measurement System on Highway
Based on Vehicle-mounted Camera The 2nd
International
Conference
on
Computer
Application
and
System
Modeling,
pp.1060~1064.
ICEIC 2015

Author Index
Author Index
A
Abhik Das
Achmad Basuki
Adhitya Bhawiyuga
Aditya Bhawiyuga
Ajish S
Ajish Sreedharan
Akihiro Terashima
Alberto S. Baacia
Alquliyev Rasim
Mahammad
Apriana Toding
Artem Lenskiy
Ary Syahriar
Assim Sagahyroon
Atsushi Kinoshita
134
355
202
20
187
279
206
342
276
349
623
199, 294, 334
78
287
B
Baekseok Ko
Basel Safieh
Ben M. Chen
Beom-Hun Kim
Beom-mu Kim
Beomjin Kim
Biao Wang
Bingquan Shen
Biplab Sikdar
Bo-Kyung Seo
Bo Kyung Choi
Bo Wang
Bokyung Seo
Bong Seok Kim
Boon Leng Lee
Byeong-Ho Park
Byeong-Ju Park
Byeungwoo Jeon
Byoungha Park
Byung-Gook Park
Byung-Gyu Kim
Byung-Hee Son
Byung-Hun Yoon
Byung Joo Oh
Byung Ok Kang
ByungCheol Lee
Byunghwa Lee
Byungjin Chung
459
78
91
526
659
576
91
242
72
147, 249
720
136
153
762
590
551
749
260
497
234, 307, 374, 376, 386,
395, 425, 441
643
481, 621
536
28
720
618
451
709
C
C.H. Je
Cao Zhenbo
Chan-hee Park
Chan-Hong Park
Chan Hak Yu
Chan Yuk Park
Chang-Gun Kim
Chang-Hee Kim
ChangHee Park
228
668
427
551
449
600
481
397
795
Chang-Hyun Bae
Chang-In Park
Chang-Ki Kim
Chang-Wook Baek
Chang Kyu Lee
Chang Min Eun
Chang Shi
Changhoon Yim
Changhwan Shin
Changhyun Park
Changkyoung Eem
Changsik Yoo
Chanho Yoon
Chanhyun Park
Chee-Meng Chew
Chee Khiang Pang
Cheolung Cha
Cheon Won Choi
Chi-Ho Lin
Chi-Hsiung Wang
Chi-Shih Chao
Chia-Wei Lim
Chih-Shun Hsu
Chihoon Choi
Chikara Ohta
Choong Ki Kim
Chouljun Kang
Christy A. Caete
Chul-Heung Kim
Chul-Ho Won
Chulho Chung
Chulsoon Hwang
Chung-Hwan Kim
Chung-kwang Lee
Chungmu Oh
Chungyong Lee
Chunsu Park
Clementine Nyirarugira
232, 461
481
643
625
407
274
605
709
223, 405
772, 774
758
232, 461
618
182
242
9
592
56
704, 706
310
572
766
115, 123
305, 401
287
449
513
342
397
397
674
459
495
499
184
793
613
780, 789
D
D.-H. Lee
D.-W. Chung
D. Choi
Dae-yeol Yoo
Dae Hwan Kim
Dae Woong Kwon
Daeha Lee
Daehee Kim
Daehyun Pak
Daesik Hong
Dahee Lee
Dal-Hwan Yoon
Dam Yoon
Dawoon Han
Deepak Bhatia
Deog-Kyoon Jeong
Dibash Basukala
Do-Bin Kim
Do-Gu Kang
676
676
676
499
472, 475
234, 395, 425
613
635, 639
772
33
260
690
797
415
45
399, 511
764
395
696
- 802 -
Do-Kywn Kim
Dokyung Lee
Dong-Gyu Sim
Dong-Ho Choi
Dong-Hoon Lee
Dong-Hyun Yoon
Dong-Jin Shin
Dong-Jo Park
Dong-Kyoung Kye
Dong-Kyu Jung
Dong-seok Lim
Dong-Soo Lee
Dong Keon Lee
Dong Ki Lee
Dong Myong Kim
Donggi Kim
Donggyu Sim
Dongha Lee
DongHyun Yoon
Dongil Han
Dongjun Lee
Dongwan Kim
Doo-Gun Kim
Doo-San Baek
Doohwan Oh
Doohyung Cho
DooSan Baek
Dwi Astharini
397
735
254
461
415
507
580
633
249
140, 507
485
389, 409, 797
487
594
472, 475
770
717
417, 419
142
770
87
257
468, 470
147
184
439, 451
149, 153
334
E
E. Lim
Edward Namkyu Cho
Eko Sakti P.
Eunah Choi
Eun-Dong Lee
Eung-Kyeu Kim
Eung-Kyu Park
Eungyeol Song
Eun-ja Jo
Eun-Ja Jo
Eunjung Chae
Eun-Jung Lee
EunSang Jang
Eunsung Lee
676
437, 445
355
758
147
611
393, 415
264
704
706
94, 98, 100
684
682
94, 98, 100
F
Fadi Aloul
Fadjar Iftikhar
Fei Qiao
Fei Wang
Fenfang Xiao
Feng-Cheng Chang
Feng Lin
Firdaus Akbar
78
339
262
91
22
180
91
199
G
Ga Hui Lee
Gang Li
720
590
ICEIC 2015
Garimella Rama Murthy
Garimella Rama Murthy
Gi Doo Kim
Gil-Cho Ahn
Gil-Mo Kang
Gi-Poong Gwon
Gong Chen
Gon-Woo Kim
Goo-Rak Kwon
Guem-Yoon Oh
Gun-Hyun Lee
Gyumin Oh
Gyun Woo
Gyu-Seob Jeong
324
371
799
230, 538
54
147, 149, 153, 155, 249
244
519
526, 764
470
582, 584
149, 153, 249
562
511
H
H.-M. Yang
H. Jin Kim
H. S. Kim
H. S. Moon
Ha-Jun Kim
Haeryoung Park
Hagyoung Kim
Hai-Nguyen Nguyen
Haiyue Zhu
Hak-Suh Kim
Hamin Park
Han-hee Cho
Han-Hsien Wang
Han-Sol Kim
Han-You Jeong
Hanbyeol Bae
Hang-Geun Jeong
Hang Yu
Hanmin Lee
Hano Wang
Hanseul Lee
Haoyong Yu
Hara Kang
Haram Ju
Haya Hasan
Hea-Sook Park
Hee-Jin Kang
Heein Yang
Heeseung Choi
Heewon Seo
Hi-Seok Kim
Hie Sik Kim
Hiesik Kim
Hiroaki Minami
Hiroyuki Yamauchi
Hisashi Tamaki
Hiuk Jae Shim
Ho-Joon Kim
Ho-Jung Kang
Ho-Young Cha
Hoirin Kim
Hojin Song
Hong-Seung Kim
Hong-Shik Park
Hong Chang Yeoh
Hong Kai Yap
676
89
641
641
526
67
547
87
9
645
431
499
310
483, 485
20
778
487
102, 110
501
33
249
244
472
511
78
645
536
252
158
56
455
799
544, 574
287
378
287
260
429
314
475
170
299
468, 470
680, 684
140, 321, 507
5
Hongchul Choi
Hongrae Lee
Hoon-Kyeu Lee
Hoon Kim
Horng-Yuan Shih
Hosung Lee
Hsiang-Cheh Huang
Hsin-Jou Yu
Hsin-Tsung Lin
Huazhong Yang
Hui-Seon Gang
Hwan-Gue Cho
Hwan-jong Jeong
Hye-In Lee
Hye-Rim Cheon
Hye-Seung Cho
Hyeok-Kyu Kwon
Hyeon-Kyeong Seong
Hyeon Seok Yang
Hyeong-Guen Yu
Hyeong-Woo Cha
Hyo-Haeng Lee
Hyo-Jun Son
Hyo-Rim Choi
Hyoung-Gook Kim
Hyuck-In Kwon
Hyun-Ki Jung
Hyun-Su Kim
Hyun-young Kim
Hyun Hak Cho
Hyun Soon Nam
Hyun Woo Kim
Hyung-Do Yoon
Hyung-Jin Choi
Hyung Gu Park
Hyung Ki Kim
Hyung Soon Kim
Hyungbo Shim
Hyungjin Kim
Hyungjun Lim
Hyungkwan Son
Hyungmin Kim
Hyungtak Kim
Hyungwoo Kim
Hyunjae Lee
HyunJin Kim
Hyunjong Na
Hyunki Hong
Hyunseung Choo
Hyunsoo Kim
Hyunsoo Yang
770
643
611
618
310
607
180
213
213
262
526
562
659
495
626
716
487
551
168
633
455
607
483, 712
789
711, 716
321
631
30
499
274
517
425
491
285
403
130
720
4
441
170
787
722, 729
475
225
405
566
793
758
637
33
87
I
Ick-Joon Park
IEEE
Iickho Song
Ik-Jae Hyeon
IlSuek Koh
Il Hwan Cho
Il Kyu Eom
Ilgu Yun
Ilku Nam
431
28, 176, 244
659
625
698
307
609, 785, 791
437, 443, 445
305, 401
- 803 -
Imen Arfaoui
In-O Choi
In-Su Cho
In-Sub Yoo
In-Tak Cho
In S. Woo
In Seong Kim
Indah Juningtiaz Devayani
Inhye Yoon
Insoo Jun
327
694
14
147, 149, 153, 249
397
739
411
294
94, 98, 100
56
J
J. Alexander Bae
J. Lee
J. S. Kim
J.B. Seo
Jae-Heung Lee
Jae-Ho Han
Jae-Hong Kwon
Jae-Hyoun Park
Jae-Hyoung Kim
Jae-Hyun Kim
Jae-Jin Lee
Jae-Koo Park
Jae-Roul Park
Jae-Young Pyun
Jae-Young Pyun
Jae Hong Joo
Jae Hong Lee
Jae Hoon Shim
Jae Hur
Jae Wook Jeon
Jaechun No
Jaeho Lim
Jaehong Kim
Jaehoon Choi
Jaehyung Bae
Jaejin Ko
Jaekeun Yun
Jaemin Rwoo
Jaesoek Kim
Jaesung Choi
Jaesung Jo
Jaesung Kim
Jaihie Kim
James Cho Hong Goh
James S. Harris Jr.
Jang-Kyoo Shin
Jang Hyun Kim
Je-Chang Jeong
Jechang Jeong
Jemin Kim
Jeong-Muk Kim
Jeong Cho
Jeong Seok Kim
Jeongbae Yun
JeongJu Yoo
Ji-Geun Kim
Ji-Hak Yu
Ji-Ho Lee
Ji-Hoon Kang
Ji-hoon Shin
61
228
641
743
747, 749
605
58
491
393
128, 252, 626, 628, 631
254
429, 463
523
526
764
574, 799
52
28
449
12, 528, 530, 532, 564
560
568
613
686, 696, 770
680
513
635, 639
459
674
778
223
67, 774
158, 776
5
374, 386
523
376, 425
756
735
540
764
459
435
668
643
795
457
58, 666
797
427
ICEIC 2015
Ji-Hwan Kim
Ji-Su Kim
Ji-Won Lee
Ji-Young Lee
Ji Hoon Hwang
Ji Hoon Kang
Jiang Liu
Jihaeng Heo
Jihye Kim
Jin-Ki Kim
Jin-Tae Kim
Jin-won Jang
Jin Ho Sung
Jin Hwan Kim
Jin Kyung Park
Jin Su Kim
Jin Wook Park
Jinbeum Jang
Jinfu Li
Jing Lin
Jinho Jeong
Jinhwan Kim
Jinqiang Cui
Jinsuk Seong
Jinwoo Kim
Jinwook Burm
Jinyoon Jang
Jong-Cheol Lee
Jong-Dae Park
Jong-Ho Lee
Jong-Hwa Yoon
Jong-Il Park
Jong-Koo Park
Jong-Min Baek
Jong-sang Back
Jong-Uk Yoon
Jong-Yeol Kim
Jong Ju Jeon
Jong Seob Jeong
Jong Won Park
Jongbok Lee
Jongheon Kim
Jonghwa Kim
Jonghyun Kim
Jonghyun Ma
Jongmin Shin
Jongweon Kim
Jongyeon Lee
Joo-Ho Jung
Joo-Seong Oh
Joo-Young Chun
Joo young Chun
Joo Yun Seo
Joon Woo Lee
Joong-Duk Oh
Joongseok Song
Joonki Paik
Joonsuk Kim
Joowon Kim
Ju Eon Kim
JuEon Kim
Jun-pyo Hong
Jun-Yong Lee
393, 415
628
477
465
28
521
289
33
782
628
523
712
600
521
56
776
168
97
242
91
678
65
91
659
417, 421
417, 419, 421, 423
421, 423
523
551
307, 314, 397
690
722, 726, 729
30
447, 463
653
690
479
609
596, 598, 600
568
554
97
472, 475, 497
225
717
397
556, 741
419, 423
694
653
389, 391
403
234
121
551
722, 726, 729
94, 96, 97, 98, 100
698
459
140
299
711
Jun-young Jang
Jun-Young Park
Jun Ryung Seo
Jun Tae Jang
Jun Yeong Lim
Jun Yin
Jung-Hee Lee
Jung-Hyuk Koh
Jung-Woo Ha
Jung Han Kang
Jung S. Jung
JungHun Kim
Junghyun Kim
Jungje Ha
Jungjin Park
Junhyung Kim
Juri Lee
704
465
791
472
443
481
397
65, 477, 580, 582, 584,
586
797
445
739
382
774
700
441
668
391, 403
K
K. C. Nam
K. Y. Shin
Kang-Il Choi
Kang-Yoon Lee
Kang Yoon Lee
Kangli Wang
KarAnn Toh
Katsunori Yamaoka
Kay Soon Low
KeeWon Kwon
Kenyu Ling
Keuchul Cho
KeunKwan Ryu
KeunSeon Ahn
Keunseok Cho
Khalifa Trimche
Khuder Altangerel
KiBum Ahn
Ki Doo Kim
Ki Yeop Kim
Kihyun Kim
Kijun Han
Kilsoo Seo
Kim DoYoung
Kim YeongJin
Kitsuchart Pasupa
Konjeti Viswanadh
KuangWei Su
Kuduck Kwon
Kukjin Chun
Kun Li
Kunzhi Xie
KuoHsiang Hsu
KwangChun Go
Kwangdeok Seo
KwangHyun Baek
KwangIl Han
KwangJin Kim
KwangMo Jung
KwangRyul Baek
KwangSeok Hong
745
745
566
389, 391, 403, 409, 521,
797
407, 411
91
615
206
102
429, 447, 463
130
668
423
232
714
327
268
423
574
274
225
668
225
570
570
166
324
115
305, 401
509
91
262
310
626
643
140, 142, 144, 507
483
481, 621
497
483, 485, 712
607
- 804 -
Kwang Won Kim

Kwangsoo Kim
Kwanhoon Song
Kwanhun Lee
Kwonjong Lee
Kyeongseob Kim
KyoungJae Lee
KyoungTae Kim
KyuBong Choi
KyuHwan Lee
Kyuhyun Kwack
KyungJin Byun
KyungJun Lee
KyungSoo Kim
KyungTae Jo
KyungTae Kim
Kyung Kwon Jung
Kyung Youn Kim
Kyungho Lee
Kyunghoon Lee
Kyungjae Lee
Kyungmin Lim
411
439, 451, 453, 558
439
540
33
130, 354, 625
647, 650
538
397
128, 631
509
254
756
2
664
694
578, 594
762
225
285
264
772
L
Li Luo
Liang Zhang
Lifen Liu
Lilian del Consuelo
Hernandez Ruiz Gaytan
262
262
110
289
M
M. Irfan Anis
Magdalena Trie P.
Marcelo H. Ang Jr.
Marco Gomes
Marie Kim
Member
Menghan Guo
MiJeong Hoh
MidEum Choi
MinHo Park
MinHyeong Cho
MinKi Jeon
MinKi Kim
MinWoo Kwon
Min A Jeong
Min Choi
Min Goo Lee
Min Ho Jeon
Min Su Kim
Mingming Li
Minkyu Lee
Minseo Kim
Minseong Kim
Minsoo Hahn
Minsu Jang
Minyeong Yoo
Mohamad Mahmoud
Al Rahhal
Mohamed AbdelRahman
Mohammed Alturaigi
297
355
160
151, 246
194
558
244
102
626, 631
147, 153
415
455
461
14, 536
441
653
758
578, 594
762
272
7
778
100
182
714
613
630
77
316
316
ICEIC 2015
MoonSeog Jun
Moonsoo Ra
Moonsuk Yi
Murad Khan
Myeongyun Cho
MyeongJin Kim
Myeong S. Park
Myeongjin Cho
MyoungBeom Chung
MyungOk Shin
Myung Jong Kim
Myungok Shin
67
766
427
668
602
58
739
182
637
147
170
153, 249
N
Nag Yong Choi
Naif Alajlan Mansour
Abdulaziz Al zauir
NakYong Ko
Nakhyun Kim
NamHo Lee
Namho Lee
NamJin Oh
Namho Lee
Nathnael Gebregziabher W.
Nattapon Pantuwong
Neel Narasimman
Neelakantan Narasimman
NgocSon Pham
Ngoc Le Ba
Noureddine Boudriga
314
77
30
67
479
534
433
493
128
166
134
138
142
132, 136
327, 363, 635
O
Ockgoo Lee
Octarina Nur Samijayani
OhSoon Shin
OhYeol Kwon
Ok Hyun Jeong
401
339
54
731
274
P
Paul Chiedozie Uzoh
Paulo Montezuma
Pedro Bento
Peidong Liu
PhilSeong Ghang
PiChung Wang
PinJie Wang
Prathibhavani P. M
Pyung Choi
Pyungkang Kim
668
194
194
91
56
213
123
35
523
2
Q
QingFu Han
Qingfu Han
711
716
R
Rachmad Nafisholeh
Raehong Kim
Ramesh Kumar Lama
Raye ChenHua Yeow
Rishabh Berlia
20
487
764
5
16
Roger K. Ahiadormey
Rui Dinis
Ruichen Jin
Rumadi
650
194
741
334
S
S.G. Lee
S. K. Yoo
S. O. Jin
S. Pyo
S.Q. Lee
S.W. Nam
Saad Haj Bakry
SangBock Cho
SangGug Lee
SangHo Lee
SangHong Park
SangHoon Ji
Sanghoon Jung
SangHoon Lee
SangHun Jeong
SangHun Song
Sangjo Kim
SangKook Han
SangMin Jung
SangMoo Lee
SangYun Kim
Sang Ho Park
Sang Wan Kim
Sanggi Kim
Sanghoon Jung
Sangjun Park
Sangyoun Lee
Sangyub Lee
Sarthak Dubey
Scott Pendleton
SeIl Oh
SeJin Baik
Se Eun Kim
Semi Jeon
Seok Hwan Jeong
SeokJin Yun
Seon Mi Ji
Seon Wook Kim
SeongDong Kim
SeongIl Jin
SeongWoo Kim
Seong Jin Cho
Seong Jin Oh
Seong Joon Yoo
Seong Ro Lee
SeongHwan Cho
Seonghyun Paik
Seongjae Cho
Seongsoo Lee
Seongwan Kim
Seonhee Park
Seoyeon Won
Seulgi Sim
Seulkee Jung
SeungBaek Park
228
745
745
676
228
743
77
795
495
234
694
30
534
523
479
321
427
688
688
30
447, 463
609
376
439
493
714
264, 772, 774, 778
513
16
246
409
463
785
94, 98
2
544
596
182
497
558
147, 149, 151, 153, 155,
249
12, 528, 530, 532, 564
407
770
659
61
374
307, 374, 376, 386
782
772
100
544
453
782
457
- 805 -
SeungBeom Yu
SeungMin Yang
SeungNam Kang
Seungsoo Ha
SeungTak Choi
SeungWoo Seo
Seung Beom Lee
Seung Ho Han
Seung Hyun Yun
Seung Jae Lee
Seungbae Ji
Seungha Yang
Seunghan Choi
Seungjun Baek
Seungwon Lee
Sewon Lee
Shigeru Shimamoto
Shikhaliyev Ramiz Huseyn
ShinIl Lim
Shoushun Chen
Shubham Kandoi
Shupeng Lai
Shuzhi Sam Ge
Sohaib Majzoub
Son N. Pham
Songyi Kim
SooIk Chae
SooWon Kim
Soo Chan Kim
Soo Jin Adrian Koh
Soohwan Yu
Soomok Lee
Soonuk Seol
Soonwoo Choi
SoYoung Kim
Srikanth Munjuluri
SuJeong Yun
SuYeon Song
Su A Lee
SuckChang Yoon
Suehye Park
Sukseung Hwang
Suk In Kang
Sumaila Mahama
SunMi Oh
SunMog Hong
Suncheol Yang
SungChan Kim
SungChan Rho
SungIl Chien
SungIL Hong
SungJin Choi
SungKyung Jo
SungYong Cho
SungYool Choi
Sung Il Hwang
Sung Min Ban
Sung Min Kim
Sung Woong Shin
Sunghee Jung
Sungjoon Lim
Sungju Choi
Sunil Roe
605
688
147
427
147, 153, 249
276
653
574, 799
12, 528, 530, 532, 564
799
605
260
570
401
272
712
289
276
14, 536
102, 106, 110
16
91
7
316
144
497
176
457, 459
596
237
96
249
623
176
382
371
704
706
598
690
445
526, 764
762
647
726
588
487
423
14
731
706
472, 475
664
399
431, 449
594
720
596, 600
568
714
130, 354, 625, 630
475
176
ICEIC 2015
Sunshin An
257, 363, 576, 635, 639
Suseong Kim
89
Suthasinee Nopparit
166
SwSoC Open Platform Team 517
Swee King Phang
91
Syed Irtaza Haider
316
T
T. G. Basavaraju
TaeKyeong Lee
TaeRyong Kim
TaeYeoul Yun
TaeYong Kuc
Tae Joong Kim
Tae Yong Kim
Taegeun Yoo
Taegu Lee
Taehoon Kim
Taehoon Kwon
Taejae Jeon
Taejun Lim
Taewook Chung
Taeyeop Kwon
TaeYong Kim
Takki Yu
Tao Pang
Tat Joo Teo
Tetsushi IKEGAMI
Theja Ram Pingali
TingHsuan Wang
TongYing Juang
Tony T. Kim
Truong Thi Kim Nga
35
468
468, 470
465
30
517
780
140, 507
540
560
121
264
702
674
678
789
33
91
9
204
16
180
115
132, 134, 136, 138
389
U
Ung Hwang
735
V
Vardhman Hada
Vigil Varghese
Vinay Chamola
Vitor Silva
45
106
72
194
W
W.S. Yang
WaiChi Fang
Walid Abdallah
WanYoung Chung
Wan Choi
Waqas Bukhari
WeiBin Yang
Wei Liu
WenLiang Ma
WhoiYul Kim
WonHo Lee
WonJin Lee
WonJune Hwang
228
180
363
590, 760
299
588
310
151
447, 463
766
455
756
144
Wonok Kwon
Won Jun Hwang
Won Woo Ro
Wonha Jeon
WonJune Hwang
Wonjune Lee
Wonseok Kang
Wonseok Lee
Wonyoung Yoo
WooSeok Kang
Woo Young Choi
Woorham Bae
Wooshik Kim
Woosuk Jung
Wooyoung Jang
Worawit Somha
547
285
184, 272
509
158
96
686
787
586
376
511
751
176
544
378
X
Xiang Li
Xiang Zhao
Xiangjian Wu
Xiangxu Dong
Xiao Liu
Xiaochi Chen
Xiaotong Shen
Xinyuan Qian
Xun Jin
91
690
717
91
562
386
246
102
556
Y
Y.G. Kim
Y. Y. Ko
Yakoub Bazi
YangKyu Choi
Ye Li
YeonJea Cho
YeonKeun Jeong
Yeoneo Kim
Yeonjun Lee
Yesool Cha
Yijie Huo
Yijie Ke
Ying Shi The
Yohan Hong
YongHee Lee
YongJin Choi
Yongjin Im
YongJo Ahn
YongMin Lee
YongSang Kim
Yongseo Koo
Yong Choi
Yong He
Yong Ho Moon
Yong Hyeon Shin
Yong Kuk Park
Yong Sin Kim
Yonghoon Kim
Yongseok Seo
228
641
77
449
621
633
485
562
249
497
386
91
237
144, 507
694
321
427
254
682
393, 415
499
538
22
785
437, 443
578, 594
435
735
787
- 806 -
Yongshik Lee
Yongyun Choi
Yookwang Kim
Yoonjong Yoo
Yoonki Hong
Yosub Park
YouSun Won
YoungChai Ko
YoungGwan Hwang
Younggwan Hwang
YoungHo Lee
YoungHoon Kwon
YoungJi Yoon
YoungJo Cho
YoungJong Jung
YoungJoon Han
YoungJun Kim
YoungJun Park
YoungJune Choi
YoungMin Jang
YoungMin Kim
YoungMin Lim
YoungOuk Kim
YoungSeon Moon
YoungSook Lee
YoungWan Choi
YoungWoong Kim
Young Chul Noh
Young Ho Choi
Young June Shin
Young K. Kwag
Young Min lm
Young Shik Moon
Young Woo Kim
Youngcheol Lee
Youngchoong Park
Youngchul Chung
Younggwan Hwang
Youngjin Kang
Youngsun Han
Youngwoong Kim
YuLung Lo
YuYao Lin
Yu Feng Goh
YuhShyan Chen
Yumee Kim
Yumi Takaki
YunGu Lee
Yun Hee Kim
Yuseok Ban
Yusuke DOHI
698, 700, 702

52
61
97
397
33
495
58, 664, 666
479
534
30
582, 584
731
30
519
321
666
391
128
795
645, 684
797
230, 538
30
760
468, 470, 481, 621
254
592
720
2
739
521
168
547
544
497
641
493
475
182
717
310
310
237
115
509
287
747
653
778
204
Z
Z. Y. Kevin Ang
Zhaolin Yang
Zhenhe Cui
Zhongjian Li
Zolboo Damiran
91
91
22
7
268

Iceic 2015

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Iceic 2015

Caricato da

Copyright:

Formati disponibili

2015 International Conference on Electronics,

Information and Communication

Welcome to ICEIC 2015

Technical Program Chair

2015 International Conference on Electronics,

Do Hyun Kim (Kookmin University, Korea)

Hong Tae Jeon (Chung-Ang University)

Organizing Committee Chair

Jaihie Kim (Yonsei University, Korea)

Jae Hong Lee (Seoul National University, Korea)

Jin Koo Rhee (Dongguk University, Korea)

Technical Program Chair

Jong Wha Chong (Hanyang University, Korea)

Technical Program Co-chair

Jung Uck Seo (e-Trade Promotion Committee KITA, Korea)

Symposium Chairs on Intelligent Control and Robotics

Sang Seol Lee (Hanyang University, Korea)

Jung Woong Ra (KAIST, Korea)

Seong Dae Kim (KAIST, Korea)

Symposium Chairs on Semiconductor and Devices

Soo Joong Kim (Kyungpook University, Korea)

Sung Jea Ko (Korea University, Korea)

Young Shik Moon (Hanyang University, Korea)

Registration (Lobby 2F)

Welcome Reception (1F)

January 29 (Thurs), 2015

Grand Salon 2 (Poster)

Registration (Lobby 2F)

Opening Ceremony (Grand Salon)

Plenary Talk (Grand Salon)

Lunch (Gallery 1F)

Grand Salon 2 (Poster)

January 30 (Fri), 2015

Registration (Lobby 2F)

Banquet (Gallery 1F)

ICEIC 2015 Group Discussion and Wrap-up

January 31 (Sat), 2015

2015 International Conference on Electronics,

Thursday, January 29, 2015

Friday, January 30, 2015

2015 International Conference on Electronics,

ICEIC 2015 Group Discussion and Wrap-up

Soft Elastomeric Actuators for Wearable Hand Exoskeleton5

Posture Synchronization for a Tele-presence Robotic system7

Integrated Design of a Flexure-Based Actuator Using GKYP Lemma9

System and Control

The Synchronization Control Strategy for Hydraulic Press Machines12

Wearable Controller using Electro Myography with Biofeedback16

A Mobility-Aware Heading Reference Selection (MAHRS) for Computing Vehicle Heading in

Synchronization of a Certain Family of Automata22

PLL-based Charging Control Circuits28

A Decentralized Formation Control of Multiple Mobile Robots with Collision Avoidance30

Communication System and Wireless Networking I

Aligned Dynamic Point Blanking in Small Cell Networks33

A Rectangular Micro-strip Patch Antenna for UWB Applications45

Access Networks and Systems I

Polling MAC Scheme for Wireless Passive Sensor Networks56

Matched Filter and Zero-Forcing precoding over Rayleigh Channels58

Removing Motion Artifact of Bio-Impedance Heart Rate Measurement System

(Na,K)NbO3-based Lead-Free Piezoelectric Ceramic for Renewable Energy harvesters65

Biometric Data Store Methodology suitable for Mobile Device67

Synthetic Generation of Hourly Solar Irradiance Using a Multi-State Markov Model72

Semiautomatic classification of ECG signal with Extreme Learning Machine77