Achievable rates for reduced-complexity receivers on nonlinear satellite channels with memory

We study achievable information rates for nonlinear channels with memory, in the context of satellite communication with QAM modulation. The complete channel model can be described by a Volterra expansion, but large alphabet size and/or large channel memory length may prohibit optimal soft-output demodulator processing, say with the BCJR algorithm. Thus we focus on reduced-state receivers and their achievable information rates as a function of state complexity, amplifier backoff, and receiver input sampling rate. These achievable rates for mismatched receivers are known to be attainable with powerful error control codes and optimal decoding.