We introduce an adaptive subchannel, bit, and power allocation (ASBPA) algorithm to maximize the bandwidth efficiency of the mobile communication system that use orthogonal frequency division multiplexing (OFDM). We propose a suboptimal rate adaptive ASBPA algorithm that guarantees fairness in resource allocation and overcomes inherent co-channel interference (CCI) in the cellular system. Furthermore, we evaluate the maximum possible bandwidth efficiency of the cellular OFDM system achieved by the ASBPA algorithm which is practical to implement. Our simulation results show that the proposed algorithm outperforms the existing ones and achieves the cellular bandwidth efficiency of up to 5 b/s/Hz/cell. We also investigate some of the conditions that govern the bandwidth efficiency of the cellular OFDM system using the proposed ASBPA algorithm.

Three distortion reduction filters for radio-on-fiber systems are proposed and evaluated from the standpoint of improvements in in-band third order intermodulation (IM3) components (spurious components), insertion loss, temperature stability and so on. The basic filter configuration includes optical comb filter, RF (radiowave frequency) comb filter, and RF dual band rejection filter (DBRF). Experiments are conducted at 2 GHz band for frequency separation Δf=5 MHz and 100 MHz in the temperature range of -10 to +50. These filters can reduce IM3 components even in the saturation region, unlike conventional linearizers. An optical comb filter can reduce IM3 components more than 20 dB and noise level around 10 dB if its polarization controller is properly adjusted, but its insertion loss is large and stability against vibration is very poor. The proposed RF comb filter and RF-DBRF can reduce IM3 components by more than 20 dB and noise level by more than 3 dB. Their stability against vibration and temperature change is good, and insertion losses are 1-2 dB for Δf=100 MHz.

This paper proposes new resource management schemes for multiple data streams in an orthogonal frequency and space division multiplex access (OFSDMA) system using Radio-on-Fiber (RoF) ubiquitous antennas. The proposed schemes classify the services into some classes in which the number of sub-carriers is dynamically assigned according to the requested data size. The computer simulation results show that the proposed schemes improve the number of users satisfying the required bit error rate (BER) level as well as the average throughput and also show that the RoF ubiquitous antennas can improve system capacity.

In this paper, we propose an integral-type T-S fuzzy control scheme to deal with the regulation problem of buck converters without current sensors. This current sensorless control of converters provides the output voltage to achieve zero steady-state error and is with high robust performance. The stability of the overall closed-loop system is rigorously analyzed by using Lyapunov's method. Based on an appropriate assumption, the separation principle can still succeed in the control problems. Hence, the controller and observer gains can be separately obtained by solving LMIs via Matlab's toolbox. The observer-based controller is realized with Simulink and digital signal processors (DSPs). The simulation and experimental results verify the feasibility of the proposed schemes and show the satisfactory performance for the power converters.

In this letter, the system capacity of multiuser diversity combined with spatial multiplexing schemes is analyzed. An analytic expression is derived for the ergodic system capacity with multiuser scheduling and dual multi-input multi-output (MIMO) systems by using a tight lower bound of the link capacity. The proposed analytic approach is verified through comparisons between analytic and simulated results, and is shown to make fairly precise predictions of the ergodic system capacity and the scheduling gains even when the numbers of antennas and users are small.

A remote user authentication scheme is a two-party protocol whereby an authentication server in a distributed system confirms the identity of a remote individual logging on to the server over an untrusted, open network. Recently, Lee et al. have proposed an efficient nonce-based scheme for remote user authentication using smart cards. This work reviews Lee et al.'s authentication scheme and provides a security analysis on the scheme. Our analysis shows that Lee et al.'s scheme does not achieve its basic aim of authenticating remote users and furthermore has a very hazardous method for changing passwords. In addition, we recommend some changes to the scheme so that it can attain at least its main security goal.

We propose and demonstrate a new fabrication process of a microchannel using the Damascene process. This process aims to integrate photonic circuits with microchannels fabricated in a glass film. The microchannel is fabricated by the removal of the sacrificial layer after a sacrificial layer is formed by the Damascene process and the cover is formed by sputter deposition. A thin cover layer can be formed by the sacrificial method, because the cover layer is supported by the sacrificial layer during film formation. The cover layer is hermetically sealed, since it is formed by radio frequency (RF) sputtering deposition. The thickness is 1 µm and the width ranges from 3.5 to 8 µm. Using the proposed microchannel fabrication method, we prepared a microelectromechanical system (MEMS) optical switch using microfluidics, and we confirmed its functional operation. This optical switch actuates a minute droplet of liquid injected into the microchannel using Maxwell's stresses. Light propagates straight through the waveguide so that the light passes through the microchannel when the droplet is in the microchannel, but the light rays are completely reflected into a crossed waveguide when the droplet is not in the microchannel. Since this fabrication method uses techniques common to those in the formation of copper wiring in an IC chip, it can be used in the microchannel process.

Adaptation process of retina helps human visual system to see a high dynamic range scene in real world. This paper presents a simple static local adaptation method for high dynamic range image compression based on a retinal model. The proposed simple model aims at recreating the same sensations between the real scene and the range compressed image on display device when viewed after reaching steady state local adaptation respectively. Our new model takes the display adaptation into account in relation to the scene adaptation based on the retinal model. In computing local adaptation, the use of nonlinear edge preserving bilateral filter presents a better tonal rendition in preserving the local contrast and details while avoiding banding artifacts normally seen in local methods. Finally, we demonstrate the effectiveness of the proposed model by estimating the color difference between the recreated image and the target visual image obtained by trial and error method.

This paper presents a fast elemental image generation algorithm, called the Viewpoint Vector Rendering (VVR), for the computer-generated integral imaging system. VVR produces a set of elemental images in real-time by assembling the segmented area of the directional scenes taken from a range of viewpoints. This algorithm is less affected by system factors such as the number of elemental lens and the number of polygons. It also supports all display modes of the integral imaging system, real, virtual and focused mode. This paper first describes the characteristics of integral imaging system. It then discusses the design, implementation, and performance evaluation of the VVR algorithm, which can be easily adapted to render the integral images of complex 3D objects.

Providing data availability in a high performance computing environment is very important, especially in this data-intensive world. Most clusters either equip with RAID (Redundant Array of Independent Disks) devices or use redundant nodes to protect data from loss. However, neither of these can really solve the reliability problem incurred in a striped file system. Striping provides an efficient way to increase I/O throughput both in the distributed and parallel paradigms. But it also reduces the overall reliability of a disk system by N fold, where N is the number of independent disks in the system. Parallel Virtual File System (PVFS) is an open source parallel file system which has been widely used in the Linux environment. Its striping structure is good for performance but provides no fault tolerance. We implement Reliable Parallel File System (RPFS) based on PVFS but with reliability support. Our quantitative analysis shows that MTTF (Mean Time To Failure) of our RPFS is better than that of PVFS. Besides, we propose a parity cache table (PCT) to alleviate the penalty of parity updating. The evaluation of our RPFS shows that its read performance is almost the same as that of PVFS (2% to 13% degradation). As to the write performance, 28% to 45% improvement can be achieved depending on the behavior of the operations.

This paper describes a flexible strategy to generate candidate answers for factoid questions in Question Answering (QA) systems. Most QA systems have predefined the conceptual categories for candidate answers. But if the conceptual category of answers to any question is not prepared in the QA system, it is hard to extract correct answers to that question. Therefore, we propose an extraction method for IS-A relation patterns which describe relations between the nominal target concepts of question and candidate answers. The extracted IS-A relation patterns can be used for questions with an unexpected target concept.

Software defined radio, which uses reconfigurable signal processing devices, requires the determination of multiple unknown parameters to realize the potential capabilities of adaptive communication. Evolutional algorithms are optimal multi dimensional search techniques, and are well known to be effective for parameter determination. This letter proposes an evolutional algorithm for learning the mobile time-varying channel parameters without any specific assumption of scattering distribution. The proposed method is very simple to realize, but can provide precise channel estimation results. Simulations of an OFDM system show that for an example of OFDM communication under the time-varying fading channel, the proposed learning method can achieve the better BER performance.

Recently, system level design languages (SLDLs), which can describe both hardware and software aspects of the design, are receiving attentions. Analog mixed-signal (AMS) extensions to SLDLs enable current discrete-oriented SLDLs to describe and simulate not only digital systems but also digital-analog mixed-signal systems. In this paper, we present our work on the AMS extension to one of the system level design language--SpecC. The extended language supports designer to describe all the analog, digital and software aspects in a universal language.

A nonlinear optical fiber loop mirror (NOLM) adapted for all-optical 2R operation at ultrahigh bit-rates was experimentally and theoretically investigated. The proposed NOLM was created by adding inline/external fiber polarizers and also an inline optical phase-bias compensator (OPBC) to a standard NOLM. A theoretical investigation revealed that the operation of the standard NOLM became unstable due to residual polarization crosstalk of the polarization-maintaining optical components making up the NOLM, and that it could be dramatically improved with the inline/external polarizers. The NOLM with the polarizers ensured stable switching operation with high switching-dynamic-range (>30 dB) against the change of the wavelength of the input clock pulses, and the change of the environment temperature. We also experimentally verified that the OPBC played a dramatic role to ensure excellent dynamic switching performance of the NOLM, and to achieve signal-Q-recovery of the regenerated signals. All optical 2R experiments at 40 Gb/s and 160 Gb/s were performed with the modified NOLM. Signal regeneration with improved extinction ratio and signal Q value was successfully demonstrated. Q-recovery to the input of the control pulses degraded with ASE noise accumulation was also successfully achieved.

This paper considers the optimal generator matrices of a given binary cyclic code over a binary symmetric channel with crossover probability p→0 when the goal is to minimize the probability of an information bit error. A given code has many encoder realizations and the information bit error probability is a function of this realization. Our goal here is to seek the optimal realization of encoding functions by taking advantage of the structure of the codes, and to derive the probability of information bit error when possible. We derive some sufficient conditions for a binary cyclic code to have systematic optimal generator matrices under bounded distance decoding and determine many cyclic codes with such properties. We also present some binary cyclic codes whose optimal generator matrices are non-systematic under complete decoding.

A multiple-source system for rendering the sound pressure distribution in a target region can be modeled as a multi-input-multi-output (MIMO) system with the inputs being the source strengths and the outputs being the pressures on multiple measuring points/sensors. In this paper, we propose a target-oriented acoustic radiation generation technique (TARGET) for sound field control. For the MIMO system of a given geometry, a series of basic radiation modes, namely, target-oriented radiation modes (TORMs) can be derived using eigenvector analysis. Different TORMs have different contributions to the system control gain, which is defined as the ratio of the acoustic energy generated in the target zone to the transmitter output power. The TARGET can be effectively applied to the sound reproduction and suppression, which correspond the generations of bright and dark zone respectively. In acoustically bright zone generation and sound beamforming, the highest-gain TORM can be employed to determine the optimal source strengths. In active noise control, the strengths of the secondary sources can be derived using low-gain TORMs. Simulation results show that the proposed method has better or comparable performance than the traditional techniques.

Independent shadowing losses are often assumed for evaluating the link capacity of direct sequence code division multiple access (DS-CDMA) cellular system. However, shadowing losses may be partially correlated since the obstacles surrounding a mobile station block similarly the desired signal and the interfering signals. In this letter, we discuss how the shadowing correlation impacts the reverse link capacity of a power-controlled DS-CDMA cellular system, by numerical analysis.

This letter proves the finish time predictability of EDZL (Earliest Deadline Zero Laxity) scheduling algorithm for multiprocessor real-time systems, which is a variant of EDF. Based on the results, it also shows that EDZL can successfully schedule any periodic task set if its total utilization is not greater than (m+1)/2, where m is the number of processors.

This letter describes the first derivatives estimation of nonlinear parameters through an embedded identifier in the hybrid system by using a feed-forward neural network (FFNN). The hybrid systems are modelled by the differential-algebraic-impulsive-switched (DAIS) structure. The FFNN is used to identify the full dynamics of the hybrid system. Moreover, the partial derivatives of an objective function J with respect to the parameters are estimated by the proposed identifier. Then, it is applied for the identification and estimation of the non-smooth nonlinear dynamic behaviors due to a saturation limiter in a practical engineering system.

This paper presents an algorithm-level interpretation of fast adder structures in binary/multiple-valued logic. The key idea is to employ a unified representation of addition algorithms called Counter Tree Diagrams (CTDs). The use of CTDs makes it possible to describe and analyze addition algorithms at various levels of abstraction. A high-level CTD represents a network of coarse-grained components associated with multiple-valued logic devices, while a low-level CTD represents a network of primitive components directly mapped onto binary logic devices. The level of abstraction in circuit representation can be changed by decomposition of CTDs. We can derive possible variations of adder structures by decomposing a high-level CTD into low-level CTDs. This paper demonstrates the interpretation of redundant arithmetic adders based on CTDs. We first introduce an extension of CTDs to represent possible redundant arithmetic adders with limited carry propagation. Using the extended version of CTDs, we can classify the conventional adder structures including those using emerging devices into three types in a systematic way.