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\) }.     

Method for Designing Efficient Mixed Radix Multipliers

The multiplication of two signed inputs, \(A {\times } B\) , can be accelerated by using the iterative Booth algorithm. Although high radix multipliers require summing a smaller number of partial products, and consume less power, its performance is restricted by the generation of the required hard multiples of B ( \(\pm \phi B\) terms). Mixed radix architectures are presented herein as a method to exploit the use of several radices. In order to implement efficient multipliers, we propose to overlap the computation of the \(\pm \phi B\) terms for higher radices with the addition of the partial products associated to lower radices. Two approaches are presented which have different advantages, namely a combinatory design and a synchronous design. The best solutions for the combinatory mixed radix multiplier for \(64\times 64\) bits require \(8.78\) and \(6.55~\%\) less area and delay in comparison to its counterpart radix-4 multiplier, whereas the synchronous solution for \(64\times 64\) bits is almost \(4{\times }\) smaller in comparison with the combinatory solution, although at the cost of about \(5.3{\times }\) slowdown. Moreover, we propose to extend this technique to further improve the multipliers for residue number systems. Experimental results demonstrate that best proposed modulo \(2^{n}{-}1\) and \(2^{n}{+}1\) multiplier designs for the same width, \(64{\times }64\) bits, provide an Area-Delay-Product similar for the case of the combinatory approach and \(20~\%\) reduction for the synchronous design, when compared to their respective counterpart radix-4 solutions.     

Design and modeling of high-resolution multibit log-domain \Delta \Sigma modulators

Log-domain Delta-Sigma ( $\Delta \Sigma$ ) modulators are attractive for implementing analog-to-digital (A/D) converters (ADCs) targeting low-power low-voltage applications. Previously reported log-domain $\Delta \Sigma$ modulators were limited to 1-bit quantization and, hence, could not benefit from the advantages associated with multibit quantization (namely, reduced in-band quantization noise, and increased modulator stability). Unlike classical $\Delta \Sigma$ modulators, directly extending a log-domain $\Delta \Sigma$ modulator with a 1-bit quantizer to a log-domain $\Delta \Sigma$ modulator with a multibit quantizer is challenging, in terms of CMOS circuit implementation. Additionally, the realization of log-domain $\Delta \Sigma$ modulators targeting high-resolution applications necessitates minimization of distortion and noise in the log-domain loop-filter. This paper discusses the challenges of multibit quantization and digital-to-analog (D/A) conversion in the log-domain, and presents a novel multibit log-domain $\Delta \Sigma$ modulator, practical for CMOS implementation. SIMULINK models of log-domain $\Delta \Sigma$ modulator circuits are proposed, and the effects of various circuit non-idealities are investigated, including the effects of log-domain compression–expansion mismatch. Furthermore, this paper proposes novel low-distortion log-domain analog blocks suitable for high-resolution analog-to-digital (A/D) conversion applications. Circuit simulation results of a proposed third-order 3-bit class AB log-domain $\Delta \Sigma$ loop-filter demonstrate 10.4-bit signal-to-noise-and-distortion-ratio (SNDR) over a 10 kHz bandwidth with a $0.84\,V_{pp}$ differential signal input, while operating from a 0.8 V supply and consuming a total power of $35.5\,\upmu \hbox {W}.$      

Downlink SINR Study in Multiuser Large Scale Antenna Systems

In this paper, the downlink signal-to-interference-plus-noise ratio (SINR) performance in multiuser large scale antenna systems with matched filter (MF) and regularized zero-forcing (RZF) precoding is investigated. The probability density function (PDF) for MF is derived and the distribution in high signal-to-noise ratio (SNR) regime is studied. Results indicate that the PDF of downlink SINR for MF converges to \(\mathcal F\) distribution when the interference is dominant over noise. For MF, the asymptotic SINR is just the reciprocal of the ratio of the number of users \(U\) to the number of transmit antennas \(N\) , and is irrelevant to the average transmit power when \(N\) and \(U\) grow with fixed ratio. However, when \(U\) is a large constant, the transmit power could be proportional to \(\ln N \big /N \) to maintain a specified quality of service, as a result of the large scale antenna system effect. In addition, the closed form of asymptotic SINR for RZF is derived by solving two mathematical expectations related to eigenvalues of large dimensional random matrices. Simulation results validate the derived PDF and analytical results.     

Outage Performance of Hybrid Decode–Amplify–Forward Protocol with the nth Best Relay Selection

In this paper, we consider the Hybrid Decode–Amplify–Forward protocol with the \(n\) th best-relay selection scheme. In the best-relay selection scheme, the best relay only forwards the source signal to the destination, regardless of working in the Amplify-and-Forward mode or the Decode-and-Forward mode. However, the best relay might be unavailable due to some reasons; hence we might bring into play the second, third or generally the \(n\) th best relay. We derive closed-form expression for the outage probability using the probability density function and moment generating function of the signal-to-noise ratio of the relayed signal at the destination node. Results show that with the \(n\) th best relay the diversity order is equal to \((m-n+2)\) where \(m\) is the number of relays. Simulation results are also given to verify the analytical results.     

Strengthening the Security of EPC C-1 G-2 RFID Standard

In this paper, we analyze the security of AZUMI protocol which is compliant with EPC-Class-1 Generation-2 standard and recently has been proposed by Peris et al. This protocol is an improvement to a protocol proposed by Chen and Deng which has been cryptanalysed by Peris et al. and Kapoor and Piramuthu. However, our security analysis clearly shows that the designers were not successful in their attempt to improve Chen and Deng protocol. More precisely, we present an efficient passive attack to disclose the tag and the reader secret parameters, due to PRNG and the length of the values. In addition, we present a simple tag impersonation attack against this protocol. The success probability of all attacks are almost “1” and the cost of given attacks are at most eavesdropping two sessions of protocol. However, the given secrets disclosure attack also requires $O(2^{16})$ off-line evaluations of a $PRNG$ function. To counteract such flaws, we improve the AZUMI protocol by applying some minor modifications so that it provides the claimed security properties.     

Performance Comparison Analyses of the Nth Best Relay Selection Schemes Over Independent and Non-identically Distributed Nakagami-m Fading Channels

In this work, we study the $N$ th best relay selection schemes with the consideration that in some case the best relay is unavailable due to the restriction of practical implementation. With amplify-and-forward relaying protocols, the interested $N$ th best relay schemes are investigated over independent and non-identically distributed (i.ni.d) Nakagami- $m$ fading channels. For such opportunistic relaying schemes, we first obtain the closed-form expressions to the probability density function (PDF) and cumulative distribution function (CDF) of the instantaneous end-to-end signal-to-noise ratio with appropriate mathematical proof. Then, with the obtained CDF and PDF, three main measurements are investigated as well as the corresponding explicit solutions, $i.e.$ , outage probability, average symbol error ratio (SER), and ergodic capacity. At the same time, as a byproduct, the corresponding performance metrics over Rayleigh fading are also derived. Finally, the detailed performance comparison analyses are presented under different values of $N$ and different Nakagami- $m$ channel fading severity parameters. The numerical results show that the increase of $N$ incurs the very severe loss in performance such outage probability, SER, and ergodic capacity. However, the loss in performance can be decreased greatly when the $N$ th systems have bigger fading severity factors. The derivations are of significance because the Nakagami- $m$ fading spans via the fading severity parameters a wide range of fading scenarios that are typical in realistic wireless relay networks.     

Construction of (2k,k, 2) Convolutional Codes with Double-Loop Cyclic Codes

In this paper, by taking multiple-time information in blocks into the coding of linear block codes, a new class of (2 \(k\) , \(k\) , 2) convolutional codes is constructed, by which a new way of constructing long codes with short ones is obtained. After that, the type of embedded codes is determined and the optimal values of the linear combination coefficients are derived by using a three-dimensional state transfer matrix to analyze and testify the constructing mechanism of the codes. Finally, the simulation experiment tests the error-correcting performance of the (2 \(k\) , \(k\) , 2) convolutional codes for different value of \(k\) , it is shown that the performance of the new convolutional codes compares favorably with that of traditional (2, 1, \(l\) ) convolutional codes.     

WCDMA Multiclass Downlink Capacity and Interference Statistics of Cigar-Shaped Microcells in Highways

In this paper, the multiclass downlink capacity and the interference statistics of the sectors of a cigar-shaped microcells using wideband code-division multiple-access with soft handover mode are analyzed. The two-slope propagation model with log-normal shadowing is used in the analysis where a model of 8 cigar-shaped microcells is utilized. The performance of the downlink is studied for different [sector range R, standard deviation of the shadowing ( $\sigma _{1}$ and $\sigma _{2})$ and propagation exponents ( $\text{ s}_{1}$ and $\text{ s}_{2})$ ]. It is found that increasing the sector range from 500 to 1,000 m will increase the sector downlink capacity. Also, it is found that increasing the value of the propagation parameters ( $\sigma _{1}$ and $\sigma _{2})$ will reduce the downlink sector capacity. It is noticed that, the effect of changing the propagation exponent $\text{ s}_{1}$ is null while increasing the propagation exponent $\text{ s}_{2}$ will increase the downlink capacity.     

Improved Q-Factor Calculations for Single Port Filter-Antenna Measurement

These days most of the research work in the area of filter-antenna design is focused on having high quality factor for certain frequency band. These type of filter-antennas are difficult to design as the design engineers are required to have low quality factor for the radiating band of frequency. Hence a precise value of $Q$ -factor is required to understand the radiating and filtering properties of filter-antennas. Filter-antennas are single port devices as the second port is considered as radiating port. Return loss is used, in order to yield $Q$ -factor through calculations for such devices. However, the conventional method for calculating $Q$ -factor found to be inaccurate in most of the low $Q$ -factor cases. This paper proposes a method that out performs the conventional method of calculating $Q$ -factor. Non-ideal fabrication process is also discussed for accurate evaluation of $Q$ -factor. Experimental results show that proposed method can be employed to calculate $Q$ -factor with reasonable accuracy for simulated and measured results.     

E-TCAM: An Efficient SRAM-Based Architecture for TCAM

Ternary content addressable memories (TCAMs) perform high-speed search operation in a deterministic time. However, when compared with static random access memories (SRAMs), TCAMs suffer from certain limitations such as low-storage density, relatively slow access time, low scalability, complex circuitry, and higher cost. One fundamental question is that can we utilize SRAM to combine it with additional logic to achieve the TCAM functionality? This paper proposes an efficient memory architecture, called E-TCAM, which emulates the TCAM functionality with SRAM. E-TCAM logically divides the classical TCAM table along columns and rows into hybrid TCAM subtables and then maps them to their corresponding memory blocks. During search operation, the memory blocks are accessed by their corresponding subwords of the input word and a match address is produced. An example design of \(512\times 36\) of E-TCAM has been successfully implemented on Xilinx Virtex- \(5\) , Virtex- \(6\) , and Virtex- \(7\) field-programmable gate arrays (FPGAs). FPGA implementation results show that E-TCAM obtains \(33.33\)  % reduction in block-RAMs, \(71.07\)  % in slice registers, \(77.16\)  % in lookup tables, \(53.54\)  % in energy/bit/search, and offers \(63.03\)  % improvement in speed, compared with the best available SRAM-based TCAM designs.     

Mutual Distance Bounding Protocol with Its Implementability Over a Noisy Channel and Its Utilization for Key Agreement in Peer-to-Peer Wireless Networks

In order to protect a wireless sensor network and an RFID system against wormhole and relay attacks respectively, distance bounding protocols are suggested for the past decade. In these protocols, a verifier authenticates a user as well as estimating an upper bound for the physical distance between the user and itself. Recently, distance bounding protocols, each with a mutual authentication, are proposed to increase the security level for such systems. They are also suggested to be deployed for key agreement protocols in a short-range wireless communication system to prevent Man-in-the-Middle attack. In this paper, a new mutual distance bounding protocol called NMDB is proposed with two security parameters ( \(n\) and \(t\) ). The parameter \(n\) denotes the number of iterations in an execution of the protocol and the parameter \(t\) presents the number of errors acceptable by the verifier during \(n\) iterations. This novel protocol is implementable in a noisy wireless environment without requiring final confirmation message. Moreover, it is shown that, how this protocol can be employed for the key agreement procedures to resist against Man-in-the-Middle attack. NMDB is also analyzed in a noisy environment to compute the success probability of attackers and the rejection probability of a valid user due to channel errors. The analytically obtained results show that, with the proper selection of the security parameters ( \(n\) and \(t\) ) in a known noisy environment, NMDB provides an appropriate security level with a reliable performance.     

A 5 GHZ CMOS Power VCO with Novel Frequency-Modulation for RF Transmitter

A 5 GHz transformer-feedback power oscillator with novel frequency modulation (FM) up to 10 MHz is presented in this paper. The novel FM is achieved by a CMOS transistor between transformer and ground, which is designed for varying the equivalent inductance and mutual inductance of the transformer and shows no DC connection with the oscillation circuit. The major frequency tuning is realized by the variable capacitor which is controlled by a phase lock loop. The RF VCO with 210 MHz tuning range operates in class-E mode to achieve a cost-effective transmitter, which demonstrates a high DC-to-RF conversion efficiency of 39 %. A RF power of 15.1 dBm and phase noise better than \(-\) 109 dBc/Hz @ 100 kHz from the central frequency of 5.5 GHz is obtained with the biasing conditions V \(_\mathrm{ds}\) = 1.8 V and V \(_\mathrm{gs}\) = 0.65 V. The VCO also demonstrates an ultra-low voltage operation capability: with V \(_\mathrm{ds}\) = V \(_\mathrm{gs}\) = 0.6 V and DC power consumption of 9 mW, the output power is 4.5 dBm and the phase noise better than \(-\) 93 dBc/Hz @ 100 kHz. The die size of the transformer-feedback power oscillator is only \(0.4\times 0.6\) mm \(^{2}\) .     

Minimum payment collaborative sensing network using mobile phones

Mobile phones with embedded sensors have been applied in various collaborative sensing applications. To encourage mobile phone users to perform collaborative sensing, the data demanders usually pay mobile phone users for required data. In this paper, we study the Minimum Payment of Attaining the Required Data with mobile phones (MPARD) problem in collaborative sensing network: given sensing regions \(R = \{R_1, R_2, \ldots , R_m\}\) , the set of requisite data \(D_i\) for each sensing region \(R_i\) and a set of mobile phones \(M\) , the \(MPARD\) problem studies how to select mobile phones to obtain all the required data such that the data demanders’ total payment to mobile phone users is minimized. In reality, some systems need the fresh sensing data from mobile phones at each pre-determined time slot, and others don’t require the real-time data and the sensing data from previous time slots is also deemed useful. Based on the above two different requirements of data timeliness, we first define two subproblems derived from \(MPARD\) problem: \(MPARD_t\) and \(MPARD_p\) . After that, for each subproblem, we propose an approximation algorithm for the situation where the trajectories of mobile phones are determinate and a heuristic for the situation where trajectories are unknown. Simulation results demonstrate that our algorithms are efficient.     

An Ideal Multi-secret Sharing Scheme Based on Connectivity of Graphs

Secure communication has become more and more important for many modern communication applications. In a secure communication, every pair of users need to have a secure communication channel (each channel is controlled by a server) In this paper, using monotone span programs we devise an ideal linear multi-secret sharing scheme based on connectivity of graphs. In our proposed scheme, we assume that every pair of users, \(p\) and \(q\) , use the secret key \(s_{pq} \) to communicate with each other and every server has a secret share such that a set of servers can recover \(s_{pq} \) if the channels controlled by the servers in this set can connect users, \(p\) and \(q\) . The multi-secret sharing scheme can provide efficiency for key management. We also prove that the proposed scheme satisfies the definition of a perfect multi-secret sharing scheme. Our proposed scheme is desirable for secure and efficient secure communications.     

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.     

Chaotic dynamics of the fractional order nonlinear system with time delay

This paper presents the fractional order model of a nonlinear autonomous continuous-time difference-differential equation with only one variable. Numerical simulation results of the fractional order model demonstrate the existence of chaos when system order $q\ge 0.2$ . Values of the delay time $\tau $ in which chaotic behavior is observed at system order $q$ are quantitatively defined using the largest Lyapunov exponents obtained from the output time series.     

Statistical Analysis of Cognitive Radio Operation in a Periodic Pattern of Sensing and Transmission

A Cognitive Radio must sense the channel to detect spectrum holes. To this end, it senses the channel for $T_S$ and transmits its data for $N T_S$ , if the channel is not occupied by Primary User. It is expected that the more frequent arrivals of PU, characterized by the arrival rate $\lambda $ , provides CR with less opportunity. The aim of this paper is two-fold: analysis of the interaction between $N$ and $\lambda $ , as well as the access time of CR on the one hand and study of the possible benefits a variable decreasing modulation order might provide for CR on the other. In both cases, data rate of CR and the interference it causes for PU are considered as the performance measures.     

Six Order Cascaded Power Line Notch Filter for ECG Detection Systems with Noise Shaping

This paper presents the design of an operational transconductance amplifier-C (OTA-C) notch filter for a portable Electrocardiogram (ECG) detection system. A six order cascaded filter is utilized to reduce the effect of the power line interference at (50/60 Hz). The proposed filter is based on a programmable balanced OTA circuit. Based on this, PSPICE post layout simulation results for the extracted filter using 0.25  \(\upmu \) m technology and operating under \(\pm \) 0.8 V voltage supply are also given. The six order notch filter provides a notch depth of 65 dB (43 dB for 4th order), input referred noise spectral density with noise shaping of 9  \(\upmu \) Vrms/ \(\surd \) Hz at the pass band frequencies and 9 mVrms/ \(\surd \) Hz at the notch (zero) frequency which provide noise shaping for the ECG signal. These results demonstrate the ability of the filter to be used for ECG signal filtering which is located within 150 Hz.     

Closed-Form Error Analysis of AF-CARQ with CSI-Assisted Relay over Nakagami-m Fading Channels

This paper presents a new Amplify-and-Forward Cooperative Automatic Repeat reQuest protocol with channel state information-assisted relay which is more suitable for the only-read access networks. The channels of any pair of terminations are quasi static flat Nakagami- \(m\) fading channels, which are mutually independent and non-identically distributed. Assuming that the coherent equal gain combining is adopted to combine the retransmitted signals from the same link at the destination and selective combining is adopted to the signals from different links. Based on the approximation of product of Nakagami- \(m\) variables, we obtain the end-to-end signal-to-noise rate of any link. The closed-form expression of the average bit error rate for several modulation schemes is obtained by analyzing cumulative distribution function (CDF) and Gaussian Q-function. Then we analyze the amount of fading of the fading channels by the \(n\) order moment which is obtained by CDF. Numerical simulation results show that the relay node can resist the fading of system effectively comparing with the system without relay node. And with the increasing of the number of transmission, the performance advantage of relay link is more and more obviously. It is better to let the maximum transmission time \(F=6\) , which is very useful for improving the transmission efficiency of the truncated ARQ system. The maximum reduction of amount of fading can be reached when \(t=3\) , if the total number of transmission is \(f=6\) . The number of bits in the frame should not have too big.