In this paper, the spatial smoothing (SS) method is extended to the wideband multipath case. By reordering the array input signal and the weight vector, the corresponding covariance matrix of each subarray can be constructed conveniently. Then, a novel wideband beamforming algorithm, based on the SS method (SS-WB), can be achieved by linearly constrained minimum variance (LCMV). Further improvement of the output signal-to-interference-plus-noise ratio (SINR) for SS-WB can be obtained by removing the desired signal in the observed array data with the reconstruction of covariance matrix, which is denoted as wideband beamformer based on modified SS method (MSS-WB). Both proposed algorithms can reduce the desired signal cancellation due to the super decorrelation ability of SS method and MSS-WB can lead to a significantly improved output SINR. The simulations verify their effectiveness in the multipath environment.

In this paper, we propose an access control protocol method that maintains the communication quality of various applications and reduces packet loss of multicasts in wireless local area networks. Multicast transmission may facilitate effective bandwidth use because packets are simultaneously delivered to more than one mobile station by a single transmission. However, because multicast transmissions does not have a retransmission function, communication quality deteriorates because of packet collisions and interference waves from other systems. Moreover, although multicasts are not considered, the communication quality of each application is guaranteed by a priority control method known as enhanced distributed channel access in IEEE802.11e. The proposed method avoids both these issues. Specifically, because the proposed method first transmits the clear-to-send-to-self frame, the multicast packet avoids collision with the unicast packet. We validate the proposed method by computer simulation in an environment with traffic congestion and interference waves. The results show a reduction in multicast packet loss of approximately 20% and a higher multicast throughput improvement compared to conventional methods. Moreover, the proposed method can assure improve multicast communication quality without affecting other applications.

As a prominent feature of Named Data Networking (NDN), in-network caching plays an important role in improving the performance of content delivery. However, if each NDN router indiscriminately caches every data packet passing by (i.e., Caching Everything Everywhere (CEE)), the result can be unnecessarily frequent cache replacement and cache redundancy in en-route routers and thus in-network caches are not utilized in an efficient way [1], [2]. Moreover, managing these in-network caches in a centralized way may lead to excessive resource consumption since the number of these caches is considerable. This work proposes a distributed and opportunistic on-path caching scheme. To be specific, each en-route router independently picks content items to cache in such a way that popular content is more likely to be cached by routers, especially routers near users, and cache redundancy is reduced. Extensive simulations including trace-driven ones in a PoP-level ISP topology suggest that the proposed scheme improves the average cache hit ratio of users' requests and reduces the average hop count as compared to CEE and the other on-path caching algorithms considered herein.

In this paper, we introduce a parallax barrier system that shows high definition autostereoscopy and holds wide viewing zone. The proposed method creates a 4-view parallax barrier system with full display resolution per view by setting aperture ratio to one quarter and using time-division quadplexing, then applies obtained 4-view to 2-view, so that the viewing zone for each eye becomes wider than that from the conventional methods. We build a prototype with two 120,Hz LCD panels and manage to achieve continuous viewing zone with common head-tracking device involved. However, moire patterns and flickers stand out, which are respectively caused by the identical alignments of the color filters on the overlaid LCD panels and a lack of refresh rate of 240,Hz. We successfully remove the moire patterns by changing the structure of the system and inserting a diffuser. We also reduce the flickers by proposing 1-pixel aperture, while stripe shaped noise due to the lack of refresh rate occurs during a blink or a saccade. The stripe noise can be effectively weakened by applying green and magenta anaglyph to the proposed system, where extra crosstalk takes place since the default RGB color filters on LCD panels share certain ranges of wavelength with each other. Although a trade-off turns out to exist between stripe noise and crosstalk from our comparison experiment, results from different settings all hold acceptable quality and show high practicability of our method. Furthermore, we propose a solution that shows possibility to satisfy both claims, where extra color filters with narrow bandwidths are required.

NAND-based block devices such as memory cards and solid-state drives embed a flash translation layer (FTL) to emulate the standard block device interface and its features. The overall performance of these devices is determined mainly by the efficiency of the FTL scheme, so intensive research has been performed to improve the average performance of the FTL scheme. However, its worst-case performance has rarely been considered. The present study aims to improve the worst-case performance without affecting the average performance. The central concept is to distribute the garbage collection cost, which is the main source of performance fluctuations, over multiple requests. The proposed scheme comprises three modules: i) anticipated partial log block merging to distribute the garbage collection time; ii) reclaiming clean pages by moving valid pages to bound the worst-case garbage collection time, instead of performing repeated block merges; and iii) victim selection based on the valid page count in a victim log and the required clean page count to avoid subsequent garbage collections. A trace-driven simulation showed that the worst-case performance was improved up to 1,300% using the proposed garbage collection scheme. The average performance was also similar to that of the original scheme. This improvement was achieved without additional memory overheads.

High efficiency video coding (HEVC) is a video compression standard that outperforms the predecessor H.264/AVC by doubling the compression efficiency. To enhance the intra prediction accuracy, 35 intra prediction modes were used in the prediction units (PUs), with partition sizes ranging from 4 × 4 to 64 × 64 in HEVC. However, the manifold prediction modes dramatically increase the encoding complexity. This paper proposes a fast mode- and depth-decision algorithm based on edge detection and reconfiguration to alleviate the large computational complexity in intra prediction with trivial degradation in accuracy. For mode decision, we propose pixel gradient statistics (PGS) and mode refinement (MR). PGS uses pixel gradient information to assist in selecting the prediction mode after rough mode decision (RMD). MR uses the neighboring mode information to select the best PU mode (BPM). For depth decision, we propose a partition reconfiguration algorithm to replace the original partitioning order with a more reasonable structure, by using the smoothness of the coding unit as a criterion in deciding the prediction depth. Smoothness detection is based on the PGS result. Experiment results show that the proposed method saves about 41.50% of the original processing time with little degradation (BD bitrate increased by 0.66% and BDPSNR decreased by 0.060dB) in the coding gain.

A fully-integrated double-channel 5-Gb/s/ch 2:1 serializer array is designed and fabricated in a standard 0.18-$mu $m CMOS technology, which can be easily expanded to any even-number-channel array, e.g. 12 channels, by means of arrangement in a parallel manner. Besides two conventional half-rate 2:1 serializers, both phase-locked loop and delay-locked loop techniques are employed locally to deal with the involved clocking-related issues, which make the serializer array self-contained, compact and automatic. The system architecture, circuit and layout designs are discussed and analyzed in detail. The chip occupies a die area of 673,$mu $m$, imes ,$667,$mu $m with a core width of only 450,$mu $m. Measurement results show that it works properly without a need for additional clock channels, reference clocks, off-chip tuning, external components, and so on. From a single supply of 1.8,V, a power of 200,mW is consumed and a single-ended swing of above 300,mV for each channel is achieved.

This study presents a proposal for space-saving design of built-in antennas for handset terminals based on the concept of requisite design antenna volume. By investigating the relation between antenna input characteristic and electric near-field around the antenna element and surrounding components inside the terminal, and then evaluating the requisite design antenna volume, we propose the most effective deployment for both the antenna and surrounding components. The results show that our simple proposal can help reduced, by about 17% and 31.75%, the space that the antenna element actually requires at least for stable operation inside the terminal, in the single-band designs for the cellular 2GHz band (1920-2170MHz) and 800MHz band (830-880MHz), respectively. In the dual-band design, we verify that it can reduce, the antenna space by about 35.18%, and completely cover the two above cellular bands with good antenna performance.

Hands-free communications between cellular phones must be robust enough to withstand echo-path variation, and highly nonlinear echoes must be suppressed at low cost, when acoustic echo cancellation or suppression is applied to them. This paper proposes a spectrum-selective nonlinear echo suppression (SS-ES) approach as a solution to these issues. SS-ES is characterized by the selection of either a spectrum of the residual signal from an adaptive filter or a spectrum of the sending input signal depending on the amount of linear echo cancellation in an adaptive filter. Compared to conventional methods, the objective evaluation results of the SS-ES approach show an improvement of approximately 0.8-2.2dB, 0.23-2.39dB, and 0.26-0.50 in average echo return loss enhancement (ERLE), average root-mean-square log-spectral distortion (RMS-LSD), and the perceptual evaluation of speech quality (PESQ) value, respectively, under echo-path variation and double-talk conditions.

In this paper, we propose a parameter estimation method using Volterra kernels for the nonlinear IIR filters, which are used for the linearization of closed-box loudspeaker systems. The nonlinear IIR filter, which originates from a mirror filter, employs nonlinear parameters of the loudspeaker system. Hence, it is very important to realize an appropriate estimation method for the nonlinear parameters to increase the compensation ability of nonlinear distortions. However, it is difficult to obtain exact nonlinear parameters using the conventional parameter estimation method for nonlinear IIR filter, which uses the displacement characteristic of the diaphragm. The conventional method has two problems. First, it requires the displacement characteristic of the diaphragm but it is difficult to measure such tiny displacements. Moreover, a laser displacement gauge is required as an extra measurement instrument. Second, it has a limitation in the excitation signal used to measure the displacement of the diaphragm. On the other hand, in the proposed estimation method for nonlinear IIR filter, the parameters are updated using simulated annealing (SA) according to the cost function that represents the amount of compensation and these procedures are repeated until a given iteration count. The amount of compensation is calculated through computer simulation in which Volterra kernels of a target loudspeaker system is utilized as the loudspeaker model and then the loudspeaker model is compensated by the nonlinear IIR filter with the present parameters. Hence, the proposed method requires only an ordinary microphone and can utilize any excitation signal to estimate the nonlinear parameters. Some experimental results demonstrate that the proposed method can estimate the parameters more accurately than the conventional estimation method.

In this paper, we investigate the minimum-weight codewords of array LDPC codes C(m,q), where q is an odd prime and m ≤ q. Using some analytical approaches, the lower bound on the number of minimum-weight codewords of C(m,q) given by Kaji (IEEE Int. Symp. Inf. Theory, June/July 2009) is proven to be tight for m = 4 and q > 19. In other words, C(4,q) has 4q2(q-1) minimum-weight codewords for all q > 19. In addition, we show some interesting universal properties of the supports of generators of minimum-weight codewords of the code C(4,q)(q > 19).

We focus on a characteristic which is specific to the quantum repeater protocol. In the quantum repeater protocol, quantum states which are generated by the protocol do not depend on receivers. Therefore, we can reuse EPR pairs which are generated before a change of a receiver for the quantum repeater protocol after the change. The purpose of reusing is advancing the finishing time of sharing EPR pairs, which is not equal to increasing the fidelity. In this paper, we construct concrete methods of reusing EPR pairs and analyze the effectiveness of reusing EPR pairs. Besides, we derive conditions in which reusing EPR pairs is effective.

Joint signal detection and channel estimation based on the expectation-maximization (EM) algorithm has been investigated for multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) mobile communications over fast-fading channels. The previous work in [20] developed a channel estimation method suitable for the EM-based iterative receiver. However, it remained possible for unreliable received signals to be repetitively used during the iterative process. In order to improve the EM-based iterative receiver further, this paper proposes spatial removal from the perspective of a message-passing algorithm on factor graphs. The spatial removal performs the channel estimation of a targeted antenna by using detected signals that are obtained from the received signals of all antennas other than the targeted antenna. It can avoid the repetitive use of unreliable received signals for consecutive signal detection and channel estimation. Appropriate applications of the spatial removal are also discussed to exploit both the removal effect and the spatial diversity. Computer simulations under fast-fading conditions demonstrate that the appropriate applications of the spatial removal can improve the packet error rate (PER) of the EM-based receiver thanks to both the removal effect and the spatial diversity.

This paper presents a spatial division (SD) transmission method based on two-ray fading that dispenses with the high signal processing cost of multiple-input and multiple-output (MIMO) detection and antennas with narrow beamwidth. We show the optimum array geometries as functions of the transmission distance for providing a concrete array design method. Moreover, we clarify achievable channel capacity considering reflection coefficients that depend on the polarization, incident angle, and dielectric constant. When the ground surface is conductive, for two- and three-element arrays, channel capacity is doubled and tripled, respectively, over that of free space propagation. We also clarify the application limit of this method for a dielectric ground by analyzing the channel capacity's dependency on the dielectric constant. With this method, increased channel capacity by SD transmission can be obtained merely by placing antennas of wireless transceiver sets that have only SISO (single-input and single-output) capability in a two-ray propagation environment. By using formulations presented in this paper for the first time and adding discussions on the adoption of polarization multiplexing, we clarify antenna geometries of SD transmission systems using polarization multiplexing for up to six streams.

Reducing accident severity is an effective way to improve road safety. In the literature of accident severity analysis, two main disadvantages exist: most studies use classification accuracy to measure the quality of a classifier which is not appropriate in the condition of unbalanced dataset; the other is the results are not easy to be interpreted by users. Aiming at these drawbacks, a novel multi-objective particle swarm optimization (MOPSO) method is proposed to identify the contributing factors that impact accident severity. By employing Pareto dominance concept, a set of Pareto optimal rules can be obtained by MOPSO automatically, without any pre-defined threshold or variables. Then the rules are used to form a non-ordered classifier. A MOPSO is applied to discover a set of Pareto optimal rules. The accident data of Beijing between 2008 and 2010 are used to build the model. The proposed approach is compared with several rule learning algorithms. The results show the proposed approach can generate a set of accurate and comprehensible rules which can indicate the relationship between risk factors and accident severity.

The dynamic time warping (DTW) algorithm is widely used to determine time series similarity search. As DTW has quadratic time complexity, the time taken for similarity search is the bottleneck for virtually all time series data mining algorithms. In this paper, we present a parallel approach for DTW on a heterogeneous platform with a graphics processing unit (GPU). In order to exploit fine-grained data-level parallelism, we propose a specific parallel decomposition in DTW. Furthermore, we introduce an optimization technique called diamond tiling to improve the utilization of threads. Results show that our approach substantially reduces computational time.

Post-Silicon Tunable (PST) buffers are widely adopted in high-performance integrated circuits to fix timing violations introduced by process variations. In typical optimization procedures, the statistical timing analysis of the circuits with PST clock buffers will be executed more than 2000 times for large scale circuits. Therefore, the efficiency of the statistical timing analysis is crucial to the PST clock buffer optimization algorithms. In this paper, we propose a stochastic collocation based efficient statistical timing analysis method for circuits with PST buffers. In the proposed method, we employ the Howard algorithm to calculate the clock periods of the circuits on less than 100 deterministic sparse-grid collocation points. Afterwards, we use these obtained clock periods to derive the yield of the circuits according to the stochastic collocation theory. Compared with the state-of-the-art statistical timing analysis method for the circuits with PST clock buffers, the proposed method achieves up to 22X speedup with comparable accuracy.

This paper proposes a background noise estimation method using an outer product expansion with non-linear filters for ELF (extremely low frequency) electromagnetic (EM) waves. We proposed a novel source separation technique that uses a tensor product expansion. This signal separation technique means that the background noise, which is observed in almost all input signals, can be estimated using a tensor product expansion (TPE) where the absolute error (AE) is used as the error function, which is thus known as TPE-AE. TPE-AE has two problems: the first is that the results of TPE-AE are strongly affected by Gaussian random noise, and the second is that the estimated signal varies widely because of the random search. To solve these problems, an outer product expansion based on a modified trimmed mean (MTM) is proposed in this paper. The results show that this novel technique separates the background noise from the signal more accurately than conventional methods.

This letter proposes an efficient lossless compression method for high dynamic range (HDR) images in OpenEXR format. The proposed method transforms an HDR image to an indexed image and packs the histogram of the indexed image. Finally the packed image is losslessly compressed by using any existing lossless compression algorithm such as JPEG 2000. Experimental results show that the proposed method reduces the bit rate of compressed OpenEXR images compared with equipped lossless compression methods of OpenEXR format.

In this paper, we investigate the problems of the established congestion solution and then introduce a self-adjustable rate control that supports quality of service assurances over multi-hop wireless mesh networks. This scheme eliminates two phases of the established congestion solution and works on the MAC layer for congestion control. Each node performs rate control by itself so network congestion is eliminated after it independently collects its vector parameters and network status parameters for rate control. It decides its transmission rate based on a predication model which uses a rate function including a congestion risk level and a passing function. We prove that our scheme works efficiently without any negative effects between the network layer and the data link layer. Simulation results show that the proposed scheme is more effective and has better performance than the existing method.