This letter considers power-controlled transmission from directional antennas in mmWave wireless personal area network (WPAN) systems. The attributes of these systems are studied; these include the number of concurrent transmissions and the power consumption with different system parameters, such as the antenna's beamwidth and radiating efficiency. Numerical results are presented to show that the power controlled transmission enables more concurrent transmissions than the non-power controlled transmission. The results also show that the number of concurrent transmissions increases as the beamwidth and the path loss component become smaller and the antenna's radiating efficiency increases. In addition, the power controlled system generally uses less power than the non-power controlled transmission set up; the overall analysis is verified by simulation.

The spatio-temporal multiple view geometry can represent the geometry of multiple images in the case where non-rigid arbitrary motions are viewed from multiple translational cameras. However, it requires many corresponding points and is sensitive to the image noise. In this paper, we investigate mutual projections of cameras in four-dimensional space and show that it enables us to reduce the number of corresponding points required for computing the spatio-temporal multiple view geometry. Surprisingly, take three views for instance, we no longer need any corresponding point to calculate the spatio-temporal multiple view geometry, if all the cameras are projected to the other cameras mutually for two time intervals. We also show that the stability of the computation of spatio-temporal multiple view geometry is drastically improved by considering the mutual projections of cameras.

This paper is concerned with the packet transmission scheduling problem for repeating all-to-all broadcasts in Underwater Sensor Networks (USN) in which there are n nodes in a transmission range. All-to-all communication is one of the most dense communication patterns. It is assumed that each node has the same size packet. Unlike the terrestrial scenarios, the propagation time in underwater communications is not negligible. We define all-to-all broadcast as the one where every node transmits packets to all the other nodes in the network except itself. So, there are in total n(n - 1) packets to be transmitted for an all-to-all broadcast. The optimal transmission scheduling is to schedule in a way that all packets can be transmitted within the minimum time. In this paper, we propose an efficient packet transmission scheduling algorithm for underwater acoustic communications using the property of long propagation delay.

This paper proposes multipoint-to-multipoint (MPtoMP) real-time broadcast transmission using network coding for ad-hoc networks like video game networks. We aim to achieve highly reliable MPtoMP broadcasting using IEEE 802.11 media access control (MAC) that does not include a retransmission mechanism. When each node detects packets from the other nodes in a sequence, the correctly detected packets are network-encoded, and the encoded packet is broadcasted in the next sequence as a piggy-back for its native packet. To prevent increase of overhead in each packet due to piggy-back packet transmission, network coding vector for each node is exchanged between all nodes in the negotiation phase. Each user keeps using the same coding vector generated in the negotiation phase, and only coding information that represents which user signal is included in the network coding process is transmitted along with the piggy-back packet. Our simulation results show that the proposed method can provide higher reliability than other schemes using multi point relay (MPR) or redundant transmissions such as forward error correction (FEC). We also implement the proposed method in a wireless testbed, and show that the proposed method achieves high reliability in a real-world environment with a practical degree of complexity when installed on current wireless devices.

In this paper, we study an opportunistic scheduling scheme for the TDMA wireless network with relay stations. We model the time-varying channel condition of a wireless link as a stochastic process. Based on this model, we formulate an optimization problem for the opportunistic scheduling scheme that maximizes the expected system throughput while satisfying the QoS constraint of each user. In the opportunistic scheduling scheme for the system without relay stations, each user has only one communication path between the base station and itself, and thus only user selection is considered. However, in our opportunistic scheduling scheme for the system with relay stations, since there may exist multiple paths between the base station and a user, not only user selection but also path selection for the scheduled user is considered. In addition, we also propose an opportunistic time-sharing method for time-slot sharing between base station and relay stations. With the opportunistic time-sharing method, our opportunistic scheduling provides opportunistic resource sharing in three places in the system: user selection in a time-slot, path selection for the selected user, and time-slot sharing between base station and relay stations. Simulation results show that as the number of places that opportunistic resource sharing is applied to increases, the performance improvement also increases.

This paper proposes a high-speed architecture to realize two-variable numeric functions. It represents the given function as an edge-valued multiple-valued decision diagram (EVMDD), and shows a systematic design method based on the EVMDD. To achieve a design, we characterize a numeric function f by the values of l and p for which f is an l-restricted Mp-monotone increasing function. Here, l is a measure of subfunctions of f and p is a measure of the rate at which f increases with an increase in the dependent variable. For the special case of an EVMDD, the EVBDD, we show an upper bound on the number of nodes needed to realize an l-restricted Mp-monotone increasing function. Experimental results show that all of the two-variable numeric functions considered in this paper can be converted into an l-restricted Mp-monotone increasing function with p=1 or 3. Thus, they can be compactly realized by EVBDDs. Since EVMDDs have shorter paths and smaller memory size than EVBDDs, EVMDDs can produce fast and compact NFGs.

In this paper, multiconductor transmission line (MTL) modelling is used to characterize the frequency response and dispersion of the low-voltage outdoor powerline channel. The analysis focuses on a single transmitter-to-receiver link and all the possible connection schemes associated with that link. By resorting to modal analysis, approximate analytical upper bounds of the channel frequency-response are derived for simplified but representative network configurations involving power cables with star-quad cross-section. Numerical solution of the MTL equations is used to validate the theoretical work and to show the dispersion of the channel frequency-responses, which results to be of the order of 20 dB.

Generalized selection combining (GSC) was recently proposed as a low-complexity diversity combining technique for diversity-rich environments. This letter proposes a multi-hop Decode-and-Forward Relaying (MDFR) scheme in conjunction with GSC and describes its performance in terms of average bit error probability. We have shown that the proposed protocol offers a remarkable diversity advantage over direct transmission as well as the conventional decode-and-forward relaying (CDFR) scheme. Simulation results are also given to verify the analytical results.

Orthogonal frequency division multiplexing (OFDM) signals have high peak-to-average power ratio (PAPR) and cause large nonlinear distortions in power amplifiers (PAs). Memory effects in PAs also become no longer ignorable for the wide bandwidth of OFDM signals. Digital baseband predistorter is a highly efficient technique to compensate the nonlinear distortions. But it usually has many parameters and takes long time to converge. This paper presents a novel predistorter design using a set of orthogonal polynomials to increase the convergence speed and the compensation quality. Because OFDM signals are approximately complex Gaussian distributed, the complex Hermite polynomials which have a closed-form expression can be used as a set of orthogonal polynomials for OFDM signals. A differential envelope model is adopted in the predistorter design to compensate nonlinear PAs with memory effects. This model is superior to other predistorter models in parameter number to calculate. We inspect the proposed predistorter performance by using an OFDM signal referred to the IEEE 802.11a WLAN standard. Simulation results show that the proposed predistorter is efficient in compensating memory PAs. It is also demonstrated that the proposal acquires a faster convergence speed and a better compensation effect than conventional predistorters.

In this paper, a Stochastic Collocation Algorithm combined with Sparse Grid technique (SSCA) is proposed to deal with the periodic steady-state analysis for nonlinear systems with process variations. Compared to the existing approaches, SSCA has several considerable merits. Firstly, compared with the moment-matching parameterized model order reduction (PMOR) which equally treats the circuit response on process variables and frequency parameter by Taylor approximation, SSCA employs Homogeneous Chaos to capture the impact of process variations with exponential convergence rate and adopts Fourier series or Wavelet Bases to model the steady-state behavior in time domain. Secondly, contrary to Stochastic Galerkin Algorithm (SGA), which is efficient for stochastic linear system analysis, the complexity of SSCA is much smaller than that of SGA for nonlinear case. Thirdly, different from Efficient Collocation Method, the heuristic approach which may result in "Rank deficient problem" and "Runge phenomenon," Sparse Grid technique is developed to select the collocation points needed in SSCA in order to reduce the complexity while guaranteing the approximation accuracy. Furthermore, though SSCA is proposed for the stochastic nonlinear steady-state analysis, it can be applied to any other kind of nonlinear system simulation with process variations, such as transient analysis, etc.

With the scaling down of CMOS devices, process variation is becoming the leading cause of CMOS based analog circuit failures. For example, a mere 5% variation in feature size can trigger circuit failure. Various methods such as Monte-Carlo and corner-based verification help predict variation caused problems at the expense of thousands of simulations before capturing the problem. This paper presents a new methodology for analog circuit performance prediction. The new method first applies statistical uncertainty analysis on all associated devices in the circuit. By evaluating the uncertainty importance of parameter variability, it approximates the circuit with only components that are most critical to output results. Applying Chebyshev Affine Arithmetic (CAA) on the resulting system provides both performance bounds and probability information in time domain and frequency domain.

Reflecting the rapid growth of information technology, the configuration of software applications such as word processors and spreadsheets is both sophisticated and complicated. It is often difficult for users to identify relevant functions in the online manual for a target application. In this paper, we propose a method for question answering that finds functions related to the user's request. To enhance our method, we addressed two "mismatch" problems. The first problem is associated with a mismatch in vocabulary, where the same concept is represented by different words in the manual and in the user's question. The second problem is associated with a mismatch in function. Although the user may have a hypothetical function for a purpose in mind, this purpose can sometimes be accomplished by other functions. To resolve these mismatch problems, we extract terms related to software functions from the Web, so that the user's question can be matched to the relevant function with high accuracy. We demonstrate the effectiveness of our method experimentally.

Skyline query is very important because it is the basis of many applications, e.g., decision making, user-preference queries. Given an N-dimensional dataset D, a point p is said to dominate another point q if p is better than q in at least one dimension and equal to or better than q in the remaining dimensions. In this paper, we study a generalized problem of skyline query that, users are more interested in the details of the dominant relationship in a dataset, i.e., a point p dominates how many other points and whom they are. We show that the existing framework proposed in can not efficiently solve this problem. We find the interrelated connection between the partial order and the dominant relationship. Based on this discovery, we propose a new data structure, ParCube, which concisely represents the dominant relationship. We propose some effective strategies to construct ParCube. Extensive experiments illustrate the efficiency of our methods.

This paper presents a CMOS signal detection circuit for 2.5 Gb/s serial data communication system over FR-4 backplane. This overcomes characteristics deviation of full-wave rectifier-based simple power detection circuits due to data pattern and temperature by using an edge detector and a sample-hold circuit.

In this letter, we develop an analytical model for the drive-thru applications based on the IEEE 802.11p WAVE. The model shows that prioritizing the bitrates via the 802.11e EDCA mechanism leads to significant throughput improvement.

The CSMA/CA driven MAC protocols withhold packet transmissions from exposed stations when they detect carrier signal above a certain threshold. This is to avoid collisions at other receiving stations. However, this conservative scheme often exposes many stations unnecessarily, and thus minimizes the utilization of the spatial spectral resource. In this paper, we demonstrate that remote estimation of the status at the active receivers is more effective at avoiding collisions in wireless networks than the carrier sensing. We apply a new concept of the interference range, named as n-tolerant interference range, to guarantee reliable communications in the presence of n (n≥ 0) concurrent transmissions from outside the range. We design a distributed interference preventive MAC ( IP-MAC ) using the n-tolerant interference range that enables parallel accesses from the noninterfering stations for an active communication. In IP-MAC, an exposed station goes through an Interference Potentiality Check (IPC) to resolve whether it is potentially interfering or noninterfering to the active communication. During the resolve operation, IPC takes the capture effect at an active receiver into account with interfering signals from a number of possible concurrent transmissions near that receiver. The performance enhancement offered by IP-MAC is studied via simulations in different environments. Results reveal that IP-MAC significantly improves network performance in terms of throughput and delay.

This letter proposes closed form solutions to the L2-sensitivity minimization of second-order state-space digital filters with real poles. We consider two cases of second-order digital filters: distinct real poles and multiple real poles. In case of second-order digital filters, we can express the L2-sensitivity of second-order digital filters by a simple linear combination of exponential functions and formulate the L2-sensitivity minimization problem by a simple polynomial equation. As a result, the minimum L2-sensitivity realizations can be synthesized by only solving a fourth-degree polynomial equation, which can be analytically solved.

A novel turbo coded modulation scheme, called the turbo-APPM, for deep space optical communications is proposed. The proposed turbo-APPM is a serial concatenation of turbo codes, an accumulator and a pulse position modulation (PPM), where turbo codes act as an outer code while the accumulator and the PPM act together as an inner code. The generator polynomial and the puncturing rule for generating turbo codes are chosen to lower the bit error rate. At the receiver, the joint iterative decoding is performed between the inner decoder and the outer turbo decoder. In the outer decoder, local iterative decoding for turbo codes is conducted. Simulation results are presented showing that the proposed turbo-APPM outperforms all previously proposed schemes such as LDPC-APPM, RS-PPM and SCPPM reported in the literature.

A multiple-input switched-capacitor DC-DC converter which can realize long battery runtime is proposed in this letter. Unlike conventional converters for a back-lighting application, the proposed converter drives some LEDs by converting energy from solar cells. Furthermore, the proposed converter can charge a lithium battery when an output load is light. The validity of circuit design is confirmed by theoretical analyses, simulations, and experiments.

We propose requirement validation criteria and a method based on the interaction between actors in an information system. We focus on the cyclical transitions of one actor's situation against another and clarify observable stimuli and responses based on these transitions. Both actors' situations can be listed in a state transition table, which describes the observable stimuli or responses they send or receive. Examination of the interaction between both actors in the state transition tables enables us to detect missing or defective observable stimuli or responses. Typically, this method can be applied to the examination of the interaction between a resource managed by the information system and its user. As a case study, we analyzed 332 requirement defect reports of an actual system development project in Japan. We found that there were a certain amount of defects regarding missing or defective stimuli and responses, which can be detected using our proposed method if this method is used in the requirement definition phase. This means that we can reach a more complete requirement definition with our proposed method.