Jesper Hemming Sørensen

Design and Analysis of LT Codes with Decreasing Ripple Size

In this paper we propose a new design of LT codes, which decreases the amount of necessary overhead in comparison to existing designs. The design focuses on a parameter of the LT decoding process called the ripple size. This parameter was also a key element in the design proposed in the original work by Luby. Specifically, Luby argued that an LT code should provide a constant ripple size during decoding. In this work we show that the ripple size should decrease during decoding, in order to reduce the necessary overhead. Initially we motivate this claim by analytical results related to the redundancy within an LT code. We then propose a new design procedure, which can provide any desired achievable decreasing ripple size. The new design procedure is evaluated and compared to the current state of the art through simulations. This reveals a significant increase in performance with respect to both average overhead and error probability at any fixed overhead.

Physical layer network coding for FSK systems

In this work we extend the existing concept of De- Noise and Forward (DNF) for bidirectional relaying to utilise non-coherent modulation schemes. This is done in order to avoid the requirement of phase tracking in coherent detection. As an example BFSK is considered, and through analysis the decision regions for the denoise operation in DNF are identified. The throughput performance of BFSK in DNF is compared to BPSK.

Scalable DeNoise-and-Forward in bidirectional relay networks

In this paper a scalable relaying scheme is proposed based on an existing concept called DeNoise-and-Forward, DNF. We call it Scalable DNF, S-DNF, and it targets the scenario with multiple communication flows through a single common relay. The idea of the scheme is to combine packets at the relay in order to save transmissions. To ensure decodability at the end-nodes, a priori information about the content of the combined packets must be available. This is gathered during the initial transmissions to the relay. The trade-off between decodability and number of necessary transmissions is analysed and simulations show, that S-DNF is able to provide a better trade-off than traditional schemes at high SNR.

Pilot decontamination through pilot sequence hopping in massive MIMO systems

This work concerns wireless cellular networks applying massive multiple-input multiple-output (MIMO) technology. In such a system, the base station in a given cell is equipped with a very large number (hundreds or even thousands) of antennas and serves multiple users. Estimation of the channel from the base station to each user is performed at the base station using an uplink pilot sequence. Such a channel estimation procedure suffers from pilot contamination. Orthogonal pilot sequences are used in a given cell but, due to the shortage of orthogonal sequences, the same pilot sequences must be reused in neighboring cells, causing pilot contamination. The solution presented in this paper suppresses pilot contamination, without the need for coordination among cells. Pilot sequence hopping is performed at each transmission slot, which provides a randomization of the pilot contamination. Using a modified Kaiman filter, it is shown that such randomized contamination can be significantly suppressed. Comparisons with conventional estimation methods show that the mean squared error can be lowered as much as an order of magnitude at low mobility.

Feedback in LT Codes for Prioritized and Non-Prioritized Data

In this paper feedback in LT codes is investigated. The considered type of feedback is acknowledgments, where information on which symbols have been decoded is given to the transmitter. Our analysis reveals that acknowledgments has a very low potential in LT codes with standard degree distributions. Motivated by this, we analyze the impact of acknowledgments on multi-layer LT codes. In this case, feedback proves advantageous. By using only a single feedback message, it is possible to achieve a significant performance improvement compared to traditional LT codes.

Ripple Design of LT Codes for BIAWGN Channels

This paper presents a novel framework, which enables a design of rateless codes for binary input additive white Gaussian noise (BIAWGN) channels, using the ripple-based approach known from the works for the binary erasure channel (BEC). We reveal that several aspects of the analytical results from the BEC also hold in BIAWGN channels. The presented framework is applied in a code design example, which shows promising results compared to existing work. In particular it shows a great robustness towards variations in the signal-to-noise power ratio (SNR), contrary to existing codes.

A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems

The massive multiple-input multiple-output (MIMO) technology has great potential to manage the rapid growth of wireless data traffic. Massive MIMO achieves tremendous spectral efficiency by spatial multiplexing many tens of user equipments (UEs). These gains are only achieved in practice if many more UEs can connect efficiently to the network than today. As the number of UEs increases, while each UE intermittently accesses the network, the random access functionality becomes essential to share the limited number of pilots among the UEs. In this paper, we revisit the random access problem in the Massive MIMO context and develop a reengineered protocol, termed strongest-user collision resolution (SUCRe). An accessing UE asks for a dedicated pilot by sending an uncoordinated random access pilot, with a risk that other UEs send the same pilot. The favorable propagation of massive MIMO channels is utilized to enable distributed collision detection at each UE, thereby determining the strength of the contenders’ signals and deciding to repeat the pilot if the UE judges that its signal at the receiver is the strongest. The SUCRe protocol resolves the vast majority of all pilot collisions in crowded urban scenarios and continues to admit UEs efficiently in overloaded networks.

Rateless feedback codes

This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Raptor codes, by introducing new degree distributions for the case when a few feedback opportunities are available. We show that incorporating feedback to LT codes can significantly decrease both the coding overhead and the encoding/decoding complexity. Moreover, we show that, at the price of a slight increase in the coding overhead, linear complexity is achieved with Raptor feedback coding.

UEP LT Codes with Intermediate Feedback

We analyze a class of rateless codes, called Luby transform (LT) codes with unequal error protection (UEP). We show that while these codes successfully provide UEP, there is a significant price in terms of redundancy in the lower prioritized segments. We propose a modification with a single intermediate feedback message. Our analysis shows a dramatic improvement on the decoding performance of the lower prioritized segment.

Multiple Description Coding with Feedback Based Network Compression

This paper concerns multi path video streaming using adaptive multiple description coding. The adaptation leverages on the fact that multiple descriptions are correlated. Thus if an intermediate node gets feedback telling that another path is likely to deliver a description, this node can compress its description and forward it. Such a compression can also be done already at the source node; however, the feedback arrives more timely and reliably to intermediate nodes that are closer to the final receiver. In this paper we investigate the performance of such adaptation at the source node and an intermediate node, respectively. A trade-off exists between reducing the delay of the feedback by adapting in the vicinity of the receiver and increasing the gain from compression by adapting close to the source. The analysis shows that adaptation in the network provides a better trade-off than adaptation at the source. Schemes which provide simple solutions to adaptation both at the source and in the network are proposed, analyzed, simulated and compared to non-adaptive reference schemes in scenarios that involve last hop that is wireless. The results reveal that the proposed compression schemes offer significant benefits in streaming scenarios.