This paper provides a tutorial introduction to the constant modulus (CM) criterion for blind fractionally spaced equalizer (FSE) design via a (stochastic) gradient descent algorithm such as the constant modulus algorithm (CMA). The topical divisions utilized in this tutorial

No abstract

No abstract

Abstract-We consider the problem of synchronizing the carriers of two sources in a wireless communication system with one destination. Carrier synchronization has been considered recently in cooperative communication systems where the sources wish to pool their antenna resources and transmit as a "distributed beamformer". Based on the concept of round-trip carrier synchronization first described in [1], we propose a new time-slotted round-trip carrier synchronization system and describe its implementation in systems with single-path or multipath channels. The performance of the time-slotted round-trip carrier synchronization system is investigated in terms of the phase offset at the destination and the expected beamforming time before resynchronization is required. Our results suggest that the synchronization overhead can be small with respect to the potential beamforming gains.

Linear arrays of 1, 8, and 9 letters were exposed while S read off the items of the letter sequence while maintaining constant fixation. By this procedure, serial position effects were studied in the absence of requirements for scanning the array quickly, as in a tachistoscopic display, and for remembering a large number of items, as in a delayed whole report. Despite the absence of these requirements, typical serial position curves were generated. Serial position effects were partially ameliorated by the introduction of blank spaces into the array. Performance was influenced both in the immediate vicinity of the blank spacings, as well as extending over a large portion of the array. The data were interpreted in terms of lateral masking effects associated with adjacent elements. N onuniformities in performance with closely placed visual materials have long been subjects of investigation (e.g.

No abstract

We study a quantized distributed reception scenario in which a transmitter equipped with multiple antennas sends multiple streams via spatial multiplexing to a large number of geographically separated single antenna receive nodes. This approach is applicable to scenarios such as those enabled by the Internet of Things (IoT) which holds much commercial potential and could facilitate distributed multiple-input multiple-output (MIMO) communication in future systems. The receive nodes quantize their received signals and forward the quantized received signals to a receive fusion center. With global channel knowledge and forwarded quantized information from the receive nodes, the fusion center attempts to decode the transmitted symbols. We assume the transmit vector consists of arbitrary constellation points, and each receive node quantizes its received signal with one bit for each of the real and imaginary parts of the signal to minimize the transmission overhead between the receive nodes and the fusion center. Fusing this data is a nontrivial problem because the receive nodes cannot decode the transmitted symbols before quantization. We develop an optimal maximum likelihood (ML) receiver and a low-complexity zero-forcing (ZF)-type receiver at the fusion center. Despite its suboptimality, the ZF-type receiver is simple to implement and shows comparable performance with the ML receiver in the low signal-to-noise ratio (SNR) regime but experiences an error rate floor at high SNR. It is shown that this error floor can be overcome by increasing the number of receive nodes.Index Terms-Internet of things (IoT), multiple-input multiple-output (MIMO), quantized distributed reception, spatial multiplexing.

No abstract