We propose a cooperative spectrum sensing scheme based on sub-Nyquist sampling in cognitive radios. Our main purpose is to understand the uncertainty caused by sub-Nyquist sampling and to present a sensing scheme that operates at low sampling rates. In order to alleviate the aliasing effect of sub-Nyquist sampling, we utilize cooperation among secondary users and the sparsity order of channel occupancy. The simulation results show that the proposed scheme can achieve reasonable sensing performance even at low sampling rates.

Massive MIMO is widely recognized as an essential technology for 5G. Together with newly allocated spectrum (bandwidth) and network densification (small cells), it is expected to play a key role in coping with the ongoing explosion in data-traffic demand and services. Compared to 4G MIMO technologies, massive MIMO can offer large gains in cell spectral efficiency, which, in combination with small cells and additional bandwidth, can translate into vast gains in throughput per unit area. We briefly overview the most promising TDD and FDD operation modes for massive MIMO, and discuss their potential benefits and challenges considering operation over different tiers and frequency bands. TDD operation is naturally suited to massive MIMO and can offer “massive MIMO” gains, with simple in-cell processing, low overheads and low end-to-end latencies. We also briefly describe some important massive MIMO activities towards 5G, including standardization efforts, system development and experimental trials.

In this paper we present a novel treatment of cellular automata (CA) from an algebraic point of view. CA on monoids associated with Σ-algebras are introduced. Then an extension of Hedlund's theorem which connects CA associated with Σ-algebras and continuous functions between prodiscrete topological spaces on the set of configurations are discussed.

Suppose that we are given two vertex covers C0 and Ct of a graph G, together with an integer threshold k ≥ max{|C0|, |Ct|}. Then, the vertex cover reconfiguration problem is to determine whether there exists a sequence of vertex covers of G which transforms C0 into Ct such that each vertex cover in the sequence is of cardinality at most k and is obtained from the previous one by either adding or deleting exactly one vertex. This problem is PSPACE-complete even for planar graphs. In this paper, we first give a linear-time algorithm to solve the problem for even-hole-free graphs, which include several well-known graphs, such as trees, interval graphs and chordal graphs. We then give an upper bound on k for which any pair of vertex covers in a graph G has a desired sequence. Our upper bound is best possible in some sense.

Software architecture recovery techniques are often adopted to derive a module view of software from its source code in case software architecture documents are unavailable or outdated. The module view is one of the most important perspectives of software architecture. In this paper, we propose a novel approach to derive a module view by adaptively integrating structural dependency and textual similarity. Our approach utilizes Newman modularity and Shannon information entropy to determine the appropriate weights of the dependencies during the integration. We apply our approach to various open-source projects and show the experimental results validating the effectiveness of the approach.

Infrastructures for the evaluation of the state of health of individuals using a standardized communication network consisting of advanced instruments and subsequent data analysis have been developed. Here we report that this developed infrastructure has been tested in the field in 100 houses and involving almost 300 users. The communication protocol part of this infrastructure has been standardized as IEEE 11073-20601. Continua Health Alliance, an international not-for-profit industry organization which has nearly 230 member companies, has adopted this IEEE 11073-20601 to establish an ecosystem of interoperable personal connected health systems that empower individuals and organizations to better manage their health and wellness. Currently nearly 100 Continua certified products are available in public including smartphone.

Web Service Business Process Execution Language (BPEL) has become the de facto standard for developing instant service-oriented workflow applications in open environment. The correctness and reliability of BPEL processes have gained increasing concerns. However, the unique features (e.g., dead path elimination (DPE) semantics, parallelism, etc.) of BPEL language have raised enormous problems to it, especially in path feasibility analysis of BPEL processes. Path feasibility analysis of BPEL processes is the basis of BPEL testing, for it relates to the test case generation. Since BPEL processes support both parallelism and DPE semantics, existing techniques can't be directly applied to its path feasibility analysis. To address this problem, we present a novel technique to analyze the path feasibility for BPEL processes. First, to tackle unique features mentioned above, we transform a BPEL process into an intermediary model — BPEL control flow graph, which is proposed to abstract the execution flow of BPEL processes. Second, based on this abstraction, we symbolically encode every path of BPEL processes as some Satisfiability formulas. Finally, we solve these formulas with the help of Satisfiability Modulo Theory (SMT) solvers and the feasible paths of BPEL processes are obtained. We illustrate the applicability and feasibility of our technique through a case study.

Software peer review is regarded as one of the most important approaches to preserving software quality. Due to the distributed collaborations in Open Source Software (OSS) development, the review techniques and processes conducted in OSS environment differ from the traditional review method that based on formal face-to-face meetings. Unlike other related works, this study investigates peer review processes of OSS projects from the social perspective: communication and interaction in peer review by using social network analysis (SNA). Moreover, the relationship between peer review contributors and their activities is studied. We propose an approach to evaluating contributors' activeness and social relationship using SNA named Peer Review Social Network (PeRSoN). We evaluate our approach by empirical case study, 326,286 review comments and 1,745 contributors from three representative industrial OSS projects have been extracted and analyzed. The results indicate that the social network structure influences the realistic activeness of contributors significantly. Based on the results, we suggest our approach can support project leaders in assigning review tasks, appointing reviewers and other activities to improve current software processes.

Nearest-neighbor-search classifiers are attractive but they have high intrinsic computational demands which limit their practical application. In this paper, we propose a coprocessor for k (k with k≥1) nearest neighbor (kNN) classification in which squared Euclidean distances (SEDs) are mapped into the clock domain for realizing high search speed and energy efficiency. The minimal SED searching is carried out by weighted frequency dividers that drastically reduce the normally exponential increase of the worst-case search-clock number with the bit width of vector components to only a linear increase. This also results in low power dissipation and high area-efficiency in comparison to the traditional method using large numbers of adders and comparators. The kNN classifier determines the class of an unknown input sample with a majority decision among the k nearest reference samples. The required majority-decision circuit is integrated with the clock-mapping-based minimal-SED searching architecture and proceeds with the classification immediately after identification of each of the k nearest references. A test chip in 180 nm CMOS technology, which can process 8 dimensions of 32 reference vectors in parallel, achieves low power dissipation of 40.32 mW (at 51.21 MHz clock frequency and 1.8 V supply voltage). Significantly, the distance search circuit consumes only 5.99 mW. Feature vectors with different dimensionality up to 2048 dimensions can be handled by the designed coprocessor due to a dimension extension circuit, enabling large flexibility for usage in different application.

This paper deals with a beamforming and cell ID detection technique for a mobile station (MS) with multiple antenna arrays in millimeter wave (mm-wave) cellular communication systems. Multiple antenna arrays, required to cover the entire space around the MS, can be used to estimate the direction of arrivals (DoAs) and cell IDs, form beams in the direction of DoAs, select a serving cell in a cooperative manner, and improve BER performance by signal combining. However, a signal may enter the overlapped region formed by two adjacent arrays in the MS, resulting in a double-counting problem during the cell searching period. In this paper, a beamforming and cell detection technique without double-counting is proposed to handle this problem, and they are evaluated by simulation in a simple scenario of an mm-wave cellular system with spatial channel model (SCM).

We experimentally investigate the performance of a distributed Raman amplifier (DRA)-based pulse compressor for a phase modulated signal. A 10 Gb/s return-to-zero (RZ)-differential phase shift keying (DPSK) signal is compressed to picosecond range after transmission. Pulsewidth is continuously compressed in a wide range from 20 to 3.2 ps by changing the pump power of the DRA while the compressed waveforms are well-matched with sech2 function. Error-free operations at bit-error-rate (BER) of 10-9 are achieved for the compressed signals of various pulsewidths with low power penalties within 2.3 dB compared to the back-to-back. After the compression, the 10 Gb/s signal is used to generate a 40 Gb/s RZ-DPSK optical time division multiplexing (OTDM) signal. This 40 Gb/s OTDM signal is then successfully demultiplexed to 10 Gb/s DPSK signal by using an optical gate based on four-wave mixing (FWM) in a highly nonlinear fiber (HNLF).

Cache memories are the major application of high-speed SRAMs, and they are frequently installed in high performance logic VLSIs including microprocessors. This paper presents a 4-way set-associative, SOI cache-tag memory. To obtain higher operating speed with less power dissipation, we devised an I/O-separated memory cell with a dual-rail wordline, which is used to transmit complementary selection signals. The address decoding delay was shortened using CMOS dual-rail logic. To enhance the maximum operating frequency, bitline's recovery operations after writing data were eliminated using a memory array configuration without half-selected cells. Moreover, conventional, sensitive but slow differential amplifiers were successfully removed from the data I/O circuitry with a hierarchical bitline scheme. As regards the stored data management, we devised a new hardware-oriented LRU-data replacement algorithm on the basis of 6-bit directed graph. With the experimental results obtained with a test chip fabricated with a 0.25-µm CMOS/SIMOX process, the core of the cache-tag memory with a 1024-set configuration can achieve a 1.5-ns address access time under typical conditions of a 2-V power supply and 25°C. The power dissipation during standby was less than 14 µW, and that at the 500-MHz operation was 13-83 mW, depending on the bit-stream data pattern.

In this study, to obtain a more accurate analysis of the temperature in microwave coagulation therapy (MCT) for liver cancer, the water content ratios of dehydrated liver tissue and the dependencies of the dielectric and thermal constants of the tissue on the water content ratios were investigated in tissue heated at 2.45GHz. Swine liver tissues were heated and dehydrated under various conditions, and the water content ratios and dielectric and thermal constants were measured. The results indicated that the water content ratio of the tissue depended on the heating temperature and that the dielectric constants (relative permittivity and electrical conductivity) and thermal constants (specific heat and thermal conductivity) of the dehydrated tissues strongly depended on the water content ratio. Based on these results, numerical analyses of the electromagnetic field and temperature inside the liver tissue heated with a coaxial-slot antenna were conducted. Incorporating information on the water content ratio improved the accuracy of temperature calculations in MCT.

We have developed a wavelength-swept laser source with ultrahigh phase stability. A potassium tantalate niobate (KTa1-xNbxO3, KTN) single crystal was employed as an electro-optic deflector for a high-speed wavelength sweep in the laser cavity. The device structure and performance of a KTN deflector is described. The device includes the beam-shaping optics, which can enhance the resolution of a KTN deflector. A 200-kHz sweep rate was obtained with an average output power of 20mW and a coherence length of 8mm for a wavelength range exceeding 100nm. We demonstrated a swept source with ultrahigh phase stability in the 1.3µm wavelength range as a result of the low-jitter operation of the deflector. The standard deviation of timing jitters measured between adjacent A-lines was confirmed to be less than 78ps, which corresponds to a phase difference of 0.017 radians at a Michelson interferometer path difference of 1.5mm. In addition to realizing the phase stability of neighboring A-lines, a long-term stable sweep was demonstrated by eliminating the refresh operation that was previously needed to prevent output power decay.

A new design method for a high-order series-coupled microring filter using Chebyshev filter condition was proposed and its application to the design of a wavelength-selective switch (WSS) was discussed. In the proposed method, the propagation loss in a microring resonator, coupling loss at a coupler, and a free spectral ranges (FSR) in a microring resonator are considered for the first time. It was found that for high-order series coupled microring resonators, the WSS designed using Chebyshev condition has more boxlike filter responses and high extinction ratio, compared with that designed using Butterworth condition, in the case where the round-trip loss in a microring is relatively large. In addition, the fourth-order series-coupled microring WSS with boxlike responses was successfully designed, considering Vernier effect for a larger FSR and shift in resonant wavelength.

In lossy image/video encoding, there is a compromise between the number of bits and the extent of distortion. Optimizing the allocation of bits to different sources, such as frames or blocks, can improve the encoding performance. In intra-frame encoding, due to the dependency among macro blocks (MBs) introduced by intra prediction, the optimization of bit allocation to the MBs usually has high complexity. So far, no practical optimal bit allocation methods for intra-frame encoding exist, and the commonly used method for intra-frame encoding is the fixed-QP method. We suggest that the QP selection inside an image/a frame can be optimized by aiming at the constant perceptual quality (CPQ). We proposed an iteration-based bit allocation scheme for H.264/AVC intra-frame encoding, in which all the local areas (which is defined by a group of MBs (GOMBs) in this paper) in the frame are encoded to have approximately the same perceptual quality. The SSIM index is used to measure the perceptual quality of the GOMBs. The experimental results show that the encoding performance on intra-frames can be improved greatly by the proposed method compared with the fixed-QP method. Furthermore, we show that the optimization on the intra-frame can bring benefits to the whole sequence encoding, since a better reference frame can improve the encoding of the subsequent frames. The proposed method has acceptable encoding complexity for offline applications.

In this letter, a new method is presented to suppress fractional pseudocodewords by eliminating small instantons of irregular low-density parity-check (LDPC) codes under the linear programming (LP) decoding over the binary symmetric channel (BSC). By appending several new rows found by the integer linear programming formulation to the original parity-check matrix, the optimal distribution spectrum of BSC-instantons in the modified code is obtained. Simulation results show that the proposed method can improve the fractional distance of parity-check matrices and considerably enhance the error-correcting performance of irregular LDPC codes under the LP decoding at the cost of a slightly loss of the original code rate.