331 research outputs found

    Reduced complexity multicast beamforming and group assignment schemes for multi-antenna coded caching

    Get PDF
    Abstract. In spite of recent advancements in wireless communication technologies and data delivery networks, it is unlikely that the speeds supported by these networks will be able to keep up with the exponentially increasing demand caused by the widespread adoption of high-speed and large-data applications. One appealing idea proposed to address this issue is coded caching, which is an innovative data delivery technique that makes use of the network’s aggregate cache rather than the individual memory available to each user. This proposed idea of coded caching helps boost the data rates by distributing cache material throughout the network and delivering independent content to many users at a time. Despite the original theoretical promises for large caching gains, in reality, coded caching suffers from severe bottlenecks that dramatically limit these gains. Some of these bottlenecks are requiring complex successive interference cancellation (SIC) at the receiver, exponential increase in subpacketization, applicability to a limited range of input parameters, and performance losses in low- and mid- signal to noise ratio (SNR) regimes. In this study, we present a novel coded caching scheme based on user grouping for cache-aided multi-input single-output (MISO) networks. One special property of this new scheme is its applicability to every set of input values for the user count (KK), transmitter-side antenna count (LL), and the global coded caching gain (tt). Moreover, for a fixed tt, this scheme can achieve theoretical sum-DoF optimality with no limitations. This strategy yields superior performance in terms of subpacketization when input parameters satisfy t+Lt+1N\frac{t+L}{t+1} \in \mathbb{N}. This performance boost is enabled by the underlying user grouping structure during data delivery. However, when input parameters do not comply with t+Lt+1\frac{t+L}{t+1} N\in \mathbb{N}, in order to guarantee symmetry of the scheme and optimal DoF, multicast and unicast messages need to be constructed using a tree diagram, resulting in excess subpacketization and transmission count. Nevertheless, the simple receiver structure without the SIC requirement not only simplifies the implementation complexity but also enables us to use state-of-the-art methods to readily design optimized transmit beamformers maximizing the achievable symmetric rate. Finally, we use numerical analysis to compare our new proposed scheme with well-known coded caching schemes in the literature

    General Framework and Novel Transceiver Architecture based on Hybrid Beamforming for NOMA in Massive MIMO Channels

    Full text link
    Massive MIMO and non-orthogonal multiple access (NOMA) are crucial methods for future wireless systems as they provide many advantages over conventional systems. Power domain NOMA methods are investigated in massive MIMO systems, whereas there is little work on integration of code domain NOMA and massive MIMO which is the subject of this study. We propose a general framework employing user-grouping based hybrid beamforming architecture for mm-wave massive MIMO systems where NOMA is considered as an intra-group process. It is shown that classical receivers of sparse code multiple access (SCMA) and multi-user shared access (MUSA) can be directly adapted. Additionally, a novel receiver architecture which is an improvement over classical one is proposed for uplink MUSA. This receiver makes MUSA preferable over SCMA for uplink transmission with lower complexity. We provide a lower bound on achievable information rate (AIR) as a performance measure. We show that code domain NOMA schemes outperform conventional methods with very limited number of radio frequency (RF) chains where users are spatially close to each other. Furthermore, we provide an analysis in terms of bit-error rate and AIR under different code length and overloading scenarios for uplink transmission where flexible structure of MUSA is exploited.Comment: Partially presented at IEEE ICC 2020 Workshop on NOMA for 5G and Beyond and to be submitted to IEEE Transactions on Communication

    Real-Time Beamforming Using High-Speed FPGAs at the Allen Telescope Array

    Get PDF
    The Allen Telescope Array (ATA) at the Hat Creek Radio Observatory (HCRO) is a wide‐field panchromatic radio telescope currently consisting of 42 offset‐Gregorian antennas each with a 6 m aperture, with plans to expand the array to 350 antennas. Through unique back‐end hardware, the ATA performs real‐time wideband beamforming with independent subarray capabilities and customizable beam shaping. The beamformers enable science observations requiring the full gain of the array, time domain (nonintegrated) output, and interference excision or orthogonal beamsets. In this paper we report on the design of this beamformer, including architecture and experimental results. Furthermore, we address some practical considerations in large‐N wideband beamformers implemented on field programmable gate array platforms, including device utilization, methods of calibration and control, and interchip synchronization
    corecore