Arbitrary Number Of Transmitters Research Articles

Fundamental Limits of Cache-Aided MIMO Wireless Networks

This paper studies the Multi-Input-Multi-Output (MIMO) interference networks with arbitrary number of transmitters and receivers, where both the transmitters and receivers are equipped with caches. The main goal is to design content placement and delivery schemes that minimize the worst case normalized delivery time (NDT). First, we propose a delivery scheme for the cache-aided Single-Input-Multiple-Output (SIMO) interference networks. Then, we obtain the achievable NDT of the cache-aided MIMO interference networks using the decomposition property of splitting each multi-antenna transmitter into multiple single antenna transmitters. Furthermore, we derive an information-theoretic bound on the optimal NDT of the cache-aided MIMO interference network. Analytical results show that the proposed scheme is within a multiplicative gap of 2 from the derived lower bound independent of all system parameters for any uncoded cache placement scheme. We also derive a novel delivery scheme for the cache-aided Multi-Input-Single-Output (MISO) interference network outperforming our proposed scheme for the cache-aided MIMO interference network. The numerical results show the superiority of our proposed scheme over the state-of-the-art schemes in the literature. Our results show that the coded caching gain has a more significant contribution in reducing the transmission latency than the spatial multiplexing gain. Our results indicate that the receive-antennas become more effective in reducing the NDT than the transmit-antennas in the presence of caches at the receiver-side. In addition, we show that increasing the number of transmit-antennas has a higher gain in reducing the NDT than adding more transmitters in the cache-aided MISO interference network.

Localization of Transmitters and Scatterers by Single Receiver

Localization by single receiver is attractive in practice. This paper exploits the additional propagation paths from scatterers for the localization of transmitters, using the time differences of arrival between the direct and scattered signals and their angles of arrival observed at the receiver. Localization is possible only if there are at least two transmitters and at least two scatterers, which may not happen in a real scenario. We explore the utilization of intentional transmitter or scatterer at known position to assist in the localization, thereby enabling localization with arbitrary number of transmitters or scatterers. The challenge for this problem is that the positions of the unintentional scatterers are not known and they need to be estimated in conjunction with the transmitter positions. A non-iterative localization algorithm based on the integration of several minimal measurement solutions is proposed, with the analysis in supporting the Cramer-Rao Lower Bound performance for Gaussian noise over the small error region. The optimum placement of single intentional transmitter is derived for the 2-D and 3-D scenarios, as well as for single intentional scatterer. Simulation confirms the expected performance of the proposed positioning solution and validates the optimum placement.

Analysis on Influences of Intra-Couplings in a MISO Magnetic Beamforming Wireless Power Transfer System

Magnetic beamforming techniques can enhance the power transfer efficiency using focused magnetic fields by the multiple transmitters to the receivers. However, the intra-couplings that cause power leakage and phase distortion among the arrayed coils inevitably occur due to the deployment of coils having strong couplings between each other. Here, we analyze the adverse influences of intra-couplings and present the advantages of magnetically independent transmitters for multiple-inputs and single-output (MISO) WPT. The independent coil array can achieve focused magnetic fields by simply adjusting the amplitude of the transmitter voltage source without phase adjustment. The system also can eliminate the reactive power with the independent coil array to efficiently use the supplying power from the source. The analytical studies are verified by numerical and circuit simulation and experiments. Our analysis can be generalized to the MISO-WPT with an arbitrary number of transmitters. It can provide insight into designing and implementing the MISO-WPT applying magnetic beamforming.

Resonant Analysis of Magnetic Coupling Wireless Power Transfer Systems

For a general multi-coil magnetic coupling wireless power transfer (MC-WPT) system with different coil properties and non-negligible cross couplings, there is no analytical solution that connects the resonant frequencies of the system to its electric parameters. Establishing such a generalized analytical solution not only permits quantitative analysis of resonant points but also provides a generic platform for the physical interpretation of resonance. For this purpose, a novel modeling and analysis method of integrating time domain and frequency domain is proposed in this paper, with that all possible resonant points of arbitrary coil MC-WPT systems can be quickly and accurately determined. First, an accurate state-space model of a general MC-WPT system with arbitrary number of transmitters, repeaters, and receivers is established and the analytical current response on each circuit is derived. Then, several key system concepts about resonance are elucidated, based on which the generalized analytical expressions of resonant points of MC-WPT systems, including resonant frequencies and corresponding powers and efficiencies, are derived. Furthermore, the physical interpretation along with the mathematic relationships of several key easy-confusing concepts are deduced, which provides a systematic theoretical criteria for the selection of operating frequency to achieve the resonant states for MC-WPT systems.

A Unified Theory of Multiple-Access and Interference Channels via Approximate Capacity Regions for the MAC-IC-MAC

Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing interference to the receiver of the other MAC, a channel we refer to henceforth as the MAC-IC-MAC. For the discrete memory-less (DM) MAC-IC-MAC, two inner bounds are obtained that are generalizations of prior inner bounds for the two-user DM interference channel (IC) due to Chong et al. For the semi-deterministic MAC-IC-MAC, it is shown that single-user coding at the non-interfering transmitters and superposition coding at the interfering transmitter of each MAC achieves a rate region that is within a quantifiable gap of the capacity region, thereby extending such a result for the two-user semi-deterministic IC by Telatar and Tse. For the Gaussian MAC-IC-MAC, an approximate capacity region that is within a constant gap of the capacity region is obtained, generalizing such a result for the two-user Gaussian IC by Etkin et al. On contrary to the aforementioned approximate capacity results for the two-user IC, whose achievability requires the union of all admissible input distributions, our gap results on the semi-deterministic and the Gaussian MAC-IC-MAC are achievable by only a subset and one of all admissible coding distributions, respectively. The symmetric generalized degrees of freedom (GDoFs) of the symmetric Gaussian MAC-IC-MAC with more than one user per cell, which is a function of the interference strength (the ratio of INR to SNR at high SNR, both expressed in dB) and the numbers of users in each cell, are V-shaped with flat shoulders. An analysis based on signal-level partitions shows that the non-interfering transmitters utilize the signal-level partitions at the receiver where they are intended that cannot be accessed by the interfering transmitters (due to the restriction of superposition coding), thereby improving the sum symmetric GDoF of up to one degree of freedom per cell under a range of SINR exponent levels, which in turn becomes wider as the number of transmitters in each cell increases. Consequently, time-sharing between interfering and non-interfering transmitters is GDoF-suboptimal in general, as is time-sharing between the two embedded MAC-Z-MACs.

Robust multifrequency imaging with MUSIC

In this paper, we study the MUltiple SIgnal Classification (MUSIC) algorithm often used to image small targets when multiple measurement vectors are available. We show that this algorithm may be used when the imaging problem can be cast as a linear system that admits a special factorization. We discuss several active array imaging configurations where this factorization is exact, as well as other configurations where the factorization only holds approximately and, hence, the results provided by MUSIC deteriorate. We give special attention to the most general setting where an active array with an arbitrary number of transmitters and receivers uses signals of multiple frequencies to image the targets. This setting provides all the possible diversity of information that can be obtained from the illuminations. We give a theorem that shows that MUSIC is robust with respect to additive noise provided that the targets are well separated. The theorem also shows the relevance of using appropriate sets of controlled parameters, such as excitations, to form the images with MUSIC robustly. We present numerical experiments that support our theoretical results.

Adaptive Spatial Modulation for Visible Light Communications With an Arbitrary Number of Transmitters

As a power and bandwidth efficient modulation scheme, the optical spatial modulation (SM) technique has recently drawn increased attention in the field of visible light communications (VLC). To guarantee the number of bits mapped by the transmitter's index at each timeslot is an integer, the number of transmitters (i.e., light-emitting diodes) in the SM based VLC system is often set be a power of two. To break the limitation on the required number of transmitters and provide more design flexibility, this paper investigates the SM based VLC with an arbitrary number of transmitters. Initially, a channel adaptive bit mapping (CABM) scheme is proposed, which includes three steps: bit mapping in space domain, bit mapping in signal domain, and the channel adaptive mapping. The proposed CABM scheme allows operation with an arbitrary number of transmitters, and is verified to be an efficient scheme through numerical results. Based on the CABM scheme, the information-theoretical aspects of the SM based VLC are analyzed. The theoretical expression of the mutual information is first analyzed. However, it is very hard to evaluate system performance. To obtain more insights, a lower bound of the mutual information is derived, which is in closedform. Both theoretical analysis and numerical results show that the gap between the mutual information and its lower bound is small. Finally, to further improve the system performance, the precoding scheme is proposed for the SM based VLC. Numerical results show that the system performance improves dramatically when using the proposed precoding scheme.

Fundamental Storage-Latency Tradeoff in Cache-Aided MIMO Interference Networks

Caching is an effective technique to improve user perceived experience for content delivery in wireless networks. Wireless caching differs from traditional web caching in that it can exploit the broadcast nature of wireless medium and hence opportunistically change the network topologies. This paper studies a cache-aided MIMO interference network with 3 transmitters each equipped with M antennas and 3 receivers each with N antennas. With caching at both the transmitter and receiver sides, the network is changed to hybrid forms of MIMO broadcast channel, MIMO X channel, and MIMO multicast channels. We analyze the degrees of freedom (DoF) of these new channel models using practical interference management schemes. Based on the collective use of these DoF results, we then obtain an achievable normalized delivery time (NDT) of the network, an information-theoretic metric that evaluates the worst-case delivery time at given cache sizes. The obtained NDT is for arbitrary M, N and any feasible cache sizes. It is shown to be optimal in certain cases and within a multiplicative gap of 3 from the optimum in other cases. The extension to the network with arbitrary number of transmitters and receivers is also discussed.

A new power-efficient CDMA-based transmitter for high-speed serial links

Conventional CDMA serial links suffer from the drawback that the number of transmitters is limited to only two in practical implementations due to the reduced voltage spacing between adjacent logic states of the transmitted data. In this letter, we propose a new CDMA serial link architect that allows an arbitrary number of transmitters to transmit data over the same channel while keeping the voltage spacing between adjacent logic states of the transmitted data to be the same as that of 4 pulse-amplitude-modulation serial link transmmitters. The effectiveness of the proposed architect is validated using the simulation results of a serial link with four transmitters designed in an IBM 130 nm 1.2 V CMOS technology.

Optimizing MIMO antenna systems with channel covariance feedback

We consider a narrowband point-to-point communication system with n/sub T/ transmitters and n/sub R/ receivers. We assume the receiver has perfect knowledge of the channel, while the transmitter has no channel knowledge. We consider the case where the receiving antenna array has uncorrelated elements, while the elements of the transmitting array are arbitrarily correlated. Focusing on the case where n/sub T/=2, we derive simple analytic expressions for the ergodic average and the cumulative distribution function of the mutual information for arbitrary input (transmission) signal covariance. We then determine the ergodic and outage capacities and the associated optimal input signal covariances. We thus show how a transmitter with covariance knowledge should correlate its transmissions to maximize throughput. These results allow us to derive an exact condition (both necessary and sufficient) that determines when beamforming is optimal for systems with arbitrary number of transmitters and receivers.