In this paper, we propose a novel migration method. In this method, the resultant placement retains the structure of the original placement, called model placement, as much as possible. For this purpose, we minimize the sum of the difference in area between the model placement and the relocated one and the total amount of displacement between them. Moreover, to achieve a short runtime, we limit the solution space and change the packing origin in the optimization process. We construct the system on Sequence-Pair. Experimental results show that our approach preserves the chip area and the overall circuit structure with 98% less runtime than that realized by naive simulated annealing.

A method of sequential circuit synthesis is proposed for Single-Flux-Quantum (SFQ) digital circuits. Since all logic gates of SFQ digital circuits are driven by a clock signal, methods of sequential circuit synthesis for semiconductor digital circuits cannot derive the full power of high-throughput computation of SFQ circuit technology. In the method, a 'state module' consisting of a DFF and several AND gates is used. First, states of a sequential machine are encoded by one-hot encoding and state modules are assigned to the states one-by-one, and then, the modules are connected with each other according to the state transition. For the connection, Confluence Buffers (CBs), i.e., merger gates without clock signals are used. Consequently, gates driven by a clock signal are removed from its feedback loops, and therefore, a high-throughput SFQ sequential circuit is achieved. The experimental results on benchmark circuits show that compared with a conventional method for semiconductor digital circuits, the proposed method synthesizes circuits that work with 4.9 times higher clock frequency and have 17.3% more gates on average.

Wireless sensor networks can be used in various fields, e.g., military and civil applications. The technique of saving energy to prolong the life of sensor nodes is one of main challenges to resource-constrained sensor networks. Therefore, in-network aggregation of data has been proposed in resource-constrained environments for energy efficiency. Most previous works on in-network aggregation only support a one-dimensional data (e.g., MIN and MAX). To support a multi-dimensional data, the skyline query is used. The skyline query returns a set of points that are not dominated by any other point on all dimensions. The majority of previous skyline query processing methods (e.g., BNL and BBS) work on centralized storage. Centralized query processing methods do not have merits in terms of energy efficiency in high event rate environments. In this paper, we propose new algorithm of in-network processing for the skyline queries. The proposed algorithm reduces the communication cost and evenly distributes load. The experimental results show the advantages of our algorithm over in-network aggregation in terms of improving energy efficiency.

Wireless content sharing where peers share content and services via wireless access networks requires user contributions, as in fixed P2P content sharing. However, in wireless access environments, since the resources of mobile terminals are strictly limited, mobile users are not as likely to contribute as ones in fixed environments. Therefore, incentives to encourage user contributions are more significant in wireless access environments. Although an incentive service differentiation architecture where the content transfer rate is adjusted according to the contributions of each downloading user has been already proposed for fixed P2P, it may not work well in wireless access environments because several factors effect wireless throughput. In this paper, we propose a novel architecture for contribution-based transfer-rate differentiation using wireless quality of service (QoS) techniques that motivates users to contribute their resources for wireless content sharing. We also propose a radio resource assignment method for our architecture. Computer simulations and game-theoretic calculations validate our architecture.

A simplified equalization method based on the band structure of the frequency domain channel matrix is proposed for the single carrier systems employing cyclic prefix (SC-CP) over time-varying wireless channels. Using both theoretical analysis and computer simulation, it is shown that the complexity of this method is proportional to the number of symbols in one SC-CP block and is less than that of traditional block equalization methods. We also show that they have similar performance.

The Ubiquitous sensor network (USN) node is required to operate for several months with limited system resources such as memory and power. The typical USN node is in the active state for less than 1% of its several month lifetime and waits in the inactive state for the remaining 99% of its lifetime. This paper suggests a power adjustment dual priority scheduler (PA-DPS) that offers low power consumption while meeting the USN requirements by estimating power consumption in the USN node. PA-DPS has been designed based on the event-driven approach and the dual-priority scheduling structure, which has been conventionally suggested in the real-time system field. From experimental results, PA-DPS reduced the inactive mode current up to 40% under the 1% duty cycle.

The use of frequency-domain equalization based on minimum mean square error criterion (called MMSE-FDE) can significantly improve the bit error rate (BER) performance of DS-CDMA signal transmission compared to the well-known coherent rake combining. However, in a DS-CDMA cellular system, as a mobile user moves away from a base station and approaches the cell edge, the received signal power gets weaker and the interference from other cells becomes stronger, thereby degrading the transmission performance. To improve the transmission performance of a user close to the cell edge, the well-known site diversity can be used in conjunction with FDE. In this paper, we consider DS-CDMA downlink site diversity with FDE. The MMSE site diversity combining weight is theoretically derived for joint FDE and antenna diversity reception and the downlink capacity is evaluated by computer simulation. It is shown that the larger downlink capacity can be achieved with FDE than with coherent rake combining. It is also shown that the DS-CDMA downlink capacity is almost the same as MC-CDMA downlink capacity.

This paper presents some structures of artificial coplanar waveguide with very slow phase velocity and their applications to a design of compact 3-dB branch-line couplers. The slow-wave structure is constructed by periodically loading both of series inductance and shunt capacitance. First, a basic miniature branch-line coupler is designed and consequently considerable size-reduction of about 1/4 is obtained. Next, a broadband design technique is described using open-circuited quarter-wavelength series-stubs added at each port as a matching network. By size-reducing the series-stubs and branchline sections, a very compact broadband coupler with a good hybrid performance over a wide bandwidth of 31 percent or more is realized. The design concepts and procedures are verified both numerically and experimentally.

In this paper, we investigate a detection ordering scheme of OSIC (Ordered Successive Interference Cancellation) systems suitable for power controlled MIMO transmission. Most studies about power controlled systems have mainly focused on strategies for transmitter, while the ordering scheme optimized at open-loop system has not been modified. In a conventional ordering scheme, the ordering process is done according to the largeness and smallness relation of each sub-stream's SNR. Unlike the conventional scheme, we derive an optimized detection ordering scheme that uses proximity to the optimal SNR. Because of error propagation, our proximity based algorithm is not valid for open-loop MIMO system in many cases. An optimization problem analysis and simulation results show that the system using the proposed ordering scheme outperforms the system using the conventional ordering scheme. Furthermore, due to the nature of QR decomposition, the proposed scheme shows not only lower implementation complexity but also better BER performance compared with the conventional scheme based on pseudo-inverse.

The link structure of the Web is generally viewed as the webgraph. Web structure mining is a research area that mainly aims to find hidden communities by focusing on the webgraph, and communities or their cores are supposed to constitute dense subgraphs. Therefore, structure mining can actually be realized by enumerating such substructures, and Kleinberg's biclique model is well-known among them. In this paper, we examine some candidate substructures, including conventional bicliques, and attempt to find useful information from the real web data. Especially, we newly exploit isolated cliques for our experiments of structure mining. As a result, we discovered that isolated cliques that lie over multiple domains can stand for useful communities, which implies the validity of isolated clique as a candidate substructure for structure mining. On the other hand, we also observed that most of isolated cliques on the Web correspond to menu structures and are inherent in single domains, and that isolated cliques can be quite useful for detecting harmful link farms.

An ultra-deep polymer cavity structure exposed using deep X-ray lithography is used as a template for metal electroforming to produce a 24-GHz cavity resonator. The metal cavity is 1.8 mm deep and has impressive structure, including extremely vertical and smooth sidewalls, resulting in low conductor loss. The measured resonator has an unloaded quality factor of above 1800 at a resonant frequency of 23.89 GHz.

This letter presents a new vertical Bell Labs layered space-time (V-BLAST) transmission scheme for developing low-complexity tree searching in the QRD-M algorithm. In the new V-BLAST system, we assign modulation scheme in ascending order from top to bottom tree branches. The modulation set to be assigned is decided by two criteria: minimum performance loss and maximum complexity reduction. We also propose an open-loop power allocation algorithm to surmount the performance loss. Numerical results show that the proposed V-BLAST transmission approach can significantly reduce the computational loads of the QRD-M algorithm with a slight performance degradation.

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.

A single-chip ubiquitous sensor network (USN) system-on-a-chip (SoC) for small program memory size and low power has been proposed and integrated in a 0.18-µm CMOS technology. Proposed single-chip USN SoC is mainly consists of radio for 868/915 MHz, analog building block, complete digital baseband physical layer (PHY) and media access control (MAC) functions. The transceiver's analog building block includes a low-noise amplifier, mixer, channel filter, receiver signal-strength indication, frequency synthesizer, voltage-controlled oscillator, and power amplifier. In addition, digital building block consists of differential binary phase-shift keying (DPSK) modulation, demodulation, carrier frequency offset compensation, auto-gain control, embedded 8-bit microcontroller, and digital MAC function. Digital MAC function supports 128 bit advanced encryption standard (AES), cyclic redundancy check (CRC), inter-symbol timing check, MAC frame control, and automatic retransmission. These digital MAC functions reduce the processing power requirements of embedded microcontroller and program memory size by up to 56%. The cascaded noise figure and sensitivity of the overall receiver are 9.5 dB and -99 dBm, respectively. The overall transmitter achieves less than 6.3% error vector magnitude (EVM). The current consumption is 14 mA for reception mode and 16 mA for transmission mode.

Ubiquitous sensor networks (USNs) are comprised of energy constrained nodes. This limitation has led to the crucial need for energy-aware protocols to produce an efficient network. We propose a sleep scheduling scheme for balancing energy consumption rates in a single hop cluster based network using Analytical Hierarchy Process (AHP). We consider three factors contributing to the optimal nodes scheduling decision and they are the distance to cluster head (CH), residual energy, and sensing coverage overlapping, respectively. We also propose an integrated sleep scheduling and geographical multi-path routing scheme for USNs by AHP. The sleep scheduling is redesigned to adapt the multi-hop case. For the proposed routing protocol, the distance to the destination location, remaining battery capacity, and queue size of candidate sensor nodes in the local communication range are taken into consideration for next hop relay node selection. The proposed schemes are observed to improve network lifetime and conserve energy without compromising desired coverage. In the multi-hop case, it can further reduce the packet loss rate and link failure rate since the buffer capacity is considered.

This paper presents a study to estimate the composition of an electric load, i.e. to determine the amount of each load class by the direct measurements of the total electric current waveform from instrument reading. Kalman filter algorithm is applied to estimate the electric load composition on a consumer side of a distributed power system. The electric load supplied from the different voltage level by using a non-ideal delta-wye transformer is also studied with consideration of the practical environment for a distributed power system.

We describe a way to write state machines inductively. The proposed method makes it possible to use the standard techniques for proving theorems on inductive types to verify that state machines satisfy invariant properties. A mutual exclusion protocol using a queue is used to exemplify the proposed method.

In this paper, we investigate the critical low coverage problem of position aware localized efficient broadcast in mobile ad hoc ubiquitous sensor networks and propose a generic framework for it. The framework is to determine a small subset of nodes and minimum transmission radiuses based on snapshots of network state (local views) along the broadcast process. To guarantee the accuracy of forward decisions, based on historical location information nodes will predict neighbors' positions at future actual transmission time and then construct predicted and synchronized local views rather than simply collect received "Hello" messages. Several enhancement technologies are also proposed to compensate the inaccuracy of prediction and forward decisions. To verify the effectiveness of our framework we apply existing efficient broadcast algorithms to it. Simulation results show that new algorithms, which are derived from the generic framework, can greatly increase the broadcast coverage ratio.

In this paper, we propose a sequential type-based detection scheme for wireless sensor networks in the case of spatially and temporally identically and independently distributed observations. First, we investigate the optimal sequential detection rule of the proposed scheme, and then with the motivation of reducing the computational complexity of the optimal detection rule, we consider an approximation scheme and derive a suboptimal detection rule. We also compare the performances of the type-based sequential detection scheme with those of the non-sequential type-based detection scheme in terms of both average number of observations and total energy consumption, and determine the region of individual node power where the proposed scheme outperforms the non-sequential scheme. In addition, we show that the approximated detection rule provides the similar results as the optimal detection rule with a significant reduction of the computational complexity, which makes the approximated detection rule useful for real-time applications.

Many devices are expected to be networked with wireless appliances such as radio frequency identification (RFID) tags and wireless sensors, and the number of such appliances will greatly exceed the number of PCs and mobile telephones. This may lead to an essential change in the network architecture. This paper proposes a new network architecture called the appliance defined ubiquitous network (ADUN), in which wireless appliances will be networked without network protocol standards. Radio space information rather than individual appliance signals is carried over the ADUN in the form of a stream with strong privacy/security control. It should be noted that this is different from the architectural principles of the Internet. We discuss a network-appliance interface that is sustainable over a long period, and show that the ADUN overhead will be within the scope of the broadband network in the near future.