Using GIS to Quantify Patterns of Glacial Erosion on Northwest Iceland: Implications for Independent Ice Sheets

Glacial erosion patterns on northwest Iccliind are quantified using a Geographic Information System (GIS) in order to interpret subglacial characteristics of part of northwest Iceland affected by ice sheet glaciation. Ice scour lake density is used as a proxy for glacial erosion. Erosion classes are interpreted from variations in the density of lake basins. Lake density was calculated using two dilTerent methods: the first is sensitive to the total number of lakes in a specific area, and the second is sensitive to total lake area in a specific area. Both of these methods result in a value for lake density, and the results for lake density calculated using the two methods are similar. Areas with the highest density of lakes are interpreted as areas with the most intense erosion with the exception of alpine regions. The highest density of lakes in the study area exceeds 8% and is located on upland plateaus where mean elevations range from 400 to 800 m a.s.l. Low lake density (0-2%) is observed in steep alpine areas where steep topography does not favor lake development. The G!S analysis is combined with geomorphic mapping to provide ground truth for the GIS interpretations and to locate paleo-ice flow indicators and landforms. The patterns identified in this study illustrate distinct regions of glacial erosion and flow paths that are best explained by two independent ice sheets covering northwest Iceland during the Last Glacial Maximum (LGM). Areas of alpine glacial landforms and the presence of nunataks within the glaciated region support interpretations that Ice-free regions or cold-based ice cover existed on parts of northwest Iceland during the LGM. The methods developed in this study are easily transferable to other formerly glaciated regions and provide tools to evaluate subglacial properties of former ice sheets. The data generated yield important subglacial boundary conditions for ice sheet models of Iceland

Capacity Theorems for the AWGN Multi-Way Relay Channel

The L-user additive white Gaussian noise multi-way relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing coding strategies, i.e., complete-decode-forward and compress-forward are shown to be bounded away from the cut-set upper bound at high signal-to-noise ratios (SNR). It is known that the gap between the compress-forward rate and the capacity upper bound is a constant at high SNR, and that between the complete-decode-forward rate and the upper bound increases with SNR at high SNR. In this paper, a functional-decode-forward coding strategy is proposed. It is shown that for L >= 3, complete-decode-forward achieves the capacity when SNR <= 0 dB, and functional-decode-forward achieves the capacity when SNR >= 0 dB. For L=$, functional-decode-forward achieves the capacity asymptotically as SNR increases.Comment: accepted and to be presented at ISIT 201

Functional-Decode-Forward for the General Discrete Memoryless Two-Way Relay Channel

We consider the general discrete memoryless two-way relay channel, where two users exchange messages via a relay, and propose two functional-decode-forward coding strategies for this channel. Functional-decode-forward involves the relay decoding a function of the users' messages rather than the individual messages themselves. This function is then broadcast back to the users, which can be used in conjunction with the user's own message to decode the other user's message. Via a numerical example, we show that functional-decode-forward with linear codes is capable of achieving strictly larger sum rates than those achievable by other strategies

The Binary-Symmetric Parallel-Relay Network

We present capacity results of the binary-symmetric parallel-relay network, where there is one source, one destination, and K relays in parallel. We show that forwarding relays, where the relays merely transmit their received signals, achieve the capacity in two ways: with coded transmission at the source and a finite number of relays, or uncoded transmission at the source and a sufficiently large number of relays. On the other hand, decoding relays, where the relays decode the source message, re-encode, and forward it to the destination, achieve the capacity when the number of relays is small.Comment: accepted and to be presented at ISIT 201

Optimal Coding Functions for Pairwise Message Sharing on Finite-Field Multi-Way Relay Channels

This paper considers the finite-field multi-way relay channel with pairwise message sharing, where multiple users exchange messages through a single relay and where the users may share parts of their source messages (meaning that some message parts are known/common to more than one user). In this paper, we design an optimal functional-decode-forward coding scheme that takes the shared messages into account. More specifically, we design an optimal function for the relay to decode (from the users on the uplink) and forward (back to the users on the downlink). We then show that this proposed function-decode-forward coding scheme can achieve the capacity region of the finite-field multi-way relay channel with pairwise message sharing. This paper generalizes our previous result for the case of three users to any number of users.Comment: Author's final version (accepted for presentation at the 2014 IEEE International Conference on Communications [ICC 2014]

On Achievable Rate Regions of the Asymmetric AWGN Two-Way Relay Channel

This paper investigates the additive white Gaussian noise two-way relay channel, where two users exchange messages through a relay. Asymmetrical channels are considered where the users can transmit data at different rates and at different power levels. We modify and improve existing coding schemes to obtain three new achievable rate regions. Comparing four downlink-optimal coding schemes, we show that the scheme that gives the best sum-rate performance is (i) complete-decode-forward, when both users transmit at low signal-to-noise ratio (SNR); (ii) functional-decode-forward with nested lattice codes, when both users transmit at high SNR; (iii) functional-decode-forward with rate splitting and time-division multiplexing, when one user transmits at low SNR and another user at medium--high SNR.Comment: to be presented at ISIT 201

Repeat-Accumulate Codes for Reconciliation in Continuous Variable Quantum Key Distribution

This paper investigates the design of low-complexity error correction codes for the verification step in continuous variable quantum key distribution (CVQKD) systems. We design new coding schemes based on quasi-cyclic repeat-accumulate codes which demonstrate good performances for CVQKD reconciliation

The clinical application of progressive filtering in normal and disordered populations

The present study examined the effect of progressive filter testing in children with normal auditory processing skills and children with (central) auditory processing disorders [(C)APD]. The primary purpose of this study was to determine if a new screening procedure designed by the investigator called Progressive Filtering would differentiate between a control group (i.e. children with normal auditory processing skills) and an experimental group [children with (C)APD]. Twenty subjects (age 6 to 14 years) participated in the study. All subjects received an audiological examination, an auditory processing test battery, and the Progressive Filtering screening tool. Results indicated that the investigator-designed Progressive Filtering screening tool did differentiate between the control and experimental groups for certain frequencies