Propositional satisfiability solving (SAT) has been considerably successful in numerous industrial applications. Whereas the speed and the capacity of SAT solvers significantly improved in the last two decades, the understanding of SAT encodings is still limited and often challenging. Two wellknown variable encodings, namely the order encoding and the sparse encoding, are the most widely used a...

There are many new methods for solving constraint satisfaction problems proposed in recent years. Due to their complexity, a theoretical analysis on their average-case behaviours seems to be very difficult. Researchers tend to adopt an empirical approach to evaluate constraint satisfaction techniques. When empirical results are ready, statistical techniques are often employed for analysis. The ...

It is difficult for LUT-based FPGA technology mapping to generate a power-minimal K-input LUT network with minimum depth at one time because a problem for power-minimization was shown to be NP-hard[5]. A problem for area-minimization is also NP-hard, and area-aware algorithms[7][8][9][10] recover area after generating a depthminimum network. On the other hand, existing poweraware algorithms[11]...

CubeSats have proven themselves as a reliable and cost-effective method to perform experiments in space, but they are highly constrained by their specifications and size. One such constraint is the average continuous power, about 5 W, which is available to the typical CubeSat. To improve this constraint, we have developed the eXtendable Solar Array System (XSAS), a deployable solar array protot...

Space-time block codes (STBCs) from non-square complex orthogonal designs are bandwidth efficient when compared with those from square real/complex orthogonal designs. Though there exists rate-1 ROD for any number of transmit antennas, rate-1 complex orthogonal designs (COD) does not exist for more than 2 transmit antennas. Liang (IEEE Trans. Inform. Theory, 2003) and Lu et al (IEEE Trans. Info...

In many applications in which speech is played back via a sound reinforcement system such as public address systems and mobile phones, speech intelligibility is degraded by additive environmental noise. A possible solution to maintain high intelligibility in noise is to pre-process the speech signal based on the estimated noise power at the position of the listener. The previously proposed Adap...

We consider the problem of transferring data with a xed level of reliability over a discrete time channel whose characteristics vary with time, with a constraint on the average delay su ered by the data and a constraint on peak transmitter power. We assume that the channel state is known to the transmitter at the beginning of each slot, and seek transmission policies that minimize the average p...

The cognitive radio has been considered as a promising paradigm to achieve efficient spectrum usage by allowing the coexistence of the primary and cognitive radio networks. One fundamental challenge is to ensure the quality of service (QoS) of the primary link while maximizing the achievable transmission rate of the cognitive radio user. In this paper, we investigate the cooperation based spect...

This paper introduces the formalism which connects between rotation measure (RM) measurements for extragalactic sources and the cosmological magnetic field power spectrum. It is shown that the amplitude and shape of the cosmological magnetic field power spectrum can be constrained by using a few hundred radio sources, for which Faraday RMs are available. This constraint is of the form Brms <∼ 1...

In this paper we investigate power allocation in MIMO-OFDM systems. We describe the optimal power allocations under two different constraints: a constraint on the total power of all transmitters (TXs) which is applicable in wireless applications, and a constraint on the power of each TX which is more relevant in wireline applications. We describe the optimal TX/RX structure which in combination...