Achieving Csiszár's source-channel coding exponent with product distributions

We derive a random-coding upper bound on the average probability of error of joint source-channel coding that recovers Csiszár's error exponent when used with product distributions over the channel inputs. Our proof technique for the error probability analysis employs a code construction for which source messages are assigned to subsets and codewords are generated with a distribution that depends on the subset. © 2012 IEEE.

4-Channel polymeric optical bus module for board-level optical interconnections

A 4-channel polymeric optical bus module suitable for use in board-level interconnections is presented. Low-loss and low-crosstalk module performance is achieved, while -1 dB alignment tolerances better than ± 8 μm are demonstrated. © 2012 OSA.

Orthogonal multipulse modulation for 64 Gigabit Fibre Channel

Real-time orthogonal multipulse modulation is demonstrated at 56 Gb/s with transmission over 500 m of single-mode fiber. Up to 2 dBo power budget advantage is predicted relative to alternatives such as PAM4. © 2013 OSA.

Orthogonal multipulse modulation for 64 gigabit fibre channel

Real-time orthogonal multipulse modulation is demonstrated at 56 Gb/s with transmission over 500 m of single-mode fiber. Up to 2 dBo power budget advantage is predicted relative to alternatives such as PAM4. © 2013 OSA.

The mismatched multiple-access channel: General alphabets

This paper considers channel coding for the memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. Non-asymptotic bounds on the error probability are given, and a cost-constrained random-coding ensemble is used to obtain an achievable error exponent. The achievable rate region recovered by the error exponent coincides with that of Lapidoth in the discrete memoryless case, and remains valid for more general alphabets. © 2013 IEEE.