Arnd-Ragnar RHIEMEIER Friedrich JONDRAL
Software Radio has been proposed in the 1990s as the solution to flexible transceiver design for future wireless systems. Potential advantages and drawbacks of this approach have been described and analysed in verbose format in many articles. However, a mathematical perspective of the software radio design problem is to be found in the literature only once. Despite this attempt to develop a sound formal description the conclusions do not reach beyond algorithm design. Open issues in system design are often mentioned, but remain unresolved hitherto. We develop a novel mathematical perspective of software radio, and we formulate the design problem accordingly, by means of an integer linear programming (ILP) representation. This type of problem is well-known in computer science and operations research, but it has never been linked to software radio design before. In a first approach to solve the ILP problem we reduce it to a scheduling problem with processor constraints. In the remainder of the theoretical section we introduce the notions of granularity G and speedup s to assess the quality of modular implementations. A random runtime argument leads the way to a system-theoretic approach to modular design issues such as maximizing speedup over a great number of different implementations. For the special case G = 1 we deduce the speedup potential of a primitive graph in analytical form. In the experimental section we compare simulation results to our theory, and we extend the experiments to a more complicated graph which stems from a real software radio design project. The paper concludes with a discussion and a brief outlook to future research issues.
Masayuki HOSHINO Mitsuru UESUGI Takeo OHGANE Yasutaka OGAWA Toshihiko NISHIMURA
Space-Time Turbo code is an effective method for the enhancement of link capacity and maximizing the link-budget by balancing the coding gain obtained via Turbo codes and the diversity gain obtained through multiple antenna transmission. A study on an antenna selection scheme for Space-Time Turbo code for OFDM systems is presented in this paper. In the proposed method, the systematic bits and the punctured parity bits are sent from the selected antenna for each sub-carrier, while data transmission is suspended from the antenna experiencing poor channel conditions at the receiver. Simulation results show that the proposed method yields a 2.2 dB gain in the required TxEb/N0 relative to the conventional method, and makes the channel estimation accuracy more robust. Moreover, the proposed method reduces transmission power by about 4 dB compared to the conventional method.
Norihiro SATO Hiroshi SUZUKI Satoshi SUYAMA Kazuhiko FUKAWA
This paper proposes complex form BandPass Sampling (BPS) that is suitable for the software radio. This BPS utilizes offset frequency sampling and quadrature component interpolation. Three types of BPS techniques are first reviewed, which shows effectiveness of the proposed BPS technique. The major advantages over the conventional BPS techniques are: i) free from the DC offset that is caused by the leak of the sampling clock harmonics into the received signal, and ii) reduction of alias by the complex number processing in the signal detection. Next, detailed description of the BPS operation shows that it requires real-time interpolation for the time alignment of the sampled quadrature component. Finally, computer simulation shows that the misalignment generates distortion, and that effective interpolation techniques can reduce the distortion level less than -60 dB even for wideband signals.
This paper presents a transmit diversity scheme that uses space-time block codes (STBC) in space-spreading code dimensions for time-direction spreading or two-dimensional spreading orthogonal frequency-division multiplexing code-division multiplexing (OFDM-CDM) downlink transmission. The STBC output symbols in two adjacent time slots are spread by two distinctive spreading codes and multiplexed in the same spreading segment. At a receiver, the received subcarrier signals are despread with the two spreading codes in the direction of time, space-time decoded, and then combined in the direction of frequency. Simulation results demonstrated that the proposed scheme provided high tolerance to Doppler spread and outperformed space-time transmit diversity (STTD) for high-mobility users.
Since the characteristic to current information systems is the dynamic and concurrent change of their configurations and scales with non-stop provision of their services, the system management should inevitably rely on autonomic computing. Since fault tolerance is the one of important system management issues, it should also be incorporated in autonomic computing environment. This paper argues what should be taken into consideration and what approach could be available to realize the fault tolerance in such environments.
Hiroshi HARADA Hiroki NAKAMURA Tetsushi IKEGAMI Masayuki FUJISE
A flexible symbol-timing synchronization met-hod is a one that uses a common sampling clock to find synchronization points for radio communication systems that have different symbol rates. This method estimates synchronization points from state patterns calculated using the symbol rate, sampling clock, and number of observed symbols. Decreasing the number of state patterns is one of best ways to reduce the amount of device resources needed to store the patterns. In this paper, we propose a new pattern generation method in which the number of generated patterns does not increase when the sampling clocks of the communications systems are different. To show the feasibility of this method for symbol-timing synchronization, we analyzed a relationship between the number of samples and the number of state patterns and calculated the BER (bit error rate) in AWGN (additive white Gaussian noise) and one-path flat Rayleigh fading environments by computer simulation.
This paper presents the approximate error rates of M-ary phase shift keying (MPSK) for optimum combining (OC) with multiple interferers in a flat Rayleigh fading channel. The approximations, which have been used to evaluate the performance of binary PSK for OC, are extended to the performance analysis of MPSK for OC in the presence of arbitrary numbers of antennas and interferers. The mean eigenvalues of interference-plus-noise covariance matrix are analyzed to compare the approximation techniques, i.e., first-order approximation and the orthongal approximation. Using the moment generating function (MGF)-based method, the approximate error rates of MPSK for OC are derived as the closed-form expressions in terms of the exact error rates of MPSK for MRC. The approximate analytical results show the simple and accurate way to assess the average symbol error rate of MPSK for OC with arbitrary numbers of antennas and interferers.
In this paper, we propose a fault-tolerance mechanism for microprocessors, which detects transient faults and recovers from them. The investigation of fault-tolerance techniques for microprocessors is driven by two issues: One regards deep submicron fabrication technologies. Future semiconductor technologies could become more susceptible to alpha particles and other cosmic radiation. The other is the increasing popularity of mobile platforms. Cellular telephones are currently used for applications which are critical to our financial security, such as mobile banking, mobile trading, and making airline ticket reservations. Such applications demand that computer systems work correctly. In light of this, we propose a mechanism which is based on an instruction reissue technique for incorrect data speculation recovery and utilizes time redundancy, and evaluate our proposal using a timing simulator.
Wenliang DAI Zhengfan LI Junfa MAO
A novel double-image Green's function approach is proposed to compute the frequency- dependent capacitance and conductance for the general CMOS oriented transmission lines with one protective layer. The ε-algorithm of Pade approximation is adopted to reduce the time for establishing coefficient matrix in this letter. The parameters gained from this new approach are shown to be in good agreement with the data obtained by the full-wave method and the total charge Green's function method.
Ryoji ISHIKAWA Goro KODA Kensuke SHIMIZU
The discrete nature of data in a functional domain can generally be replaced by the global nature of data in the spectrum domain. In this paper we propose a fast procedure to detect autosymmetric function as an application of the spectrum technique. The autosymmetric function differs from the usual symmetric function and strongly relates with EXOR-based representations. It is known that many practical logical networks are autosymmetric, and this nature allows a useful functional class to realize a compact network with EXOR gates. Our procedure is able to detect autosymmetric functions quickly by using spectral coefficients. In experiments, our technique can detect the autosymmetry of most networks with a small number of checks of the spectrum.
Piotr GAWKOWSKI Janusz SOSNOWSKI
In the paper we evaluate program susceptibility to hardware faults using fault injector. The performed experiments cover many applications with different features. The effectiveness of software techniques improving system dependability is analyzed. Practical aspects of embedding these techniques in real programs are discussed. They have significant impact on the final fault robustness.
Shu ZHANG Katsuyoshi IIDA Suguru YAMAGUCHI
Because most link-state routing protocols, such as OSPF and IS-IS, calculate routes using the Dijkstra algorithm, which poses scalability problems, implementors often introduce an artificial delay to reduce the number of route calculations. Although this delay directly affects IP packet forwarding, it can be acceptable when the network topology does not change often. However, when the topology of a network changes frequently, this delay can lead to a complete loss of IP reachability for the affected network prefixes during the unstable period. In this paper, we propose the Cached Shortest-path Tree (CST) approach, which speeds up intra-domain routing convergence without extra execution of the Dijkstra algorithm, even if the routing for a network is quite unstable. The basic idea of CST is to cache shortest-path trees (SPTs) of network topologies that appear frequently, and use these SPTs to instantly generate a routing table when the topology after a change matches one in the caches. CST depends on a characteristic that we found from an investigation of routing instability conducted on the WIDE Internet in Japan. That is, under unstable routing conditions, both frequently changing Link State Advertisements (LSAs) and their instances tend to be limited. At the end of this paper, we show CST's effectiveness by a trace-driven simulation.
Chulmin CHOI Lae-Hoon KIM Yangki OH Sejin DOO Koeng-Mo SUNG
The measurement of the 3-dimensional behavior of early reflections in a sound field has been an important issue in auditorium acoustics since the reflection profile has been found to be strongly correlated with the subjective responsiveness of a listener. In order to detect the incidence angle and relative amplitude of reflections, a 4-point microphone system has conventionally been used. A new measurement system is proposed in this paper, which has 5 microphones. Microphones are located on each four apex of a tetrahedron and at the center of gravity. Early reflections, including simultaneously incident reflections,which previous 4-point microphone system could not discriminate as individual wavefronts, were successfully found with the new system. In order to calculate accurate image source positions, it is necessary to determine the exact peak positions from measured impulse responses composed of highly deformed and overlapped impulse trains. For this purpose, a peak-detecting algorithm, which finds dominant peaks in the impulse response by an iteration method, is introduced. In this paper, the theoretical background and features of the 5-microphone system are described. Also, some results of experiments using this system are described.
This paper addresses bitwidth optimization focusing on leakage power reduction for system-level low-power design. By means of tuning the design parameter, bitwidth tailored to a given application requirements, the datapath width of processors and size of memories are optimized resulting in significant leakage power reduction besides dynamic power reduction. Experimental results for several real embedded applications, show power reduction without performance penalty range from about 21.5% to 66.2% of leakage power, and 14.5% to 59.2% of dynamic power.
JungWon CHO SeungDo JEONG GeunSeop LEE SungHo CHO ByungUk CHOI
In a content-based image retrieval (CBIR) system, both the retrieval relevance and the response time are very important. This letter presents the condensed two-stage search method as a new fast image retrieval approach by making use of the property of Cauchy-Schwarz inequality. The method successfully reduces the overall processing time for similarity computation, while maintaining the same retrieval relevance as the conventional exhaustive search method. By the extensive computer simulations, we observe that the condensed two-stage search method is more effective as the number of images and dimensions of the feature space increase.
Wooncheol HWANG Hongku KANG Kiseon KIM
In this letter, a concise formula for the SNR degradation of OFDM caused by carrier frequency offset is derived by approximations over a shadowed two-path channel, which explicitly shows the sensitivity of SNR degradation to various parameters including the frequency offset. It is shown that, for small frequency offset, the SNR degradation is proportional to the square of the frequency offset and the square of the number of subcarriers. It is also shown that, if Es/N0 is reasonably large, the SNR degradation becomes insensitive to Es/N0, which is contrary to the case of the AWGN channel.
Xiaohong JIANG Md. Mamun-ur-Rashid KHANDKER Hong SHEN Susumu HORIGUCHI
Vertical stacking is a novel technique for building switching networks, and packing multiple compatible connections together is an effective strategy to reduce network hardware cost. In this paper, we study the crosstalk-free permutation capability of an optical switching network built on the vertical stacking of optical banyan networks to which packing strategy is applied. We first look into the nonblocking condition of this optical switching network. We then study the crosstalk-free permutation in this network by decomposing a permutation evenly into multiple crosstalk-free partial permutations (CFPPs) and realizing each CFPP in a stacked plane of the network such that a crosstalk-free permutation can be performed in a single pass. We present a rigorous proof of CFPP decomposability of a permutation and also a complete algorithm for CFPP decomposition. The possibility of a tradeoff between the number of passes and the number of planes required for realizing a crosstalk-free permutation in this network is also explored in this paper.
Takayuki YAMAMOTO Masashi SUGANO Masayuki MURATA Takaaki HATAUCHI Yohei HOSOOKA
In ad hoc wireless networks, wireless terminals can autonomously construct and can maintain the network. They communicate with some neighbor terminals, exchange network information and determine routes for packets on the multi-hop wireless network. Flexible Radio Network (FRN), one of the ad hoc wireless network systems, adopts a proprietary protocol that provides a multiple routes management and a packet retransmission mechanism against packet transmission errors. This system is a commercial product that has been in use in a recent few years. In this paper, we first evaluate the performance through simulations for data-link protocol and routing protocol of the FRN to clarify its basic properties. Furthermore, we propose some techniques that enhance its performance and solve problems on the protocols. We show how they improve the system performance through simulations and analyses.
Johannes Hamonangan SIREGAR Hideaki TAKAGI Yongbing ZHANG
We consider the routing and wavelength assignment (RWA) problem for large-scale WDM optical networks where each transmission request is served by an all-optical lightpath without wavelength conversion. Two heuristic RWA algorithms are proposed in order to minimize the number of wavelengths required for a given set of connection requests. The proposed algorithms are evaluated and compared with the existing algorithms for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan.
Tahar JARBOUI Jean ARLAT Yves CROUZET Karama KANOUN Thomas MARTEAU
The application of fault injection in the context of dependability benchmarking is far from being straightforward. One decisive issue to be addressed is to what extent injected faults are representative of the considered faults. This paper proposes an approach to analyze the effects of real and injected faults.