In this paper, we propose a new transmitter diversity. We propose a combined system with path diversity gain of the distributed antennas and frequency diversity gain of the multi-carrier. The proposed system transmits different data using several sub-carriers which are correlated, while, transmitting the same data using several sub-carriers which are decorrelated. It can achieve combined path and frequency diversity in a variable frequency selective fading channel. It provides high data rate services by transmitting the different data using each correlated carrier, and supports good quality by transmitting the same data on decorrelated carriers using multiple antennas. The proposed system is applicable to multimedia service and can achieve high quality according to channel condition. Thus, the proposed system is sufficiently flexible enough to very support a variety of video, image, voice and data services at a high level of quality.
This letter addresses the issue of RSVP path management in IP micro-mobility networks. We describe efficient RSVP QoS paths with a minimal impact to the existing protocol and underlying routing infrastructure. The goal of this letter is to reduce RSVP path reservation restoration latency and unnecessary control traffic caused by mobility events. We thus propose a RSVP branch-path rerouting scheme at a crossover router (CR) under IP micro-mobility networks. We show that this scheme could give a good tradeoff between the resource reservation cost and the link usage during the lifetime of a RSVP connection.
Tsutomu MORIUCHI Satoshi UEHARA Takayasu KAIDA Kyoki IMAMURA
In this paper, we will show that some families of periodic sequences over Z4 and Z8 with period multiple of 2r-1 generated by r-th degree basic primitive polynomials assorted by the root of each polynomial, and give the exact distribution of sequences for each family. We also point out such an instability as an extreme increase of their linear complexities for the periodic sequences by one-symbol substitution, i.e., from the minimum value to the maximum value, for all the substitutions except one.
Yoshiko T. IKEBE Akihisa TAMURA
Bidirected graphs which are generalizations of undirected graphs, have three types of edges: (+,+)-edges, (-,-)-edges and (+,-)-edges. Undirected graphs are regarded as bidirected graphs whose edges are all of type (+,+). The notion of perfection of undirected graphs can be naturally extended to bidirected graphs in terms of polytopes. The fact that a bidirected graph is perfect if and only if the undirected graph obtained by replacing all edges to (+,+) is perfect was independently proved by several researchers. This paper gives a polyhedral proof of the fact and introduces some new knowledge on perfect bidirected graphs.
Katsuhiko HIRABAYASHI Chikara AMANO
We have formed simple polarization-controller arrays by inserting liquid crystal (LC) in trenches cut across planar lightwave circuits (PLCs). We fabricated LC layers for use as polarization controllers on PLCs in two ways; in one, the ultra-thin layer of LC is held in a cell that is inserted into a trench on the PLC while in the other, the trench is directly filled with the LC. The ultra-thin LC cell can change the phase of 1.55-µm light from 0 to 3π while the LC filling can change the phase of light at the same wavelength from 0 to 12π below 5Vrms. Two former parallel-aligned ultra-thin LC cells, where the directions of alignment of the liquid crystals are rotated by 45 relative to each other, are capable of converting light with an arbitrary input polarization to TE or TM polarization. Ultra-thin cells of twisted nematic LC can switch the polarization between TE and TM modes with an extinction ratio of -15dB. The array we fabricated had a pitch of 1 mm and 5 elements, but an array with more than 100 elements and a pitch below 125µm will easily be possible by using finely patterned transparent electrodes. We have also applied our techniques to the fabrication of LC-based variable optical attenuators (VOA) on the PLC.
Hsu Jung LIU Mei Wen HUANG Buh-Yun SHER Wen-Shyong HSIEH
Many congestion control mechanisms have been proposed to solve the problems of a high loss rate and inefficient utilization of network resources in the present Internet. This problem is caused by competition between traffic flows while the network is congested. Differentiated Services (DiffServ) architecture permits the allocation of various levels of traffic resource requirements needed for Quality of Service (QoS). Random Early Detection (RED) is an efficient mechanism to pre-drop packets before actual congestion occurs, and it is capable of introducing a random early packet dropping scheme, and based on the queue length in reaching a certain degree of fairness for resource utilization. However, it still suffers from a lack of robustness among light traffic load, or in heavy traffic load using fixed RED parameters. In this paper, we modified the RED scheme and proposed a novel adaptive RED model, which we named the OURED model, to enhance the robustness of resource utilization so that it could be utilized in the DiffServ edge router. The OURED model introduces two additional packet dropping traces, one is Over Random Early Detection (ORED), which is used to speed up the dropping of packets when the actual rate is higher than the target rate, and the other one is the Under Random Early Detection (URED), used to slow down the packet dropping rate in the reverse situation. The simulation results show that OURED is not only more robust than MRED in resource utilization, but that it also can be implement efficiently in the DiffServ edge router.
Baek-Hyun KIM Seung-Hoon SHIN Kyung-Sup KWAK
Different quality of service (QoS) requirements must be guaranteed in multimedia code division multiple access (CDMA) mobile communication system to support various applications such as voice, video, file transfer, e-mail, and Internet access. In this paper, we analyze the system in a mixed-traffic environment consisting of voice, stream data, and packet data where preemptive priority is granted to delay-intolerant voice service and a buffer is offered to delay-tolerant stream data services. In the case of best-effort packet data service, the probability of access control by transmission permission is applied to obtain throughput improvement. To analyze the multimedia CDMA mobile communication system, we built a two-dimensional Markov chain model on high-priority voice and stream data services, and then performed numerical analyses in conjunction with packet data services based on a residual capacity equation. We investigate the performance of an integrated voice/stream-data/packet-data CDMA mobile system with the finite buffer size of stream data in terms of voice service blocking probability, average stream data service delay, average packet data service delay, and throughput.
The OFDM technique has recently received considerable attention in the fields of wireless LAN communication systems. It is accompanied with many practical issues and one major issue is synchronization. In this letter, we propose a frequency offset estimation technique for OFDM system. The proposed frequency offset estimator employing interpolation technique in the frequency domain has a simple structure and good performance.
Hyu-Dae KIM Bum-Sik BAE Hyun-Ho CHOI Dong-Ho CHO
CPCH is an uplink common channel that is used by 3GPP to support reliable packet transport. In this paper, we propose a new access scheme by using the discrimination of backoff timer for providing a prioritized service. We also present a simple system model of CPCH for EPA and use it to derive mathematical results. The results show that multi-class services with different priorities can be served effectively and easily by the proposed scheme.
End-to-end delay and loss measurement is an efficient way for a host to examine the network performance. Unnoticed clock errors that influence the accuracy of the timestamp may result in fatal system errors. In this paper, we discuss the characteristics and defects of the existing clock distortion adjustment algorithms. Those algorithms are not applicable to process a long-term delay trace, which contains periodical NTP clock adjustment. Therefore, we propose a relatively robust algorithm to resolve the problem. The algorithm employs window function to partition the long-term trace into short segments, improves the precision of the estimation of the time and amount of NTP clock adjustment To evaluate the performance of our proposed algorithm, we practice it in adjusting the clock distortion of the real delay traces collected from Internet. The results indicate that our proposed algorithm has excellent effect on the removal of the clock distortion from the long-term delay traces.
Sang-Jo YOO Yun-Ho KO Jae-Cheol KWON
This paper proposes a wireless scheduling algorithm that can provide the Internet with delay proportional differentiated services in wireless networks. When considering wireless network environments that include burst and location-dependent channel errors, the proposed WDPS (Wireless Delay Proportional Service) scheduling algorithm can adaptively serve packets in class queues based on the delivered delay performance for each class. The significant characteristics of the WDPS scheduler include support for a fair relative delay service, the provision of graceful throughput and delay compensations, and the avoidance of class queue-blocking problems. Simulations show that the proposed algorithm can achieve the desirable properties for providing delay proportional services in wireless networks.
Takahiro MATSUDA Miki YAMAMOTO
TCP/IP is a key technology in the next generation mobile communication networks. A significant amount of wireless traffic will be carried in the Internet, and wireless connections will have to share network resources with wired connections. However, in a wireless network environment, TCP suffers significant throughput degradation due to the lossy characteristic of a wireless link. Therefore, to design the next generation mobile networks, it is necessary to know how much the wireless connection suffers from the degradation in comparison to the wired connection. In this paper, we discuss the fairness issue between TCP connections over wireless and wired links, and theoretically analyze the fairness of throughput between TCP over wireless link with ARQ (Automatic Repeat reQuest)-based link layer error recovery and TCP over error-free wired link. We validate our analysis by comparing the numerical results obtained from the analysis with the results obtained from computer simulation. The numerical results show that the fairness is sensitive to network propagation delay and variation rapidity of wireless link characteristic. We also obtain the theoretical lower bound of fairness.
Jae-Seung HWANG Chul-Soo PARK Chang-Soo PARK
We propose a simple technique for reducing the jitter of the output clock generated in the clock recovery circuit (CRC) for burst-mode data transmission. By using this technique, the proposed CRC based on the gated oscillator (GO) can recover the output clock with a low-jitter even when there are consecutive same data streams encountered in the system. The circuit is composed only of digital logic devices and can recover the input data errorless until 1,000 consecutive same data bits are incoming.
Akira YAMADA Yasuhiro NUNOMURA Hiroaki SUZUKI Hisakazu SATO Niichi ITOH Tetsuya KAGEMOTO Hironobu ITO Takashi KURAFUJI Nobuharu YOSHIOKA Jingo NAKANISHI Hiromi NOTANI Rei AKIYAMA Atsushi IWABU Tadao YAMANAKA Hidehiro TAKATA Takeshi SHIBAGAKI Takahiko ARAKAWA Hiroshi MAKINO Osamu TOMISAWA Shuhei IWADE
A high-speed 32-bit RISC microcontroller has been developed. In order to realize high-speed operation with minimum hardware resource, we have developed new design and analysis methods such as a clock distribution, a bus-line layout, and an IR drop analysis. As a result, high-speed operation of 400 MHz has been achieved with power dissipation of 0.96 W at 1.8 V.
Wei-Lung MAO Hen-Wai TSAO Fan-Ren CHANG
GPS receivers are susceptible to jamming by interference. This paper proposes a recurrent neural network (RNN) predictor for new application in GPS anti-jamming systems. Five types of narrowband jammers, i. e. AR process, continuous wave interference (CWI), multi-tone CWI, swept CWI, and pulsed CWI, are considered in order to emulate realistic conditions. As the observation noise of received signals is highly non-Gaussian, an RNN estimator with a nonlinear structure is employed to accurately predict the narrowband signals based on a real-time learning method. The node decoupled extended Kalman filter (NDEKF) algorithm is adopted to achieve better performance in terms of convergence rate and quality of solution while requiring less computation time and memory. We analyze the computational complexity and memory requirements of the NDEKF approach and compare them to the global extended Kalman filter (GEKF) training paradigm. Simulation results show that our proposed scheme achieves a superior performance to conventional linear/nonlinear predictors in terms of SNR improvement and mean squared prediction error (MSPE) while providing inherent protection against a broad class of interference environments.
Effects of high-frequency cyclic input and noise on interspike intervals in the coupled Bonhoeffer-van der Pol (BVP) model are studied with computer simulation. When two BVP elements are weakly coupled and cyclic input or noise is added to the first element, the interspike intervals of the second element decrease non-monotonically as the amplitude of the input increases. Further, complicated bifurcations in the interspike intervals are caused by cyclic input in the coupled BVP model in the oscillating state. Effects of the coupling on small rotations due to noise and the interruption of oscillations due to cyclic input, which occur when the equilibrium point is close to the critical point, are also studied. The non-monotonic changes and bifurcations in the interspike intervals are attributed to the phase locking of the coupled elements.
N. M. Alam CHOWDHURY Jun-ichi TAKADA Masanobu HIROSE
In this letter, we propose a new technique that reduces the computation time to derive the MEI coefficients in solving scattering problems by the Measured Equation of Invariance (MEI) methods. Methods that use the MEI technique spend most of the computation time in the integration process to derive the MEI coefficients. Moreover, in the conventional solution process, some repeated computation of metron fields to derive the MEI coefficients is included. To avoid the repeated operations and thus save computation time, we propose a matrix localization technique in computing the MEI coefficients. The time comparison for the computation of MEI coefficients of a cylinder and a sphere is given to verify the CPU time reduction of our new technique.
Nattha SRETASEREEKUL Takashi NANYA
The Quasi-Delay-Insensitive (QDI) model assumes that all the forks are isochronic. The isochronic-fork assumption requires uniform wire delays and uniform switching thresholds of the gates associated with the forking branches. This paper presents a method for determining such forks that do not have to satisfy the isochronic fork requirements, and presents experimental results that show many isochronic forks assumed for existing QDI circuits do not actually have to be "isochronic" or can be even ignored.
Shinfeng D. LIN Shih-Chieh SHIE Kuo-Yuan LEE
A wavelet-based vector quantization scheme for image compression is introduced here. The proposed scheme obtains a better compression efficiency by the following three methods. (1) Utilizing the correlation among wavelet coefficients. (2) Placing different emphasis on wavelet coefficients at different levels. (3) Preserving the most important information of the image. In our experiments, simulation results show that this technique outperforms the recent SMVQ-ABC [1] and WTC-NIVQ [2] techniques.
Jae Cheol KWON Myeong-jin LEE Jae-kyoon KIM
Practical and accurate R-Q (rate-quantization) and D-Q (distortion-quantization) models are presented to describe the R-D (rate-distortion) relationship before encoding a frame. The R-Q model is based on a linear relationship between non-zero level count of the DCT coefficients and the generated bits, while the D-Q model comes from the observation that the ratio QP2/D(QP) can be very accurately approximated by a quadratic function of QP, where QP is the quantization parameter used for quantization of DCT coefficients in H. 263 video coding standard. Simulation results show that the proposed models estimate the real coding results very accurately.