Mixed Symmetry Solutions of Generalized Three-Particle Bargmann-Wigner Equations in the Strong-Coupling Limit

Starting from a nonlinear isospinor-spinor field equation, generalized three-particle Bargmann-Wigner equations are derived. In the strong-coupling limit, a special class of spin 1/2 bound-states are calculated. These solutions which are antisymmetric with respect to all indices, have mixed symmetries in isospin-superspin space and in spin orbit space. As a consequence of this mixed symmetry, we get three solution manifolds. In appendix \ref{b}, table 2, these solution manifolds are interpreted as the three generations of leptons and quarks. This interpretation will be justified in a forthcoming paper.Comment: 17 page

Wideband Time-Domain Digital Backpropagation via Subband Processing and Deep Learning

We propose a low-complexity sub-banded DSP architecture for digital backpropagation where the walk-off effect is compensated using simple delay elements. For a simulated 96-Gbaud signal and 2500 km optical link, our method achieves a 2.8 dB SNR improvement over linear equalization.Comment: 3 pages, 3 figur

Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity

The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with {\em bounded complexity}, per information bit, of encoding and decoding. It also introduces symmetry properties which play a central role in the construction of capacity-achieving ensembles for the BEC with bounded complexity. The results here improve on the tradeoff between performance and complexity provided by previous constructions of capacity-achieving ensembles of codes defined on graphs. The superiority of ARA codes with moderate to large block length is exemplified by computer simulations which compare their performance with those of previously reported capacity-achieving ensembles of LDPC and IRA codes. The ARA codes also have the advantage of being systematic.Comment: Submitted to IEEE Trans. on Information Theory, December 1st, 2005. Includes 50 pages and 13 figure