Hirokazu TAKENOUCHI Tatsushi NAKAHARA Kiyoto TAKAHATA Ryo TAKAHASHI Hiroyuki SUZUKI
Asynchronous optical packet switching (OPS) is a promising solution to support the continuous growth of transmission capacity demand. It has been, however, quite difficult to implement key functions needed at the node of such networks with all-optical approaches. We have proposed a new optoelectronic system composed of a packet-by-packet optical clock-pulse generator (OCG), an all-optical serial-to-parallel converter (SPC), a photonic parallel-to-serial converter (PSC), and CMOS circuitry. The system makes it possible to carry out various required functions such as buffering (random access memory), optical packet compression/decompression, and optical label swapping for high-speed asynchronous optical packets.
Given the bivariate polynomial f(x,y), let φ(y) be a root of f(x,y) = 0 with respect to x, i.e. φ(y) is a function of y such that f(φ(y),y) = 0. If φ(y) is analytic at y = 0, then we have its power series expansion φ(y) = α0 + α1y + α2y2 + + αpyp + .(1)Let φ(p)(y) denote φ(y) truncated at yp, i.e. φ(p)(y) = α0 + α1y + α2y2 + + αpyp.(2) It is well-known that we can compute power series roots φ(p)(y) by Newton's method. In fact, given the initial value φ(0)(y) = α0 C, the following Newton's methodφ(k)(y) φ(k-1)(y) - (mod yk+1) (3) computes φ(k)(y) (1 k) in expression (2) efficiently (applying the above formula for k = 1,2,, we can compute the power series root φ(p)(y) of any degree p). The above formula (3) is referred to as "symbolic Newton's method" in this paper. From this formula (3), we can see that the numerical errors in the coefficients αs (s = 0,1,...,k - 1) directly affect the numerical error in the coefficient αk. This implies that the symbolic Newton's method is numerically unstable, i.e., a numerical error in the coefficient αk accumulates as the index k increases. Moreover, with the symbolic Newton's method, even if we need only one coefficient αk, we must compute all coefficients αs (s = 0,1,,k - 1). Thus, when we require only one high degree coefficient αk, the symbolic Newton's method is numerically unstable and inefficient. In this paper, given the integer k (> 0), we present a new algorithm to compute the coefficient αk of (1). The new algorithm is numerically stable and requires no computation of the coefficients other than αk itself.
Hiroyuki UENOHARA Takeshi SEKI
The wavelength switching performance of a super-structure-grating DBR laser (SSG-DBR-LD) has been investigated. The lasing wavelength could be selected by directly modulating the wavelength tuning region with the switching time of less than a few nanoseconds. We observed that the pulse width of the output signal in each lasing wavelength monotonically changed with increasing the injection current amplitude when the low level of injection current was fixed. This is considered to be due to the increase of transient time from high level to low level of injection current when the amplitude increases and time duration for carrier density to satisfy the lasing mode at the low level of injection current decreases. For improving the stability of the pulse width of the output signal, a novel method of the mean level of injection current pulse fixed is proposed. Almost the same pulse width for wavelength switching from one supermode to another has been realized because the low level of injection current becomes lower than the conventional method and the time duration for carrier density to satisfy the lasing mode at the low level of injection current increases.
Ilseok HAN Wanyoung KIM Hagbae KIM
This paper presents an optimal load balancing algorithm based on both of the ANFIS (Adaptive Neuro-Fuzzy Inference System) modeling and the FIS (Fuzzy Inference System) for the local status of real servers. It also shows the substantial benefits such as the removal of load-scheduling overhead, QoS (Quality of Service) provisioning and providing highly available servers, provided by the suggested method.
Yohei IWASAKI Nobuo KAWAGUCHI Yasuyoshi INAGAKI
In this paper, we propose an advanced location-based service that we call a direction-based service, which utilizes both the position and direction of a user. The direction-based service enables a user to point to an object of interest for command or investigation. We also describe the design, implementation and evaluations of a direction-based service system named Azim. With this system, the direction of the user can be obtained by a magnetic-based direction sensor. The sensor is also used for azimuth-based position estimation, in which a user's position is estimated by having the user point to and measure azimuths of several markers or objects whose positions are already known. Because this approach does not require any other accurate position sensors or positive beacons, it can be deployed cost-effectively. Also, because the measurements are naturally associated with some degree of error, the position is calculated as a probability distribution. The calculation considers the error of direction measurement and the pre-obtained field information such as obstacles and magnetic field disturbance, which enables robust position measurements even in geomagnetically disturbed environments. For wide-area use, the system also utilizes a wireless LAN to obtain rough position information by identifying base stations. We have implemented a prototype system for the proposed method and some applications for the direction-based services. Furthermore, we have conducted experiments both indoors and outdoors, and exemplified that positioning accuracy by the proposed method is precise enough for a direction-based service.
Huy Hoang PHAM Tetsuki TANIGUCHI Yoshio KARASAWA
In this paper, we propose a multiple-input multiple-output (MIMO) beamforming scheme for a multiuser system in frequency-selective fading channels. The maximum signal-to-noise and interference ratio (MSINR) is adopted as a criterion to determine the transmit and receive weight vectors. In order to maximize the output SINR over all users, two algorithms for base station are considered: the first algorithm is based on the receive weight vector optimization and the second algorithm is based on an iterative update of both transmit and receive weight vectors. Based on the result of single user MIMO beamforming, we analyze the interference channels cancellation ability of multiuser MIMO system. The first algorithm is a simple method and the second algorithm is a performative solution. Through computer simulations, it is shown that multiuser communication system is achievable using the proposed methods in frequency-selective fading condition.
In this letter, we show that some stream authentication schemes using hash chaining are highly vulnerable to denial of service (DoS) attacks. An adversary can disrupt all receivers of group by making use of modifying a few packets in those schemes.
Vicent PLA Jorge MARTINEZ Vicente CASARES-GINER
In this paper we propose a new algorithm for computing the optimal configuration of the Multiple Fractional Guard Channel (MFGC) admission policy in multiservice mobile wireless networks. The optimal configuration maximizes the offered traffic that the system can handle while meeting certain QoS requirements. The proposed algorithm is shown to be more efficient than previous algorithms appeared in the literature.
In this letter, parallel interference cancellation (PIC) in code division multiple access (CDMA) was performed with two different structures by using a neural network (NN). In the first structure (receiver-1) the NN was used as a front-end stage of a one stage PIC circuit. In the second structure (receiver-2), the NN was used instead of the one stage PIC circuit and it was trained as a multiple access interference (MAI) detector to perform the PIC process by subtracting the MAI from the outputs of the matched filter. The PIC is a classical technique in multi user detection process and its bit error rate (BER) performance is not good in one stage for most of the applications. For improving its BER performance, generally a multi stage PIC which has the high computational complexity is used. In this study, we have gotten a better BER performance than a three stages PIC receiver with both proposed receivers that have the lower computational complexity.
Hyong Rock PARK Dongwoo KIM Een-Kee HONG
Video telephone service (VTS) is considered one of promising services provided in wideband CDMA (WCDMA) networks. Without a designated call admission policy, VTS calls are expected to suffer from relatively high probability of blocking since they normally have more stringent signal quality requirement than ordinary voice calls. In this letter, we consider a prioritized call admission design in order to reduce the blocking probability of VTS calls, which may encourage the users to access the newly-provided VTS in a more comfortable way. The VTS calls are given a priority by reserving a number of channel-processing equipments. With the reservation, the blocking probability of prioritized VTS calls can be reduced evidently. That of ordinary calls, however, is increasing instead. This letter provides a system model that counts the blocking probabilities of VTS and ordinary calls simultaneously, and numerically examines an adequate level of the prioritization for VTS calls. The results show that the prioritization level should be selected depending on received interference as well as bandwidth required for VTS.
Shigehiko TSUMURA Yoshitaka HARA Shinsuke HARA
Multi-carrier code division multiplexing (MC-CDM) is one of promising multiplexing techniques for fourth-generation mobile downlink communications systems, where high data rate services should be provided even for high speed-cruising mobiles. For MC-CDM-based packet communication, a frequency scheduling method, which adaptively assigns different sub-carriers to different users, is proposed. This paper proposes a frequency scheduling method, which utilizes pre-assignmented subcarriers in the frequency domain for the MC-CDM scheme. Furthermore, the performance of the proposed system in frequency selective fading channels is compared with that of a no-scheduled MC-CDM scheme by computer simulation in both single- and multi-cell environments. From the results, it is found that the proposed system achieves better bit error rate performance than the no-scheduled MC-CDM scheme and can control quality of service (QoS) for active users.
Naoya KAWAMOTO Naoto MATSUO Atsushi MASUDA Yoshitaka KITAMON Hideki MATSUMURA Yasunori HARADA Tadaki MIYOSHI Hiroki HAMADA
The role of hydrogen in the Si film during excimer laser annealing (ELA) has been successfully studied by using a novel sample structure, which is stacked by a-Si film and SiN film. Hydrogen contents in the Si films during ELA are changed by preparing samples with hydrogen content of 2.3-8.2 at.% in the SiN films with a use of catalytic (Cat)-CVD method. For the low concentration of hydrogens in the Si film, the grain size increases by decreasing hydrogen concentration in the Si film, and the internal stress of the film decreases as increasing the shot number. For the high concentration of hydrogens in the Si film, hydrogen burst was observed at 500 mJ/cm2 and the dependence of the internal stress on the shot number becomes weak even at 318 mJ/cm2. These phenomena can be understood basically using the secondary grain growth mechanism, which we have proposed.
Xuan Nam TRAN Tadashi FUJINO Yoshio KARASAWA
In this paper, we propose a multiuser detection (MUD) scheme for space-time block coded orthogonal frequency division multiplexing (STBC-OFDM) systems. We derive the optimum weight matrix used to decouple simultaneously signals from active multiple access users using the minimum mean square error (MMSE) multiuser detection method. The proposed scheme provides good performance over different models of the frequency selective fading channel. It is also to show that if the length of the cyclic prefix is larger than that of the channel, the performance of the detector depends on only the total energy extracted from multipath components but not the employed channel model, the number of multipath components or the delay of each multipath component.
Riichiro NAGAREDA Kazuhiko FUKAWA Hiroshi SUZUKI
This paper proposes an OFDM mobile packet transmission scheme that increases throughput by using nonlinear multiuser detection (MUD) and automatic repeat request (ARQ) with metric-combining. The scheme identifies users by detecting user identification (ID) symbols located at the head of a packet, and can separate packets that have collided by using MUD. It also forces the respective transmitters to retransmit the same packets so as to reproduce the collision if the cyclic redundancy check (CRC) detects some errors, and it uses metric-combining to decrease the number of retransmissions. The results of computer simulations show that the proposed scheme can provide twice the throughput of the conventional schemes.
In this paper, we propose an adaptive multistage fuzzy-based partial parallel interference cancellation (FB-PPIC) multiuser detector for multi-carrier direct-sequence code-division multiple-access (MC-CDMA) communication systems over frequency selective fading channels. The partial cancellation tries to reduce the cancellation error in parallel interference cancellation (PIC) schemes due to the wrong interference estimations in the early stages and thus outperforms the conventional PIC (CPIC) under the heavy load for MC-CDMA systems. Therefore, in this paper, the adaptive cancellation weights are inferred from a proposed multistage fuzzy inference system (FIS) to perform effective PPIC multiuser detection under time-varying frequency selective fading channels in MC-CDMA systems. Simulation results show that the proposed adaptive four-stage FB-PPIC scheme outperforms both CPIC and constant weight PPIC (CW-PPIC) schemes, especially in near-far environments.
Huey-Min SUN Chia-Mei CHEN LihChyun SHU
In this study, we propose an object-based multimedia model for specifying the QoS (quality of service) requirements, such as the maximum data-dropping rate or the maximum data-delay rate. We also present a resource allocation model, called the net-profit model, in which the satisfaction of user's QoS requirements is measured by the benefit earned by the system. Based on the net-profit model, the system is rewarded if it can allocate enough resources to a multimedia delivery request and fulfill the QoS requirements specified by the user. At the same time, the system is penalized if it cannot allocate enough resources to a multimedia delivery request. We first investigate the problem of how to allocate resources efficiently, so that the QoS satisfaction is maximized. However, the net-profit may be distributed unevenly among the multimedia delivery requests. Thus, the second problem discusses how to allocate the resource efficiently so that the net-profit difference is minimized between any two multimedia requests. A dynamic programming based algorithm is proposed to find such an optimal solution with the minimum net-profit differences.
Suwich KUNARUTTANAPRUK Somchai JITAPUNKUL
In a quasi-synchronous reverse link multicarrier code division multiple access system, the signal detection is vulnerable to the interference due to the insufficient guard interval. A multiuser detection with intersymbol interference cancellation is a potential solution to overcome this problem. In this paper, we proposes a parameter acquisition technique based on a specially designed training sequence for the receiver. The concerned parameters are the transformed signature sequences and the ISI generation sequences. We analyze a criterion for the training sequences to achieve the minimum mean square error and propose the systematic generation of the optimum training sequences. We also propose the noise variance estimator for providing information about noise variance to some classes of multiuser detection. Simulation results prove relevant benefits of the proposed techniques and give useful insights into the system designs.
Qing HAN Keizo INAGAKI Takashi OHIRA
Nonlinear distortions in an anti-series varactor pair (ASVP) are analyzed by a perturbation method. To the authors' knowledge, this paper presents the first derivation of an analytical expression that explicitly shows intermodulation and harmonic distortions of the ASVP. In addition to canceling the expected even-order distortion, the third-order distortion can be suppressed simultaneously when a certain condition is satisfied. We also find that the second- and third-order distortions can be greatly suppressed without dependence on dc bias voltage if the varactors in the ASVP have an ideal abrupt p-n junction. These theoretical predictions are verified by measuring the second- and third-order harmonic distortions of an ASVP. The experimental results show that the second-order harmonic distortion is suppressed by approximately 20 dB. The third-order harmonic distortion is suppressed to the same extent in the theoretically predicted dc bias voltage range.
Byungjo MIN Euiseok NAHM June HWANG Hagbae KIM
This paper proposes a Real-Time Compression Architecture (RTCA), which maximizes the efficiency of web services, while reducing the response time at the same time. The developed architecture not only guarantees the freshness of compressed contents but also minimizes the time needed to compress the message, especially when the traffic is heavy.
Shoichi MOTOHISA Hiroyuki FUKUOKA Ken-ichi BABA Shinji SHIMOJO
AF service class in Diffserv by realizes minimum bandwidth guarantee with the use of differentiated drop precedence property marked on each packet. In the context of a multiple domains environment, however, QoS of individual flow is not always preserved due to the re-marking behavior forced at the domain boundaries. Focusing on this point, this paper proposes new packet re-marking schemes that can improve the per-flow QoS of AF service traversing multiple domains. The basic concept of the schemes distinguishes packets re-marked to out-of-profile at the domain boundaries from those already marked as out-of-profile at the time of entering the network, and allows the re-marked packet to recover back to in-of-profile, thus regaining its rightful QoS within the networks. The performance of the proposed schemes is evaluated through simulation. The results on UDP flows show the effectiveness of the proposed schemes for reducing packet losses on the flow through multiple domains and preserving fairness between flows. Simulations on TCP flows show that the proposed schemes improve the throughput of the flows through multiple domains. The proposed scheme is especially effective on the transfer time of short TCP flows such as Web traffic, whose throughput is affected more seriously by a single packet loss due to its flow control mechanisms.