Nordin Bin RAMLI Xuan Nam TRAN Tetsuki TANIGUCHI Yoshio KARASAWA
Diversity transmission using space-time block coding (STBC) shows a degraded performance in frequency selective fading (FSF) channel. In this paper, assuming the CSI is unknown at both transmitter and receiver while a pilot signal is available during the training period, we propose a MIMO transmission scheme using STBC by adopting subband adaptive array (SBAA) processing. The receive signal is converted into the frequency-domain and adaptive processing is done at each subband. A novel construction of SBAA is introduced to process received signal based on STBC. Simulation results demonstrate that the proposed scheme has a better performance compare to conventional STBC, and has a better performance and less computational load compare to STBC-TDLAA.
Jang Sub KIM Ho Jin SHIN Dong Ryeol SHIN
In this paper, a multiuser receiver based on a Gaussian Mixture Sigma Point Particle Filter (GMSPPF), which can be used for joint channel coefficient estimation and time delay tracking in CDMA communication systems, is introduced. The proposed algorithm has better improved estimation performance than either Extended Kalman Filter (EKF) or Particle Filter (PF). The Cramer-Rao Lower Bound (CRLB) is derived for the estimator, and the simulation result demonstrates that it is almost completely near-far resistant. For this reason, it is believed that the proposed estimator can replace well-known filters such as the EKF or PF.
Satoshi TAOKA Toshimasa WATANABE
Petri nets with inhibitor arcs are referred to as inhibitor-arc Petri nets. It is shown that modeling capability of inhibitor-arc Petri nets is equivalent to that of Turing machines. The subject of this paper is the legal firing sequence problem (INLFS) for inhibitor-arc Petri nets: given an inhibitor-arc Petri net IN, an initial marking M0 and a firing count vector X, find a firing sequence δ such that its firing starts from M0 and each transition t appears in δ exactly X(t) times as prescribed by X. The paper is the first step of research for time complexity analysis and designing algorithms of INLFS, one of the most fundamental problems for inhibitor-arc Petri nets having more modeling capability than ordinary Peri nets. The recognition version of INLFS, denoted as RINLFS, means a decision problem, asking a "yes" or "no" answer on the existence of a solution δ to INLFS. The main results are the following (1) and (2). (1) Proving (1-1) and (1-2) when the underlying Petri net of IN is an unweighted state machine: (1-1) INLFS can be solved in pseudo-polynomial (O(|X|)) time for IN of non-adjacent type having only one special place called a rivet; (1-2) RINLFS is NP-hard for IN with at least three rivets; (2) Proving that RINLFS for IN whose underlying Petri net is unweighted and forward conflict-free is NP-hard. Heuristic algorithms for solving INLFS are going to be proposed in separate papers.
We consider coding for sources that output the symbols according to Poisson process from the viewpoint of real-time transmission. In order to reduce the transmission delay we avoid using input buffers. However, the lack of buffer causes overflow error. The theoretical relation between the transmission rate and the error probability is clarified. It is shown that the optimal code that minimizes the probability of error differs from the code that minimizes the expected codeword length. We also investigate the case of block coding as one of the applications of buffers.
Yu HU Yinhe HAN Xiaowei LI Huawei LI Xiaoqing WEN
LSI testing is critical to guarantee chips are fault-free before they are integrated in a system, so as to increase the reliability of the system. Although full-scan is a widely adopted design-for-testability technique for LSI design and testing, there is a strong need to reduce the test data Volume, scan-in Power dissipation, and test application Time (VPT) of full-scan testing. Based on the analysis of the characteristics of the variable-to-fixed run-length coding technique and the random access scan architecture, this paper presents a novel design scheme to tackle all VPT issues simultaneously. Experimental results on ISCAS'89 benchmarks have shown on average 51.2%, 99.5%, 99.3%, and 85.5% reduction effects in test data volume, average scan-in power dissipation, peak scan-in power dissipation, and test application time, respectively.
Ved P. KAFLE Eiji KAMIOKA Shigeki YAMADA
To support multimedia applications effectively in mobile networks, the handover latency or packet losses during handover should be very small. Addressing this issue, we present a cooperative mobile router-based handover (CoMoRoHo) scheme for long-vehicular multihomed mobile networks. The basic idea behind CoMoRoHo is to enable different mobile routers to access different subnets during a handover and cooperatively receive packets destined for each other. In general, packet losses are directly proportional to handover latency; however, the overlapped reception of packets from different subnets makes possible to minimize packet losses even without reducing handover latency. To evaluate the scheme, we carried out performance modeling of the CoMoRoHo scheme in comparison with the Fast Handover for Mobile IPv6 (FMIPv6) protocol in regard to the handover latency, packet loss, signaling overhead, and packet delivery overhead in access networks. The analysis results show that CoMoRoHo outperforms FMIPv6 by reducing the packet losses as well as signaling overheads by more than 50%. Moreover, CoMoRoHo imposes lower packet delivery overheads required for preventing packets from being dropped from access routers. We thus conclude that CoMoRoHo is a scalable scheme because its performance remains intact even when the access network is overloaded.
Gagik MKRTCHYAN Katsuhiro NAITO Kazuo MORI Hideo KOBAYASHI
Many applications of OFDM systems require Doppler spread estimation. This is quite difficult in multi-path fading channels with no strong direct path. This letter proposes a novel Doppler spread estimation method, which uses the mean square (MS) value of channel impulse response's time derivative. The proposed method is very simple compared with the previously proposed methods. Simulation results show that it allows easy and precise Doppler spread calculation for OFDM by using the channel estimation based on either pilot tones or pilot symbols.
Haiying Julie ZHU Roshdy H.M. HAFEZ
Scheduling algorithms are playing a key role in overall system performance of broadband wireless systems (BWS). Maximal SNR (MaxSNR) and Round Robin (RR) are two conventional scheduling strategies which emphasize efficiency and fairness respectively. Proportional Fair (PF) algorithm provides tradeoff between efficiency and fairness. In this paper, we apply PF to IEEE 802.16a OFDM based BWS and name it OPF. We also propose a new algorithm for multimedia services: Normalized Multimedia Adaptive OPF (NMAOPF). Adaptive modulation and coding scheme is applied in time varying and frequency selective fading wireless channel. System performances are compared in efficiency and fairness with and without user mobility. Efficiency is in terms of throughput, mean packet delay and packet drop ratio; fairness is in terms of user satisfaction rate and average user rate. Joint PHY and MAC layer simulation results show that: within the traffic range of 55 to 70 Mbps, compared with RR and MaxSNR, the performance of OPF is in between. Our proposed NMAOPF outperforms all others without user mobility, while under mobility, it is not as good as MaxSNR but better than OPF and RR.
In a typical OFDM system, a time domain equalizer (TEQ) can be used in order to reduce the channel length, allowing for shortening of the Cyclic Prefix (CP). In this paper, a novel TEQ method is proposed for OFDM systems, which can reduce implementation complexity without sacrificing performance. Furthermore, the length of the proposed TEQ may be arbitrary. For time-varying channels, an adaptive method is also developed to track the variation of the optimum TEQ coefficients rather than recomputing inversion of the channel matrix.
We describe a new characteristic of soft handoff, call failure when a mobile moves from the handoff region to the normal region, and introduce the metric of region-transition failure probability to more accurately assess the performance of CDMA systems that support real-time video streaming services. This characteristic has not been considered in previous research. Simulations show that this failure must be considered since it significantly degrades system performance.
Jau-Yang CHANG Hsing-Lung CHEN
Providing multimedia services with a quality-of-service guarantee in mobile wireless networks presents more challenges due to user's mobility and limited bandwidth resource. In order to provide seamless multimedia services in the next-generation wireless networks, efficient call admission control algorithm must be developed. A novel borrowing-based call admission control policy is proposed in this paper as a solution to support quality-of-service guarantees in the mobile multimedia wireless networks. Based on the existing network conditions, the proposed scheme makes an adaptive decision for bandwidth allocation and call admission by employing attribute-measurement mechanism, dynamic time interval reservation strategy, and service-based borrowing strategy in each base station. We use the dynamically adaptive approaches to reduce the connection-blocking probability and connection-dropping probability, and to increase the bandwidth utilization, while the quality-of-service guarantees can be maintained at a comfortable level for mobile multimedia wireless networks. Extensive simulation results show that our proposed scheme outperforms the previously proposed scheme in terms of connection-blocking probability, connection-dropping probability, and bandwidth utilization, while providing highly satisfying degree of quality-of-service in mobile communication systems.
This letter proposes non-pilot-aided symbol timing and carrier frequency estimation methods in a multicarrier transmission system. To do this, multicarrier system uses a frequency diversity scheme over two consecutive data symbols with the combination of a cyclic time shift. Using the multicarrier signal equipped with frequency diversity, however, time and frequency are accurately estimated without any training symbol.
A new channel identification algorithm using both pilot and traffic channels is proposed. It is based on the linear modelling for the fading channel and takes the form of a modified recursive least-squares (RLS) algorithm. Its existence is also analyzed. It will be shown through computer simulation that the proposed algorithm is robust to the variation of the channel fade rate in a mean square error (MSE) sense.
Shuangfeng HAN Shidong ZHOU Ming ZHAO Jing WANG Kyung PARK
Aiming to optimally transmit space-time block codes (STBCs) over distributed antennas (DAs), this paper examines downlink transmit antenna subset selection with power allocation for STBCs in non-ergodic Rayleigh fading channels with receive antenna correlations. Closed-form outage probability is first derived, which is a function of data rate, rate of STBCs, transmit power, large-scale fading (shadowing and path loss), power allocation weights to each DA and receive antenna correlation. However, achieving the optimal power allocation solution is computationally demanding and the use of sub-optimal techniques is necessitated. Assuming feedback of eigenvalues of transmit and receive antenna correlation matrix at the transmitter and accurate channel state information (CSI) at the receiver, an antenna subset selection with sub-optimal power allocation scheme is proposed, whose performance approaches optimal. The effectiveness of this sub-optimal method has been demonstrated by numerical results.
Nirmal Kumar DAS Masahiro SHINOZAWA Norihisa MIYADAI Tetsuki TANIGUCHI Yoshio KARASAWA
This paper introduces a novel MIMO (Multiple Input Multiple Output) communication system having orthogonal dual polarization diversity branches. We have designed a dual polarized circular patch antenna which has two orthogonal polarization ports such as vertical polarization (V) and horizontal polarization (H) on its metal surface. This design makes it works as two independent antennas in multipath environments. By using two dual polarized antennas at both the transmitter and receiver, we designed a dual-polarization 44 MIMO experiment system. This system can be used to investigate the performance of various MIMO transmission methods as well as the performance of adaptive algorithms in indoor multipath environments. To investigate the performance of our experiment system, we carried out a number of MIMO transmission experiments such as space-time-coded transmission having two parallel streams and MIMO eigenmode transmission. We will show the results of those experiments and discuss the advantages of using polarization diversity in MIMO communication system for next generation broadband wireless communication.
Yifei ZHAO Ming ZHAO Yunzhou LI Jing WANG
In this letter, we elucidate the ergodic capacity of multiple-input multiple-output (MIMO) systems with M-ary phase-shift keying (MPSK) modulation and time-multiplexed pilots in frequency-flat Rayleigh fading environment. With linear minimum mean square error (LMMSE) channel estimation, the optimal pilots design is presented. For mathematical tractability, we derive an easy-computing closed-form lower bound of the channel capacity. Based on the lower bound, the optimal power allocation between the data and pilots is also presented in closed-form, and the optimal training length is investigated by numerical optimization. It is shown that the transmit scheme with equal training and data power and optimized training length provides suboptimal performance, and the transmit scheme with optimized training length and training power is optimal. With the latter scheme, in most situations, the optimal training length equals the number of the transmit antennas and the corresponding optimal power allocation can be easily computed with the proposed formula.
Mamoru OHARA Ryo SUZUKI Masayuki ARAI Satoshi FUKUMOTO Kazuhiko IWASAKI
This paper discusses distributed checkpointing with logging for practical applications running with limited resources. We present a discrete time model evaluating the total expected overhead per event where the number of available checkpoints that each process can hold is finite. The rollback distance is also bound to some finite interval in many actual applications. Therefore, the recovery overhead for the checkpointing scheme is described by using a truncated geometric distribution as the rollback distance distribution. Although it is difficult to analytically derive the optimal checkpoint interval, which minimizes the total expected overhead, substituting other simple probabilistic distributions instead of the truncated geometric distribution enables us to do this explicitly. Numerical examples obtained through simulations are presented to show that we can achieve almost minimized total overhead by using the new models and analyses.
Lei WANG Shihua ZHU Jun WANG Yanxing ZENG
Based on the Khatri-Rao matrix product, we propose a novel unitary space-time modulation design called KR-USTM in this paper. Different from existing USTM schemes, such as the systematic approach and space-time frequency-shift keying (ST-FSK), KR-USTM does not require any computer search and can be applied to any number of transmit antennas. Moreover, the special structure of KR-USTM also makes it a high-rate scheme and achieve full antenna diversity as well as lower decoding complexity. Simulation results show that the proposed KR-USTM constellation achieves error performance comparable to existing USTM designs at low rates, while it outperforms them at high rates.
Hiromichi TOMEBA Kazuaki TAKEDA Fumiyuki ADACHI
Antenna diversity is an effective technique for improving the transmission performance in a multi-path fading channel. Recently, transmit diversity has been attracting much attention since it can alleviate the complexity problem of the mobile terminals. Joint transmit diversity/receive diversity achieves a much improved transmission performance. In this paper, we propose a new space-time block coding algorithm for joint transmit/receive diversity, which requires the channel state information (CSI) only at the transmitter side. Unlike the conventional space-time transmit diversity (STTD), the space-time block coded joint transmit/receive diversity (STBC-JTRD) can use arbitrary number of transmit antennas, while the number of receive antennas is limited to 4. STBC-JTRD achieves a larger diversity gain than joint STTD/receive antenna diversity. The bit error rate (BER) analysis in a frequency-nonselective Rayleigh fading channel is presented. The BER performance is evaluated and is confirmed by the computer simulation.
Huimin LIANG Jingbo LIN Guofu ZHAI Wenlong WANG
A method which uses the moving time and the over travel time of contact to discover the characteristics of contact and the reliability of aerospace relay is proposed. The Gauss-Newton method and its improved form (Macalto method) are used to identify the nonlinear mathematical model of the parameter during armature initial moving period, which is from the coil is energized at a rated voltage to the moment the armature begins to move. The validity of the method is verified by results of actual experiments and analysis.