We consider the problem of placing resources in a distributed computing system so that certain performance requirements may be met while minimizing the number of resource copies needed. Resources include special I/O processors, expensive peripheral devices, or such software modules as compilers, library routines, and data files. Due to the delay in accessing each of these resources, system performance degrades as the distance between each processor and its nearest resource copy increases. Thus, every processor must be within a given distance k1 of at least one resource copy, which is called the k-bounded placement problem. The structure of a distributed computing system is represented by a graph. The k-bounded placement problem is first transformed into the problem of finding smallest k-dominating sets in a graph. Searching for smallest k-dominating sets is formulated as a state-space search problem. We derive heuristic information to speed up the search, which is then used to solve the problem with the well-known A* algorithm. An illustrative example and some experimental results are presented to demonstrate the effectiveness of the heuristic search.

This paper proposes an object oriented face region detection and tracking method using range color information. Range segmentation of the objects are obtained from the complicated background using disparity histogram (DH). The facial regions among the range segmented objects are detected using skin-color transform technique that provides a facial region enhanced gray-level image. Computationally efficient matching pixel count (MPC) disparity measure is introduced to enhance the matching accuracy by removing the effect of the unexpected noise in the boundary region. Redundancy operations inherent in the area-based matching operation are removed to enhance the processing speed. For the skin-color transformation, the generalized facial color distribution (GFCD) is modeled by 2D Gaussian function in a normalized color space. Disparity difference histogram (DDH) concept from two consecutive frames is introduced to estimate the range information effectively. Detailed geometrical analysis provides exact variation of range information of moving object. The experimental results show that the proposed algorithm works well in various environments, at a rate of 1 frame per second with 512 480 resolution in general purpose workstation.

Power-aware scheduling problem has been a recent issue in cluster systems not only for operational cost due to electricity cost, but also for system reliability. In this paper, we provide SLA-based scheduling algorithms for bag-of-tasks applications with deadline constraints on power-aware cluster systems. The scheduling objective is to minimize power consumption as long as the system provides the service levels of users. A bag-of-tasks application should finish all the sub-tasks before the deadline as the service level. We provide the power-aware scheduling algorithms for both time-shared and space-shared resource sharing policies. The simulation results show that the proposed algorithms reduce much power consumption compared to static voltage schemes.

In this letter, we consider a diversity precoding scheme for signal detection in ultra-wideband (UWB) multiple input single output (MISO) systems, which consists of linear diversity prefilters in the transmitter. For a UWB MISO system, the BER performance of a linear transmit diversity precoding system with imperfect channel estimation is presented in IEEE 802.15.3a UWB multipath channels and also compared with that of a linear receive diversity postcoding approach. It is shown that the diversity precoding UWB MISO system offers the performance equivalent to the diversity postcoding scheme for single input multiple output (SIMO) systems while making the mobiles low-cost and low-power.

Among spatial diversity schemes, orthogonal space-time block code (OSTBC) and cyclic delay diversity (CDD) have been widely studied for the cooperative wireless relaying system. However, conventional OSTBC and CDD cannot cope with change in the number of relays owing to low throughput or error performance. In this letter, we propose the space-time cyclic delay diversity (STCDD) scheme which provides good error performance and full rate. Simulation results show that bit error rate (BER) performance of the proposed STCDD is superior to that of OSTBC and CDD when sufficient quality of source-relay channels are guaranteed.

This paper deals with the small-scale fading distribution for UWB channels in the absence and presence of human bodies in indoor line-of-sight (LOS) environments and performance analysis of UWB systems considering the small-scale fading distribution. To obtain small-scale fading statistics, the channel measurements are performed in five representative environments that have different structure and size while locating the receiver (Rx) antenna on 49 (7×7 grid) local points with a fixed transmitter (Tx) antenna in each environment. The measured channel data are processed by a vector network analyzer and the target frequency bands range from 3 to 4.6GHz. From the measured data, we find the best fitted channel model among several typical theoretical distribution models such as Lognormal, Nakagami, and Weibull distributions, showing good agreement with the empirical channel data. We analyze the amplitude variation of the small-scale fading distribution in the absence and presence of human bodies. The results show that the small-scale fading statistics are best described by Weibull distribution and the two parameters of the distribution that determine the shape and the scale of the distribution depend on whether or not human bodies exist. We modeled and analyzed two parameters at different excess delays for all environments. Based on the measured small-scale fading distribution, this paper deals with the performance of UWB system using Rake receivers and also compares the performance with the existing channel model. The results suggest that the small-scale fading distribution in the absence and the presence of human bodies in indoor LOS environments should be considered when assessing the performance of UWB systems.

The intermediate frequency-over-fiber (IFoF) technology has attracted attention as an alternative transmission scheme to the functional split for the next-generation mobile fronthaul links due to its high spectral efficiency and perfect centralized control ability. In this paper, we discuss and clarify network architectures suited for IFoF, based on its advantages over the functional split. One of the major problems for IFoF transmission is dispersion-induced RF power fading, which limits capacity and transmission distance. We introduce our previous work, in which high-capacity and long-distance IFoF transmission was demonstrated by utilizing a parallel intensity/phase modulators (IM/PM) transmitter which can effectively avoid the fading. The IFoF technology with the proposed scheme is well suited for the long-distance mobile fronthaul links for the 5th generation (5G) mobile system and beyond.

In this paper, we present a new fast Fourier transform (FFT) algorithm to reduce the table size of twiddle factors required in pipelined FFT processing. The table size is large enough to occupy significant area and power consumption in long-point FFT processing. The proposed algorithm can reduce the table size to half, compared to the radix-22 algorithm, while retaining the simple structure. To verify the proposed algorithm, a 2048-point pipelined FFT processor is designed using a 0.18 µm CMOS process. By combining the proposed algorithm and the radix-22 algorithm, the table size is reduced to 34% and 51% compared to the radix-2 and radix-22 algorithms, respectively. The FFT processor occupies 1.28 mm2 and achieves a signal-to-quantization-noise ratio (SQNR) of more than 50 dB.

A VCO for multi-standard transceiver should operate in wide-tuning range, while providing low-phase noise quadrature outputs with low power consumption. In this paper, a multi-standard CMOS LC QVCO is designed utilizing reconfigurable LC tank and low power low phase noise quadrature generation method. Designed in 0.18 µm CMOS technology, the VCO achieved very wide tuning characteristics in two separate bands with low power consumption.

The excessive memory access required to perform motion compensation when decoding compressed video is one of the main limitations in improving the performance of an H.264/AVC decoder. This paper proposes an H.264/AVC decoder that employs three techniques to reduce external memory access events: efficient distribution of reference frame data, on-chip cache memory, and frame memory recompression. The distribution of reference frame data is optimized to reduce the number of row activations during SDRAM access. The novel cache organization is proposed to simplify tag comparisons and ease the access to consecutive 4×4 blocks. A recompression algorithm is modified to improve compression efficiency by using unused storage space in neighboring blocks as well as the correlation with the neighboring pixels stored in the cache. Experimental results show that the three techniques together reduce external memory access time by an average of 90%, which is 16% better than the improvements achieved by previous work. Efficiency of the frame memory recompression algorithm is improved with a 32×32 cache, resulting in a PSNR improvement of 0.371 dB. The H.264/AVC decoder with the three techniques is fabricated and implemented as an ASIC using 0.18 µm technology.

Proportional fair scheduling attains a graceful trade-off between fairness among users and total system throughput. It is simple to implement in single carrier transmission systems, while changes to a prohibitively complex combinatorial problem for multi-carrier transmission systems. This letter addresses a couple of conditions that approximate multi-carrier proportional fair scheduling (MCPF) as carrier-by-carrier proportional fair scheduling (CCPF), which has much lower complexity than MCPF. Numerical results show that the proportional fairness metric of CCPF approaches to that of MCPF for those conditions.

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.

Target Q coverage is needed to secure the stability of data collection in WSN. The targets may have different level of importance then the multiple-target coverage scheme must schedule sensors according to each target's weight to increase the network lifetime. The schedule scheme previously proposed for weighted coverage uses an iterative solution to solve the problem but it has long computation time. We propose a heuristic greedy-TQC algorithm to use the residual energy of sensors to generate multiple scheduling cover sets. A simulation shows a dramatic reduction in computation time. The greedy-TQC algorithm is suitable for the frequently topology-changing WSN and for the often changing targets' weights in WSN.

It is known that in the selected mapping (SLM) scheme for orthogonal frequency division multiplexing (OFDM), correlation (CORR) metric outperforms the peak-to-average power ratio (PAPR) metric in terms of bit error rate (BER) performance. It is also well known that four times oversampling is used for estimating the PAPR performance of continuous OFDM signal. In this paper, the oversampling effect of OFDM signal is analyzed when CORR metric is used for the SLM scheme in the presence of nonlinear high power amplifier. An analysis based on the correlation coefficients of the oversampled OFDM signals shows that CORR metric of two times oversampling in the SLM scheme is good enough to achieve the same BER performance as four times and 16 times oversampling cases. Simulation results confirm that for the SLM scheme using CORR metric, the BER performance for two times oversampling case is almost the same as that for four and 16 times oversampling cases.

This paper presents a Maximum Likelihood Location Estimation (MLLE) algorithm for the home network environments. We propose a deployment of cluster-tree topology in the ZigBee networks and derive the MLE under the log-normal models for the Received Signal Strength (RSS) measurements. Experiments are also conducted to validate the effectiveness of the proposed algorithm.

We propose a polynomial-time algorithm for the scheduling of real-time parallel tasks on multicore processors. The proposed algorithm always finds a feasible schedule using the minimum number of processing cores, where tasks have properties of linear speedup, flexible preemption, arbitrary deadlines and arrivals, and parallelism bound. The time complexity of the proposed algorithm is O(M3log N) for M tasks and N processors in the worst case.

The performance of ultra-wideband (UWB) multiple input multiple output (MIMO) receiver based on the RAKE maximal ratio combiner (MRC) followed by a zero forcing (ZF) detector is analytically examined. For a UWB MIMO system with NT transmit antennas, NR receive antennas, and L resolvable multipath components, the proposed MIMO detection scheme is shown to have the diversity order of LNR-NT+1 and its analytical error rate expression is presented in a log-normal fading channel. We also compare the analytical BERs with the simulated results.

This paper introduces a packet forwarding scheme based on interworking architecture that can provide quite a good QoS by minimizing processing delay which is the major part of the timeliness factor in New Generation IP-based networks. Based on path and resource reservation mechanism, the POSIA makes routers on the packet forwarding path synchronize with each other and then forward packets. We have shown that the POSIA outperforms the existing packet forwarding schemes like IntServ, DiffServ and MPLS through computer simulations using OPNET.

This paper proposes a new on-chip linearizer self-adapting to the input power and its implementation to high linear monolithic microwave integrated circuit (MMIC) power amplifier for 1.95 GHz wide-band code division multiple-access (W-CDMA) system. The linearizer consists of InGaP/GaAs heterojunction bipolar transistor (HBT) active bias circuit and reverse biased junction diode of which dynamic admittance to input power level functions adaptively to control the bias to the amplifier. The proposed linearizer has little insertion power loss, and more importantly, it consumes no additional die area and DC power. The HBT MMIC power amplifier with the integrated linearizer exhibits a maximum output power of 30.3 dBm, a power gain of 27.5 dB, a power added efficiency of 42% at the maximum output power under an operation voltage of 3.4 V, and adjacent channel leakage power ratio of -38 dBc at 27 dBm of output power.

The classical 4-phase constant-amplitude zero-autocorrelation (CAZAC) sequence with the length of 16 has been used for multifarious purposes such as channel estimation and frequency/timing synchronizations since it presents good performance even in low signal to noise ratio (SNR) conditions. However, as multiple transmit antennas are employed, its properties are easily destroyed by the effect of multipath. In this letter, we propose a technique which ensures that the conventional CAZAC sequence is reliable in a multi-antenna system by inserting nulls. The performance of the modified sequence is verified through the mean s quare error (MSE) performance with the least squares (LS) method.