arXiv subjects
Publications and source records attributed to Ian Phillips.
We experimentally evaluated the sensing-communication trade-off from the fixed-point precision MIMO equalizer using FPGA. At 7-bit, noise floor drops 100x and angular error 63%, but the communication performance saturates while the hardware complexity rises.
Learning is a process which can update decision rules, based on past experience, such that future performance improves. Traditionally, machine learning is often evaluated under the assumption that the future will be identical to the past in distribution or change adversarially. But these assumptions can be either too optimistic or pessimistic for many problems in the real world. Real world scenarios evolve over multiple spatiotemporal scales with partially predictable dynamics. Here we reformulate the learning problem to one that centers around this idea of dynamic futures that are partially learnable. We conjecture that certain sequences of tasks are not retrospectively learnable (in which the data distribution is fixed), but are prospectively learnable (in which distributions may be dynamic), suggesting that prospective learning is more difficult in kind than retrospective learning. We argue that prospective learning more accurately characterizes many real world problems that (1) currently stymie existing artificial intelligence solutions and/or (2) lack adequate explanations for how natural intelligences solve them. Thus, studying prospective learning will lead to deeper insights and solutions to currently vexing challenges in both natural and artificial intelligences.
Huffman-coded sphere shaping (HCSS) is an algorithm for finite-length probabilistic constellation shaping, which provides nearly optimal energy efficiency at low implementation complexity. In this paper, we experimentally study the nonlinear performance of HCSS employing dual-polarization 64-ary quadrature amplitude modulation (DP-64QAM) in an extended reach single-span link comprising 200 km of standard single mode fiber (SSMF). We investigate the effects of shaping sequence length, dimensionality of symbol mapping, and shaping rate. We determine that the na\"ive approach of Maxwell-Boltzmann distribution matching - which is optimal in the additive white Gaussian noise channel - provides a maximum achievable information rate gain of 0.18 bits/4D-symbol in the infinite length regime. Conversely, HCSS can achieve a gain of 0.37 bits/4Dsymbol using amplitude sequence lengths of 32, which may be implemented without multiplications, using integer comparison and addition operations only. Coded system performance, with a net data rate of approximately 425 Gb/s for both shaped and uniform inputs, is also analyzed.