Loading...
Search for: user-terminals
0.005 seconds

    Multi-antenna coded caching

    , Article IEEE International Symposium on Information Theory - Proceedings, 25 June 2017 through 30 June 2017 ; 2017 , Pages 2113-2117 ; 21578095 (ISSN) ; 9781509040964 (ISBN) Shariatpanahi, S. P ; Caire, G ; Khalaj, B. H ; Sharif University of Technology
    Abstract
    In this paper we consider a single-cell downlink scenario where a multiple-antenna base station delivers contents to multiple cache-enabled user terminals. Based on the multicasting opportunities provided by the so-called Coded Caching technique, we investigate three delivery approaches. Our baseline scheme employs the coded caching technique on top of max-min fair multicasting. The second one consists of a joint design of Zero-Forcing (ZF) and coded caching, where the coded chunks are formed in the signal domain (complex field). The third scheme is similar to the second one with the difference that the coded chunks are formed in the data domain (finite field). We derive closed-form rate... 

    Linear multicast beamforming schemes for coded caching

    , Article 52nd Asilomar Conference on Signals, Systems and Computers, ACSSC 2018, 28 October 2018 through 31 October 2018 ; Volume 2018-October , 2019 , Pages 172-176 ; 10586393 (ISSN); 9781538692189 (ISBN) Tolli, A ; Kaleva, J ; Shariatpanahi, S. P ; Khalaj, B ; Matthews M. B ; Sharif University of Technology
    IEEE Computer Society  2019
    Abstract
    A single cell downlink scenario is considered, where a multiple-antenna base station delivers contents to cache-enabled user terminals. Depending on the available degrees of freedom, several multicast messages are transmitted in parallel to distinct subsets of users. In the multicast beamformer design, we restrict ourselves to linear receiver implementation, which does not require successive interference cancellation unlike in the more optimal baseline scheme. With a small loss in performance, the complexity of both the receiver and transmitter implementation can be significantly reduced. © 2018 IEEE  

    Multicast beamformer design for coded caching

    , Article IEEE International Symposium on Information Theory - Proceedings, 17 June 2018 through 22 June 2018 ; Volume 2018-June , 2018 , Pages 1914-1918 ; 21578095 (ISSN) ; 9781538647806 (ISBN) Tolli, A ; Shariatpanahi, S. P ; Kaleva, J ; Khalaj, B ; Sharif University of Technology
    Abstract
    A single cell downlink scenario is considered where a multiple-antenna base station delivers contents to cache-enabled user terminals. Using the ideas from multi-server coded caching (CC) scheme developed for wired networks, a joint design of CC and general multicast beamforming is considered to benefit from spatial multiplexing gain, improved interference management and the global CC gain, simultaneously. The proposed multicast beamforming strategies utilize the multiantenna multicasting opportunities provided by the CC technique and optimally balance the detrimental impact of both noise and inter-stream interference from coded messages transmitted in parallel. The proposed scheme is shown... 

    A new distributed uplink packet scheduling algorithm in WiMAX newtorks

    , Article Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010, 21 May 2010 through 24 May 2010 ; Volume 2 , May , 2010 , Pages V2232-V2236 ; 9781424458226 (ISBN) Nazari, S ; Beigy, H ; Sharif University of Technology
    2010
    Abstract
    Worldwide interoperability for Microwave Access (WiMAX) is designed to support a wide range of Quality of Service (QoS) requirements for different applications. Unlike the single service networks, a priority based mechanism is needed for specifying the transmission order of packets belonging to different traffic sources according to their QoS characteristics, which is called packet scheduling. In WiMAX standard, packet scheduling algorithm is not defined and its design is left for researchers. In this work, we propose a distributed uplink packet scheduling algorithm. In the proposed algorithm, when uplink capacity cannot satisfy the required resource of connections, according to traffic...