Delay-Exponent of Bilayer Anytime Code

In this paper, we study the design and the delay-exponent of anytime codes over a three terminal relay network. We propose a bilayer anytime code based on anytime spatially coupled low-density parity-check (LDPC) codes and investigate the anytime characteristics through density evolution analysis. By using mathematical induction technique, we find analytical expressions of the delay-exponent for the proposed code. Through comparison, we show that the analytical delay-exponent has a close match with the delay-exponent obtained from numerical results.Comment: Accepted for presentation in ITW-2014. 5 Pages, 3 Figure

Comparative evaluation of approaches in T.4.1-4.3 and working definition of adaptive module

The goal of this deliverable is two-fold: (1) to present and compare different approaches towards learning and encoding movements us- ing dynamical systems that have been developed by the AMARSi partners (in the past during the first 6 months of the project), and (2) to analyze their suitability to be used as adaptive modules, i.e. as building blocks for the complete architecture that will be devel- oped in the project. The document presents a total of eight approaches, in two groups: modules for discrete movements (i.e. with a clear goal where the movement stops) and for rhythmic movements (i.e. which exhibit periodicity). The basic formulation of each approach is presented together with some illustrative simulation results. Key character- istics such as the type of dynamical behavior, learning algorithm, generalization properties, stability analysis are then discussed for each approach. We then make a comparative analysis of the different approaches by comparing these characteristics and discussing their suitability for the AMARSi project

New Zealand contributions to the global earthquake model’s earthquake consequences database (GEMECD)

The Global Earthquake Model’s (GEM) Earthquake Consequences Database (GEMECD) aims to develop, for the first time, a standardised framework for collecting and collating geocoded consequence data induced by primary and secondary seismic hazards to different types of buildings, critical facilities, infrastructure and population, and relate this data to estimated ground motion intensity via the USGS ShakeMap Atlas. New Zealand is a partner of the GEMECD consortium and to-date has contributed with 7 events to the database, of which 4 are localised in the South Pacific area (Newcastle 1989; Luzon 1990; South of Java 2006 and Samoa Islands 2009) and 3 are NZ-specific events (Edgecumbe 1987; Darfield 2010 and Christchurch 2011). This contribution to GEMECD represented a unique opportunity for collating, comparing and reviewing existing damage datasets and harmonising them into a common, openly accessible and standardised database, from where the seismic performance of New Zealand buildings can be comparatively assessed. This paper firstly provides an overview of the GEMECD database structure, including taxonomies and guidelines to collect and report on earthquake-induced consequence data. Secondly, the paper presents a summary of the studies implemented for the 7 events, with particular focus on the Darfield (2010) and Christchurch (2011) earthquakes. Finally, examples of specific outcomes and potentials for NZ from using and processing GEMECD are presented, including: 1) the rationale for adopting the GEM taxonomy in NZ and any need for introducing NZ-specific attributes; 2) a complete overview of the building typological distribution in the Christchurch CBD prior to the Canterbury earthquakes and 3) some initial correlations between the level and extent of earthquake-induced physical damage to buildings, building safety/accessibility issues and the induced human casualtie

Correlation-based Cross-layer Communication in Wireless Sensor Networks

Wireless sensor networks (WSN) are event based systems that rely on the collective effort of densely deployed sensor nodes continuously observing a physical phenomenon. The spatio-temporal correlation between the sensor observations and the cross-layer design advantages are significant and unique to the design of WSN. Due to the high density in the network topology, sensor observations are highly correlated in the space domain. Furthermore, the nature of the energy-radiating physical phenomenon constitutes the temporal correlation between each consecutive observation of a sensor node. This unique characteristic of WSN can be exploited through a cross-layer design of communication functionalities to improve energy efficiency of the network. In this thesis, several key elements are investigated to capture and exploit the correlation in the WSN for the realization of advanced efficient communication protocols. A theoretical framework is developed to capture the spatial and temporal correlations in WSN and to enable the development of efficient communication protocols. Based on this framework, spatial Correlation-based Collaborative Medium Access Control (CC-MAC) protocol is described, which exploits the spatial correlation in the WSN in order to achieve efficient medium access. Furthermore, the cross-layer module (XLM), which melts common protocol layer functionalities into a cross-layer module for resource-constrained sensor nodes, is developed. The cross-layer analysis of error control in WSN is then presented to enable a comprehensive comparison of error control schemes for WSN. Finally, the cross-layer packet size optimization framework is described.Ph.D.Committee Chair: Ian F. Akyildiz; Committee Member: Douglas M. Blough; Committee Member: Mostafa Ammar; Committee Member: Raghupathy Sivakumar; Committee Member: Ye (Geoffrey) L

On generalized LDPC codes for ultra reliable communication

Ultra reliable low latency communication (URLLC) is an important feature in future mobile communication systems, as they will require high data rates, large system capacity and massive device connectivity [11]. To meet such stringent requirements, many error-correction codes (ECC)s are being investigated; turbo codes, low density parity check (LDPC) codes, polar codes and convolutional codes [70, 92, 38], among many others. In this work, we present generalized low density parity check (GLDPC) codes as a promising candidate for URLLC. Our proposal is based on a novel class of GLDPC code ensembles, for which new analysis tools are proposed. We analyze the trade-o_ between coding rate and asymptotic performance of a class of GLDPC codes constructed by including a certain fraction of generalized constraint (GC) nodes in the graph. To incorporate both bounded distance (BD) and maximum likelihood (ML) decoding at GC nodes into our analysis without resorting to multi-edge type of degree distribution (DD)s, we propose the probabilistic peeling decoding (P-PD) algorithm, which models the decoding step at every GC node as an instance of a Bernoulli random variable with a successful decoding probability that depends on both the GC block code as well as its decoding algorithm. The P-PD asymptotic performance over the BEC can be efficiently predicted using standard techniques for LDPC codes such as Density evolution (DE) or the differential equation method. We demonstrate that the simulated P-PD performance accurately predicts the actual performance of the GLPDC code under ML decoding at GC nodes. We illustrate our analysis for GLDPC code ensembles with regular and irregular DDs. This design methodology is applied to construct practical codes for URLLC. To this end, we incorporate to our analysis the use of quasi-cyclic (QC) structures, to mitigate the code error floor and facilitate the code very large scale integration (VLSI) implementation. Furthermore, for the additive white Gaussian noise (AWGN) channel, we analyze the complexity and performance of the message passing decoder with various update rules (including standard full-precision sum product and min-sum algorithms) and quantization schemes. The block error rate (BLER) performance of the proposed GLDPC codes, combined with a complementary outer code, is shown to outperform a variety of state-of-the-art codes, for URLLC, including LDPC codes, polar codes, turbo codes and convolutional codes, at similar complexity rates.Programa Oficial de Doctorado en Multimedia y ComunicacionesPresidente: Juan José Murillo Fuentes.- Secretario: Matilde Pilar Sánchez Fernández.- Vocal: Javier Valls Coquilla

Using a private UDDI for publishing location-based information to mobile users

This paper describes our experience with the use of Universal Description, Discovery and Integration (UDDI) technology for supporting location-based service discovery. Our goal is to allow Web Services to be associated with physical locations and then queried according to spatial criteria. This would enable location-based applications to use local UDDI registries to discover the Web Services that are relevant for the current location of a mobile user. However, the current model for Web Services discovery in UDDI does not directly support the particular requirements of location-based discovery. The main limitation is the inadequacy of the query-processing mechanism, based on exact matching between query criteria and service categorizations, to support discovery models based on proximity. We propose an approach that includes a space model that allows external entities to obtain information about the spatial structure of the local environment, a set of querying taxonomies that allow UDDI queries to include spatial criteria while maintaining conformance with the UDDI standards, and a proxy that allows application to benefit from spatial queries while maintaining the approach transparent. This approach is currently being used and evaluated in the VADE project