New two-CFOA-based floating immittance simulators

This paper presents new topologies for emulating floating immittance functions using three to five passive elements and only two current-feedback operational-amplifiers (CFOAs). The feasibility of using only two CFOAs and two passive components is explored. The proposed topologies can emulate lossy positive and negative inductances and capacitance-, inductance-, resistance-multipliers, and frequency dependent negative and positive conductances. The functionality of the proposed circuits was experimentally verified using the commercially available AD844 CFOA. The experimental results are in excellent agreement with theoretical calculations.     

Model-based design verification for embedded systems through SVOCL: an OCL extension for SystemVerilog

Model Based System Engineering (MBSE) is a renowned approach in the context of embedded systems development. It is frequently used to deal with the structural and behavioral aspects of system design. However, the verification of system design is generally performed in isolation. It is particularly true in the context of assertion based verification. Consequently, there is a huge gap between system design and its verification that seriously effects the productivity and time-to market objectives. Therefore, in this research, we target to reduce this gap by exploiting the features of MBSE and SystemVerilog assertions (SVA’s). This article introduces a novel MBSE approach to model the design verification aspects of embedded systems, along with the system design (structural and behavioral aspects). We propose SystemVerilog in Object Constraint Language (SVOCL), an OCL temporal extension for SystemVerilog, to represent the design verification requirements by means of SVA’s. As a part of research, SVOCL transformation engine has been developed to generate SVA’s code in order to automate the design verification of embedded systems. The application of SVOCL has been validated through four case studies.     

Compressive sensing based high-resolution passive bistatic radar

Passive bistatic radar (PBR) systems using different communication signals can only offer low-resolution target detection due to their inherent low bandwidth. In this paper, compressive sensing (CS) is applied to multichannel FM and GSM PBR to achieve improved range-Doppler resolutions and avoid some limitations of classical multiband PBR processing. In CS context, block-structured time-domain dictionary which is formed from multichannel signals suffers from coherence when fine range resolution is employed. To overcome such a pitfall, this work first transforms the dictionary to spectral domain where only the most important spectral components are retained. Principle component analysis followed by a whitening method are then applied to this spectrally transformed data in order to reduce the dimensionality of problem, thereby reducing the dictionary size and most importantly fulfilling the required condition of dictionary incoherence for better CS-based recovery. Two different block-structured dictionary formations are tested. The performance of the recovery of spatially close targets, in both FM and GSM PBR setups, are reported.     

Job search website for illiterate users of Pakistan

Illiteracy is a major hurdle in socio-economic development of Pakistan. Research in the Information and Communication Technology (ICT) can help in tackling this issue by developing solutions tailored for illiterate population. The work presented within this paper proposes a job search website for illiterate population of KPK province of Pakistan. The designed website does not require any human assistance while searching a job. Moreover, the website uses culturally relevant graphical and audio content. The usability of the website is tested according to the ISO-9241-11 specification. Furthermore, we have studied the effect of the participants’ characteristics, i.e., their age, computer and mobile usage experience on the usability of the website. The results show that the participants found the website usable. Specifically, they could search suitable jobs with a minimal number of clicks and in less time as compared to the usual task completion rates reported throughout the literature. None of the participants’ characteristics were found to be affecting the usability of the website. These results suggest a promising potential of ICT solutions for providing services to illiterate population of Pakistan.     

A noise constrained least mean fourth (NCLMF) adaptive algorithm

The learning speed of an adaptive algorithm can be improved by properly constraining the cost function of the adaptive algorithm. In this work, a noise-constrained least mean fourth (NCLMF) adaptive algorithm is proposed. The NCLMF algorithm is obtained by constraining the cost function of the standard LMF algorithm to the fourth-order moment of the additive noise. The NCLMF algorithm can be seen as a variable step-size LMF algorithm. The main aim of this work is to derive the NCLMF adaptive algorithm, analyze its convergence behavior, and assess its performance in different noise environments. Furthermore, the analysis of the proposed NCLMF algorithm is carried out using the concept of energy conservation. Finally, a number of simulation results are carried out to corroborate the theoretical findings, and as expected, improved performance is obtained through the use of this technique over the traditional LMF algorithm.     

A Dual Ring Connectivity Model for VANET Under Heterogeneous Traffic Flow

Vehicular ad-hoc network (VANET) is characterized as a highly dynamic wireless network due to the dynamic connectivity of the network nodes. To achieve better connectivity under such dynamic conditions, an optimal transmission strategy is required to direct the information flow between the nodes. Earlier studies on VANET’s overlook the characteristics of heterogeneity in vehicle types, traffic structure, flow for density estimation, and connectivity observation. In this paper, we have proposed a heterogeneous traffic flow based dual ring connectivity model to enhance both the message disseminations and network connectivity. In our proposed model the availability of different types of vehicles on the road, such as, cars, buses, etc., are introduced in an attempt to propose a new communication structure for moving vehicles in VANETl under cooperative transmission in heterogeneous traffic flow. The model is based on the dual-ring structure that forms the primary and secondary rings of vehicular communication. During message disseminations, Slow speed vehicles (buses) on the secondary ring provide a backup path of communication for high speed vehicles (cars) moving on the primary ring. The Slow speed vehicles act as the intermediate nodes in the aforementioned connectivity model that helps improve the network coverage and end-to-end data delivery. For the evaluation and the implementation of dual-ring model a clustering routing scheme warning energy aware cluster-head is adopted that also caters for the energy optimization. The implemented dual-ring message delivery scheme under the cluster-head based routing technique does show improved network coverage and connectivity dynamics even under the multi-hop communication system.     

Complexity reduction of digital filters using shift inclusive differential coefficients

We present a graph theoretical methodology that reduces the implementation complexity of the multiplication of a constant vector and a scalar. The complexity of implementation is defined as the required amount of computations like additions. The proposed approach is called minimally redundant parallel (MRP) optimization and is mainly presented in a finite impulse response (FIR) filtering framework to obtain a low-complexity multiplierless implementation. The key idea is to expand the design space using shift inclusive differential coefficients (SIDCs) together with computation reordering using a graph theoretic approach to obtain maximal computation sharing. The problem is formulated using a graph in which vertices and edges represent coefficients and computational cost (number of resources). The multiplierless solution is obtained by solving a set cover problem on the vertices in the graph. A simple polynomial run time algorithm based on a greedy approach is presented. The proposed approach is compared with common-subexpression elimination to show slightly better results and is combined with it for further reduction of complexity. Simulation results show that 50-60% complexity reduction is achieved by only applying the MRP algorithm, and 70% complexity reduction is obtainable by combining it with common-subexpression elimination under a delay constraint of two or three.     

Configurable FFT Processor Using Dynamically Reconfigurable Resource Arrays

This paper presents results of using a Coarse Grain Reconfigurable Architecture called DRRA (Dynamically Reconfigurable Resource Array) for FFT implementations varying in order and degree of parallelism using radix-2 decimation in time (DIT). The DRRA fabric is extended with memory architecture to be able to deal with data-sets much larger than what can be accommodated in the register files of DRRA. The proposed implementation scheme is generic in terms of the number of FFT point, the size of memory and the size of register file in DRRA. Two implementations (DRRA-1 and DRRA-2) have been synthesized in 65 nm technology and energy/delay numbers measured with post-layout annotated gate level simulations. The results are compared to other Coarse Grain Reconfigurable Architectures (CGRAs), and dedicated FFT processors for 1024 and 2048 point FFT. For 1024 point FFT, in terms of FFT operations per unit energy, DRRA-1 and DRRA-2 outperforms all CGRA by at least 2× and is worse than ASIC by 3.45×. However, in terms of energy-delay product DRRA-2 outperforms CGRAs by at least 1.66× and dedicated FFT processors by at least 10.9×. For 2048-point FFT, DRRA-1 and DRRA-2 are 10× better for energy efficiency and 94.84 better for energy-delay product. However, radix-2 implementation is worse by 9.64× and 255× in terms of energy efficiency and energy-delay product when compared against a radix-2⁴ implementation.

     

Edge-Node-Aware Adaptive Data Processing Framework for Smart Grid

Wireless Personal Communications - Smart grid is an autonomous power generation and production system, that includes various energy management sub-systems such as energy efficient resources, smart...     

Wireless LAN Access Point Placement Based on User Mobility

In a wide area campus, a university provides Wireless Local Area Network (WLAN) for users to connect to the Internet. Most users take advantage of this WLAN benefit by using their laptops. However, the number of smart phone users is growing fast. Since a smart phone is able to get an Internet connection using WLAN, users can use their smart phones without having to pay for a cellular operator. Users tend to use their smart phones more, due to their higher mobility compared to a laptop. This capability enables new services in the market, such as Fixed-Mobile Convergence (FMC), which integrates a fixed network (traditional telephony, WLAN) and a mobile network (cellular) to provide seamless voice communications anytime, anywhere. These new applications require a WLAN connection availability nearly everywhere. However, due to limited budgets, a university can only install APs in places with a high connection demand. We propose a novel WLAN AP placement technique that takes user mobility into consideration. This new approach is more complete than previous approaches, which mainly focus on coverage area and throughput data. Our technique has been implemented in our university. The results show the suitability of the WLAN access point locations in our university campus based on user mobility and activities.