A novel CMOS LC quadrature oscillator (QO) which adopts complementary-coupling circuitry has been proposed. The performance improvement in I/Q phase error and phase noise of the proposed QO, is explained in comparison with conventional QOs. The proposed QO is implemented in 0.18 µm CMOS technology along with conventional QOs. The measurement result of the proposed QO shows -133.5 dBc/Hz of phase noise at 1 MHz offset and 0.6 I/Q phase difference, while oscillating at 1.77 GHz. The proposed QO shows more than 6.5 dB phase noise improvement compared to that of the conventional QOs over the offset frequency range of 10 K-1 MHz, while dissipating 4 mA from 1.4 V supply.

Even though weighted frequent pattern (WFP) mining is more effective than traditional frequent pattern mining because it can consider different semantic significances (weights) of items, existing WFP algorithms assume that each item has a fixed weight. But in real world scenarios, the weight (price or significance) of an item can vary with time. Reflecting these changes in item weight is necessary in several mining applications, such as retail market data analysis and web click stream analysis. In this paper, we introduce the concept of a dynamic weight for each item, and propose an algorithm, DWFPM (dynamic weighted frequent pattern mining), that makes use of this concept. Our algorithm can address situations where the weight (price or significance) of an item varies dynamically. It exploits a pattern growth mining technique to avoid the level-wise candidate set generation-and-test methodology. Furthermore, it requires only one database scan, so it is eligible for use in stream data mining. An extensive performance analysis shows that our algorithm is efficient and scalable for WFP mining using dynamic weights.

Wide area ubiquitous wireless networks, which consist of access points (APs) connected to the fixed network and a great many wireless terminals (WTs), can offer a wide range of applications everywhere. In order to enhance network performance, we need to collect different kinds of data from as many WTs as possible; each AP must be capable of accommodating more than 103 WTs. This requirement can be achieved by employing DSA, a typical centralized media access control scheme, since it has high resource utilization efficiency. In this paper, we propose a novel DSA scheme that employs three new techniques to enhance throughput performance; (1) considering that most terminals tend to send data periodically, it employs both polling-based schemes, i.e. request-polling and data-polling, and a random access scheme. (2) In order to enhance bandwidth utilization effectiveness by polling, the polling timing is decided according to the data generation timing. (3) The AP decides the polled data size according to the latest distribution of data size and polls the WT for the data directly. If the data-polling size can not be determined with confidence, the AP uses request-polling instead of data-polling. Simulations verify that the proposed scheme offers better transmission performance than the existing schemes.

The basic playout scheme (BAS) is designed not to take into account network impairment information during silence periods. We propose a jitter-robust playout mechanism (RST), which uses silence description (SID) packets. The lateness loss percentages are compared between the BAS and the RST algorithms. We report that the accuracy of the playout schedule calculation in the BAS is getting worse as the previous silence interval increases and our proposed RST algorithm is more effective in removing high jitter than the BAS. Under high jitter Internet conditions, the accuracy of the estimates and therefore the resulting of VoIP playout quality can be significantly improved by using the SID packets in the playout schedule recalculation.

This paper introduces a theory for fast optimization of the circuit topology and parameters in sinusoidal oscillators. The theory starts from a system model composed of standard active and passive elements. We then include even the output load in the circuit, so that there is no longer any interaction with the outside of the system through the port. This model is thus called no-input-no-output (NINO) oscillator. The circuit is cut at an arbitrary branch, and is characterized in terms of the scalar impedance from the cut point. This is called active impedance because it is a function of not only the stimulating frequency but also the active device gain. The oscillation frequency and necessary device gain are estimated by solving impedance-domain Barkhausen equilibrium equations. This estimation works for the adjustment of circuit elements to meet the specified oscillation frequency. The estimation of necessary device gain enables us to maximize the oscillation amplitude, thanks to the inherent negative-slope nonlinearity of active devices. The active impedance is also used to derive the oscillation Q (quality) factor, which serves as a key criterion for sideband noise minimization i.e. frequency spectrum purification. As an alternative measure to active impedance, we also introduce branch admittance matrix determinant. This has the same numerical effect as the scalar impedance but can be used to formulate oscillator characteristics in a more elegant fashion, and provides a lucent picture of the physical behavior of each element in the circuit. Based on the proposed theory, we provide the tabled formulas of oscillation frequency, necessary device gain, active Q factor for a variety of typical Colpitts, Hartley, and cross-coupled twin-FET (field-effect transistor) oscillators.

To improve the performance of the optimal pilot sequences over multiple OFDM symbols in fast time-varying channels, this letter proposes a novel channel estimation method using virtual pilot tones in multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Assuming that the superimposed virtual pilot tones at the data locations over the specific sub-carriers are transmitted from all transmit antennas, the corresponding virtual received pilot signals at the same locations are obtained from the neighboring real received pilot signals over the same sub-carriers by Wiener filter. Based on the least squares (LS) channel estimation, the channel parameters can be obtained from the combination of the virtual and real received pilot signals over one OFDM symbol. Simulation results show that the proposed channel estimation method greatly outperforms the previous method for the optimal pilot sequences over multiple OFDM symbols in fast time-varying channels, as well as approaches the method for the comb-type optimal pilot sequences in performance.

We consider a time-division multiple access (TDMA) transmission scheme in MIMO broadcast channels. To cope with the fairness issue in heterogeneous networks with slow fading, an opportunistic scheduling algorithm based on the channel eigen-direction is investigated. In the system with sparse users, the mismatch between a random beamforming vector and the principle eigenvector of the channel incurs a throughput penalty. To reduce such a throughput loss, a multiple random beams selection (MRBS) scheme exploiting chordal distances is proposed. Two feedback schemes (unquantized or quantized chordal distances) are considered. The closed-form throughput expressions of the proposed schemes are derived.

A feature of services provided in a Next Generation Network (NGN) is that the end-to-end quality is guaranteed. This is quite a challenging issue, given the considerable fluctuation in network conditions within a Fixed Mobile Convergence (FMC) network. Therefore, a novel approach, whereby a network node and a mobile terminal such as a cellular phone cooperate with each other to control service quality is essential. In order to achieve such cooperation, the mobile terminal needs to become more intelligent so it can estimate the service quality, including the user's perceptual quality, and notify the measurement result to the network node. Subsequently, the network node implements some kind of service control function, such as a resource and admission control function, based on the notification from the mobile terminal. In this paper, the role of the mobile terminal in such collaborative system is focused on. As a part of a QoS/QoE measurement system, we describe an objective speech quality assessment with payload discrimination of lost packets to measure the user's perceptual quality of VoIP. The proposed assessment is so simple that it can be implemented on a cellular phone. We therefore did this as part of the QoS/QoE measurement system. By using the implemented system, we can measure the user's perceptual quality of VoIP as well as the network QoS metrics, in terms of criteria such as packet loss rate, jitter and burstiness in real time.

This paper provides a closed form expression for calculating the bit error rate of the decode-and-forward relay protocol that uses equal-gain combining (EGC) at the destination with an arbitrary number of relays. We have shown that EGC technique for decode-and-forward relay scheme offers remarkable diversity advantage over direct transmission. In addition, we also study the impact of combining techniques on the performance of the system by comparing a system that uses EGC to one that uses maximum ratio combining (MRC) & selection combining (SC). Simulations are performed to confirm our theoretical analysis.

Design by Contract (DBC), originated in the Eiffel programming language, is generally accepted as a practical method for building reliable software. Currently, however, few languages have built-in support for it. In recent years, several methods have been proposed to support DBC in Java. We compare eleven DBC tools for Java by analyzing their impact on the developer's programming activities, which are characterized by seven quality attributes identified in this paper. It is shown that each of the existing tools fails to achieve some of the quality attributes. This motivates us to develop ezContract, an open source DBC tool for Java that achieves all of the seven quality attributes. ezContract achieves streamlined integration with the working environment. Notably, standard Java language is used and advanced IDE features that work for standard Java programs can also work for the contract-enabled programs. Such features include incremental compilation, automatic refactoring, and code assist.

A rate-6/4 full-diversity orthogonal space-time block code (STBC) is constructed for QPSK and 2 transmit antennas by applying constellation scaling and rotation to the set of quaternions used in Alamouti code. Also given is a rate-9/8 full-diversity quasi-orthogonal space-time block code (QOSTBC) for 4 transmit antennas. Lastly, a rate-10/8 code is presented for 4 transmit antennas. Simulation results indicate that these high-rate codes achieve better throughputs in the high signal-to-noise ratio region.

This paper presents a wireless burst modulation/ demodulation method for narrowband ubiquitous communication systems. This method especially suits those systems, whose traffic is especially dominated by short frame bursts. The proposed modulation method provides a preamble-less frame structure with training symbols, which improves both transmission efficiency and burst synchronization performance. Moreover, the proposed demodulation method achieves superior burst synchronization performance in low carrier-to-noise power ratio (CNR) environments by applying a synchronization method that includes symbol timing recovery, slot synchronization, carrier frequency correction and channel tracking. In addition, this paper presents the result of experiments on hardware prototypes of the proposed modulator and demodulator. The basic operation and practical performance of the proposed method is confirmed through testbed studies.

For determining whether an input number is prime, there are two kinds of algorithms, a primality test and a primality proving. A primality test is very efficient but probabilistic, that is, there are certain errors in determining primality. On the other hand, a primality proving always gives a correct answer but it is not so efficient. Grantham proposed a very interesting problem on the Quadratic Frobenius Test (QFT) which is a primality test. If we negatively solve the problem, then we can construct a primality proving more efficient than any other existing primality proving. To solve Grantham's problem, it is important to study when QFT fails. In this paper, as the first step to solve Grantham's problem, we show two conditions on a given odd composite number n and parameters a,b of QFT such that n passes QFT for a,b. Based on these conditions, we made a computational experiment that may suggest the problem will be negatively solved. Moreover, the two conditions give two algorithms computing a pair (a,b) for which a given odd composite number n passes QFT, where n's prime factorization is known.

To understand the structural and functional properties of large-scale complex networks, it is crucial to efficiently extract a set of cohesive subnetworks as communities. There have been proposed several such community extraction methods in the literature, including the classical k-core decomposition method and, more recently, the k-clique based community extraction method. The k-core method, although computationally efficient, is often not powerful enough for uncovering a detailed community structure and it produces only coarse-grained and loosely connected communities. The k-clique method, on the other hand, can extract fine-grained and tightly connected communities but requires a substantial amount of computational load for large-scale complex networks. In this paper, we present a new notion of a subnetwork called k-dense, and propose an efficient algorithm for extracting k-dense communities. We applied our method to the three different types of networks assembled from real data, namely, from blog trackbacks, word associations and Wikipedia references, and demonstrated that the k-dense method could extract communities almost as efficiently as the k-core method, while the qualities of the extracted communities are comparable to those obtained by the k-clique method.

The Letter deals with constant false alarm rate (CFAR) detection of random Gaussian target signals embedded in Gaussian clutter with unknown covariance. The proposed detector is analyzed on the assumption that clutter covariance is not known and a random target signal has low-rank property. The low-dimensional subspace-based approach leads to a robust false alarm rate (RFAR) detector. The detection performance loss and the false alarm stability loss to unknown clutter covariance have been evaluated for example scenario.

This paper presents a new methodology, Beacognition, for real-time discovery of the associations between a signal space and arbitrarily defined regions, termed as Semantically Meaningful Areas (SMAs), in the corresponding physical space. It lets the end users develop semantically meaningful location systems using standard 802.11 network beacons as they roam through their environment. The key idea is to discover the unique associations using a beacon popularity model. The popularity measurements are then used to localize the mobile devices. The beacon popularity is computed using an election' algorithm and a new recognition model is presented to perform the localization task. We have implemented such a location system in a five story campus building. The comparative results show significant improvement in localization by achieving on average 83% SMA and 88% Floor recognition rate in less than one minute per SMA training time.

Amidst conflicting views about whether soft cooperative energy detection scheme (SCEDS) outperforms hard cooperative energy detection scheme (HCEDS) greatly in cognitive radio, we establish the bridge that mathematically connects SCEDS and HCEDS by closed approximations. Through this bridge, it is demonstrate that, if the number of detectors of HCEDS is 1.6 times as that of SCEDS, they have nearly the same performance which is confirmed by numerical simulations, enabling a quantitative evaluation of the relation between them and a resolution of the conflicting views.

In this paper, we propose a continuous range query processing method over moving objects. To efficiently process continuous range queries, we design a main-memory-based query index that uses smaller storage and significantly reduces the query processing time. We show through performance evaluation that the proposed method outperforms the existing methods.

In incremental relaying, the destination uses a checking system and requires a retransmission from the relay in case an error happens. After receiving the signal from the relay, the destination combines the signals from the source and the relay and performs detection. However, the combined signal is actually worse because of the erroneous signal from the source. Our scheme eliminates the detrimental signal from the source and uses only the fresh signal from the relay, resulting in a large performance improvement and reduced complexity. The symbol error rate (SER) and its upper bound are established to analyze the power allocation strategy. Simulations verify the rightness of the theoretic studies, and many benefits of cooperative ARQ schemes are revealed.

This letter proposes a Cell-based Hybrid Index (CHI) for energy conserving k Nearest Neighbor search on air. The proposed CHI provides global knowledge on data distribution for fast decision of the search space and local knowledge for efficient pruning of data items. Simulations show that CHI outperforms the existing indexing schemes in terms of tuning time and energy efficiency. With respect to access time, it outperforms them except the distributed indexing scheme optimized for access time.