This letter presents delayed perturbation bounds (DPBs) for receding horizon controls (RHCs) of continuous-time systems. The proposed DPBs are obtained easily by solving convex problems represented by linear matrix inequalities (LMIs). We show, by numerical examples, that the RHCs have larger DPBs than conventional linear quadratic regulators (LQRs).

A reversible data hiding scheme based on the companding technique and the difference expansion (DE) of triplets is proposed in this paper. The companding technique is employed to increase the number of the expandable triplets. The capacity consumed by the location map recording the expanded positions is largely decreased. As a result, the hiding capacity is considerably increased. The experimental results reveal that high hiding capacity can be achieved at low embedding distortion.

An entire dual-mode transceiver capable of both the conventional GFSK-modulated Bluetooth and the Medium-Rate π/4-DQPSK-modulated Bluetooth has been investigated and reported. The transmitter introduces a novel two-point-modulated polar-loop technique without the global feedback to realize reduced power consumption, small chip area and also high modulation accuracy. The receiver shares all the circuits for both operating modes except the demodulators and also features a newly-proposed cancellation technique of the carrier-frequency offset. The transceiver has been confirmed by system or circuit simulations to meet all the dual-mode Bluetooth specifications. The simulation results show that the transmitting power can be larger than 10 dBm while achieving the total power efficiency above 30% and also RMS DEVM of 0.050. It was also confirmed by simulation that the receiver is expected to attain the sensitivity of -85 dBm in both modes while satisfying the image-rejection and the blocker-suppression specifications. The proposed transceiver will provide a low-cost, low-power single-chip RF-IC solution for the next-generation Bluetooth communication.

We propose an effective subcarrier allocation scheme for multiuser orthogonal frequency division multiple access (OFDMA) system in the downlink transmission with low computational complexity. In the proposed scheme, by taking multiple attributes of a user's channel, such as carrier gain decrease rate and variation from the mean channel gain of the system, to determine a rank for the user, subcarriers are then allocated depending on the individual user's rank. Different channel characteristics are used to better understand a user's need for subcarriers and hence determine a priority for the user. We also adopt an attribute weighing scheme to enhance the performance of the proposed scheme. The scheme is computationally efficient, since it avoids using iterations for the algorithm convergence and also common water-filling calculations that become more complex with increasing system parameters. Low complexity is achieved by allocating subcarriers to users depending on their determined rank. Our proposed scheme is simulated in comparison with other mathematically efficient subcarrier allocation schemes as well as with a conventional greedy allocation scheme. It is shown that the proposed method demonstrates competitive results with the simulated schemes.

The article describes recent adaptive estimation algorithms over distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit the spatial dimension, while it also evolves locally to account for the time dimension. Algorithms of the least-mean-squares and least-squares types are described. Both incremental and diffusion strategies are considered.

For reducing bit errors on wireless channels, we have proposed the multiroute coding scheme on multiple routes for wireless multihop networks. In this paper, we introduce ARQ to our multiroute coding scheme. In our multiroute coding scheme, a destination node combines and decodes subpackets which are encoded and divided by a source node. Each intermediate node relays a subpacket, that is, only a part of a packet. Therefore, intermediate nodes cannot detect packet errors, and only a destination node can do so after combining and decoding subpackets. We propose an ARQ scheme between a source node and a destination node. We analyze the proposed ARQ scheme and evaluate the system performance.

In previous literature on adaptive transmission in multiuser OFDMA systems, only uncoded case or capacity (coded with infinite length of codeword) has been considered. In this paper, an adaptive transmission algorithm for coded OFDMA systems with practical codeword lengths is investigated. Also, in order to keep the feedback overhead within a practical range, a two-step partial CQI scheme is adopted, which has both better performance and reduced feedback overhead compared to conventional partial CQI schemes. By allowing a long codeword block across all allocated sub-bands with appropriate power and modulation order allocation rather than using short codeword blocks to each sub-band, high coding gain can be obtained, which leads to performance improvement.

Mn1-xZnxFe2O4 thin films with various Zn contents, 300 nm in thickness, were synthesized on glass substrates directly by electroless plating in aqueous solution at 90 without a heat treatment. With XRD, SEM, VSM, the crystallographic structure, morphology of the films and the macroscopic magnetic properties were characterized. The Mn-Zn ferrite films have a single phase spinel structure and well-crystallized columnar grains grow perpendicularly to the substrate. The change of the coercivity is not consistent with that of the bulk materials. As the Zn content in the films increases, the value of Hc decreases firstly, and then increases. At x=0.5, the minimum value of Hc is 3.7 kA/m and the value of Ms is 419.6 kA/m. The hyperfine magnetic fields, cation occupations and the distribution of the magnetic moments in film plane were studied by the conversion electron Mossbauer spectroscopy (CEMS).

Recently, the decision feedback channel estimation based on the minimum mean square error criterion (DF-MMSE-CE) using a fixed DF filter coefficient has been proposed to improve the channel estimation accuracy for DS-CDMA with frequency-domain equalization (FDE). In this paper, we propose adaptive DF (ADF)-MMSE-CE, in which the DF filter coefficient is adapted to changing channel conditions based on a recursive least square (RLS) algorithm. Furthermore, the channel estimate is phase corrected upon the reception of the periodically inserted pilot chip blocks. The average BER performance of DS-CDMA with MMSE-FDE using ADF-MMSE-CE is evaluated by computer simulation in a frequency-selective Rayleigh fading channel and the simulation results show that our proposed scheme is very robust against fast fading.

This paper proposes probabilistic pruning techniques for a Bayesian video face recognition system. The system selects the most probable face model using model posterior distributions, which can be calculated using a Sequential Monte Carlo (SMC) method. A combination of two new pruning schemes at the resampling stage significantly boosts computational efficiency by comparison with the original online learning algorithm. Experimental results demonstrate that this approach achieves better performance in terms of both processing time and ID error rate than a contrasting approach with a temporal decay scheme.

Future optical code division multiple access (CDMA) networks should be designed for multirate and fully integrated multimedia services. In the conventional schemes, multilength optical orthogonal codes (OOCs) are designed to support multirate systems, while variable-weight OOCs are designed to support differentiated quality of service (QoS) for multimedia applications. In this paper, a novel class of optical signature codes; multiple-length variable-weight optical orthogonal codes (MLVW-OOC) is proposed for supporting multirate and integrated multimedia services in optical CDMA networks. The proposed MLVW-OOC has features that are easy to construct variable-weight codes and expanded to multiple-length codes. A construction method for designing MLVW-OOCs up to three levels of codes is discussed. The designed MLVW-OOCs can support differentiated requirements on data rates and QoS for several types of services in the networks. A code analysis for obtaining the value of cross-correlation constraints or multiple access interference (MAI) computation for several levels of codes is also suggested. The cross-correlation constraints of the proposed codes are better than the conventional codes such as multilength OOCs. Finally, the bit error probability performance of the two-level MLVW-OOC is evaluated analytically. The results show that the proposed MLVW-OOC can provide differentiated bit error probability performances for several combinations of data rates and QoS.

Bandwidth management over wired bottleneck links has been an effective way to utilize network resources. For the rapidly emerging IEEE 802.11b Wireless LAN (WLAN), the limited WLAN bandwidth becomes a new bottleneck and requires bandwidth management. Most possible existing solutions only exclusively focus on optimizing multimedia traffic, pure downlink or pure uplink fairness, or are incompatible with IEEE 802.11b. This study proposes a cooperative deficit round robin (co-DRR), an IEEE 802.11b-compatible host-based fair scheduling algorithm based on the deficit round robin (DRR) and distributed-DRR (DDRR) schemes, to make the uplink and downlink quantum calculations cooperate to simultaneously control uplink and downlink bandwidth. Co-DRR uses the standard PCF mode to utilize the contention-free period to compensate for the unfairness in the contention period. Numerical results demonstrate that: co-DRR can scale up to 100 mobile hosts even under high bit error rate (0.0001) while simultaneously achieving uplink/downlink long-term fairness (CoV<0.01) among competing mobile hosts.

Assessment of discovered patterns is an important issue in the field of knowledge discovery. This paper presents an evaluation method that utilizes citation (reference) information to assess the quality of discovered document relations. With the concept of transitivity as direct/indirect citations, a series of evaluation criteria is introduced to define the validity of discovered relations. Two kinds of validity, called soft validity and hard validity, are proposed to express the quality of the discovered relations. For the purpose of impartial comparison, the expected validity is statistically estimated based on the generative probability of each relation pattern. The proposed evaluation is investigated using more than 10,000 documents obtained from a research publication database. With frequent itemset mining as a process to discover document relations, the proposed method was shown to be a powerful way to evaluate the relations in four aspects: soft/hard scoring, direct/indirect citation, relative quality over the expected value, and comparison to human judgment.

In this paper, a sparse multipath channel estimation algorithm is proposed for multiple-input multiple-output (MIMO) single-carrier systems with frequency-domain decision feedback equalizer (FD-DFE). This algorithm exploits the orthogonality of an optimal MIMO preamble based on repeated, phase-rotated, Chu (RPC) sequences, leading to a dramatic reduction in computation. Furthermore, the proposed algorithm employs an improved non-iterative procedure utilizing the Generalized AIC criterion (GAIC), resulting in further computational saving and performance improvement. The proposed scheme is simulated for 802.16d SCa-PHY and SUI-5 sparse channel model under a 22 spatial multiplexing scenario, with the MIMO FD-DFE as the receiver. The result shows that the channel estimation accuracy is significantly improved, and the performance loss compared to the known channel case is only 0.7 dB at the BER of 10-3.

The class of complete complementary sequences (of fixed length) have the ideal correlation properties and are good at increasing the channel usage efficiency but lacks in desirable sequence lengths. In spread spectrum communication systems, sequences having nice correlation properties are important in many ways such as in suppressing multi-user interference, for reliable initial synchronization and in separation of the multipath components. It would be even good if the sequences are easy to construct and have desirable lengths for the system under consideration. In this paper, M sets of sequences that constitute a complete complementary sequences with ith set containing N sequences of length Li each, i = 0, 1, ..., M - 1, is defined and a general method that constructs such a class of complete complementary sequences (of different lengths) is given. The proposed class of complete complementary sequences, constituted by sequence sets of different lengths, does not increase the data rates when short-length sequences are employed.

The conventional successive adaptive loading algorithm, represented by Hughes-Hartogs algorithm, can be used to reduce the transmit power of orthogonal frequency division multiplexing (OFDM) system. However, two major disadvantages exist for this kind of algorithm: One is the long loading time delay caused by the bit-to-bit loading, i.e., only one bit is loaded in every iteration; the other is that there is no flexibility in freely pre-defining the candidate modulation set before the loading is finished. In order to solve these problems, we propose the low-loading-delay parallel adaptive loading algorithms aiming at reducing the transmit power under the condition that the data throughput and error rate are maintained to target values. Two improvements are achieved by the new algorithm. One is that it divides the successive adaptive loading into several independent small-scale loading (SS-Loading) procedures. "SS-Loading" can be performed in parallel mode. To support this, we propose two subband division methods (successive and sorted subband divisions). The simulation results show that for a large range of subband number (1-128), the loading time delay can be remarkably decreased (especially for the parallel adaptive loading based on sorted subband division, i.e., SRT parallel adaptive loading algorithm) with neglectable power efficiency loss, compared with Hughes-Hartogs algorithm. The second improvement is that the new algorithm allows us to pre-define the candidate modulation set, which provide flexibility for the system design, e.g. we can exclude those rarely used modulation modes. We also reveal that Hughes-Hartogs algorithm is actually a special case of the newly proposed algorithm.

We propose the "Two-Step Search scheme with Linear search based Second step (TSS-LS)" by improving the conventional "Two-Step Search scheme with Bit reversal search based Second step (TSS-BS)" for reliable as well as rapid acquisition of Ultra Wide Band (UWB) signals in multipath channels. The proposed TSS-LS utilizes two different thresholds and search windows to achieve fast acquisition. Furthermore, unlike the TSS-BS in which the bit reversal algorithm is applied in both steps, the linear search is adopted for the second step in the proposed TSS-LS to correctly find the starting point in the range of effective delay spread of the multipath channels, and to obtain reliable bit error rate performance of the UWB systems.

Traditional load shedding algorithms for data stream systems calculate current operator selectivity over several run periods and use them to determine where to shed load during the next run period. In this paper, we show that the current selectivity may change due to the implementation of load shedding. Our algorithm, called RLS, determines the optimum drop location by these changed selectivity rather than those pre-calculated values. Simulation results demonstrate that RLS achieves higher accuracy than traditional algorithms.

The present paper proposes two novel and practical schemes for distributed and asynchronous power control in wireless ad hoc networks, in which users dynamically share several frequency bands as in "cognitive radio" networks. These schemes iteratively adjust transmit powers of individual network transmitters with respect to mutually caused interference in the shared bands. Their most attractive feature is that they find network-wide acceptable trade-offs to diverse signal-to-noise and interference (SINR) requirements and efficiently use techniques of stochastic approximation and time-averaging to guarantee a robust performance in random channels. Advantageously, both proposed algorithms do not assume any particular modulation, coding, QoS measure definition or network architecture, which assures their high applicability in the industry and research. Moreover, the broad definition and non-linear nature of these schemes mathematically generalize and thus encompass as a special case many widely deployed power control schemes such as e.g. those for achieving fixed SINR targets or using game-theoretic utility maximization. Simulations are provided to illustrate our approach and its better performance compared to standard algorithms.

Popcorn noise is a large transient noise spike at the reader shortly after writing due to unstable domains in writer yoke. The popcorn noise was found to dependent on write frequency. It is firstly reported that the popcorn noise occurred by the write instability of shielded-single-pole head (SSPH) can be captured in row-bar level QST which is experimentally confirmed. Thus, a PMR head can be rejected by the row-bar level QST. In addition, the writing stress traced by the MR transfer curve can possibly accelerate the head degradation.