A symbol permutation invariant balanced (SPI-balanced) code over the alphabet Zm = {0, 1, . . . , m − 1} is a block code over Zm such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason every permutation among the symbols of the alphabet changes a SPI-balanced code into a SPI-balanced code. This means that SPI-balanced words are “the most balanc...

A simple serially concatenated turbo code using differential 8PSK encoding as the inner code and a [3,2,2] parity code as the outer code is studied. This system is decoded coherently according to turbo principles with iterative exchange of extrinsic probabilities. Decoding over channels without prior synchronization is demonstrated to be feasible even with significant phase offset, using a simp...

In our previous work we introduced a method for avoiding/excluding some symbols in Reed-Solomon (RS) codes, called symbol avoidance. In this paper, we apply the symbol avoidance method to make synchronization of RS encoded data more effective. We avoid symbols in a RS code and then perform conventional frame synchronization on RS encoded data by appending sync-words on the data. The symbols in ...

Applying a joint code and decoder design methodology, we develop a high-speed (3, k)-regular LDPC code partly parallel decoder architecture, based on which a 9216-bit, rate1/2 (3, 6)-regular LDPC code decoder is implemented on Xilinx FPGA device. When performing maximum 18 iterations for each code block decoding, this partly parallel decoder supports a maximum symbol throughput of 54 Mbps and a...

Most debuggers are notoriously machine-dependent, but some recent research prototypes achieve varying degrees of machine-independence with novel designs. Cdb, a simple source-level debugger for C, is completely independent of its target architecture. This independence is achieved by embedding symbol tables and debugging code in the target program, which costs both time and space. This paper des...

Turbo equalizers have been shown to be successful in mitigating the effects of inter-symbol interference introduced by partial response modems and by dispersive channels for code rates of 1 2. In this contribution, we comparatively studied the performance of a range of binary phase-shift keying turbo equalizers employing block-turbo codes, namely Bose–Chaudhuri–Hocquenghen turbo codes, convolut...

Variable-length codes can provide compression for data communication. Such codes may be used not only when the source statistics is known but also when we do not know the source probability distribution, and a source with equal symbol probabilities (equiprobable symbols) can or has to be assumed. This paper presents variable-length codes with code words that di er in length by at most one code ...

The quantities in (1) and additional definitions for discrete-time estimation/decoding are T : Symbol duration. p(t) : Truncated raised cosine pulse with support [0, NpT ) sec. τk : Relative propagation delay from sensor k to collector. δωk : Frequency offset of sensor k L.O. from collector L.O. in Hz. sk(m) ∈ CZ : Space-time code symbol. n(t) : Complex Gaussian noise with spectral density 2N0....