ISCCSP 2010 Final Program and Abstract Book final version ... 2010 Final Program and... · 142 Fr....
175
151
Transcript of ISCCSP 2010 Final Program and Abstract Book final version ... 2010 Final Program and... · 142 Fr....
� 151
150
� 149
148
NOTES
� 147
Spors Sascha .................................... 70, 80, 90
Srinivasan Sriram ....................................... 135
Stavrou Photios ......................................... 129
Stylianou Yannis .......................................... 47
Suganuma Naoki ......................................... 84
Suzuki Shota ................................................ 60
Svoboda Philipp ......................................... 134
T
Tabus Ioan ................................................... 69
Tabus Vlad ................................................... 69
Taghirad Hamid ........................................... 94
Tagliasacchi Marco ...................................... 71
Taguchi Akira ............................................... 99
Takahashi Kazuhiko ............................... 18, 75
Takeya Tsutomu ........................................ 124
Talebi H.A. ................................................. 126
Tanaka Kiyoshi ............................................. 55
Taoka Hidekazu ........................................... 72
Taouali Okba ............................................... 74
Tewfik Ahmed .............................. 51, 66, 103
Thiagarajan J. Jayaraman .................... 76, 131
Thobaben Ragnar .................................. 50, 51
Thompson John ........................................... 62
Thornton T. ............................................... 131
Tian Sheping ................................................ 64
Tlili Fethi ...................................................... 92
Torrésani B. ................................................. 47
Treust Le M. .............................................. 121
Triantafyllidis Georgios ............................... 87
Truchetet Frédéric ................................. 10, 54
Tsenov Georgi ............................................. 53
Tubaro Stefano ............................................ 71
Tuduce Rodica ............................................. 53
Turki M. ....................................................... 47
Turri William ........................................ 97, 119
Turunen Vesa .............................................. 49
Tzortzis Ioannis ........................................... 94
V
Valente Daniele Salvo .................................. 71
Vandendorpe Luc ...................................... 122
Varada Ratnam Kumar .............................. 134
Vasilache Adriana ........................................ 69
Vereecken Willem ....................................... 61
Vidal M Antonio .......................................... 91
Viessmann Alexander ................................ 114
Villette S. ............................................... 10, 54
Viterbi J. Andrew ......................................... 45
Vrionides Photos ......................................... 56
W Waadt Andreas .......................................... 114
Wada Tetsuei ............................................ 125
Walstijn van Maarten .................................. 79
Wang Rui ..................................................... 62
Wang Xiaodong ......................................... 106
Wassell J. Ian ............................................... 82
Willems C. Jan ............................................. 45
Winters Jack ................................................ 73
Wolf Keil Jack .............................................. 57
Wong KokSheik ............................................ 55
X Xuereb David ............................................. 132
Yan Guozheng .............................................. 64
Yan Long‐Jhe ................................................ 97
Yan Yan ........................................................ 86
Yazdizadeh A.R. ......................................... 126
Yazdizadeh Alireza ....................................... 95
Yeh Cheng‐Yu .............................................. 58
Yoo Seunghwan ......................................... 104
Yu Yao ........................................................ 107
Yuan‐Wu Yi .................................................. 81
Yuvapoositanon Peerapol ......................... 143
Z Zadeh Soltanian Hamid ............................... 64
Žagar Drago ............................................... 113
Zaher Ashraf ................................................ 84
Zaidi Abdellatif .......................................... 122
Zeller Dietrich .............................................. 62
Zhang Lei ................................................... 125
Zhang Yimin ............................................... 102
Zhang Yujin .................................................. 86
Zhao Yong .................................................... 92
Zheng Yuanhang .......................................... 71
Zhou Jing ................................................... 126
Zölzer Udo ............................................. 90, 91
146
Njima Ben Chakib ........................................ 95
Nomura Toshiyuki ....................................... 60
Nongpiur Rajeev ........................................ 129
Ntalampiras Stavros .................................... 46
Nuriel Tamir ................................................ 54
Nygard Gerhard ......................................... 126
O
Obermayer Klaus ....................................... 110
Octavian Arsene .......................................... 52
Ohhara Kazuto ............................................. 98
Ohkura Shinpei ............................................ 78
Okada Hiroyuki ............................................ 98
Okada Minoru ........................................... 125
Oksanen Jan ................................................ 50
Omar Samir ................................................. 93
Omar Samir‐Mohamad ............................. 142
Onoye Takao ............................................... 98
P
Pan Cheng ................................................... 64
Panagi Panagiotis ...................................... 140
Panayiotou Christos .................................... 75
Papadopoulos Harris ................................... 56
Parra Lucas .................................................. 65
Pedroni A Volnei ....................................... 114
Pedroni U Bruno ........................................ 114
Peng Bo ..................................................... 111
Petrellis Nikos............................................ 118
Petropulu Athina ....................................... 107
Petroudi Styliani ........................................ 131
Phillips S. .................................................. 131
Pickavet Mario ............................................ 61
Polycarpou M. Marios ............................... 140
Poor Vincent ..................................... 106, 107
Potamitis Ilyas ............................................. 46
Prasad S .................................................... . 131
Psillakis Haris ............................................. 139
Pueo Basilio ................................................. 89
R Rabenstein Rudolf ....................................... 70
Rachid Latif ................................................ 118
Rafaely Boaz ................................................ 80
Rajan Sundar B. ........................................... 73
Ramamurthy N. K. ..................................... 131
Ramamurthy Natesan Karthikeyan ............. 76
Rehm Ansgar ............................................. 136
Reindl Klaus ................................................. 71
Renk Tobias ............................................... 102
Rezaei Farzad ............................................ 129
Richard Langley ........................................... 92
Ristaniemi Tapani ...................................... 111
Roenko Alexey ............................................. 68
Roger Sandra ............................................... 91
Ros Laurent ................................... 74, 92, 113
Rouissi Fatma .............................................. 92
Rudoy Dmitry .............................................. 87
Rupp Markus ............................................. 134
Ryynänen Jussi ............................................ 49
S
Saito Mamoru .............................................. 78
Sajda Paul .................................................... 65
Salehi Jawad .............................................. 115
Samee Kashif Muhammad ......................... 112
Santucci Robert .......................................... 142
Sardaroudi Ghaemi Sanaz ........................... 59
Sarti Augusto ............................................... 71
Saruwatari Hiroshi ....................................... 60
Sattigeri P. ................................................. 131
Savazzi Stefano .......................................... 123
Schilcher Udo ............................................ 122
Schug David ................................................. 86
Schutz Antony ............................................. 55
Seppanen Mari ............................................ 69
Serrano Salvatore ...................................... 137
Shalchian Jafar ............................................. 83
Shariati Ala .................................................. 94
Shechtman Slava ......................................... 46
Shikano Kiyohiro .......................................... 60
Shimizu Tomonori ....................................... 84
Shoham Tamar ............................................ 46
Si Zhongwei ................................................. 51
Siclet Cyrille ........................................... 74, 83
Simon Pierre Eric ................................. 92, 113
Sitjongsataporn Suchada ........................... 143
Skoglund Mikael .......................................... 51
Slock Dirk ................................. 55, 81, 93, 142
Soceanu Omri .............................................. 87
Sodagari Shabnam ..................................... 103
Sorger Ulrich ................................................ 77
Sousa Ricardo .................................... 119, 136
Soussi El Mohieddine ................................ 122
Souza D Richard ......................................... 114
Spanias A. .................................................. 131
Spanias Andreas .................................. 76, 142
Spiegel Christoph ............................... 114, 133
� 145
Kawakami Takashi ....................................... 99
Kawamura Yuki ............................................ 98
Kellermann Walter ...................................... 71
Keshi Ikuo .................................................... 98
Khaki‐Sedigh Ali ........................................... 83
Khaldi K. ...................................................... 47
Kibangou Alain ............................................ 74
Kikidis John ................................................ 118
Kim Anna ..................................................... 50
Kim Jaeyoel ............................................... 114
Kitaguchi Katsuhisa ..................................... 78
Klaus Matthias ............................................. 63
Knee Peter ................................................... 76
Kocks Christian .......................................... 114
Koivunen Visa ................................ 49, 50, 105
Kokkinen Kari .............................................. 49
Konnanath B. ............................................. 131
Kosunen Marko ........................................... 49
Kourtellaris Christos .................................. 129
Kowalczyk Konrad ....................................... 79
Kucera Vladimir ......................................... 138
Kundargi Nikhil .................................... 51, 103
Kuroda Tadahiro ........................................ 124
L Labibi Batool ............................................... 94
Lane John .......................................... 128, 130
Laner Markus ............................................ 134
Langley Richard ......................................... 125
Lanitis Andreas ............................................ 88
Lasaulce S. ................................................. 121
Lasenby Joan ............................................... 76
Le Hai Thanh ................................................ 77
Lee Jangsu ................................................. 104
Lee Sungchun ............................................ 104
Lee Woo Hyeon ......................................... 114
Lee Yongjun ............................................... 104
Lee Yoong Ken ............................................. 77
Leong Alex ................................................. 136
Lewis Noëlle .............................................. 124
Lieberei Matthias ........................................ 91
Lienard Martine ........................................... 92
Lim YeonJu ................................................ 114
Liu Wei ................................ 92, 111, 112, 125
Liu Yingxi ................................................... 103
Liu Yuzhe ................................................... 127
Lopez J Jose ..................................... 70, 79, 89
Lops Marco ................................................ 106
Louveaux Jérôme ...................................... 122
Loveimi Erfan ............................................... 47
Lukin Vladimir .............................................. 68
Lundén Jarmo .............................................. 50
Lyonnet Bastien ........................................... 83
Lyytinen Heikki .......................................... 111
M Mabrouk Ben Walid .................................... 95
Maham Behrouz .......................................... 73
Malah David .......................................... 46, 54
Mallik Ranjan ............................................... 73
Manabe Yasutake ........................................ 98
Mandic P Danilo ........................................ 111
Markaki Maria ............................................. 47
Massicotte Daniel ...................................... 120
Mathew T. ................................................. 131
Matz Gerald ............................................... 123
McLoughlin Ian ............................................ 77
Mehrafrooz Arash ....................................... 95
Mehrany Khashayar .................................. 115
Messaoud Hasani ........................................ 74
Messaoud Hassani ............................... 95, 127
Michaelides Michalis ................................... 75
Middleton Gareth ...................................... 121
Mitsis Georgios .......................................... 130
Miyabe Shigeki ............................................ 60
Mlayeh Yosra ............................................... 92
Monteiro A. Francisco ................................. 82
Mosca Edoardo .......................................... 139
Moschytz George .................................. 18, 75
Moshe Yair .................................................. 87
Mostafa Laaboubi...................................... 118
Motomura Koyo .......................................... 78
Murahira Kota ............................................. 99
Musuvathy Srideep ..................................... 56
N Nabil Amr .................................................... 58
Nabovati Hooman ..................................... 125
Nagaraj Belur Sunil .................................... 129
Nakhkash Mansor........................................ 64
Naqavi Ali .................................................. 115
Nastac Iulian ................................................ 53
Natora Michal ............................................ 110
Navarro M Juan ........................................... 79
Neri Alessandro ........................................... 68
Nicoli Monica ............................................. 123
Nihtila Markku .............................................. 95
Nikolova Alexandra ..................................... 53
144
Denic Stojan ....................................... 42, 138
Dey Subhrakanti ........................................ 136
Diop E.H.S. ................................................... 87
Djurovic Igor ................................................ 68
Donato Nicola ........................................... 137
Douik Ali .................................................... 127
Drewes Christian ........................................ 133
Dvir Itsik ...................................................... 87
E Easley Glenn ................................................ 86
Economou Lefteris ...................................... 56
Elhoucein Aassif ........................................ 118
Eliasi H. ...................................................... 126
Erdozain Aitor ........................................... 110
Escolano José .............................................. 79
Evangelista Gianpaolo ................................. 89
Eynard Goulven ......................................... 124
F
Fakotakis Nikos ............................................ 46
Famulari Antonio ...................................... 137
Fatahi Nahid .............................................. 125
Fatehi Alireza ............................................... 83
Ferreira Aníbal ................................... 119, 136
Fettweis Gerhard ......................................... 63
Fortener Benjamin ...................................... 97
Franke Felix ............................................... 110
Frantz A. Gene ........................................... 100
G Gabbouj Moncef ......................................... 98
Galić Dario ................................................. 113
Gallardo Jurado Marian ............................... 77
Garcia Germain ........................................... 95
Gee Christelle ........................................ 10, 54
Gerard Maze 118
Geravanchizadeh Masoud ............. 48, 59, 141
Ghabi Jalel ................................................. 127
Ghazel Adel ................................................. 92
Gianluca Cannatà ...................................... 137
Giotis Thomas ........................................... 139
Godrich Hana ............................................ 106
Gonzalez Alberto ......................................... 91
Goryll M. ................................................... 131
Goto Satoshi ................................................ 57
Götze Jürgen ............................................. 112
H Haas Harald ................................................. 62
Haimovich Alexander ................................ 106
Hamdi Omessad .......................................... 85
Hara Takao ................................................ 125
Haralambous Haris ...................................... 56
Haralick Robert ............................................ 65
Hashimoto Masafumi ............................ 18, 75
Hayashi Yuichi ............................................. 84
He Qian ...................................................... 105
Heddeghem Van Ward ................................ 61
Herceg Marijan .......................................... 113
Hesham Mohamed ...................................... 58
Higuchi Kenichi ............................................ 72
Hijazi Hussein ...................................... 92, 113
Hjørungnes Are ........................................... 73
Holters Martin ............................................. 90
Horvat Michael .......................................... 133
Huszak Arpad ............................................ 132
Hwang Shaw‐Hwa ....................................... 97
I
Imre Sandor ................................................ 132
Ioannou Ioanna ............................. 42, 81, 138
Ioannou Petros .......................................... 139
Isheden Christian ......................................... 63
Itaba Fumihiro ....................................... 18, 75
Ivannikov Andriy ........................................ 111
J
Jaber Marwan ............................................ 120
Jaekel Holger ............................................. 102
Jajamovich Guido ...................................... 106
Jbabdi Saad................................................ 130
Jin Ying ...................................................... 102
Jonckheere Edmond .................................... 56
Jondral K Friedrich ..................................... 102
Jones Gawain ........................................ 10, 54
Jung Peter .................................................. 114
K
Kadowaki Ryosuke ....................................... 78
Kamado Noriyoshi ....................................... 60
Kansanen Kimmo ......................................... 50
Karimpour Amir ........................................... 48
Kärkkäinen Tommi ..................................... 111
Karlsson Johannes ....................................... 50
Kasparis Takis .................................... 128, 130
� 143
Author Index
A
Aazhang Behnaam ..................................... 121
Abdelhedi Manel ......................................... 85
Abediasl Hooman ...................................... 115
Aguilera Emanuel ........................................ 89
Ahadi Mohammad Seyed ............................ 47
Ahmad Iftikhar ............................................ 98
Ahrens Jens ........................................... 80, 90
Aissi Ilyès ..................................................... 74
Aittomäki Tuomas ..................................... 105
Aizawa Kunio ............................................... 78
Almenar Vicenc ........................................... 91
Alsagabi Majid ............................................. 66
Amara Mustapha ........................................ 81
Annibale Paolo ............................................ 70
Antonacci Fabio ........................................... 71
Antoniou Andreas ..................................... 129
Arbabshirani Reza Mohammad ................... 64
Ardeyeh F.H. ................................................ 87
Aristidou Andreas ........................................ 76
Asl Badri Laleh ........................................... 141
Astola Jaakko ............................................... 69
Azadmehr Mehdi ....................................... 127
B
Bai Zijian .................................................... 133
Baldi Simone ............................................. 139
Balster Eric .......................................... 97, 119
Barth Ulrich .................................................. 62
Barzamini R. .............................................. 126
Barzamini Roohollah ................................... 95
Başar Tamer .............................................. 100
Bauer Peter ............................................... 127
Baussard A. .................................................. 87
Bazzi Oussama ............................................. 93
Belega Daniel ............................................ 135
Berdugo Guy ............................................... 87
Berg Yngvar ............................................... 127
Berkmann Jens .......................................... 133
Bettstetter Christian .................................. 122
Bhatnagar Manav ........................................ 73
Bilen Sven .................................................. 103
Birbas Alex................................................. 118
Birbas Michael ........................................... 118
Blasi Daniele ................................................ 68
Blum Rick ................................................... 105
Blume Oliver ................................................ 62
Bouallegue Ammar ...................................... 85
Bouchikhi Abdelkhalek .............................. 119
Boudraa Abdel‐Ouahab ................. 47, 87, 119
Boutalis Yannis .......................................... 139
Boyapati Krishna Hari ................................ 134
Brady Michael ............................................ 131
Brandner Günther ..................................... 122
Bretschneider Timo ..................................... 77
Broda Simon .............................................. 110
Brossier Jean‐Marc ...................................... 83
Bruck Guido ............................................... 114
Burnic Admir ............................................. 114
C
Campisi Patrizio ........................................... 68
Campobello Giuseppe ............................... 137
Castiglione Paolo ....................................... 123
Cauchi Patrick ............................................ 133
Cexus Jean‐Christophe ........................ 87, 119
Charalambous Charalambos 42, 81, 94, 129, 138
Chaudhari Sachin ......................................... 49
Chen Kwang‐Cheng ..................................... 61
Chockalingam Ananthanarayanan .............. 72
Chonavel Th. ................................................ 47
Christodoulou Lakis ................................... 130
Christodoulou Manolis .............................. 139
Christoforou Christoforos ............................ 65
Cigler Jiri .................................................... 138
Cobos Maximo ....................................... 70, 89
Colle Didier .................................................. 61
Corbach Tobias ............................................ 90
Crespo Pedro ............................................. 110
Cristea Dan Paul .......................................... 52
D
Dallet Dominique .............................. 124, 135
Danev Danyo ............................................... 49
Debbah M. ................................................. 121
Debono Carl James ........................... 132, 133
Demeester Piet ............................................ 61
Demetriou A. Michael ............................... 140
142
Fr. 35.4 17:45‐18:00
A Set‐Membership Mixed‐Tone Binormalised LMS‐based Per‐Tone DMT Equalisation
Suchada Sitjongsataporn and Peerapol Yuvapoositanon
Centre of Electronic Systems Design and Signal Processing (CESdSP), Department of Electronic Engineering, Mahanakorn University of Technology, Bangkok, Thailand
Abstract—This paper presents a novel structure of the set‐membership filtering adaptive algorithm with the framework of a mixed‐tone per‐tone equalisation in discrete multitone systems. The idea of two mixed‐tone constraint sets of interfering adjacent tones are extended to the concept of set‐membership binormalised least mean square algorithm. The proposed algorithm provides the fast convergence and low computational complexity with regard to the normalised data reusing algorithm. Simulation results show the performance of proposed algorithm in terms of faster convergence rate and robustness.
�
� 141
Fr. 35.2 17:15‐17:30
Variational Bayesian Blind and Semiblind Channel Estimation
Samir‐Mohamad Omar and Dirk Slock
EURECOM, Sophia, Antipolis, France
Abstract—Blind and semiblind channel estimation was a topic that enjoyed explosive developments throughout the nineties, and then came to a standstill, probably because of perceived unsatisfactory performance. Blind channel estimation techniques were developed and usually evaluated for a given channel realization, i.e. with a deterministic channel model. Such blind channel estimates, especially those based on subspaces in the data, are often only partial and ill‐conditioned. On the other hand, in wireless communications the channel is typically modeled as Rayleigh fading, i.e. with a Gaussian (prior) distribution expressing variances of and correlations between channel coefficients. In recent years, such prior information on the channel has started to get exploited in pilot‐based channel estimation, since often the pure pilot‐based (deterministic) channel estimate is of limited quality due to limited pilots. In this paper we explore a Bayesian approach to (semi‐)blind channel estimation, exploiting a priori information on fading channels. In the case of deterministic unknown input symbols, it suffices to augment the classical blind (quadratic) channel criterion with a quadratic criterion reflecting the Rayleigh fading prior. In the case of a Gaussian symbol model the blind criterion is more involved. The joint ML/MAP estimation of channels, deterministic unknown symbols, and channel profile parameters can be conveniently carried out using Variational Bayesian techniques. Variational Bayesian techniques correspond to alternating maximization of a likelihood w.r.t. subsets of parameters, but taking into account the estimation errors on the other parameters. To simplify exposition, we elaborate the details for the case of MIMO OFDM systems.
Fr. 35.3 17:30‐17:45
A Block Adaptive Predistortion Algorithm for Transceivers with Long Transmit‐Receive Latency
Robert Santucci and Andreas Spanias
Sensor and Signal Information Processing Center, School of Electrical, Computer, and Energy Engineering, Arizona State University Tempe, USA
Abstract—The purpose of this paper is to introduce digital predistortion and propose a new digital predistortion scheme for use in systems with lengthy transmit‐receive delays. The introduction discusses the motivation to implement digital predistortion within a wireless transceiver system. Then, we introduce techniques commonly found in the literature and the assumptions made in their operation. Finally, a new scheme is proposed which allows consideration of multiple measurements of actual data between predistorter updates that require significant latency before new results can be measured. This new scheme utilizes a block least‐mean‐squares (LMS) algorithm, running within a gain‐based look‐up‐table (LUT) predistorter.
140
Friday Afternoon, 5th March
Session: DSP for Communications
Time & Place: 17:00‐18:30 ‐ Salaminia
Chairperson: Takis Kasparis Cyprus University of Technology, Cyprus
Fr. 35.1 17:00‐17:15
Asexual Reproduction‐Based Adaptive Quantum Particle Swarm Optimization Algorithm for Dual‐Channel Speech Enhancement
Masoud Geravanchizadeh and Laleh Badri Asl
Faculty of Electrical and Computer, Engineering, University of Tabriz, Tabriz, Iran
Abstract—In this paper, we propose an improved particle swarm optimization algorithm called Asexual Reproduction‐based Adaptive Quantum Particle Swarm Optimization (ARAQPSO) for dual‐channel speech enhancement. The foundation of a particle optimization algorithm is to intelligently generate and modify the initial randomized solutions. The proposed algorithm is based on Adaptive Quantum Particle Swarm Optimization (AQPSO) technique. Particles that search the problem space have the ability to reproduce asexually, where the fertility of particles is proportional to their fitness. The proposed algorithm applies an adaptive local search around the fitter particles that result in a comprehensive search in prosperous regions of the problem space. Experimental results indicate that the algorithm outperforms AQPSO, SPSO, and the gradient‐based NLMS algorithm in the sense of SNRimprovement.
� 139
Fr. 34.5 18:00‐18:15
Measure‐of‐disagreement of consensus and adaptive‐consensus filters for spatially distributed systems
Michael A. Demetriou
Worcester Polytechnic Institute, Department of Mechanical Engineering, Worcester, MA, USA
Abstract—A measure of disagreement of the consensus and adaptive‐consensus filters for spatially distributed systems is examined and defined in a similar way as in the finite dimensional case. Such a a measure of disagreement essentially examines the deviation of the state of each spatial filter from the average estimate of all filters. Convergence of each spatially consensus filter to the average implies that the proposed consensus filter agree with each other. However, the interesting observation is that the speed of convergence of the measure of disagreement to zero is linked to the speed of convergence of the state estimation errors to zero. As a consequence one must appropriately design filters so that convergence of the associated state errors to zero enhances the agreement of all consensus filters. The proposed theoretical results are demonstrated by extensive simulations for representative spatially distributed systems.
Fr. 34.6 18:15‐18:30
Distributed Fault Detection and Accommodation with Partial Communication
Panagiotis Panagi and Marios M. Polycarpou
KIOS Research Center for Intelligent Systems and Networks, Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus
Abstract—In the recent years there has been an increased interest in the analysis and design of distributed control systems. This is motivated by the distributed nature of many systems, found in diverse areas such as manufacturing, transportation, power systems, mobile robotics, etc. Moreover, a key objective in engineering is the design of reliable systems that are able to operate within certain performance margins even in the presence of faults. A distributed fault diagnosis and accommodation scheme needs to be able to provide reliable and safe operation of the distributed system, with limited information exchange between the individual subsystems. Towards this direction, this paper presents a distributed fault detection and accommodation design for a class of nonlinear interconnected subsystems. A fault may occur in the subsystems local dynamics as well as in the interconnections between the subsystems. The subsystems are allowed to exchange state information, according to a tracking error‐based communication protocol. The distributed fault detection and accommodation architecture is based on the use of adaptive approximation models which utilize local, as well as, remote communicated state information.
138
Fr. 34.3 17:30‐17:45
Evaluation of Identifier based and Non‐identifier based Adaptive Supervisory Control using a Benchmark Example
Simone Baldi1, Petros Ioannou2 and Edoardo Mosca1
1Dipartimento Sistemi e Informatica, Universit`a di Firenze, Firenze, Italy; 2Department of Electrical Engineering and Information Technology, Cyprus University of Technology, Lemesos
Abstract—Several classes of identifier and non‐identifier based adaptive control schemes using a supervisory switching logic have been proposed in the literature. These schemes are based on different assumptions and claim to guarantee certain stability and performance properties, raising questions as which class of such schemes is better than others. The purpose of this paper is to clarify what each algorithm guarantess in theory and how it performs in simulations. The paper employs a benchmark example proposed in [1] to simulate the behaviour of the following classes of supervisory adaptive control schemes. The identifier based schemes: Robust Multiple Model Adaptive Control (RMMAC) and AdaptiveMixing Control (AMC) and the non‐identifier based schemes: Unfalsified Adaptive Switching Control (UASC) and Multi‐model Unfalsified Adaptive Switching Control (MUASC). For each scheme we present the basic features of the algorithm and state the stability and performance guaranteed in theory. The benchmark example of [1] is used to test the stability and performance properties of the schemes considered using extensive simulations. Our results show that the identifier based schemes require some minimal knowledge about the plant whereas the non identifier based do not. The identifier based schemes however gurantee stronger stability results and their performance is superior to that of the non‐identifier based schemes.
Fr. 34.4 17:45‐18:00
Adaptive identification of Fuzzy Cognitive Networks
Haris Psillakis1, Yannis Boutalis2, Thomas Giotis3 and Manolis Christodoulou4,5 1Department of Electrical Engineering, Technological & Educational Institute of Crete, Heraklion, Greece; 2Department of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi, Greece and with the University of Erlangen‐Nurember, Germany; 3Department of Electronic & Computer Engineering, Technical University of Crete, Chania, Crete, Greece; 4Faculty of Electronic & Computer Engineering, Technical University of Crete, Chania, Crete, Greece; 5Dipartimento di Automatica et Informatica, Politecnico di Torino, Torino, Italia
Abstract—An adaptive methodology is introduced to identify the weights of a general Fuzzy Cognitive Network (FCN). The proposed scheme consists of two hierarchically structured individual identification tasks that are both implemented on‐line. The inner task employs a robust integral of the sign error (RISE) observer to approximate the system’s unknown nonlinearity. At the higher level, a nonlinear mapping of the observer’s output provides an estimation of the linear parametrization of the FCN weights. Exploiting this fact, a standard gradient‐based algorithm is proposed as an outer identification task to estimate the FCN weights under a persistence of excitation condition. Simulation results illustrate the effectiveness of the proposed approach.
� 137
Friday Afternoon, 5th March
Session: Special Session on Intelligent Feedback Systems
Time & Place: 17:00‐18:30 ‐ Amathousia
Chairperson: Petros Ioannou
ECE Department, University of Cyprus, Nicosia, Cyprus
Fr. 34.1 17:00‐17:15
Capacity for MIMO Systems at Low SNR
Ioanna Ioannou1, Charalambos Charalambous1 and Stojan Denic2
1Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus; 2Toshiba, Bristol, England
Abstract—The paper introduces an asymptotic series expansion for the mutual information of Multiple‐Input Multiple‐Output (MIMO) channels. For low signal to noise ratio (SNR) the first term of expansion approaches mutual information from below. Using the low SNR approximation a new water filling power allocation at the transmitter is derived when the receiver and the transmitter have perfect channel state information (CSITR). The low SNR approximation is related to existing approximation while the new water filling policy is related to minimum mean square decoding subject to power constraint. Finally, an upper bound for the outage probability at low SNR is presented.
Fr. 34.2 17:15‐17:30
Optimal Control Systems with Prescribed Eigenvalues
Vladimir Kucera and Jiri Cigler
Czech Technical University in Prague, Faculty of Electrical Engineering, Prague, Czech Republic
Abstract— The eigenvalues of a linear and time‐invariant control system can be located at desired positions either directly, using eigenvalue assignment techniques, or indirectly, using, for example, a linear‐quadratic optimal control. The optimal control induces a certain eigenvalue pattern, depending on the performance index. It is shown in the paper that prescribed eigenvalue locations can be achieved using linearquadratic optimal control methods.
136
Fr. 33.6 18:15‐18:30
A novel low‐complex and low‐memory method for accurate single‐tone frequency estimation
Giuseppe Campobello, Cannatà Gianluca, Nicola Donato, Antonio Famulari and Salvatore Serrano.
Dept. of Matter Physics and Electronic Engineering, University of Messina, Italy
Abstract—In this paper a new method for accurate frequency estimation of a single sinusoid is described. The main feature of the proposed method, mainly based on a simple digital nonlinear filter, is its intrinsic low complexity development and use. The method, in fact, needs about 2Ns arithmetic operations, where Ns is the number of samples, and has very small memory requirements even when high accuracy is needed. Furthermore, we show that in case of moderate and high signal to noise ratio levels, the method is able to reach the Cramer‐Rao Lower Bound (CRLB) but at a lower
implementation cost.
� 135
Fr. 33.3 17:30‐17:45
Multi‐Sensor Diversity in Decentralized Estimation
Alex Leong and Subhrakanti Dey
ARC Special Research Centre for Ultra‐Broadband Information Networks (CUBIN), Department of Electrical and Electronic Engineering, University of Melbourne, Victoria, Australia
Abstract—This paper derives asymptotic expressions for the expected distortion in the decentralized estimation of a Gaussian source using multiple sensors, as the number of sensors becomes large. We consider a diversity scheme where only the sensor with the best channel sends their measurements to a fusion center, using the analog amplify and fowarding technique. For comparison, asymptotic expressions for a coherent multi‐access scheme and an orthogonal access scheme are also derived.
Fr. 33.4 17:45‐18:00
DFT‐based frequency estimation under harmonic interference
Aníbal Ferreira and Ricardo Sousa
University of Porto, FEUP‐DEEC, Portugal
Abstract—In this paper we address the accurate estimation of the frequency of sinusoids of natural signals such as singing, voice or music. These signals are intrinsicly harmonic and are normally contaminated by noise. Taking the Cramér‐Rao Lower Bound for unbiased frequency estimators as a reference, we compare the performance of several DFT‐based frequency estimators that are non‐iterative and that use the rectangular window or the Hanning window. Tests conditions simulate harmonic interference and two new ArcTan‐based frequency estimators are also included in the tests. Conclusions are presented on the relative performance of the different frequency estimators as a function of the SNR.
Fr. 33.5 18:00‐18:15
Estimation of Vehicle Roll Angle
Ansgar Rehm
University of Applied Sciences Osnabrück, Osnabrück, Germany
Abstract—In modern vehicles a large number of signal measurements related to vehicle dynamics is available. While hard cost constraints in the automotive industry imply that a single control system is equipped with a minimal number of sensors, the combination of sensors from different systems can be used to establish new information via signal processing. The set‐up considered in the paper at hand is a combination of a vehicle dynamics control system (VDC system) and a rollover mitigation system. A new estimation scheme for the vehicle roll angle is derived based on the combined sensor information from these two systems. The approach is tested in a large number of driving situations and comparison to roll angle measurements from a high precision inertial navigation system shows good estimation results.
134
Friday Afternoon, 5th March
Session: Estimation
Time & Place: 17:00‐18:30 ‐ Daphne
Chairperson: Aníbal Ferreira
University of Porto, FEUP‐DEEC, Portugal
Fr. 33.1 17:00‐17:15
Cramer‐Rao bounds for rate‐constrained distributed time‐delay estimation
Sriram Srinivasan
Digital Signal Processing Group, Philips Research Laboratories, Eindhoven, The Netherlands
Abstract—This paper investigates time‐delay estimation for acoustic source localization in a distributed microphone array. The microphones are assumed to be part of a wireless sensor network, with a constraint on the number of bits that may be exchanged between the sensors. Consequently, at the fusion center, time‐delay estimation needs to be performed using quantized signals. In this paper, the relation between the communication bitrate and the Cramér‐Rao lower bound (CRLB) on the variance of the time‐delay estimation error is explored. The minimum bit‐rate required to ensure that the CRLB is attained is also derived.
Fr. 33.2 17:15‐17:30
Influence of the Noise on the Amplitude Estimation of a Sine‐Wave by the Three‐Point Interpolated DFT Method
Daniel Belega1 and Dominique Dallet2
1Faculty of Electronics and Telecommunications, University “Politehnica” of Timisoara, Timisoara, Romania; 2IMS Laboratory, University of Bordeaux –IPB ENSEIRB MATMECA, Talence Cedex, France
Abstract—In this paper the influence of a stationary white noise on the estimation of a sine‐wave amplitude by means of the three‐point Interpolated Discrete Fourier Transform (IpDFT) method is investigated. The expression of the amplitude estimator variance is derived when the H‐term maximum sidelobe decay window (H ≥ 2) is employed. Based on the derived expression the statistical efficiency of the threepoint IpDFT method with respect to the unbiased Cramer‐Rao Lower Bound (CRLB) is analyzed. Computer simulations confirm the accuracy of the derived expression for the amplitude estimator variance.
� 133
Fr. 32.5 18:00‐18:15
A Comparison of DSP, ASIC and RISC DSP Based Implementations of Multiple Access in LTE
Hari Krishna Boyapati1 and Raja Kumar Ratnam Varada2
1G S Sanyal School of Telecommunications, Indian Institute of Technology Kharagpur, Kharagpur, India; 2 Department of E & E C E, Indian Institute of Technology Kharagpur, Kharagpur, India
Abstract—Energy consumption is an issue in general in information and communication technologies (ICT), but also cellular communications in particular. Therefore there is a need for assessing the hardware implementation methods used for cellular from energy consumption perspective. OFDM is a bandwidth efficient multiple access method. It is being used by all forms of future wireless mobile communication systems including LTE. The RF frontend, baseband algorithms and the protocols of these systems including 4G cellular need implementations with low power consumption, adequate processing speed, and low cost. In view of its importance and computational complexity, in this paper, three forms of implementing the baseband communication systems, including DSP, ASIC and RISC DSP based solutions are considered for the study of OFDM based multiple access methods of LTE through FFT algorithm.
Fr. 32.6 18:15‐18:30
Invited Paper
Outer‐Loop Power Control in a Live UMTS Network: Measurement, Analysis and Improvements
Markus Laner, Philipp Svoboda and Markus Rupp
Institute of Communications and Radio‐Frequency Engineering, Vienna University of Technology, Vienna, Austria
Abstract—The Outer Loop Power Control (OLPC) in WCDMA systems allows to achieve a defined Quality of Service (QoS) for every link. This reduces resources and interference, hence, increases the system‐wide throughput. In this paper we present uplink OLPC related large‐scale measurements, performed on live Iub‐interfaces. Evaluations of the actual implemented algorithm show that it converges slowly; the reason being that the QoS is estimated by CRC. As the uncoded Bit Error Ratio (BER) holds information about the QoS, this parameter can be used to increase convergence speed of the OLPC. We present a statistical model of the control path of the OLPC which takes the uncoded BER information into account. Additionally, we propose a new OLPC algorithm that shows fast convergence in simulations, resulting in a reduction of 0.2 dB to 1 dB of the mean required signal‐to‐interference ratio, depending on the user mobility.
132
Fr. 32.3 17:30‐17:45
Balancing the Utilization of Mobile Sensor Nodes through Genetic‐based Clustering
Carl James Debono1 and Patrick Cauchi2
1Department of Communications and Computer, Engineering, University of Malta, Msida, Malta; 2Melita plc, Mriehel Bypass, Mriehel, Malta
Abstract—Mobile sensor networks (MSNs) can be deployed in remote places and in disaster relief scenarios, where a structured infrastructure is not available. The mobility of the nodes increases the transmission power requirements as the topology of the network continuously evolves and routing paths become obsolete. This is of major concern since the lifetime of the battery‐operated devices depends on the power consumption of each node and the main contributor of this comes from transmission requirements. In this paper we apply a genetic algorithm to cluster nodes in such a way that network coverage is optimized. This leads to shorter transmission paths, reducing the required transmit power. Clustering is also altered during operation such that overall homogenous node power consumption occurs as the nodes move within the network and the power of the cluster heads diminishes. Thus, the mobile nodes are more evenly utilized during the lifetime of the network. Results show that the proposed solution manages to achieve a 52% increase in lifetime before the first node dies compared to the standard cluster‐based routing protocol.
Fr. 32.4 17:45‐18:00
On the Physical Layer Performance of the Release 8 E‐UTRA Downlink
Zijian Bai1, Christoph Spiegel1, Christian Drewes2, Jens Berkmann2, Michael Horvat2,
Bertram Gunzelmann2, Tobias Scholand2, Guido H. Bruck2 and Peter Jung1
1Lehrstuhl für Kommunikationstechnik, Universität Duisburg‐Essen, Duisburg, Germany; 2Infineon Technologies AG, Germany
Abstract— The 3GPP (Third Generation Partnership Project) LTE (Long Term Evolution) activity towards the evolved UMTS (Universal Mobile Telecommunications System) Terrestrial Radio Access, which is known as E‐UTRA, was started in November 2004 and recently culminated in the Release 8 of the 3GPP technical specifications, cf. e.g. the technical specifications 3GPP TS 36.101 and 3GPP TS 36.201. In the case of the physical layer, the performance evaluation of E‐UTRA must be based on the 3GPP technical recommendation TR 25.814, published in October 2006. This manuscript illustrates the performance which can be expected in the downlink of UTRA LTE in various conditions.
� 131
Friday Afternoon, 5th March
Session: Wireless Systems
Time & Place: 17:00‐18:30 ‐ Bacchus Ballroom
Chairperson: Yimin Zhang Villanova University, PA, USA
Fr. 32.1 17:00‐17:15
Mobile Terminal Location Estimation Using Support Vector Machines
David Xuereb and Carl James Debono
Department of Communications and Computer, Engineering, University of Malta, Msida, Malta
Abstract—Mobile technology advancements and customer demands have pushed mobile operators to develop services which are based on user position. These applications require accurate location estimation which must be achieved through information that is available on the network. The procedure adopted in the proposed solution is based on Cell‐ID and received signal strength measurements, which are both available to 3G mobile handsets. The collected information is transmitted to a server and fed to two Support Vector Machines (SVM) connected in cascade to infer location estimation. Simulation results show that the proposed method manages to achieve good accuracies when compared to similar solutions based on received signal strength measurements.
Fr. 32.2 17:15‐17:30
Analysing GOP Structure and Packet Loss Effects on Error Propagation in MPEG–4 Video Streams
Arpad Huszak and Sandor Imre
Budapest University of Technology and Economics, Department of Telecommunications, Budapest, Hungary
Abstract—Video streaming applications are commonly used in both wired and wireless environment; however, wireless links are burden by higher packet loss ratio and delay variation. In order to make video transmission possible in wireless networks MPEG video coding is usually used to reach the bandwidth constrains of the links. The video quality and compression ratio depends on Group of Pictures (GOP) structure, but it also affects the distortion sensitivity of the video stream due to packet losses. In this paper the correlation between GOP size, packet loss ratio and video quality is investigated. By increasing the distance between the reference frames the effectiveness of coding can be improved, but on the other hand the effect of error propagation due to packet losses also increases. Our aim was to find the optimal GOP structure to maximize the coding efficiency and minimize the quality distortion due to error propagation. We have implemented a simulation tool to make the analysis of differently structured video streams transmitted over lossy channels.
130
Fr. SS. 31.5 16:00‐16:15
Signal Processing for Biologically Inspired Sensors
P. Sattigeri, J. J. Thiagarajan, K. N. Ramamurthy, B. Konnanath, T. Mathew, A. Spanias, M. Goryll, T. Thornton, S. Prasad and S. Phillips
SenSIP and CSSER Centers, School of ECEE, Arizona State University, Tempe, USA
Abstract—Pores or channels with diameters in the range of nanometers up to micrometers can be used as Coulter counting apertures to detect particles and organic molecules such as proteins. Coulter counting is performed by applying a constant potential across a nano‐ or micropore while recording the drop in ionic current upon passage of a molecule. Looking at the shape and duration of these current pulses enables us to estimate the size as well as the concentration of these molecules. Discrimination between different analytes can be performed by extracting appropriate features from the Coulter signals (events) and using them for classification. The challenge in being able to identify particular analytes is that a drop in current can also be caused by a molecule bouncing off the pore wall rather than moving through the micropore. Such drops are called nonevents and can be discriminated from the events using Support Vector Machines. In this paper, we consider the amplitude of the current drop and the duration of the current pulse as features to determine if an event occurred. The proposed approach uses the Dirichlet process mixture model to cluster the data in the feature domain as the type of the events in the signal record is unknown. Results obtained show that the Dirichlet process mixture model accurately finds the types of events and their count for each signal record.
Fr. SS. 31.6 16:15‐16:30
Segmentation of Macroscopic Slice Images for Colorectal Cancer Evaluation
Styliani Petroudi1 and Michael Brady2
1University of Cyprus, Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus
2Wolfson Medical Vision Lab, Department of Engineering Science, University of Oxford, UK
Abstract—Colorectal cancer is the third most common cancer diagnosed. Depending on the extent of the disease, radiotherapy and surgery are currently the only curative therapies. When surgery is performed, the shortest distance from affected regions to the resection boundary is an important predictive factor for prognosis of the disease. This article will present segmentation of the rectal wall in macroscopic slices from resected specimens. The algorithm uses texture information for characterizing different regions in the macroscopic slices. Segmentation is achieved using Level Sets. The segmentation results provide landmarks for volume reconstruction and information for comparison between pathology images and MRI.���
� 129
Fr. SS. 31.3 15:30‐15:45
Bayesian estimation of dynamic systems function expansions
Georgios Mitsis1 and Saad Jbabdi2
1Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus; 2Centre for Functional Magnetic Resonance Imaging of the Brain, University of Oxford, United Kingdom
Abstract—Orthonormal function expansions have been used extensively in the context of linear and nonlinear systems identification, since they result in a significant reduction in the number of required free parameters. In particular, Laguerre basis expansions have been used in the context of biological/ physiological systems identification, due to the exponential decaying characteristics of the Laguerre orthonormal basis, the rate of which is determined by the Laguerre parameter _. A critical aspect of the Laguerre expansion technique is the selection of the model structural parameters, i.e., polynomial model order for nonlinear systems, number of Laguerre functions and value of the Laguerre parameter _. This selection is typically made by trial‐and‐error procedures on the basis of the model prediction error. In the present paper, we formulate the Laguerre expansion technique in a Bayesian framework. Based on this formulation, we derive analytically the posterior distribution of the _ parameter and the model evidence, in order to perform model order selection. We also demonstrate the performance of the proposed method by simulated examples and compare it to alternative statistical criteria for model order selection.
Fr. SS. 31.4 15:45‐16:00
Dynamic Range Extension Using Multiple A/D Converters
Lakis Christodoulou1, John Lane2 and Takis Kasparis1 1Cyprus University of Technology, Cyprus; 2Cyprus University of Central Florida, USA
Abstract—Data acquisition boards with high bit‐resolution ADCs such as 24 and 32 bits are relatively expensive as compared to standard 16, 12, and 8 bit systems. There is however a wide availability of low‐cost boards with multi‐channel A/D conversion, usually at 8 or 12 bits per sample. The method described in this paper utilizes multi‐channel conversion of the same signal, and then reconstructs a single signal at higher dynamic range. The method was motivated by the need to acquire raindrop impact sensor signals of wide amplitude variations using an ordinary portable computer. Even though this method may not be suitable for high‐fidelity audio capture, without significant modifications, it provides a low‐cost solution for instrumentation applications.
128
Friday Afternoon, 5th March
Session: Special Session on Advances in DSP
Time & Place: 15:00‐16:30 ‐ Salaminia
Chairperson: Andreas Spanias
SenSIP and CSSER Centers, School of ECEE, Arizona State University, Tempe, USA
Fr. SS. 31.1 15:00‐15:15
Minimax Rate Distortion for a Class of Sources
Farzad Rezaei1, Photios Stavrou2, Charalambos Charalambous2 and Christos Kourtellaris2
1University of Ottawa; 2University of Cyprus
Abstract—This paper deals with rate distortion or source coding with fidelity criterion, in measure spaces, for a class of source distributions. The class of source distributions is described by a relative entropy constraint set between the true and a nominal distribution. The rate distortion problem for the class is thus formulated and solved using minimax strategies, which result in robust source coding with fidelity criterion. It is shown that minimax and maxmin strategies can be computed explicitly, and they are generalizations of the classical solution. Finally, for discrete memoryless uncertain sources, the rate distortion theorem is stated for the class omitting the derivation while the converse is derived.
Fr. SS. 31.2 15:15‐15:30
Design of Nearly Linear‐Phase Recursive Digital Filters by Using Unconstrained Least‐pth Minimax Optimization
Andreas Antoniou, Sunil Belur Nagaraj and Rajeev Nongpiur
Department of Electrical and Computer Engineering, University of Victoria, Victoria, Canada
Abstract—A method for the design of nearly linear‐phase recursive digital filters is proposed. The recursive filter is assumed be a cascade arrangement of second‐order biquadratic sections whose transfer functions are expressed in the polar form. An error function is formulated based on the difference between the actual complex frequency response of the filter and the desired frequency response. Then by using a least‐pth minimax algorithm, the required design is obtained. The new method achieves filter stability through the use of a parameterization scheme based on the so‐called sigmoid function and it incorporates a mechanism by which an arbitrary prescribed stability margin can be achieved. The optimization engine used in the least‐pth algorithm is an unconstrained quasi‐Newton algorithm based on the Broyden‐Fletcher‐Goldfarb‐Shanno updating formula and it incorporates a nonuniform adaptive variable sampling technique to prevent spikes in the error function. Several filter design examples demonstrate that the proposed method is very efficient in terms of computational effort required since it is an unconstrained method and, furthermore, it can yield designs that are superior relative to some of the known state‐of‐the‐art methods.
� 127
Th. 30.6 16:15‐16:30
Modeling of an Impact Transducer for In Situ Adaptive Disdrometer Calibration
Takis Kasparis1 and John Lane2
1Cyprus University of Technology, Cyprus; 2University of Central Florida, USA;
Abstract—In situ calibration of a rainfall impact disdrometer using a collocated tipping bucket rain gauge has been previously reported. Several factors affect the accuracy of this technique. These include the specific mathematical model of the transducer, tipping bucket errors, clock/time accuracy, switch delay time and calibration reference window used to update the transducer model coefficients. In this work, two general forms of an empirical transducer model have been investigated: a simple two‐coefficient power‐law and an Nth order polynomial, where the input is a specific measure of the electrical signal from the transducer and the output is the hydrometeor diameter. Even though previous work allowed for a more general non‐linear transducer model description, the subsequent implementation of an adaptive calibration algorithm required use of a steepest descent recursive gradient search algorithm, which can be difficult to implement in a real‐time system. Linear transducer models allow an implementation suitable in a real‐time signal processing system.
126
Th. 30.3 15:30‐15:45
A Robust Predictive Controller Based on GOBF Modelling and LMIs Technique for a MIMO System
Jalel Ghabi1, Ali Douik1 and Hassani Messaoud1,2
1Laboratory ATSI “Automatique Traitement de Signal et Imagerie” in the National School of Engineers of Monastir‐Tunisia; 2National School of Engineers of Monastir‐Tunisia;
Abstract—In this paper we develop an algorithm for robust model predictive control for Multi‐Inputs Multi‐Outputs systems represented by the Generalized Orthonormal Basis Functions. A min‐max optimization problem is reformulated and resolved by introducing techniques of Linear Matrix Inequalities where the constraints interest the parameter uncertainties of the resultant model coefficients and the measurement signals.
Th. 30.4 15:45‐16:00
An Auto‐Zeroing Current‐Starved Floating‐Gate Band Pass Filter
Mehdi Azadmehr and Yngvar Berg
Vestfold University College, Institute of Microsystem Technology, Horten, Norway
Abstract—In this paper we present Auto‐Zeroing Current‐ Starved Floating‐Gate Amplifier(AZCSA). In addition to gain, the amplifier allows frequency band adjustment, suited for designing time‐continuous analog filters. The Auto‐Zeroing Current‐Starved Floating‐Gate Amplifier(AZCSA) is based on two previously presented floating‐gate amplifiers. The AZCSA uses the advantages of these two amplifiers regarding the frequency band adjustment to improve the possibility of adjusting the lowest and highest cut‐off frequencies. The AZCSA enjoys low component spread and compactness, containing only minimum size transistors and capacitors. The simulations presented in this paper are valid for the 90nm CMOS transistor models from STM having a VDD equal to 1.2V and threshold voltage of 0.25V.
Th. 30.5 16:00‐16:15
On the Non‐negative Impulse Response of Continuous‐Time Multi‐Dimensional Systems
Yuzhe Liu and Peter Bauer
Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA
Abstract—This paper presents sufficient conditions on 1‐D pole‐zero patterns that exhibit a non‐negative impulse response (NNIR) for several classes of multi‐dimensional (m‐D) hyperplanar filters in the continuous‐time (C‐T) domain. The results provide some intuitive ideas about 1‐D to m‐D variable substitutions that preserve the positivity/non‐negativity property, and are useful for constructing m‐D NNIR filters from 1‐D prototypes.
� 125
Friday Morning, 5th March
Session: Systems and Control II
Time & Place: 15:00‐16:30 ‐ Amathousia
Chairperson: Peter Bauer
Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA
Th. 30.1 15:00‐15:15
Control and Estimation of Downhole Pressure in Managed Pressure Drilling Operations
Jing Zhou and Gerhard Nygard
Petroleum Department, International Research Institute of Stavanger, Bergen, Norway
Abstract—This paper presents a nonlinear adaptive observer and a simple model‐based control scheme to stabilize the annular pressure profile throughout the well bore continuously while drilling. A simple mechanistic model is presented that captures the dominant phenomena of the drilling system and forms the basis for model‐based observer and control design. A new nonlinear adaptive observer is developed for estimation downhole pressure. A simple PI controller is designed to stabilize the annular pressure and achieve tracking by applying feedback control of the choke valve opening and the main pumps.
Th. 30.2 15:15‐15:30
A New Adaptive Control of a Double‐electromagnet Suspension System
R. Barzamini1, H. A. Talebi1, A. R. Yazdizadeh2 and H. Eliasi1
1Faculty of Electrical Engineering, Amirkabir University of Technology, Tehran, Iran; 2Faculty of Electrical Engineering, Power and Water University of Technology, Tehran, Iran
Abstract— In this paper an adaptive controller is presented that addresses the coupling effects between two groups of electromagnetic trains. The main application of DEM (Double Electro‐Magnet) is rapid rail transportation. Since the number of passengers is stochastic, the mass of the train will be variable too. On the other hand, due to the variation of the DEM parameters (such as coil inductance) in a real environment, the system is to be controlled in a proper manner. The proposed method in this paper overcomes all of these problems. The module, based on some reasonable assumptions of nonlinear mathematical model, is modeled as a double‐electromagnet system. The proposed algorithm has a satisfying performance in tracking in presence of unknown changes in the mass. The advantage of the proposed algorithm in comparison to non‐linear controllers is that knowing the mass changes is not necessary. It is also important to make sure that a control system is robust against measurement noises, because all sensors collect noise from the environment. Due to the presence of input and output perturbation, the new proposed algorithm shows satisfying performance. The results show that the proposed method is less sensitive to perturbation in the input.
124
Fr. 29.3 15:30‐15:45
A Constrained Constant Modulus Algorithm Based on Uniform Linear Arrays
Lei Zhang, Wei Liu and Richard Langley
Communications Research Group, Department of Electronic and Electrical Engineering, University of Sheffield, UK
Abstract—A novel constant modulus algorithm (CMA) is proposed based on a uniformly spaced linear array by constraining its weight vector to a specific conjugate symmetric form. The constraint is derived from the beamformer with an optimum output signal to interference plus noise ratio (SINR). The effect of the additional constraint is equivalent to adding a second step to the original adaptive algorithm. With this constraint, the modified CMA will always generate a weight vector in the desired form for each update and the number of variables is effectively reduced by half, leading to a faster convergence rate and an improved SINR performance. The proposed idea is general and can be extended to many other variations of the standard CMA.
Fr. 29.4 15:45‐16:00
Frame Synchronization among Base Stations for TDD Systems
Tetsuei Wada, Takao Hara and Minoru Okada
Graduate School of Information Science, Nara Institute of Science and Technology, Nara, Japan
Abstract—In this paper, we propose a new frame synchronization method for femtocell base station (BS) in TDD (Time Division Duplex) systems. The proposed femtocell BS establishes the synchronization by receiving transmitted signals from adjacent BSs. In order to establish the precise frame synchronization, the distances between the femtocell BS and the adjacent BSs should be known. So, we introduce a method for estimating a position of a femtocell BS to our proposed method. By making use of the estimated position, we derive the propagation delay time from adjacent BSs to a femtocell BS. By using computer simulation, we indicate that our proposed method enables frame synchronization with a sufficient accuracy under difficult circumstances which degrade the accuracy of positioning affected by multipath and so on.
Fr. 29.5 16:00‐16:15
Sigma‐Delta Modulation Technique for Low Noise Fractional‐N Frequency Synthesizer
Nahid Fatahi and Hooman Nabovati
Department of Electrical Engineering, Sadjad University, Mashhad, Iran
Abstract—The fractional‐N frequency synthesis technique provides agile switching in narrow channel spacing systems and alleviates phase‐locked loop (PLL) design constraints for phase noise and reference spur. A sigma‐delta modulator is represented in this work which reduces spur in output frequency spectrum of the fractional‐N frequency synthesizers (FS). This technique also improves the performance of the frequency synthesizer. A fractional‐N frequency synthesizer is designed by employing a third‐order MASH modulator. A fourth order type II PLL with two out of band poles are used to suppress quantization noise of the modulator. The in‐band phase noise of ‐95 dBc/Hz at 10‐kHz offset with a spur of less than ‐96 dBc is achieved with a reference frequency of 8 MHz and a loop bandwidth of 40 kHz.
� 123
Friday Afternoon, 5th March
Session: Synchronization and Equalization
Time & Place: 15:00‐16:30 ‐ Daphne
Chairperson: Hidekazu Taoka
Access Network Development Department, NTT DOCOMO, Kanagawa, Japan
Fr. 29.1 15:00‐15:15
MMSE Timing Recovery using Multi‐Channel Early‐Late Gates for Analog Multi‐Tone System
Tsutomu Takeya and Tadahiro Kuroda
Department of Electronics and Electrical Engineering, Keio University, Yokohama, Japan
Abstract—A timing recovery scheme for high‐speed wireline multi tone communication systems called Analog Multi‐Tone (AMT) has been proposed. An accurate timing recovery is essential to a reliable high‐speed AMT system which demodulates in analog domain. However, it is difficult to apply conventional digital domain timing recovery algorithms to AMT systems because of the limitations of power consumption and area occupation. This paper proposes a new timing recovery scheme for AMT systems without high‐speed high‐resolution ADCs. The proposed scheme minimizing mean square error (MSE) by sign‐sign least mean square (SS‐LMS) algorithm successfully estimates the timing offset for timing recovery. We call the proposed scheme multi‐channel early‐late gates because it is an extension of conventional early‐late gate. The constellation diagram of demodulated signals after timing recovery and the convergence curves of timing estimate and MSE are simulated for performance evaluation. The simulation results indicate that the proposed scheme successfully estimates the timing offset for timing recovery in AMT systems without high‐speed high‐resolution ADCs and complex digital processing units.
Fr. 29.2 15:15‐15:30
Efficient Phase Noise Modelling of a PLL‐Based Frequency Synthesizer
Goulven Eynard, Noëlle Lewis and Dominique Dallet
IMS‐Bordeaux 1 University, France
Abstract—This paper proposes a computationaly‐efficient procedure dedicated to time‐domain phase noise (PN) modeling of a phaselocked loop (PLL)‐based frequency synthesizer in a radio‐frequency (RF) context. The structure proposed is able to describe any kind of PN including thermal and flicker noise regions using time‐domain equations. The design process of the phase noise modeling process is detailed. An expression of the estimated mean square error (MSE) of the frequency response of the PN generating system is proposed and compared to a previously proposed PN generating system. The spectral behaviour of the simulated frequency synthesizer is compared to practical PN measurements obtained with a spectral analyzer.
122
Fr. SS. 28.5 16:00‐16:15
Partner Selection in Cooperative Networks: Efficiency vs Fairness in Ricean Fading Channels"
Paolo Castiglione1, Stefano Savazzi2, Monica Nicoli2 and Gerald Matz3
1Telecommunication Research Center Vienna Vienna, Austria; 2Dip. di Elettronica e Informazione, Politecnico di Milano, Milano, Italy; 3INTHFT, Vienna University of Technology, Vienna, Austria
Abstract—Enabling collaboration among users to relay messages for others is crucial to efficiently assign network resources and maximize network goodput. However, in some cases subsets of users would prefer a selfish behavior (by refusing cooperation) to protect their own performance. Depending on the application and on the particular propagation environment, an efficient grouping algorithm that assigns partners at MAC layer should conveniently address the problem of maximizing the network goodput without penalizing the performances of single users. This can be done by including specific constraints (user‐fairness) that pose limitations on the amount of resources, e.g. energy, that might be reserved for relaying information of partners. In this paper the partner selection algorithms are designed to maximize the network lifetime while guaranteeing user‐fair assignments. We analyze the network lifetime gain that can be achieved in a realistic network where fading significantly differs from Rayleigh and propose a novel low‐complexity partner selection algorithm that maximizes the energy efficiency of the network while guaranteeing the given fairness constraint for each user.
Fr. SS. 28.6 16:15‐16:30 Opportunistic Routing with Congestion Diversity and Tunable Overhead
Mohammad Naghshvar and Tara Javidi
Department of Electrical and Computer Engineering, University of California San Diego, CA, USA
Abstract—The main challenge in the design of minimum‐delay routing policies in wireless multi‐hop networks is balancing the trade‐off between routing the packets along the shortest paths to the destination and controlling the congestion by distributing traffic across the network. This has been the key idea behind the design of opportunistic routing policy with congestion diversity (ORCD). In particular, ORCD uses a measure of draining time to opportunistically identify and route packets along the paths with an expected low overall congestion. This paper studies the computational complexity and overhead cost associated with ORCD. Furthermore, two practical modifications of ORCD will be proposed which allow for the implementation of ORCD with low computational complexity and reduced overhead cost. Finally, the paper provides numerical examples characterizing the trade‐off between performance and overhead.
� 121
Fr. SS. 28.3 15:30‐15:45
Cooperative Relaying in Car‐to‐Car Communications: Initial Results from an Experimental Study
Günther Brandner1, Udo Schilcher1, Christian Bettstetter2
1University of Klagenfurt, Mobile Systems Group, Institute of Networked and Embedded Systems, Austria; 2Lakeside Labs GmbH, Klagenfurt, Austria
Abstract—This paper reports on an experimental study about some benefits of cooperative relays in mobile wireless communications. A basic technique for cooperative relaying is implemented in the programmable hardware platform WARP. Using this implementation, measurements are made for mobile car‐to‐car communications in a suburban environment. Each of three cars is equipped with a transceiver and serves as sender, relay, or destination, respectively. Results demonstrate that cooperative relaying communications exhibit performance gains over conventional direct communications and time‐diversity communications in terms of packet delivery rate, bit error rate, and packet error rate. We account for energy fairness by using half transmission power for cooperative relaying and time diversity communications.
Fr. SS. 28.4 15:45‐16:00
Sum‐rate Optimized Power Allocation for the OFDM Multiple Access Relay Channel
Mohieddine El Soussi, Abdellatif Zaidi, Jérôme Louveaux and Luc Vandendorpe.
Communications and Remote Sensing Laboratory, Louvain School of Engineering, Louvain‐la‐Neuve, Belgium
Abstract—We consider transmission over a set of parallel MARCs (multiple‐access relay channel) based on the OFDM (Orthogonal Frequency Division Multiplexing) modulation. Two users communicate to a common destination (D) with the help of a relay (R) over a set of parallel channels. The relay operates in decode and forward (repetition coding type) and half duplex modes. The problem considered is the maximization of the total sum rate at the destination by optimal allocation of the power to the different carriers for the users and the relay. The problem is investigated for a sum power constraint. We show that for each carrier only one user should be relayed at most, and the other user should communicate over the direct link. Unlike the classical MAC, we show that there exist cases where both users should share the same carrier to transmit symbols and this increases the rate. For these carriers, there exist, considering both the relay and the destination, four possible decoding orders. As the problem is non‐convex and non‐linear, it is not easy to a‐priori select the best decoding order (at the relay and the destination), and which user should be relayed. An algorithm is proposed to solve the global optimization problem. The theoretical results are illustrated by computational results.
120
Friday Afternoon, 5th March
Session: Special Session on Cooperative Methods in Wireless Networks
Time & Place: 15:00‐16:30 ‐ Daphne
Chairpersons: Petros Elia and Dirk Slock
EURECOM, Mobile Communication Department, Sophia Antipolis, France
Fr. SS. 28.1 15:00‐15:15
Relay Selection for Joint Resource Allocation in Cooperative Multiflow Wireless Networks
Gareth Middleton, Behnaam Aazhang
Rice University Houston, Texas, USA
Abstract—We study an integrated multiflow network model, in which physical‐layer rate control and link‐layer medium access and routing decisions are jointly optimized. In particular, we explore the challenges involved in incorporating the threeterminal cooperative paradigm into such a broader resource allocation problem. We present several methods for defining cooperative units within the larger network, all of which introduce various levels of complexity into the resource allocation algorithm. Results show the benefits of utilizing cooperation over traditional routing, and further demonstrate that the routing and cooperative grouping decisions must be taken jointly.
Fr. SS. 28.2 15:15‐15:30
Implicit cooperation in distributed energy‐efficient networks"
M. Le Treust, S. Lasaulce and M. Debbah Affiliation [missing]
Abstract—We consider the problem of cooperation in distributed wireless networks of selfish and free transmitters aiming at maximizing their energy‐efficiency. The strategy of each transmitter consists in choosing his power control (PC) policy. Two scenarios are considered: the case where transmitters can update their power levels within time intervals less than the channel coherence time (fast PC) and the case where it is updated only once per time interval (slow PC). One of our objectives is to show how cooperation can be stimulated without assuming cooperation links between the transmitters but only by repeating the corresponding PC game and by signals from the receiver. In order to design efficient PC policies, standard and stochastic repeated games are respectively exploited to analyze the fast and slow PC problems. In the first case a cooperation plan between transmitters, that is both efficient and relies on mild information assumptions, is proposed. In the second case, the region of equilibrium utilities is derived from very recent and powerful results in game theory.
� 119
Fr. 27.6 14:45‐15:00
Fast Method to Detect Specific Frequencies in Monitored Signal
Marwan Jaber and Daniel Massicotte
Université du Québec à Trois‐Rivières, Electrical and Computer Engineering Department, Laboratory of Signal and System Integrations, Canada
Abstract—The Discrete Fourier Transform (DFT) is a mathematical procedure that stands at the center of the processing that takes place inside a Digital Signal Processor. It has been known and argued through the literatures that the Fast Fourier Transform (FFT) is useless in detecting a specific frequency in a monitored signal because most of the computed results are ignored. In this paper we will present an efficient FFT based method to detect specific frequencies in a monitored signal which is compared to the most frequently used method “the Goertzel's Algorithm”. Computational Speedup gains of r using radix‐r butterfly are shown.
�
118
Fr. 27.3 14:00‐14:15
Efficient Processing of JPEG2000 Imagery
Eric Balster and William Turri
Dept. of Electrical and Computer Engineering, University of Dayton, Kettering Laboratory, rm 341, 300 College Park, Dayton, OH, USA
Abstract—Although optimal truncation of JPEG2000 compressed imagery provides an image of the highest quality per bitrate in terms of PSNR, the algorithm is highly computationally inefficient because of the removal of compressed image sections that have been previously calculated. The proposed idea utilizes a simple quantization technique prior to Tier I coding to remove many of the coding passes from the imagery that would not become a part of the final compressed bitstream. A new method based on the this idea is discussed. The method restricts the quantization value to be a power of 2, effectively eliminating the least significant bits of each codeblock through the quantization step, providing substantial reduction in computational complexity, a 39% reduction in overall complexity at 0.25 bits per pixel. The new method gives an equivalent rate distortion curve as traditional optimal truncation.
Fr. 27.4 14:15‐14:30
A combined Teager‐Huang and Hough Transforms for LFM Signals Detection
Jean‐Christophe Cexus1, Abdel‐Ouahab Boudraa1,2 and Abdelkhalek Bouchikhi1,2
1ENSIETA, France; 2Ecole Navale, Brest, France
Abstract—A new method for linear FM (LFM) signals detection in the time‐frequency plane using Teager‐Huang Transform (THT) is proposed. Time‐Frequency Representation (TFR) is viewed as an image where image processing techniques are applied to detect frequency patterns of interest. THT is used in conjunction with Hough Transform (HgT) called (THHT), where the output is a TFR free of cross‐terms. THHT is applied to signals composed of LFM and the results are compared to Wigner‐Ville Distribution‐HgT and smoothed Wigner‐Ville Distribution‐HgT. Results show the good performance of the THHT in terms of detection and estimation compared to WVD based methods.
Fr. 27.5 14:30‐14:45
Non‐iterative frequency estimation in the DFT magnitude domain
Ricardo Sousa and Aníbal Ferreira
University of Porto, FEUP‐DEEC, Portugal
Abstract—The accurate estimation of the frequency of sinusoids is a frequent problem in many signal processing problems including the real‐time analysis of the singing voice. In this paper we rely on a single DFT magnitude spectrum in order to perform frequency estimation in a non‐iterative way. Two new frequency estimation methods are derived that are matched to the time analysis window and that reduce the maximum absolute estimation error to about 0.1% of the bin width of the DFT. The performance of these methods is evaluated including the parabolic method as a reference, and considering the influence of noise. A combined model is proposed that offers higher noise robustness than that of a single model.
� 117
Friday Afternoon, 5th March
Session: DSP Implementation and Time‐frequency analysis
Time & Place: 13:30‐15:00 ‐ Salaminia
Chairperson: Charis Theeocharides University of Cyprus, Cyprus
Fr. 27.1 13:30‐13:45
Dimensional characterization of an elastic tube using the spectrogram and the reassigned spectrogram time‐frequency analysis
Latif Rachid1, Aassif Elhoucein2, Laaboubi Mostafa2 and Maze Gerard3
1ESSI, ENSA, Université Ibn Zohr, Agadir, Maroc; 2LMTI,Université Ibn Zohr, Agadir, Maroc; 3LOMC, Laboratoire des Ondes et Milieux Complexes, Le Havre, France
Abstract—The dimensional characterization of an elastic tube can be done thanks to its cut‐off frequencies of the waves propagating around the tube. In this work, we propose to determine certain geometrical properties of a tube such as the radii radio b/a. The spectrogram and the reassigned spectrogram time‐frequency representation of a signal are used in this work to access to the sought parameters. These techniques are applied to the acoustic signals backscattered by a copper tube immersed in water. The time‐frequency images of this signal permit to determine the cut‐off frequency of the anti‐symmetric wave A1. From these frequencies we have determined with precision the radii radio b/a of the tube.
Fr. 27.2 13:45‐14:00
Asynchronous ADC with Configurable Resolution and Binary Tree Structure
Nikos Petrellis1, Michael Birbas1, John Kikidis1 and Alex Birbas2
1Analogies SA, Patras Science Park, Patras, GREECE; 2University of Patras, Rio‐Patras, GREECE
Abstract—An Analogue to Digital Converter (ADC) implemented in CMOS technology (90nm TSMC) is described in this paper which is based on a binary tree structure and has a configurable 4, 8 or 12‐bits resolution. The function performed at the nodes of the binary tree is an integer division by a proper power of 2, that is implemented by a novel circuit. The developed ADC system is an asynchronous circuit operating in current mode needing only a small number of components. This fact in conjunction with the binary tree structure of the ADC architecture, lead to implementations with very low die area and power consumption (0.12mm2 and 72mW respectively for 12‐bit resolution). The average sampling rate exceeds 140MS/s for 12‐bit resolution. The proposed device can also be used in multi Gbps time‐interleaved parallel ADC due to its very low die area and power consumption.
116
Fr. SS. 26.3 14:10‐14:30
Quantum System Identification: Hamiltonian Estimation using Spectral and Bayesian Analysis
Sophie G Schirmer1, Frank C Langbeiny2
1Department of Applied Maths & Theoretical Physics, Univ. of Cambridge, UK; 2School of Computer Science, Cardiff University, UK
Abstract—Identifying the Hamiltonian of a quantum system from experimental data is considered. General limits on the identifiability of model parameters with limited experimental resources are investigated, and a specific Bayesian estimation procedure is proposed and evaluated for a model system where apriori information about the Hamiltonian’s structure is available.
Fr. SS. 26.4 14:30‐15:00
Round table discussion on outstanding quantum and other control problems
� 115
Friday Afternoon, 5th March
Session: Special Session on Quantum Control II
Time & Place: 13:30‐15:00 ‐ Amathousia
Chairpersons: Edmond A. Jonckheere
Department of Electrical Engineering and Mathematics, University of Southern California, Los Angeles, CA, USA
Alireza Shabani
Princeton University, Chemistry Department, Princeton, NJ, USA
Sophie Schirmer
Department of Applied Mathematics and Theoretical Physics University of Cambridge, Cambridge, UK
Fr. SS. 26.1 13:30‐13:50
Back and forth nudging for quantum state reconstruction
Ashley Donovan1, Mazyar Mirrahimi2, Pierre Rouchon3
1Department of Chemistry, Princeton University, Princeton; 2 INRIA Paris‐Rocquencourt, France; 3Centre Automatique et Systèmes, France
Abstract—We propose an estimation method to identify the initial state of a quantum system based on the continuous weak measurement of a certain physical observable over a fixed interval of time. The algorithm is based on the back‐and‐forth nudging method consisting of iterative application of Luenberger observers for the time‐forward and time‐backward dynamics. A clever change of variables unveils the needed symmetry in the observer design leading to the decrease of a certain distance (in an appropriate metric) between the estimator and the main system, both in forward and backward directions.
Fr. SS. 26.2 13:50‐14:10
Pure State Stabilization with Discrete‐Time Quantum Feedback
Saverio Bolognani and Francesco Ticozzi
Dipartimento di Ingegneria dell’Informazione, Universit`a di Padova, Italy
Abstract—Global asymptotic stabilization of quantum pure states is relevant to chemical process control, quantum cooling, state purification, and is crucial to the initialization of quantum information processing algorithms. We provide a linear‐algebraic characterization of discrete‐time Markovian dynamics leading to invariance and attractivity of a given quantum state. Assuming that the system is unitarily controllable, and accessible via a given quantum measurement, we provide a condition that that characterize the stabilizable target states. We also argue that if the control problem is feasible, then an effective control choice can be explicitly constructed. The result strongly relies on some remarlable properties of a canonical QR decomposition for complex matrices.
114
Fr. 25.5 14:30‐14:45
Stochastic Characterization of Amplified Photons in Lightwave Systems with Optically Bistable Elements
Hooman Abediasl, Ali Naqavi, Khashayar Mehrany and Jawad Salehi
Optical Network Research Laboratory (ONRL), School of Electrical Engineering, Sharif University of Technology, Tehran, Iran
Abstract‐ An optical amplifier followed by a bistable element is statistically analyzed. To this end, the birth‐death‐immigration model and the coupled mode theory are used to characterize the amplifier and the bistable element, respectively.
� 113
Fr. 25.3 14:00‐14:15
A DVB‐T2 Receiver Realization based on a Software‐Defined Radio Concept
Christian Kocks1, Alexander Viessmann1, Andreas Waadt1, Christoph Spiegel1, Admir Burnic1, Guido Bruck1, Peter Jung1, Jaeyoel Kim2, YeonJu Lim2 and Hyeon Woo Lee2
1University of Duisburg‐Essen, Department of Communication Technologies, Duisburg, Germany; 2Samsung Electronics, Global Standards and Research Lab. Suwon, Korea
Abstract—When DVB‐T (Terrestrial Digital Video Broadcasting) was introduced in the 1990s, it was impossible to foresee the upcoming demand for HDTV devices. Thus, a revision of this broadcasting standard, namely DVB‐T2, was necessary. Recently finalized, this standard is targeting to high definition television (HDTV). To pave the way to commercialization, an appropriate implementation concept and its corresponding validation are of utmost importance. Without a doubt, the most challenging requirements introduced by the DVB‐T2 specification are an FFT (Fast Fourier Transform) size of up to 32k samples, 256‐QAM (Quadrature Amplitude Modulation) and LDPC (Low‐Density Parity‐Check) coding with a block size of 64800 bits. Within this manuscript, the authors present a software‐defined radio based realization of a demonstrator platform. This platform employs a combined DSP (Digital Signal Processor) and FPGA (Field‐ Programmable Gate Array) solution being capable of meeting these requirements.
Fr. 25.4 14:15‐14:30
Hardware Implementation of a Viterbi Decoder Using the Minimal Trellis
Richard D Souza, Bruno U Pedroni and Volnei A Pedroni
Federal Technological University of Paraná (UTFPR) – Curitiba – PR – Brazil
Abstract—McEliece and Lin introduced the minimal trellis for convolutional codes, which can be considerably less complex than the conventional trellis typically used to construct Viterbi decoders. The authors state that this reduced trellis complexity can lead to less complex Viterbi decoders in practice. In this paper, we compare conventional and minimal Viterbi decoders for a rate 2/3 convolutional code considered by McEliece and Lin, which possesses a minimal trellis with half of the complexity of the conventional trellis. The decoder circuits were implemented in Altera programmable logic devices. We show that, though the complexity measure used by McEliece and Lin does not translate directly to practice, reductions in power consumption and hardware utilization, along with increased maximum operating frequency, can indeed be obtained for the decoders.
112
Friday Afternoon, 5th March
Session: Receiver Design
Time & Place: 13:30‐16:30 ‐ Daphne
Chairperson: Carl James Debono
Department of Communications and Computer, Engineering, University of Malta, Msida, Malta
Fr. 25.1 13:30‐13:45
Paths Complex Gain Tracking Algorithms for OFDM Receiver in Slowly‐Varying Channels
Laurent Ros1, Hussein Hijazi2 and Eric Pierre Simons2
1GIPSA‐lab, Image and Signal Department, France; 2IEMN lab, TELICE group, IEMN/UMR, France
Abstract—This paper deals with channel estimation for Orthogonal Frequency Division Multiplexing (OFDM) systems over time‐varying fading channels. In conventional methods, the leastsquares (LS) estimate is obtained over the pilot subcarriers, and next interpolated over the entire frequency grid. Those methods only exploit the frequency‐domain correlation of the channel. In this paper, we propose to exploit both the time‐domain correlation and the nature of the wireless radio channel. Assuming the availability of delay related information, we propose to track the variation of the paths complex amplitudes by means of online recursive algorithms. We developed two simple sub‐optimal algorithms based on second‐order loops which exhibit a reduced complexity compared to that of the widely popular Kalman algorithm. The error signal is based on the LS estimate of the path complex gains for the first loop, and on the steepest‐descent method of the same LS cost function for the second loop. For each algorithm, we give derivations to correctly tune the loop coefficients. Simulation results show that our algorithms outperform the conventional methods. Moreover, the Mean Square Error (MSE) of the first algorithm is closer to the Bayesian Cramer Rao Bound than that of the Kalman filter.
Fr. 25.2 13:45‐14:00
Multi Pulse Position Amplitude Modulation for ultra‐high speed Time‐Hopping UWB communication systems over AWGN channel
Marijan Herceg, Drago Žagar and Dario Galić
Faculty of Electrical Engineering, Osijek, Croatia
Abstract— This paper presents a novel Multi Pulse Position Amplitude Modulation (MPPAM) scheme for time‐hopping ultra‐wideband (TH‐UWB) communication system. MPPAM is combined version of the Multi Pulse Position Modulation (MPPM) and the Pulse Amplitude Modulation (PAM) where the information is conveyed in the position and amplitude of multiple pulses. The comparison between PAM and Pulse Position Modulation (PPM) was given in aspect of symbol error probability over additive white Gaussian noise (AWGN) channel. It is shown that with proper selection of the amplitude level numbers, pulses and time slots can be achieved better performances at the cost of the hardware complexity and vice versa.
� 111
Fr. 24.5 12:00‐12:15
Blind Beamforming for Multi‐path Wideband Signals Based on Frequency Invariant Transformation
Wei Liu
Department of Electronic and Electrical Engineering, University of Shefield, Shefield, UK
Abstract—A novel approach for wideband beamforming in the presence of multi‐path signals is proposed based on a frequency invariant transformation. In this approach, the received array signals are first processed by a frequency invariant beamforming network and then an appropriate instantaneous blind source separation (BSS) algorithm is applied to its output to recover the signal of interest. It is shown that with the proposed structure, the cancelation of the desired signal due to multi‐path propagation is reduced, leading to a significantly improved output SINR (signal to interference plus noise ratio).
Fr. 24.6 12:15‐12:30
Blind Equalization Using Digital Watermarking
Muhammad Kashif Samee and Jürgen Götze
Information Processing Lab, Dortmund University of Technology, Dortmund, Germany
Abstract—In this paper a blind equalization method is presented, which uses the watermark of a transmitted watermarked signal as a reference training sequence. DS‐CDMA based spread spectrum watermarking scheme is used here. In this method, watermark is sent through the channel along with the watermarked image. On receiving side, watermark is extracted from the watermarked image and by using received and extracted watermark channel is estimated. Therefore, the receiver does not require to know the training sequence in advance. Afterwards, received data (watermarked image) is equalized by using Normalized LMS algorithm. Simulations have proven that this scheme is very effective in correcting errors from received watermarked images.
110
Fr. 24.3 11:30‐11:45
Spatial Weighted Averaging for ERP Denoising in EEG Data
Andriy Ivannikov, Tommi Kärkkäinen, Tapani Ristaniemi and Heikki Lyytinen
Finland University of Jyväskylä, Finland
Abstract—In the present paper we intend to improve the practical accuracy of ERP denoising methods proposed in earlier research by allowing them to take into account possible violations of the underlying assumptions, which often take place in practice. Here we consider ERP denoising approaches operating within the framework of the linear instantaneous mixing model that consist three steps: (1) forward linear transformation, (2) identification of the components related to signal and noise subspaces, (3) inverse transformation during which the components that belong to the noise subspace are disregarded, i.e. dimension reduction in the component space.The separation matrix is found based on problem‐specific assumptions formalized in terms of the second order statistics. The subspace separation problem is concerned rather than the source separation. For the purpose of increasing the accuracy of spatial separation of ERP and noise sources we propose a spatial weighted averaging method analogous to weighted averaging technique developed for single channel use, which takes into account variable variances of the sources over trials.
Fr. 24.4 11:45‐12:00
An Improved Solution to the Subband Blind Source Separation Permutation Problem Based on Optimized Filter Banks
Bo Peng1, Wei Liu1 and Danilo P Mandic2
1Communications Research Group, Department of Electronic and Electrical Engineering, University of Sheffield, UK; 2Communications and Signal Processing Research Group, Department of Electrical and Electronic Engineering, Imperial College London, UK
Abstract—Subband based blind source separation (BSS) has a great potential in solving the complicated convolutive mixing problems. However its performance is largely affected by the permutation ambiguity problem during the synthesis stage. Researchers have suggested methods to correct the permutation by using the correlation information between adjacent frequencies/subbands. In this paper, we propose an improved solution to this permutation problem based on a novel filter banks design method, which uses a model that includes inter‐subband correlations as part of the optimization criterion. Simulation results show that a much better subband permutation alignment has been achieved, leading to an improved overall separation result.
� 109
Friday Morning, 5th March
Session: Signal and Image Processing
Time & Place: 11:00‐12:30 ‐ Salaminia
Chairperson: Akira Taguchi
Tokyo City University, Tokyo, Japan
Fr. 24.1 11:00‐11:15
Optimal steering vector adaptation for linear filters leading to robust beamforming
Michal Natora1, Felix Franke2, Simon Broda3 and Klaus Obermayer1
1Institute for Software Engineering and Theoretical Computer Science, Berlin Institute of Technology, Berlin, Germany; 2Bernstein Center for Computational Neuroscience, Berlin, Germany; 3Department of Quantitative Economics, University of Amsterdam, Amsterdam, The Netherlands
Abstract—In many filter applications the exact steering vector is not know, and thus, robust beamforming methods have to be used. In this contribution, an algorithm which achieves robust beamforming via target tracking is proposed. In contrast to existing approaches, the algorithm works on sparse signals with arbitrary steering vector shapes, and the parameters of the algorithm are adapted in an optimal way. This is achieved by deriving and evaluating the probability of detection and false alarm for general steering vector mismatches. These probabilities are used to adjust the parameters, such that the number of false positive and false negative detections is minimal. Simulations confirm the theoretic results and show that the algorithm performs better than other approaches.
Fr. 24.2 11:15‐11:30
Reconstruction of Streams of Diracs Based on the State Space Method
Aitor Erdozain and Pedro Crespo
CEIT and TECNUN (Universidad de Navarra), 20009 Donostia‐San Sebastián, Spain
Abstract—The last decade, some signals with finite rate of innovation have been proved to be recoverable from the samples of their filtered versions. Different contributions have also been made to reduce the reconstruction error with noisy samples. In this work a new reconstruction method for aperiodic streams of Diracs is introduced, which reduces the computational problems arisen in other methods in the literature.
108
established Lie‐algebra rank condition, this is not sufficient unless in an n‐qubit system with connected coupling topology the candidate dynamic simple Lie algebra can be identified uniquely as the full unitary algebra su(2n). — Here we discuss simple tests confined to solving homogeneous linear equations in order to filter irreducible unitary representations of other candidate algebras of classical type (orthogonal ones and unitary symplectic ones). Finally, we give an outlook under which conditions algebras of exceptional type can also be ruled out.
Fr. SS. 23.3 11:40‐12:00
Open‐Loop Control Design via Parametrization Applied in a Two‐Level Quantum System Model
Markku Nihtilä
Department of Physics and Mathematics, University of Eastern Finland, Kuopio, Finland
Abstract—In the design of quantum computing devices of the future the basic element is the qubit. It is a two‐level quantum system which may describe population transfer from one steady‐state to another controlled by a coherent laser field. A four‐dimensional real‐variable differential equation model is constructed from the complex‐valued two‐level model describing the wave function of the system. The state transition matrix of the model is constructed via the Wei‐Norman technique and Lie algebraic methodology. The idea of parametrization using flatness‐based control, is applied to construct feasible input– output pairs of the model. This input drives the state of the system from the given initial state to the given final state in a finite time producing the corresponding output of the pair. The population transfer is obtained by nullifying part of the state vector via careful selection of the parameter functions.
Fr. SS. 23.4 12:00‐12:20
Control‐assisted decoherence‐free manifolds
E. Jonckheere1, A. Shabani2, A. T. Rezakhani3
1Department of Electrical Engineering, University of Southern California, Los Angeles; 2Department of Chemistry Princeton University Princeton; 3Department of Chemistry, University of Southern California, Los Angeles
Abstract—Quantum coherence of open quantum systems is usually compromised because of the interaction with the ambient environment. A “decoherence‐free subspace” (DFS) of the system Hilbert space is defined where the evolution remains unitary. In the absence of a priori existence of such subspaces, it seems natural that utilizing quantum control may help generate and/or retain a decoherence‐free evolution. Here, we generalize the traditional notion of DFS, and introduce time‐varying DFS wherein the system’s density matrix has a unitarily evolving subdensity corresponding to some given set of its eigenvalues (which we aim to preserve). This subspace is characterized from both topological and algebraic perspectives. In particular, we show that this DFS admits a complex vector bundle structure over a real‐analytic manifold (the decoherence‐free manifold).
� 107
Friday Morning, 5th March
Session: Special Session on Quantum Control I
Time & Place: 11:00‐12:30 ‐ Amathousia
Chairpersons: Edmond A. Jonckheere
Department of Electrical Engineering and Mathematics, University of Southern California, Los Angeles, CA, USA
Alireza Shabani
Princeton University, Chemistry Department, Princeton, NJ, USA
Sophie Schirmer
Department of Applied Mathematics and Theoretical Physics University of Cambridge, Cambridge, UK
Fr. SS. 23.1 11:00‐11:20
Invited Paper
Level Sets of Quantum Control Landscapes
Vincent Beltrani1, Jason Dominy2, Tak‐San Ho3 and Herschel Rabitz4 1Department of Chemistry, Princeton University; 2Program in Applied and Computational Mathematics, Princeton University; 3Department of Chemistry,Princeton University; 4Department of Chemistry, Princeton University
Abstract—A controlled quantum system possesses a search landscape defined by the observable value as a functional of the control field. Within the search landscape, there exist level sets of controls giving the same observable value. This paper focuses on level sets of the transition probability Pi!f . For transition probabilities 0 < Pi!f < 1, a first order diffeomorphic modulation observable response preserving homotopy (DMORPH) algorithm is utilized to investigate level sets. At the top of the control landscape, Pi!f = 1, a second order D‐MORPH algorithm is presented that can explore the perfect control level set. D‐MORPH is utilized to identify level set members that exhibit certain desirable secondary characteristics, e.g., minimal pulse fluence. Numerical simulations for finite level systems are presented to illustrate the variety of control behavior found across level set members.
Fr. SS. 23.2 11:20‐11:40
Invited Paper
Symmetry Principles in Quantum System Theory of Multi‐Qubit Systems Made Simple
Thomas Schulte‐Herbrüggen, Uwe Sander, Robert Zeier
Dept. Chemistry, Technical University Munich (TUM), 85747 Garching
Abstract—Controllability and observability of multi‐spin systems in architectures of various symmetries of coupling type and topology are investigated. We complement recent work [1] of explicitly determining the respective dynamic system Lie algebras and thereby also precise reachability sets under symmetry constraints. Here the focus is on the converse: under which conditions can the absence of symmetry be taken as an indicator of universality of the hardware architecture? More precisely, the absence of symmetry implies irreducibility and provides a convenient necessary condition for full controllability. Though much easier to assess than the well‐
106
Fr. SS. 22.5 12:00‐12:15
Range Estimation for MIMO Step‐Frequency Radar with Compressive Sensing
Yao Yu1, Athina Petropulu1 and Vincent Poor2
1Electrical & Computer Engineering Department, Drexel University, USA; 2School of Engineering and Applied Science, Princeton University, USA
Abstract—The authors recently proposed a parameter estimation technique for multiple‐input/multiple‐output (MIMO) radar systems that employ compressive sensing (CS), and which applies to the case of slowly moving targets. This technique is based on the use of a step‐frequency technique, and it allows angle, Doppler and range information to be estimated in a decoupled fashion. This decoupling significantly reduces the complexity of parameter estimation without a concurrent performance loss. The current paper considers the range‐estimation performance of this method for the particular cases of linear and random step‐frequency techniques. It is shown that the linear step‐frequency technique requires less bandwidth than the random step‐frequency technique in order to achieve the same performance.
� 105
Fr. SS. 22.3 11:30‐11:45
Transmit Policies for MIMO Radar Detection and Time‐Delay Estimation
Guido Jajamovich1, Marco Lops2 and Xiaodong Wang1
1Electrical Engineering Department, Columbia University, New York, NY, USA; 2ENSEEIHT/IRIT/INPT Toulouse ‐ France & DAEIMI, Universit`a degli, Studi di Cassino, Cassino (FR) ‐ ITALY
Abstract—This paper is aimed at investigating the role of Space‐Time Coding (STC) for target detection and time‐delay estimation through MIMO radars with widely spaced antennas. To this end we formulate the waveform optimization problem as a constrained maximization of some detection‐oriented figures of merit under an accuracy constraint. Interestingly, such an additional constraint deeply modifies the optimal transmit policy. We also offer closed‐form formulas of the Fisher Information in target delay estimation as a function of the singular values of the code matrix. Numerical results validating the theoretical findings are also given.
Fr. SS. 22.4 11:45‐12:00
Localization Performance of Coherent MIMO Radar Systems Subject to Phase Synchronization Errors
Hana Godrich, Alexander Haimovich
New Jersey Institute of Technology, Newark, NJ, USA
Abstract—Coherent Multiple‐Input Multiple‐Output (MIMO) radar with ideal phase synchronization among distributed radar stations has been shown to support high resolution and high accuracy target localization. In this paper, quantitative tools are developed for assessing the effect of phase errors on the localization performance. The hybrid Cramer‐Rao bound (HCRB) is derived for the joint estimation of the unknown, deterministic target location and the unknown, random phase errors. It is shown that for the coherent MIMO radar problem, the HCRB is asymptotically tight in the sense that it is equal to the marginal Cramer‐Rao bound (CRB). In the marginal CRB, the phase errors are treated as nuisance parameters and are marginalized. The HCRB is shown to follow the CRB obtained in the absence of phase errors, up to a threshold signal‐to‐noise ratio (SNR), determined by the phase error variance, and the number of mismatched transmitting and receiving sensors. Beyond this point, the HCRB is limited by the variance of the phase errors, and stops decreasing with the SNR. A simple expression for the threshold SNR is derived for symmetrical radar deployments.
104
Friday Morning, 5th March
Session: Special Session on MIMO Radar
Time & Place: 11:00‐12:30 ‐ Daphne
Chairperson: H. Vincent Poor
Princeton University, USA
Fr. SS. 22.1 11:00‐11:15
Diversity Gain for MIMO Radar Employing NonOrthogonal Waveforms
Qian He1 and Rick Blum2
1EE Department, University of Electronic Science and Technology of China, Sichuan, China; 2ECE Department, Lehigh University, USA
Abstract—Initially we formulate a very general hypothesis testing problem where we attempt to distinguish between zeromean Gaussian clutter‐plus‐noise only and returns which are a linear transformed version of a zero‐mean Gaussian random vector plus this clutter‐plus‐noise.We show that the diversity gain of the optimum processing for this hypothesis testing problem must be less than or equal to the rank of the linear transform. Next we apply this result to study diversity gain for optimum MIMO radar processors for cases with M transmit antennas, N receive antennas, and a target composed of Q scatterers. If the transmitted waveforms span a lower dimension M0 than M, then the largest possible diversity gain is no greater than min(NM0;Q). We also show a diversity gain of min(NM0;Q) can be achieved under certain conditions. For a general correlated Gaussian clutter‐plus‐noise model and a general correlated Gaussian reflection coefficient vector, the diversity gain for noncoherent and coherent processing is discussed. Extensions of all results to cases with nonGaussian reflections and clutter‐plusnoise are discussed.
Fr. SS. 22.2 11:15‐11:30
MIMO Radar Target Detection with Parametric Scattering Correlation Model
Tuomas Aittomäki and Visa Koivunen
Department of Signal Processing and Acoustics, SMARAD CoE Aalto University, Finland
Abstract—Multiple‐input multiple‐output (MIMO) radars utilize various sources of diversity to improve performance. A MIMO radar in which angular diversity is achieved by using widely distributed antennas has been proposed to reduce the impact of the fluctuations of the target radar cross‐section. This type of system is also known as the statistical MIMO radar. Typically, it has been assumed that the signals received by different antennas are either fully correlated or independent depending on the configuration. In this paper, we assume more realistically that the scattering from the target is correlated. We show that taking the correlation of the scattered signals into account can improve the probability of detecting the target. This is achieved by using a parametric model for the scattering which allows one to efficiently estimate the correlation matrix of the scattering. The numerical examples demonstrate that the probability of detection remains good even when parameters of the model are inaccurate.
� 103
Fr. 21.5 12:00‐12:15
Energy aware Routing in Location based Ad‐hoc Networks
Jangsu Lee, Seunghwan Yoo, Yongjun Lee and Sungchun Lee
University of Sogang, Republic of Korea
Abstract—In wireless ad‐hoc networks, there are several characteristics different with wired networks. The differences are the changing of network topology, limited resources like bandwidth and energy and so on. In these days as the energy issue becomes more important, it is required to research about the efficient resource allocation methods optimized in wireless networks. In the paper, we improve LAR(Location‐Aided Routing) which is one of the most famous location based routing methods. This kind of technique uses information about the location of mobile node through GPS technique. Our new protocol is researched in both area of routing and energy. At first an efficient routing method is developed by minimizing the spread of unnecessary control messages. Secondly an energy aware method is proposed to select proper transmission power by the distance between nodes. And finally we make a new function to select next hop which consider both of distance and energy. The result of simulation shows that performance of lifetime is improved about 12.1% compared with LAR
102
Fr. 21.3 11:30‐11:45
A Novel Sense‐Transmit‐Wait Strategy for Coexistence of Cognitive Radio Networks with IEEE 802 11 WLANs
Yingxi Liu, Nikhil Kundargi and Ahmed Tewfik
University of Minnesota, Twin Cities, Minneapolis, Minnesota
Abstract—Detection of spectral white space and the adoption of optimal secondary user transmission policies are the two crucial aspects of a Cognitive Radio system. In this paper we study the problem of optimal utilization of time domain holes in an unsaturated IEEE 802.11 network. We also design a scheme for the coexistence of a secondary system with an IEEE 802.11 network such that it does not affect the Medium Access Control (MAC) layer behavior of the network by mitigating the infamous “Capture Effect”. Specifically, we propose a Sense‐Transmit‐Wait strategy which allows the secondary user to effectively decide how often to transmit, when to transmit and the duration for which to transmit while adhering to strict interference constraints imposed via an upper bounded Probability of Collision (p0). Through extensive simulations and analysis of real world 802.11 packet captures, we demonstrate the ability of our proposed system to successfully setup a cognitive network and deliver a significant throughput enhancement.
Fr. 21.4 11:45‐12:00
Cost‐sharing for Cooperative Relay Cognitive Radio Networks
Shabnam Sodagari and Sven Bilen
Dept. of Electrical Engineering, The Pennsylvania State University, PA, USA
Abstract—We introduce and analyze one manifestation of cooperation among relay Cognitive Radios (CR) through sharing the cost among members of a CR coalition. We define and optimize cost functions arising from cooperation of relay cognitive radios representing power levels essential to meet required Bit Error Rates and show how cost‐sharing among cooperative CR’s can be placed within a framework by presenting proper formulations and simulations of practical scenarios.
� 101
Friday Morning, 5th March Session: Wireless Networks
Time & Place: 11:00‐12:30 ‐ Bacchus Ballroom
Chairperson: Costas N. Georghiades
Texas A&M University College Station, USA
Fr. 21.1 11:00‐11:15
Joint Source and Relay Power Optimization in Multiuser Cooperative Wireless Networks
Ying Jin and Yimin Zhang
Center for Advanced Communications, Villanova University, USA
Abstract—This paper considers the minimization of overall power transmitted from source and relay nodes in a multiuser cooperative network, constrained with the quality of service (QoS) of each user determined by their output signal‐to‐interferenceplus‐ noise ratio (SINR). In this paper, we consider a two‐hop cooperative wireless network consisting of single‐antenna nodes in which multiple concurrent links are relayed by a number of cooperative nodes. Unlike the previous relevant works that either consider the source power or relay weight optimization or their joint optimization in a separate sense, this paper considers them in the same platform and thus achieves overall transmit power minimization. It is shown that optimized power distribution over the source and relay nodes depends on the channel conditions and thus requires joint optimization operation as proposed in this paper. Compared to the previously developed schemes, the joint power optimization developed in this paper offers significant transmit power reduction and QoS satisfactions.
Fr. 21.2 11:15‐11:30
Outage Regions of Cooperative Networks for different Coding Schemes
Tobias Renk, Holger Jaekel and Friedrich K Jondral
Communications Engineering Lab (CEL), Karlsruhe Institute of Technology (KIT)
Abstract—In this paper we present outage regions for two cooperation strategies, namely multi‐routing and adaptive multi‐routing, if two different coding schemes are used. The first coding scheme is repetition coding and the second one is parallel channel coding. We show that for one cooperation strategy, the outage region for parallel channel coding is a strict subset of the outage probability of repetition coding, thus, leading to a smaller outage probability. We demonstrate that adaptivemulti‐routing in conjunction with parallel channel coding achieves by far the best performance.
100
Here, it is argued that a refined version of the clustering coefficient—the curvature—is the all encompassing parameter that predicts network behavior. Curvature indeed anticipates congestion, should the network be negative curved. Curvature indeed anticipates a balanced load, should the network be positively curved. Curvature indeed guarantees successful greedy forwarding of packets in sensor networks, provided the curvature has been uniformized by the Ricci flow.
In general, “traffic” follows some rules optimal relative to some criterion. Traffic in a communication network follows cost minimizing paths, where the “cost” reflects, for example, delays and/or outages. Conceptually, “traffic” can be viewed as a geodesic flow, i.e., a length minimizing flow, for a metric that mimics the optimization rules that drive the traffic. It is probably the most fundamental Riemannian geometry paradigm that the curvature controls the geodesic flow. In the network language, traffic is controlled by the curvature.
Our program therefore proceeds from the definition of curvature for network graphs. In case of planar graphs, the local curvature at a vertex v is easily defined from the excess/deficit (relative to 2π) of the sum of the angles of the triangles having v as an apex. Next, it is shown that, should the graph have negative curvature at all of its vertices, “extreme congestion” will develop at the “center of mass” of the graph. Of course, real‐life communication networks are far from planar; nevertheless, a vertex v of a non‐planar graph can be given a (scalar) curvature defined as the average curvature over all planar sections containing v. An experimental sensor network example confirms the relevance of the concept and its ability to predict congestion even in a real‐life set‐up.
The problem with the local curvature is that it does not quite reflect larger‐scale properties of network congestion—for example, how the worst point congestion scales with the size of the network? This larger‐scale analysis is carried over following Gromov’s program of large‐scale, also referred to as coarse, geometry. The main point is that a network could be negatively curved in the large scale (e.g., when viewed from a distance), even though some vertices might have positive curvature. By the Bonk‐Schramm theorem, a Gromov large‐scale negatively curved network is isometric to a hyperbolic manifold, up to some finite distortion. Therefore, treating a network as a Riemannian manifold M, it can be shown that the congestion scales as volume(M)2 in the hyperbolic case, whereas it scales as volume(M)1.5 in the Euclidean case. Clearly, congestion is worse in the hyperbolic than in the Euclidean case.
In a parallel effort, Bell Labs investigators found that the networks of the Rocketfuel data base are negatively curved in Gromov’s sense, and the same investigators further endeavored to determine experimentally how congestion scales with the number of vertices N of the network. They found N2 for the Rocketfuel data base networks and N1.5 for Euclidean lattice networks. If we agree that, under the large‐scale geometry paradigm of identification of graphs and manifolds, N=volume(M), the theoretical and experimental analyses are amazingly consistent.
As long as the network is negatively curved, congestion will develop inevitably, and the only way to relief the congestion is to abandon such physically motivated metric of delay in favor of a metric that will make the network positively curved. This is the well‐known Yamabe flow problem, instrumental in the proof of the Poincaré conjecture: The Yamabe flow is a differential equation whose solution is a metric that will make the local network curvature uniformly equal to its Euler characteristic. Should the latter be positive, existence of a routing strategy avoiding congestion is guaranteed. In topological term, the Euler characteristics is the obstruction to balancing the load.
At this juncture, other applications of curvature/congestion can be envisioned—like line overload in a power grid, curvature of spin networks, etc.
� 99
Friday Morning, March 5th
Session: Keynote Fr.1
Time & Place: 8:30‐9:30 ‐ Bacchus Ballroom
Chairperson: Anthony G. Constantinides Imperial College, UK
8:30 Big Rooms to small boxes back to big Rooms
Gene A. Frantz
TI Principal Fellow, TI Futurist, Texas Instruments Incorporated, USA
ABSTRACT ‐ The advancements of technology have allowed us to move that technology from big rooms to small boxes. But this is only half of the story. The other half is how technology in small boxes will begin to expand its capability to control big rooms. This talk will discuss the big room to small box phenomenon along with the pending expansion we are in the midst of experiencing.
Session: Keynote Fr.2
Time & Place: 9:30‐10:30 ‐ Bacchus Ballroom
Chairperson: Anthony G. Constantinides Imperial College, UK
9:30 Traffic Pattern Analysis and Load Balancing in Negatively Curved Networks Edmond Jonckheere University of Southern California, USA
ABSTRACT ‐ In the quest to identify a single parameter that would encapsulate such relevant properties of networks as their potential to create congestion, network investigators have for the past decade focused their attention on the Small‐World/Scale‐Free dichotomy, whereas the clustering coefficient—itself a manifestation of the deeper concept of curvature—initially attracted little attention. Certainly, the Small‐World concept has seen spectacular applications in networked system synchronization, more recently in neuro‐physiological system synchronization, whereas the Scale‐Free concept appeared to be a model of networks constructed by the “growth/preferential attachment” process.
98
Th. SS. 20.6 18:15‐18:30
Invited Paper
Modified Histogram Equalization for Image Contrast Enhancement
Kota Murahira, Takashi Kawakami and Akira Taguchi
Tokyo City University, Tokyo, Japan
Abstract—Histogram equalization (HE) is one of the common methods used for improving contrast in digital images. However, this technique will cause an effect on brightness saturation or shadow in some almost homogeneous area. In order to avoid these effects, mean preserving bi‐histogram equalization (BBHE) method is proposed. In this paper, we propose a novel HE with variable enhancement degree (HEwVED). Moreover the BBHE with variable enhancement degree (BBHEwVED) is also proposed. The enhancement degree of each of these methods is controlled by only one parameter. We also show the guide to decide this parameter. Since our method is able to control the enhancement degree and the mean of image is tend to be preserved, all kinds of images are enhanced adequately.
�
� 97
Th. SS. 20.3 17:30‐17:45
Invited Paper
Content Similarity Based Early Skip Mode Decision for Low Power Surveillance Video Compression
Xin Jin and Satoshi Goto
1Xin Jin is with the Information Technology Research Organization, Waseda University, Fukuoka, Japan;
2Graduate School of Information, Production and Systems, Waseda University, Fukuoka, Japan
Abstract—As a state‐of‐the‐art video compression technique, H.264/AVC has been deployed in many surveillance cameras to improve the compression efficiency. However, it induces very high coding complexity, and thus high power consumption. In this paper, an early skip mode decision algorithm is proposed to reduce the computational complexity and power consumption in surveillance video compression by detecting the content similarity using chrominance and motion features. The overall computational complexity of the whole video encoding system is significantly reduced by 84%. No loss is observed in both of subjective and objective video quality.
Th. SS. 20.4 17:45‐18:00
Invited Paper
Content‐based Interactive Image Retrieval from Java Enabled Mobile devices
Iftikhar Ahmad1 and Moncef Gabbouj2
1Nokia Corporation, Tampere, Finland; 2Department of Signal Processing at Tampere University of Technology, Tampere, Finland
Abstract—Content‐based image retrieval from a mobile device in large image database is challenging. In this paper we present a client‐server architecture where a server is running on a personal computer and a client on the device. The client sends content‐based query request to the server and the server performs an interactive content‐based query and sends the query results to the client. In the query a user of the mobile device define a time interval after that he wants to see the query results. The server generates the query result after the given time. Furthermore the user of the device can get the updated query results at any time during the query operation. This interactive query can avoid un‐wanted progressing query results and thus reduce the server query time and memory.
Th. SS. 20.5 18:00‐18:15
Invited Paper
Implementation of Simultaneous Video Decoding on Multicore Processor
Yuki Kawamura1, Yasutake Manabe1, Takao Onoye1, Kazuto Ohhara2, Hiroyuki Okada2 and Ikuo Keshi2 1Graduate School of Information, Science and Technology, Osaka University, Osaka, Japan; 2Advanced Image and Telecommunication Laboratories, Corporate R & D Group, Sharp Corporation, Japan
Abstract—An implementation of simultaneous video decoding is described, which is based on a heterogeneous multicore processor. Appropriate task division and assignment to processor cores are explored for efficient execution on the multicore processor. In addition, a set of mechanisms to reduce video decoding complexity is employed, i.e. simplified IDCT, VLD skip, and Bframe skip. Experimental results demonstrate that simultaneous decoding of 40 MPEG‐2 HD streams or 172 MPEG‐2 SD streams can be achieved by the proposed approach.
96
Thursday Afternoon, 4th March
Session: Special Session on Multi‐Media Processing over Wireless Communications
Time & Place: 17:00‐18:30 ‐ Salaminia
Chairperson: Yoshikazu Miyanaga
Science and Technology Hokkaido University, Sapporo, Japan
Th. SS. 20.1 17:00‐17:15
Rate‐Distortion Development for Optimal Truncation in JPEG2000 Imagery
Eric Balster, Benjamin Fortener and William Turri
Department of Electrical and Computer Engineering, University of Dayton, Kettering Laboratory, Dayton, OH, USA
Abstract—This paper presents a detailed treatment of the post compression rate‐distortion (PCRD) algorithm in JPEG2000 used for optimal truncation (OT) rate control. The following treatment is implemented in a complete JPEG2000 compression engine and compared to the JPEG2000 reference implementation, JasPer, and the popular Kakadu JPEG2000 compression engine. Some of the details of the proposed method differ from what is given in the standard and also differ from what is proposed in other literature. Also, some important details provided are not yet included in the published literature and are included here. The results of the proposed method show equivalent performance to both the JasPer and Kakadu compression methods, showing a correct implementation of the PCRD algorithm.
Th. SS. 20.2 17:15‐17:30
Vector Quantization Based on a Binary Search‐like Algorithm
Long‐Jhe Yan and Shaw‐Hwa Hwang
Electrical Engineering, Department, National Taipei University of Technology, Taipei, Taiwan
Abstract—This paper presents an efficient binary search‐like algorithm for vector quantization (VQ). The proposed algorithm adopts a tree‐structured VQ with overlapped codewords (TSOC) to reduce computational complexity and enhance quantization quality. This algorithm uses overlapped codewords to expand the scope of the search path to traverse more appropriate codewords. To further evaluate computations at each stage of the proposed algorithm, both speech and images are considered. With codebook sizes of 256, 512 and 1024, the corresponding optimal computational savings for images are 85.16%, 90.04% and 93.46% respectively, compared with the FSVQ. For speech, the optimal computational savings reached 51.56% for a codebook size of 128. The results indicate that the proposed algorithm can save a significant number of computations, depending on the size of codebook.
� 95
Th. 19.6 18:15‐18:30
Invited Paper
Self‐Adaptive Middleware for Building Context‐Aware Software for Public Transit Systems
Asad M Madni, Hossein Rahnama and Alireza Sadeghian
Ryerson University, Toronto, Canada
Abstract—Ubiquitous software applications can become more responsive if they can adapt to their surrounding situation without relying on users’ continuous commitment. In dynamic environments such as public transit settings, where information is rapidly changing and passengers’ demography are not uniform, an adaptive mobile application to navigate passengers based on their profile and context may be a good example of emerging self‐adaptive and context‐aware mobile application. In this paper we have demonstrated the use of an open source framework to develop a travel assistant application to help passengers with special needs in public transit environments.
94
Th. 19.3 17:30‐17:45
Finite‐time stabilization of non affine systems A constructive method for polynomial systems
Walid Ben Mabrouk1, Chakib Ben Njima1, Hassani Messaoud1 and Germain Garcia2,3 1Ecole nationale d’ingénieurs de Monastir, Monastir; 2CNRS Toulouse, France; 3Université de Toulouse, Toulouse, France
Abstract— In this paper finite‐time stabilization of nonlinear non affine systems, is considered. First we provide a formula for a finite time stabilizing state feedback control law, for a second order polynomial system. Then we extend the result to the case of polynomial systems with multiple inputs. Some extensions concerning asymptotic stabilization are given.
Th. 19.4 17:45‐18:00
Open‐Loop Control Design via Parametrization Applied in a Two‐Level Quantum System Model
Markku Nihtila
Department of Physics and Mathematics, University of Eastern Finland, Kuopio, Finland
Abstract—In the design of quantum computing devices of the future the basic element is the qubit. It is a two‐level quantum system which may describe population transfer from one steady‐state to another controlled by a coherent laser field. A four‐dimensional real‐variable differential equation model is constructed from the complex‐valued two‐level model describing the wave function of the system. The state transition matrix of the model is constructed via the Wei‐Norman technique and Lie algebraic methodology. The idea of parametrization using flatness‐based control, is applied to construct feasible input– output pairs of the model. This input drives the state of the system from the given initial state to the given final state in a finite time producing the corresponding output of the pair.
Th. 19.5 18:00‐18:15
Adaptive PID Controller Design with Application to Nonlinear Water Level in NEKA Power Plant
Alireza Yazdizadeh1, Arash Mehrafrooz1 and Roohollah Barzamini2
1Faculty of Electrical Engineering, Power and Water University of Technology, Tehran, Iran; 2Iran Power development company, Tehran, Iran
Abstract‐ In this paper, two novel adaptive PID‐like controllers capable of controlling multi‐variable, non‐linear multi‐input multiple‐output (MIMO) systems are proposed. The proposed controllers are based on neural networks techniques and the learning algorithms are derived according to minimization of the error between the output of the system and the desired output. At first, two kinds of PID‐like neural network controller named neural network PID and Neural network PID with internal dynamic feedbacks are introduced both of which can be used for controlling multivariable systems. The difference between these two controllers is mainly in the structure of their hidden layers that leads to their different performance. These controllers are applied to different kinds of black box, linear or nonlinear and time variant or time invariant systems. The stability of the proposed algorithm is also proven mathematically. Compared to conventional methods, more satisfactory results are achieved using the proposed methods. The simulation results show the quality performance of the proposed adaptive controllers and algorithms. Finally to show the performance of the proposed method, it is applied to the water level of tanks in water refinement process in NEKA Power Plant that is generally a very nonlinear system. Simulation results in this paper show the satisfying performance of the proposed adaptive controllers.
� 93
Thursday Afternoon, 4th March
Session: Systems and Control I
Time & Place: 17:00‐18:30 ‐ Amathousia
Chairpersons: Vladimir Kucera
Czech Technical University in Prague, Faculty of Electrical Engineering, Technická 2, 16627 Prague 6, Czech Republic
Ala Shariati, K.N. Toosi
University of Technology, Tehran, Iran
Th. 19.1 17:00‐17:15
Delay‐Dependent H∞ Control of Linear Systems with input Delay Using Composite State‐Derivative Feedback
Ala Shariati, Hamid Taghirad and Batool Labibi
Advanced Robotics and Automated Systems (ARAS), Faculty of Electrical, and Computer Engineering, K. N. Toosi University of Technology, Tehran, Iran
Abstract— H∞ control problem for input‐delayed systems is considered in this paper. A composite state‐derivative control law is used, in which, a composition of the state variables and their derivatives appear in the control law. Thus, the resulting closed‐loop system turns into a specific time‐delay system of neutral type. The significant specification of this neutral system is that its delayed term coefficients depend on the control law parameters. This condition provides new challenging issues which has its own merits in theoretical research as well as application aspects. New delay‐dependent sufficient condition for the existence of H∞ controller in terms of matrix inequali es is derived in the present paper. The resulting H∞ controller guarantees asymptotic stability of the closed‐loop system as well as a guaranteed limited H∞ norm smaller than a prescribed level. Numerical examples are presented to illustrate the effectiveness of the proposed methods.
Th. 19.2 17:15‐17:30
Optimum Immigration Policies Based on Linear Quadratic Theory
Ioannis Tzortzis1 and Charalambos Charalambous1,2
Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus
Abstract—In this paper we demonstrate that by use of the Theory of Linear Quadratic applied for tracking problems, it is possible to derive optimum immigration policies while maintaining population and immigration levels close to certain pre‐specified reference trajectories. An already existed dynamic population model found in literature and statistical data obtained from Cyprus Statistics were used for our simulation purposes. The numerical results presented illustrate that the applied technique results in optimum immigration policies that can be well formulated for fixed as well as for variable target sets.
92
Th. 18.6 18:15‐18:30
Receiver Diversity with Blind And Semi‐Blind FIR SIMO Channel Estimates
Samir Omar1, Dirk Slock1 and Oussama Bazzi2
1Mobile Communications Department, Eurecom, BP 193, 06904 Sophia Antipolis Cdx, France; 2Department of Physics and Electronics Faculty of Sciences I, Lebanese University Hadath, Beirut, Lebanon
Abstract ‐ Traditionally, the performance of blind and semi‐blind SIMO channel estimates has been characterized in a deterministic fashion, by identifying those channel realizations that are not identifiable. In this paper, we focus instead on the performance of Zero Forcing Linear Equalizer(ZF‐LE) and Zero Forcing Decision Feedback equalizer(ZF‐DFE) for fading channels when they are based on blind and semiblind channel estimates respectively. We show that due to the singularity of the blind channel estimation problem there is a reduction in the diversity order achieved by the ZFLE. However, in the case of semi‐blind channel estimation with a feedback solely from the known symbols, there is a possibility to attain the full diversity if the length and the position of the training sequence (pilots) are carefully chosen. Various transmission scenarious (SC‐CP, OFDM, Non‐CP) are considered in detail.
� 91
Th. 18.3 17:30‐17:45
Performances of Beamforming Techniques Combined to Switching Algorithm in Multi‐User MIMO Systems
Yosra Mlayeh, Fatma Rouissi, Fethi Tlili and Adel Ghazel
CIRTACOM Laboratory, Ecole Supérieure des Communications de Tunis, Tunis, Tunisia
Abstract— This paper presents a study of the switching algorithm performances when combined to several beamforming techniques in a multi‐user MIMO communication system. The study of three beamforming solutions shows that the beamforming processing has an important influence in the decision criterion of the switching algorithm. The STBC adaptive beamforming, which is better than Zero forcing (ZF) and Singular Value Decomposition (SVD) processing, leads to satisfactory improvement in Bit error Rate (BER) in comparison with MIMO diversity and spatial multiplexing when applied separately.
Th. 18.4 17:45‐18:00
Channel Estimation for MIMO‐OFDM Systems in Fast Time‐Varying Environments
Hussein Hijazi1, Eric Pierre Simon1, Martine Lienard1 and Laurent Ros2
1Laboratoire TELICE, U.S.T.L. Lille 1, France; 2GIPSA‐lab, Department Image Signal, France
Abstract—A channel estimation algorithm for MIMO‐OFDM systems in Fast Time‐Varying Environments is proposed. The channel estimation function is based on the equivalent discretetime channel taps or on the physical propagation channel parameters. To handle rapid variations of channels within a transmission block, we approximate the channel by a basis expansion model (BEM). Based on the Jakes process, an auto‐regressive (AR) model of the BEM coefficients dynamics is built, making it possible to estimate and track the BEM coefficients using Kalman filter . Hence, the channel matrix is easily computed, and the data symbol is detected with free ICI . Our claims are supported by theoretical analysis and simulation results, which are obtained considering Jakes’ channels with high Doppler spreads.
Th. 18.5 18:00‐18:15
Robust Broadband Beamforming Based on Frequency Invariance Constraints and Worst‐Case Performance Optimization
Yong Zhao, Wei Liu and Langley Richard
Communications Research Group, Department of Electronic and Electrical Engineering, University of Sheffield, UK
Abstract ‐ Two novel broadband beamformers robust against look direction estimation errors are proposed. One is designed by imposing a frequency invariance constraint and limiting the magnitude response of the beamformer within a pre‐defined range, and the other one is obtained by combining the frequency invariance constraint and the worst‐case performance optimization method, both of which are formulated as convex optimization problems and solved efficiently using existing convex optimisation techniques. Compared with conventional methods, a more efficient and effective control over the beamformer’s response is achieved, leading to an improved performance, as shown by simulations.
90
Thursday Afternoon, 4th March Session: MIMO II
Time & Place: 17:00‐18:30 ‐ Daphne
Chairperson: Marco Lops
ENSEEIHT/ Toulouse ‐ France & DAEIMI, Università degli, Studi di Cassino, Cassino (FR), Italy
Th. 18.1 17:00‐17:15
MIMO Channel Measurements Using an Experimental MIMO System
Matthias Lieberei and Udo Zölzer
Department of Signal Processing and Communications, Helmut‐Schmidt‐Universität /University of the Federal Armed Forces, Hamburg, Germany
Abstract—With continued standardization of MIMO radio techniques, questions of providing MIMO infrastructure rise. Depending on the environment, the usage of special antennas might be advantageous. In aircraft cabins so called leaky lines are installed for usage with mobile phones, according to the GSM standard. When establishing a point‐to‐point‐link, antennas, which exhibit a directional characteristic might be useful. If MIMO should be provided in a room or office with no predictable placement of terminals, omnidirectional antennas are the best choice. In this paper a measurement campaign is presented, in which an experimental MIMO system is used, with different types of antennas on transmitter side, to evaluate the influence of the usage of different types of antennas on the measured MIMO channel, in terms of capacity, spatial correlation and delay spread. It is found that the influence on the MIMO system of different antenna types is low in terms of the channel capacity.
Th. 18.2 17:15‐17:30
Lattice‐Reduction‐Aided K‐Best MIMO Detector based on the Channel Matrix Condition Number
Sandra Roger, Alberto Gonzalez, Vicenc Almenar and Antonio M Vidal
Institute of Telecommunications and Multimedia Applications (iTEAM), Universidad Politécnica de Valencia, Valencia, Spain
Abstract—It is known that MIMO detectors performance is highly influenced by the channel matrix condition number. An efficient way to decrease the channel matrix condition number is the use of Lattice Reduction techniques. In this paper a Lattice‐Reduction‐Aided (LRA) K‐Best detector based on the channel matrix condition number is proposed for improving the performance of conventional K‐Best algorithm. This approach leads to a preprocessing complexity reduction of the LRA K‐Best detector with marginal loss in the performance. The performance of the proposed detector based on condition number depending on the chosen LR method (LLL or Seysen’s) is also evaluated.
� 89
Th. SS. 17.3 17:40‐18:00
Controlling double dipole loudspeaker radiation by adapted input filtering
Tobias Corbach, Martin Holters and Udo Zölzer
Helmut‐Schmidt‐University, University of the Federal Armed Forces Hamburg, Germany
Abstract—Most flat panel loudspeakers grant good structural integration properties due to the lack of an enclosure. However the backward radiation of a dipole is not desired in many applications. In this paper, a system which achieves a high suppression of the backward radiation using a pair of dipole speakers with adapted input signal filters, is proposed. Furthermore the system does not produce any audible changes to the acoustic signal of the forward direction. Hence the sound is perceived as radiated by a single loudspeaker. Additionally, the expansion to stereo radiation with highly suppressed acoustic crosstalk of both directions is presented. The filter design as well as a calibration algorithm for any given pair of dipole loudspeakers is explained. The good performance of the developed system is proven by measurement results with a prototype system.
Th. SS. 17.4 18:00‐18:20
Reproduction of Focused Sources by the Spectral Division Method
Sascha Spors and Jens Ahrens
Deutsche Telekom Laboratories, Technische Universität Berlin, Berlin, Germany
Abstract—Sound reproduction methods based on the physical resynthesis of a desired field using loudspeaker arrays are wellestablished nowadays. Their physical basis allows to resynthesize almost any desired wave field, even the field of sound sources positioned in between the loudspeakers and the listener. Such sources are known as focused sources. This paper will present a novel approach to the reproduction of focused sources with linear loudspeaker arrays. Its formulation is based on a representation of the respective fields in the spatio‐temporal frequency domain. The derivation of the loudspeaker driving function is discussed, as well as a number of practical limits, the role of evanescent contributions and the connections to other established techniques.
88
Thursday Afternoon, 4th March
Session: Special Session on Audio Signal Processing
A.3 Sound Synthesis and Reproduction
Time & Place: 17:00‐18:30 ‐ Bacchus Ballroom
Chairperson: Rudolf Rabenstein
University Erlangen‐Nuremberg, Erlangen, Germany
Th. SS.17.1 17:00‐17:20
Physically Inspired Playable Models of Guitar, a Tutorial
Gianpaolo Evangelista
Digital Media, Linköping University, Norrköping, Sweden
Abstract—In this brief tutorial paper we review recent results concerning the interaction of the player with the string in the synthesis of guitar by means of digital waveguides. In particular, models for plucking the string with a finger or a pick are advanced, together with accurate and efficient models for the collisions of the string with the neck or the frets. These models are presented in a unified framework by means of scattering elements, which are time‐varying and also non‐linear for the collision case.
Th. SS. 17.2 17:20‐17:40
Wave Field Synthesis for Next Generation Videoconferencing
Jose J Lopez, Maximo Cobos, Basilio Pueo and Emanuel Aguilera
Institute for Telecommunications and Multimedia Applications, Universidad Politécnica de Valencia, Spain
Abstract—Videoconference systems have been around the market for a long time. Their aim is to provide a way of carrying out meetings without the need for having physical presence of the participants. However, the sense of realism achieved by these systems is usually far away from the one expected by the people involved in the communication. This paper presents different advances related with the introduction of Wave‐Field Synthesis (WFS) to high‐realism 3D videoconference systems. WFS provides an acoustic window that, combined with stereo video screens, generates a very realistic sound field. This paper presents the technologies employed towards the development of real prototypes of these new systems. A multiexcited Distributed Mode Loudspeaker (DML) in the form of Multiactuator Panel (MAP) has been used as an alternative technology to traditional cone loudspeakers. Because of its low visual profile and the fact that the vibration is low enough to be imperceptible to the human eye; they can be integrated into a room interior and simultaneously used as projection screens.
� 87
Th. 16.6 16:15‐16:30
Age Estimation Based on Head Movements: A Feasibility Study
Andreas Lanitis
Department of Multimedia and Graphic Arts, Cyprus University of Technology, P.O. Box 50329, 3036, Lemesos, Cyprus
Abstract—The ability to estimate the age of a machine user is a highly important task that can be used as the basis for developing automatic age adaptive human computer interaction systems. Recently a considerable number of researchers described work on facial age estimation, where facial features are used as the basis for estimating the age of a subject. Usually in facial age estimation systems static images are used so that the dynamics of face movements are not used in the process of age estimation. In this paper we present a framework for age estimation based on head movements. The feasibility of the proposed framework is evaluated using a dedicated experimental procedure. Preliminary results demonstrate the potential of using head motion as the basis for estimating the age of machine users.
�
86
Th. 16.3 15:30‐15:45 Image Quality Measurement in the Frequency Domain
Georgios Triantafyllidis
Department of Applied Information Technology & Multimedia Technological Educational Institution of Crete, Heraklion, Crete, Greece
Abstract—In this paper a novel frequency domain technique estimating the significance of blocking artifacts in images coded using the Discrete Cosine Transform is proposed. First a gradient image is computed which is then split to blocks. For each block, the blocking artifacts in the horizontal and vertical directions are detected by comparing ratios obtained from harmonics on each block with the corresponding ratios in the same block of the reference image. An image quality metric based on the significance of the differences of the ratios between the test picture and the reference picture for each block is introduced.
Th. 16.4 15:45‐16:00
2D cross‐Psi_B‐energy operator for images analysis
J.‐C. Cexus1, A.‐O. Boudraa1,2, A. Baussard1, F.H. Ardeyeh1 and E.H.S. Diop1,2
1ENSIETA / Brest, France; 2Ecole Navale /Brest, France
Abstract— In this paper, the Cross‐Teager‐Kaiser Energy Operator (CTKEO) used for interaction measure between two signals is generalized for complex‐valued patterns and images. This new operator called 2D‐CTKEO and noted Ψ2B [., .] is useful for some image processing problems. Some properties of 2D‐CTKEO showing the interest of such operator for images analysis are provided. Based on Ψ2B [., .] operator, two similarity functions, called Simil12B and Simil22B, are constructed. The effectiveness of Ψ2B [., .] operator is demonstrated on noise‐ free and noisy images. These results show that Ψ2B [., .] is useful for detection of interest points such as corners and edges and for template matching.
Th. 16.5 16:00‐16:15
Where's Waldo? Human Figure Segmentation Using Saliency Maps
Omri Soceanu1, Guy Berdugo1, Dmitry Rudoy1, Yair Moshe1 and Itsik Dvir2
1Technion ‐ Israel Institute of Technology, Haifa, Israel; 2Mate – Intelligent Video
Abstract—Human figure segmentation (HFS) is at the very core of many image and video processing tasks. Many solutions have been proposed for the separation of objects, or more specifically human figures, from image background in a video scene. Unfortunately, these solutions do not provide tight human segmentation in the most general conditions, so only a coarse segmentation of human figures can be assumed. In this paper it is assumed that a rectangular, not necessarily tight, segmentation of a human figure is available and a way to refine this segmentation is proposed. We use saliency detection for HFS in a single image, thus creating a mask that eliminates most of the background in the rectangular input while maintaining the human figure mostly intact. The proposed technique is a generalization over recently proposed saliency detection methods in order to better accommodate the special conditions of this specific problem. Tests show that saliency detection is beneficial for HFS. In addition, the proposed saliency detection is shown to improve HFS results and presents a viable solution for HFS in a single image or a video stream.
� 85
Thursday Afternoon, 4th March
Session: Image analysis II
Time & Place: 15:00‐16:30 ‐ Salaminia
Chairperson: Andreas Lanitis
Department of Multimedia and Graphic Arts, Cyprus University of Technology, Lemesos, Cyprus
Th. 16.1 15:00‐15:15
Three Dimensional Bayesian State Estimation Using Shearlet EDGE Analysis and Detection
David Schug and Glenn Easley
University of Maryland, College Park, MD, USA
Abstract—In this work, we present a method of estimating the kinematic state of a three dimensional object from a set of image sequences recorded at multiple views. In our approach, three dimensional information from a Bayesian filter is merged to stabilize two dimensional recognition as well as tracking so observation collection and object state estimation are concurrent. A unique aspect of this method is that a shearlet transform is used to reliably extract image features. The method is demonstrated on both synthetic and real data for performance evaluation.
Th. 16.2 15:15‐15:30
Effective Discriminant Feature Extraction Framework for Face Recognition
Yan Yan and Yujin Zhang
Department of Electronic Engineering, Tsinghua University, Beijing, China
Abstract—Extracting effective features is a crucial step for appearance‐based face recognition methods. In this paper, an effective framework for extracting discriminant features called Discriminant Class‐dependence Feature Analysis (DCFA), which combines Linear Discriminant Analysis (LDA) and 1‐D Class‐dependence Feature Analysis (1D‐CFA), is proposed. LDA extracts features to discriminate all classes while it cannot distinguish close classes well. On the other hand, 1D‐CFA extracts features to emphasize one specific class and suppress other classes. By taking advantages of the merits of two different feature extraction methods, DCFA can extract discriminant features very effectively. Experimental results on three well‐known face recognition databases demonstrate the effectiveness and robustness of the proposed approach.
84
Th. 15.5 16:00‐16:15
lamda‐min Algorithm using TAP approach
Manel Abdelhedi, Omessad Hamdi and Ammar Bouallegue
SYSCOM Laboratory, ENIT, Tunis, Tunisia
Abstract—Low‐density parity‐check (LDPC) codes are based on random construction. Because of this randomness, it is not easy to analyze them with the traditional methods of information theory. N.Sourlas [1] was the first to point out that LDPC codes have a similarity with Ising spin systems of statistical physics. Besides, it has been shown that the Belief‐Propagation algorithm, the LDPC codes decoding algorithm, is equivalent to the Thouless‐Anderson‐Palmer(TAP) [2] approach. In this paper, we develop the log‐likelihood ratios‐Belief Propagation (LLRBP) algorithm and its simplification, _‐min algorithm, with the TAP approach. The obtained results by simulation confirm that the _‐min algorithm gets closer to the LLR‐BP algorithm as _ increases.
� 83
Th. 15.3 15:30‐15:45
Proposal of Plug and Play Ego‐motion Estimator for Mobile Robot
Naoki Suganuma1, Yuichi Hayashi2 and Tomonori Shimizu1
1Institute of Science and Engineering, Kanazawa University, Kanazawa Ishikawa, Japan; 2DENSO Inc.; 3Kanazawa University, Japan
Abstract— In this paper, for an ego‐motion estimating problem of mobile robot, we propose plug and play ego‐motion estimator that user can freely select sensor type and flexibly install the sensor. In this algorithm, each sensor is dealt as a sensor unit that has computing equipment, and each sensor unit estimate ego‐motion and the sensor parameter. Moreover, sensor units are connected via network, ego‐motion estimate of each unit are exchanged each other. Then the exchanged information is fused by Covariance Intersection method, which is one of a decentralized estimator. By this, this algorithm can estimate ego‐motion not affected by number of sensors and sensor type. Furthermore, user can flexibly install the sensors by this algorithm because sensor parameters are estimated in each unit and compensated information are exchanged each other. In addition to this high flexibility, an experimental results denotes that our method estimate ego‐motion with adequate accuracy.
Th. 15.4 15:45‐16:00
A simple control technique for partial and complete parameter identification of the chaotic Lorenz system
Ashraf Zaher
Physics Department, Kuwait University, Safat, Kuwait
Abstract— A simple technique is introduced for identifying uncertain and/or unknown parameters of chaotic dynamical systems via using a simple state feedback controller. A single scalar output is used to construct the controller that requires tuning a single feedback gain to ensure both stability and identifiability of the closed‐loop system. Once the closed‐loop system is brought to a steady state condition, a systematic algebraic method is used to directly solve for the parameters. Two cases are considered to investigate both complete and partial identification of the parameters, depending on accessibility to the complete or partial states of the Lorenz system. The paper also demonstrates that synchronization‐based state observers can be augmented to the state feedback controller when using a single scalar time series in the design. In addition, hardware implementation of the proposed technique is also investigated. Extending the proposed technique to other chaotic system and its dependence on the structure of the chaotic dynamical model and the operating conditions is discussed. Finally, the advantages and limitations are highlighted via comparing the proposed technique with other methods reported in the literature.
82
Thursday Afternoon, 4th March
Session: Identification and Estimation II
Time & Place: 15:00‐16:30 ‐ Amathousia
Chairpersons: Tara Javidi University of California San Diego, CA, USA
Marios M. Polycarpou University of Cyprus, Nicosia, Cyprus
Th. 15.1 15:00‐15:15 Maximum Likelihood Estimator For Doppler Parameter And Cramer Rao Bound In ZP‐OFDM Underwater Acoustic Channel
Bastien Lyonnet, Cyrille Siclet and Jean‐Marc Brossier
GIPSA‐lab GRENOBLE, France
Abstract— A Doppler estimation system using a maximum likelihood criterion is presented in the context of underwater acoustic communications between moving transmitter/ receiver. We simulated the method for the estimation of the Doppler effect induced by an underwater acoustic channel (UWA) using zero‐padded‐frequency‐divisionmultiplexing (ZP‐OFDM). Among the wide range of physical processes that impact OFDM communication through the underwater environment, Doppler effect is an important cause of loss of orthogonality and must be compensated before discrete Fourier transform based demodulation can be performed. The proposed approach is based on the perfect knowledge of the emitted signal during one block and rely on the assumptions of a small variation of the Doppler effect induced by the canal between two ZP‐OFDM blocks and, above all, during one block.
Th. 15.2 15:15‐15:30
A Subspace Based Method for Time Delay Estimation
Jafar Shalchian, Ali Khaki‐Sedigh and Alireza Fatehi
APAC research group, Control Department, K.N. Toosi University of Technology, Tehran, Iran
Abstract— Time delays are common in industrial processes. The information about the delay value of any process is valuable for both identification and control procedures. Several methods have been suggested for time delay estimation (TDE) in the literature. We propose a simple method based on plant input‐output data. The concept of this data driven method is from combination of two well known approaches: Time delay estimation from impulse response and subspace identification. This method can be easily implemented in Multi Input‐Multi Output (MIMO) plants. Also, by analyzing the window of input‐output data in an online fashion, we can utilize our proposed method for time varying delay case. To verify the effectiveness of our proposed method, the developed procedures are applied to a pH plant model, a MIMO system and a time delay varying scenario. Simulation results demonstrate the effectiveness of the proposed method.
� 81
Abstract—In this paper we present a new practical method for sum‐rate maximization for a Multi‐User MIMO system. Through this work, we first establish a general formula for the optimal receiver derived from the sum‐rate expression called MSR (Maximum Sum Rate) receiver. The obtained MSR receiver is a linear function of the used linear transmitter. In a second step, we introduce this receiver in an iterative algorithm to derive the corresponding precoder. The proposed iterative algorithm is based on optimizing the MSR receiver for the receiving part and an SJNR (Signal to Jamming plus Interference Ratio) precoder at the transmitter. Simulation results are compared to two multiuser schemes among the existing ones. The first comparison is done with the closed form SJNR algorithm given in [1] and the second one is done with an iterative scheme based on an MMSE receiver and an MMSE precoder given in [2,12]. These comparisons highlight the gains obtained from both the MSR receiver structure and our iterative procedure.
Th. 14.4 15:45‐16:00
Recovery of a Lattice Generator Matrix from its Gram Matrix for Feedback and Precoding in MIMO
Francisco A. Monteiro1,2 and Ian J. Wassell2
1Department of Engineering, University of Cambridge, UK; 2The Computer Laboratory, University of Cambridge, UK
Abstract— Either in communication or in control applications, multiple‐input multiple‐output systems often assume the knowledge of a matrix that relates the input and output vectors. For discrete inputs, this linear transformation generates a multidimensional lattice. The same lattice may be described by an infinite number of generator matrixes, even if the rotated versions of a lattice are not considered. While obtaining the Gram matrix from a given generator matrix is a trivial operation, the converse is not obvious and is a research topic in algorithmic number theory. This paper proposes a method to execute such a conversion and applies it in a novel MIMO system implementation where most of the complexity is taken from the receiver side and placed at the transmitter. Additionally, given the symmetry of the Gram matrix, the number of elements required to feedback channel state information from the receiver to the transmitter is nearly halved.
Th. 14.5 16:00‐16:15
Smart Antenna Performance for Correlated Azimuth Spread and Ricean K‐Factor
Constantin Siriteanu1, Yoshikazu Miyanaga
1 and Steven Blostein
2
1Graduate School, of Information Science and Technology, Hokkaido University, Sapporo, Japan; 2Department of Electrical and Computer Engineering, Queen’s University, Kingston, Canada
Abstract—The recently‐proposed superset of statistical beamforming (BF) and maximal‐ratio combining (MRC) known as maximal‐ratio eigencombining (MREC) promises to achieve nearoptimum performance and to reduce numerical complexity. Furthermore, eigencombining can be exploited to greatly simplify the performance analysis of diversity schemes for correlated fading. This paper contributes a new MREC (BF, MRC) performance analysis and evaluation for Rician fading with lognormallydistributed K‐factor, and Laplacian power azimuth spectrum with lognormally‐distributed azimuth spread (AS). First, an average error probability (AEP) expression is derived for MREC for correlated Rician fading and estimated channel gains. This AEP expression is then employed to study the effect on performance of the randomness of K and of the AS – K correlation. We find that disregarding this randomness and correlation may significantly distort performance indications.
80
Thursday Afternoon, 4th March
Session: MIMO I
Time & Place: 15:00‐16:15 ‐ Daphne
Chairperson: Subhrakanti Dey University of Melbourne, Australia �
Th. 14.1 15:00‐15:15
Outage Capacity and Probability for a Class of MIMO Channels
Ioanna Ioannou and Charalambos Charalambous
University of Cyprus
Abstract—This paper is concerned with outage capacity and probability of Multiple‐Input Multiple‐Output (MIMO) systems for a class of channel distributions. The results illustrate how outage probability and capacity degrade as a function of the uncertainty class. Examples are given to support the conclusions.
Th. 14.2 15:15‐15:30 Optimized Linear Receivers and Power Allocation for Two Multi‐User MIMO Downlink Schemes with Linear Precoding
Mustapha AMARA1, Yi Yuan‐Wu1 and Dirk Slock2 1Orange Labs, RESA/WIN, Moulineaux, France
2EURECOM, Sophia Antipolis, France
Abstract—In this paper, we propose some ameliorations and a comparison of linear closed form precoding techniques for Multi‐User MIMO (MU‐MIMO) systems. In fact, the sumrate, one of the most important parameters in the design of communication systems, is analysed through the study of two existing linear precoding schemes. These schemes are the PUMMSE precoder named PU‐MMSE and the Max SJNR scheme (Signal to Jamming plus Noise ratio). Two major improvements are introduced to the existing algorithms in order to increase the throughput of the system. The first modification consists in proposing an alternate receiver namely an MMSE receiver to enhance the performance. The second modification consists in introducing a power optimization involving a user selection procedure at the transmitter. Finally, these improvements have been validated by means of simulations. Indeed, important performance improvements are obtained thanks to these modifications. Moreover, this allows us to perform a comparison of these two linear precoding techniques. The comparision demonstrates that the SJNR precoder is offering better system throughputs than the PU‐MMSE precoder.
Th. 14.3 15:30‐15:45
Receiver and Transmitter Iterative Optimization Using Maximum Sum‐Rate Criterion for Multi‐User MIMO Systems
Mustapha AMARA1, Yi Yuan‐Wu1 and Dirk Slock2
1Orange Labs, RESA/WIN, Moulineaux, France 2EURECOM, Sophia Antipolis, France
� 79
narrow wells and infinitely thin separators. The diffusion coefficient was measured with numerical experiments for a range of fractional Brownian diffusers.
Th. SS. 13.3 15:40‐16:00
Spatial alignment of acoustic sources based on spherical harmonics radiation analysis
Boaz Rafaely
Department of Electrical and Computer Engineering, Ben‐Gurion University of the Negev, Israel
Abstract—The radiation pattern of sound sources such as loudspeakers, musical instruments, the human voice and machines is of importance in a wide range of applications. Recently, radiation analysis has been studied by measuring the sound field around the source using spherical microphone arrays, and computing the spherical harmonics spectrum of the radiated sound field. However, the latter may change with the positioning of the source inside the measurement array, leading to a potential difficulty in determining the acoustic radiation pattern consistently. This paper presents the theoretical analysis of the spherical harmonics spectrum of spatially translated sources, and proposes several measures for the deviation of sources from their acoustic center. These measures can then be used for spatial alignment of sources, overcoming inconsistency due to misalignment.
Th. SS. 13.4 16:00‐16:30
An Analytical Approach to 3D Sound Field Reproduction Employing Spherical Distributions of Non‐Omnidirectional Loudspeakers
Jens Ahrens and Sascha Spors
Deutsche Telekom Laboratories, Technische Universität Berlin, Ernst‐Reuter‐Platz 7, 10587 Berlin, Germany
Abstract—We present an approach targeting the physical reproduction of sound fields by means of spherical distributions of non‐omnidirectional loudspeakers. The focus of this paper lies on the modal incorporation of the loudspeaker’s spatio‐temporal transfer function into the loudspeaker driving function.
78
Thursday Afternoon, 4th March
Session: Special Session on Audio Signal Processing
A.2 Analytical Methods in Acoustic Signal Processing
Time & Place: 15:00‐16:30 ‐ Bacchus Ballroom
Chairpersons: Rudolf Rabenstein (Organised by)
University Erlangen‐Nuremberg, Erlangen, Germany
Sascha Spors
Deutsche Telekom Laboratories, Berlin, Germany
Th. SS. 13.1 15:00‐15:20
A preliminary comparative investigation between a diffusion equation model and diffuse reflection algorithms in room‐acoustics modeling
Juan M Navarro1, José Escolano2 and José J López3
1Polytechnic Sciences Depart., San Antonio’s Catholic University of Murcia, Murcia, Spain; 2Telecommunication Engineering Department, University of Jaén, Linares, Spain; 3iTeAM Institute, Universidad Politécnica de Valencia, Valencia, Spain
Abstract—A preliminary investigation on the diffusion equation model, which is based on diffuse reflections of sound particles in a scattering medium, has been developed to evaluate its performance in predicting real room sound fields. The implementation of the complete diffusion equation model including air absorption, with a mixed boundary condition, has been done through the use of a finite difference scheme known as forward‐time central‐space, which performance was validated in a previous work. The stability condition is also developed. This paper focus on comparing prediction with others diffuse reflection prediction models, such as radiosity and diffuse ray‐tracing simulations, for a real room configuration with different absorption walls properties. The obtained results are satisfactory, showing that deeper investigations are needed on other acoustical parameters, energetic decay curves, sound propagation curves and several computational features, as also other room environments.
Th. SS. 13.2 15:20‐15:40
Finite Difference Time Domain Modeling of Phase Grating Diffusion
Konrad Kowalczyk1 and Maarten van Walstijn2
1Multimedia Communications and Signal Processing, University of Erlangen‐Nuremberg, Erlangen, Germany; 2Sonic Arts Research Centre (SARC), Queen’s University of Belfast, Belfast, United Kingdom
Abstract—In this paper, a method for modeling diffusion caused by non‐smooth boundary surfaces in simulations of room acoustics using finite difference time domain (FDTD) technique is investigated. The proposed approach adopts the well‐known theory of phase grating diffusers to efficiently model sound scattering from rough surfaces. The variation of diffuser welldepths is attained by nesting allpass filters within the reflection filters from which the digital impedance filters used in the boundary implementation are obtained. The presented technique is appropriate for modeling diffusion at high frequencies caused by small surface roughness and generally diffusers that have
� 77
Th. 12.5 14:30‐14:45
Human Detection from Hemispherical Image Based on Probabilistic Appearance Model
Mamoru Saito and Katsuhisa Kitaguchi
Osaka Municipal Technical Research Institute, Osaka, Japan
Abstract— This paper presents a method for automated human detection using fisheye lens camera. We introduce a probabilistic model to describe the wide variation of human appearance in hemispherical image. In our method, a human is modeled as probabilistic shape features of body silhouette and head‐shoulder contour. These features are extracted from the human images taken at various distance and orientation with respect to the camera, and form the training data set for template modeling. A Non linear template model is build by the combination of Principal Component Analysis (PCA) and Kernel Ridge Regression (KRR). Finally, the problem of human detection is formulated as maximum a posteriori (MAP) estimation using above model. Experiments are conducted on indoor space where a fisheye lens camera is installed on the ceiling of crossing hallway. The feasibility and accuracy of our method is discussed through the experimental results.
Th. 12.6 14:45‐15:00
Graphs Representing Quadtree Structures using Eight Edges
Ryosuke Kadowaki, Koyo Motomura, Shinpei Ohkura and Kunio Aizawa
Department of Mathematics and Computer Science, Interdisciplinary Faculty of Science and Engineering, Shimane University, Matsue
Abstract—Quadtree [1] is an important data structure for image processing. In this paper, a graph based data structure is proposed for representing two‐dimensional binary images. This data structure uses eight edges for each node to represent neighborhood relations in quadtrees. New neighbor finding and connected component labeling algorithms using the structure are also introduced. Empirical tests are given for the algorithms in comparison with usual neighbor finding and connected component labeling algorithm based on quadtrees [2] ‐ [3]. In our experiments using natural images, the proposed neighbor finding algorithm is more than twice as fast as algorithm using quadtrees and the proposed connected component labeling algorithm is 40% faster than quadtree based algorithm.
76
Th. 12.3 14:00‐14:15
Coherent Receiver for AIS Satellite Detection
Marian Jurado Gallardo1,2 and Ulrich Sorger1
1Faculty of Science, Technology and Communication, University of Luxembourg; 2LuxSpace, Chateau de Betzdorf, Luxembourg
Abstract—AIS is a universal shipborne Automatic Identification System recently introduced for traffic monitoring and safety at sea. Ships exchange navigational information to identify and localize vessels in a short range to avoid collisions. AIS signals use Gaussian Minimum Shift Keying (GMSK) for transmission. There is a growing need to develop a system which provides global maritime surveillance in order to better handle hazardous cargo transports, to improve safety, and to counteract illegal operations and terrorism. The possibility of extending the system to space to detect ships at long distances from the shore is considered in this paper. Since AIS was not originally designed for space detection, two challenges arise: first, received signals have a large Doppler due to the speed of the satellite, and second, two or more signals from different ships can be received at the same time due to the large coverage of the satellite. In this paper, we proposed an innovative coherent demodulator based on the Maximum Likelihood Estimation (MLE) and a Viterbi decoder to receive AIS signals from space and handle the large Doppler frequency shift. The MLE is used efficiently to estimate the frequency and the channel response.
Th. 12.4 14:15‐14:30
Neural Network‐Assisted Reconstruction of Full Polarimetric SAR Information
Thanh Hai Le1, Ian McLoughlin1, Ken Yoong Lee2 and Timo Bretschneider2
1School of Computer Engineering, Nanyang Technological University, Singapore 2EADS Innovation Works Singapore, Singapore
Abstract—This paper describes a novel approach to the reconstruction of synthetic aperture radar (SAR) fully polarimetric data from compact polarimetry (CP) π/4 mode. A method is developed which utilises a multi‐layer perceptron (MLP) based neural network, to perform reconstruction of scenes with various ground‐cover types. In particular, the approach shows potential for the reconstruction of full polarimetry for built‐up areas as a complement to existing techniques which are more suitable for natural land cover areas. Performance assessment is presented, using both L‐band and C‐band data, involving comparison with existing techniques using mean‐squared and mean‐squared‐log measures.
� 75
Thursday Afternoon, 4th March
Session: Image Analysis I
Time & Place: 13:30‐15:00 ‐ Salaminia
Chairperson: Moncef Gabbouj Tampere University of Technology, Tampere, Finland
Th. 12.1 13:30‐13:45 Motion Capture with Constrained Inverse Kinematics for Real‐Time Hand Tracking
Andreas Aristidou and Joan Lasenby
Department of Engineering, University of Cambridge, Cambridge, UK
Abstract—Articulated hand tracking systems have been commonly used in virtual reality applications, including systems with human‐computer interaction or interaction with game consoles. However, building an effective real‐time hand pose tracker remains challenging. In this paper, we present a simple and efficient methodology for tracking and reconstructing 3d hand poses using a markered optical motion capture system. Markers were positioned at strategic points, and an inverse kinematics solver was incorporated to fit the rest of the joints to the hand model. The model is highly constrained with rotational and orientational constraints, allowing motion only within a feasible set. The method is real‐time implementable and the results are promising, even with a low frame rate.
Th. 12.2 13:45‐14:00
Sparse Representations for Automatic Target Classification in SAR Images
Jayaraman Jayaraman Thiagarajan, Karthikeyan Natesan Ramamurthy, Peter Knee and Andreas Spanias
School of Electrical, Computer and Energy Engineering, Arizona State University, USA
Abstract—We propose a sparse representation based approach for classifying different targets in Synthetic Aperture Radar (SAR) images. Unlike the other feature based approaches, the proposed method does not require explicit pose estimation or any pre‐processing. The dictionary used in this setup is the collection of the normalized training vectors itself. Computing a sparse representation for the test data using this dictionary corresponds to finding a locally linear approximation with respect to the underlying class manifold. SAR images obtained from the Moving and Stationary Target Acquisition and Recognition (MSTAR) public database were used in the classification setup. Results show that the performance of the algorithm is superior to using a support vector machines based approach with similar assumptions. Significant complexity reduction is obtained by reducing the dimensions of the data using random projections for only a small loss in performance.
74
Th. 11.3 14:00‐14:15
Event Localization Using Sensor Networks for Sources with Non‐Circular Footprint
Michalis Michaelides and Christos Panayiotou
KIOS Research Center for Intelligent Systems and Networks and the Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus
Abstract—This paper investigates the use of wireless sensor networks for estimating the location of an event that emits a signal that propagates over a large region. The contribution of the paper is that it deals with events with non‐circular footprint. In the overwhelming majority of the papers that deal with event detection and localization, it is assumed that the source has a circular footprint in the sense that the event generates a signal that propagates uniformly in all directions thus it can be detected by any sensor that is located in a circular disc around the source. In this paper, we consider a covariance detection algorithm and a non‐uniform propagation model where the event footprint is not the usual circular disc. Another contribution of this paper is that it uses measurement correlation information for localizing the event. Finally, we present some preliminary results for localizing a plume source.
Th. 11.4 14:15‐14:30
Model‐Based Fault Detection and Isolation for a Powered Wheelchair
Masafumi Hashimoto1, Fumihiro Itaba2 and Kazuhiko Takahashi1 1Doshisha University, Japan; 2Hitachi Automotive Systems, Japan
Abstract—This paper presents a model‐based fault detection and isolation (FDI) for a powered wheelchair handling faults of both the internal sensors (two wheel‐resolvers and a gyro) and the external sensor (a forward‐looking laser range sensor), as well as actuators (two wheel motors). Hard faults of the internal sensors and actuators are diagnosed based on mode probability estimated with interacting multi‐model estimator. Soft faults, which appear in the internal sensors as change of sensor gains, are diagnosed based on estimating the robot velocity with the fault‐free external sensor via scan matching method. Faults of the external sensor are detected based on errors related to the scan matching. Experimental results in indoor environments show the performance of our FDI method.
Th. 11.5 14:30‐14:45
Invited Paper
New IC Filters for the Analog Front End
George Moschytz
School of Engineering, Bar‐Ilan University, Ramat‐Gan, Israel and ETH, Zurich, Switzerland
Abstract—New methods of designing continuous‐time active RC filters for the analog front end of communication ‐ and other‐ IC system chips are described. It is shown that such methods are feasible, but that for some applications, the limitations of on chip systems (such as the vulnerability to ambient high‐voltage bursts, or the necessity to fine‐tune the circuits) calls for unconventional and creative new design techniques.
� 73
Thursday Afternoon, 4th March
Session: Identification and Estimation I
Time & Place: 13:30‐14:45 ‐‐ Amathousia
Chairperson: Christos Panayiotou
Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus
Th. 11.1 13:30‐13:45
Design and Comparative Study of the RKHS model reduction techniques
Okba Taouali, Ilyès Aissi and Hasani Messaoud
Ecole Nationale d’Ingenieurs de Monastir, Monastir,Tunisia
Abstract— Reproducing Kernel Hilbert Space (RKHS) are used to develop models describing non linear systems. Despite their effectiveness, these models suffer from parameter complexity. This paper proposes the design and the comparative study of two complexity reduction methods of such models. The first, titled support vector regression (SVR) and the second is the projection method. Both methods use the Statistical Learning Theory (SLT) which operates on Reproducing Kernel Hilbert Space (RKHS) space. The performances of both methods are evaluated on the Tennessee Eastman process.
Th. 11.2 13:45‐14:00
ZF OFDM Receiver for Underwater Communications
Alain Kibangou1, Cyrille Siclet2 and Laurent Ros2 1GIPSA‐Lab, System control Department, University, Joseph Fourier, CNRS, France ; 2GIPSA‐Lab, Image and Signal Department, University Joseph Fourier, CNRS, France
Abstract—In this paper, we propose a new scheme of transmission and reception of OFDM ( Orthogonal Frequency Division Multiplexing) signals for underwater wireless communications. The transmitter makes use of a kind of superimposed pilot signals, which are used by the receiver for estimating both the channel parameters (paths gain and delay) and the Doppler. Then, the estimated parameters are used for estimating the informative symbols in the zero forcing (ZF) sense. A new estimation scheme based on the resolution of two harmonic retrieval problems is proposed. Unlike standard methods, data resampling and estimation of residual carrier frequency offset are avoided. The efficiency of the proposed scheme is evaluated by means of simulations.
72
Th. SS. 10.3 14:10‐14:30
Performance Analysis of Single‐Symbol Maximum Likelihood Decodable Linear STBCs
Behrouz Maham1, B. Sundar Rajan2 and Are Hjørungnes1 1UNIK – University Graduate Center, University of Oslo, Norway; 2Dept. of ECE, Indian Institute of Science, Bangalore, India
Abstract—Performance of space‐time block codes can be improved using the coordinate interleaving of the input symbols from rotated M‐ary phase shift keying (MPSK) and M‐ary quadrature amplitude modulation (MQAM) constellations. This paper is on the performance analysis of coordinate‐interleaved space‐time codes, which are a subset of single‐symbol maximum likelihood decodable linear space‐time block codes, for wireless multiple antenna terminals. The analytical and simulation results show that full diversity is achievable. Using the equivalent single‐input single‐output model, simple expressions for the average bit error rates are derived over flat uncorrelated Rayleigh fading channels. Optimum rotation angles are found by finding the minimum of the average bit error rate curves.
Th. SS. 10.4 14:30‐14:50
Deterministic Processing for MIMO Systems
Ranjan Mallik1, Manav Bhatnagar1 and Jack Winters2
1Department of Electrical Engineering, Indian Institute of Technology – Delhi, New Delhi, India;
2Jack
Winters Communications, NJ, U.S.A.
Abstract—In this paper, we study a deterministic scheme in a Ricean fading single spatial stream based multiple‐input multiple‐output (MIMO) communications system, which utilizes deterministic beamforming in the transmitter and deterministic combining at the receiver. The proposed method combines the existing deterministic transmit and receive processing schemes and the MIMO system is used to provide the diversity and array gain. We propose a modified maximum likelihood receiver in which detection is performed by maximizing the likelihood function of the combined received signal with deterministic combining. By assuming perfect knowledge of the mean values of the channels at the transmitter, we obtain a beamforming vector for the transmitter. The deterministic weights are chosen by minimizing the the union bound of the pairwise error probability. The performance of the proposed scheme is compared with square‐law combining and maximal‐ratio combining through simulations.
� 71
Thursday Afternoon, 4th March
Session: Special Session on Advances in MIMO
Time & Place: 13:30‐15:00 ‐ Daphne
Chairperson: Ananthanarayanan Chockalingam
Department of ECE, Indian Institute of Science, Bangalore, India
Th. SS. 10.1 13:30‐13:50
Experiments on Peak Spectral Efficiency of 50 bps/Hz with 12‐by‐12 MIMO Multiplexing for Future Broadband Packet Radio Access
Hidekazu Taoka1 and Kenichi Higuchi2 1Radio Access Network Development Department, NTT DOCOMO, Kanagawa, Japan; 2Department of Electrical Engineering, Tokyo University of Science, Chiba, Japan
Abstract—This paper presents field experimental results of peak frequency efficiency of approximately 50 bps/Hz, i.e., 4.9 Gbps packet transmission in a 100‐MHz channel bandwidth, using 12‐by‐12 MIMOOFDM focusing on the influence of fading correlation between the transmitter and receiver antennas using vertically polarized antennas. Maximum likelihood detection (MLD)‐based signal detection was employed to achieve such high frequency efficiency with the required received signal‐to‐noise power ratio (SNR) of less than 30 dB. From the field experimental results under non‐line‐ofsight conditions, we show that the required average received SNR to achieve the throughput of 4.9 Gbps is degraded by less than 0.5 dB when the receiver antenna separation is reduced from 40 cm (6.2λ) to 10 cm (1.5λ), while it is degraded by approximately 1.5 dB when the transmitter antenna separation is decreased from 70 cm (10.9λ) to 20 cm (3.1λ). Furthermore, we clarify that the required minimum antenna separations of the base station transmitter and mobile station receiver are 20 cm and 10 cm, respectively, in order to achieve the peak throughput of 4.9 Gbps at the average received SNR of less than 30 dB in a field environment.
Th. SS. 10.2 13:50‐14:10
Low‐Complexity Algorithms for Large‐MIMO Detection
Ananthanarayanan Chockalingam
Department of ECE, Indian Institute of Science, Bangalore, India
Abstract—Low‐complexity near‐optimal detection of large multiple‐ input multiple‐output (MIMO) signals has attracted recent research attention. Recently, it has been shown that certain algorithms rooted in machine learning/artificial intelligence are well suited to achieve near‐optimal detection performance in MIMO systems with large number (tens) of antennas at practically affordable complexities. In this paper, we present three such lowcomplexity algorithms that we have proposed recently, and compare their bit error rate performance and complexities in large‐ MIMO detection. These algorithms include two local neighborhood search based algorithms, namely, likelihood ascent search (LAS) and reactive tabu search (RTS) algorithms, and a message passing algorithm based on and belief propagation (BP). Feasibility of such low‐complexity algorithms for large‐MIMO detection can enable practical implementation of high‐spectral efficiency (tens to hundreds of bps/Hz) large‐MIMO systems.
70
Th. SS. 9.3 14:10‐14:30
Speech Enhancement for Binaural Hearing Aids based on Blind Source Separation
Klaus Reindl, Yuanhang Zheng and Walter Kellermann
Multimedia Communications and Signal Processing, University of Erlangen, Erlangen, Germany
Abstract—The availability of wireless technologies leads from monaural or bilateral hearing aids to binaural processing strategies. In this paper, we investigate a class of blind source separation (BSS)‐based speech enhancement algorithms for binaural hearing aids. The blind binaural processing strategies are analyzed and evaluated for different scenarios, i.e., determined scenarios, where the number of sources does not exceed the number of available sensors and underdetermined scenarios, where there are more active source signals than microphones which is typical for hearing aid applications. These blind algorithms are an attractive alternative to beamforming as no a‐priori knowledge on the sensor positions is required. Moreover, BSS algorithms have the advantage that their optimization criteria are solely based on the fundamental assumption of mutual statistical independence of the different source signals.
Th. SS. 9.4 14:30‐14:50
Self‐calibration of two microphone arrays from volumetric acoustic maps in non‐reverberant rooms
Salvo Daniele Valente, Fabio Antonacci, Marco Tagliasacchi, Augusto Sarti and Stefano Tubaro
Dipartimento di Elettronica ed Informazion, Politecnico di Milano, Italy
Abstract—In this paper we present a methodology for the selfcalibration of two microphone arrays based on the localization of acoustic sources from volumetric acoustic maps, one for each array. A set of correspondences are obtained moving the acoustic source at different locations in space. The proposed algorithm estimates the rigid motion that brings the coordinate system of the second microphone array to the first one through the solution of a least squares problem. The approach presented here enables the self‐calibration even when the acoustic sources are in the nearfield of the microphone arrays, thus extending the methodology presented by the authors in another work.
� 69
Thursday Afternoon, 4th March
Session: Special Session on Audio Signal Processing
A.1 Acoustic Source Processing
Time & Place: 13:30‐15:00 ‐ Bacchus Ballroom
Chairpersons: Rudolf Rabenstein (Organised by)
University Erlangen‐Nuremberg, Erlangen, Germany
José Javier López Monfort
Universidad Politecnica de Valencia, Valencia, Spain
Th. SS. 9.1 13:30‐13:50
Analysis of Room Reverberation Effects in Source Localization Using Small Microphone Arrays
Maximo Cobos1, José J López1 and Sascha Spors2 1Institute of Telecommunications and Multimedia Applications, Universidad Politécnica de Valencia, Valencia, Spain; 2Deutsche Telekom Laboratories, Technische Universität Berlin, Berlin, Germany
Abstract—Small microphone arrays provide many advantages for real‐world audio applications. Together with digital signal processing, their enhanced acoustic properties can be exploited in many speech processing systems, such as hands‐free devices, videoconferencing or hearing aids. Among their classical applications is source localization, which is usually based on the estimation of Time‐Differences‐Of‐Arrival (TDOA). The accuracy of these methods depends on the degree of reverberation, due to the increased variance found in TDOA estimates. In this paper, we characterize reverberation in a room by means of a small threemicrophone array. Our experiments show that the directional distribution of time‐frequency estimates is highly correlated with the room’s reverberation. This correlation results in a model that can be very useful for both estimating reverberation time and setting the resolution achievable in source localization tasks.
Th. SS. 9.2 13:50‐14:10
Accuracy of Time‐Difference‐of‐Arrival Based Source Localization Algorithms under Temperature Variations
Paolo Annibale and Rudolf Rabenstein
University Erlangen‐Nuremberg, Erlangen, Germany
Abstract—Time‐differences‐of‐arrival measurements play a relevant role in localizing and tracking of acoustic sources. Though a huge literature has been devoted to this topic the influence of the propagation speed on the localization accuracy has been largely disregarded. The sound speed is usually supposed to be exactly known, but actually this information is far from being available in real situations, where the environment conditions are uncontrolled and might significantly change. Therefore the accuracy of the existing algorithms under temperature variations and the consequent propagation speed deviation is of interest. Two well known closed‐form localization methods are reviewed under the hypothesis that the sound speed is wrongly assumed due to unknown temperature variations. After a mathematical treatment, simulation and measurement results which confirm the conjectures are shown.
68
Th. SS. 8.3 11:40‐12:00
Interleaved quantization‐optimization and predictor structure selection for lossless compression of audio companded signals
Ioan Tabus, Vlad Tabus and Jaakko Astola
Department of Signal Processing, Tampere University of Technology, Finland
Abstract—We investigate in this paper the lossless audio coding performance achievable when the linear prediction is performed in the decompanded domain and the predictors are designed by the interleaved quantization‐optimization Burg algorithm. The Burg algorithm decouples the optimization process into stages for optimizing separately each reflection coefficient and thus provides a fast way for designing efficient linear predictors. Although achieving high order predictors becomes computationally well feasible, the experimental results show that prediction orders higher than 20 are rarely needed since the compression ratio saturates very quickly after this limit. The overall coding method compares favorably with the recently adopted G711‐LLC standard.
Th. SS. 8.4 12:00‐12:20
Fast search on the shells of Golay codes
Ioan Tabus, Mari Seppanen and Adriana Vasilache
Department of Signal Processing, Tampere University of Technology, Tampere, Finland
Abstract—Search algorithms in Golay codebooks are necessary both for maximum likelihood decoding and for vector quantization applications. This work presents algorithms for fast search on shells (set of codewords having the same Hamming weight) of binary Golay codes. The algorithms are based on the Golay codebook projection into a hexacode codebook. Two cases are considered: when the nearest neighbors within each of the shells are simultaneously determined or when they are independently determined.
� 67
Thursday Morning, 4th March
Session: Special Session on Information Theoretic Methods in Signal Processing
Time & Place: 11:00‐12:00 ‐ Salaminia
Chairperson: Jaakko Astola
Department of Signal Processing, Tampere University of Technology, Finland
Th. SS. 8.1 11:00‐11:20
Secure HARQ communication protocols based on Turbo Codes
Alessandro Neri, Daniele Blasi and Patrizio Campisi
Applied Electronics Department at the University of Roma TRE, Roma, IT
Abstract—In this paper a secure Incremental Redundancy ‐ Hybrid Automatic Repeat Request (IR‐HARQ) scheme, based on Turbo Codes (TC), is proposed. Typical drawbacks of HARQ systems, such as spectral efficiency, latency unpredictability, correct packet delivery control (under fixed dead‐line time) are definitively minimized thanks to a mathematical approach that exploits the statistical property of Additive Gaussian White Noise (AWGN) and the theoretical evaluation of Turbo Codes performance (in terms of symbol and codeword error probability). In order to decide if the received frame is correct and authentic, or a NACK (Non ACKnowledgment) packet must be forwarded to the sender, the codeword is examined through a verification test based on an adaptive threshold that: 1) depends on channel condition; 2) takes into account the error probability associated with of the current re‐transmission step turbo code redundancy amount; 3) verifies if the sender is authentic (i.e. if he/she makes use of the correct turbo encoding parameters).
Th. SS. 8.2 11:20‐11:40
Maximum likelihood, optimal L‐ and adaptive estimators of location parameter for data samples with symmetric heavy‐tailed distributions
Alexey Roenko1, Vladimir Lukin1 and Igor Djurovic2
1National Aerospace University named after, N.E. Zhukovsky “KhAI”, Kharkov, Ukraine; Electrical Engineering Department, University of Montenegro, Podgorica, Montenegro
Abstract—The paper deals with theoretical and practical aspects of location parameter robust estimation for data samples of limited size under assumption that they obey a heavy‐tailed distribution symmetric with respect to location parameter. It is assumed that distribution and/or its parameter are a priori unknown. Then, adaptation is desirable in order to provide appropriate accuracy. Four different adaptive robust estimators are considered. Their accuracy is studied and compared between each other as well as to accuracy that can be provided by maximum‐likelihood and optimal L‐estimators. It is shown that the considered adaptive estimators perform well for three typical families of non‐Gaussian distributions widely used to model non‐Gaussian heavy‐tailed processes (data).
66
Th. 7.7 12:30‐12:45
A New Dissimilarity Index of EEG SIGNALS for Epileptic Seizure Detection
Mohammad Niknazar1, Seyed Reza Mousavi2, Bijan Vosoughi Vahdat1, Mohammad Bagher Shamsollahi1 and Mohammad Sayyah3
1Biomedical Signal and Image Processing Laboratory (BiSIPL), School of Electrical Engineering, Sharif, University of Technology, Tehran, Iran; 2Biomedical Engineering Laboratory, School of Electrical Engineering, Sharif University of Technology, Tehran Iran; 3Physiology and Pharmacology Department, Pasteur Institute
Abstract—Epileptic seizures are generated by an abnormal synchronization of neurons. Since epileptic seizures are unforeseeable for the patients, epileptic seizures detection is an interesting issue in epileptology, that novel approaches to understand the mechanism of epileptic seizures. In this study we analyzed invasive electroencephalogram (EEG) recordings in patients suffering from medically intractable focal epilepsy with a nonlinear method called, dissimilarity index. In order to detect epileptic seizures Bhattacharyya distance between trajectory matrix of reference window during an interval quite distant in time from any seizure and trajectory matrix of present window is employed to measure dynamical dissimilarity index. The data were recorded during an invasive pre‐surgical epilepsy monitoring at the "Epilepsy Center of the University Hospital of Freiburg", Germany. Results show a significant increase in Bhattacharyya distance values between trajectory matrix of reference window and trajectory matrix of present window during seizure. Our results suggest that this technique is useful to detect changes due to epileptic seizures in the EEG.
� 65
Th. 7.5 12:00‐12:15
DCN Variations for Autism Diagnosis
Majid Alsagabi and Ahmed Tewfik
Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA
Abstract—Autism is correlated with DNA copy number variations (DCV). We used a statistical approach to prove the existence of significant differences between the copy number burden of 71 autistic children and 71 typically developing children. Then we used Fuzzy c‐means to cluster the data of 142 individuals. We tested the most distinctive regions and determined 9 small segments of the genome where the classification of autistic and normal children achieves an accuracy of 81%.
Th. 7.6 12:15‐12:30
M‐mode State Based Identification in Ultrasound Videos of the Carotid Artery
C. P. Loizou1, M. Pantziaris2, C. S. Pattichis3, E. Kyriakou4 1Department of Computer Science, School of Sciences, Intercollege, Limassol, Cyprus;
2Cyprus Institute
of Neurology and Genetics, Nicosia, Cyprus; 3Department of Computer Science, University of Cyprus, Nicosia, Cyprus; 4Department of Computer Science, Frederick University, Limassol, Cyprus
Abstract—Monitoring the wall and plaque changes in the carotid artery (CA) can provide useful information for the assessment of the atherosclerotic disease. Using a motion mode (M‐mode) image, detailed information may be obtained about wall and lumen dimensions, systolic and diastolic artery diameter and distension, wall and plaque motion and thickness, and also their corresponding states (timings). The wall thickness and the diameter of the CA change during the cardiac cycle are an indicator of regional contraction and therefore an indication of a disease. The objective of this work was to investigate how M‐mode state based modeling of the CA can be derived from a B‐mode ultrasound video. Briefly, 10 longitudinal CA ultrasound videos acquired from symptomatic subjects at risk of atherosclerosis were broken into frames and their M‐mode images were generated. These were then despeckled and the atherosclerotic carotid plaque was segmented from each video, in order to extract the states of the video. By identifying the states of the CA, we can distinguish between normal and abnormal plaque motion. It was shown in this work, that M‐mode state based modeling derived from Bmode videos can be used successfully to derive the carotid states and assess the corresponding wall changes. However, further work in a larger number of videos is needed for validating the proposed method and to differentiate between normal and abnormal state based plaque motion analysis.
64
Th. 7.3 11:30‐11:45
Diffuse Optical Mammotomography Based on Backprojection Algorithm with Vainberg‐Butterworth Filtration
Alexander Konovalov1, Alexander Uglov
1 and Vladimir Lyubimov
2
1Russian Federal Nuclear Center Zababakhin Institute of Applied Physics, Snezhinsk Chelyabinsk Region; 2Institute for Laser Physics of Vavilov State, Optical Institute Corporation, St.Petersburg, Russia
Abstract—The paper considers a layer‐to‐layer 3D reconstruction method for diffuse optical mammotomography which uses conic geometry for time‐domain measurements. The method is based on an approximate 2D reconstruction of transverse layers of a conic scattering object by inverting an integral equation with integration along a photon average trajectory. The equation is inverted using a backprojection algorithm with an original filtration of optical projections by the Vainberg‐Butterworth method. A numerical experiment shows that our method reconstructs the 3D distributions of absorbing inhomogeneities embedded in a conic object much faster than the multistep Newton‐like algorithms, and reconstruction accuracy remains acceptable, at least when inhomogeneities are not in the immediate vicinity of object boundaries.
Th. 7.4 11:45‐12:00
The Bilinear Brain: Towards Subject‐Invariant Analysis
Christoforos Christoforou1, Robert Haralick2, Paul Sajda3 and Lucas Parra4
1R.K.I Leaders Limited, Aradipou, Larnaca, Cyprus; 2Department of Computer Science, Graduate Center, CUNY, New York, USA; 3Department of Biomedical Engineering, Columbia University, New York, USA; 4Department of Biomedical Engineering, The City College of The City University of New York, USA
Abstract—A major challenge in single‐trial electroencephalography (EEG) analysis and Brain Computer Interfacing (BCI) is the so called, inter‐subject/inter‐session variability: (i.e large variability in measurements obtained during different recording sessions). This variability restricts the number of samples available for single‐trial analysis to a limited number that can be obtained during a single session. Here we propose a novel method that distinguishes between subject‐invariant features and subject‐specific features, based on a bilinear formulation. The method allows for one to combine multiple recording of EEG to estimate the subject‐invariant parameters, hence addressing the issue of inter‐subject variability, while reducing the complexity of estimation for the subject‐specific parameters. The method is demonstrated on 34 datasets from two different experimental paradigms: Perception categorization task and Rapid Serial Visual Presentation (RSVP) task. We show significant improvements in classification performance over state‐of‐the‐art methods. Further, our method extracts neurological components never before reported on the RSVP thus demonstrating the ability of our method to extract novel neural signatures from the data.
� 63
Thursday Morning, 4th March
Session: Biomedical Signal and Image Processing
Time & Place: 11:00‐12:30 ‐ Amathousia
Chairpersons: Christos Loizou Intercollege, Cyprus
Efthyvoulos Kyriacou Frederick University, Cyprus
Th. 7.1 11:00‐11:15
Comparison of Canonical Correlation Analysis and ICA Techniques for fMRI
Mohammad Reza Arbabshirani1, Mansor Nakhkash2 and Hamid Soltanian Zadeh3
1ECE department, University of New Mexico, USA; 2Dept. of Electrical Eng.,Yazd University, Yazd, Iran; 3Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran
Abstract—This paper compares independent component analysis (ICA) and canonical correlation analysis (CCA) applied to functional magnetic resonance imaging (fMRI) data. There has been no systematic comparison of these techniques so far. Two variants of the ICA, Infomax and FastICA, are implemented. The CCA method is investigated according to the signal subspace spanned by two hemodynamic response models: differential Gamma and Balloon models. The criterion for the comparison is the area under receiver operating characteristic (ROC) curve for simulated datasets. This criterion is evaluated for different contrast to noise ratios (CNR). Using a real auditory dataset, the paper also compares the aforementioned algorithms in terms of task‐related activation maps. The results indicate the superiority of the CCA for CNRs below 0.75; but as the CNR goes beyond this limit, the ICA with Infomax algorithm outperforms other methods. Furthermore, the use of either differential Gamma or Balloon models in the CCA provides nearly the same performance. The paper results can assist the selection of an appropriate algorithm for fMRI data analysis.
Th. 7.2 11:15‐11:30
Processing of human colonic pressure signals using overdetermined ICA
Cheng Pan, Sheping Tian and Guozheng Yan
School of Electronic, Information and Electrical Engineering, Shanghai Jiao Tong Univ., Shanghai, China
Abstract—Independent component analysis (ICA) is a broadly used method for blind source separation (BSS). The mature ICA model has a restriction that the number of sources must equal to that of sensors used to collect data, which is hard to meet in practice mostly. In this paper, an overdetermined ICA method were proposed and successfully used in the analysis of human colonic pressure signals. Using principal component analysis (PCA), the method estimated the number of sources firstly and reduced the dimension of observed signals to be same with that of the sources; and then, Fast‐ICA was used to estimate all the sources. From 26 groups of colonic pressure recordings, several colonic motor patterns were extracted, which not only proved the effectiveness of this method, but also greatly facilitated further medical researches.
62
Th. SS. 6.5 12:00‐12:15
CoolReader‐‐‐An Energy Autonomous E‐Reader with Broadband Wireless Connection
Christian Isheden1, Matthias Klaus2 and Gerhard Fettweis1
1Vodafone Chair Mobile Communications Systems, Technical University Dresden, Dresden, Germany; 2Plastic Logic GmbH, Dresden, Germany
Abstract—The CoolReader project aims at designing an energy autonomous e‐reader device. With the aid of photovoltaic cells adjusted to the e‐reader, the device should be able to supply itself almost completely with energy from the ambient light, even in indoor lighting conditions. This way, the daily printed newspaper can be replaced by an electronic newspaper. Crosslayer approaches to energy‐efficient data transmission, based on quality of service requirements and link adaptation, are key to enable more services to be used in energy autonomous operation.
�
� 61
Th. SS. 6.3 11:30‐11:45
Approaches to Energy Efficient Wireless Access Networks
Oliver Blume1, Dietrich Zeller1,2 and Ulrich Barth1
1Wireless Communication, Department of Alcatel‐Lucent Bell Labs in Stuttgart, Germany; 2Project Coordinator of the EARTH project
Abstract—Due to increasing data traffic rates and rollout of advanced radio transmission technologies wireless networks consume increasing amount of energy and contribute a growing fraction to the CO2 emissions of ICT industry. Thus, climate and cost issues now shift the research focus of wireless communications to energy consumption and energy efficiency. Two approaches can be followed: Incremental improvements of existing systems or a clean slate re‐design with a fundamental change of paradigms. We describe two such initiatives and discuss their differences. The EC FP7 project EARTH is a 30 month project aiming for a reduction of the overall energy consumption of 4G mobile broadband networks by 50%, regarding network aspects and individual radio components from a holistic point of view. The Green Touch Initiative is a privately financed consortium addressing fundamental research that will pave the way to much higher reductions for future systems in the order of several magnitudes, with first proof of concepts available in 5 years.
Th. SS. 6.4 11:45‐12:00
A Novel Time‐Domain Sleep Mode Design for Energy‐Efficient LTE
Rui Wang, John Thompson and Harald Haas
Institute for Digital Communications, Joint Research Institute for Signal and Image Processing, School of Engineering and Electronics, the University of Edinburgh, Edinburgh, UK
Abstract—This paper describes a time‐domain approach for base station transmission sleep modes, taking the Long Term Evolution (LTE) system as a specific example. The idea of this design is to enable the base station to reduce RF energy consumption in low traffic conditions, while still properly supporting active user connections. By switching off traffic during a certain time period and delivering all user information with fewer transmissions under the same rate targets, the energy consumption can be reduced since the control signalling during non‐active time is gated off. Taking the example of single user system for simplification, the optimum on‐off time with associated power allocation are derived, which enables the energy consumption of the base station to scale with traffic loading. Compared with the corresponding non‐sleep mode, this can achieve an up to 90% energy reduction in low traffic conditions.
60
Thursday Morning, 4th March
Session: Special Session on Green Communications
Time & Place: 11:00‐12:15 ‐ Daphne
Organised by: Gerhard P. Fettweis and Steffen Bittner
Chairperson: Christian Isheden
TU Dresden, Vodafone Chair, Dresden, Germany
Th. SS. 6.1 11:00‐11:15
Communication Infrastructure of Smart GRID
Kwang‐Cheng Chen
Graduate Institute of Communication Engineering National Taiwan University, Taipei, Taiwan
Abstract—Information communication technology (ICT) enabling energy efficiency has been considered as the fastest way to reduce carbon CO2 generation, while replacement energy may take decades to deploy. We start observations of electricity flow in the power grid and suggest a distributed optimization of electricity usage under a hierarchical structure and propose possible direction to facilitate the communication infrastructure of smart grid.
Th. SS. 6.2 11:15‐11:30
Overall ICT Footprint and Green Communication Technologies
Willem Vereecken, Ward Van Heddeghem, Didier Colle, Mario Pickavet and Piet Demeester
Ghent University ‐ IBBT, Department of Information Technology (INTEC) Ghent, Belgium
Abstract—Green communication technologies currently receive a lot of attention. In this paper we give an overview of the environmental issues related to communication technologies en present an estimation of the overall ICT footprint. Additionally we present some approaches on how to reduce this footprint and how ICT can assist in other sectors reducing their footprint.
� 59
Th. 5.5 12:00‐12:15
Hybrid Embedding Strategy For a Blind Audio Watermarking System Using EMD and ISA Techniques
el Hamdouni Nawal1 , Adib Abdellah2, Sonia Djaziri Larbi3 and Monia Turki3 1LRIT, laboratory associated of CNRST, Faculty of Sciences, Rabat, Maroc; 2LIM@II‐FSTM; 3U2S, ENIT, Tunis, Tunisie
Abstract—In this paper, a new digital audio watermarking scheme is discussed to increase the information transmitted in a communication context [7]. It is based on a new approach to embed/extract the watermark by combining the Empirical Mode Decomposition (EMD) [4] and the Blind Source Separation (BSS) based on the Independent Subspaces Analysis (ISA) method [2]. In order to increase the embedded binary data flow, the Intrinsic Mode Functions (IMFs) of the audio host signal are watermarked using a specific mixture that ensures the inaudibility of the watermark. The separation between the IMFs and the watermarks is performed by a new proposed underdetermined ISA method, (UISA). The performances and the robustness of the proposed watermarking system are evaluated with different types of audio signals. The obtained results permit to assess the achieved efficiency in terms of bit error rate (BER).
Th. 5.6 12:15‐12:30
Audio object individual operation and its application to earphone leakage noise reduction
Shota Suzuki1, Shigeki Miyabe2, Noriyoshi Kamado1, Hiroshi Saruwatari1, Kiyohiro Shikano1, Toshiyuki Nomura3
1Nara Institute of Science and Technology, Nara, Japan; 2The University of Tokyo, Tokyo, Japan, 3NEC Corporation, Kanagawa, Japan
Abstract—In this paper, we propose a new extension framework of multichannel audio coding based on temporal quantization of spatial information. In our previous study, multiple‐audio‐object signal can be encoded/decoded via prototypes of directional clustering for each audio object. This paper, first, pays attention to the fact that quantized information corresponds to the spatial image of each sound object, and is easily modified and operated by the end users. Next, as a novel application of the spatial image operation, we propose a new earphone leakage noise reduction method in which the mostly leaked sound object can be detected automatically based on the higher‐order statistics, and eliminated. The effectiveness of the proposed CODEC is verified in the subjective evaluation, and leakage noise reduction method is assessed in the objective evaluation.
�
58
Th. 5.3 11:30‐11:45
Localisation‐based, situation‐adaptive mask generation for source separation
Nilesh Madhu and Jan Wouters
ExpORL,Dept. Neurosciences, Katholieke Universiteit Leuven, Leuven, Belgium
Abstract—Presented is a microphone‐array based approach for the extraction of individual signals from a mixture of competing sources and background noise. Source separation is done using data‐driven soft‐masks, the parameters for the estimation of these masks being obtained from an extension of a recently proposed source localisation and tracking framework. The separation algorithm is applicable to any arbitrary array – allowing for its integration into a wide variety of applications. The advantage of the proposed mask generation over state‐of‐theart mask‐based algorithms is the implicit scalability with respect to the number of microphones (M), the number of sources (Q), spatial source spread, and reverberation – obviating the need for heuristic adaptation of the mask generation to different acoustical scenarios. The individual signals extracted using the soft‐masks evince low amounts of musical noise. Smoothing these masks in their cepstral representation further reduces the musical noise phenomenon whilst preserving the signal of interest, thereby improving the listening experience.
Th. 5.4 11:45‐12:00
Incorporating the Human Hearing Properties in the GSVD‐Based Approach for Speech Enhancement
Masoud Geravanchizadeh and Sanaz Ghaemi Sardaroudi
Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran
Abstract—A perceptually motivated subspace‐based approach is proposed for the enhancement of speech corrupted by colored noise. The proposed approach takes into account the frequency masking properties of the human auditory system and reduces the perceptual effect of the residual noise. A new GSVD‐based approach, called perceptually constrained GSVD (PCGSVD), is proposed, where the difference from the previously proposed truncated QSVD‐based approach is clearly indicated. Closed‐form solution is obtained for the PCGSVD enhancement approach. Very carefully performed objective evaluations and subjective tests show that the PCGSVD approach proposed here can offer improved speech quality, and intelligibility in the case of stationary and nonstationary noises, especially when the additive noise is nonwhite.
� 57
Thursday Morning, 4th March
Session: Audio and Speech II
Time & Place: 11:00‐12:45 ‐ Bacchus Ballroom
Chairperson: Aníbal Ferreira University of Porto, FEUP‐DEEC, Portugal
Th. 5.1 11:00‐11:15
Formant Distortion After Codecs For Arabic
Amr Nabil and Mohamed Hesham
Engineering Mathematics and Physics Dept., Faculty of Engineering, Cairo University, Egypt
Abstract—In this work, we present results on the effect of well‐known mixed excitation linear prediction (MELP) and codeexcited linear prediction (CELP) coders on the formants of Arabic sounds. The study shows, firstly, the spectral distortion of different Arabic phonemes due to mentioned coders. It was found that MELP1200 coder results in largest distortion. The coders effect on vowel formants are then investigated. The experiments show that the first formant of a vowel, on the average, suffers a frequency shift in the order of 50 Hz from its original value. Also, the amplitude distortion of the vowel formants due to Melp1200 coder was the highest, compared to the distortion of the other coders. Vowel formants have a shift which may exceed one critical band below or above its reference value.
Th. 5.2 11:15‐11:30
The Research and Implementation of Acoustic Module Based Mandarin TTS
Cheng‐Yu Yeh
Department of Electrical Engineering, National, Chin‐Yi University of Technology, Taichung, Taiwan, Republic of China
Abstract—The primary study of this paper is focused on the acoustic module (AM) design in order to improve the performance of Mandarin TTS system. The AM is composed of the prosody generator, the spectrum generator, and the speech synthesizer. The HMM, recurrent neural network (RNN), and PSOLA algorithms are employed to build the AM. Finally, the performance analyses including the speech quality, memory requirement, and computational complexity are examined in our system. Smaller than 2.4 MB memory space and average 0.08 MIPS for each syllable can be achieved on the fixed‐point DSP chip. Also the synthesized speech sounds very good.
56
Thursday Morning, March 4th
Session: Keynote Th.1
Time & Place: 8:30‐9:30 ‐ Bacchus Ballroom
Chairperson: Moncef Gabbouj Tampere University of Technology, Tampere, Finland
8:30 On the Role of Signal Processing in the Amazing Progress of Digital Storage Jack Keil Wolf Stephen O. Rice Professor of Electrical and Computer Engineering and a member of the Center for Magnetic Recording Research, University of California, San Diego, USA
ABSTRACT ‐ By almost any measure (e.g., bits per square inch, cost per megabyte, throughput) digital storage has seen remarkable progress over the last 50+ years. In this talk I will summarize the role that advanced signal processing techniques has played in this development. I will also describe the new technologies which are competing for the next generation storage systems.
Session: Keynote Th.2
Time & Place: 9:30‐10:30 ‐ Bacchus Ballroom
Chairperson: Costas N. Georghiades Texas A&M University, Texas, USA
9:30 Low Power Design for Video Processing and Compression Satoshi Goto Waseda University, Japan ABSTRACT ‐ The growing class of personal multimedia devices (camera phone, digital camera, portable desk‐tops, audio‐ and video‐based multimedia products) as well as imaging systems and multimedia communication systems, that demand real‐time processing capability with low power consumption, becomes one driving factor for developing efficient video processing and compression techniques with low power consumption. In this talk, a brief overview of H.264 and its extensions will first be provided with the analysis on the performance relationships among them. Some emerging possibilities for new coding techniques will be summarized. Then, video processing and compression techniques targeting the objective of real‐time and low‐power processing are presented for different kinds of multimedia applications like smart car, video telephony, video surveillance, high definition video broadcast and etc. Since the different kinds of applications result in diversity in video content, the techniques are designed accordingly to pursue the best trade‐off between the power consumption and processing performance. Algorithms together with the hardware implementation schemes are selectively introduced with performance comparison and discussion.
� 55
Wed. 4.5 12:00‐12:15
Evidence of spatio‐temporal transition to chaos in the spine
Srideep Musuvathy1 and Edmond Jonckheere2
1Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA; 2Department of Electrical Engineering and Mathematics, University of Southern California, Los Angeles, CA, USA
Abstract—In this paper we analyze sEMG signals collected during a procedure in which a traveling, and ultimately a standing wave is induced along the spine. In particular, we used the recently proposed method called the zero‐one test [2]. Using this binary test, we show that the dynamics at the sacrum of the spine is not chaotic while the dynamics transitions to chaos along the spine to the cervix. Further more, the test reveals certain interesting dynamical systems properties that are discussed.
Wed. 4.6 12:15‐12:30
A local Total Electron Content Neural Network model over Cyprus
Haris Haralambous1, Photos Vrionides1, Lefteris Economou2 and Harris Papadopoulos1
1Frederick University Nicosia, Cyprus; 2Intercollege, Limassol, Cyprus
Abstract—This paper presents the application of neural networks for the prediction of the Total Electron Content (TEC) over Cyprus. This ionospheric characteristic constitutes an important parameter in trans‐ionospheric links since it is used to derive the signal delay imposed by the ionosphere. The model is based on TEC measurements obtained over a period of 11 years.
�
�
54
Wed. 4.3 11:30‐11:45
DCT based Scalable Scrambling Method with Reversible Data Hiding Functionality
KokSheik Wong1 and Kiyoshi Tanaka2
1Faculty of Engineering, Multimedia University, Malaysia; 2Faculty of Engineering, Shinshu University, Nagano, Japan
Abstract—This paper proposes a scalable scrambling method in the DCT compressed domain while inserting external information into the content to be scrambled. Scalable scrambling effect is achieved by permuting DC components using a window of size that varies according to a parameter, and external information is encoded by imposing a specific relationship on the cardinality of two adjacent coefficient blocks. The zerorun‐level pairs and the cardinality of each coefficient block are generated and enqueued to a list. This list is permuted and sequentially de‐queued to generate the scrambled image. The ideas are implemented in JPEG compressed domain, and the basic performance of our scalable scrambling and data hiding method are verified with standard test images.
Wed. 4.4 11:45‐12:00
Single‐Microphone Blind Audio Source Separation via Gaussian Short+Long Term AR Models
Antony Schutz and Dirk Slock
EURECOM, Mobile Communication Department, Sophia Antipolis Cedex, France
Abstract—Blind audio source separation (BASS) arises in a number of applications in speech and music processing such as speech enhancement, speaker diarization, automatedmusic transcription etc. Generally, BASS methods consider multichannel signal capture. The single microphone case is the most difficult underdetermined case, but it often arises in practice. In the approach considered here, the main source identifiability comes from exploiting the presumed quasi‐periodic nature of sources via long term autoregressive (AR) modeling. Indeed, musical note signals are quasi‐periodic and so is voiced speech, which constitutes the most energetic part of speech signals. We furthermore exploit (e.g. speaker or instrument related) prior information in the spectral envelope of the source signals via short term AR modeling, to also help unravel spectral portions where source harmonics overlap, and to provide a continuous treatment when sources (e.g. speech) temporarily lose their periodic nature. The processing considered here uses windowed signal frames and alternates between frequency and time domain processing for optimized computational complexity. We consider Variational Bayesian techniques for joint source extraction and estimation of their AR parameters, the simplified versions of which correspond to EM or SAGE algorithms.
� 53
Wednesday Morning, 3rd March
Session: Applications
Time & Place: 11:00‐12:30 ‐ Salaminia
Chairperson: Nicolas Tsapatsoulis
Cyprus University of Technology, Cyprus
Wed. 4.1 11:00‐11:15
Region‐of‐Interest based Adaptation of Video to Mobile Devices
Tamir Nuriel and David Malah
Department of Electrical Engineering, Technion‐ Israel Institute of Technology
Abstract—The goal of this work is to develop methods for the adjustment of video in standard definition resolution to the smaller resolution used in mobile devices. The naive solution is to scale each frame to the desired size. But, objects must be at a sufficient size to be recognized easily. Therefore, it was suggested in previous works to display only a Region Of Interest (ROI). In this work we focus on news broadcasting and interview scenes, so the ROI contains the speaker’s face. At the beginning of every scene, the ROI is marked by an editor. We present a novel algorithm for tracking the ROI. The algorithm estimates the global motion caused by the camera and the local motion caused by the speaker’s movements. We estimate the motion parameters using horizontal and vertical projections. The slice‐projection theorem and the Mellin transform are used for reducing complexity.
Wed. 4.2 11:15‐11:30
A crop field modelling to simulate agronomic images
Gawain Jones1, Christelle Gee1, S. Villette1 and Frédéric Truchetet2
1AgroSup Dijon, Dijon, France; 2Le2i, Université de Bourgogne, Dijon, France
Abstract—In precision agriculture, crop/weed discrimination is often based on image analysis but though several algorithms using spatial information have been proposed, not any has been tested on relevant databases. A simple model that simulates virtual fields is developed to evaluate these algorithms. Virtual fields are made of crops, arranged according to agricultural practices and represented by simple patterns, and weeds that are spatially distributed using a statistical approach. Then, experimental devices using cameras are simulated with a pinhole model. Its ability to characterize the spatial reality is demonstrated through different pairs (real, virtual) of pictures. Two spatial descriptors (nearest neighbor method and Besag’s function) have been set up and tested to validate the spatial realism of the crop field model, comparing a real image to the homologous virtual one.
52
Wed. 3.3 11:30‐11:45
Performance comparison of techniques for DNA sequence prediction using neural networks
Georgi Tsenov, Alexandra Nikolova, and Valeri Mladenov
Technical University of Sofia, Bulgaria
Abstract—The conversion of symbolic sequences into complex genomic signals reveals surprising regularities of genomes, both locally and at a global scale. This approach allows usage of standard signal processing methods for the nucleotide sequences analysis and specifically for the prediction of nucleotides when knowing the preceding ones in a sequence. In this paper we propose variety of methods and ways when using artificial neural networks at its core to efficiently predict the next sample in the genomic sequence.
Wed. 3.4 11:45‐12:00
An Adaptive Intelligent Model for Nucleotide Sequence Forecasting
Iulian Nastac1 and Rodica Tuduce2
1Electronics Department, University, "Politehnica" of Bucharest, Bucharest, Romania; 2Bio‐Medical Engineering Centre, Polytechnic, University of Bucharest, Bucharest, Romania
Abstract—The paper presents an adaptive retraining procedure that starts from a previously trained artificial neural network (ANN). The system is retrained to learn the evolution of a non‐stationary sequence, without forgetting completely the previously learned data. The optimal ANN architecture is selected and the set of delayed input vectors is replaced with their principal components. The method is used for analyzing DNA genomic sequences.
� 51
Wednesday Morning, 3rd March
Session: Genome Signal Analysis
Time & Place: 11:00‐12:30 ‐ Amathousia
Chairperson: Paul Dan Cristea (Organized by)
University "Politehnica" of Bucharest, Romania
Wed. 3.1 11:00‐11:15
Nucleotide Genomic Signals Methodology
Paul Dan Cristea
University "Politehnica" of Bucharest, Romania
Abstract—The nucleotide genomic signals (NuGS) methodology is based on the conversion of symbolic nucleotide sequences into digital genomic signals. The representation we use is unbiased, i.e., adequate for a large spectrum of problems related to DNA analysis. The NuGS methodology can be used both for the analysis of large scale features of genomic sequences, maintained over distances of 106 ‐ 108 base pairs, allowing to reveal hidden features and ancestral structures of nucleotide sequences, but also for the local study of nucleotide sequences, such as in the analysis of pathogen variability, important in the context of the development of pathogen resistance to treatment.
Wed. 3.2 11:15‐11:30
Local description of molecular surfaces
Arsene Octavian
POLITEHNICA University of Bucharest, Bucharest, Romania
Abstract—The paper presents a new approach for describing artificial and biological nanostructured surfaces. The atoms at the surface of a molecule are divided among the threads and a feature vector is created for each of them. The properties include the cumulated hydrophobicity in the neighborhood of each surface atom, represented in a standardized hexagonal pattern that approximates the actual surface distribution. The implementation is based on a Java Platform. The main benefits are the rich library, the powerful integration with other technologies and applications, as well as the large support community. The chosen architecture was a multi‐threading one, able to process a large number of atom properties, such as type, 3D coordinates, charge and hydrophobicity, and to reduce the time request of the algorithm. In order to have a friendly and productive user interface, Java 2D and 3D packages have been used for canvases depicting atoms clusters at the molecule surface The purpose of this work is to create a database of molecular surfaces that will be used in several nanotechnology research fields.
50
Wed. SS. 2.5 12:00‐12:15
Adaptive Channel Coding for the Three‐Node Relay Channel with Limited Channel‐State Information
Zhongwei Si, Ragnar Thobaben and Mikael Skoglund
1School of Electrical Engineering and ACCESS Linnaeus Center Royal Institute of Technology (KTH), Stockholm, Sweden
Abstract—We address the design of adaptive channel codes for the three‐node relay channel. In order to make the code design feasible for wireless sensor‐network (WSN) applications, we focus on the special case where only limited channel‐state information is available for code adaptation. For this purpose we design distributed codes which feature a limited set of modes which are optimized to serve a certain range of channel conditions. As the results show, a good performance in terms of coverage and achievable rate is maintained compared to the case with perfect channel‐state information. If the target application is spectrum sensing, the proposed scheme provides a feasible solution to improve the sensing performance and to reduce the latency due to its increased data rate compared to standard solutions.
Wed. SS. 2.6 12:15‐12:30
A Novel Parallelized Goodness‐of‐Fit Test Based Dynamic Spectrum Access Technique for Cognitive Radio Networks
Nikhil Kundargi and Ahmed Tewfik
University of Minnesota, Twin Cities, Minneapolis, Minnesota, USA
Abstract—Cognitive Radio Networks (CRNs) operate on the principle of opportunistically exploiting unused capacity in the primary network via Dynamic Spectrum Sensing. In this paper we propose a novel suite of transmit opportunity detection methods that effectively exploit the gray space in high traffic packet networks. We present a radically different paradigm to exploit the excess Signal‐to‐Noise ratio regime in which the primary network usually operates via a modification of the Interference Temperature concept. The proposed method is based on robust and rapid detection of changes in the primary network statistics through the use of a novel Parallelized Goodness‐of‐ Fit test. The instantaneous transmit margin afforded by the primary network is dynamically determined and the CRN backs off whenever it detects that it is beginning to interfere with the primary network. We have implemented the proposed method on a CRN testbed that coexists with a large scale IEEE 802.11 primary network and demonstrate its excellent performance through extensive real world experimental results. We obtain more than 95 % probability of detection of interference while the probability of not detecting a valid transmit opportunity is less than 20 % for detection times of 400‐1000 ms.
� 49
Wed. SS. 2.3 11:30‐11:45
Characterization of spatial diversity in cooperative spectrum sensing
Jan Oksanen, Jarmo Lundén and Visa Koivunen
Aalto University School of Science and Technology, Department of Signal Processing and Acoustics, Finland
Abstract—Cognitive radios (CR) and dynamic spectrum access (DSA) provide an efficient way to exploit underutilized radio spectrum by allowing secondary users to access licensed frequencies in an agile manner. This principle allows secondary users to access a licensed frequency band when their transmission will not interfere the primary receiver. Consequently, spectrum sensing is needed by the secondary users to describe the state of a licensed frequency band as vacant or occupied, which can be for a single user a dubious task due to the random nature of the wireless channel. To mitigate the effects of channel fading on detection, cooperative detection algorithms have been proposed in the literature. The gain from cooperation comes from spatial diversity as the signal is observed via multiple independent channels. In order to characterize spatial diversity in multichannel signal detection we propose a measure for the spatial diversity. We define spatial diversity as the maximum slope of the probability of detection curve in the logarithmic SNR scale. This definition looks promising for three reasons: 1) it shows that diversity is obtained with diminishing returns as the number of sensors is increased, 2) the number of samples has very little effect and 3) it shows very little gain for correlated channels.
Wed. SS. 2.4 11:45‐12:00
Low complexity bandwidth compression mappings for sensor networks
Kimmo Kansanen1, Anna Kim1, Ragnar Thobaben2 and Johannes Karlsson2
1Institute of Electronics and Telecommunications, Norwegian University of Science and Technology, Norway; 2School of Electrical Engineering and ACCESS Linnaeus Center Royal Institute of Technology Stockholm, Sweden
Abstract—Compressive (2 : 1) joint source‐channel coding using direct mappings from source to channel symbol space is considered. To enable the use of prior information due to e.g. correlated samples at the receiver, or statistical knowledge of the source, minimum mean square error decoding is considered. The prior information is incorporated in the form of the apriori distribution in the decoding. Four mapping methods are presented and evaluated using the generic Bayesian minimum mean square error estimator. The schemes are evaluated for transmitting a memoryless Gaussian source over additive white Gaussian noise channel with a quadratic distortion measure. The simplicity of implementation and applicability to a wider variety of sources is discussed.
48
Wednesday Morning, 3rd March
Session: Special Session on Spectrum Sensing for Cognitive Radios
Time & Place: 11:00‐12:15 ‐ Daphne
Chairperson: Visa Koivunen
Aalto University, Department of Signal Processing and Acoustics, Finland
Wed. SS. 2.1 11:00‐11:15
On Signal Detection Techniques for the DVB‐T Standard
Danyo Danev
Department of Electrical Engineering (ISY), Linköping University, Linköping, Sweden
Abstract—In this paper we discuss some spectrum sensing techniques for detection of DVB‐T signals. Their performance is compared in terms of probability of detection and ROC curves. Some simulation results are presented for various scenarios.
Wed. SS. 2.2 11:15‐11:30
On the Implementation of Autocorrelation‐based Feature Detector
Kari Kokkinen1, Vesa Turunen1, Marko Kosunen1, Sachin Chaudhari2, Visa Koivunen2 and Jussi Ryynänen1
1Aalto University, Department of Micro‐ and Nanosciences; 2Aalto University, Department of Signal Processing and Acoustics, Finland
Abstract—Emerging wireless systems demand more spectrum in order to provide high data rate services. It is known that most of the licensed frequency bands are underutilized because of the rigid spectrum allocation. Cognitive radios aim to relief the situation by identifying and exploiting the underutilized radio spectrum. A key task of the cognitive radio is spectrum sensing, which finds free spectrum and detects licensed spectrum user transmissions. This paper presents an FPGA implementation of an autocorrelation‐based feature detector for OFDM‐based primary user signals. The autocorrelation‐based detection algorithm is optimized in order to achieve power and area efficient hardware realization. The algorithm is implemented in an FPGA evaluation environment, and the performance is verified with measurements.
� 47
magnitude‐only reconstructed speech, Hamming window results in better quality and intelligibility. LSEE has better performance than OAM in the case of magnitude‐only speech reconstruction while OAM outperforms LSEE in the case of phase‐only speech reconstruction. However, their differences are not very significant.
Wed. 1.6 12:15‐12:30
Improving the Noise‐Robustness of Mel‐Frequency Cepstral Coefficients for Speaker Verification
Masoud Geravanchizadeh and Amir Karimpour
1Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran
Abstract—In this paper, we study the noise‐robustness of Mel‐Frequency Cepstral Coefficients (MFCC) for speaker verification systems and explore ways to improve their performance in noisy conditions. Improvements are based on new construction of filter bank which decouples filter bandwidth from the other filter bank parameters by employing the known relationship between filter center frequency and critical bandwidth of the human auditory system. The proposed method which incorporates human factor cepstral coefficients (HFCC) is shown to outperform the traditional front‐end processing technique (i.e., MFCCs) in automatic speaker verification experiments.
46
Wed. 1.3 11:30‐11:45
Modulation Spectral Features for Objective Voice Quality Assessment
Maria Markaki and Yannis Stylianou
Computer Science Dept, University of Crete, Greece
Abstract—In this paper, we employ normalized modulation spectral features for objective voice quality assessment regarding grade (hoarseness). Modulation spectra usually produce a high‐dimensionality space. For classification purposes, the size of the original space is reduced using Higher Order Singular Value Decomposition (SVD). Further, we select most relevant features based on the mutual information between subjective voice quality (the degree of hoarseness) and the computed features, which leads to an adaptive to the classification task modulation spectral representation. The adaptive modulation spectral features are used as input to a Naive Bayes (NB) classifier. By combining two NB classifiers based on different feature sets a global classification rate of 73.93% for hoarseness was achieved.
Wed. 1.4 11:45‐12:00
Audio encoding using Huang and Hilbert transforms
K. Khaldi1,2,4, A.O. Boudraa2, B. Torrésani3, Th. Chonavel4 and M. Turki1
1Unité Signaux et Systèmes, ENIT, Tunis, Tunisia; 2IRENav, Ecole Navale, BCRM Brest, France; 3Université de Provence, Marseille, France; 4Institut Télécom; Télécom Bretagne, Brest Cedex, France
Abstract—In this paper an audio coding scheme based on the Empirical Mode Decomposition (EMD) in association with the Hilbert transform is presented. The audio signal is decomposed adaptively into intrinsic oscillatory components called Intrinsic Mode Functions (IMFs) by EMD, and the associated instantaneous amplitudes and the instantaneous phases are calculated. The basic principle of the proposed approach consists in encoding the instantaneous amplitudes by linear prediction and the instantaneous phases by scalar quantization. The decoder recovers the original signal from IMFs reconstruction by demodulation and summation. The compression method is applied to different audio signals, and results are compared to MP3 and to wavelet approaches.
Wed. 1.5 12:00‐12:15
Objective Evaluation of Magnitude and Phase Only Spectrum‐based Reconstruction of the Speech Signal
Erfan Loveimi and Seyed Mohammad Ahadi
Speech Processing Research Laboratory, Electrical Engineering Department, Amirkabir University of Technology, Tehran, Iran
Abstract—The aim of this paper is to investigate the effects of window shape and its length on the quality of phase‐only and magnitude‐only reconstructed speech. Speech signal is reconstructed via LSEE and OAM from its magnitude‐only and phase‐only spectra. The effects of using Hamming and Rectangular windows have been studied, too. To evaluate the quality of reconstructed speech, we employed three objective measures: LLR, WSS and PESQ. Results show that in the case of using Hamming window, phase‐only reconstructed speech surpasses its magnitude‐only counterpart in frames longer than 256 ms qualitatively. Rectangular window seems to be a better choice in comparison to Hamming window in the case of phase‐only signal reconstruction, while for
� 45
Wednesday Morning, 3rd March
Session: Audio and Speech I
Time & Place: 11:00‐12:30 ‐ Bacchus Ballroom
Chairperson: Seyed Mohammad Ahadi Sarkani Amirkabir University of Technology, Iran
Wed. 1.1 11:00‐11:15
Sound Classification based on Temporal Feature Integration
Stavros Ntalampiras1, Ilyas Potamitis2 and Nikos Fakotakis1
1Electrical and Computer Engineering Department, University of Patras, Greece;
2Technological
Educational Institute of Crete, Department of Music Technology and Acoustics, Greece
Abstract—The present work contributes to the field of generalized sound classification. We extensively examine the performance of the next three feature sets: a) MPEG‐7 Audio Spectrum Projection, b) MFCC (using an alternative method for their extraction) and c) a group derived utilizing critical band based wavelet packets. Subsequently three types of temporal feature integration strategies are applied on the extracted instant values: a) short‐term statistics, b) spectral moments and c) two autoregressive functions. During the experimental phase, we organize ten sound classes using professional sound effects collections of high quality. The density of each category is approximated with left‐right hidden Markov models. Comparable results with respect to all the feature sets as well as integration methods are provided, which demonstrate the superiority of the short‐term statistics method.
Wed. 1.2 11:15‐11:30
Footprint Reduction of Concatenative Text‐To‐Speech Synthesizers using Polynomial Temporal Decomposition
Tamar Shoham1, David Malah1 and Slava Shechtman2
1Department of Electrical Engineering, Technion‐ Israel Institute of Technology; 2IBM Haifa Research Labs
Abstract—High quality low footprint Concatenative Text‐To‐ Speech (CTTS) synthesizers provide a persistent challenge in the field of speech processing. The spectral parameters representing the short speech segments used in the concatenation process constitute a large portion of the required memory. In this paper we propose to use a vectorial form of Polynomial Temporal Decomposition combined with jointly optimal segmentation and polynomial order selection in order to reduce the storage required for the spectral amplitude parameters by 50%, while preserving the perceptual quality of the obtained synthesized speech.
44
Wednesday Morning, March 3rd
Session: Keynote Wed.1
Time & Place: 8:30‐9:30 ‐ Bacchus Ballroom
Chairperson: Sanjit K. Mitra University of Southern California, USA
8:30 Technology Evolution and Societal Development: Does One Model Serve Both? Andrew J. Viterbi University of Southern California and Viterbi Group, San Diego, CA, USA
ABSTRACT ‐ A.A. Markov proposed and developed a statistical concept which suggests that future action should depend only on the current state of the system or process. Exploitation of the statistical properties of Markov processes has produced notable results in two important areas of digital signal processing: optimum linear filtering (Kalman), with principal applications to navigation, tracking, orbit determination and even economics; and finite‐state sequence determination (Viterbi), with applications to digital communication, voice and optical character recognition, data recording and DNA sequence analysis, among others. Both areas will be discussed and compared, as well as the merits of any societal implications of the Markov concept.
Session: Keynote Wed.2
Time & Place: 9:30‐10:30 ‐ Bacchus Ballroom
Chairperson: Sanjit K. Mitra University of Southern California, USA
9:30 Modeling Interconnected Systems Jan C. Willems Guest Profesor, K.U. Leuven, Belgium ABSTRACT ‐ In Systems Theory, it is customary to view a system in terms of inputs and outputs, and interconnection as output‐to‐input assignment as in series connection and feedback. However, input/output thinking is not suitable for physical systems. The aim of this lecture is to explain the behavioral approach to dynamical systems as an alternative. In this setting, a system is defined as simply a family of trajectories. Modeling interconnected systems by tearing, zooming, and linking will be discussed. Linking, the basis of interconnection, means sharing variables. The question emerges how energy is transferred between systems, and leads to the distinction between ports and terminals. Terminals are for interconnection, ports are for energy transfer. The development will be illustrated by electrical circuits and mechanical systems.
� 43
Abstracts
42
Friday Afternoon, 5th March
Session: DSP for Communications
Time & Place: 17:00‐18:30 ‐ Salaminia
Chairperson: Takis Kasparis Cyprus University of Technology, Cyprus Fr. 35.1 17:00‐17:15 Asexual Reproduction‐Based Adaptive Quantum Particle Swarm Optimization Algorithm for Dual‐Channel Speech Enhancement Masoud Geravanchizadeh and Laleh Badri Asl Faculty of Electrical and Computer, Engineering, University of Tabriz, Tabriz, Iran Fr. 35.2 17:15‐17:30 Variational Bayesian Blind and Semiblind Channel Estimation Samir‐Mohamad Omar and Dirk Slock EURECOM, Sophia Antipolis, France Fr. 35.3 17:30‐17:45 A Block Adaptive Predistortion Algorithm for Transceivers with Long Transmit‐Receive Latency Robert Santucci and Andreas Spanias Sensor and Signal Information Processing Center, School of Electrical, Computer, and Energy Engineering, Arizona State University Tempe, USA Fr. 35.4 17:45‐18:00 A Set‐Membership Mixed‐Tone Binormalised LMS‐based Per‐Tone DMT Equalisation Suchada Sitjongsataporn and Peerapol Yuvapoositanon Centre of Electronic Systems Design and Signal Processing (CESdSP), Department of Electronic Engineering, Mahanakorn University of Technology, Bangkok, Thailand
�
� 41
Friday Afternoon, 5th March
Session: Special Session on Intelligent Feedback Systems
Time & Place: 17:00‐18:30 ‐ Amathousia
Chairperson: Petros Ioannou ECE Department, University of Cyprus, Nicosia, Cyprus Fr. 34.1 17:00‐17:15 Capacity for MIMO Systems at Low SNR Ioanna Ioannou1, Charalambos Charalambous1 and Stojan Denic2 1Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus; 2Toshiba, Bristol, England Fr. 34.2 17:15‐17:30 Optimal Control Systems with Prescribed Eigenvalues Vladimir Kucera and Jiri Cigler Czech Technical University in Prague, Faculty of Electrical Engineering, Prague, Czech Republic Fr. 34.3 17:30‐17:45 Evaluation of Identifier based and Non‐identifier based Adaptive Supervisory Control using a Benchmark Example Simone Baldi1, Petros Ioannou2 and Edoardo Mosca1 1Dipartimento Sistemi e Informatica, Universit`a di Firenze, Firenze, Italy; 2Department of Electrical Engineering and Information Technology, Cyprus University of Technology, Lemesos Fr. 34.4 17:45‐18:00 Adaptive identification of Fuzzy Cognitive Networks Haris Psillakis1, Yannis Boutalis2, Thomas Giotis3 and Manolis Christodoulou4,5 1Department of Electrical Engineering, Technological & Educational Institute of Crete, Heraklion, Greece;
2Department of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi,
Greece and with the University of Erlangen‐Nurember, Germany; 3Department of Electronic &
Computer Engineering, Technical University of Crete, Chania, Crete, Greece; 4Faculty of Electronic &
Computer Engineering, Technical University of Crete, Chania, Crete, Greece; 5Dipartimento di Automatica et Informatica, Politecnico di Torino, Torino, Italia Fr. 34.5 18:00‐18:15 Measure‐of‐disagreement of consensus and adaptive‐consensus filters for spatially distributed systems Michael A. Demetriou Worcester Polytechnic Institute, Department of Mechanical Engineering, Worcester, MA, USA Fr. 34.6 18:15‐18:30 Distributed Fault Detection and Accommodation with Partial Communication Panagiotis Panagi and Marios M. Polycarpou KIOS Research Center for Intelligent Systems and Networks, Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus
40
Friday Afternoon, 5th March
Session: Estimation
Time & Place: 17:00‐18:30 ‐ Daphne
Chairperson: Aníbal Ferreira University of Porto, FEUP‐DEEC, Portugal
Fr. 33.1 17:00‐17:15 Cramer‐Rao bounds for rate‐constrained distributed time‐delay estimation Sriram Srinivasan Digital Signal Processing Group, Philips Research Laboratories, Eindhoven, The Netherlands Fr. 33.2 17:15‐17:30 Influence of the Noise on the Amplitude Estimation of a Sine‐Wave by the Three‐Point Interpolated DFT Method Daniel Belega1 and Dominique Dallet2 1Faculty of Electronics and Telecommunications, University “Politehnica” of Timisoara, Timisoara, Romania; 2IMS Laboratory, University of Bordeaux –IPB ENSEIRB MATMECA, Talence Cedex, France Fr. 33.3 17:30‐17:45 Multi‐Sensor Diversity in Decentralized Estimation Alex Leong and Subhrakanti Dey ARC Special Research Centre for Ultra‐Broadband Information Networks (CUBIN), Department of Electrical and Electronic Engineering, University of Melbourne, Victoria, Australia Fr. 33.4 17:45‐18:00 DFT‐based frequency estimation under harmonic interference Aníbal Ferreira and Ricardo Sousa University of Porto, FEUP‐DEEC, Portugal Fr. 33.5 18:00‐18:15 Estimation of Vehicle Roll Angle Ansgar Rehm University of Applied Sciences Osnabrück, Osnabrück, Germany Fr. 33.6 18:15‐18:30 A novel low‐complex and low‐memory method for accurate single‐tone frequency estimation Giuseppe Campobello, Cannatà Gianluca, Nicola Donato, Antonio Famulari and Salvatore Serrano. Dept. of Matter Physics and Electronic Engineering, University of Messina, Italy
� 39
Friday Afternoon, 5th March
Session: Wireless Systems
Time & Place: 17:00‐18:30 ‐ Bacchus Ballroom
Chairperson: Yimin Zhang Villanova University, PA, USA
Fr. 32.1 17:00‐17:15 Mobile Terminal Location Estimation Using Support Vector Machines David Xuereb and Carl James Debono Department of Communications and Computer, Engineering, University of Malta, Msida, MSD 2080, Malta Fr. 32.2 17:15‐17:30 Analysing GOP Structure and Packet Loss Effects on Error Propagation in MPEG–4 Video Streams Arpad Huszak and Sandor Imre Budapest University of Technology and Economics, Department of Telecommunications , Budapest, Hungary Fr. 32.3 17:30‐17:45 Balancing the Utilization of Mobile Sensor Nodes through Genetic‐based Clustering Carl James Debono1 and Patrick Cauchi2 1Department of Communications and Computer, Engineering, University of Malta, Msida, MSD 2080, Malta; 2Melita plc, Mriehel Bypass, Mriehel, Malta Fr. 32.4 17:45‐18:00 On the Physical Layer Performance of the Release 8 E‐UTRA Downlink Zijian Bai1, Christoph Spiegel1, Christian Drewes2, Jens Berkmann2, Michael Horvat2, Bertram Gunzelmann2, Tobias Scholand2, Guido H. Bruck2 and Peter Jung1 1Lehrstuhl für Kommunikationstechnik, Universität Duisburg‐Essen, Duisburg, Germany; 2Infineon Technologies AG, Germany Fr. 32.5 18:00‐18:15 A Comparison of DSP, ASIC and RISC DSP Based Implementations of Multiple Access in LTE Hari Krishna Boyapati1 and Raja Kumar Ratnam Varada2 1G S Sanyal School of Telecommunications, Indian Institute of Technology Kharagpur, Kharagpur, India; 2Department of E & E C E, Indian Institute of Technology Kharagpur, Kharagpur, India Fr. 32.6 18:15‐18:30
Invited Paper Outer‐Loop Power Control in a Live UMTS Network: Measurement, Analysis and Improvements Markus Laner, Philipp Svoboda and Markus Rupp Institute of Communications and Radio‐Frequency Engineering, Vienna University of Technology, Gusshausstrasse 25/389, A‐1040 Vienna, Austria
38
Friday Afternoon, 5th March
Session: Special Session on Advances in DSP
Time & Place: 15:00‐16:30 ‐ Salaminia
Chairperson: Andreas Spanias SenSIP and CSSER Centers, School of ECEE, Arizona State University, Tempe, USA
Fr. SS. 31.1 15:00‐15:15 Minimax Rate Distortion for a Class of Sources Farzad Rezaei1, Photios Stavrou2, Charalambos Charalambous2 and Christos Kourtellaris2 1University of Ottawa; 2University of Cyprus Fr. SS. 31.2 15:15‐15:30 Design of Nearly Linear‐Phase Recursive Digital Filters by Using Unconstrained Least‐pth Minimax Optimization Andreas Antoniou, Sunil Belur Nagaraj and Rajeev Nongpiur Department of Electrical and Computer Engineering, University of Victoria, Victoria, Canada Fr. SS. 31.3 15:30‐15:45 Bayesian estimation of dynamic systems function expansions Georgios Mitsis1 and Saad Jbabdi2 1Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus; 2Centre for Functional Magnetic Resonance Imaging of the Brain, University of Oxford, United Kingdom Fr. SS. 31.4 15:45‐16:00 Dynamic Range Extension Using Multiple A/D Converters Lakis Christodoulou1, John Lane2 and Takis Kasparis1 1Cyprus University of Technology, Cyprus; 2University of Central Florida, USA Fr. SS. 31.5 16:00‐16:15 Signal Processing for Biologically Inspired Sensors P. Sattigeri, J. J. Thiagarajan, K. N. Ramamurthy, B. Konnanath, T. Mathew, A. Spanias, M. Goryll, T. Thornton, S. Prasad and S. Phillips SenSIP and CSSER Centers, School of ECEE, Arizona State University, Tempe, USA Fr. SS. 31.6 16:15‐16:30 Segmentation of Macroscopic Slice Images for Colorectal Cancer Evaluation Styliani Petroudi1 and Michael Brady2 1University of Cyprus, Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus. 2Wolfson Medical Vision Lab, Department of Engineering Science, University of Oxford, UK Coffee Break 16:30‐17:00
� 37
Friday Morning, 5th March
Session: Systems and Control II
Time & Place: 15:00‐16:30 ‐ Amathousia
Chairperson: Peter Bauer Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA
Fr. 30.1 15:00‐15:15 Control and Estimation of Downhole Pressure in Managed Pressure Drilling Operations Jing Zhou and Gerhard Nygard Petroleum Department, International Research Institute of Stavanger, Bergen, Norway Fr. 30.2 15:15‐15:30 A New Adaptive Control of a Double‐electromagnet Suspension System R. Barzamini1, H. A. Talebi1, A. R. Yazdizadeh2 and H. Eliasi1 1Faculty of Electrical Engineering, Amirkabir University of Technology, Tehran, Iran; 2Faculty of Electrical Engineering, Power and Water University of Technology, Tehran, Iran Fr. 30.3 15:30‐15:45 A Robust Predictive Controller Based on GOBF Modelling and LMIs Technique for a MIMO System Jalel Ghabi1, Ali Douik1 and Hassani Messaoud1,2 1Laboratory ATSI “Automatique Traitement de Signal et Imagerie” in the National School of Engineers of Monastir‐Tunisia; 2National School of Engineers of Monastir‐Tunisia; Fr. 30.4 15:45‐16:00 An Auto‐Zeroing Current‐Starved Floating‐Gate Band Pass Filter Mehdi Azadmehr and Yngvar Berg Vestfold University College, Institute of Microsystem Technology, Horten, Norway Fr. 30.5 16:00‐16:15 On the Non‐negative Impulse Response of Continuous‐Time Multi‐Dimensional Systems Yuzhe Liu and Peter Bauer Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA Fr. 30.6 16:15‐16:30 Modeling of an Impact Transducer for In Situ Adaptive Disdrometer Calibration Takis Kasparis1 and John Lane2 1Cyprus University of Technology, Cyprus; 2University of Central Florida, USA; Coffee Break 16:30‐17:00
36
Friday Afternoon, 5th March
Session: Synchronization and Equalization
Time & Place: 15:00‐16:30 ‐ Daphne
Chairperson: Hidekazu Taoka Access Network Development Department, NTT DOCOMO, Kanagawa, Japan Fr. 29.1 15:00‐15:15 MMSE Timing Recovery using Multi‐Channel Early‐Late Gates for Analog Multi‐Tone System Tsutomu Takeya and Tadahiro Kuroda Department of Electronics and Electrical Engineering, Keio University, Yokohama, Japan Fr. 29.2 15:15‐15:30 Efficient Phase Noise Modelling of a PLL‐Based Frequency Synthesizer Goulven Eynard , Noëlle Lewis and Dominique Dallet IMS‐Bordeaux 1 University, France Fr. 29.3 15:30‐15:45 A Constrained Constant Modulus Algorithm Based on Uniform Linear Arrays Lei Zhang , Wei Liu and Richard Langley Communications Research Group, Department of Electronic and Electrical Engineering, University of Sheffield, UK Fr. 29.4 15:45‐16:00 Frame Synchronization among Base Stations for TDD Systems Tetsuei Wada , Takao Hara and Minoru Okada Graduate School of Information Science, Nara Institute of Science and Technology, Nara, Japan Fr. 29.5 16:00‐16:15 Sigma‐Delta Modulation Technique for Low Noise Fractional‐N Frequency Synthesizer Nahid Fatahi and Hooman Nabovati Department of Electrical Engineering, Sadjad University, Mashhad, Iran Coffee Break 16:30‐17:00
� 35
Friday Afternoon, 5th March
Session: Special Session on Cooperative Methods in Wireless Networks
Time & Place: 15:00‐16:30 ‐ Daphne
Chairpersons: Petros Elia and Dirk Slock EURECOM, Mobile Communication Department, Sophia Antipolis, France Fr. SS. 28.1 15:00‐15:15 Relay Selection for Joint Resource Allocation in Cooperative Multiflow Wireless Networks Gareth Middleton, Behnaam Aazhang Rice University Houston, Texas, USA Fr. SS. 28.2 15:15‐15:30 Implicit cooperation in distributed energy‐efficient networks" M. Le Treust, S. Lasaulce and M. Debbah Affiliation [missing] Fr. SS. 28.3 15:30‐15:45 Cooperative Relaying in Car‐to‐Car Communications: Initial Results from an Experimental Study Günther Brandner1, Udo Schilcher1, Christian Bettstetter2 1University of Klagenfurt, Mobile Systems Group, Institute of Networked and Embedded Systems, Austria; 2Lakeside Labs GmbH, Klagenfurt, Austria Fr. SS. 28.4 15:45‐16:00 Sum‐rate Optimized Power Allocation for the OFDM Multiple Access Relay Channel Mohieddine El Soussi, Abdellatif Zaidi, Jérôme Louveaux and Luc Vandendorpe. Communications and Remote Sensing Laboratory, Louvain School of Engineering, Louvain‐la‐Neuve, Belgium Fr. SS. 28.5 16:00‐16:15 Partner Selection in Cooperative Networks: Efficiency vs Fairness in Ricean Fading Channels" Paolo Castiglione1, Stefano Savazzi2, Monica Nicoli2 and Gerald Matz3 1Telecommunication Research Center Vienna Vienna, Austria; 2Dip. di Elettronica e Informazione, Politecnico di Milano, Milano, Italy; 3INTHFT, Vienna University of Technology, Vienna, Austria Fr. SS. 28.6 16:15‐16:30 Opportunistic Routing with Congestion Diversity and Tunable Overhead Mohammad Naghshvar and Tara Javidi Department of Electrical and Computer Engineering, University of California San Diego, CA, USA Coffee Break 16:30‐17:00
34
Friday Afternoon, 5th March
Session: DSP Implementation and Time‐frequency Analysis
Time & Place: 13:30‐15:00 ‐ Salaminia
Chairperson: Charis Theeocharides University of Cyprus, Cyprus Fr. 27.1 13:30‐13:45 Dimensional characterization of an elastic tube using the spectrogram and the reassigned spectrogram time‐frequency analysis Latif Rachid1, Aassif Elhoucein2, Laaboubi Mostafa2 and Maze Gerard3 1ESSI, ENSA, Université Ibn Zohr, Agadir, Maroc; 2LMTI,Université Ibn Zohr, Agadir, Maroc; 3LOMC, Laboratoire des Ondes et Milieux Complexes, Le Havre, France Fr. 27.2 13:45‐14:00 Asynchronous ADC with Configurable Resolution and Binary Tree Structure Nikos Petrellis1, Michael Birbas1, John Kikidis1 and Alex Birbas2 1Analogies SA, Patras Science Park, Platani‐Rio, 26504, Patras, GREECE; 2University of Patras, Patras, Greece Fr. 27.3 14:00‐14:15 Efficient Processing of JPEG2000 Imagery Eric Balster and William Turri Dept. of Electrical and Computer Engineering, University of Dayton, Kettering Laboratory, Dayton, OH, USA Fr. 27.4 14:15‐14:30 A combined Teager‐Huang and Hough Transforms for LFM Signals Detection Jean‐Christophe Cexus
1, Abdel‐Ouahab Boudraa
1,2 and Abdelkhalek Bouchikhi
1,2
1ENSIETA Brest, France; 2Ecole Navale Brest, France Fr. 27.5 14:30‐14:45 Non‐iterative frequency estimation in the DFT magnitude domain Ricardo Sousa and Aníbal Ferreira University of Porto, FEUP‐DEEC, Portugal Fr. 27.6 14:45‐15:00 Fast Method to Detect Specific Frequencies in Monitored Signal Marwan Jaber and Daniel Massicotte Université du Québec à Trois‐Rivières, Electrical and Computer Engineering Department, Laboratory of Signal and System Integration, Canada Coffee Break 16:30‐17:00
� 33
Friday Afternoon, 5th March
Session: Special Session on Quantum Control II
Time & Place: 13:30‐15:00 ‐ Amathousia
Chairpersons: Edmond A. Jonckheere Department of Electrical Engineering and Mathematics, University of
Southern California, Los Angeles, CA, USA
Alireza Shabani Princeton University, Chemistry Department, Princeton, NJ, USA
Sophie Schirmer Department of Applied Mathematics and Theoretical Physics University
of Cambridge, Cambridge, UK
Fr. SS. 26.1 13:30‐13:50 Back and forth nudging for quantum state reconstruction Ashley Donovan1, Mazyar Mirrahimi2, Pierre Rouchon3 1Department of Chemistry, Princeton University, Princeton; 2INRIA Paris‐Rocquencourt, France; 3Centre Automatique et Systèmes, France Fr. SS. 26.2 13:50‐14:10 Pure State Stabilization with Discrete‐Time Quantum Feedback Saverio Bolognani and Francesco Ticozzi Dipartimento di Ingegneria dell’Informazione, Universit`a di Padova, Italy Fr. SS. 26.3 14:10‐14:30 Quantum System Identification: Hamiltonian Estimation using Spectral and Bayesian Analysis Sophie G Schirmer1, Frank C Langbeiny2 1Department of Applied Maths & Theoretical Physics, Univ. of Cambridge, UK; 2School of Computer Science, Cardiff University, UK Fr. SS. 26.4 14:30‐15:00 Round table discussion on outstanding quantum and other control problems Coffee Break 16:30‐17:00
32
Friday Afternoon, 5th March
Session: Receiver Design
Time & Place: 13:30‐15:00 ‐ Daphne
Chairperson: Carl James Debono Department of Communications and Computer, Engineering, University of Malta, Msida, Malta
Fr. 25.1 13:30‐13:45 Paths Complex Gain Tracking Algorithms for OFDM Receiver in Slowly‐Varying Channels Laurent Ros1, Hussein Hijazi2 and Eric Pierre Simons2 1GIPSA‐lab, Image and Signal Department, France; 2IEMN lab, TELICE group, IEMN/UMR, France Fr. 25.2 13:45‐14:00 Multi Pulse Position Amplitude Modulation for ultra‐high speed Time‐Hopping UWB communication systems over AWGN channel Marijan Herceg , Drago Žagar and Dario Galić Faculty of Electrical Engineering, Osijek, Croatia Fr. 25.3 14:00‐14:15 A DVB‐T2 Receiver Realization based on a Software‐Defined Radio Concept Christian Kocks1, Alexander Viessmann1, Andreas Waadt1, Christoph Spiegel1, Admir Burnic1, Guido Bruck1, Peter Jung1, Jaeyoel Kim2, YeonJu Lim2 and Hyeon Woo Lee2 1University of Duisburg‐Essen, Department of Communication Technologies, Duisburg, Germany; 2Samsung Electronics, Global Standards and Research Lab. Suwon, Korea Fr. 25.4 14:15‐14:30 Hardware Implementation of a Viterbi Decoder Using the Minimal Trellis Richard D Souza , Bruno U Pedroni and Volnei A Pedroni Federal Technological University of Paraná (UTFPR) – Curitiba – PR – Brazil Fr. 25.5 14:30‐14:45 Stochastic Characterization of Amplified Photons in Lightwave Systems with Optically Bistable Elements Hooman Abediasl , Ali Naqavi , Khashayar Mehrany and Jawad Salehi Optical Network Research Laboratory (ONRL), School of Electrical Engineering, Sharif University of Technology, Tehran, Iran Coffee Break 16:30‐17:00
� 31
Friday Morning, 5th March
Session: Signal and Image Processing
Time & Place: 11:00‐12:30 ‐ Salaminia
Chairperson: Akira Taguchi Tokyo City University, Tokyo, Japan
Fr. 24.1 11:00‐11:15 Optimal steering vector adaptation for linear filters leading to robust beamforming Michal Natora1, Felix Franke2, Simon Broda3 and Klaus Obermayer1 1Institute for Software Engineering and Theoretical Computer Science, Berlin Institute of Technology, Berlin, Germany; 2Bernstein Center for Computational Neuroscience, Berlin, Germany; 3Department of Quantitative Economics, University of Amsterdam, Amsterdam, The Netherlands Fr. 24.2 11:15‐11:30 Reconstruction of Streams of Diracs Based on the State Space Method Aitor Erdozain and Pedro Crespo CEIT and TECNUN (Universidad de Navarra), San Sebastián, Spain Fr. 24.3 11:30‐11:45 Spatial Weighted Averaging for ERP Denoising in EEG Data Andriy Ivannikov , Tommi Kärkkäinen , Tapani Ristaniemi and Heikki Lyytinen Finland University of Jyväskylä, Finland Fr. 24.4 11:45‐12:00 An Improved Solution to the Subband Blind Source Separation Permutation Problem Based on Optimized Filter Banks Bo Peng1, Wei Liu1 and Danilo P Mandic2 1Communications Research Group, Department of Electronic and Electrical Engineering, University of Sheffield, UK;
2Communications and Signal Processing Research Group, Department of Electrical and
Electronic Engineering, Imperial College London, UK Fr. 24.5 12:00‐12:15 Blind Beamforming for Multi‐path Wideband Signals Based on Frequency Invariant Transformation Wei Liu Department of Electronic and Electrical Engineering, University of Shefield, Shefield, UK
Fr. 24.6 12:15‐12:30 Blind Equalization Using Digital Watermarking Muhammad Kashif Samee and Jürgen Götze Information Processing Lab, Dortmund University of Technology, Dortmund, Germany Lunch 12:30‐13:30
30
Friday Morning, 5th March
Session: Special Session on Quantum Control I
Time & Place: 11:00‐12:30 ‐ Amathousia
Chairpersons: Edmond A. Jonckheere Department of Electrical Engineering and Mathematics, University of
Southern California, Los Angeles, CA, USA Alireza Shabani Princeton University, Chemistry Department, Princeton, NJ, USA
Sophie Schirmer
Department of Applied Mathematics and Theoretical Physics University of Cambridge, Cambridge, UK
Fr. SS. 23.1 11:00‐11:20
Invited Paper Level Sets of Quantum Control Landscapes Vincent Beltrani1, Jason Dominy2, Tak‐San Ho3 and Herschel Rabitz4 1Department of Chemistry, Princeton University; 2Program in Applied and Computational Mathematics, Princeton University; 3Department of Chemistry,Princeton University; 4Department of Chemistry, Princeton University Fr. SS. 23.2 11:20‐11:40
Invited Paper Symmetry Principles in Quantum System Theory of Multi‐Qubit Systems Made Simple Thomas Schulte‐Herbrüggen, Uwe Sander, Robert Zeier Dept. Chemistry, Technical University Munich (TUM), 85747 Garching Fr. SS. 23.3 11:40‐12:00 Open‐Loop Control Design via Parametrization Applied in a Two‐Level Quantum System Model Markku Nihtilä Department of Physics and Mathematics, University of Eastern Finland, Kuopio, Finland Fr. SS. 23.4 12:00‐12:20 Control‐assisted decoherence‐free manifolds E. Jonckheere1, A. Shabani2, A. T. Rezakhani3 1Department of Electrical Engineering, University of Southern California, Los Angeles; 2Department of Chemistry Princeton University Princeton; 3Department of Chemistry, University of Southern California, Los Angeles
� 29
Friday Morning, 5th March
Session: Special Session on MIMO Radar
Time & Place: 11:00‐12:30 ‐ Daphne
Chairperson: H. Vincent Poor Princeton University, USA Fr. SS. 22.1 11:00‐11:15 Diversity Gain for MIMO Radar Employing NonOrthogonal Waveforms Qian He1 and Rick Blum2 1EE Department, University of Electronic Science and Technology of China, , Sichuan China; 2ECE Department, Lehigh Universit, USA Fr. SS. 22.2 11:15‐11:30 MIMO Radar Target Detection with Parametric Scattering Correlation Model Tuomas Aittomäki and Visa Koivunen Department of Signal Processing and Acoustics, SMARAD CoE Aalto University, Finland Fr. SS. 22.3 11:30‐11:45 Transmit Policies for MIMO Radar Detection and Time‐Delay Estimation Guido Jajamovich
1, Marco Lops
2 and Xiaodong Wang
1
1Electrical Engineering Department, Columbia University, New York, NY, USA; 2ENSEEIHT/IRIT/INPT Toulouse ‐ France & DAEIMI, Universit`a degli, Studi di Cassino, Cassino (FR) ‐ ITALY Fr. SS. 22.4 11:45‐12:00 Localization Performance of Coherent MIMO Radar Systems Subject to Phase Synchronization Errors Hana Godrich, Alexander Haimovich New Jersey Institute of Technology, Newark, NJ, USA Fr. SS. 22.5 12:00‐12:15 Range Estimation for MIMO Step‐Frequency Radar with Compressive Sensing Yao Yu1, Athina Petropulu1 and Vincent Poor2 1Electrical & Computer Engineering Department, Drexel University, USA; 2School of Engineering and Applied Science, Princeton University, USA Lunch 12:30‐13:30
28
Friday Morning, 5th March Session: Wireless Networks
Time & Place: 11:00‐12:30 ‐ Bacchus Ballroom
Chairperson: Costas N. Georghiades Texas A&M University, Texas, USA
Fr. 21.1 11:00‐11:15 Joint Source and Relay Power Optimization in Multiuser Cooperative Wireless Networks Ying Jin and Yimin Zhang Center for Advanced Communications, Villanova University, USA Fr. 21.2 11:15‐11:30 Outage Regions of Cooperative Networks for different Coding Schemes Tobias Renk, Holger Jaekel and Friedrich K Jondral Communications Engineering Lab (CEL), Karlsruhe Institute of Technology (KIT) Fr. 21.3 11:30‐11:45 A Novel Sense‐Transmit‐Wait Strategy for Coexistence of Cognitive Radio Networks with IEEE 802 11 WLANs Yingxi Liu, Nikhil Kundargi and Ahmed Tewfik University of Minnesota, Twin Cities, Minneapolis, Minnesota Fr. 21.4 11:45‐12:00 Cost‐sharing for Cooperative Relay Cognitive Radio Networks Shabnam Sodagari and Sven Bilen Dept. of Electrical Engineering, The Pennsylvania State University, PA, USA Fr. 21.5 12:00‐12:15 Energy aware Routing in Location based Ad‐hoc Networks Jangsu Lee, Seunghwan Yoo, Yongjun Lee and Sungchun Lee University of Sogang, Republic of Korea Lunch 12:30‐13:30
� 27
Friday Morning, March 5th Session: Keynote Fr. 1 & 2 Time & Place: 8:30‐9:30 ‐ Bacchus Ballroom Chairperson: Anthony G. Constantinides Imperial College, UK
Keynote Fr. 1 8:30‐9:30 Big Rooms to small boxes back to big Rooms Gene A. Frantz TI Principal Fellow, TI Futurist, Texas Instruments Incorporated, USA
Keynote Fr. 2 9:30‐10:30 Traffic Pattern Analysis and Load Balancing in Negatively Curved Networks Edmond Jonckheere University of Southern California, USA Coffee Break 10:30‐11:00
26
Thursday Afternoon, 4th March
Session: Special Session on Multi‐Media Processing over Wireless Communications
Time & Place: 17:00‐18:30 ‐ Salaminia
Chairperson: Yoshikazu Miyanaga Science and Technology Hokkaido University, Sapporo, Japan
Th. SS. 20.1 17:00‐17:15 Rate‐Distortion Development for Optimal Truncation in JPEG2000 Imagery Eric Balster , Benjamin Fortener and William Turri Department of Electrical and Computer Engineering, University of Dayton, Kettering Laboratory, Dayton, OH, USA Th. SS. 20.2 17:15‐17:30 Vector Quantization Based on a Binary Search‐like Algorithm Long‐Jhe Yan and Shaw‐Hwa Hwang Electrical Engineering, Department, National Taipei University of Technology, Taipei, Taiwan Th. SS. 20.3 17:30‐17:45
Invited Paper Content Similarity Based Early Skip Mode Decision for Low Power Surveillance Video Compression Xin Jin and Satoshi Goto 1Xin Jin is with the Information Technology Research Organization, Waseda University, Fukuoka, Japan 808‐0135; 2Graduate School of Information, Production and Systems, Waseda University, Fukuoka, Japan 808‐0135 Th. SS. 20.4 17:45‐18:00
Invited Paper Content‐based Interactive Image Retrieval from Java Enabled Mobile devices Iftikhar Ahmad1 and Moncef Gabbouj2 1Nokia Corporation, Tampere, Finland; 2Department of Signal Processing at Tampere University of Technology, Tampere, Finland Th. SS. 20.5 18:00‐18:15
Invited Paper Implementation of Simultaneous Video Decoding on Multicore Processor Yuki Kawamura1, Yasutake Manabe1, Takao Onoye1, Kazuto Ohhara2, Hiroyuki Okada2 and Ikuo Keshi2 1Graduate School of Information, Science and Technology, Osaka University, Osaka, Japan; 2Advanced Image and Telecommunication Laboratories, Corporate R & D Group, Sharp Corporation, Japan Th. SS. 20.6 18:15‐18:30
Invited Paper Modified Histogram Equalization for Image Contrast Enhancement Kota Murahira , Takashi Kawakami and Akira Taguchi Tokyo City University, Tokyo, Japan �
� 25
Thursday Afternoon, 5th March
Session: Systems and Control I
Time & Place: 17:00‐18:30 ‐ Amathousia
Chairperson: Vladimir Kucera Czech Technical University in Prague, Faculty of Electrical Engineering, Prague,
Czech Republic
Th. 19.1 17:00‐17:15 Delay‐Dependent H∞ Control of Linear Systems with input Delay Using Composite State‐Derivative Feedback Ala Shariati , Hamid Taghirad and Batool Labibi Advanced Robotics and Automated Systems (ARAS), Faculty of Electrical and Computer Engineering, K. N. Toosi University of Technology, Tehran, Iran Th. 19.2 17:15‐17:30 Optimum Immigration Policies Based on Linear Quadratic Theory Ioannis Tzortzis and Charalambos Charalambous Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus Th. 19.3 17:30‐17:45 Finite‐time stabilization of non affine systems A constructive method for polynomial systems Walid Ben Mabrouk1, Chakib Ben Njima1, Hassani Messaoud1 and Germain Garcia2,3 1Ecole nationale d’ingénieurs de Monastir, Monastir; 2CNRS Toulouse, France; 3Université de Toulouse, Toulouse, France Th. 19.4 17:45‐18:00 Open‐Loop Control Design via Parametrization Applied in a Two‐Level Quantum System Model Markku Nihtila Department of Physics and Mathematics, University of Eastern Finland, Kuopio, Finland Th. 19.5 18:00‐18:15 Adaptive PID Controller Design with Application to Nonlinear Water Level in NEKA Power Plant Alireza Yazdizadeh1, Arash Mehrafrooz1 and Roohollah Barzamini2 1Faculty of Electrical Engineering, Power and Water University of Technology, Tehran, Iran; 2Iran Power development company, Tehran, Iran Th. 19.6 18:15‐18:30
Invited Paper Self‐Adaptive Middleware for Building Context‐Aware Software for Public Transit Systems Asad M Madni, Hossein Rahnama and Alireza Sadeghian Ryerson University, Toronto, Canada
Coffee Break 16:30‐17:00
24
Thursday Afternoon, 4th March
Session: MIMO II
Time & Place: 17:00‐18:30 ‐ Daphne
Chairperson: Marco Lops ENSEEIHT/IRIT/INPT Toulouse ‐ France & DAEIMI, Universit`a degli, Studi di
Cassino, Cassino (FR), Italy Th. 18.1 17:00‐17:15 MIMO Channel Measurements Using an Experimental MIMO System Matthias Lieberei and Udo Zölzer Department of Signal Processing and Communications, Helmut‐Schmidt‐Universitä /University of the Federal Armed Forces, Hamburg, Germany Th. 18.2 17:15‐17:30 Lattice‐Reduction‐Aided K‐Best MIMO Detector based on the Channel Matrix Condition Number Sandra Roger , Alberto Gonzalez , Vicenc Almenar and Antonio M Vidal Institute of Telecommunications and Multimedia Applications (iTEAM), Universidad Politécnica de Valencia, Valencia, Spain Th. 18.3 17:30‐17:45 Performances of Beamforming Techniques Combined to Switching Algorithm in Multi‐User MIMO Systems Yosra Mlayeh , Fatma Rouissi , Fethi Tlili and Adel Ghazel CIRTACOM Laboratory, Ecole Supérieure des Communications de Tunis, Tunis, Tunisia Th. 18.4 17:45‐18:00 Channel Estimation for MIMO‐OFDM Systems in Fast Time‐Varying Environments Hussein Hijazi1, Eric Pierre Simon1, Martine Lienard1 and Laurent Ros2 1Laboratoire TELICE, U.S.T.L. Lille 1, France; 2GIPSA‐lab, Department Image Signal, France Th. 18.5 18:00‐18:15 Robust Broadband Beamforming Based on Frequency Invariance Constraints and Worst‐Case Performance Optimization Yong Zhao , Wei Liu and Langley Richard Communications Research Group, Department of Electronic and Electrical Engineering, University of Sheffield, UK Th. 18.6 18:15‐18:30 Receiver Diversity with Blind And Semi‐Blind FIR SIMO Channel Estimates Samir Omar1, Dirk Slock1 and Oussama Bazzi2 1Mobile Communications Department, Eurecom, Sophia Antipolis, France; 2Department of Physics and Electronics Faculty of Sciences I, Lebanese University Hadath, Beirut, Lebanon Bus leaves for Gala Dinner 19:30
� 23
Thursday Afternoon, 4th March Session: Special Session on Audio Signal Processing A.3 Sound Synthesis and Reproduction
Time & Place: 17:00‐18:30 ‐ Bacchus Ballroom
Chairperson: Rudolf Rabenstein University Erlangen‐Nuremberg, Erlangen, Germany Th. SS.17.1 17:00‐17:20 Physically Inspired Playable Models of Guitar, a Tutorial Gianpaolo Evangelista Digital Media, Linköping University, Norrköping, Sweden Th. SS. 17.2 17:20‐17:40 Wave Field Synthesis for Next Generation Videoconferencing Jose J Lopez , Maximo Cobos , Basilio Pueo and Emanuel Aguilera Institute for Telecommunications and Multimedia Applications, Universidad Politécnica de Valencia, Spain Th. SS. 17.3 17:40‐18:00 Controlling double dipole loudspeaker radiation by adapted input filtering Tobias Corbach , Martin Holters and Udo Zölzer Helmut‐Schmidt‐University, University of the Federal Armed Forces Hamburg, Germany Th. SS. 17.4 18:00‐18:20 Reproduction of Focused Sources by the Spectral Division Method Sascha Spors and Jens Ahrens Deutsche Telekom Laboratories, Technische Universität Berlin, Berlin, Germany Bus leaves for Gala Dinner 19:30
22
Thursday Afternoon, 4th March
Session: Image analysis II
Time & Place: 15:00‐16:30 ‐ Salaminia
Chairperson: Andreas Lanitis Department of Multimedia and Graphic Arts, Cyprus University of Technology, Lemesos, Cyprus
Th. 16.1 15:00‐15:15 Three Dimensional Bayesian State Estimation Using Shearlet EDGE Analysis and Detection David Schug and Glenn Easley University of Maryland, College Park, MD, USA Th. 16.2 15:15‐15:30 Effective Discriminant Feature Extraction Framework for Face Recognition Yan Yan and Yujin Zhang Department of Electronic Engineering, Tsinghua University, Beijing, China Th. 16.3 15:30‐15:45 Image Quality Measurement in the Frequency Domain Georgios Triantafyllidis Department of Applied Information Technology & Multimedia Technological Educational Institution of Crete, Heraklion, Crete, Greece Th. 16.4 15:45‐16:00 2D cross‐Psi_B‐energy operator for images analysis J.‐C. Cexus1, A.‐O. Boudraa1,2, A. Baussard1, F.H. Ardeyeh1 and E.H.S. Diop1,2 1ENSIETA / Brest, France; 2Ecole Navale, Brest, France Th. 16.5 16:00‐16:15 Where's Waldo? Human Figure Segmentation Using Saliency Maps Omri Soceanu1, Guy Berdugo1, Dmitry Rudoy1, Yair Moshe1 and Itsik Dvir2 1Technion ‐ Israel Institute of Technology, Haifa, Israel; 2Mate – Intelligent Video Th. 16.6 16:15‐16:30 Age Estimation Based on Head Movements: A Feasibility Study Andreas Lanitis Department of Multimedia and Graphic Arts, Cyprus University of Technology, Lemesos, Cyprus Coffee Break 16:30‐17:00
� 21
Thursday Afternoon, 4th March
Session: Identification and Estimation II
Time & Place: 15:00‐16:30 ‐ Amathousia
Chairpersons: Tara Javidi University of California San Diego, CA, USA
Marios M. Polycarpou University of Cyprus, Nicosia, Cyprus Th. 15.1 15:00‐15:15 Maximum Likelihood Estimator For Doppler Parameter And Cramer Rao Bound In ZP‐OFDM Underwater Acoustic Channel Bastien Lyonnet , Cyrille Siclet and Jean‐Marc Brossier GIPSA‐lab GRENOBLE, France Th. 15.2 15:15‐15:30 A Subspace Based Method for Time Delay Estimation Jafar Shalchian , Ali Khaki‐Sedigh and Alireza Fatehi APAC research group, Control Department, K.N. Toosi University of Technology, Tehran, Iran Th. 15.3 15:30‐15:45 Proposal of Plug and Play Ego‐motion Estimator for Mobile Robot Naoki Suganuma1, Yuichi Hayashi2 and Tomonori Shimizu1 1Institute of Science and Engineering, Kanazawa University, Kanazawa Ishikawa, Japan; 2DENSO Inc.; 3Kanazawa University, Japan Th. 15.4 15:45‐16:00 A simple control technique for partial and complete parameter identification of the chaotic Lorenz system Ashraf Zaher Physics Department, Kuwait University, Safat, Kuwait Th. 15.5 16:00‐16:15 lamda‐min Algorithm using TAP approach Manel Abdelhedi , Omessad Hamdi and Ammar Bouallegue SYSCOM Laboratory, ENIT, Tunis, Tunisia Coffee Break 16:30‐17:00
20
Thursday Afternoon, 4th March
Session: MIMO I
Time & Place: 15:00‐16:15 ‐ Daphne
Chairperson: Subhrakanti Dey University of Melbourne, Australia �
Th. 14.1 15:00‐15:15 Outage Capacity and Probability for a Class of MIMO Channels Ioanna Ioannou and Charalambos Charalambous University of Cyprus Th. 14.2 15:15‐15:30 Optimized Linear Receivers and Power Allocation for Two Multi‐User MIMO Downlink Schemes with Linear Precoding Mustapha AMARA1, Yi Yuan‐Wu1 and Dirk Slock2 1Orange Labs, RESA/WIN, Moulineaux, France
2EURECOM, Sophia Antipolis, France
Th. 14.3 15:30‐15:45 Receiver and Transmitter Iterative Optimization Using Maximum Sum‐Rate Criterion for Multi‐User MIMO Systems Mustapha AMARA1, Yi Yuan‐Wu1 and Dirk Slock2 1Orange Labs, RESA/WIN, Moulineaux, France 2EURECOM, Sophia Antipolis, France Th. 14.4 15:45‐16:00 Recovery of a Lattice Generator Matrix from its Gram Matrix for Feedback and Precoding in MIMO Francisco A. Monteiro1,2 and Ian J. Wassell2 1Department of Engineering, University of Cambridge, UK; 2The Computer Laboratory, University of Cambridge, UK Th. 14.5 16:00‐16:15 Smart Antenna Performance for Correlated Azimuth Spread and Ricean K‐Factor Constantin Siriteanu1, Yoshikazu Miyanaga1 and Steven Blostein2 1Graduate School, of Information Science and Technology, Hokkaido University, Sapporo, Japan; 2Department of Electrical and Computer Engineering, Queen’s University, Kingston, Canada Coffee Break 16:30‐17:00
� 19
Thursday Afternoon, 4th March Session: Special Session on Audio Signal Processing A.2 Analytical Methods in Acoustic Signal Processing
Time & Place: 15:00‐16:30 ‐ Bacchus Ballroom
Chairpersons: Rudolf Rabenstein (Organised by) University Erlangen‐Nuremberg, Erlangen, Germany
Sascha Spors Deutsche Telekom Laboratories, Berlin, Germany
Th. SS. 13.1 15:00‐15:20 A preliminary comparative investigation between a diffusion equation model and diffuse reflection algorithms in room‐acoustics modeling Juan M Navarro1, José Escolano2 and José J López3 1Polytechnic Sciences Depart., San Antonio’s Catholic University of Murcia, Murcia, Spain;
2Telecommunication Engineering Department, University of Jaén, Linares, Spain;
3iTeAM Institute,
Universidad Politécnica de Valencia, Valencia, Spain Th. SS. 13.2 15:20‐15:40 Finite Difference Time Domain Modeling of Phase Grating Diffusion Konrad Kowalczyk1 and Maarten van Walstijn2 1Multimedia Communications and Signal Processing, University of Erlangen‐Nuremberg, Erlangen, Germany; 2Sonic Arts Research Centre (SARC), Queen’s University of Belfast, Belfast, United Kingdom Th. SS. 13.3 15:40‐16:00 Spatial alignment of acoustic sources based on spherical harmonics radiation analysis Boaz Rafaely Department of Electrical and Computer Engineering, Ben‐Gurion University of the Negev, Israel Th. SS. 13.4 16:00‐16:30 An Analytical Approach to 3D Sound Field Reproduction Employing Spherical Distributions of Non‐Omnidirectional Loudspeakers Jens Ahrens and Sascha Spors Deutsche Telekom Laboratories, Technische Universität Berlin, Ernst‐Reuter‐Platz 7, 10587 Berlin, Germany Coffee Break 16:30‐17:00
18
Thursday Afternoon, 4th March Session: Image Analysis I
Time & Place: 13:30‐15:00 ‐ Salaminia
Chairperson: Moncef Gabbouj Tampere University of Technology, Tampere, Finland
Th. 12.1 13:30‐13:45 Motion Capture with Constrained Inverse Kinematics for Real‐Time Hand Tracking Andreas Aristidou and Joan Lasenby Department of Engineering, University of Cambridge, Cambridge, UK Th. 12.2 13:45‐14:00 Sparse Representations for Automatic Target Classification in SAR Images Jayaraman Jayaraman Thiagarajan, Karthikeyan Natesan Ramamurthy, Peter Knee and Andreas Spanias School of Electrical, Computer and Energy Engineering, Arizona State University, USA Th. 12.3 14:00‐14:15 Coherent Receiver for AIS Satellite Detection Marian Jurado Gallardo1,2 and Ulrich Sorger1 1Faculty of Science, Technology and Communication, University of Luxembourg; 2LuxSpace, Chateau de Betzdorf, Luxembourg Th. 12.4 14:15‐14:30 Neural Network‐Assisted Reconstruction of Full Polarimetric SAR Information Thanh Hai Le1, Ian McLoughlin1, Ken Yoong Lee2 and Timo Bretschneider2 1School of Computer Engineering, Nanyang Technological University, Singapore 2EADS Innovation Works Singapore, Singapore Th. 12.5 14:30‐14:45 Human Detection from Hemispherical Image Based on Probabilistic Appearance Model Mamoru Saito and Katsuhisa Kitaguchi Osaka Municipal Technical Research Institute, Osaka, Japan Th. 12.6 14:45‐15:00 Graphs Representing Quadtree Structures using Eight Edges Ryosuke Kadowaki , Koyo Motomura, Shinpei Ohkura and Kunio Aizawa Department of Mathematics and Computer Science, Interdisciplinary Faculty of Science and Engineering, Shimane University, Matsue Coffee Break 16:30‐17:00
� 17
Thursday Afternoon, 4th March
Session: Identification and Estimation I
Time & Place: 13:30‐14:45 ‐‐ Amathousia
Chairperson: Christos Panayiotou Department of Electrical and Computer Engineering, University of
Cyprus, Nicosia, Cyprus Th. 11.1 13:30‐13:45 Design and Comparative Study of the RKHS model reduction techniques Okba Taouali , Ilyès Aissi and Hasani Messaoud Ecole Nationale d’Ingenieurs de Monastir, Monastir,Tunisia Th. 11.2 13:45‐14:00 ZF OFDM Receiver for Underwater Communications Alain Kibangou1, Cyrille Siclet 2 and Laurent Ros2 1GIPSA‐Lab, System control Department, University, Joseph Fourier, CNRS, France ; 2GIPSA‐Lab, Image and Signal Department, University Joseph Fourier, CNRS, France Th. 11.3 14:00‐14:15 Event Localization Using Sensor Networks for Sources with Non‐Circular Footprint Michalis Michaelides and Christos Panayiotou KIOS Research Center for Intelligent Systems and Networks and the Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus Th. 11.4 14:15‐14:30 Model‐Based Fault Detection and Isolation for a Powered Wheelchair Masafumi Hashimoto1, Fumihiro Itaba2 and Kazuhiko Takahashi1 1Doshisha University, Japan; 2Hitachi Automotive Systems, Japan
Th. 11.5 14:30‐14:45
Invited Paper New IC Filters for the Analog Front End George Moschytz School of Engineering, Bar‐Ilan University, Ramat‐Gan, Israel and ETH, Zurich, Switzerland Coffee Break 16:30‐17:00
16
Thursday Afternoon, 4th March
Session: Special Session on Advances in MIMO
Time & Place: 13:30‐15:00 ‐ Daphne
Chairperson: Ananthanarayanan Chockalingam Department of ECE, Indian Institute of Science, Bangalore, India
Th. SS. 10.1 13:30‐13:50 Experiments on Peak Spectral Efficiency of 50 bps/Hz with 12‐by‐12 MIMO Multiplexing for Future Broadband Packet Radio Access Hidekazu Taoka
1 and Kenichi Higuchi
2
1Radio Access Network Development Department, NTT DOCOMO, Kanagawa, Japan; 2Department of Electrical Engineering, Tokyo University of Science, Chiba, Japan Th. SS. 10.2 13:50‐14:10 Low‐Complexity Algorithms for Large‐MIMO Detection Ananthanarayanan Chockalingam Department of ECE, Indian Institute of Science, Bangalore 560012, INDIA Th. SS. 10.3 14:10‐14:30 Performance Analysis of Single‐Symbol Maximum Likelihood Decodable Linear STBCs Behrouz Maham1, B. Sundar Rajan2 and Are Hjørungnes1 1UNIK – University Graduate Center, University of Oslo, Norway; 2Dept. of ECE, Indian Institute of Science, Bangalore, India Th. SS. 10.4 14:30‐14:50 Deterministic Processing for MIMO Systems Ranjan Mallik1, Manav Bhatnagar1 and Jack Winters2 1Department of Electrical Engineering, Indian Institute of Technology – Delhi, New Delhi, India; 2Jack Winters Communications, NJ, U.S.A. Coffee Break 16:30‐17:00
� 15
Thursday Afternoon, 4th March Session: Special Session on Audio Signal Processing A.1 Acoustic Source Processing
Time & Place: 13:30‐15:00 ‐ Bacchus Ballroom
Chairpersons: Rudolf Rabenstein (Organised by) University Erlangen‐Nuremberg, Erlangen, Germany
José Javier López Monfort Universidad Politecnica de Valencia, Valencia, Spain Th. SS. 9.1 13:30‐13:50 Analysis of Room Reverberation Effects in Source Localization Using Small Microphone Arrays Maximo Cobos1, José J López1 and Sascha Spors2 1Institute of Telecommunications and Multimedia Applications, Universidad Politécnica de Valencia, Valencia, Spain;
2Deutsche Telekom Laboratories, Technische Universität Berlin, Berlin, Germany
Th. SS. 9.2 13:50‐14:10 Accuracy of Time‐Difference‐of‐Arrival Based Source Localization Algorithms under Temperature Variations Paolo Annibale and Rudolf Rabenstein University Erlangen‐Nuremberg, Erlangen, Germany Th. SS. 9.3 14:10‐14:30 Speech Enhancement for Binaural Hearing Aids based on Blind Source Separation Klaus Reindl , Yuanhang Zheng and Walter Kellermann Multimedia Communications and Signal Processing, University of Erlangen, Erlangen, Germany Th. SS. 9.4 14:30‐14:50 Self‐calibration of two microphone arrays from volumetric acoustic maps in non‐reverberant rooms Salvo Daniele Valente , Fabio Antonacci , Marco Tagliasacchi , Augusto Sarti and Stefano Tubaro Dipartimento di Elettronica ed Informazion, Politecnico di Milano, Italy Coffee Break 16:30‐17:00
14
Thursday Morning, 4th March
Session: Special Session on Information Theoretic Methods in Signal Processing
Time & Place: 11:00‐12:00 ‐ Salaminia
Chairperson: Jaakko Astola Department of Signal Processing, Tampere University of Technology, Finland
Th. SS. 8.1 11:00‐11:20 Secure HARQ communication protocols based on Turbo Codes Alessandro Neri , Daniele Blasi and Patrizio Campisi Applied Electronics Department at the University of Roma TRE, Roma, IT Th. SS. 8.2 11:20‐11:40 Maximum likelihood, optimal L‐ and adaptive estimators of location parameter for data samples with symmetric heavy‐tailed distributions Alexey Roenko1, Vladimir Lukin1 and Igor Djurovic2 1National Aerospace University named after, N.E. Zhukovsky “KhAI”, Kharkov, Ukraine; Electrical Engineering Department, University of Montenegro, Podgorica, Montenegro Th. SS. 8.3 11:40‐12:00 Interleaved quantization‐optimization and predictor structure selection for lossless compression of audio companded signals Ioan Tabus , Vlad Tabus and Jaakko Astola Department of Signal Processing, Tampere University of Technology, Finland Th. SS. 8.4 12:00‐12:20 Fast search on the shells of Golay codes Ioan Tabus, Mari Seppanen and Adriana Vasilache Department of Signal Processing, Tampere University of Technology, Tampere, Finland Lunch 12:30‐13:30
� 13
Thursday Morning, 4th March
Session: Biomedical Signal and Image Processing
Time & Place: 11:00‐12:30 ‐ Amathousia
Chairpersons: Christos Loizou Intercollege, Cyprus
Efthyvoulos Kyriacou Frederick University, Cyprus Th. 7.1 11:00‐11:15 Comparison of Canonical Correlation Analysis and ICA Techniques for fMRI Mohammad Reza Arbabshirani1, Mansor Nakhkash2 and Hamid Soltanian Zadeh3 1ECE department, University of New Mexico, USA; 2Dept. of Electrical Eng.,Yazd University, Yazd, Iran; 3Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran Th. 7.2 11:15‐11:30 Processing of human colonic pressure signals using overdetermined ICA Cheng Pan , Sheping Tian and Guozheng Yan School of Electronic, Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China Th. 7.3 11:30‐11:45 Diffuse Optical Mammotomography Based on Backprojection Algorithm with Vainberg‐Butterworth Filtration Alexander Konovalov1, Alexander Uglov1 and Vladimir Lyubimov2 1Russian Federal Nuclear Center Zababakhin Institute of Applied Physics, Snezhinsk Chelyabinsk Region; 2Institute for Laser Physics of Vavilov State, Optical Institute Corporation, St.Petersburg, Russia Th. 7.4 11:45‐12:00 The Bilinear Brain: Towards Subject‐Invariant Analysis Christoforos Christoforou1, Robert Haralick2, Paul Sajda3 and Lucas Parra4 1R.K.I Leaders Limited, Aradipou, Larnaca, Cyprus; 2Department of Computer Science, Graduate Center, CUNY, New York, USA; 3Department of Biomedical Engineering, Columbia University, New York, USA; 4Department of Biomedical Engineering, The City College of The City University of New York, USA Th. 7.5 12:00‐12:15 DCN Variations for Autism Diagnosis Majid Alsagabi and Ahmed Tewfik Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA Th. 7.6 12:15‐12:30 M‐mode State Based Identification in Ultrasound Videos of the Carotid Artery C. P. Loizou1, M. Pantziaris2, C. S. Pattichis3, E. Kyriakou4 1Department of Computer Science, School of Sciences, Intercollege, Limassol, Cyprus; 2Cyprus Institute of Neurology and Genetics, Nicosia, Cyprus; 3Department of Computer Science, University of Cyprus, Nicosia, Cyprus; 4Department of Computer Science, Frederick University, Limassol, Cyprus Th. 7.7 12:30‐12:45 A New Dissimilarity Index of EEG SIGNALS for Epileptic Seizure Detection Mohammad Niknazar1, Seyed Reza Mousavi2, Bijan Vosoughi Vahdat1, Mohammad Bagher Shamsollahi1 and Mohammad Sayyah3 1Biomedical Signal and Image Processing Laboratory (BiSIPL), School of Electrical Engineering, Sharif, University of Technology, Tehran, Iran; 2Biomedical Engineering Laboratory, School of Electrical Engineering, Sharif University of Technology, Tehran Iran; 3Physiology and Pharmacology Department, Pasteur Institute Lunch 12:30‐13:30
12
Thursday Morning, 4th March
Session: Special Session on Green Communications
Time & Place: 11:00‐12:15 ‐ Daphne
Organised by: Gerhard P. Fettweis and Steffen Bittner
Chairperson: Christian Isheden TU Dresden, Vodafone Chair, Dresden, Germany Th. SS. 6.1 11:00‐11:15 Communication Infrastructure of Smart GRID Kwang‐Cheng Chen Graduate Institute of Communication Engineering National Taiwan University, Taipei, Taiwan Th. SS. 6.2 11:15‐11:30 Overall ICT Footprint and Green Communication Technologies Willem Vereecken , Ward Van Heddeghem , Didier Colle , Mario Pickavet and Piet Demeester Ghent University ‐ IBBT, Department of Information Technology (INTEC) Gaston Crommenlaan 8, Bus 201, 9050 Ghent, Belgium Th. SS. 6.3 11:30‐11:45 Approaches to Energy Efficient Wireless Access Networks Oliver Blume1, Dietrich Zeller1,2 and Ulrich Barth1 1Wireless Communication, Department of Alcatel‐Lucent Bell Labs in Stuttgart, Germany;
2Project
Coordinator of the EARTH project Th. SS. 6.4 11:45‐12:00 A Novel Time‐Domain Sleep Mode Design for Energy‐Efficient LTE Rui Wang , John Thompson and Harald Haas Institute for Digital Communications, Joint Research Institute for Signal and Image Processing, School of Engineering and Electronics, the University of Edinburgh, Edinburgh, UK Th. SS. 6.5 12:00‐12:15 CoolReader‐‐‐An Energy Autonomous E‐Reader with Broadband Wireless Connection Christian Isheden1, Matthias Klaus2 and Gerhard Fettweis1 1Vodafone Chair Mobile Communications Systems, Technical University Dresden, Dresden, Germany; 2Plastic Logic GmbH, Dresden, Germany Lunch 12:30‐13:30
� 11
Thursday Morning, 4th March
Session: Audio and Speech II
Time & Place: 11:00‐12:45 ‐ Bacchus Ballroom
Chairperson: Aníbal Ferreira University of Porto, FEUP‐DEEC, Portugal
Th. 5.1 11:00‐11:15 Formant Distortion After Codecs For Arabic Amr Nabil and Mohamed Hesham Engineering Mathematics and Physics Dept., Faculty of Engineering, Cairo University, Egypt Th. 5.2 11:15‐11:30 The Research and Implementation of Acoustic Module Based Mandarin TTS Cheng‐Yu Yeh Department of Electrical Engineering, National, Chin‐Yi University of Technology, Taichung, Taiwan, Republic of China Th. 5.3 11:30‐11:45 Localisation‐based, situation‐adaptive mask generation for source separation Nilesh Madhu and Jan Wouters ExpORL,Dept. Neurosciences, Katholieke Universiteit Leuven, Leuven, Belgium Th. 5.4 11:45‐12:00 Incorporating the Human Hearing Properties in the GSVD‐Based Approach for Speech Enhancement Masoud Geravanchizadeh and Sanaz Ghaemi Sardaroudi Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran Th. 5.5 12:00‐12:15 Hybrid Embedding Strategy For a Blind Audio Watermarking System Using EMD and ISA Techniques el Hamdouni Nawal1 , Adib Abdellah2, Sonia Djaziri Larbi3 and Monia Turki3 1LRIT, laboratory associated of CNRST, Faculty of Sciences, Rabat, Maroc; 2LIM@II‐FSTM; 3U2S, ENIT, Tunis, Tunisie Th. 5.6 12:15‐12:30 Audio object individual operation and its application to earphone leakage noise reduction Shota Suzuki
1, Shigeki Miyabe
2, Noriyoshi Kamado
1, Hiroshi Saruwatari
1, Kiyohiro Shikano
1, Toshiyuki
Nomura3 1Nara Institute of Science and Technology, Nara, Japan; 2The University of Tokyo, Tokyo, Japan, 3NEC Corporation, Kanagawa, Japan Lunch 12:30‐13:30
10
Thursday Morning, March 4th
Session: Keynote Th. 1
Time & Place: 8:30‐9:30 ‐ Bacchus Ballroom
Chairperson: Moncef Gabbouj Tampere University of Technology, Tampere, Finland
Keynote Th. 1 8:30‐9:30 On the Role of Signal Processing in the Amazing Progress of Digital Storage Jack Keil Wolf Stephen O. Rice Professor of Electrical and Computer Engineering and a member of the Center for Magnetic Recording Research, University of California, San Diego, USA
Session: Keynote Th. 2
Time & Place: 9:30‐10:30 ‐ Bacchus Ballroom
Chairperson: Costas N. Georghiades Texas A&M University, Texas, USA
Keynote Th. 2 9:30‐10:30 Low Power Design for Video Processing and Compression Satoshi Goto Waseda University, Japan Coffee Break 10:30‐11:00
� 9
Wednesday Morning, 3rd March
Session: Applications
Time & Place: 11:00‐12:30 ‐ Salaminia
Chairperson: Nicolas Tsapatsoulis Cyprus University of Technology, Cyprus Wed. 4.1 11:00‐11:15 Region‐of‐Interest based Adaptation of Video to Mobile Devices Tamir Nuriel and David Malah Department of Electrical Engineering, Technion‐ Israel Institute of Technology Wed. 4.2 11:15‐11:30 A crop field modelling to simulate agronomic images Gawain Jones1, Christelle Gee1, S. Villette1 and Frédéric Truchetet2 1AgroSup Dijon, Dijon, France; 2Le2i, Université de Bourgogne, Dijon, France Wed. 4.3 11:30‐11:45 DCT based Scalable Scrambling Method with Reversible Data Hiding Functionality KokSheik Wong 1 and Kiyoshi Tanaka 2 1Faculty of Engineering, Multimedia University, Malaysia; 2Faculty of Engineering, Shinshu University, Nagano, Japan Wed. 4.4 11:45‐12:00 Single‐Microphone Blind Audio Source Separation via Gaussian Short+Long Term AR Models Antony Schutz and Dirk Slock EURECOM, Mobile Communication Department, Sophia Antipolis, France Wed. 4.5 12:00‐12:15 Evidence of spatio‐temporal transition to chaos in the spine Srideep Musuvathy1 and Edmond Jonckheere2 1Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA; 2Department of Electrical Engineering and Mathematics, University of Southern California, Los Angeles, CA, USA Wed. 4.6 12:15‐12:30 A local Total Electron Content Neural Network model over Cyprus Haris Haralambous1, Photos Vrionides1, Lefteris Economou2 and Harris Papadopoulos1 1Frederick University Nicosia, Cyprus; 2Intercollege, Limassol, Cyprus Light Lunch 12:45 Bus leaves for Nicosia 12:45 Cyprus Meze at the Plaka Tavern in Lefkosia 19:30
8
Wednesday Morning, 3rd March
Session: Genome Signal Analysis
Time & Place: 11:00‐12:30 ‐ Amathousia
Chairperson: Paul Dan Cristea (Organized by) University "Politehnica" of Bucharest, Romania Wed. SS. 3.1 11:00‐11:15 Nucleotide Genomic Signals Methodology Paul Dan Cristea University "Politehnica" of Bucharest, Romania Wed. SS. 3.2 11:15‐11:30 Local description of molecular surfaces Arsene Octavian POLITEHNICA University of Bucharest, Bucharest, Romania Wed. SS. 3.6 12:15‐12:30 Performance comparison of techniques for DNA sequence prediction using neural networks Georgi Tsenov, Alexandra Nikolova, and Valeri Mladenov Technical University of Sofia, Bulgaria Wed. SS. 3.4 11:45‐12:00 An Adaptive Intelligent Model for Nucleotide Sequence Forecasting Iulian Nastac1 and Rodica Tuduce2 1Electronics Department, University, "Politehnica" of Bucharest, Bucharest, Romania; 2Bio‐Medical Engineering Centre, Polytechnic, University of Bucharest, Bucharest, Romania Light Lunch 12:45 Bus leaves for Nicosia 12:45 Cyprus Meze at the Plaka Tavern in Lefkosia 19:30
� 7
Wednesday Morning, 3rd March
Session: Special Session on Spectrum Sensing for Cognitive Radios
Time & Place: 11:00‐12:15 ‐ Daphne
Chairperson: Visa Koivunen Aalto University, Department of Signal Processing and Acoustics, Finland
Wed. SS. 2.1 11:00‐11:15 On Signal Detection Techniques for the DVB‐T Standard Danyo Danev Department of Electrical Engineering (ISY), Linköping University, Linköping, Sweden Wed. SS. 2.2 11:15‐11:30 On the Implementation of Autocorrelation‐based Feature Detector Kari Kokkinen1, Vesa Turunen1, Marko Kosunen1, Sachin Chaudhari2, Visa Koivunen2 and Jussi Ryynänen1 1Aalto University, Department of Micro‐ and Nanosciences; 2Aalto University, Department of Signal Processing and Acoustics, Finland Wed. SS. 2.3 11:30‐11:45 Characterization of spatial diversity in cooperative spectrum sensing Jan Oksanen , Jarmo Lundén and Visa Koivunen Aalto University School of Science and Technology, Department of Signal Processing and Acoustics, Finland Wed. SS. 2.4 11:45‐12:00 Low complexity bandwidth compression mappings for sensor networks Kimmo Kansanen1, Anna Kim1, Ragnar Thobaben2 and Johannes Karlsson2 1Institute of Electronics and Telecommunications, Norwegian University of Science and Technology, Norway; 2School of Electrical Engineering and ACCESS Linnaeus Center Royal Institute of Technology Stockholm, Sweden Wed. SS. 2.5 12:00‐12:15 Adaptive Channel Coding for the Three‐Node Relay Channel with Limited Channel‐State Information Zhongwei Si , Ragnar Thobaben and Mikael Skoglund 1School of Electrical Engineering and ACCESS Linnaeus Center Royal Institute of Technology (KTH), Stockholm, Sweden Wed. SS. 2.6 12:15‐12:30 A Novel Parallelized Goodness‐of‐Fit Test Based Dynamic Spectrum Access Technique for Cognitive Radio Networks Nikhil Kundargi and Ahmed Tewfik University of Minnesota, Twin Cities, Minneapolis, Minnesota, USA Light Lunch 12:45 Bus leaves for Nicosia 12:45 Cyprus Meze at the Plaka Tavern in Lefkosia 19:30
6
Wednesday Morning, 3rd March
Session: Audio and Speech I
Time & Place: 11:00‐12:30 ‐ Bacchus Ballroom
Chairperson: Seyed Mohammad Ahadi Sarkani Amirkabir University of Technology, Iran
Wed. 1.1 11:00‐11:15 Sound Classification based on Temporal Feature Integration Stavros Ntalampiras1, Ilyas Potamitis2 and Nikos Fakotakis1 1Electrical and Computer Engineering Department, University of Patras, Greece; 2Technological Educational Institute of Crete, Department of Music Technology and Acoustics, Greece Wed. 1.2 11:15‐11:30 Footprint Reduction of Concatenative Text‐To‐Speech Synthesizers using Polynomial Temporal Decomposition Tamar Shoham1, David Malah1 and Slava Shechtman2 1Department of Electrical Engineering, Technion‐ Israel Institute of Technology; 2IBM Haifa Research Labs Wed. 1.3 11:30‐11:45 Modulation Spectral Features for Objective Voice Quality Assessment Maria Markaki and Yannis Stylianou Computer Science Dept, University of Crete, Greece Wed. 1.4 11:45‐12:00 Audio encoding using Huang and Hilbert transforms K. Khaldi 1,2,4, A.O. Boudraa2, B. Torrésani3, Th. Chonavel4 and M. Turki1 1Unité Signaux et Systèmes, ENIT, Tunis, Tunisia; 2IRENav, Ecole Navale, BCRM Brest, France; 3Université de Provence, Marseille, France; 4Institut Télécom; Télécom Bretagne, Brest Cedex, France Wed. 1.5 12:00‐12:15 Objective Evaluation of Magnitude and Phase Only Spectrum‐based Reconstruction of the Speech Signal Erfan Loveimi and Seyed Mohammad Ahadi Speech Processing Research Laboratory, Electrical Engineering Department, Amirkabir University of Technology, Iran Wed. 1.6 12:15‐12:30 Improving the Noise‐Robustness of Mel‐Frequency Cepstral Coefficients for Speaker Verification Masoud Geravanchizadeh and Amir Karimpour Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran Light Lunch 12:45 Bus leaves for Nicosia 12:45 Cyprus Meze at the Plaka Tavern in Lefkosia 19:30
� 5
Wednesday Morning, March 3rd
Session: Keynote Wed. 1 & 2
Time & Place: 8:30‐10:30 ‐ Bacchus Ballroom
Chairperson: Sanjit K. Mitra University of Southern California, USA
Keynote Wed. 1 8:30‐9:30 Technology Evolution and Societal Development: Does One Model Serve Both? Andrew J. Viterbi University of Southern California and Viterbi Group, San Diego, CA, USA
Keynote Wed. 2 9:30‐10:30 Modeling Interconnected Systems Jan C. Willems Guest Profesor, K.U. Leuven, Belgium Coffee Break 10:30‐11:00
4
Technical Program
� 3
�
Friday, 5th Mar. 2010
Bacchus Ballroom
8:30‐9:30 Keynote Fr. 1 ‐ Big Rooms to small boxes back to big Rooms
Gene A. Frantz
9:30‐10:30
Keynote Fr. 2 ‐ Traffic Pattern Analysis and Load Balancing in Negatively Curved Networks
Edmond Jonckheere
10:30‐11:00 Coffee Break
Bacchus Ballroom Daphne Amathousia Salaminia
11:00‐12:30 Wireless Networks Special Session on MIMO Radar (Organised by Prof. H. Vincent Poor)
Special Session on Quantum Control I (Organised by Prof. E. A. Jonckheere, A. Shabani, and S. Schirmer)
Signal and Image Processing
12:30‐13:30 Lunch
13:30‐15:00 Receiver Design Special Session on Quantum Control II
(Organised by Prof. E. A. Jonckheere, A. Shabani, and S. Schirmer)
DSP Implementation and Time‐Frequency Analysis
15:00‐16:30 Special Session on Cooperative Methods in Wireless Networks (Organised by Profs D. Slock and P. Elia)
Synchronization and Equalization
Systems and Control II
Special Session on Advances in DSP (Organised by Prof. A. Spanias)
16:30‐17:00 Coffee Break
17:00‐18:30 Wireless Systems Estimation Special Session on Intelligent Feedback Systems (Organised by Prof. P. Ioannou)
DSP for Communications
2
Thursday, 4th Mar. 2010
Bacchus Ballroom
8:30‐9:30 Keynote Th. 1 ‐ On the Role of Signal Processing in the Amazing Progress of Digital Storage Jack Keil Wolf
9:30‐10:30
Keynote Th. 2 ‐ Low Power Design for Video Processing and Compression
Satoshi Goto
10:30‐11:00 Coffee Break
Bacchus Ballroom Daphne Amathousia Salaminia
11:00‐12:30 Audio and Speech II Special Session on Green Communications (Prof. Gerhard P. Fettweis and Steffen Bittner)
Biomedical Signal and Image Processing
Special Session on Information Theoretic Methods in Signal Processing (Organised by Prof. J. Astola)
12:30‐13:30 Lunch
13:30‐15:00 Special Session on Audio Signal Processing I (Organised by Prof. R. Rabenstein)
Special Session on Advances in MIMO (Organised by Prof. A. Chockalingam)
Identification and Estimation I
Image analysis I
15:00‐16:30 Special Session on Audio Signal Processing II (Organised by Prof. R. Rabenstein)
MIMO I Identification and Estimation II
Image Analysis II
16:30‐17:00 Coffee Break
17:00‐18:30 Special Session on Audio Signal Processing III (Organised by Prof. R. Rabenstein)
MIMO II Systems and Control I Special Session on Multi‐Media Processing over Wireless Communications (Organised by Prof. Y. Miyanaga)
19:30 Bus leaves for Gala Dinner
� 1
Program at a Glance
Tuesday, 2th Mar. 2010
19:00‐20:00 Opening Ceremony
20:15‐22:00 Welcome Cocktail
Wednday, 3rd Mar. 2010
Bacchus Ballroom
8:30‐9:30 Keynote Wed. 1 ‐ Technology Evolution and Societal Development: Does One Model Serve Both?
Andrew J. Viterbi
9:30‐10:30 Keynote Wed. 2 ‐ Modeling Interconnected Systems
Jan C. Willems
10:30‐11:00 Coffee Break
Bacchus Ballroom Daphne Amathousia Salaminia
11:00‐12:30 Audio and Speech I Special Session on Spectrum Sensing for Cognitive Radios (Organised by Prof. V. Koivunen)
Genome Signal Analysis (Organised by Prof. Paul Dan Cristea)
Applications
12:45 Light Lunch – Sandwich
12:45 Bus leaves for Lefkosia
19:30 Cyprus meze at the Plaka tavern in Lefkosia
xxiv
ISCCSP 2010 Social Program Welcome Cocktail Tuesday, 2nd March, 20:00hrs A Welcome Cocktail will take place at the Conference Venue, Le Meridien Limassol & Spa Resort. Everybody is welcome.
Lefkosia excursion Wednesday, 3rd March, 12:45hrs Please note that on Thursday, we have organized a beautiful excursion to Lefkosia, the Capital of Cyprus and one of its most beautiful towns. This will be free to all participants. This excursion will start at 12.45hrs and will be completed at night. Our tour will take us to the Cyprus Archaeological museum, the Byzantine Museum, and the medieval city of Lefkosia within the walls, and the dividing line. In an effort to see as much as possible, participants will be served sandwiches on board the buses for lunch. The evening will end with dinner at Rimi Restaurant, a traditional restaurant located at Laiki Yitonia. A visit to any capital is a must, but Lefkosia unique in that it is the only remaining divided capital in the world today. The contrast of the old and new is most evident in Lefkosia, with its modern architecture and old city within the Venetian ramparts of 16th century. Lefkosia is a city boasting many important historical monuments and interesting museums. The excursion will start with a visit toLefkosia’s Archaeological Museum; here there are artefacts going back to 7000 years BC. The next visit will be the Byzantine Museum and Art Galleries, an Archbishop Makarios III Foundation Cultural Centre with the largest collection of icons on the island, covering the period from the 9th to 18th century. The Art Galleries contain oil paintings, maps and lithographs. The Byzantine Museum, is one of the finest of its kind in the world. St. John's Cathedral is also located here. The excursion will end at the ‘Laiki Gitonia’ the restored commercial quarter of the old city, where all the participants will be able to have a stroll. Here they will also have the possibility to visit the “Green Line”, the area which presents the last divided capital of the world.
Gala dinner ‐ Cyprus Night at Carob Mill Foyer Thursday, 4th March, 20:00hrs The Lanitis Carob Mill is a 3.000 sq. m. multi‐purpose building situated west of the Medieval Castle of Limassol near the old Port. In the past, the building was used as a warehouse and later as a carob mill where the collection of carob, the grinding and the separation of its various sub‐products, which were exported to England, Egypt, Russia, etc, took place. The foyer is often used to accommodate prestigious events and dinners. Traditional dancers dressed in traditional costumes will perform Cypriot and Greek dances. Everyone is encouraged to join in! This is certainly a very memorable and fun evening which is completed by the “potiras” dancer; an expert dancer who shows his excellent skills of balancing a large number of glasses on his head! Dress informal.
� xxiii
General Conference Information Slide Presentation Guidelines For oral presentations, a laptop PC, video projector, microphone, and laser pointer will be provided. The laptop PC will have Windows XP, Adobe Acrobat, Media Player, and MS PowerPoint. The presenters can bring their presentations on CD/memory stick. It is strongly recommended that presenters bring their presentations on CD/memory stick (flash drive) to store on the laptop PC at least 15 min prior to your session. This will avoid switching time‐delay between the presentations. The regular oral presentations are scheduled for 15‐minute slots. Your presentation should be 12 minutes long, followed by a 3 minute question‐answer period. There aere certain special session papers that are scheduled for 20 minute slots, with the presentation to last for 16 minutes long, followed by a 4 minute question – answer period.
xxii
ISCCSP Opening Ceremony Tuesday, March 2nd 2010
19:00 hrs
Constantinos S. Pattichis Dean, Faculty of Pure and Applied Sciences, University of Cyprus
ISCCSP Technical Program Co‐Chair
C. L. Max Nikias Executive Vice President and Provost
University of Southern California, CA, USA ISCCSP Honorary Co‐Chair
(DVD message)
Anthony G. Constantinides Department of Electrical and Electronic Engineering
Imperial College, UK
Sanjit K. Mitra Ming Hsieh Department of Electrical Engineering,
University of Southern California, USA ISCCSP General Co‐Chair
19:20 hrs Zaharias Rallis
Cyprus Through the Ages ‐ A Philatelic Journey
20:15 hrs Welcome Cocktail
� xxi
Special Sessions
Wednesday, 3rd March – 11:00‐12:30 Special Session on Spectrum Sensing for Cognitive Radios Organised by Prof. V. Koivunen Thursday, 4th March – 11:00‐12:30 Special Session on Green Communications Organised by Profs. Gerhard P. Fettweis and Steffen Bittner
Thursday, 4th March – 11:00‐12:30 Special Session on Information Theoretic Methods in Signal Processing Organised by Prof. J. Astola Thursday, 4th March – 13:30‐15:00, 15:00‐16:30, and 17:00‐18:30 Special Session on Audio Signal Processing I, II, III Organised by Prof. R. Rabenstein Thursday, 4th March – 17:00‐18:30 Special Session on Multi‐Media Processing over Wireless Communications Organised by Prof. Y. Miyanaga
Thursday, 4th March – 13:30‐15:00 Special Session on Advances in MIMO Organised by Prof. A. Chockalingam Friday, 5th March – 11:00‐12:30 Special Session on MIMO Radar Organised by Prof. H. Vincent Poor Friday, 5th March – 13:30‐15:00 Special Session on Multi‐Media Processing over Wireless Communications Organised by Prof. Y. Miyanaga Friday, 5th March – 11:00‐12:30 and 13:30‐15:00 Special Session on Quantum Control I and II Organised by Profs. E. A. Jonckheere, A. Shabani, and S. Schirmer Friday, 5
th March – 15:00‐16:30
Special Session on Intelligent Feedback Systems Organised by Prof. P. Ioannou Friday, 5th March – 15:00‐16:30 Special Session on Advances in DSP Organised by Prof. A. Spanias
xx
the large‐scale geometry paradigm of identification of graphs and manifolds, N=volume(M), the theoretical and experimental analyses are amazingly consistent.
As long as the network is negatively curved, congestion will develop inevitably, and the only way to relief the congestion is to abandon such physically motivated metric of delay in favor of a metric that will make the network positively curved. This is the well‐known Yamabe flow problem, instrumental in the proof of the Poincaré conjecture: The Yamabe flow is a differential equation whose solution is a metric that will make the local network curvature uniformly equal to its Euler characteristic. Should the latter be positive, existence of a routing strategy avoiding congestion is guaranteed. In topological term, the Euler characteristics is the obstruction to balancing the load.
At this juncture, other applications of curvature/congestion can be envisioned—like line overload in a power grid, curvature of spin networks, etc.
BIOGRAPHICAL SKETCH
Edmond Jonckheere is a native of Belgium. He received his degree in Electrical Engineering from the
Université de Louvain, Louvain‐la‐Neuve, Belgium, in 1973; the Docteur‐Ingénieur degree in
Aerospace Engineering from the Université Paul Sabater, in Toulouse, France, in 1975; and the Ph.D.
in Electrical Engineering from the University of Southern California, Los Angeles, in 1978. After a stint
with the Philips (MBLE) Research Laboratory, Brussels, Belgium, he returned to the University of
Southern California in 1980, where he is now a full Professor of Electrical Engineering and
Mathematics. His industrial affiliations have included Lockheed‐Martin, the Aerospace Corporation,
and Honeywell. He has held short term visiting appointment with the Max Planck Institute, Germany,
the Facultés Universitaires de Namur, Belgium, and the Australian National University. His early
research interests include the spectral theory of the H problem, for which he was elected Fellow of
the Institute of Electrical and Electronics Engineers. His most recent research interests include traffic
signal analysis for intrusion detection, Gromov’s large‐scale analysis of networks, traffic pattern
analysis and load balancing by curvature control, and most recently, neurophysiology and quantum
control.
� xix
Traffic Pattern Analysis and Load Balancing in Negatively Curved Networks
Edmond Jonckheere
Professor, Ming Hsieh Department of Electrical Engineering
and Department of Mathematics, University of Southern California,
USA
ABSTRACT ‐ In the quest to identify a single parameter that would encapsulate such relevant properties of networks as their potential to create congestion, network investigators have for the past decade focused their attention on the Small‐World/Scale‐Free dichotomy, whereas the clustering coefficient—itself a manifestation of the deeper concept of curvature—initially attracted little attention. Certainly, the Small‐World concept has seen spectacular applications in networked system synchronization, more recently in neuro‐physiological system synchronization, whereas the Scale‐Free concept appeared to be a model of networks constructed by the “growth/preferential attachment” process.
Here, it is argued that a refined version of the clustering coefficient—the curvature—is the all encompassing parameter that predicts network behavior. Curvature indeed anticipates congestion, should the network be negative curved. Curvature indeed anticipates a balanced load, should the network be positively curved. Curvature indeed guarantees successful greedy forwarding of packets in sensor networks, provided the curvature has been uniformized by the Ricci flow.
In general, “traffic” follows some rules optimal relative to some criterion. Traffic in a communication network follows cost minimizing paths, where the “cost” reflects, for example, delays and/or outages. Conceptually, “traffic” can be viewed as a geodesic flow, i.e., a length minimizing flow, for a metric that mimics the optimization rules that drive the traffic. It is probably the most fundamental Riemannian geometry paradigm that the curvature controls the geodesic flow. In the network language, traffic is controlled by the curvature.
Our program therefore proceeds from the definition of curvature for network graphs. In case of planar graphs, the local curvature at a vertex v is easily defined from the excess/deficit (relative to 2π) of the sum of the angles of the triangles having v as an apex. Next, it is shown that, should the graph have negative curvature at all of its vertices, “extreme congestion” will develop at the “center of mass” of the graph. Of course, real‐life communication networks are far from planar; nevertheless, a vertex v of a non‐planar graph can be given a (scalar) curvature defined as the average curvature over all planar sections containing v. An experimental sensor network example confirms the relevance of the concept and its ability to predict congestion even in a real‐life set‐up.
The problem with the local curvature is that it does not quite reflect larger‐scale properties of network congestion—for example, how the worst point congestion scales with the size of the network? This larger‐scale analysis is carried over following Gromov’s program of large‐scale, also referred to as coarse, geometry. The main point is that a network could be negatively curved in the large scale (e.g., when viewed from a distance), even though some vertices might have positive curvature. By the Bonk‐Schramm theorem, a Gromov large‐scale negatively curved network is isometric to a hyperbolic manifold, up to some finite distortion. Therefore, treating a network as a Riemannian manifold M, it can be shown that the congestion scales as volume(M)2 in the hyperbolic case, whereas it scales as volume(M)1.5 in the Euclidean case. Clearly, congestion is worse in the hyperbolic than in the Euclidean case.
In a parallel effort, Bell Labs investigators found that the networks of the Rocketfuel data base are negatively curved in Gromov’s sense, and the same investigators further endeavored to determine experimentally how congestion scales with the number of vertices N of the network. They found N2 for the Rocketfuel data base networks and N1.5 for Euclidean lattice networks. If we agree that, under
xviii
�
ABSTRACT ‐ The advancements of technology have allowed us to move that technology from big rooms to small boxes. But this is only half of the story. The other half is how technology in small boxes will begin to expand its capability to control big rooms. This talk will discuss the big room to small box phenomenon along with the pending expansion we are in the midst of experiencing.
BIOGRAPHICAL SKETCH
Gene Frantz is responsible for finding new opportunities and creating new businesses utilizing TI’s
embedded processing technology. He is also considered TI’s futurist as he spends most of his time
talking to customers and universities about what’s next in technology.
Frantz has been with Texas instruments for over thirty years, most of it in Digital Signal Processing. He
is recognized leader in DSP technology both within TI and throughout the industry.
Frantz is a Fellow of the Institution of Electronic and Electronics Engineers. He holds 40 patents in the
area of memories, speech, consumer products and DSP. He has written more than 50 Papers and
articles and continually presents at Universities and conferences worldwide. Frantz is also among
industry experts widely quoted in the media due to his tremendous knowledge and visionary view of
DSO solutions.
Big Rooms to small boxes back to big Rooms
Gene A. Frantz
TI Principal Fellow, TI Futurist, Texas Instruments Incorporated, USA
� xvii
ABSTRACT ‐ The growing class of personal multimedia devices (camera phone, digital camera, portable desk‐tops, audio‐ and video‐based multimedia products) as well as imaging systems and multimedia communication systems, that demand real‐time processing capability with low power consumption, becomes one driving factor for developing efficient video processing and compression techniques with low power consumption. In this talk, a brief overview of H.264 and its extensions will first be provided with the analysis on the performance relationships among them. Some emerging possibilities for new coding techniques will be summarized. Then, video processing and compression techniques targeting the objective of real‐time and low‐power processing are presented for different kinds of multimedia applications like smart car, video telephony, video surveillance, high definition video broadcast and etc. Since the different kinds of applications result in diversity in video content, the techniques are designed accordingly to pursue the best trade‐off between the power consumption and processing performance. Algorithms together with the hardware implementation schemes are selectively introduced with performance comparison and discussion.
BIOGRAPHICAL SKETCH
Satoshi Goto was born in Hiroshima, Japan, 1945. He received the B.E. and the M.E. Degrees in Electronics and Communication Engineering from Waseda University in 1968 and 1970 respectively. He also received the Dr. of Engineering from the same University in 1981. He joined NEC Laboratories in 1970 where he worked for LSI design, Multimedia system and Software as GM and Vice President.. Since 2003, he has been Professor, at Graduate school of Information, Production and Systems of Waseda University at Kitakyushu. His main interest is now on VLSI design methodologies for multimedia and mobile applications. He has published 7 books, 80 international journal papers, 120 international conference papers with reviews. He served as GC of ICCAD and ASPDAC and was a board member of IEEE CAS society. He is IEEE Fellow, IEICE Fellow and Member of Academy Engineering Society of Japan.
Low Power Design for Video Processing and Compression Satoshi Goto Waseda University, Japan
xvi
On the Role of Signal Processing in the Amazing Progress of Digital Storage
Jack Keil Wolf
Stephen O. Rice Professor of Electrical and Computer Engineering and a member of the Center for Magnetic Recording Research, University of California, San Diego, USA
ABSTRACT ‐ By almost any measure (e.g., bits per square inch, cost per megabyte, throughput) digital storage has seen remarkable progress over the last 50+ years. In this talk I will summarize the role that advanced signal processing techniques has played in this development. I will also describe the new technologies which are competing for the next generation storage systems.
BIOGRAPHICAL SKETCH
Jack Keil Wolf received the B.S.E.E. degree from the University of Pennsylvania and the M.S.E., M.A., and Ph.D. degrees from Princeton University. He is currently the Stephen O. Rice Professor of Electrical and Computer Engineering and a member of the Center for Magnetic Recording Research at the University of California, San Diego. He is also a Vice President, Technology (part time) at Qualcomm, Inc. He has received several IEEE awards including: the 1990 E. H. Armstrong Award, the 1998 IEEE Koji Kobayashi Award, the 2001 Claude E. Shannon Medal, the 2007 Aaron D. Wyner Award, and the 2004 Richard W. Hamming Medal. Dr. Wolf was elected to the US National Academy of Engineering in 1993 and was elected as a Fellow of the American Academy of Arts and Sciences in 2005.
� xv
Modeling Interconnected Systems
Jan C. Willems
Guest Profesor, K.U. Leuven, Belgium
ABSTRACT ‐ In Systems Theory, it is customary to view a system in terms of inputs and outputs, and interconnection as output‐to‐input assignment as in series connection and feedback. However, input/output thinking is not suitable for physical systems. The aim of this lecture is to explain the behavioral approach to dynamical systems as an alternative. In this setting, a system is defined as simply a family of trajectories. Modeling interconnected systems by tearing, zooming, and linking will be discussed. Linking, the basis of interconnection, means sharing variables. The question emerges how energy is transferred between systems, and leads to the distinction between ports and terminals. Terminals are for interconnection, ports are for energy transfer. The development will be illustrated by electrical circuits and mechanical systems.
BIOGRAPHICAL SKETCH
Jan C. Willems was born in Bruges in Flanders, Belgium. He received the Ph.D. degree in electrical engineering from MIT in 1968. He was an assistant professor in the department of electrical engineering at MIT from 1968 to 1973, when he was appointed Professor of Systems and Control in the Mathematics department of the University of Groningen. In 2003, Professor Willems became emeritus. Presently he is guest professor at the K.U. Leuven, Belgium.
He served terms as chairperson of the European Union Control Association and of the Dutch Mathematical Society (Wiskundig Genootschap). He has been on the editorial board of a number of journals, in particular, as managing editor of the SIAM Journal of Control and Optimization and of Systems & Control Letters. In 1998, he received the IEEE Control Systems award.
His research area is Systems and Control Theory. He worked on stability of feedback systems, on the theory of dissipative systems, and on geometric control and other topics in linear systems theory. He developed the behavioral approach to dynamical systems and control.
His publications may be found on his website http://homes.esat.kuleuven.be/~jwillems/
xiv
Technology Evolution and Societal Development: Does One Model Serve Both?
Andrew J. Viterbi
Univ. of Southern California and Viterbi Group, San Diego, CA, USA
ABSTRACT ‐ A.A. Markov proposed and developed a statistical concept which suggests that future action should depend only on the current state of the system or process. Exploitation of the statistical properties of Markov processes has produced notable results in two important areas of digital signal processing: optimum linear filtering (Kalman), with principal applications to navigation, tracking, orbit determination and even economics; and finite‐state sequence determination (Viterbi), with applications to digital communication, voice and optical character recognition, data recording and DNA sequence analysis, among others. Both areas will be discussed and compared, as well as the merits of any societal implications of the Markov concept.
BIOGRAPHICAL SKETCH
Dr. Andrew Viterbi is a co‐founder and retired Vice Chairman and Chief Technical Officer of QUALCOMM Incorporated. He spent equal portions of his career in industry, having previously co‐founded Linkabit Corporation, and in academia as Professor in the Schools of Engineering and Applied Science, first at UCLA and then at UCSD, at which he is now Professor Emeritus. He is currently president of the Viterbi Group, a technical advisory and investment company. He also serves as a Presidential Chair Visiting Professor at the University of Southern California and a distinguished Visiting Professor at the Technion‐Israel Institute of Technology.
His principal research contribution, the Viterbi Algorithm, is used in most digital cellular phones and
digital satellite receivers, as well as in such diverse fields as magnetic recording, voice recognition and
DNA sequence analysis. More recently, he concentrated his efforts on establishing CDMA as the
multiple access technology of choice for cellular telephony and wireless data communication.
Dr. Viterbi has received numerous honors both in the U.S. and internationally. Among these are
seven honorary doctorates, from universities in Canada, Israel, Italy and the U.S., the Marconi
International Fellowship Award, the IEEE Alexander Graham Bell, the Claude Shannon and the James
Clerk Maxwell Awards, the NEC C&C Award, the Eduard Rhein Foundation Award, the Christopher
Columbus Medal, the Franklin Medal, the Robert Noyes Semiconductor Industry Award and the
Millennium Laureate Award. He is a member of the National Academy of Engineering and the
National Academy of Sciences and is a Fellow of the American Academy of Arts and Sciences. He has
received an honorary title from the President of Italy and the National Medal of Science from the
President of the United States.
Viterbi serves on boards and committees of numerous non‐profit institutions, including the University
of Southern California, MIT Visiting Committee for Bioengineering, Mathematical Sciences Research
Institute, Burnham Institute for Medical Research, Scripps Translational Science Institute and he is the
past chairman of the Computer and Information Sciences Section of the National Academy of
Sciences.
� xiii
Keynote Lectures Wednesday 3rd March, 8:30‐9:30
Technology Evolution and Societal Development: Does One Model Serve Both? Andrew J. Viterbi
Univ. of Southern California and Viterbi Group, San Diego, CA, USA
Wednesday 3rd March, 9:30‐10:30 Modeling Interconnected Systems
Jan C. Willems Guest Profesor, K.U. Leuven, Belgium
Thursday 4th March 8:30‐9:30
On the Role of Signal Processing in the Amazing Progress of Digital Storage Jack Keil Wolf
Stephen O. Rice Professor of Electrical and Computer Engineering and a member of the Center for Magnetic Recording Research, University of California, San Diego, USA
Thursday 4th March 9:30‐10:30
Low Power Design for Video Processing and Compression Satoshi Goto
Waseda University, Japan
Friday 5th March, 8:30‐9:30 Big Rooms to small boxes back to big Rooms
Gene A. Frantz TI Principal Fellow, TI Futurist, Texas Instruments Incorporated, USA
Friday 5th March, 9:30‐10:30
Traffic Pattern Analysis and Load Balancing in Negatively Curved Networks Edmond Jonckheere
Ming Hsieh Department of Electrical Engineering and Department of Mathematics University of Southern California, USA
xii
Past ISCCSP Conferences
ISCCSP 2010 marks the continuation of the previous 3 successful conferences:
1st ISCCSP 2004, March 21‐24, Hammamet, Tunisia
2nd ISCCSP 2006, March 13‐15, Marrakech, Morocco
3rd ISCCSP 2008, March 12–14, Le Méridien Hotel, St. Julians, Malta���
xi
Reviewers Aboutajdine Driss Antoniou Andreas Astola Jaakko Banavar Mahesh Belouchrani Adel Bellanger Maurice Ben Letaief Khaled Benedetto Sergio Biglieri Ezio Bittner Steffen Boaz Rafaely Jose Escolano Klaus Reindl Jens Ahrens Maximo Cobos Jose Javier Lopez Basilio Pueo Gianpaolo Evangelista Tobias Corbach Konrad Kowalczyk Paolo Annibale Sascha Spors Bouallegue Ammar Bruckstein Alfred Constantinides Anthony Charalambous Charalambos
Chockalingam Ananthanarayanan Christodoulou Christodoulos Chrsitoforou Christoforos Dan Cristea Paul del Bimbo Alberto El‐Khamy Said E. Fariba Ariaei Fettweis Gerhard Gabbouj Moncef Georghiades Costas Georgiopoulos Michael Georgiou Julius Hadjikostis Christoforos Hespanha Joao Ioannou Petros James Debono Carl Jonckhere Edmond Kasparis Takis Khammash Mustafa Koivunen Visa Kucera Vladimir Kyriacou Efthyvoulos Kyriakides Elias Lanitis Andreas Lestas Marios
Limebeer David Loizou Christos Lou Mingji Margareta Stefanovic Michael Maria Mitra Sanjit Mitsis Georgios Miyanaga Yoshikazu Panayiotou Christos Pattichis Constantinos Pattichis Marios Polycarpou Marios Rabenstein Rudolf Renfors Markku Rupp Markus Samaras George Sayed Ali Slock Dirk Spanias Andreas Tsapatsoullis Nikos Vasileiou Vassos Vincent Poor H. Vukic Zoran
x
Publicity Co‐Chairs
Anastasios Kounoudes, Cyprus
Christos Panayiotou, Cyprus
Publication Co‐Chairs
Efthyvoulos Kyriakou, Cyprus
Cristos Loizou, Cyprus
Nicolas Tsapatsoullis, Cyprus
Christoforos Hadjicostis, Cyprus
Local Arrangements Co‐Chairs
Charalambos Charalambous, Cyprus
Andreas Lanitis, Cyprus
Webmaster and Listserv masters
Antoniades Athos, University of Cyprus, Cyprus
Polyvios Polyviou, University of Cyprus, Cyprus
ix
International Technical Program Committee
Driss Aboutajdine, Morocco
Andreas Antoniou, Canada
Jaakko Astola, Finland
Maurice Bellanger, France
Adel Belouchrani, Algeria
Sergio Benedetto, Italy
Khaled Ben Letaief, Hong Kong
Ezio Biglieri, Italy
Boualem Boashash, UAE
Ammar Bouallegue, Tunisia
Alfred Bruckstein, Israel
A. Chockalingam, India
Paul Dan Cristea, Romania
Carl James Debono, Malta
Alberto del Bimbo, Italy
Said E. El‐Khamy, Egypt
Gerhard Fettweis, Germany
Michael Georgiopoulos, USA
Joao España, USA
Edmond A. Jonckhere, USA
Mustafa Khammash, USA
Vladimir Kucera, Czech Republic
David Limebeer, UK
Yoshikazu Miyanaga, Japan
H. Vincent Poor, USA
Rudolf Rabenstein, Germany
Markku Renfors, Finland
Markus Rupp, Austria
Ali Sayed, USA
Dirk Slock, France
Andreas Spanias, USA
Zoran Vukic, Croatia
Special Sessions Co‐Chairs
Takis Kasparis, Cyprus
Ahmed Tewfik, USA
Finance Co‐Chairs
Christos Loizou, Cyprus
Marios Polycarpou, Cyprus
viii
ISCCSP 2010 Committees
Honorary Chairs
C.L. Max Nikias, USA
Stavros Zenios, Cyprus
General Co‐Chairs
Anthony G. Constantinides, UK
Sanjit K. Mitra, USA
Technical Program Co‐Chairs
Moncef Gabbouj, Finland
Constantinos S. Pattichis, Cyprus
Costas Georghiades, USA
vii
ISCCSP 2010 Organization Organized and Sponsored by
Cyprus University of Technology, Cyprus
University of Cyprus, Cyprus
Technically Co‐Sponsored by
IEEE Signal Processing Society
IEEE Circuits & Systems Society
The Institution of Engineering and Technology (IET)
Additional Support by
IEEE Cyprus Section
IEEE Cyprus Section Engineering in Medicine and Biology and Signal Processing Joint Societies Chapter
IET Cyprus
Frederick University, Cyprus
Sponsors
Gold Sponsor:
ERICSSON
Silver Co‐ Sponsors:
PrimeTel
SignalGeneriX
vi
Welcome from the Technical Program Committee Co-Chairs
On behalf of the Technical Program Committee of the 4th International Symposium on Communications, Control, and Signal Processing (ISCCSP‐2010), it is a great honor to welcome you to Cyprus for this event. The Technical Program features the latest research and development results in Communications, Control, and Signal Processing.
The symposium had over 200 submissions maintaining and growing the level of engagement from the research community in ISCCSP. We would like to thank the volunteer efforts of the entire ISCCSP‐2010 technical program and various other committees. Our gratitude goes out to the authors who submitted their work, all members of the Organizing Committee, the reviewers who supported the peer‐review process and everyone else that contributed to putting together a comprehensive, multi‐faceted program. A total of 58 international experts participated in the peer review process, 120 best papers were selected for oral presentation and publication in the ISCCSP‐2010 proceedings, representing an acceptance ratio of approximately 60%. Futhermore, a total of 70 papers will be presented in 11 invited special sessions. The ISCCSP 2010 proceedings will be published by the IEEE Xplore.
The Technical Program Committee has been committed to ensuring that the event is a memorable one via the excellence of the technical program. In addition, the beauty of the country and the warm, welcoming nature of the Cypriots will also make ISCCSP‐2010 an unforgettable experience. We hope that you will find some time to visit Cyprus and enjoy the country, its history and its people. The symposium will also serve as a catalyst to catch up with old friends and meeting new ones.
Moncef Gabbouj, Finland
Constantinos S. Pattichis, Cyprus
Costas Georghiades, USA
v
Cyprus is the third largest island of the Mediterranean. With a rich history traced back over nine thousand
years, it has been invaded and claimed over the centuries by a fascinating mixture of civilizations all of which have
left their culture and shaped its character. Considered to be the birthplace of Aphrodite, it is a primary tourist
destination blessed with natural beauty that ranges from golden beaches and rugged coastlines to rolling hills and
forest clad mountains, dotted with picturesque villages. We hope that you will enjoy both the technical
presentations at the conference as well as all of the history and amusement Cyprus has to offer.
Anthony G. Constantinides, UK
Sanjit K. Mitra, USA
iv
Welcome from the General Co-Chairs
�
On behalf of the organizing committee, we extend a warm welcome to all participants of the 4th
International Symposium on Communications, Control, and Signal Processing (ISCCSP‐2010) being held at the Hotel
Le Meridien, Limassol, Cyprus on March 2‐5, 2010. This international conference is held every second year with
the first one in Hammamet, Tunisia in 2004, second one in Marrakech, Morocco in 2006, and the third one in St.
Julians, Malta in 2008.
This symposium has gathered experts from a wide‐ranging field. Out of more than 200 submitted papers,
the technical program committee accepted 120 papers that will be presented at the conference. Our technical
program features six plenary sessions, 11 invited special sessions, and 20 regular sessions with papers to be
presented by authors from 48 different countries. We thank the technical program committee for their hard work
in arranging the review of all contributed papers and in setting up the technical sessions.
We are honored to have six plenary speakers, internationally renowned experts in communications,
control, and signal processing. Our plenary speakers are Drs. Edmond Jonckheere, Gene Frantz, Satoshi Goto,
Andrew Viterbi, Jan Willems, and Jack Wolf. Thanks are also due to the industry and technical co‐sponsors of the
symposium. The industry co‐sponsors are Erickson, PrimeTel and SignalGenerix. The technical co‐sponsors are the
IEEE Circuits & Systems Society, IEEE Signal Processing Society, the European Association for Signal Processing and
the Institution of Engineering and Technology (U.K.). Additional support has been provided by the IEEE Cyprus
Section, the Cyprus Joint Chapter of the IEEE Engineering in Medicine and Biology, and the IEEE Signal Processing
Society, the Cyprus Section of the Institution of Engineering and Technology, the University of Cyprus, the Cyprus
University of Technology, and the Frederick University of Cyprus.
No symposium or conference would be complete without a social program. The local organizing
committee has planned a welcome reception, an excursion to Nicosia with dining at a traditional Cypriot tavern,
and a gala dinner.
iii
Table of Contents
Welcome from the General Co‐Chairs ............................................................................................ iv
Welcome from the Technical Program Committee Co‐Chairs ....................................................... vi
ISCCSP 2010 Organization .............................................................................................................. vii
ISCCSP 2010 Committees .............................................................................................................. viii
Reviewers ........................................................................................................................................ xi
Past ISCCSP Conferences................................................................................................................ xii
Keynote Lectures .......................................................................................................................... xiii
Special Sessions ............................................................................................................................. xxi
ISCCSP Opening Ceremony .......................................................................................................... xxii
General Conference Information ................................................................................................ xxiii
ISCCSP 2010 Social Program ....................................................................................................... xxiv
Program at a Glance ...................................................................................................................... 1
Technical Program .......................................................................................................................... 4
Abstracts ....................................................................................................................................... 43
Author Index ............................................................................................................................... 143
ii
© 2010 IEEE IEEE Catalog Number: CFP10824-ART ISBN: 978-1-4244-6287-2 © 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
i
4th
Final Program and Abstract Book
INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS CONTROL & SIGNAL PROCESSING
March 3-5, 2010, Le Méridien Limassol Spa and Resort,
Limassol, Cyprus
