Abstract: Digital images are widely used in computer
applications. To store or transmit the uncompressed images
requires considerable storage capacity and transmission bandwidth.
Image compression is a means to perform transmission or storage of
visual data in the most economical way. This paper explains about
how images can be encoded to be transmitted in a multiplexing
time-frequency domain channel. Multiplexing involves packing
signals together whose representations are compact in the working
domain. In order to optimize transmission resources each 4 × 4
pixel block of the image is transformed by a suitable polynomial
approximation, into a minimal number of coefficients. Less than
4 × 4 coefficients in one block spares a significant amount of
transmitted information, but some information is lost. Different
approximations for image transformation have been evaluated as
polynomial representation (Vandermonde matrix), least squares +
gradient descent, 1-D Chebyshev polynomials, 2-D Chebyshev
polynomials or singular value decomposition (SVD). Results have
been compared in terms of nominal compression rate (NCR),
compression ratio (CR) and peak signal-to-noise ratio (PSNR)
in order to minimize the error function defined as the difference
between the original pixel gray levels and the approximated
polynomial output. Polynomial coefficients have been later encoded
and handled for generating chirps in a target rate of about two
chirps per 4 × 4 pixel block and then submitted to a transmission
multiplexing operation in the time-frequency domain.
Abstract: We model and simulate the combined effect of fiber
dispersion and frequency chirp of a directly modulated high-speed
laser diode on the figures of merit of a non-amplified 40-Gbps optical
fiber link. We consider both the return to zero (RZ) and non-return to
zero (NRZ) patterns of the pseudorandom modulation bits. The
performance of the fiber communication system is assessed by the
fiber-length limitation due to the fiber dispersion. We study the
influence of replacing standard single-mode fibers by non-zero
dispersion-shifted fibers on the maximum fiber length and evaluate
the associated power penalty. We introduce new dispersion
tolerances for 1-dB power penalty of the RZ and NRZ 40-Gbps
optical fiber links.
Abstract: This paper studied the CSS-based indoor localization system which is easy to implement, inexpensive to compose the systems, additionally CSS-based indoor localization system covers larger area than other system. However, this system has problem which is affected by reflected distance data. This problem in localization is caused by the multi-path effect. Error caused by multi-path is difficult to be corrected because the indoor environment cannot be described. In this paper, in order to solve the problem by multi-path, we have supplemented the localization system by using pattern matching method based on extended database. Thereby, this method improves precision of estimated. Also this method is verified by experiments in gymnasium. Database was constructed by 1m intervals, and 16 sample data were collected from random position inside the region of DB points. As a result, this paper shows higher accuracy than existing method through graph and table.
Abstract: Video streaming over lossy IP networks is very
important issues, due to the heterogeneous structure of networks.
Infrastructure of the Internet exhibits variable bandwidths, delays,
congestions and time-varying packet losses. Because of variable
attributes of the Internet, video streaming applications should not
only have a good end-to-end transport performance but also have a
robust rate control, furthermore multipath rate allocation mechanism.
So for providing the video streaming service quality, some other
components such as Bandwidth Estimation and Adaptive Rate
Controller should be taken into consideration. This paper gives an
overview of video streaming concept and bandwidth estimation tools
and then introduces special architectures for bandwidth adaptive
video streaming. A bandwidth estimation algorithm – pathChirp,
Optimized Rate Controllers and Multipath Rate Allocation Algorithm
are considered as all-in-one solution for video streaming problem.
This solution is directed and optimized by a decision center which is
designed for obtaining the maximum quality at the receiving side.
Abstract: An exploration in the competency of the optical
multilevel Mapping Multiplexing Technique (MMT) system in
tolerating to the impact of nonlinearities as Self Phase Modulation
(SPM) during the presence of dispersion compensation methods. The
existence of high energy pulses stimulates deterioration in the chirp
compression process attained by SPM which introduces an upper
power boundary limit. An evaluation of the post and asymmetric prepost
fiber compensation methods have been deployed on the MMT
system compared with others of the same bit rate modulation formats.
The MMT 40 Gb/s post compensation system has 1.4 dB
enhancements to the 40 Gb/s 4-Arysystem and less than 3.9 dB
penalty compared to the 40 Gb/s OOK-RZsystem. However, the
optimized Pre-Post asymmetric compensation has an enhancement of
4.6 dB compared to the Post compensation MMT configuration for a
30% pre compensation dispersion.
Abstract: Precise frequency estimation methods for pulseshaped echoes are a prerequisite to determine the relative velocity between sensor and reflector. Signal frequencies are analysed using three different methods: Fourier Transform, Chirp ZTransform and the MUSIC algorithm. Simulations of echoes are performed varying both the noise level and the number of reflecting points. The superposition of echoes with a random initial phase is found to influence the precision of frequency estimation severely for FFT and MUSIC. The standard deviation of the frequency using FFT is larger than for MUSIC. However, MUSIC is more noise-sensitive. The distorting effect of superpositions is less pronounced in experimental data.
Abstract: Due to its capability to resist jamming signals, chirp
spread spectrum (CSS) technique has attracted much attention in
the area of wireless communications. However, there has been little
rigorous analysis for the performance of the CSS communication
system in jamming environments. In this paper, we present analytic
results on the performance of a CSS system by deriving symbol
error rate (SER) expressions for a CSS M-ary phase shift keying
(MPSK) system in the presence of broadband and tone jamming
signals, respectively. The numerical results show that the empirical
SER closely agrees with the analytic result.
Abstract: In a chirp spread spectrum (CSS) system, the overlap
technique is used for increasing bit rate. More overlaps can offer
higher data throughput; however, they may cause more intersymbol
interference (ISI) at the same time, resulting in serious bit error
rate (BER) performance degradation. In this paper, we perform the
BER analysis and derive a closed form BER expression for the
overlap-based CSS system. The derived BER expression includes
the number of overlaps as a parameter, and thus, would be very
useful in determining the number of overlaps for a specified BER.
The numerical results demonstrate that the BER derived in a closed
form closely agrees with the simulated BER.
Abstract: A new estimator for evolutionary spectrum (ES) based
on short time Fourier transform (STFT) and modified group delay
function (MGDF) by signal decomposition (SD) is proposed. The
STFT due to its built-in averaging, suppresses the cross terms and the
MGDF preserves the frequency resolution of the rectangular window
with the reduction in the Gibbs ripple. The present work overcomes
the magnitude distortion observed in multi-component non-stationary
signals with STFT and MGDF estimation of ES using SD. The SD is
achieved either through discrete cosine transform based harmonic
wavelet transform (DCTHWT) or perfect reconstruction filter banks
(PRFB). The MGDF also improves the signal to noise ratio by
removing associated noise. The performance of the present method is
illustrated for cross chirp and frequency shift keying (FSK) signals,
which indicates that its performance is better than STFT-MGDF
(STFT-GD) alone. Further its noise immunity is better than STFT.
The SD based methods, however cannot bring out the frequency
transition path from band to band clearly, as there will be gap in the
contour plot at the transition. The PRFB based STFT-SD shows good
performance than DCTHWT decomposition method for STFT-GD.
Abstract: Synthetic aperture radar (SAR) imaging usually
requires echo data collected continuously pulse by pulse with certain
bandwidth. However in real situation, data collection or part of signal
spectrum can be interrupted due to various reasons, i.e. there will be
gaps in spatial spectrum. In this case we need to find ways to fill out
the resulted gaps and get image with defined resolution. In this paper
we introduce our work on how to apply iterative spatially variant
apodization (Super-SVA) technique to extrapolate the spatial
spectrum in both azimuthal and range directions so as to fill out the
gaps and get correct radar image.
Abstract: With optimized bandwidth and latency discrepancy ratios, Node Gain Scores (NGSs) are determined and used as a basis for shaping the max-heap overlay. The NGSs - determined as the respective bandwidth-latency-products - govern the construction of max-heap-form overlays. Each NGS is earned as a synergy of discrepancy ratio of the bandwidth requested with respect to the estimated available bandwidth, and latency discrepancy ratio between the nodes and the source node. The tree leads to enhanceddelivery overlay multicasting – increasing packet delivery which could, otherwise, be hindered by induced packet loss occurring in other schemes not considering the synergy of these parameters on placing the nodes on the overlays. The NGS is a function of four main parameters – estimated available bandwidth, Ba; individual node's requested bandwidth, Br; proposed node latency to its prospective parent (Lp); and suggested best latency as advised by source node (Lb). Bandwidth discrepancy ratio (BDR) and latency discrepancy ratio (LDR) carry weights of α and (1,000 - α ) , respectively, with arbitrary chosen α ranging between 0 and 1,000 to ensure that the NGS values, used as node IDs, maintain a good possibility of uniqueness and balance between the most critical factor between the BDR and the LDR. A max-heap-form tree is constructed with assumption that all nodes possess NGS less than the source node. To maintain a sense of load balance, children of each level's siblings are evenly distributed such that a node can not accept a second child, and so on, until all its siblings able to do so, have already acquired the same number of children. That is so logically done from left to right in a conceptual overlay tree. The records of the pair-wise approximate available bandwidths as measured by a pathChirp scheme at individual nodes are maintained. Evaluation measures as compared to other schemes – Bandwidth Aware multicaSt architecturE (BASE), Tree Building Control Protocol (TBCP), and Host Multicast Tree Protocol (HMTP) - have been conducted. This new scheme generally performs better in terms of trade-off between packet delivery ratio; link stress; control overhead; and end-to-end delays.
Abstract: Fractional Fourier Transform is a generalization of the classical Fourier Transform which is often symbolized as the rotation in time- frequency plane. Similar to the product of time and frequency span which provides the Uncertainty Principle for the classical Fourier domain, there has not been till date an Uncertainty Principle for the Fractional Fourier domain for a generalized class of finite energy signals. Though the lower bound for the product of time and Fractional Fourier span is derived for the real signals, a tighter lower bound for a general class of signals is of practical importance, especially for the analysis of signals containing chirps. We hence formulate a mathematical derivation that gives the lower bound of time and Fractional Fourier span product. The relation proves to be utmost importance in taking the Fractional Fourier Transform with adaptive time and Fractional span resolutions for a varied class of complex signals.
Abstract: This paper is concerned with studying the forgetting factor of the recursive least square (RLS). A new dynamic forgetting factor (DFF) for RLS algorithm is presented. The proposed DFF-RLS is compared to other methods. Better performance at convergence and tracking of noisy chirp sinusoid is achieved. The control of the forgetting factor at DFF-RLS is based on the gradient of inverse correlation matrix. Compared with the gradient of mean square error algorithm, the proposed approach provides faster tracking and smaller mean square error. In low signal-to-noise ratios, the performance of the proposed method is superior to other approaches.
Abstract: In this work we study the reflection of circularly
polarised light from a nano-structured biological material found in
the exocuticle of scarabus beetles. This material is made of a stack
of ultra-thin (~5 nm) uniaxial layers arranged in a left-handed
helicoidal stack, which resonantly reflects circularly polarized light.
A chirp in the layer thickness combined with a finite absorption
coefficient produce a broad smooth reflectance spectrum. By
comparing model calculations and electron microscopy with
measured spectra we can explain our observations and quantify most
relevant structural parameters.
Abstract: In this paper, based on the coupled-mode and carrier rate equations, derivation of a dynamic model and numerically analysis of a MQW chirped DFB-SOA all-optical flip-flop is done precisely. We have analyzed the effects of strains of QW and MQW and cross phase modulation (XPM) on the dynamic response, and rise and fall times of the DFB-SOA all optical flip flop. We have shown that strained MQW active region in under an optimized condition into a DFB-SOA with chirped grating can improve the switching ON speed limitation in such a of the device, significantly while the fall time is increased. The values of the rise times for such an all optical flip-flop, are obtained in an optimized condition, areas tr=255ps.