Dynamic Framed Slotted ALOHA (DFSA) is one of the most popular protocols to resolve tag collisions in RFID systems. In DFSA, it is widely known that the optimal performance is achieved when the frame size is equal to the number of tags. So, a reader dynamically adjusts the next frame size according to the current number of tags. Thus it is important to estimate the number of tags exactly. In this paper, we propose a novel tag estimation and identification method using litmus (test) slots for DFSA. We compare the performance of the proposed method with those of existing methods by analysis. We conduct simulations and show that our scheme improves the speed of tag identification.

New concept of CMOS nonvolatile memory is presented with demonstration of cell implementations. The memory cell, which is a comparator basically, makes use of comparator offset for storage quantity and the FN stress phenomena for cell programming. We also propose the stress-packet operation which is the relevant programming method to finely control the offset of the memory cell. The memory cell is multiple-time programmable while it is implemented in a standard CMOS process. We fabricated the memory cell arrays of the latch comparator and demonstrated that it is rewritten several times. We also investigated the reliability of cell data retention by monitoring programmed offsets for several months.

Non-negative matrix factorization (NMF) is widely used for music transcription because of its efficiency. However, the conventional NMF-based music transcription algorithm often causes harmonic confusion errors or time split-up errors, because the NMF decomposes the time-frequency data according to the activated frequency in its time. To solve these problems, we proposed an NMF with temporal continuity and harmonicity constraints. The temporal continuity constraint prevented the time split-up of the continuous time components, and the harmonicity constraint helped to bind the fundamental with harmonic frequencies by reducing the additional octave errors. The transcription performance of the proposed algorithm was compared with that of the conventional algorithms, which showed that the proposed method helped to reduce additional false errors and increased the overall transcription performance.

Some wireless OFDMA communication systems support the frequency reuse factor of 1. In order to reduce co-channel interference (CCI) caused by neighbor cells, the fractional frequency reuse (FFR) can be employed. A promising frequency partitioning policy and subcarrier allocation for FFR are essential. In this letter, we employ an efficient frequency partitioning mechanism with less interference and propose an efficient subcarrier allocation algorithm to maximize the sum of users capacity under FFR. We show that the proposed algorithm has higher spectral efficiency than the conventional method as well as significantly high system fairness.

In this letter, efficient closed-form formulas for the exact and asymptotic average bit error probability (ABEP) of space shift keying (SSK) systems are derived over Rayleigh fading channels with imperfect channel state information (CSI). Specifically, for a generic 2×NR multiple-input multiple-output (MIMO) system with the maximum likelihood (ML) detection, the impact of imperfect CSI is taken into consideration in terms of two types of channel estimation errors with the fixed variance and the variance as a function of the number of pilot symbols and signal-to-noise ratio (SNR). Then, the explicit evaluations of the bit error floor (BEF) and asymptotic SNR loss are carried out based on the derived asymptotic ABEP formula, which accounts for the impact of imperfect CSI on the SSK system. The numerical results are presented to validate the exactness of our theoretical analysis.

In this letter, we propose an enhanced gentle distributed coordination function (GDCF), which is a simple and effective collision resolution mechanism, to improve the performance of IEEE 802.11 DCF. We compare performance of the enhanced GDCF with that of the legacy DCF and the conventional GDCF via analysis and simulations. The enhanced GDCF introduces a new counter to check the number of consecutively successful transmissions, and the maximum permitted values of the counter differ for different backoff stages. The proposed GDCF is shown to have performance superior to that of the conventional GDCF for various combinations of contending stations and frame length.

This paper presents a coexistence model of IEEE 802.15.4 with IEEE 802.11b interference in fading channels and proposes two adaptive channel allocation schemes. The first avoids the IEEE 802.15.4 interference only and the second avoids both of the IEEE 802.15.4 and IEEE 802.11b interferences. Numerical results show that the proposed algorithms are effective for avoiding interferences and for maximizing network capacity since they select a channel which gives the maximum signal to noise ratio to the system.

Multichannel MAC protocols with a single control channel in a cognitive radio ad hoc network (CRAN) suffer from the bottleneck problem. So a multichannel MAC protocol that can realize a virtual control channel on all available channels is preferred. Discontiguous-Orthogonal Frequency Division Multiplexing (D-OFDM) enables multiple data to be sent and received on discontiguous multiple channels. In this paper, we propose a new cooperative multichannel MAC (CM-MAC) protocol using D-OFDM in a CRAN. In the proposed CM-MAC protocol, a new approach utilizing multiple discontiguous control channels is presented and a remedy to tackle new collision types by the approach using D-OFDM is provided. The proposed mechanism mitigates the bottleneck problem of the protocol using single control channel, but does not need to share hopping patterns between a sender and a receiver. In addition, cooperative communications with relays reduce the time required to send the data of low-rate secondary users (SUs) by enabling relay SUs to relay the data of source SUs. The proposed CM-MAC protocol is shown to enhance throughput. Analysis and simulations indicate that throughput performance improves compared to the MAC protocol using the split phase control channel (SPCC) approach.

When performing measurements in an outdoor field environment, various interference factors occur. So, many studies have been performed to increase the accuracy of the localization. This paper presents a novel probability-based approach to estimating position based on Apollonius circles. The proposed algorithm is a modified method of existing trilateration techniques. This method does not need to know the exact transmission power of the source and does not require a calibration procedure. The proposed algorithm is verified in several typical environments, and simulation results show that the proposed method outperforms existing algorithms.

In this paper, a geometric source separation system using nonnegative matrix factorization (NMF) is proposed. The adaptive beamformer is the best method for geometric source separation, but it suffers from a “target signal cancellation” problem in multi-path situations. We modified the HALS-NMF algorithm for decomposition into bases, and developed an interference suppression module in order to cancel the interference bases. A performance comparison between the proposed and subband GSC-RLS algorithm using a MATLAB® simulation was executed; the results show that the proposed system is robust in multi-path situations.

This paper describes two way satellite system environments on geostationary orbit (GEO) and performance enhancement mechanisms which reduces round trip time (RTT) and supports real-time services. We use performance enhancing proxy (PEP) for reducing round trip time and user-level real-time scheduler for reducing deadline violation tasks. The user-level real-time scheduling method classifies priority of user process into four types and those are reflected in kernel. With these dual performance enhancement mechanisms, we can improve quality of service (QoS) of end-user who connects to the DVB-RCS system.

In this letter, we present a new expression of ergodic capacity for two-wave with diffuse power (TWDP) fading channels. The derived formula is relatively concise and consists of well-known functions even in infinite series form. Especially, the truncated approximate expression and asymptotic formula are also presented, which enable us to obtain useful and physical insights on the effect of TWDP fading on the ergodic capacity for various fading conditions.

This paper describes a digital impedance controller (DIC) [1] for high-speed signal interface. The proposed DIC provides the wide range impedance control covering from 23 Ω to 140 Ω with 3.29% maximum quantization error. The maximum quantization error of the proposed DIC is 2.26% with RQ ranging from 23 Ω to 53 Ω, the same range covered by conventional scheme. The high resolution and wide range impedance control is implemented by using automatic gate voltage optimization. The amount of jitter caused by quantization error is 6.9 ps while 13.8 ps in conventional scheme. The data input valid window is 623 ps at 0.75200 mV and maximum eye open is 641 mV meaning about 10% improvement at 1.5 Gbps/pin DDR3 SRAM interface.

We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than Sarkar's construction which is the previously best known complete binary tree based construction. But only disadvantage is that here we need more key length expansion than that of Shoup's sequential algorithm. But it is not too large as in all practical situations we need just two more masks than Shoup's. Our second algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result, we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its parallelizability performance is less efficient than complete tree based constructions. However if l is getting larger, then the parallelizability of the construction is also getting near to that of complete tree based constructions. We also give a sufficient condition for valid domain extension in sequential domain extension.

Among the broadband wireless communication standards utilized to satisfy the demand for multimedia services, time division duplexing (TDD) is satisfactory for the asymmetric data transmission emphasized in Internet services. In this system, the transition between receiving a frame and transmitting a response must be bounded for an effective use of radio resources. However, the minimized inter-frame space-time requires high processing power. The aim of the present paper is to gain insight into the time latency at the turn-around time of a TDD operation. We also propose a simplified new processor, which is a terminal device-friendly architecture that includes prediction and preparation to support processing of burst-type traffic.

In 1997, M. Matsui proposed secret-key cryptosystems called MISTY 1 and MISTY 2, which are 8- and 12-round block ciphers with a 64-bit block, and a 128-bit key. They are designed based on the principle of provable security against differential and linear cryptanalysis. In this paper we present large collections of weak-key classes encompassing 273 and 270 weak keys for 7-round MISTY 1 and 2 for which they are vulnerable to a related-key amplified boomerang attack. Under our weak-key assumptions, the related-key amplified boomerang attack can be applied to 7-round MISTY 1 and 2 with 254, 256 chosen plaintexts and 255.3 7-round MISTY 1 encryptions, 265 7-round MISTY 2 encryptions, respectively.

This letter suggests an opportunistic resource scheduling scheme for supporting users with variety of services in wireless network. This scheme is designed to increase resource utilization while meeting diverse quality of service (QoS) requirements. It can be achieved by considering the channel status and the urgency for QoS support synthetically.

As the demand for spectrum for future wireless communication services increases, cognitive radio technology has been developed for dynamic and opportunistic spectrum access, which enables the secondary users to use the underutilized licensed spectrum of the primary users. In particular, the recent studies on the MAC protocol for dynamic and opportunistic access have focused on sensing and using the vacant spectrum efficiently. Under the ad-hoc network environment, how the secondary users use the unused channels by the primary users affects the efficient utilization of channels and a cognitive radio system is required to follow the rapid and frequent changes in channel status. In this paper, we propose a self-scheduling multi-channel cognitive MAC (SMC-MAC) protocol, which allows multiple secondary users to transmit data though the sensed idle channels by two cooperative channel sensing algorithms, i.e., fixed channel sensing (FCS) and adaptive channel sensing (ACS), and by slotted contention mechanism to exchange channel request information for self-scheduling. The performance of the proposed SMC-MAC protocol is investigated via analysis and simulations. According to the results, the proposed SMC-MAC protocol is effective in allowing multiple secondary users to transmit data frames effectively on multi-channels and adaptively in response to the primary users' traffic dynamics.

In this paper, a new overload control strategy is proposed for a call control processor (CCP) in the base station controller (BSC) and processor utilization is measured. The proposed overload control strategy can regulate the call attempts by adopting measured processor utilization. A function, specifically a linear interpolation function based on Inverse Transform theory is used to convert controlled predictive average load rate in a call rejection rate. Then a call admission rate is obtained from the call rejection rate. Simulation shows that the proposed algorithm yields better performance than the conventional algorithm does under the heavy transient overload status in terms of call admission rate.

Full-diversity transmission for space-time block codes (STBCs) with multiple transmit antennas can be achieved by using coordinate interleaved orthogonal designs (CIODs). To effectively evaluate the performance of CIODs, we derive union upper and lower bounds on the symbol-error rate (SER) and a corresponding asymptotic diversity order of symmetric structured CIOD, in particular, with two transmit antennas over quasi-static spatially uncorrelated/correlated frequency-nonselective Rayleigh fading channels. Some numerical results are provided to verify our analysis.