- Briggs_Hadley_IMA_11thICMSP_final
Accepted author manuscript, 835 KB, PDF document

Available under license: CC BY: Creative Commons Attribution 4.0 International License

Research output: Contribution to conference - Without ISBN/ISSN › Conference paper

Published

2016. Paper presented at 11th IMA International Conference on Mathematics in Signal Processing, Birmingham, United Kingdom.

Research output: Contribution to conference - Without ISBN/ISSN › Conference paper

Hadley, L & Briggs, K 2016, 'The Generation of Badly Approximable Pairs for Communications via Real Interference Alignment', Paper presented at 11th IMA International Conference on Mathematics in Signal Processing, Birmingham, United Kingdom, 12/12/16 - 14/08/18.

Hadley, L., & Briggs, K. (2016). *The Generation of Badly Approximable Pairs for Communications via Real Interference Alignment*. Paper presented at 11th IMA International Conference on Mathematics in Signal Processing, Birmingham, United Kingdom.

Hadley L, Briggs K. The Generation of Badly Approximable Pairs for Communications via Real Interference Alignment. 2016. Paper presented at 11th IMA International Conference on Mathematics in Signal Processing, Birmingham, United Kingdom.

@conference{27f5e720d7d8417899ab4bbf7034c221,

title = "The Generation of Badly Approximable Pairs for Communications via Real Interference Alignment",

abstract = "Certain proposed coding schemes require sets of irrational numbers (a1,a2,...,an) which generate linear forms. It is conjectured that the more badly approximable these linear forms, meaning the greater the positive lower bound of qn|q+p1a1+...+pnan| for any choice of integers (q,p1, ..., pn), the better the coding scheme, thus the lower the error rate. In contrast to classical one-dimensional Diophantine approximation theory (n=1), the situation for n>1 is full of unsolved problems, and it is not even known what the worst approximable pair is. The aim of this paper will be to present some purely numerical results which suggest some good candidates for bad pairs, and to demonstrate the performance of these pairs in a transmission protocol. For this we use an algorithm due to Vaughan Clarkson, but the software implementation requires some very delicate treatment of floating-point arithmetic. This results in the first fully-rigorous implementation of an algorithm for finding the sequence of best approximants for a linear form q+p1a1+p2a2, and for the simultaneous rational approximation of two irrationals, and we demonstrate the effect of using such linear forms on the error rate of our coding scheme.",

author = "Lucinda Hadley and Keith Briggs",

year = "2016",

month = dec,

day = "12",

language = "English",

note = "11th IMA International Conference on Mathematics in Signal Processing ; Conference date: 12-12-2016 Through 14-08-2018",

url = "https://ima.org.uk/1363/11th-ima-international-conference-mathematics-signal-processing/",

}

TY - CONF

T1 - The Generation of Badly Approximable Pairs for Communications via Real Interference Alignment

AU - Hadley, Lucinda

AU - Briggs, Keith

PY - 2016/12/12

Y1 - 2016/12/12

N2 - Certain proposed coding schemes require sets of irrational numbers (a1,a2,...,an) which generate linear forms. It is conjectured that the more badly approximable these linear forms, meaning the greater the positive lower bound of qn|q+p1a1+...+pnan| for any choice of integers (q,p1, ..., pn), the better the coding scheme, thus the lower the error rate. In contrast to classical one-dimensional Diophantine approximation theory (n=1), the situation for n>1 is full of unsolved problems, and it is not even known what the worst approximable pair is. The aim of this paper will be to present some purely numerical results which suggest some good candidates for bad pairs, and to demonstrate the performance of these pairs in a transmission protocol. For this we use an algorithm due to Vaughan Clarkson, but the software implementation requires some very delicate treatment of floating-point arithmetic. This results in the first fully-rigorous implementation of an algorithm for finding the sequence of best approximants for a linear form q+p1a1+p2a2, and for the simultaneous rational approximation of two irrationals, and we demonstrate the effect of using such linear forms on the error rate of our coding scheme.

AB - Certain proposed coding schemes require sets of irrational numbers (a1,a2,...,an) which generate linear forms. It is conjectured that the more badly approximable these linear forms, meaning the greater the positive lower bound of qn|q+p1a1+...+pnan| for any choice of integers (q,p1, ..., pn), the better the coding scheme, thus the lower the error rate. In contrast to classical one-dimensional Diophantine approximation theory (n=1), the situation for n>1 is full of unsolved problems, and it is not even known what the worst approximable pair is. The aim of this paper will be to present some purely numerical results which suggest some good candidates for bad pairs, and to demonstrate the performance of these pairs in a transmission protocol. For this we use an algorithm due to Vaughan Clarkson, but the software implementation requires some very delicate treatment of floating-point arithmetic. This results in the first fully-rigorous implementation of an algorithm for finding the sequence of best approximants for a linear form q+p1a1+p2a2, and for the simultaneous rational approximation of two irrationals, and we demonstrate the effect of using such linear forms on the error rate of our coding scheme.

M3 - Conference paper

T2 - 11th IMA International Conference on Mathematics in Signal Processing

Y2 - 12 December 2016 through 14 August 2018

ER -