Algebraic integer architecture with minimum adder count for the 2-D Daubechies 4-tap filters banks

A multiplierless architecture based on algebraic integer representation for computing the Daubechies 4-tap wavelet transform for 1-D/2-D signal processing is proposed. This architecture improves on previous designs in a sense that it minimizes the number of parallel 2-input adder circuits. The algorithm was achieved using numerical optimization based o exhaustive search over the algebraic integer representation. The proposed architecture furnishes exact computation up to the final reconstruction step, which is the operation that maps the exactly computed filtered results from algebraic integer representation to fixed-point. Compared to Madishetty et al. (IEEE Trans Circuits Syst I (Accepted, In Press), 2012a), this architecture shows a reduction of \(10\cdot n-3\) adder circuits, where \(n\) is the number of wavelet decomposition levels. Standard \(512\times 512\) images Mandrill, Lena, and Cameraman were submitted to digital realizations of both proposed algebraic integer based as well as fixed-point schemes, leading to quantifiable comparisons. The design is physically implemented for a 4-level 2-D decomposition using a Xilinx Virtex-6 vcx240t-1ff1156 FPGA device operating at up to a maximum clock frequency of 263.15 MHz. The FPGA implementation is tested using hardware co-simulation using an ML605 board with clock of 100 MHz. A 45 nm CMOS synthesis shows improved clock frequency of better than 500 MHz for a supply voltage of 1.1 V.     

VAD Based on Kernel Smoothed Function of EGARCH Models

An algorithm for a voice activity detector (VAD) is proposed. It is based on the exponential generalized autoregressive conditional heteroscedasticity (EGARCH) filter for generalized hyperbolic (GH), Gaussian random variables, adaptive threshold values and autocorrelation coefficients. EGARCH models are a new variation of GARCH models used especially in economic time series. A speech signal is assumed to have a GH because GH has heavier tails than the Gaussian distribution (GD) covering other heavy tailed distributions like hyperbolic, skewed $t$ , variance gamma (VG), inverse Gaussian (NIG), Cauchy, Student’s $t$ and Laplace distributions. The distribution of noise signal is assumed to be uncorrelated (white noise), but in general, that is not necessary. In the proposed method, heteroscedasticity is modeled by EGARCH. A kernel smoothed function of conditional variances and autocorrelations generate the soft detection vector. Finally, hard detection is the result of comparing the soft detection vector with an adaptive threshold value. The simulation results show that the proposed VAD is able to operate down to $-5$  dB.     

Robust time-frequency distributions based on the robust short time fourier transform

Design of time-frequency distributions (Tfds) that are robust to the impulse noise influence is considered. The robustTfds based on the robust short-time Fourier transform (Stft) are proposed. An efficient procedure to evaluate the robustStft is given. RobustTfds based on the robustStft have better energy concentration around the signal instantaneous frequency (If) than the robustStft itself. Also, theseTfds are more resistant to higher impulse noise than the robustTfds obtained using the local autocorrelation function (Laf) based minimization problem.     

Parametric Analysis of a Novel Architecture of Phase Locked Loop for Communication System

The work proposed parametric analysis of a novel architecture of phase locked loop (PLL) for pure signal synthesis. It has been widely used in wireless communication systems due to the high frequency resolution and the short locking time. First, we presented a mathematical and accurate model of noise in PLL with take into account noise of its component. Then we predicted output phase noise in term of its parameters. Finally, we described as effective technique for noise in fractional PLL by CppSim simulator. The output phase noise has been reduced from \(-154\) to \(-159\,\) dBc/MHz at 20 MHz offset. The proposed behavioral simulation results show improvement around 5 dBc/MHz. In future, this technique can also be implemented in hybrid PLL.     

A Novel Haar Wavelet-Based BPSK OFDM System Robust to Spectral Null Channels and with Reduced PAPR

Orthogonal frequency-division multiplexing (OFDM) has lately gained a great deal of attention and is considered as a strong candidate for many next-generation wireless communication systems. However, OFDM is very sensitive to nonlinear effects due to the high peak-to-average power ratio (PAPR) owned by the transmitted signals and does not show robustness to spectral null channels. This paper proposes a novel BPSK OFDM system based on Haar wavelet transformation. The Haar wavelet transformation operates decomposition over the data symbol sequence after binary-to-complex mapping shows that half of the data symbols are zeros and the rest are either ${\sqrt{2}}$ or ${-\sqrt{2}}$ . Then, we have the PAPR reduced by ${10\log_{10} 2\approx 3}$ ?dB at most, compared with the conventional OFDM system. We also propose a novel decoding algorithm for the proposed OFDM system to show robustness to spectral null channels, and derive the bit error rate (BER) performance in theory from unbalanced QPSK modulation. Finally, we compare BER performance of our proposed OFDM with the conventional OFDM over different channels to show the excellent performance of our proposed OFDM system.     

Image distortion analysis based on normalized perceptual information distance

Image distortion analysis is a fundamental issue in many image processing problems, including compression, restoration, recognition, classification, and retrieval. Traditional image distortion evaluation approaches tend to be heuristic and are often limited to specific application environment. In this work, we investigate the problem of image distortion measurement based on the theory of Kolmogorov complexity, which has rarely been studied in the context of image processing. This work is motivated by the normalized information distance (NID) measure that has been shown to be a valid and universal distance metric applicable to similarity measurement of any two objects (Li et al. in IEEE Trans Inf Theory 50:3250–3264, 2004). Similar to Kolmogorov complexity, NID is non-computable. A useful practical solution is to approximate it using normalized compression distance (NCD) (Li et al. in IEEE Trans Inf Theory 50:3250–3264, 2004), which has led to impressive results in many applications such as construction of phylogeny trees using DNA sequences (Li et al. in IEEE Trans Inf Theory 50:3250–3264, 2004). In our earlier work, we showed that direct use of NCD on image processing problems is difficult and proposed a normalized conditional compression distance (NCCD) measure (Nikvand and Wang, 2010), which has significantly wider applicability than existing image similarity/distortion measures. To assess the distortions between two images, we first transform them into the wavelet transform domain. Assuming stationarity and good decorrelation of wavelet coefficients beyond local regions and across wavelet subbands, the Kolmogorov complexity may be approximated using Shannon entropy (Cover et al. in Elements of information theory. Wiley-Interscience, New York, 1991). Inspired by Sheikh and Bovik (IEEE Trans Image Process 15(2):430–444, 2006), we adopt a Gaussian scale mixture model for clusters of neighboring wavelet coefficients and a Gaussian channel model for the noise distortions in the human visual system. Combining these assumptions with the NID framework, we derive a novel normalized perceptual information distance measure, where maximal likelihood estimation and least square regression are employed for parameter fitting. We validate the proposed distortion measure using three large-scale, publicly available, and subject-rated image databases, which include a wide range of practical image distortion types and levels. Our results demonstrate the good prediction power of the proposed method for perceptual image distortions.     

LDPC-based space-time coded OFDM systems: Turbo-EM receiver design with channel state information guessing algorithms

In this paper we study some turbo receiver architectures employing low-density parity check (Ldpc) codes together with orthogonal frequency division multiplexing (Ofdm) for high data rate wireless transmissions. Different demodulation schemes based on expectation-maximization (Em) algorithm are studied along with the channel impulse response (Em) algorithms. We studied differentCir guessing algorithms including the EM-based algorithms such as a space-alternating generalized expectation-maximization algorithm (Sage). It is shown that the proposed turbo-Em receiver employing a soft maximum a posteriori (Map)Em demodulator and a belief propagationLdpc decoder can perform within 1 dB from the ergodic capacity of the studiedMimo ofdm channels. Besides, we find that a suboptimum structure based on a soft interference cancellationMmse filtering demodulator exhibits negligible loss in non-correlated fadingMimo channels but suffer extra performance loss in highly correlatedMimo channels.     

A new approach to the design of biorthogonal triplet half-band filter banks using generalized half-band polynomials

This paper presents a novel approach to design a class of biorthogonal triplet half-band filter banks based on the generalized half-band polynomials. The filter banks are designed with the help of three-step lifting scheme (using three kernels). The generalized half-band polynomial is used to construct these three kernels by imposing the number of zeros at \(z=-1\) . The maximum number of zeros imposed for the three kernels is half of the order of half-band polynomial ( \(K/2\) for \(K\) order polynomial). The three kernels give a set of constraints on the coefficients of half-band polynomial by imposing the zeros. In addition to structural perfect reconstruction and linear phase, the proposed filter banks provide better frequency selectivity, more similarity between analysis and synthesis filters (measure of near-orthogonality), and good time–frequency localization. The proposed technique offers more flexibility in the design of filters using two degrees of freedom. Some examples have been presented to illustrate the method.     

Comments on “The fractional Laplace transform”

In Sharma (SIViP 4:377–379, 2010) a fractional Laplace transform assumed to generalize the fractional Fourier transform was proposed. Here, it is shown that its region of convergence degenerates to the imaginary axis. So it is not a generalization of the fractional Fourier transform.     

A MC-CDMA system analysis in a software radio context

This paper presents a Multi-Carrier Code Division Multiple Access (Mc-Cdma) system analysis in a software radio context. Based on a combination of multi-carrier modulation and code division multiple access,Mc-Cdma benefits from the main advantages from both schemes: high spectral efficiency, high flexibility, multiple access capabilities, etc. It is firstly shown why, nowadays,Mc-Cdma is undoubtedly a high potential candidate for the air interface of the 4G cellular networks. TheMc-Cdma concept and the block-diagrams of the transmitter and the receiver are presented first. Afterwards, the technical issues concerning the processing devices for the implementation ofMc-Cdma systems in a software radio context are analysed. The advantages and disadvantages of Digital Signal Processors (Dsps) and Field Programmable Gate Arrays (Fgpas) components are discussed. The implementation ofMc-Cdma systems and the integration of signal processing algorithms as Fast Hadamard Transform (Fht) and Inverse Fast Fourier Transform (Ifft) are considered and analysed for the first time. Finally, implementation results with a mixed prototyping board are presented. Then, it is shown that a new combination of the flow graphs ofFht andIfft leads to interesting computation savings and that hardware structures asFgpas are more adapted thanDsps to those intensive computation functions. Finally, for the completeMc-Cdma modem implementation, the necessity of a Co-Design methodology is highlighted in order to obtain the best matching between algorithms and architecture.     

Efficient Reverse Converters for 4-Moduli Sets {2^{2n-1}-1, 2^{n}, 2^{n}+1, 2^{n}-1} and {2^{2n-1}, 2^{2n-1}-1, 2^{n}+1, 2^{n}-1} Based on CRTs Algorithm

Speed and complexity of a reverse converter are two important factors that affect the performance of a residue number system. In this paper, two efficient reverse converters are proposed for the 4-moduli sets {2 \(^{2n-1}-1\) , 2 \(^{n}\) , 2 \(^{n}+1\) , 2 \(^{n}-1\) } and {2 \(^{2n-1}\) , 2 \(^{2n-1}-1\) , 2 \(^{n}+1\) , 2 \(^{n}-1\) } with 5 \(n\) -bit and 6 \(n\) -bit dynamic range, respectively. The proposed reverse converter for moduli set {2 \(^{2n-1}-1\) , 2 \(^{n}\) , 2 \(^{n}+1\) , 2 \(^{n}-1\) } has been designed based on CRT and New CRT-I algorithms and in two-level structure. Also, an efficient reverse converter for moduli set {2 \(^{2n-1}\) , 2 \(^{2n-1}-1\) , 2 \(^{n}+1\) , 2 \(^{n}-1\) } has been designed by applying New CRT-I algorithm. The proposed reverse converters are based on adders and hence can be simply implemented by VLSI circuit technology. The proposed reverse converters offer less delay and hardware cost when compared with the recently introduced reverse converters for the moduli sets {2 \(^{n}+1\) , 2 \(^{n}-1\) ,2 \(^{n}\) , 2 \(^{2n+1}-1\) } and {2 \(^{n}+1\) , 2 \(^{n}-1\) , 2 \(^{2n}\) , 2 \(^{2n+1}-1\) }.     

Positive L_1 Observer Design for Positive Switched Systems

This paper investigates the problem of \(L_1\) observer design for positive switched systems. Firstly, a new kind of positive \(L_1\) observer is proposed for positive switched linear delay-free systems with observable and unobservable subsystems. Based on the average dwell time approach, a sufficient condition is proposed to ensure the existence of the positive \(L_1\) observer. Under the condition obtained, the estimated error converges to zero exponentially, and the \(L_1\) -gain from the disturbance input to the estimated error is less than a prescribed level. Then the proposed design result is extended to positive switched systems with mixed time-varying delays, where the mixed time-varying delays are presented in the form of discrete delay and distributed delay. Finally, two numerical examples are given to demonstrate the feasibility of the obtained results.     

Voltage-mode multifunction filter with mutually independent Q and \omega _0 control feature using VDDDAs

The paper focuses on the application possibilities of the newly presented voltage differencing active building block called voltage differencing differential difference amplifier. Using this active element, a multifunction frequency filter is designed featuring the possibility of mutually independent control of quality factor Q and characteristic frequency \(\omega _0\) by means of active elements. The structure of the filter is based on the idea of the Akerberg-Mossberg (AM) filter, i.e. the integrators in the structure are always realized only by two active elements. This fact results in better phase compensation for the filter. Compared to the AM opamp based filter, the newly proposed structure features high-impedance inputs, low-impedance output, and all basic frequency responses. The performance of the proposed structure has been verified by SPICE simulations using the TSMC \(0.18\,\upmu \hbox {m}\) level-7 SCN018 CMOS process parameters with \(\pm 0.9\,\hbox {V}\) supply voltage.     

Design and performance of a product code turbo encoding-decoding prototype

This paper presents the latest results on a block turbo decoder design. We propose a block turbo decoder circuit for the error protection of small data blocks such asAtm cells on anAwgn (additive white Gaussian noise) channel with a code rate close to 0.5. A prototype was developed atEnst Bretagne. It allowsBer (bit error rate) measurements down to 10^?9 and uses programmable gate arrays (Fpga Xilinx circuits). The elementary extendedBch code and the data block size can be modified to fit specifications of different applications.     

A Wide Tuning Range Voltage Controlled Oscillator with a High Tunable Active Inductor

This paper presents a wide tuning range CMOS voltage controlled oscillator (VCO) with a high-tunable active inductor circuit. In this VCO circuit, the coarse frequency is achieved by tuning the integrated active inductor circuit. The VCO circuit is designed in 0.18  \(\upmu \hbox {m}\) CMOS process and simulated with Cadence Spectra. The simulation results show the frequency tuning range from 120 MHz to 2 GHz resulting in a tuning range of 94 %. The phase noise variation is from \(-\) 80 to \(-\) 90 dBc/Hz at a 1 MHz frequency offset, and output power variation is from \(-\) 4.7 to \(+\) 11.5 dBm. The active inductor power consumption is 2.2 mW and the total power dissipation is 7 mW from a 1.8 V DC power supply. By comparing the proposed VCO circuit with the general VCO topology, the results show that this VCO architecture by using the novel, high-tunable and low power active inductor circuit, presents a better performance regarding low chip size, low power consumption, high tuning range and high output power.     

Parallel interference cancellation efficiency for noisy signals in O-CDMA system

The aim of this paper is to evaluate the robustness of Parallel Interference Cancellation (Pic) to noise contribution for an optical Code Division Multiple Access system. The theoretical expression of thePic error probability is developed in the case of white additive Gaussian noise. From theoretical analysis, we show that, even with noise contribution, thePic receiver outperforms the Conventional Correlation Receiver (Ccr). Moreover, the results highlight that, for a given performance, thePic receiver relaxes not only the constraint on the code length, but also the Signal to Noise Ratio compared toCcr. Particularly, this is proofed in access network context, i.e. 30 users withBer lt; 10^?9.     

Novel Tight Closed-Form Bounds for the Symbol Error Rate of EGC and MRC Diversity Receivers Employing Linear Modulations Over \alpha -\mu Fading

In this paper, we propose novel lower and upper bounds on the average symbol error rate (SER) of the dual-branch maximal-ratio combining and equal-gain combining diversity receivers assuming independent branches. \(M\) -ary pulse amplitude modulation and \(M\) -ary phase shift keying schemes are employed and operation over the \(\alpha -\mu \) fading channel is assumed. The proposed bounds are given in closed form and are very simple to calculate as they are composed of a double finite summation of basic functions that are readily available in the commercial software packages. Furthermore, the proposed bounds are valid for any combination of the parameters \(\alpha \) and \(\mu \) as well as \(M\) . Numerical results presented show that the proposed bounds are very tight when compared to the exact SER obtained via performing the exact integrations numerically making them an attractive much simpler alternative for SER evaluation studies.     

A Novel 2.5–3.1 GHz Wide-Band Low-Noise Amplifier in 0.18 \upmu \hbox {m} CMOS

Aiming for the simultaneous realization of constant gain, accurate input and output impedance matching and minimum noise figure (NF) over a wide frequency range, the circuit topology and detailed design of wide broadband low noise amplifier (LNA) are presented in this paper. A novel 2.5–3.1 GHz wide-band LNA with unique characteristics has been presented. Its design and layout are done by TSMC 0.18  \(\upmu \hbox {m}\) technology. Common gate stage has been used to improve input matching. In order to enhance output matching and reduce the noise as well, a buffer stage is utilized. Mid-stages which tend to improve the gain and reverse isolation are exploited. The proposed LNA achieves a power gain of 15.9 dB, a NF of 3.5 dB with an input return loss less than \(-\) 11.6, output return loss of \(-\) 19.2 to \(-\) 19 and reverse isolation of \(-\) 38 dB. The LNA consumes 54.6 mW under a supply voltage of 2 V while having some acceptable characteristics.     

nOBS: an ns2 based simulation tool for performance evaluation of TCP traffic in OBS networks

Performance evaluation of tcp traffic in obs networks has been under intensive study, since tcp constitutes the majority of Internet traffic. As a reliable and publicly available simulator, ns2 has been widely used for studying tcp/ip networks; however ns2 lacks many of the components for simulating optical burst switching networks. In this paper, an ns2 based obs simulation tool (nobs), which is built for studying burst assembly, scheduling and contention resolution algorithms in obs networks is presented. The node and link objects in obs are extended in nobs for developing optical nodes and optical links. The ingress, core and egress node functionalities are combined into a common optical node architecture, which comprises agents responsible for burstification, routing and scheduling. The effects of burstification parameters, e.g., burstification timeout, burst size and number of burstification buffers per egress node, on tcp performance are investigated using nobs for different tcp versions and different network topologies.     

A Rate \text{ M }_{\mathrm{T}} Full Diversity STF Block Coded 4\times 4 MIMO-OFDM System with Reduced Complexity

Multiple input multiple output (MIMO) communication systems with orthogonal frequency division multiplexing (OFDM) has a great role to play for 4G broadband wireless communications. In this paper, a space time frequency (STF) code is presented with reduced decoder complexity and to achieve code rate $\text{ M }_\mathrm{T}$ with full diversity of $\text{ M }_{\mathrm{T}} \text{ M }_{\mathrm{R}} \text{ N }_{\mathrm{b}}$ L i.e., product of number of transmit antennas ( $\text{ M }_\mathrm{T}$ ), receive antennas $(\text{ M }_{\mathrm{R}})$ , fading blocks $(\text{ N }_{\mathrm{b}})$ and channel taps (L). The maximum achievable diversity with high rate of STF block coded MIMO-OFDM is analyzed and verified by simulation results. The decoder complexity is resolved by employing several approaches like maximum likelihood (ML), sphere decoder (SD) and array processing. The performance of STF code is compared with existing layered algebraic STF code in terms of decoder complexity and bit error rate (BER). Further, the closed form expressions for BER performance of STFBC MIMO-OFDM systems are derived and evaluated for frequency selective block fading channels with MPSK constellations.