Extended Robust \mathcal{H}_{2} and \mathcal{H}_{\infty} Filter Design for Discrete Time-Invariant Linear Systems with Polytopic Uncertainty

This paper is concerned with the problem of robust $\mathcal{H}_{2}$ and $\mathcal{H}_{\infty}$ filter design for discrete-time linear time-invariant systems with polytopic parameter uncertainties. Less conservative robust $\mathcal{H}_{2}$ and $\mathcal{H}_{\infty}$ filter design procedures are proposed in terms of single-parameter minimization problems with linear matrix inequality constraints. To this end, we generalize the filter structures available in the literature to date in such a way that the filter’s next state is built by summing the filter’s states over several samples from the past to the present. For stability of the filtering error system, the homogeneous polynomial parameter-dependent Lyapunov functions are employed. Finally, illustrative examples are given to demonstrate the merits of the proposed methods.     

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.     

Robust H_{\infty } filtering for uncertain two-dimensional continuous systems with time-varying delays

This paper deals with the problem of delay-dependent robust $H_{\infty }$ H ∞ filtering for uncertain two-dimensional (2-D) continuous systems described by Roesser state space model with time-varying delays, with the uncertain parameters assumed to be of polytopic type. A sufficient condition for $H_{\infty }$ H ∞ noise attenuation is derived in terms of linear matrix inequalities, so a robust $H_{\infty }$ H ∞ filter can be obtained by solving a convex optimization problem. Finally, some examples are provided to illustrate the effectiveness of the proposed methodology.     

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.     

The First Year Nursing Students’ Achievement and Critical Thinking in Local Wisdom Course Using Problem Based Learning Process

The purpose of this one group—pre test post test design classroom research was to examine learning achievement, critical thinking and satisfaction of first year nurse students at school of nursing during academic year 2011. In the research activity, 94 students participated in three weeks for each scenario in Local Wisdom and Health Care which composed of 4 scenarios. Problem based learning process were included the preparation of facilitators, preparation of learners, and problem/scenario based assignments. The instruments composed of 1) 135 items, 4 multiple choices test which were covered behavioral objectives and blue print of test and validated by course lecturers 2) opinion evaluation form, open ended questionnaire and 3) the critical thinking questionnaire, 80 items in five domains which are Inference, Recognition of Assumption, Deduction, Interpretation, and Evaluation of Argument with internal consistency of .73. Data were analyzed using frequency, percentage, mean, standard deviation, percentile, t test and $\chi ^{2}$ test. It was found that the highest score of learning achievement was 88.79 % while the lowest score was 70.33 %, average learning achievement score was 80.60 $(\pm 3.47)\%$ . The highest grade levels were B+ and B equally (41.49 %). Students demonstrated higher overall critical thinking $(49.62 \pm 5.78)$ after undergone problem based learning process than before the problem based learning process $(46.69 \pm 6.00)$ statistically significance $(\text{ t}\,=\,4.443, p\,<\,.05)$ . Inference and Recognition of Assumption domain after PBL process were better than their own thoughts before PBL process significantly (t = 2.288, $p\,<\,.05$ ; t = 6.287, $p\,<\,.05$ , respectively). The ability of critical thinking was found that the high, moderate and low level (percentile $>75, 25-75$ and $<25$ ) after PBL were difference from the ability before the process significantly $(\chi ^{2}=12.219, p\,<\,.05)$ .     

Effect of the stoichiometric composition of the Si(111)\sqrt {21} × \sqrt {21} -(Au, Ag) surface phase on substrate conductivity

The conductivity of a silicon substrate with a Si(111) $\sqrt {21} $ × $\sqrt {21} $ -(Au, Ag) surface phase is studied. It is found that the surface conductivity of such a substrate varies depending on the ratio of the amounts of gold and silver in the given structure. An analysis of the behavior of the Si(111) $\sqrt {21} $ × $\sqrt {21} $ -(Au, Ag) surface conductivity during silver adsorption indicates the effect of a space-charge layer in the surface region of the substrate on the measurement results.     

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.     

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

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}.$      

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.     

A novel image segmentation model with an edge weighting function

A variational model for image segmentation consists of a data term and a regularization term. Usually, the data term is chosen as squared $\text{ L }_{2}$ norm, and the regularization term is determined by the prior assumption. In this paper, we present a novel model in the framework of MAP (maximum a posteriori). A new iteratively reweighted $\text{ L }_{2}$ norm is used in the data term, which shares the advantages of $\text{ L }_{2}$ and mixed $\text{ L }_{21}$ norm. An edge weighting function is addressed in the regularization term, which enforces the ability to reduce the outlier effects and preserve edges. An improved region-based graph cuts algorithm is proposed to solve this model efficiently. Numerical experiments show our method can get better segmentation results, especially in terms of removing outliers and preserving edges.     

Decentralized \mathcal{L}_{2}–\mathcal{L}_{\infty} Filtering for Interconnected Markovian Jump Systems with Delays

This paper deals with the problem of decentralized $\mathcal{L}_{2}$ – $\mathcal{L}_{\infty}$ filtering for a class of interconnected (or large-scale) Markovian jump systems with constant time delays. The purpose is to present delay-dependent conditions for the existence of mode-dependent decentralized filters, which guarantees that the filtering error system is stochastically stable with a prescribed $\mathcal{L}_{2}$ – $\mathcal{L}_{\infty}$ disturbance attenuation level. Such a purpose is achieved by using a mode-dependent centralized Lyapunov functional together with the so-called Jensen’s inequality. The obtained synthesis conditions are expressed in terms of linear matrix inequalities (LMIs), which leads to a convex design method for the concerned filters. An example including numerical and simulation results is provided finally to illustrate the effectiveness of the proposed design method.     

Elliptic Curve Discrete Logarithm Problem over Small Degree Extension Fields

In 2008 and 2009, Gaudry and Diem proposed an index calculus method for the resolution of the discrete logarithm on the group of points of an elliptic curve defined over a small degree extension field $\mathbb{F}_{q^{n}}$ . In this paper, we study a variation of this index calculus method, improving the overall asymptotic complexity when $n = \varOmega(\sqrt [3]{\log_{2} q})$ . In particular, we are able to successfully obtain relations on $E(\mathbb{F}_{q^{5}})$ , whereas the more expensive computational complexity of Gaudry and Diem’s initial algorithm makes it impractical in this case. An important ingredient of this result is a variation of Faugère’s Gröbner basis algorithm F4, which significantly speeds up the relation computation. We show how this index calculus also applies to oracle-assisted resolutions of the static Diffie–Hellman problem on these elliptic curves.     

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.     

Soft X-ray Absorption and Photoemission Spectroscopy Study of Cobalt-Based Thermoelectric Oxides: \hbox{Ca}_3\hbox{Co}_4\hbox{O}_9, \hbox{Ca}_3\hbox{Co}_2\hbox{O}_6, and \hbox{Bi}_{2}\hbox{Sr}_{2}\hbox{Co}_2\hbox{O}_{y}

The electronic structures of Co-based potential thermoelectric (TE) oxides, including $\hbox{Ca}_3\hbox{Co}_4\hbox{O}_9$ and $\hbox{Bi}_{2}\hbox{Sr}_{2}\hbox{Co}_2\hbox{O}_{y}$ (y = 8 + δ) single crystals and polycrystalline $\hbox{Ca}_3\hbox{Co}_2\hbox{O}_6$ , have been investigated by employing soft x-ray absorption spectroscopy (XAS) and photoemission spectroscopy (PES). Co 2p XAS measurements show that Co ions are nearly trivalent ( $\hbox{Co}^{3+}$ ) in all of these Co-based TE oxides with a small mixture of $\hbox{Co}^{4+}$ ions in $\hbox{Bi}_{2}\hbox{Sr}_{2}\hbox{Co}_2\hbox{O}_{y}$ . Valence-band PES and O 1s XAS measurements show that the occupied Co 3d states are located at the top of the valence bands and that the lowest unoccupied states have the primarily Co 3d character, respectively. These findings suggest the importance of the Co 3d electronic structures in determining TE properties of these Co-based oxides.     

A 4-bit CMOS phase shifter for millimeter-wave phased arrays

A 4-bit active phase shifter for millimeter-wave phased arrays is presented in this brief. The proposed phase shifter has achieved a phase-shifting range of $360^{\circ }$ with a $22.5^{\circ }$ resolution over 40 to 50-GHz. Thanks to the careful dimension designs of digitally controlled gain stage in the programmable weighted combiner, the active phase shifter achieves root-mean-square phase and gain errors of $5^{\circ }$ and 1.25-dB at 45-GHz, respectively. The measurement results also show that the input and output return losses are better than 7-dB from 40 to 50-GHz. The whole chip dissipates only 10.7-mA from 1.2-V supply excluding output driven buffer.     

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.     

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.     

Routing and wavelength assignment in all optical networks using differential evolution optimization

The routing and wavelength assignment (RWA) problem, known to be an NP-complete problem, seeks to optimally establish routes and adequate wavelengths for the requested connections according to an objective function. This paper presents the use of a novel approach based on a differential evolution (DE) algorithm to the RWA problem in wavelength-routed dense division multiplexing (DWDM) optical networks. The proposed DE-RWA algorithm is modeled to optimize not only the network wavelength requirement ( $ NWR $ , which is the minimum number of wavelengths needed to fulfill traffic demand) but also the average path length ( $ APL $ ). We present the impact of the control parameters of the DE algorithm on the improvement of system’s performance. Additionally, we present two strategies to improve the efficiency of the algorithm, knowing as the disjoint cut-set paths (DCS-P) algorithm and the use of a random mutation ( $ random -M$ ) parameter for DE. The proposed approach is evaluated for test bench optical networks with up to 40 nodes. Experiments show that the DE-RWA algorithm obtains results that equal the $ NWR $ lower bound for networks with and without wavelength conversion capability, whereas reduce the $ APL $ . The performance of the DE-based approach is compared against results obtained with the particle swarm optimization (PSO) and genetic algorithm (GA) models, showing that the DE-RWA outperform those algorithms. The presented DE-RWA model is simple to implement and could also be extended by adding other features such as impairment-aware, energy efficient, survivability among others in optical networks.     

Formation of a Buffer Layer for Graphene on C-Face SiC{0001}

Graphene films prepared by heating the SiC $ (000\bar{1}) $ surface (the C-face of the {0001} surface) in a Si-rich environment have been studied using low-energy electron diffraction (LEED) and low-energy electron microscopy. Upon graphitization, an interface with $ \sqrt {43} \times \sqrt {43} - R \pm 7.6^\circ $ symmetry is observed by in situ LEED. After oxidation, the interface displays $ \sqrt 3 \times \sqrt 3 - R 30^\circ $ symmetry. Electron reflectivity measurements indicate that these interface structures arise from a graphene-like “buffer layer” that forms between the graphene and the SiC, similar to that observed on Si-face SiC. From a dynamical LEED structure calculation for the oxidized C-face surface, it is found to consist of a graphene layer sitting on top of a silicate (Si₂O₃) layer, with the silicate layer having the well-known structure as previously studied on bare SiC $ (000\bar{1}) $ surfaces. Based on this result, the structure of the interface prior to oxidation is discussed.