KTKasper Floe Trillingsgaard

Kasper Floe Trillingsgaard

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Kasper Floe Trillingsgaard has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    Wireless Access in Ultra-Reliable Low-Latency Communication (URLLC)

    by Petar Popovski, Cedomir Stefanovic, Jimmy J. Nielsen, Elisabeth de Carvalho, Marko Angjelichinoski, Kasper F. Trillingsgaard, Alexandru-Sabin Bana

    The future connectivity landscape and, notably, the 5G wireless systems will feature Ultra-Reliable Low Latency Communication (URLLC). The coupling of high reliability and low latency requirements in URLLC use cases makes the wireless access design very challenging, in terms of both the protocol design and of the associated transmission techniques. This paper aims to provide a broad perspective on the fundamental tradeoffs in URLLC, as well as the principles used in building access protocols. Two specific technologies are considered in the context of URLLC: massive MIMO and multi-connectivity, also termed interface diversity. The paper also touches upon the important question of the proper statistical methodology for designing and assessing extremely high reliability levels.


  • A Statistical Learning Approach to Ultra-Reliable Low Latency Communication

    by Marko Angjelichinoski, Kasper Floe Trillingsgaard, Petar Popovski

    Mission-critical applications require Ultra-Reliable Low Latency (URLLC) wireless connections, where the packet error rate (PER) goes down to 10..9. Fulfillment of the bold reliability figures becomes meaningful only if it can be related to a statistical model in which the URLLC system operates. However, this model is generally not known and needs to be learned by sampling the wireless environment. In this paper we treat this fundamental problem in the simplest possible communicationtheoretic setting: selecting a transmission rate over a dynamic wireless channel in order to guarantee high transmission reliability. We introduce a novel statistical framework for design and assessment of URLLC systems, consisting of three key components: (i) channel model selection; (ii) learning the model using training; (iii) selecting the transmission rate to satisfy the required reliability. As it is insufficient to specify the URLLC requirements only through PER, two types of statistical constraints are introduced, Averaged Reliability (AR) and Probably Correct Reliability (PCR). The analysis and the evaluations show that adequate model selection and learning are indispensable for designing consistent physical layer that asymptotically behaves as if the channel was known perfectly, while maintaining the reliability requirements in URLLC systems.


  • Common-Message Broadcast Channels With Feedback in the Nonasymptotic Regime: Stop Feedback

    by Kasper Floe Trillingsgaard, Wei Yang, Giuseppe Durisi, Petar Popovski

    We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback codes. For the point-to-point case, Polyanskiy et al. (2011) demonstrated that variable-length coding combined with stop-feedback significantly increases the speed of convergence of the maximum coding rate to capacity. This speed-up manifests itself in the absence of a square-root penalty in the asymptotic expansion of the maximum coding rate for large blocklengths, i.e., zero dispersion. In this paper, we present nonasymptotic achievability and converse bounds on the maximum coding rate of the common-message K-user discrete memoryless broadcast channel, which strengthen and generalize the ones reported in Trillingsgaard et al. (2015) for the twouser case. An asymptotic analysis of these bounds reveals that zero dispersion cannot be achieved for certain common-message broadcast channels (e.g., the binary symmetric broadcast channel). Furthermore, we identify conditions under which our converse and achievability bounds are tight up to the second order. Through numerical evaluations, we illustrate that our second-order expansions approximate accurately the maximum coding rate and that the speed of convergence to capacity is indeed slower than for the point-to-point case.


  • Open Access

    Short Packet Structure for Ultra-Reliable Machine-Type Communication: Tradeoff between Detection and Decoding

    by Alexandru-Sabin Bana, Kasper Floe Trillingsgaard, Petar Popovski, Elisabeth de Carvalho

    Machine-type communication requires rethinking of the structure of short packets due to the coding limitations and the significant role of the control information. In ultra-reliable low-latency communication (URLLC), it is crucial to optimally use the limited degrees of freedom (DoFs) to send data and control information. We consider a URLLC model for short packet transmission with acknow 1-edgement (ACK). We compare the detection/decoding performance of two short packet structures: (1) time-multiplexed detection sequence and data; and (2) structure in which both packet detection and data decoding use all DoFs. Specifically, as an instance of the second structure we use superimposed sequences for detection and data. We derive the probabilities of false alarm and misdetection for an AWGN channel and numerically minimize the packet error probability (PER), showing that for delay-constrained data and ACK exchange, there is a tradeoff between the resources spent for detection and decoding. We show that the optimal PER for the superimposed structure is achieved for higher detection overhead. For this reason, the PER is also higher than in the preamble case. However, the superimposed structure is advantageous due to its flexibility to achieve optimal operation without the need to use multiple codebooks.


  • Feedback halves the dispersion for some two-user broadcast channels with common message

    by Kasper Floe Trillingsgaard, Wei Yang, Giuseppe Durisi, Petar Popovski

    We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common-message is transmitted using fixed-blocklength codes with feedback. Specifically, we focus on a family of broadcast channels composed of two antisymmetric Z-channels. For this setup, we obtain matching upper and lower bounds on the dispersion term in the asymptotic expansion of the maximum coding rate. These bounds reveal that the dispersion is halved compared to the no-feedback case.


  • Encoding of control information and data for downlink broadcast of short packets

    by Kasper Floe Trillingsgaard, Petar Popovski

    It is almost an axiom that every cellular wireless system, including the upcoming 5G systems, should be based on data transmissions organized in frames. The frame design is based on heuristics, consisting of a frame header and data part. The frame header contains control information that specifies the sizes of the data packets and provides pointers to their location within the data part. In this paper we show that this design heuristics is suboptimal when the messages in the data part are short. We consider a downlink scenario represented by an AWGN broadcast channel with K users, while the sizes of the messages to the users are random variables. Each data packet encodes a message to one user. However, if the message sizes are small, there is a significant overhead caused by the header and the data packets can not be encoded efficiently. This calls for revision of the established heuristics for framing control information and data. We show that grouping messages of multiple users allows more efficient encoding from a transmitter perspective. On the other hand, it has the undesirable implication that it requires each user to decode the messages of a whole group of users. We assume that the power spend by each user is proportional to the number of channel uses it needs to decode. Using recent results in finite blocklength analysis, we investigate the trade-offs between total transmission time from the transmitter perspective and the average power spend at each user. Our approach shows that the space of feasible protocols is significantly enlarged and thereby allows the designer to trade-off between average total transmission time and the average power spend by each user.


  • Downlink Transmission of Short Packets: Framing and Control Information Revisited

    by Kasper Floe Trillingsgaard, Petar Popovski

    Cellular wireless systems rely on frame-based transmissions. The frame design is conventionally based on heuristics, consisting of a frame header and a data part. The frame header contains control information that provides pointers to the messages within the data part. In this paper, we revisit the principles of frame design and show the impact of the new design in scenarios that feature short data packets, which are central to various 5G and Internet of Things applications. We treat framing for downlink transmission in an AWGN broadcast channel with $K$ users, where the sizes of the messages to the users are random variables. Using approximations from finite blocklength information theory, we establish a framework in which a message to a given user is not necessarily encoded as a single packet, but may be grouped with messages to other users and benefit from the improved efficiency of longer codes. This requires changes in the way control information is sent, and it requires that the users need to spend power decoding other messages, thereby increasing the average power consumption. We show that the common heuristic design is only one point on a curve that represents the tradeoff between latency and power consumption.


  • Generalized HARQ Protocols with Delayed Channel State Information and Average Latency Constraints

    by Kasper Floe Trillingsgaard, Petar Popovski

    In many wireless systems, the signal-to-interference-and-noise ratio that is applicable to a certain transmission, referred to as channel state information (CSI), can only be learned after the transmission has taken place and is thereby delayed (outdated). In such systems, hybrid automatic repeat request (HARQ) protocols are often used to achieve high throughput with low latency. This paper put forth the family of expandable message space (EMS) protocols, that generalize the HARQ protocol and allow for rate adaptation based on delayed CSI at the transmitter (CSIT). Assuming a block-fading channel, the proposed EMS protocols are analyzed using dynamic programming. When full delayed CSIT is available and there is a constraint on the average decoding time, it is shown that the optimal zero outage EMS protocol has a particularly simple operational interpretation and that the throughput is identical to that of the backtrack retransmission request (BRQ) protocol. We also devise EMS protocols for the case in which CSIT is only available through a finite number of feedback messages. The numerical results demonstrate that BRQ approaches the ergodic capacity quickly compared with HARQ, while EMS protocols with only three and four feedback messages achieve throughputs, that are only slightly worse than that of BRQ.