Optimal Population Coding, Revisited

Cortical circuits perform the computations underlying rapid perceptual decisions within a few dozen milliseconds with each neuron emitting only a few spikes. Under these conditions, the theoretical analysis of neural population codes is challenging, as the most commonly used theoretical tool – Fisher information – can lead to erroneous conclusions about the optimality of different coding schemes. Here we revisit the effect of tuning function width and correlation structure on neural population codes based on ideal observer analysis in both a discrimination and reconstruction task. We show that the optimal tuning function width and the optimal correlation structure in both paradigms strongly depend on the available decoding time in a very similar way. In contrast, population codes optimized for Fisher information do not depend on decoding time and are severely suboptimal when only few spikes are available. In addition, we use the neurometric functions of the ideal observer in the classification task to investigate the differential coding properties of these Fisher-optimal codes for fine and coarse discrimination. We find that the discrimination error for these codes does not decrease to zero with increasing population size, even in simple coarse discrimination tasks. Our results suggest that quite different population codes may be optimal for rapid decoding in cortical computations than those inferred from the optimization of Fisher information

Generalized Approximate Message-Passing Decoder for Universal Sparse Superposition Codes

Sparse superposition (SS) codes were originally proposed as a capacity-achieving communication scheme over the additive white Gaussian noise channel (AWGNC) [1]. Very recently, it was discovered that these codes are universal, in the sense that they achieve capacity over any memoryless channel under generalized approximate message-passing (GAMP) decoding [2], although this decoder has never been stated for SS codes. In this contribution we introduce the GAMP decoder for SS codes, we confirm empirically the universality of this communication scheme through its study on various channels and we provide the main analysis tools: state evolution and potential. We also compare the performance of GAMP with the Bayes-optimal MMSE decoder. We empirically illustrate that despite the presence of a phase transition preventing GAMP to reach the optimal performance, spatial coupling allows to boost the performance that eventually tends to capacity in a proper limit. We also prove that, in contrast with the AWGNC case, SS codes for binary input channels have a vanishing error floor in the limit of large codewords. Moreover, the performance of Hadamard-based encoders is assessed for practical implementations

Interference-Mitigating Waveform Design for Next-Generation Wireless Systems

A brief historical perspective of the evolution of waveform designs employed in consecutive generations of wireless communications systems is provided, highlighting the range of often conflicting demands on the various waveform characteristics. As the culmination of recent advances in the field the underlying benefits of various Multiple Input Multiple Output (MIMO) schemes are highlighted and exemplified. As an integral part of the appropriate waveform design, cognizance is given to the particular choice of the duplexing scheme used for supporting full-duplex communications and it is demonstrated that Time Division Duplexing (TDD) is substantially outperformed by Frequency Division Duplexing (FDD), unless the TDD scheme is combined with further sophisticated scheduling, MIMOs and/or adaptive modulation/coding. It is also argued that the specific choice of the Direct-Sequence (DS) spreading codes invoked in DS-CDMA predetermines the properties of the system. It is demonstrated that a specifically designed family of spreading codes exhibits a so-called interference-free window (IFW) and hence the resultant system is capable of outperforming its standardised counterpart employing classic Orthogonal Variable Spreading Factor (OVSF) codes under realistic dispersive channel conditions, provided that the interfering multi-user and multipath components arrive within this IFW. This condition may be ensured with the aid of quasisynchronous adaptive timing advance control. However, a limitation of the system is that the number of spreading codes exhibiting a certain IFW is limited, although this problem may be mitigated with the aid of novel code design principles, employing a combination of several spreading sequences in the time-frequency and spatial-domain. The paper is concluded by quantifying the achievable user load of a UTRA-like TDD Code Division Multiple Access (CDMA) system employing Loosely Synchronized (LS) spreading codes exhibiting an IFW in comparison to that of its counterpart using OVSF codes. Both system's performance is enhanced using beamforming MIMOs

Loosely Synchronised Spreading Code Aided Network Performance of Quasi-Synchronous UTRA-like TDD and FDD CDMA Systems

It is demonstrated that loosely synchronised (LS) spreading codes exhibit a so-called interference-free window, where both the autocorrelation and cross-correlation of the codes become zero. Therefore LS codes have the promise of mitigating the effects of both inter-symbolinterference and multiple-access-interference in time dispersive channels. Hence, LS codes have the potential of increasing the capacity of CDMA networks. The work reported has studied the achievable network performance and compared it to that of a UTRA-like time division duplex (TDD) and frequency division duplex (FDD) CDMA system using orthogonal variable rate spreading factor codes