Search

In this paper, we study the inverse sorting problem with bound constraints under the l"~-norm and the Hamming distance. For the problem under the l"~-norm, an O(nlogn)-time algorithm is presented. For the problem under the Hamming distance, we first show that it has an @W(nlogn)-time lower bound in the comparison model; and then, we present an O(nlogn)-time algorithm. Both of the presented algorithms improve the previous upper bounds from O(n^2).

The CMOS transceiver IC exploits the superheterodyne architecture to implement a low-cost RF front-end with an auto-I/Q calibration function for IEEE 802.11g. The transceiver supports I/Q gain and phase mismatch auto tuning mechanisms at both the transmitting and receiving ends, which are able to reduce the phase mismatch to within 1/spl deg/ and gain mismatch to 0.1dB. Implemented in a 0.25 /spl mu/m CMOS process with 2.7 V supply voltage, the transceiver delivers a 5.1 dB receiver cascade noise figure, 7 dBm transmit, and a 1 dB compression point.

This CMOS transceiver IC exploits the superheterodyne architecture to implement a low-cost RF front-end with only 6.25 mm 2 die area for IEEE 802.11 b standard. The transceiver is implemented in 0.25 μm CMOS process with 2.7 V supply voltage, and achieves a -86 dBm 11 Mb/s receive sensitivity and a 2dBm transmit output power.

An RF front-end transceiver is implemented in standard 0.18µm CMOS for V2.1 Bluetooth applications. All detections and calibrations are realized without baseband's feedback using an incoming GFSK signal detection, auto LNA gain mode selection and auto gain calibration with combined PGA/RSSI function. The DEVM performance of the transmitter is less than 6% and a 7.5dB system NF is achieved in the receiver. Continuous current consumptions in Rx and Tx are 32mA and 42mA respectively with a 1.8V internal regulator voltage.

Let A be a sequence of n real numbers, L(1) and L(2) be two integers such that L(1)or = L(2) , and R(1) and R(2) be two real numbers such that R(1)or = R(2). An interval of A is feasible if its length is between L(1) and L(2) and its average is between R(1) and R(2). In this paper, we study the following problems: finding all feasible intervals of A, counting all feasible intervals of A, finding a maximum cardinality set of non-overlapping feasible intervals of A, locating a longest feasible interval of A, and locating a shortest feasible interval of A. The problems are motivated from the problem of locating CpG islands in biomolecular sequences. In this paper, we firstly show that all the problems have Omega (n log n)-time lower bound in the comparison model. Then, we use geometric approaches to design optimal algorithms for the problems. All the presented algorithms run in an on-line manner and use O(n) space.