This paper defines a Quality of Experience (QoE) parameter for multi-view video streaming service over Wireless Broadband Internet, and proposes cross-layer optimization (CLO) algorithm to maximize the QoE. The proposed CLO algorithm interacts with all layers from PHY layer to video layer. Under the time-varying wireless channel condition, it guarantees service continuity to the user by selecting frames to be transmitted. The CLO technique takes inter-view and the temporal significance of the multi-view video frames into consideration when deciding the Transmission Frame Set (TFS) and its Levels of FEC (LOF). Through simulation of the proposed technique, it is shown that the optimal quality of the multi-view video can be achieved even during hand-over, using the minimum amount of resources. Visual quality of multi-view video streams is improved by about 15.330.2%, especially up to 39.165% during the hand-over. Moreover, continuity of the most important view has been increased by 20.139.1% in comparison with conventional method.

In this paper, we deal with the algebraic immunity of the symmetric Boolean functions. The algebraic immunity is a property which measures the resistance against the algebraic attacks on symmetric ciphers. It is well known that the algebraic immunity of the symmetric Boolean functions is completely determined by a narrow class of annihilators with low degree which is denoted by G(n,). We study and determine the weight support of part of these functions. Basing on this, we obtain some relations between the algebraic immunity of a symmetric Boolean function and its simplified value vector. For applications, we put forward an upper bound on the number of the symmetric Boolean functions with algebraic immunity at least d and prove that the algebraic immunity of the symmetric palindromic functions is not high.

This paper presents efficient frame-synchronous beam pruning for HMM-based automatic speech recognition. In the conventional beam pruning, a few hypotheses that have greater potential to reach various words on a lexical tree are likely to be pruned out by a number of hypotheses that have limited potential, since all hypotheses are treated equally without considering this potential. To make the beam pruning less restrictive for hypotheses with greater potential and vice versa, the proposed method adds to the likelihood of each hypothesis a tentative reward as a monotonically increasing function of the number of reachable words from the HMM state where the hypothesis stays in a lexical tree. The reward is designed not to collapse the ASR probabilistic framework. The proposed method reduced 84% of the processing time for a grammar-based 10k-word short sentence recognition task. For a language-model-based dictation task, it also resulted in an additional 23% reduction in processing time from the beam pruning with the language model look-ahead technique.

We analyze linear channel estimation for MIMO-OFDM systems and propose a spherical linear interpolator in closed-form for the beamforming codewords. We also suggest a hybrid interpolator using a simplified version of the derived interpolator. Simulation results show that the proposed schemes are efficient and competitive with respect to the feedback overhead and have low complexity.

In recent years, techniques such as multiple input multiple output (MIMO) and orthogonal frequency division multiplexing (OFDM) have been developed and combined in MIMO-OFDM systems to provide higher data rates. In addition, the system can be optimized by setting modulation and coding adaptively according to the channel conditions. The overall system performance depends on how accurately the system obtains the channel state information (CSI) and feeds it back to the transmitter. In this paper, we propose a signal-to-noise-ratio (SNR) estimation algorithm in which the preamble is known by both sides of the transceiver. Through simulations of several channel environments, we prove that our proposed algorithm is more accurate than traditional algorithms.

Based on the reiterative maximum signal minus interference level (MSMIL) criterion and adaptive beamforming, a novel interference suppression algorithm is proposed for shared-spectrum multistatic radar that must contend with clutter. In this algorithm, two-dimensional adaptive beamformers are designed for azimuths and range cells. Numerical results show advantages of the proposed method.

Let p be an odd prime number. We define a family of quaternary sequences of period 2p using generalized cyclotomic classes over the residue class ring modulo 2p. We compute exact values of the linear complexity, which are larger than half of the period. Such sequences are 'good' enough from the viewpoint of linear complexity.

In this paper, an optimal power control for minimizing bit error rate (BER) subject to a power constraint for space-time block coded MIMO systems with beamforming over Rayleigh fading channels under imperfect channel state information (CSI) is presented. The optimal power control procedure is developed. It is shown that the Lagrange multiplier for the constrained optimization does exist and is unique. To simplify the power control procedure, a closed-form suboptimal power control scheme is drived based on the asymptotic performance analysis of the optimal power control and Taylor's series expansion. The calculation of the suboptimal power control is straightforward with low computational complexity. Moreover, the suboptimal scheme can provide the BER performance close to that of the optimal power control and is lower than that of the existing suboptimal scheme. Simulation results show that the proposed two power control schemes can provide BER lower than that of the equal power allocation and the existing suboptimal scheme under imperfect CSI.

In this paper, we present a 0.18-µm CMOS fully integrated X-band shock wave generator (SWG) with an on-chip dipole antenna and a digitally programmable delay circuit (DPDC) for pulse beam-formability in short-range and hand-held microwave active imaging applications. This chip includes a SWG, a 5-bit DPDC and an on-chip wide-band meandering dipole antenna. By using an integrated transformer, output pulse of the SWG is sent to the on-chip meandering dipole antenna. The SWG operates based on damping conditions to produce a 0.4-V peak-to-peak (p-p) pulse amplitude at the antenna input terminals in HSPICE simulation. The DPDC is designed to adjust delays of shock-wave outputs for the purpose of steering beams in antenna array systems. The wide-band dipole antenna element designed in the meandering shape is located in the top metal of a 5-metal-layer 0.18-µm CMOS chip. By simulating in Momentum of ADS 2009, the minimum value of antenna's return loss, S 11, and antenna's bandwidth (BW) are -19.37 dB and 25.3 GHz, respectively. The measured return loss of a stand-alone integrated meandering dipole is from -26 dB to -10 dB with frequency range of 7.5-12 GHz. In measurements of the SWG with the integrated antenna, by using a 20-dB standard gain horn antenna placed at a 38-mm distance from the chip's surface, a 1.1-mVp-p shock wave with a 9-11-GHz frequency response is received. A measured 3-ps pulse delay resolution is also obtained. These results prove that our proposed circuit is suitable for the purpose of fully integrated pulse beam-forming system.

In this paper, we propose a full-duplex relay (FDR) based on a zero-forcing beamforming (ZFBF) for a multiuser MIMO system. The ZFBF is employed at the base station to suppress both the self-interference of the relay and the multiuser interference at the same time. Numerical results show that the proposed FDR can enhance the sum rate performance as compared to the half-duplex relay (HDR), if sufficient isolation between the transmit and receive antennas is ensured at the relay.

This paper proposes a modified per-survivor iterative timing recovery scheme, which exploits a new split-preamble strategy in conjunction with a per-survivor processing soft-output Viterbi algorithm (PSP-SOVA). The conventional split-preamble strategy places a preamble at the beginning of a data sector and uses it to run a phase-locked loop during acquisition to find an initial phase/frequency offset. However, the proposed scheme splits the preamble into two parts. The first part is placed at the beginning of the data sector, whereas the second part is divided into small clusters, each of which is then embedded uniformly within the data stream. This split preamble is utilized to adjust the branch metric calculation in PSP-SOVA to ensure that the survivor path occurs in a correct direction. Results indicate that the proposed scheme yields a better performance than a conventional receiver with separate timing recovery and turbo equalization, and the iterative timing recovery scheme proposed in [1],[2], especially when the timing jitter is large. In addition, we also show that the proposed scheme can automatically correct a cycle slip much more efficiently than the others.

This paper focuses on the coalescing operator applied to the processing of continuous queries with temporal functions and predicates over windowed data streams. Coalescing is a key operation enabling the evaluation of interval predicates and functions on temporal tuples. Applying this operation for temporal query processing on windowed streams brings the challenge of coalescing tuples in a window extent each time the window slides over the data stream. This coalescing becomes even more involving when some tuples arrive out of order. This paper distinguishes between eager coalescing and lazy coalescing, the two known coalescing schemes. The former coalesces tuples during window extent update and the latter does it during window extent scan. With these two schemes, the paper first presents algorithms for updating a window extent for both tuple-based and time-based windows. Then, the problem of optimally selecting between eager and lazy coalescing for concurrent queries is formulated as a 0-1 integer programming problem. Through extensive performance study, the two schemes are compared and the optimal selection is demonstrated.

The panorama image obtained by image stitching can have visible artifacts due to the limitation of alignment accuracy and defects of the optical systems. Moreover, conventional image stitching algorithms cannot be directly applied to a real-time video stitching due to its complexity and waving artifacts. In this paper, we propose a real-time content-aware stitching algorithm which not only finds a seam by using path searching based on the greedy method, but also adaptively updates the seam by detecting objects moving toward the seam. Experimental results show that the proposed algorithm can successfully produce stitched video sequences without the waving and ghost artifacts commonly found in conventional stitching algorithms.

A differential cross-correlation cell ID identification algorithm is proposed for IEEE 802.16e OFDMA cellular system. The cell ID represents the number of the preamble selected by the base station in downlink mode. First, we construct the downlink (DL) preamble structure and signal model with carrier frequency offset (CFO) and channel effects. Next, in order to achieve the initial synchronization, a differential receiver with cross correlation for all preamble patterns is proposed to search for cell ID. Simulation results confirm that the proposed structure is suitable for ITU fading channels and outperforms the conventional cell search system.

In this letter, we study the performance of multi-antenna relay networks with limited feedback beamforming in decode-and-forward (DF) relaying. Closed-form expression for both outage probability and symbol error rate are derived by using the moment generation function (MGF) of the combined signal-to-noise ratio (SNR) at the destination. Subjected to a total power constraint, we also explore adaptive power allocation between source and relay to optimize the performance. Simulations are given to verify the correctness of our theoretical derivations. Results show that the proposed adaptive power allocation solution significantly outperforms the uniform power allocation method.

Constructing degree-optimized resilient Boolean functions with high nonlinearity is a significant study area in Boolean functions. In this letter, we provide a construction of degree-optimized n-variable (n odd and n ≥ 35) resilient Boolean functions, and it is shown that the resultant functions achieve the currently best known nonlinearity.

Conventional class of weak keys on RC4 stream cipher is defined as a specific case that combinations of the first three bytes of secret key satisfy two relational equations. This paper expands and generalizes the classes of weak keys using generalized relational equations and special classes of the internal state (called predictive state). We derive the probability that generalized classes of weak keys leak the information of bytes of the secret key. Furthermore, we enumerate the generalized classes of weak keys and show that most of them leak more information of the secret key than Roos' one.

In this letter, the performance of opportunistic-based two-way relaying with beamforming over Nakagami-m fading channels is investigated. We provide an approximate expression for the cumulative distribution function of the end-to-end signal-to-noise ratio to derive the closed-form lower bounds for the outage probability and average bit error probability as well as the closed-form upper bound for the ergodic capacity. Simulation results demonstrate the tightness of the derived bounds.

In this letter, we address a strategy to enhance the signal-to-interference plus noise ratio (SINR) of the worst-case user by using cooperative transmission from a set of geographically separated antennas. Unlike previously reported schemes which are based on either the power control of individual antennas or cooperative orthogonal transmission, the presented strategy utilizes the minimum-mean-squared error (MMSE) filter structure for beamforming, which provides increased robustness to the external interference as well as the background noise at the receiver. By iteratively updating the cooperative transmission beamforming vector and power control (PC), the balanced SINR is obtained for all users, while the transmission power from each antenna also converges to within the constrained value. It is demonstrated that proposed MMSE beamforming significantly outperforms other existing schemes in terms of the achievable minimum SINR.

In this letter, we propose a revised geographic routing protocol and a scheduling algorithm to support real-time applications, which are often observed in wireless sensor networks. In order to meet real-time requirement, a specific application is modeled as an (m,k)-firm stream that has a property of weakly hard real-time system. In addition, both a priority-based scheduling and a geographic forwarding scheme based on delay, distance, and remaining slack time are newly proposed. Simulations and their analysis are followed to validate the suitability of reduced dynamic failure probability and extended network lifetime.