Seungyoung PARK Yeonwoo LEE Sangboh YUN
The time division duplex cellular system can support various downlink and uplink traffic ratios by setting the downlink and uplink transmission periods appropriately. However, it causes severe co-channel interference problem when some cells are active in the downlink while the others are in the uplink [2]. To mitigate this problem, a resource allocation scheme combined with sectorization is proposed for orthogonal frequency division multiple access. Simulations demonstrate that the proposed scheme improves both spectral efficiency and outage performance compared to the conventional allocation schemes.
Namseok CHANG Na-young KIM Joonhyuk KANG Youngok KIM Hyunbeom LEE
Instead of pilot tones, the impulse sample is exploited for channel estimation in Impulse Postfix OFDM systems [1]. As the magnitude of impulse sample is increased, the accuracy of channel estimation can be enhanced, but it may significantly increase the PAPR of generated OFDM symbols. In this letter, based on the statistical analysis of the generated OFDM symbol, we propose a decision scheme for determining the magnitude of impulse sample. By using the proposed scheme, we can determine the magnitude of impulse sample that provides the enhancement of BER performance as well as the avoidance of PAPR increase. The validation of the proposed scheme is demonstrated by computer simulations.
Sang-Hun YOON Daegun OH Jong-Wha CHONG Kyung-Kuk LEE
In this paper, we propose a new code set which has very low spectral peak to average ratio (SPAR) and good correlation properties for DS-UWB. The codes which have low SPAR are suitable for DS-UWB system which operates in UWB (3.110.4 GHz) because they can utilize more power than high SPAR codes can do. And, in order to reduce inter symbol interference (ISI) and inter piconet interferences, the codes which have good auto- and cross-correlation properties must be used. In this paper, we propose three items; (1) a new code generation method which can generate good SPAR and auto-correlation codes, (2) code selection criteria, and (3) a code set, which has been selected according to the proposed selection criteria. The proposed code set has SPAR reduced about 0.22 dB and GMF improved by 30% compared to the previous code set while it is maintaining almost same cross-correlation properties. Each code of the proposed code set, therefore, has gained 1.43 dB SIR on an average compared to that of the previous code set.
Ikuo AWAI Yangjun ZHANG Tetsuya ISHIDA Tsuyoshi SUZUKI
A new unified method is proposed to calculate the basic resonator parameters, i.e., the resonant frequency, external Q, unloaded Q and coupling coefficient in the time domain. By exciting the resonator from a weakly coupled external circuit, one can inject only a narrow resonant spectrum from the broad spectrum of the excitation pulse. The resonant frequency is easily counted by the number of zero crossings of the internal field intensity, whereas the Q's are calculated by the decay rate of the field amplitude. The coupling coefficient computed by the energy exchange rate between two resonators completes the new time domain algorithm.
Jong-Phil HONG Seok-Ju YUN Sang-Gug LEE
A complementary cross-coupled differential Colpitts voltage controlled oscillator (VCO) is reported. The combination of gm-boosting and the complementary transistors allows record low power integrated VCO implementation. The proposed VCO and the corresponding parallel quadrature VCO (P-QVCO) are implemented using 0.25-µm CMOS technology for 1.8 GHz operation. Measurements for the VCO and P-QVCO show phase noise of -116.8 and -117.7 dBc/Hz at 1 MHz offset, while dissipating only 0.4 and 1.1 mA from a 0.9-V supply, respectively.
Ubiquitous computing and the upcoming broadcast-and-communication convergence require networks that provide very complex services. In particular, networks are needed that can service several users or terminals at various times or places with various application-layer functions that can be changed at a high response speed by adding high-speed processing at the network edge. I present a query-transaction acceleration appliance that uses a dynamic reconfigurable processor (DRP) and enables high-speed stateful packet-by-packet self-reconfiguration to achieve that requirement. This appliance processes at high speeds, has flexible application layer functions that are changeable with a high-speed response, and uses direct packet I/O bypassing memory, hierarchical interconnection of processors, and stateful packet-by-packet self-reconfiguration. In addition, the DRP enables the fabrication of a compact and electric-power-saving appliance. I made a prototype and implemented several transport/application layer functions, such as TCP connection control, auto-caching of server files, uploading cache data for server, and selection/insertion/deletion/update of data for a database. In an experimental evaluation in which four kinds of query-transactions were continually executed in order, I found that the appliance achieved four functions changeable at a high response speed (within 1 ms), and a processing speed (2,273 transactions/sec.) 18 times faster than a PC with a 2-GHz processor.
Shingo MASUNO Tsutomu MARUYAMA Yoshiki YAMAGUCHI Akihiko KONAGAYA
Multiple sequence alignment problems in computational biology have been focused recently because of the rapid growth of sequence databases. By computing alignment, we can understand similarity among the sequences. Many hardware systems for alignment have been proposed to date, but most of them are designed for two-dimensional alignment (alignment between two sequences) because of the complexity to calculate alignment among more than two sequences under limited hardware resources. In this paper, we describe a compact system with an off-the-shelf FPGA board and a host computer for more than three-dimensional alignment based on dynamic programming. In our approach, high performance is achieved (1) by configuring optimal circuit for each dimensional alignment, and (2) by two phase search in each dimension by reconfiguration. In order to realize multidimensional search with a common architecture, two-dimensional dynamic programming is repeated along other dimensions. With this approach, we can minimize the size of units for alignment and achieve high parallelism. Our system with one XC2V6000 enables about 300-fold speedup as compared with single Intel Pentium4 2 GHz processor for four-dimensional alignment, and 100-fold speedup for five-dimensional alignment.
Hiroshi SHINOHARA Hideaki MONJI Masahiro IIDA Toshinori SUEYOSHI
High power consumption is a constraining factor for the growth of programmable logic devices. We propose two techniques in order to reduce power consumption. The first is a technique for creating contexts. This technique uses data-dependent circuits and wire sharing between contexts. The second is a technique for switching the contexts. In this paper, we evaluate the capability of the two techniques to reduce power consumption using a multi-context logic device. As a result, as compared with the original circuit, our multi-context circuits reduced the power consumption by 9.1% on an average and by a maximum of 19.0%. Furthermore, applying our resource sharing technique to these circuits, we achieved a reduction of 10.6% on an average and a maximum reduction of 18.8%.
Jianping QIAO Ju LIU Yen-Wei CHEN
Most learning-based super-resolution methods neglect the illumination problem. In this paper we propose a novel method to combine blind single-frame super-resolution and shadow removal into a single operation. Firstly, from the pattern recognition viewpoint, blur identification is considered as a classification problem. We describe three methods which are respectively based on Vector Quantization (VQ), Hidden Markov Model (HMM) and Support Vector Machines (SVM) to identify the blur parameter of the acquisition system from the compressed/uncompressed low-resolution image. Secondly, after blur identification, a super-resolution image is reconstructed by a learning-based method. In this method, Logarithmic-wavelet transform is defined for illumination-free feature extraction. Then an initial estimation is obtained based on the assumption that small patches in low-resolution space and patches in high-resolution space share a similar local manifold structure. The unknown high-resolution image is reconstructed by projecting the intermediate result into general reconstruction constraints. The proposed method simultaneously achieves blind single-frame super-resolution and image enhancement especially shadow removal. Experimental results demonstrate the effectiveness and robustness of our method.
Hiroaki KOZAWA Kiyoharu HAMAGUCHI Toshinobu KASHIWABARA
For formal verification of large-scale digital circuits, a method using satisfiability checking of logic with equality and uninterpreted functions has been proposed. This logic, however, does not consider specific properties of functions or predicates at all, e.g. associative property of addition. In order to ease this problem, we introduce "equivalence constraint" that is a set of formulas representing the properties of functions and predicates, and check the satisfiability of formulas under the constraint. In this report, we show an algorithm for checking satisfiability with equivalence constraint and also experimental results.
Koji ISHIBASHI Ivan Chee-Hong LAI Kyoya TAKANO Minoru FUJISHIMA
Comb capacitors suitable for use in advanced complementary metal-oxide semiconductor (CMOS) technology nodes are frequently constructed from low metal layers located closely above the conductive silicon substrate. This results in high parasitic capacitances across the thin dielectric between the two layers. Therefore, a shield for reducing this parasitic capacitance is proposed in order to use the comb capacitor at high frequency. From electromagnetic (EM) simulation results using a 3D EM simulator, the quality factor (Q-factor) of the proposed shielded comb capacitor for the differential signal improved by 20% at 30-110 GHz compared to the unshielded capacitor. Consequently, a scalable model is proposed, which operates up to millimeter-wave frequencies. The results are verified by experimental data using fabricated comb capacitors from a 90 nm 1P9M CMOS process. Compared with the experimental results, the simulated common-mode and differential-mode S parameters of the model has a root-mean-square (r.m.s.) error of under 2.1%.
In this paper, we propose a converting technique based method to solve nonlinear multi-commodity network flow (NMNF) problems with a large number of capacity constraints and discuss the associated implementation. We have combined this method with a successive quadratic programming (SQP) method and a parallel dual-type (PDt) method possessing decomposition effects. We have tested our method in solving a kind of lattice-type network system examples of NMNF problems. The simulation results show that the proposed algorithm is efficient for solving NMNF problems and successfully handles a large number of coupling capacity constraints. Furthermore, the computational efficiency of the proposed algorithm is more significant while the numbers of capacity constraints are increased.
In this paper, we propose a new modulation named parallel combinatory/high compaction multi-carrier modulation (PC/HC-MCM) using the techniques of parallel combinatory orthogonal frequency division multiplexing (PC-OFDM) and high compaction multi-carrier modulation (HC-MCM). Two types of PC/HC-MCM systems, which are named as modulated PC/HC-MCM system and (unmodulated) PC/HC-MCM system, can be designed. The modulated PC/HC-MCM system achieves better bit-error rate (BER) performance than that of HC-MCM system with equal bandwidth efficiency (BWE). The PC/HC-MCM system can obtain the better peak-to-average power ratio (PAPR) characteristics by selecting appropriate constellation for each subcarrier. On the other hand, since PC/HC-MCM can divide the PC-OFDM symbol duration into multiple time-slots, the advantages of frequency hopping (FH) can be applied in the PC/HC-MCM system. Therefore, we also combine the PC/HC-MCM and frequency hopping multiple access (FHMA) to propose a novel multiple access (MA) system. It can simultaneously transmit multiple users' data within one symbol duration of PC-OFDM.
Hiroshi NISHIMOTO Toshihiko NISHIMURA Takeo OHGANE Yasutaka OGAWA
In a frequency-selective multiple-input multiple-output (MIMO) channel, the optimum transmission is achieved by beamforming with eigenvectors obtained at each discrete frequency point, i.e., an extension of eigenbeam-space division multiplexing (E-SDM). However, the calculation load of eigenvalue decomposition at the transmitter increases in proportion to the number of frequency points. In addition, frequency-independent eigenvectors increase the delay spread of the effective channel observed at the receiver. In this paper, we propose a pseudo eigenvector scheme for the purpose of mitigating the calculation load and maintaining frequency continuity (or decreasing the delay spread). First, we demonstrate that pseudo eigenvectors reduce the delay spread of the effective channels with low computational complexity. Next, the practical performance of the pseudo E-SDM (PE-SDM) transmission is evaluated. The simulation results show that PE-SDM provides almost the same or better performance compared with E-SDM when the receiver employs a time-windowing-based channel estimation available in the low delay spread cases.
Bing ZHANG Oyunchimeg SHAGDAR Suhua TANG Youiti KADO Masanori NOZAKI Mehdad N. SHIRAZI
Wireless mesh networks are attracting more and more attention as a promising technology for the next generation access infrastructure. QoS support is a unavoidable task given the rising popularity of multimedia applications, and also a challenging task for multi-hop wireless mesh networks. Among the numerous QoS factors, end-to-end delay is one of the most critical and important issues, especially for the real time applications. Over multi-hop wireless mesh networks, end-to-end delay of a flow is highly dependant on the number of hops as well as congestion condition of the hop nodes that the flow traverses through. In this paper, we propose QoS priority control schemes based on the end-to-end QoS delay metrics in order to increase traffic accommodation, i.e., the numbers of real-time flows which satisfy the requirements of end-to-end delay and packet delivery ratio over multi-hop wireless mesh networks. The first scheme enables source and forwarding nodes to perform priority control based on the number of hops of routes. The second scheme enables nodes to perform priority control based on the congestion condition of the hop nodes, where the flow traverses through. The effectiveness of the proposed schemes is investigated with NS-2 network simulator for voice and video traffics over multi-hop wireless mesh networks. Simulation results show that the scheme greatly improves the traffic accommodation for voice and video applications in multi-hop wireless mesh networks.
In this paper, we propose the use of a discrete-time connection oriented Internet service system with a release delay for broadband, high-speed, high-capacity and high-reliability Internet requirements. The release delay called close-delay is set before the release process of a connection. An upper limit length T called timer length is set as a system parameter for the close-delay period. We build a batch arrival Geom*/G/1 queue model with a setup/close-delay/close-down strategy to characterize the system operation. By using a discrete-time imbedded Markov chain approach, we derive the stationary distribution of the system, and present the formula for Probability Generation Functions of the queue length, waiting time, busy period and busy cycle. Correspondingly, we describe the performance measures for the packet response time, setup ratio, and utility of connection. We also develop a cost model to determine the optimal timer length and its expected optimal cost. Based on numerical results, we discuss the influence of the timer length for the close-delay period on the system performance and investigate the minimum timer length and the minimum cost for different offered loads and different burst degrees, and show that the choice of the timer length is significant in improving the system performance.
Masataka MASUDA Tsuyoshi FURUKAWA Takanori HAYASHI Souhei MAJIMA
Quality of service (QoS) control is one of the key technologies for the next-generation network (NGN). In the conventional method, the bearer quality on the carrier network is managed, but the end-to-end QoS for end users needs to be guaranteed. The quality of a public switched telephone network (PSTN) is guaranteed, and the quality of the telephone terminal is also stable. Therefore, end-to-end quality management of PSTN services has been achieved. However, the quality of neither IP networks nor VoIP services is guaranteed in general. In addition, there are numerous VoIP terminals and the differences in their implementations strongly affect the speech quality experienced by end users. Thus, quality management technologies need to be embedded in the VoIP terminal to achieve the equivalent of end-to-end QoS management for the PSTN. These technologies are recommended in IETF RFC3611 "RTCP XR" and ITU-T recommendation P.564 as the framework for end-to-end quality management, but their usage is not shown. Therefore, we propose an end-to-end quality management method for VoIP speech using RTCP XR. We realize an end-to-end QoS monitoring method between the customer and the operator of the carrier network. We define the parameters that should be implemented in RTCP XR packets to estimate the quality of VoIP services based on experimental results.
Muhammad A. S. CHOUDHRY Muhammad ZUBAIR Aqdas NAVEED Ijaz M. QURESHI
The computational complexity of the optimum maximum likelihood detector (OMLD) does not allow its utility for multi-user detection (MUD) in code division multiple access (CDMA) systems. As proposed in this letter, particle swarm optimization (PSO) with soft decision offers a much more efficient option with few parameters to be adjusted, flexibility to implement, that gives a much faster convergence compared to OMLD. It outperforms the conventional detector, the genetic algorithm approach and the standard suboptimal detectors considered in the literature.
This letter introduces a simple way of estimating the integer frequency offset (IFO) of OFDM-based digital video broadcasting (DVB) systems. By modifying the conventional maximum likelihood (ML) estimator to include the multi-stage estimation strategy, the IFO estimator is derived. Simulations indicate that the proposed IFO estimator works robustly when compared to ML estimator.
In this paper, the performance of narrow band interference (NBI) rejection scheme for direct sequence spread spectrum (DS/SS) is analyzed. A 2-tapped complex FIR filter is used for filtering a chip code to suppress NBI. In this system, the spectrum of transmitted signal has a null at an arbitrary frequency. By choosing filter coefficients, the authors place this null at NBI center frequency to mitigate the effect of NBI. In this paper, an OFDM signal is considered as NBI. The performance of this scheme is theoretically analyzed by introducing Queueing model, and validated via simulation.