A Multi-Functional unit has several functions and these can be changed with a control signal. For High-Level Synthesis, using Multi-Functions units in operation chaining make it possible to obtaining the solution with the same number of control steps and less resources compared to that without them. This paper proposes an operation chaining method considering Multi-Functional units. The method formulates module selection, scheduling, and functional unit allocation with operation chaining as a 0/1 integer linear problem and obtains optimal solution with minimum number of control steps under area and clock-cycle type constraints. The first contribution of this paper is to propose the global search for operation chaining with Multi-Functional units having multiple outputs as well as with single output. The second contribution is to condier the area constraint as a resource constraint instead of the type and number of functional units. Experimental results show that chaining with Multi-Functional units is effective and the proposed method is useful to evaluate heuristic algorithms.

MC-CDMA is an attractive multi-access method for the next generation high-speed mobile communication systems. The uplink transmission performance is limited by the multi-access interference (MAI) from other users since all users share the same bandwidth. Adaptive antenna array can be used to suppress the MAI and to improve the uplink transmission performance. In this paper, we propose a frequency-domain adaptive antenna array for multi-code MC-CDMA. The proposed frequency-domain adaptive antenna array uses a simple normalized LMS (NLMS) algorithm. Although the NLMS algorithm is used, very fast weight convergence within one MC-CDMA symbol duration is achieved since the weight updating is possible as many times as the number of subcarriers within one MC-CDMA symbol duration.

A lossless data embedding method that inserts data in images in the spatial domain is proposed in this paper. Though a lossless data embedding method once distorts an original image to embed data into the image, the method restores the original image as well as extracts hidden data from the image in which the data are embedded. To guarantee the losslessness of data embedding, all pixel values after embedding must be in the dynamic range of pixels. Because the proposed method modifies some pixels to embed data and leaves other pixels as their original values in the spatial domain, it can easily keep all pixel values after embedding in the dynamic range of pixels. Thus, both the capacity and the image quality of generated images are simultaneously improved. Moreover, the proposed method uses only one parameter based on the statistics of pixel blocks to embed and extract data. By using this parameter, this method does not require any reference images to extract embedded data nor any memorization of the positions of pixels in which data are hidden to extract embedded data. In addition, the proposed method can control the capacity for hidden data and the quality of images conveying hidden data by controlling the only one parameter. Simulation results show the effectiveness of the proposed method; in particular, it offers images with superior image quality to conventional methods.

Spatial multiplexing (SM) offers a linear increase in transmission rate without bandwidth expansion or power increase. In SM systems, the LMMSE receiver establishes a good tradeoff between the complexity and performance. The performance of the LMMSE receiver would be degraded by MIMO channel estimation errors. This letter focus on obtaining the asymptotic convergence of output interference power and SIR performance for the LMMSE receiver with channel uncertainty. Exactly matched simulation results verify the validity of analysis in the large-system assumption. Furthermore, we find that the analytical results are also valid in the sense of average results for limited-scale system in spite of the asymptotic assumption used in derivation.

Recently, we proposed space-time block coded-joint transmit/receive antenna diversity (STBC-JTRD) for narrow band transmission in a frequency-nonselective fading channel; it allows an arbitrary number of transmit antennas while limiting the number of receive antennas to 4. In this paper, we extend STBC-JTRD to the case of frequency-selective fading channels and propose frequency-domain STBC-JTRD for broadband direct sequence-spread spectrum (DSSS) signal transmission. A conditional bit error rate (BER) analysis is presented. The average BER performance in a frequency-selective Rayleigh fading is evaluated by Monte-Carlo numerical computation method using the derived conditional BER and is confirmed by computer simulation of the signal transmission. Performance comparison between frequency-domain STBC-JTRD transmission and joint space-time transmit diversity (STTD) and frequency-domain equalization (FDE) reception is also presented.

A method to detect open node defects that cannot be detected by the conventional IDDQ test method has previously been proposed employing a sinusoidal wave superposed on the DC supply voltage. The present paper proposes a strategy to improve the detectability of the test method by means of frequency analysis of the supply current. In this strategy, defects are detected by determining whether secondary harmonics of the sinusoidal wave exist in the supply current. The effectiveness of the method is confirmed by experiments on two CMOS NAND gate packages (SSIs).

Localization of mobile terminals has received considerable attention in wireless communications. In this letter, we present a covariance shaping least squares (CSLS) estimator using time-of-arrival measurements of the signal from the mobile station received at three or more base stations. It is shown that the CSLS estimator yields better performance than the other LS estimators at low signal-to-noise ratio conditions.

Ultra-wideband pulse radars are promising candidates for 3-dimensional environment measurements by autonomous robots. Estimating 3-dimensional target shapes by scanning with an omni-directional antenna is an ill-posed inverse problem. Conventional algorithms such as the synthetic aperture method or parametric algorithms have a problem in terms of their calculation times. We have clarified the existence of a reversible transform between received data and target shapes for 3-dimensional systems. Calculation times are remarkably reduced by applying this transform because it directly estimates target shapes without iterations. We propose a new algorithm based on the transform and present an application example using numerical simulations. We confirm that the proposed algorithm has sufficient accuracy and a short calculation time.

The transport network paradigm is changing as evidenced by IP convergence and the divergence of architectures and technologies. Harnessing the full power of light will spur the creation of new broadband and ubiquitous services networks. To attain this, however, not only must photonic technologies be optimized, but they must also be coordinated with complementary electrical technologies. With regard to photonic network design technologies, further developments are necessary including very large scale network design, quasi-dynamic network design, and multi-layer optical path network design.

An improved signal-to-jamming and noise ratio (SJNR) method is proposed for the linear precoding of multiuser MIMO downlink systems. To well balance suppression of co-channel interference and suppression of noise, the proposed method modifies the noise variance term to argument of a piecewise linear function, and then enhances the suppression of noise. A dynamic power allocation scheme is also introduced to further decrease the overall average bit error rate of the system. Simulation results prove the effectiveness of the proposed scheme.

Low-density parity-check (LDPC) codes are one of the most powerful error correcting codes and are attracting much attention these days. LDPC codes are promising for communications and broadcasting as well where the use of error correcting codes are essential. LDPC codes have been standardized in some communication standards, such as, IEEE802.16e, DVB-S2, IEEE802.3an (10BASE-T), and so on. The performance of LDPC codes largely depend on their code structure and decoding algorithm. In this paper, we present the basics of LDPC codes and their decoding algorithms. We also present some LDPC codes that have good performance and are receiving much attention particularly in communication systems. We also overview some standardized LDPC codes, the LDPC codes standardized in DVB-S2 and the IEEE802.16e standard LDPC codes. Moreover, we present some research on LDPC coded MIMO systems and HARQ using LDPC codes.

Time-frequency-selective, equivalently time-variant multipath, fading channels in orthogonal frequency division multiplexing (OFDM) systems introduce intercarrier interference (ICI), resulting in severe performance degradation. To suppress the effect of ICI, several symbol detection methods have been proposed, all of which are based on the observation that most of the ICI's power is distributed near the desired subcarrier. However, these methods usually ignore the channel variation in a OFDM symbol block by fixing the number of considered ICI terms. Therefore, we propose a novel frequency-domain symbol detection method with moderate complexity, which adaptively determines the number of ICI terms within each OFDM symbol block.

A novel ratio-oriented definition based on 2T2R (Two transistors & two phase change resistors) phase change memory (PCM) cell structure is proposed to gain a high density by multilevel storage. In this novel solution, no reference is needed and good robustness remains still as conventional 2T2R, which is crucial when feature size scales to nanometer technology node. A behavioral SPICE model together with a preliminary simulation proves the idea to be feasible, and further optimization has been carried out. In addition, based on the ratio-oriented definition, a simpler and faster Error Control Coding (ECC) can be realized with n-Error-detection feasible.

Digital watermarking is a technique that aims at hiding a message signal in a multimedia signal for copyright claim, authentication, device control, or broadcast monitoring, etc. In this paper, we focus on embedding watermarks into still images, where the watermarks themselves can be binary sequences or grayscale images. We propose to scramble the watermark bits with pseudo-noise (PN) or orthogonal codes before they are embedded into an image. We also try to incorporate error correction coding (ECC) into the watermarking scheme, anticipating reduction of the watermark bit error rate (WBER). Due to the similarity between the PN/orthogonal-coded watermarking and the spread spectrum communication, it is natural that, following similar derivations regarding data BER in digital communications, we derive certain explicit quantitative relationships regarding the tradeoff between the WBER, the watermark capacity (i.e. the number of watermark bits) and the distortion suffered by the original image, which is measured in terms of the embedded image's signal-to-noise ratio (abbreviated as ISNR). These quantitative relationships are compactly summarized into a so-called tradeoff triangle, which constitutes the major contribution of this paper. For the embedding of grayscale watermarks, an unequal error protection (UEP) scheme is proposed to provide different degrees of robustness for watermark bits of different degrees of significance. In this UEP scheme, optimal strength factors for embedding different watermark bits are sought so that the mean squared error suffered by the extracted watermark, which is by itself a grayscale image, is minimized while a specified ISNR is maintained.

We propose a gradient-limited affine projection algorithm (GL-APA), which can achieve fast and double-talk-robust convergence in acoustic echo cancellation. GL-APA is derived from the M-estimation-based nonlinear cost function extended for evaluating multiple error signals dealt with in the affine projection algorithm (APA). By considering the nonlinearity of the gradient, we carefully formulate an update equation consistent with multiple input-output relationships, which the conventional APA inherently satisfies to achieve fast convergence. We also newly introduce a scaling rule for the nonlinearity, so we can easily implement GL-APA by using a predetermined primary function as a basis of scaling with any projection order. This guarantees a linkage between GL-APA and the gradient-limited normalized least-mean-squares algorithm (GL-NLMS), which is a conventional algorithm that corresponds to the GL-APA of the first order. The performance of GL-APA is demonstrated with simulation results.

In this research, a sub-array preconditioner is applied to improve the convergence of conjugate gradient (CG) iterative solver in the fast multipole method and fast Fourier transform (FMM-FFT) implementation on a large-scale finite periodic array antenna with arbitrary geometry elements. The performance of the sub-array preconditioner is compared with the near-group preconditioner in the array antenna analysis. It is found that the near-group preconditioner achieves a little better convergence, while the sub-array preconditioner can be easily constructed and programmed with less CPU-time. The efficiency of the CG-FMM-FFT with high efficient preconditioner has been demonstrated in numerical analysis of a finite periodic array antenna.

In this paper, Integration of Fractional Gaussian Window transform (IFRGWT) is proposed for the parameter estimation of linear FM (LFM) signal; the proposal is based on the integration of the Fractional Fourier transform modified by Gaussian Window. The peak values can be detected by adjusting the standard deviation of Gaussian function and locating the optimal rotated angles. And also the parameters of the signal can be estimated well. As an application, detection and parameter estimation of multiple LFM signals are investigated in low signal-to-noise ratios (SNRs). The analytic results and simulations clearly demonstrate that the method is effective.

Parallel TCP is one possible approach to increasing throughput of data transfer in Long Fat Networks (LFNs). Using parallel TCP is something of black art. As high-speed transport-layer protocols appear, e.g. HSTCP, it is necessary to reinvestigate the performance of parallel TCP, because a choice has to be make among them for the system. In this paper, the performance of parallel TCP is evaluated by mathematical analysis based on a simple dumbbell topology. Packet drop rate and aggregate goodput are used as two metrics to characterize the performance of parallel TCP. Two cases, namely synchronization and non-synchronization, are analyzed in detail when DropTail is deployed on routers. The synchronization case is common in using parallel TCP, but the goodput deteriorates seriously. The non-synchronization case may benefit parallel TCP, but extra mechanisms are required, and it is not easy to implement in the real world. The problem also remains even if Random Early Detection (RED) queue management is employed on routers. The analysis results show the difficulty in using parallel TCP in practice.

An optimization model with maximum ratio combining (MRC) diversity soft handover is proposed for WCDMA base station location planning with heuristic algorithm, which can calculate the influence of MRC diversity soft handover directly in the process of base station location planning. Experimental results show that the proposed model can get better capacity and coverage performance in the planning results than the traditional optimization model without MRC diversity.

3-D sound using head-related transfer functions (HRTFs) is applicable to embedded systems such as portable devices, since it can create spatial sound effect without multichannel transducers. Low-order modeling of HRTF with an IIR filter is effective for the reduction of the computational load required in embedded applications. Although modeling of HRTFs with IIR filters has been studied earnestly, little attention has been paid to sound movement with IIR filters, which is important for practical applications of 3-D sound. In this paper, a practical method for sound movement is proposed, which utilizes time-varying IIR filters and variable delay filters. The computational cost for sound movement is reduced by about 50% with the proposed method, compared to conventional low-order FIR implementation. In order to facilitate efficient implementation of 3-D sound movement, tradeoffs between the subjective quality of the output sound and implementation parameters such as the size of filter coefficient database and the update period of filter coefficients are also discussed.