We propose an N-channel power-compensated reconfigurable optical add/drop multiplexer (ROADM) based on using fiber Bragg gratings (FBGs). Both tunable FBGs and wavelength-fixed FBGs are used in this ROADM. By using the dual-pass amplification scheme with two pieces of erbium doped fibers, an 8.0 dB optical net gain has been achieved with a gain variation less than 0.5 dB for each add/drop/pass-through channel. System performance was studied for a four-WDM-channel 10 Gb/s100-km lightwave transmission trial network and bit error rate of 10-9 is observed for the 50 km added signal, 100 km pass-through signal and 50 km dropped signal at -18.3, -19.4 and -18.9 dBm received power, respectively. Only 1.1 dB of power penalty was observed compared to the back-to-back transmission.

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.

This study employs secret codes and secret keys based on the elliptic curve to construct an elliptic curve cryptosystem with a dynamic access control system. Consequently, the storage space needed for the secret key generated by an elliptic curve dynamic access control system is smaller than that needed for the secret key generated by exponential operation built on the secure filter (SF) dynamic access control system. Using the elliptic curve to encrypt/decrypt on the secure filter improves the efficiency and security of using exponential operation on the secure filter in the dynamic access control system. With the proposed dynamic elliptic curve access control system, the trusted central authority (CA) can add/delete classes and relationships and change the secret keys at any time to achieve an efficient control and management. Furthermore, different possible attacks are used to analyze the security risks. Since attackers can only obtain the general equations for the elliptic curve dynamic access control system, they are unable to effectively perform an elliptic curve polynomial (ECP) conversion, or to solve the elliptic curve discrete logarithm problem (ECDLP). Thus, the proposed elliptic curve dynamic access control system is secure.

Effect of dispersions of medium parameters and structure on the recording performance was systematically investigated. Moderately increased M-H loop slope is effective for obtaining higher thermal stability, smaller saturation fields, and higher resolution. It was found that the most influential factor is the dispersion in anisotropy field, Hk. Small Hk dispersion reduced the noise when exchange coupled media were used. Reduced grain size and a stacked structure of the media were expected to give a restricted gain in the signal to noise ratio.

Shift margins in down and cross track directions and skew angle were investigated using micromagnetic simulation with a shielded planar head for patterned media with an areal density of 1 Tbit/in2. The shift margins were quantitatively estimated using parameters of the head field and the magnetic properties of media. It is essential to use a head with a higher field gradient and a medium with a small field width between saturation and nucleation fields, to obtain a larger down track shift margin, and a head with a narrower cross track field distribution to obtain a larger cross track shift margin and skew angle margin.

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).

In this paper, we presented a computer simulation analysis of high-density hologram recording, which is a promising mass optical memory technique. A simulation method for off-axis speckle-shift multiplexed recording by three-dimensional computer simulation analysis was presented, as well the signal evaluation of recording and reproduction. By this simulation method, the characteristic features of recording and reproduction are studied from the viewpoints of signal-to-noise-ratio and the reproduced image's quality, and a high-density speckle-shift multiplexed recording condition is proposed.

There are two methods of writing servo signals with high speed in a perpendicular magnetic recording medium by magnetic duplication: bit printing (BP) and edge printing (EP). In this study, the influence of spacing between master and slave media on duplication characteristics in both BP and EP has been investigated by the three-dimensional finite-element method. The results show that the duplication characteristic in each method is deteriorated with a large spacing. Also, the influence of a small spacing is stronger in BP than in EP.

We propose, in this article, the Hierarchical Behavior-Knowledge Space as an extension of Behavior-Knowledge Space. Hierarchical BKS utilizes ranked level individual classifiers, and automatically expands its behavioral knowledge in order to satisfy given reliability requirement. From the statistical view point, its decisions are as optimal as those of original BKS, and the reliability threshold is a lower bound of estimated reliability. Several comparisons with original BKS and unanimous voting are shown with some experiments.

This paper considers optical transport and packet networks and discusses the constraints and solutions in computation of traffic engineering paths. We categorize the constraints into prunable or non-prunable classes. The former involves a simple metric which can be applied for filtering to determine the path. The latter requires a methodic consideration of more complicated network element attributes. An example of this type of constraints is path loss in which the metric can be evaluated only on a path basis, as opposed to simply applying the metric to the link. Another form of non-prunable constraint requires adaptation and common vector operation. Examples are the switching type adaptation and wavelength continuity, respectively. We provide possible solutions to cases with different classes of constraints and address the problem of path computation in support of traffic engineering in multi-layer networks where a set of constrains are concurrently present. The solutions include the application of channel graph and common vector to support switching type adaptation and label continuity, respectively.

Orthogonal frequency division multiplexing (OFDM) is an attractive technique to accomplish wired or wireless broadband communications. Since it has been adopted as the terrestrial digital-video-broadcasting standard in Europe, it has also subsequently been embedded into many broadband communication standards. Many techniques for frame timing and frequency synchronization of OFDM systems have been studied as a result of its increasing importance. We propose a new technique of simultaneously synchronizing frame timing and frequency utilizing matched filters. First, a new short preamble consisting of short sequences multiplied by a DBPSK coded sequence is proposed. Second, we show that the new short preamble results in a new structure for matched filters consisting of a first matched filter, a DBPSK decoder, and a second matched filter. We can avoid the adverse effects of carrier frequency offset (CFO) when frame timing is synchronized because a DBPSK decoder has been deployed between the first and second matched filters. In addition, we show that the CFO can be directly estimated from the peak value of matched filter output. Finally, our simulation results demonstrate that the proposed scheme outperforms the conventional schemes.

This paper proposes a novel method to suppress tag collision in the ISO 18000-6 type B protocol which is one of the standard protocols of UHF RFID systems. The anti-collision performance in terms of the total identification time is improved by reducing the length of bits and the number of transmission commands required for multi-tag identification in the ISO 18000-6 type B protocol. Simulation results show that the proposed method improves the multi-tag identification time by about 15% over the conventional method, irrespective of the number of tags.

The size-dependent array problem is a problem with systolic arrays such that the size of systolic arrays limits the size of calculations, which in a do-loop structure controls how many times it is repeated and how deep the nesting loops are. A systolic array cannot deal with larger calculations. For the size-dependent array problem, a spiral systolic array has been studied so far. It has non-adjacent connections between PEs, such as loop paths for sending data back so that data flows over the array independently of its own size. This paper takes an approach to the problem without non-adjacent connections. This paper discusses systolic messy arrays for infinite iterative algorithms so that they are independent from the size of calculations. First a systolic messy array called two-square shape is introduced then the properties of two-square shape are summarized: memory function, cyclic addition, and cyclic multiplication. Finally a way of building systolic messy arrays that calculate infinite iterative algorithms is illustrated with concrete examples such as an arithmetic progression, a geometric progression, N factorial, and Fibonacci numbers.

Skin tone detection in conditions where illuminate intensity and/or chromaticity can vary often comes with high computational time or low accuracy. Here a technique is presented integrating chromaticity and intensity normalization combined with a neural skin tone classification network to achieve robust classification faster than other approaches.

We survey traffic matrix models, whose elements represent the traffic demand between source-destination pair nodes. Modeling the traffic matrix is useful for multilayer Traffic Engineering (TE) in IP optical networks. Multilayer TE techniques make the network so designed flexible and reliable. This is because it allows reconfiguration of the virtual network topology (VNT), which consists of a set of several lower-layer (optical) paths and is provided to the higher layer, in response to fluctuations (diurnal) in traffic demand. It is, therefore, important to synthetically generate traffic matrices as close to the real ones as possible to maximize the performance of multilayer TE. We compare several models and clarify their applicability to VNT design and control. We find that it is difficult in practice to make an accurate traffic matrix with conventional schemes because of the high cost for data measurement and the complicated calculations involved. To overcome these problems, we newly introduce a simplified traffic matrix model that is practical; it well mirrors real networks. Next, this paper presents our developed server, the IP Optical TE server. It performs multilayer TE in IP optical networks. We evaluate the effectiveness of multilayer TE using our developed IP Optical server and the simplified traffic matrix. We confirm that multilayer TE offers significant CAPEX savings. Similarly, we demonstrate basic traffic control in IP optical networks, and confirm the dynamic control of the network and the feasibility of the IP Optical TE server.

A precise analysis of the capacity of a wireless downlink packet data system with a fair scheduler is presented. We assume the use of a transmit diversity scheme is operating at each link under the assumption of spatially correlated Rayleigh fading. Numerical results show that spatial fading correlation of the channel improves the capacity of multiuser diversity by reducing the space diversity gain of transmit diversity in each link.

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.

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.

This paper reports a novel design in Photonic Crystal Fibers (PCFs) with nearly zero ultra-flattened dispersion characteristics. We describe the chromatic dispersion controllability taking non-uniform air hole structures into consideration. Through optimizing non-uniform air hole structures, the ultra-flattened zero dispersion PCFs can be efficiently designed. We show numerically that the proposed non-uniform air cladding structures successfully archive flat dispersion characteristics as well as extremely low confinement losses. As an example, the proposed PCF with flattened dispersion of 0.27 ps/(nmkm) from 1.5 µm to 1.8 µm wavelength with confinement losses of less than 10-11 dB/m. Finally, we point out that full controllability of the chromatic dispersion and confinement losses, along with the fabrication technique, are the main advantages of the proposed PCF structure.

To achieve scalability and security, large networks are often structured hierarchically as a collection of domains. In hierarchical networks, the topology and QoS parameters of a domain have to be first aggregated before being propagated to other domains. However, topology aggregation may distort useful information. Although spanning tree aggregation can perfectly encode attribute information of symmetric networks, it can not be applied to asymmetric networks directly. In this paper, we propose a spanning tree based attribute aggregation method for asymmetric networks. The time complexity of the proposed method and the space complexity of its resulted aggregated topology are the same with that of the spanning tree aggregation method in symmetric networks. This method can guarantee that the attributes of more than half of the links in the networks are unaltered after aggregation. Simulation results show that the proposed method achieves the best tradeoff between information accuracy and space complexity among the existing asymmetric attribute aggregation methods.