Previous work on transmitter antenna diversity has shown that the use of multiple transmitter antennas at the base station results in improved performance due to increase of diversity (path diversity). This happens with no bandwidth cost, even when the signal quality along several paths is poor, but the receiver estimates the channel with accuracy. This paper evaluates the effects of channel estimation errors in the performance of the schemes designated as Space-Time Transmitter Diversity (STTD) and Selective Transmitter Diversity (STD). We consider low to medium signal to noise ratios characteristic of Wideband Code Division Multiple Access (WCDMA) networks. Different fading channel models are considered for comparison between the two schemes. The improvement due to convolutional coding associated with these techniques is also evaluated. 相似文献
High acceleration of radar targets is analyzed using Acceleration Ambiguity Function(AAF). The acceleration resolution based on AAF is defined. The AAF and acceleration resolution of rectangle pulse signal are derivated and the conclusion that its acceleration resolution is in inverse proportion with the square of its duration is drawn. In the end, these conclusions are applied to the parameter designing and performance evaluation for a certain type of pulse Doppler radar. 相似文献
Two elements enter the choice between 2 and 3SLS for full-system estimation: statistical efficiency and computational cost. 2SLS always has the computational edge, but 3SLS can be more efficient, a relative advantage that increases with the strength of the interrelations among the error terms. A measure of these interrelations is thus helpful in making the choice, and, when there are only two equations, this has suggested using a high pairwise error correlation as an indicator of when to use 3SLS. In larger systems of equations, however, these pairwise correlations can remain small even though more general interrelations give 3SLS the relative advantage. More general indicators are therefore needed, and this paper suggests three such and demonstrates their efficacy.Professor of Economics, Boston College, and Principal Research Associate, Center for Computational Research in Economics and Management Science, MIT. All computation was done on the TROLL system at MIT. My thanks go to Josh Charap for his able research assistance. This research was sponsored in part by the National Science Foundation under grant #IST-8420614. 相似文献
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献