Recently, self-reconfigurable devices which can be partially reprogrammed by other part of the same device have been proposed. However, since conventional self-reconfigurable devices are LUT-array-based fine-grained devices, their time efficiency is spoiled by overhead for reconfiguration time to load large amount of configuration data. Therefore, we have to improve architectures. At the architecture design phase, it is difficult to estimate the performance, including reconfiguration overhead, of self-reconfigurable devices by static analysis, since it depends on many architecture parameters and unpredictable run-time behavior. In this paper, we propose a simulation-based platform for design exploration of self-reconfigurable devices. As a demonstration of the proposed platform, we implement an adaptive load distribution model on the devices of various reconfiguration granularities and evaluate performance of the devices.

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.

This paper discusses issues in the design of analog-to-digital converters (ADCs) in nanoscale CMOS and introduces some experimental designs incorporating techniques to solve these issues. Technology scaling increases the maximum conversion rate, but it decreases the gain and the SNR. To maintain a high SNR level despite the low-voltage operation, the power consumption needs to be increased. Because of lowered supply voltages, the design of circuits based on operational amplifiers (OpAmps) has become more difficult. Designs without OpAmps have therefore received more attention. One way of realizing low-voltage pipeline ADCs is by using comparator-controlled current sources, instead of conventional OpAmps. Furthermore, successive approximation ADCs and sub-ranging ADCs do not require OpAmps and are therefore suitable for low-voltage operation. ADC designers are now searching for suitable architectures for future nanoscale CMOS processes.

In DS-CDMA cellular communications systems, the single frequency reuse can be utilized. Since large other-cell interference is produced, the well known soft handover or site diversity must be used. If the single frequency reuse is not utilized to avoid the other-cell interference, we will face the frequency allocation problem, similar to FDMA systems. In this paper, a DS-CDMA cellular system using band division is proposed. The available wide frequency band is divided into several narrow frequency bands and the different frequency bands are allocated to adjacent cells so as to avoid the large other-cell interference. For the frequency allocation, the channel segregation distributed channel allocation (CS-DCA) algorithm is applied. The link capacity is evaluated by computer simulation.

In the age of pervasive computing, ubiquitous collaboration has become an every-day life paradigm. Without an ideal computing infrastructure, issues with ubiquitous collaboration, such as network unreliability, platform heterogeneity, and client's resource constraints, are inevitable. The traditional replication scheme copes with network unreliability by replicating all the objects of a shared application together at once. This is, however, suitable for neither cooperative applications nor mobile computing devices. These problems can be naturally addressed by using a fine-grained replication scheme that enables a portion of the application objects to be replicated. This paper presents an object-oriented middleware that is capable of dynamically and transparently replicating remotely shared Java applications in a partially and on-demand incremental manner. It is also able to maintain various consistency semantics and enables the coexistence of fine-grained replications and conventional remote method invocations. Empirical results indicate several practical benefits of the middleware.

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.

This paper proposes a new efficient method of characterizing a memory compiler in order to reduce the computation time and remove human error. The new features that make our method greatly efficient are the following three points: (1) high-speed circuit simulation of the whole memory module using a hierarchical LPE (Layout Parasitic Extractor) and a hierarchical circuit simulator, (2) automatic generation of circuit simulation input data from corresponding parameterized description termed the template file, and (3) carefully selected environmental conditions of circuit level simulator and minimizing the number of runs of it. We demonstrate the effectiveness of the proposed method by application to the single-port SRAM generators using 90 nm CMOS technology.

Antenna array is essential factor for multiple- input multiple-output (MIMO) wireless systems. Since the antenna array is composed of closely spaced elements, the mutual coupling among the elements cannot be ignored for the best performance of the array. Mutual coupling affects the MIMO channel, so the performance of a MIMO system, including channel capacity and diversity, varies with the degree of mutual coupling. The effect of mutual coupling is a function of the antenna load impedance. Therefore, designing an optimal element-matched array for a MIMO system requires consideration of the optimal matching condition for the array elements, the one that maximizes the channel capacity. We evaluated the effects of mutual coupling with various matching conditions in dipole arrays, and investigated their effects on the path correlation and channel capacity of MIMO systems. Simulation showed that the conventional conjugate matching of each element is still suitable for closely spaced elements except when the separation is about less than 0.1λ. Theoretical consideration of the received power of a closely-spaced-element array is also provided to show the effects of mutual coupling.

To control various access privileges in group-oriented applications having multiple data streams, we present a novel reactive key management scheme where each member can obtain the key of a data stream from public parameters only when necessary. Compared with the previous schemes, this scheme significantly reduces the amount of rekey messages for dynamic membership change due to its reactive nature.

The selection of the most representative utterances coming from a speaker is essential for the right performance of automatic enrollment in speaker verification. Model quality measures and threshold estimation methods mainly deal with the scarcity of data and the difficulty of obtaining data from impostors in real applications. Conventional methods estimate the quality of the training utterances once the model is created. In such case, it is not possible to ask the user for more utterances during the training session if necessary. A new training session must be started. That was especially unusable in applications where only one or two enrolment sessions were allowed. In this paper, a new on-line quality method based on a male and a female Universal Background Model (UBM) is introduced. The two models act as a reference for new utterances and show if they belong to the same speaker and provide a measure of its quality at the same time. On the other hand, the estimation of the verification threshold is also strongly influenced by the previous selection of the speaker's utterances. In this context, potential outliers, i.e., those client scores which are distant with regard to mean, could lead to wrong mean and variance client estimations. To alleviate this problem, some efficient threshold estimation methods based on removing or weighting scores are proposed here. Before estimating the threshold, the client scores catalogued as outliers are removed, pruned or weighted, improving subsequent estimations. Text-dependent experiments have been carried out by using a telephonic multi-session database in Spanish. The database has been recorded by the authors and has 184 speakers.

Recently, research on parallel processing systems is very active, and many complex topologies have been proposed. A burnt pancake graph is one such topology. In this paper, we prove that a faulty burnt pancake graph with degree n has a fault-free Hamiltonian cycle if the number of the faulty elements is n-2 or less, and it has a fault-free Hamiltonian path between any pair of nonfaulty nodes if the number of the faulty elements is n-3 or less.

Ultra-wideband impulse-radio systems have the ability to resolve multiple paths of the transmit radio and to mitigate the fading. Rake reception is capable of combining these paths, thereby improving the signal-to-noise ratio. In LOS channel, however, the improvement may be comparatively small for the cost of increasing receiver system complexity. This is because the LOS path should be dominant for the total energy in all paths. In this paper the distribution of the energy captured by Rake receiver is first presented for 160 measured LOS channel cases and then discussed. Rake reception with reflector is next suggested in order to effectively increase the signal energy without increasing the complexity, that is, increased number of Rake fingers. The use of reflector is also suggested for non-LOS channel and experimentally discussed where the Rake gain is compared with conventional Rake without reflector. The measurement results show the usefulness.

Key agreement for collaborative groups has become an increasingly popular research area. However, most of previous work requires each member to not only maintain the whole key tree structure whose size is O(N), where N is the size of group, but also involve rekeying operation upon each membership change, resulting in high costs in terms of storage, communication and computation and thus suffers from poor scalability. In this paper, we propose a scalable Distributed and collaborative group key agreement scheme using a Virtual Key Tree (D-VKT). Each group member in D-VKT only reserves and maintains partial information of the whole key tree structure with requirement of O(log N). Furthermore, a distributed tree balancing algorithm is presented to keep the whole key tree as balanced as possible for rekeying efficiency. In addition, a distributed group batch rekeying protocol is proposed to further reduce the computation and communication workload of group rekeying in a highly dynamic environment. The experiment results demonstrate that D-VKT can scale to large and dynamic collaborative groups.

We have developed a new simulation methodology for predicting shot noise intensity in Metal-Oxide-Semiconductor Field Effect Transistor (MOSFET). In our approach, shot noise in MOSFETs is calculated by employing a two dimensional device simulator in conjunction with the shot noise model of a p-n junction. The accuracy of the noise model has been demonstrated by comparing simulation results with measured noise data of p-n diodes. The intensity of shot noise in various n-MOSFET devices under various bias conditions was estimated beyond GHz operational frequency by using our simulation scheme. At DC or low-frequency region, sub-threshold current dominates the intensity of shot noise. Therefore, shot noise is independent on frequency in this region, and its intensity is exponentially depends on VG, proportional to L-1, and almost independent on VD. At high-frequency region above GHz frequency, on the other hand, shot noise intensity depends on frequency and is much larger than that of low-frequency region. In particular, the intensity of the RF shot noise is almost independent on L, VD and VG. This suggests that high-frequency shot noise intensity of MOSFETs is decided only by the conditions of source-bulk junction.

This paper presents two steganographic methods for JPEG2000 still images which approximately preserve histograms of discrete wavelet transform coefficients. Compared with a conventional JPEG2000 steganography, the two methods show better histogram preservation. The proposed methods are promising candidates for secure JPEG2000 steganography against histogram-based attack.

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.

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.

We propose a new cyclic postfix based orthogonal frequency division multiplexing (OFDM) system. The proposed system shows superior performance in symbol time synchronization while achieving channel estimation performance comparable to that of conventional cyclic prefix based OFDM system. In the proposed system, an identical postfix is generated at the end of each OFDM symbol by inserting pilot values amongst the data symbols in a frequency domain and performing Inverse Fast Fourier Transform (IFFT) operation on it. Robust time synchronization is achieved by auto- and cross-correlating the postfix. Also, time or frequency domain channel estimation can be realized by using properly designed postfix according to channel estimation method.

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.

In this paper, we present a design method for fixed-width squarer that receives an n-bit input and produces an n-bit squared product. To efficiently compensate for the truncation error, modified Booth-folding encoder signals are used for the generation of error compensation bias. The truncated bits are divided into two groups (major and minor) depending upon their effects on the truncation error. Then, different error compensation methods are applied to each group. By simulations, it is shown that the proposed fixed-width squarers have lower error than other fixed-width squarers and are cost-effective.