Abstract: This paper presents a new compact analytical model of
the gate leakage current in high-k based nano scale MOSFET by
assuming a two-step inelastic trap-assisted tunneling (ITAT) process
as the conduction mechanism. This model is based on an inelastic
trap-assisted tunneling (ITAT) mechanism combined with a semiempirical
gate leakage current formulation in the BSIM 4 model. The
gate tunneling currents have been calculated as a function of gate
voltage for different gate dielectrics structures such as HfO2, Al2O3
and Si3N4 with EOT (equivalent oxide thickness) of 1.0 nm. The
proposed model is compared and contrasted with santaurus
simulation results to verify the accuracy of the model and excellent
agreement is found between the analytical and simulated data. It is
observed that proposed analytical model is suitable for different highk
gate dielectrics simply by adjusting two fitting parameters. It was
also shown that gate leakages reduced with the introduction of high-k
gate dielectric in place of SiO2.
Abstract: In this paper, the periodic surveillance scheme has
been proposed for any convex region using mobile wireless sensor
nodes. A sensor network typically consists of fixed number of
sensor nodes which report the measurements of sensed data such as
temperature, pressure, humidity, etc., of its immediate proximity
(the area within its sensing range). For the purpose of sensing an
area of interest, there are adequate number of fixed sensor
nodes required to cover the entire region of interest. It implies
that the number of fixed sensor nodes required to cover a given
area will depend on the sensing range of the sensor as well as
deployment strategies employed. It is assumed that the sensors to
be mobile within the region of surveillance, can be mounted on
moving bodies like robots or vehicle. Therefore, in our
scheme, the surveillance time period determines the number of
sensor nodes required to be deployed in the region of interest.
The proposed scheme comprises of three algorithms namely:
Hexagonalization, Clustering, and Scheduling, The first algorithm
partitions the coverage area into fixed sized hexagons that
approximate the sensing range (cell) of individual sensor node.
The clustering algorithm groups the cells into clusters, each of
which will be covered by a single sensor node. The later
determines a schedule for each sensor to serve its respective cluster.
Each sensor node traverses all the cells belonging to the cluster
assigned to it by oscillating between the first and the last cell for
the duration of its life time. Simulation results show that our
scheme provides full coverage within a given period of time using
few sensors with minimum movement, less power consumption,
and relatively less infrastructure cost.
Abstract: Aggressive scaling of MOS devices requires use of ultra-thin gate oxides to maintain a reasonable short channel effect and to take the advantage of higher density, high speed, lower cost etc. Such thin oxides give rise to high electric fields, resulting in considerable gate tunneling current through gate oxide in nano regime. Consequently, accurate analysis of gate tunneling current is very important especially in context of low power application. In this paper, a simple and efficient analytical model has been developed for channel and source/drain overlap region gate tunneling current through ultra thin gate oxide n-channel MOSFET with inevitable deep submicron effect (DSME).The results obtained have been verified with simulated and reported experimental results for the purpose of validation. It is shown that the calculated tunnel current is well fitted to the measured one over the entire oxide thickness range. The proposed model is suitable enough to be used in circuit simulator due to its simplicity. It is observed that neglecting deep sub-micron effect may lead to large error in the calculated gate tunneling current. It is found that temperature has almost negligible effect on gate tunneling current. It is also reported that gate tunneling current reduces with the increase of gate oxide thickness. The impact of source/drain overlap length is also assessed on gate tunneling current.
Abstract: Rotation or tilt present in an image capture by digital
means can be detected and corrected using Artificial Neural Network
(ANN) for application with a Face Recognition System (FRS). Principal
Component Analysis (PCA) features of faces at different angles
are used to train an ANN which detects the rotation for an input image
and corrected using a set of operations implemented using another
system based on ANN. The work also deals with the recognition
of human faces with features from the foreheads, eyes, nose and
mouths as decision support entities of the system configured using
a Generalized Feed Forward Artificial Neural Network (GFFANN).
These features are combined to provide a reinforced decision for
verification of a person-s identity despite illumination variations. The
complete system performing facial image rotation detection, correction
and recognition using re-enforced decision support provides a
success rate in the higher 90s.
Abstract: Data gathering is an essential operation in wireless
sensor network applications. So it requires energy efficiency
techniques to increase the lifetime of the network. Similarly,
clustering is also an effective technique to improve the energy
efficiency and network lifetime of wireless sensor networks. In this
paper, an energy efficient cluster formation protocol is proposed with
the objective of achieving low energy dissipation and latency without
sacrificing application specific quality. The objective is achieved by
applying randomized, adaptive, self-configuring cluster formation
and localized control for data transfers. It involves application -
specific data processing, such as data aggregation or compression.
The cluster formation algorithm allows each node to make
independent decisions, so as to generate good clusters as the end.
Simulation results show that the proposed protocol utilizes minimum
energy and latency for cluster formation, there by reducing the
overhead of the protocol.
Abstract: A synchronous network-on-chip using wormhole packet switching
and supporting guaranteed-completion best-effort with low-priority (LP)
and high-priority (HP) wormhole packet delivery service is presented in
this paper. Both our proposed LP and HP message services deliver a good
quality of service in term of lossless packet completion and in-order message
data delivery. However, the LP message service does not guarantee minimal
completion bound. The HP packets will absolutely use 100% bandwidth of
their reserved links if the HP packets are injected from the source node with
maximum injection. Hence, the service are suitable for small size messages
(less than hundred bytes). Otherwise the other HP and LP messages, which
require also the links, will experience relatively high latency depending on the
size of the HP message. The LP packets are routed using a minimal adaptive
routing, while the HP packets are routed using a non-minimal adaptive routing
algorithm. Therefore, an additional 3-bit field, identifying the packet type,
is introduced in their packet headers to classify and to determine the type
of service committed to the packet. Our NoC prototypes have been also
synthesized using a 180-nm CMOS standard-cell technology to evaluate the
cost of implementing the combination of both services.
Abstract: A model based fault detection and diagnosis
technique for DC motor is proposed in this paper. Fault detection
using Kalman filter and its different variants are compared. Only
incipient faults are considered for the study. The Kalman Filter
iterations and all the related computations required for fault detection
and fault confirmation are presented. A second order linear state
space model of DC motor is used for this work. A comparative
assessment of the estimates computed from four different observers
and their relative performance is evaluated.
Abstract: Repeated observation of a given area over time yields
potential for many forms of change detection analysis. These
repeated observations are confounded in terms of radiometric
consistency due to changes in sensor calibration over time,
differences in illumination, observation angles and variation in
atmospheric effects.
This paper demonstrates applicability of an empirical relative
radiometric normalization method to a set of multitemporal cloudy
images acquired by Resourcesat1 LISS III sensor. Objective of this
study is to detect and remove cloud cover and normalize an image
radiometrically. Cloud detection is achieved by using Average
Brightness Threshold (ABT) algorithm. The detected cloud is
removed and replaced with data from another images of the same
area. After cloud removal, the proposed normalization method is
applied to reduce the radiometric influence caused by non surface
factors. This process identifies landscape elements whose reflectance
values are nearly constant over time, i.e. the subset of non-changing
pixels are identified using frequency based correlation technique. The
quality of radiometric normalization is statistically assessed by R2
value and mean square error (MSE) between each pair of analogous
band.
Abstract: A concept of switched beam antennas consisting of
2×2 rectangular array spaced by λ/4 accompanied with a null locating
has been proposed in the previous work. In this letter, the
performance evaluations of its prototype are presented. The benefits
of using proposed system have been clearly measured in term of
signal quality, throughput and delays. Also, the impact of position
shift which mesh router is not located on the expected beam direction
has also been investigated.
Abstract: This paper proposes an improved approach based on
conventional particle swarm optimization (PSO) for solving an
economic dispatch(ED) problem with considering the generator
constraints. The mutation operators of the differential evolution (DE)
are used for improving diversity exploration of PSO, which called
particle swarm optimization with mutation operators (PSOM). The
mutation operators are activated if velocity values of PSO nearly to
zero or violated from the boundaries. Four scenarios of mutation
operators are implemented for PSOM. The simulation results of all
scenarios of the PSOM outperform over the PSO and other existing
approaches which appeared in literatures.
Abstract: Many corporations are seriously concerned about
security of networks and therefore, their network supervisors are still
reluctant to install WLANs. In this regards, the IEEE802.11i standard
was developed to address the security problems, even though the
mistrust of the wireless LAN technology is still existing. The thought
was that the best security solutions could be found in open standards
based technologies that can be delivered by Virtual Private
Networking (VPN) being used for long time without addressing any
security holes for the past few years. This work, addresses this issue
and presents a simulated wireless LAN of IEEE802.11g protocol, and
analyzes impact of integrating Virtual Private Network technology to
secure the flow of traffic between the client and the server within the
LAN, using OPNET WLAN utility. Two Wireless LAN scenarios
have been introduced and simulated. These are based on normal
extension to a wired network and VPN over extension to a wired
network. The results of the two scenarios are compared and indicate
the impact of improving performance, measured by response time
and load, of Virtual Private Network over wireless LAN.
Abstract: Mobile WiMAX is a broadband wireless solution that
enables convergence of mobile and fixed broadband networks
through a common wide area broadband radio access technology and
flexible network architecture. It adopts Orthogonal Frequency
Division Multiple Access (OFDMA) for improved multi-path
performance in Non-Line-Of-Sight (NLOS) environments. Scalable
OFDMA (SOFDMA) is introduced in the IEEE 802e[1]. WIMAX
system uses one of different types of channel coding but The
mandatory channel coding scheme is based on binary nonrecursive
Convolutional Coding (CC). There are other several optional channel
coding schemes such as block turbo codes, convolutional turbo
codes, and low density parity check (LDPC).
In this paper a comparison between the performance of WIMAX
using turbo code and using convolutional product code (CPC) [2] is
made. Also a combination between them had been done. The CPC
gives good results at different SNR values compared to both the
turbo system, and the combination between them. For example, at
BER equal to 10-2 for 128 subcarriers, the amount of improvement
in SNR equals approximately 3 dB higher than turbo code and equals
approximately 2dB higher than the combination respectively. Several
results are obtained at different modulating schemes (16QAM and
64QAM) and different numbers of sub-carriers (128 and 512).
Abstract: In this paper, we present an experimental testing for
a new algorithm that determines an optimal controller-s coefficients
for output variance reduction related to Linear Time Invariant (LTI)
Systems. The algorithm features simplicity in calculation, generalization
to minimal and non-minimal phase systems, and could be
configured to achieve reference tracking as well as variance reduction
after compromising with the output variance. An experiment of DCmotor
velocity control demonstrates the application of this new
algorithm in designing the controller. The results show that the
controller achieves minimum variance and reference tracking for a
preset velocity reference relying on an identified model of the motor.
Abstract: The direct implementation of interleaver functions
in WiMAX is not hardware efficient due to presence of complex
functions. Also the conventional method i.e. using memories for
storing the permutation tables is silicon consuming. This work
presents a 2-D transformation for WiMAX channel interleaver
functions which reduces the overall hardware complexity to
compute the interleaver addresses on the fly. A fully reconfigurable
architecture for address generation in WiMAX
channel interleaver is presented, which consume 1.1 k-gates in
total. It can be configured for any block size and any modulation
scheme in WiMAX. The presented architecture can run at a
frequency of 200 MHz, thus fully supporting high bandwidth
requirements for WiMAX.
Abstract: Routing security is a major concerned in Wireless
Sensor Network since a large scale of unattended nodes is deployed
in ad hoc fashion with no possibility of a global addressing due to a
limitation of node-s memory and the node have to be self organizing
when the systems require a connection with the other nodes. It
becomes more challenging when the nodes have to act as the router
and tightly constrained on energy and computational capabilities
where any existing security mechanisms are not allowed to be fitted
directly. These reasons thus increasing vulnerabilities to the network
layer particularly and to the whole network, generally. In this paper,
a Dynamic Window Secured Implicit Geographic Forwarding
(DWSIGF) routing is presented where a dynamic time is used for
collection window to collect Clear to Send (CTS) control packet in
order to find an appropriate hoping node. The DWIGF is expected to
minimize a chance to select an attacker as the hoping node that
caused by a blackhole attack that happen because of the CTS rushing
attack, which promise a good network performance with high packet
delivery ratios.
Abstract: techniques are examined to overcome the
performance degradation caused by the channel dispersion using
slow frequency hopping (SFH) with dynamic frequency hopping
(DFH) pattern adaptation. In DFH systems, the frequency slots are
selected by continuous quality monitoring of all frequencies available
in a system and modification of hopping patterns for each individual
link based on replacing slots which its signal to interference ratio
(SIR) measurement is below a required threshold. Simulation results
will show the improvements in BER obtained by DFH in comparison
with matched frequency hopping (MFH), random frequency hopping
(RFH) and multi-carrier code division multiple access (MC-CDMA)
in multipath slowly fading dispersive channels using a generalized
bandpass two-path transfer function model, and will show the
improvement obtained according to the threshold selection.
Abstract: Transmission network expansion planning (TNEP) is
a basic part of power system planning that determines where, when
and how many new transmission lines should be added to the
network. Up till now, various methods have been presented to solve
the static transmission network expansion planning (STNEP)
problem. But in all of these methods, transmission expansion
planning considering network adequacy restriction has not been
investigated. Thus, in this paper, STNEP problem is being studied
considering network adequacy restriction using discrete particle
swarm optimization (DPSO) algorithm. The goal of this paper is
obtaining a configuration for network expansion with lowest
expansion cost and a specific adequacy. The proposed idea has been
tested on the Garvers network and compared with the decimal
codification genetic algorithm (DCGA). The results show that the
network will possess maximum efficiency economically. Also, it is
shown that precision and convergence speed of the proposed DPSO
based method for the solution of the STNEP problem is more than
DCGA approach.
Abstract: A new distance-adjusted approach is proposed in
which static square contours are defined around an estimated
symbol in a QAM constellation, which create regions that
correspond to fixed step sizes and weighting factors. As a
result, the equalizer tap adjustment consists of a linearly
weighted sum of adaptation criteria that is scaled by a variable
step size. This approach is the basis of two new algorithms: the
Variable step size Square Contour Algorithm (VSCA) and the
Variable step size Square Contour Decision-Directed
Algorithm (VSDA). The proposed schemes are compared with
existing blind equalization algorithms in the SCA family in
terms of convergence speed, constellation eye opening and
residual ISI suppression. Simulation results for 64-QAM
signaling over empirically derived microwave radio channels
confirm the efficacy of the proposed algorithms. An RTL
implementation of the blind adaptive equalizer based on the
proposed schemes is presented and the system is configured to
operate in VSCA error signal mode, for square QAM signals
up to 64-QAM.
Abstract: A new observer based fault detection and diagnosis
scheme for predicting induction motors- faults is proposed in this
paper. Prediction of incipient faults, using different variants of
Kalman filter and their relative performance are evaluated. Only soft
faults are considered for this work. The data generation, filter
convergence issues, hypothesis testing and residue estimates are
addressed. Simulink model is used for data generation and various
types of faults are considered. A comparative assessment of the
estimates of different observers associated with these faults is
included.
Abstract: This paper investigates the performance of a speech
recognizer in an interactive voice response system for various coded
speech signals, coded by using a vector quantization technique namely
Multi Switched Split Vector Quantization Technique. The process of
recognizing the coded output can be used in Voice banking application.
The recognition technique used for the recognition of the coded speech
signals is the Hidden Markov Model technique. The spectral distortion
performance, computational complexity, and memory requirements of
Multi Switched Split Vector Quantization Technique and the
performance of the speech recognizer at various bit rates have been
computed. From results it is found that the speech recognizer is
showing better performance at 24 bits/frame and it is found that the
percentage of recognition is being varied from 100% to 93.33% for
various bit rates.