Yusuke UCHIDA Sei SUNAHARA Eisaburo ITAKURA Hiroyuki MASUYAMA Shoji KASAHARA Yutaka TAKAHASHI
Hybrid FEC/ARQ, which is a mixture of forward error correction (FEC) and automatic repeat request (ARQ), is a well-known technique aiming for packet-loss recovery to guarantee quality of service (QoS) for real-time communications. In this paper, focusing on layered video transmission over wireless network environment, we propose a proactive retransmission scheme for hybrid FEC/ARQ. In the proposed scheme, a receiver host periodically sends probe packets to a sender host in order to check wireless channel state. If the sender host does not receive any probe packet during a pre-specified interval, it regards the wireless channel as being in burst loss state, and it proactively retransmits packets expected to be lost during the burst loss period. The buffer management associated with layered video coding is also taken into consideration. The performance of the proposed scheme is investigated by simulation. Numerical examples show that the proposed scheme transmits packets of the base layer more successfully than the conventional FEC/ARQ.
The steady approach of advanced nations toward realization of ubiquitous computing societies has given birth to rapidly growing demands for new-generation distributed computing (DC) applications. Consequently, economic and reliable construction of new-generation DC applications is currently a major issue faced by the software technology research community. What is needed is a new-generation DC software engineering technology which is at least multiple times more effective in constructing new-generation DC applications than the currently practiced technologies are. In particular, this author believes that a new-generation building-block (BB), which is much more advanced than the current-generation DC object that is a small extension of the object model embedded in languages C++, Java, and C#, is needed. Such a BB should enable systematic and economic construction of DC applications that are capable of taking critical actions with 100-microsecond-level or even 10-microsecond-level timing accuracy, fault tolerance, and security enforcement while being easily expandable and taking advantage of all sorts of network connectivity. Some directions considered worth pursuing for finding such BBs are discussed.
Naoki HAYASHI Toshimitsu USHIO
A consensus problem has been studied in many fundamental and application fields to analyze coordinated behavior in multi-agent systems. In a consensus problem, it is usually assumed that a state of each agent is scalar and all agents have an identical linear consensus protocol. We present a consensus problem of multi-agent systems where each agent has multiple state variables and a performance value evaluated by a nonlinear performance function according to its current state. We derive sufficient conditions for agents to achieve consensus on the performance value using an algebraic graph theory and the mean value theorem. We also consider an application of a performance consensus problem to resource allocation in soft real-time systems so as to achieve a fair QoS (Quality of Service) level.
Jianfa QIAN Wenping MA Xinmei WANG
We introduce (1-γ)-cyclic code and cyclic codes over the finite chain ring R. We prove that the Gray image of a linear (1-γ)-cyclic code over R of length n is a distance invariant quasi-cyclic code over Fpk. We also prove that if (n,p)=1, then every code over Fpk which is the Gray image of a cyclic code over R of length n is equivalent to a quasi-cyclic code.
Chang Woo LEE Hyeonwoo CHO Sang Woo KIM
This letter presents a new mathematical expression for the excess mean-square error (EMSE) of the affine projection (AP) algorithm. The proposed expression explicitly shows the proportional relationship between the EMSE and the condition number of the input signals.
Keat Beng TOH Shin'ichi TACHIKAWA
This paper proposes a combination of novel Received Response (RR) sequence at the transmitter and Matched Filter-Equalizer-RAKE (MF-EQZ-RAKE) combining scheme receiver system for Direct Sequence-Ultra Wideband (DS-UWB) multipath channel model. When binary code sequence such as M sequence is used, there is a possibility of generating extra Inter-Symbol Interference (ISI) in the UWB system. Therefore, it is quite a challenging task to collect the energy efficiently although RAKE reception method is applied at the receiver. The main purpose of the proposed system is to overcome the performance degradation for UWB transmission due to the occurrence of Inter-Symbol Interference (ISI) during high speed transmission of ultra short pulses in a multipath channel. The proposed system improves the system performance by improving the RAKE reception performance using RR sequence and suppressing the ISI effect with the equalizer. Simulation results verify that significant improvement can be obtained by the proposed system especially in UWB multipath channel models such as channel CM4 that suffered severe ISI effect.
In direct-sequence code-division multiple-access (DS-CDMA) communication systems and direct-sequence ultra wideband (DS-UWB) radios, sequences with low correlation and large family size are important for reducing multiple access interference (MAI) and accepting more active users, respectively. In this paper, a new collection of families of sequences of length pn-1, which includes three constructions, is proposed. The maximum number of cyclically distinct families without GMW sequences in each construction is , where p is a prime number, n is an even number, and n=2m, and these sequences can be binary or polyphase depending upon choice of the parameter p. In Construction I, there are pn distinct sequences within each family and the new sequences have at most d+2 nontrivial periodic correlation {-pm-1,-1,pm-1,2pm-1,,dpm-1}. In Construction II, the new sequences have large family size p2n and possibly take the nontrivial correlation values in {-pm-1,-1,pm-1,2pm-1,,(3d-4)pm-1}. In Construction III, the new sequences possess the largest family size p(d-1)n and have at most 2d correlation levels {-pm-1,-1,pm-1,2pm-1,,(2d-2)pm-1}. Three constructions are near-optimal with respect to the Welch bound because the values of their Welch-Ratios are moderate, WR
It is observed, surprisingly, that existing nearest neighbor search methods in wireless data broadcast may not work effectively on mobile clients with very limited memory space. To resolve this problem, a novel method for nearest neighbor search is introduced in the context of a representative of indexes, the grid-partition index, in wireless data broadcast. In the proposed scheme, a mobile client performs the nearest neighbor search by making a sequential access to index packets according to their broadcast order over a wireless channel. The performance evaluation demonstrates that our approach substantially outperforms limited memory versions of existing methods in terms of access time, while retaining a good energy conservation.
Muhammad ZUBAIR Muhammad A.S. CHOUDHRY Aqdas NAVEED Ijaz M. QURESHI
The task of joint channel and data estimation based on the maximum likelihood principle is addressed using a continuous and discrete particle swarm optimization (PSO) algorithm over additive white Gaussian noise channels. The PSO algorithm works at two levels. At the upper level continuous PSO estimates the channel while at the lower level, discrete PSO detects the data. Simulation results indicate that under the same conditions, PSO outperforms the best of the published alternatives.
In this letter, we propose a new H2 smoother (H2S) with a finite impulse response (FIR) structure for discrete-time state-space signal models. This smoother is called an H2 FIR smoother (H2FS). Constraints such as linearity, quasi-deadbeat property, FIR structure, and independence of the initial state information are required in advance to design H2FS that is optimal in the sense of H2 performance criterion. It is shown that H2FS design problem can be converted into the convex programming problem written in terms of a linear matrix inequality (LMI) with a linear equality constraint. Simulation study illustrates that the proposed H2FS is more robust against uncertainties and faster in convergence than the conventional H2S.
Masakazu YAGI Takashi HISAKADO Kohshi OKUMURA
Harmonic balance (HB) method is well known principle for analyzing periodic oscillations on nonlinear networks and systems. Because the HB method has a truncation error, approximated solutions have been guaranteed by error bounds. However, its numerical computation is very time-consuming compared with solving the HB equation. This paper proposes an algebraic representation of the error bound using Grobner base. The algebraic representation enables to decrease the computational cost of the error bound considerably. Moreover, using singular points of the algebraic representation, we can obtain accurate break points of the error bound by collisions.
Ann-Chen CHANG Chun HSU Ing-Jiunn SU
This letter presents an efficient blind carrier frequency offset (CFO) estimate approach for multicarrier-code division multiple access (MC-CDMA) system. It can reduce the searching grids required and improve the CFO estimating accuracy compared with conventional searching-based algorithms. Simulation results are provided for illustrating the effectiveness of the proposed blind estimate approach.
Xiaoliang WANG Xiaohong JIANG Susumu HORIGUCHI
Shared-Memory Optical Packet (SMOP) switch architecture is very promising for significantly reducing the amount of required optical memory, which is typically constructed from fiber delay lines (FDLs). The current reservation-based scheduling algorithms for SMOP switches can effectively utilize the FDLs and achieve a low packet loss rate by simply reserving the departure time for each arrival packet. It is notable, however, that such a simple scheduling scheme may introduce a significant packet out of order problem. In this paper, we first identify the two main sources of packet out of order problem in the current reservation-based SMOP switches. We then show that by introducing a "last-timestamp" variable and modifying the corresponding FDLs arrangement as well as the scheduling process in the current reservation-based SMOP switches, it is possible to keep packets in-sequence while still maintaining a similar delay and packet loss performance as the previous design. Finally, we further extend our work to support the variable-length burst switching.
Katsuhisa YAMANAKA Shin-ichi NAKANO
A rectangular drawing is a plane drawing in which every face is a rectangle. In this paper we give a simple encoding scheme for rectangular drawings. Given a rectangular drawing R with maximum degree 3, our scheme encodes R with m + o(n) bits where n is the number of vertices of R and m is the number of edges of R. Also we give an algorithm to supports a rich set of queries, including adjacency and degree queries on the faces, in constant time.
Chisa TAKANO Keita SUGIYAMA Masaki AIDA
We have previously proposed a diffusion-type flow control mechanism as a solution for severely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow using the basis of only the local information directly available to it, by using predetermined rules. In addition, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies show that our flow control mechanism with certain parameter settings works well in high-speed networks. However, to apply this mechanism to actual networks, it is necessary to clarify how to design a parameter in our control mechanism. In this paper, we investigate the range of the parameter and derive its optimal value enabling the diffusion-type flow control to work effectively.
Modern microprocessors achieve high application performance at the acceptable level of power dissipation. In terms of power to performance trade-off, the instruction window is particularly important. This is because enlarging the window size achieves high performance but naive scaling of the conventional instruction window can severely increase the complexity and power consumption. In this paper, we propose low-power instruction window techniques for contemporary microprocessors. First, the small reorder buffer (SROB) reduces power dissipation by deferred allocation and early release. The deferred allocation delays the SROB allocation of instructions until their all data dependencies are resolved. Then, the instructions are executed in program order and they are released faster from the SROB. This results in higher resource utilization and low power consumption. Second, we replace a conventional issue queue by a direct lookup table (DLT) with an efficient tag translation technique. The translation scheme resolves the instruction dependency, especially for the case of one producer to multiple consumers. The efficiency of the translation scheme stems from the fact that the vast majority of instruction dependency exists within a basic block. Experimental results show that our proposed design reduces the power consumption significantly for SPEC2000 benchmarks.
In this paper, we shall describe about a fuzzy estimation theory based on the concept of set-valued operators, suitable for available operation of extremely complicated large-scale network systems. Fundamental conditions for availability of system behaviors of such network systems are clarified in a form of β-level fixed point theorem for system of fuzzy-set-valued operators. Here, the proof of this theorem is accomplished in a weak topology introduced into the Banach space.
Keat Beng TOH Shin'ichi TACHIKAWA
This paper proposes a combination of novel Received Response (RR) sequence at the transmitter and a Matched Filter-RAKE (MF-RAKE) combining scheme receiver system for the Direct Sequence-Code Division Multiple Access Ultra Wideband (DS-CDMA UWB) multipath channel model. This paper also demonstrates the effectiveness of the RR sequence in Multiple Access Interference (MAI) reduction for the DS-CDMA UWB system. It suggests that by using conventional binary code sequence such as the M sequence or the Gold sequence, there is a possibility of generating extra MAI in the UWB system. Therefore, it is quite difficult to collect the energy efficiently although the RAKE reception method is applied at the receiver. The main purpose of the proposed system is to overcome the performance degradation for UWB transmission due to the occurrence of MAI during multiple accessing in the DS-CDMA UWB system. The proposed system improves the system performance by improving the RAKE reception performance using the RR sequence which can reduce the MAI effect significantly. Simulation results verify that significant improvement can be obtained by the proposed system in the UWB multipath channel models.
In a codebook based precoding MIMO system, the precoding codebook significantly determines the system performance. Consequently, it is crucial to design the precoding codebook, which is related to the channel fading, antenna number, spatial correlation etc. So specific channel conditions correspond to respective optimum codebooks. In this paper, in order to obtain the optimum codebooks, a universal unitary space vector quantization (USVQ) codebook design criterion is provided, which can design the optimum codebooks for various fading and spatial correlated channels with arbitrary antenna configurations. Furthermore, the unitary space K-mean (USK) algorithm is also proposed to generate the USVQ codebook, which is iterative and convergent. Simulations show that the capacities of the precoding MIMO schemes using the USVQ codebooks are very close to those of the ideal precoding cases and outperform those of the schemes using the traditional Grassmannian codebooks and the 3GPP LTE DFT (discrete Fourier transform) codebooks.
Bin SONG Hao QIN Chunfang GUO Linhua MA
Based on an estimation model of video subjective quality, a bandwidth reallocation strategy for video communications on NGN is presented. Experimental results show that the average PSNR of recovery video quality can be greatly increased by using the proposed method when the network bandwidth decreases.