A problem of suppression of intrachannel nonlinearities through the use of constrained coding is considered. Three different techniques are proposed and compared with respect to their efficiency, namely 1) constrained...
详细信息
A problem of suppression of intrachannel nonlinearities through the use of constrained coding is considered. Three different techniques are proposed and compared with respect to their efficiency, namely 1) constrained coding;2) combined constrained and error control coding;and 3) deliberate error insertion. Significant Q-factor improvement up to 16 dB depending on code rate and number of spans is demonstrated. A combined constrained-iterative forward error correction (FEC) scheme can operate in the presence of strong intrachannel nonlinearities when even advanced FEC schemes would be overwhelmed with errors. It provides a coding gain of 12.1 dB at a bit error rate (BER) of 10(-9). Deliberate error insertion is an efficient approach to balance the encoder complexity and the achievable coding gain.
Traditional 1D and 2D barcodes provide high data density, but they are visually jarring and require isolated whitemargins for placement. In this work, we introduce new machine-readable "smarts" for paper doc...
详细信息
ISBN:
(纸本)9781424479948
Traditional 1D and 2D barcodes provide high data density, but they are visually jarring and require isolated whitemargins for placement. In this work, we introduce new machine-readable "smarts" for paper documents, called paper widgets. Like barcodes, paper widgets contain digital data which can be read upon scanning and decoding. However, unlike barcodes, they have very small footprint (fraction of ***.), and carry a human-readable component that provides visual meaning. Furthermore, paper widgets can be placed and recovered in a distributed fashion from any position on a document image. For example, they can be positioned right beside contents of interest, and need not be confined to isolated white margins. We describe how all these widget properties can be simultaneously achieved using simple operations that are robust to print-scan distortions. In particular, we highlight a novel constrained coding technique that helps combat print-scan inter-symbol interference (ISI), and a Gabor-filtering based extraction that accurately identifies widget regions from any position on a scanned document image. Experimental evaluations reveal that paper widgets can be recovered from print-scan distortions with near-100% accuracy.
Two different methods for the soft-decision decoding of the maximum-transition-run (MTR) codes have been considered in this paper. The first one, the maximum a posteriori (MAP) algorithm, is based on the Bayesian algo...
详细信息
ISBN:
(纸本)9781424464043
Two different methods for the soft-decision decoding of the maximum-transition-run (MTR) codes have been considered in this paper. The first one, the maximum a posteriori (MAP) algorithm, is based on the Bayesian algorithm, computing a posteriori log-likelihood ratios (LLR) using MTR codewords. The second one, the soft-decision implementation in Boolean logic circuits has been used to propagate the soft-values through the MTR decoder. The MTR code performs as an inner encoding code, in a simple concatenation of the low-density parity-check (LDPC) and the MTR. The special case of two-track two-head E(2)PR4 channel model was used, assuming the low level of inter-track interference (ITI) and the AWGN noise presence. The soft-decision decoding results with nearly 1.7dB coding gain, using the MAP algorithm, while nearly 1.9dB, using the second one approach.
constrained coding as a method to increase the data rate in dispersion-managed soliton (DMS) communication systems is proposed. This approach is well known and widely used in the context of magnetic and optical record...
详细信息
constrained coding as a method to increase the data rate in dispersion-managed soliton (DMS) communication systems is proposed. This approach is well known and widely used in the context of magnetic and optical recording systems. This paper shows that it is also applicable to DMS systems due to certain similarities between the underlying physical channels. Since timing jitter is an important error-generating mechanism for solitons, a coding scheme specifically designed to combat pulse shifts is also presented, and its properties in the framework of a particular information-theoretic channel model are analyzed. A connection between the model used and the real physical channel is then established. Next, the coded system is compared with the original one from the channel capacity point of view with the help of numerical examples. Finally, the fact that the application of constrained coding may alleviate soliton pulse-to-pulse interaction is exploited. This, in turn, opens the door to the usage of higher-than-usual map strengths and ultimately leads to a significant increase of up to 50% in the bit rate.
Application of a simple approach for the soft-decision decoding of Maximum-Transition-Run (MTR) codes has been presented in this paper. A low-demanded hardware realization have been proposed for soft-decision decoding...
详细信息
Application of a simple approach for the soft-decision decoding of Maximum-Transition-Run (MTR) codes has been presented in this paper. A low-demanded hardware realization have been proposed for soft-decision decoding in MTR basic AND, OR and XOR logic circuits. The suggested approach is explored over the two-track, two-head E(2)PR4 partial response magnetic recording system. The overall two-track channel detection complexity reduction of 41.9% is offered in simulation scheme, encoded by Low-Density Parity-Check (LDPC) code, serially concatenated with inner MTR. The 1.9 dB coding gain has been obtained, comparing to uncoded channel and assuming the AWGN noise presence.
A MAP algorithm for decoding maximum transition run (MTR) codes, using the soft-decision approach, is presented in this paper. The algorithm is based on the Bayesian algorithm, and computes a posteriori log-likelihood...
详细信息
ISBN:
(纸本)9781424443819
A MAP algorithm for decoding maximum transition run (MTR) codes, using the soft-decision approach, is presented in this paper. The algorithm is based on the Bayesian algorithm, and computes a posteriori log-likelihood ratio (LLR) for output bits, using codewords of the MTR code. The log MAP and max-log MAP version of the algorithm have been developed, showing performance comparable to that of the original version. MAP algorithm offers 2dB coding gain, in combination with LDPC, comparing to the uncoded system, while utilization of the MTR, the 25% decreasing in overall required operations of detector over E(2)PR4 magnetic recording system.
We establish that the feedback capacity of the trapdoor channel is the logarithm of the golden ratio and provide a simple communication scheme that achieves capacity. As part of the analysis, we formulate a class of d...
详细信息
We establish that the feedback capacity of the trapdoor channel is the logarithm of the golden ratio and provide a simple communication scheme that achieves capacity. As part of the analysis, we formulate a class of dynamic programs that characterize capacities of unifilar finite-state channels. The trapdoor channel is an instance that admits a simple closed-form solution.
We introduce the fixed-rate bit stuff (FRB) for efficiently encoding and decoding maximum-runlength-limited (MRL) sequences. Our approach is based on a simple, variable-rate technique called bit stuffing. Bit stuffing...
详细信息
We introduce the fixed-rate bit stuff (FRB) for efficiently encoding and decoding maximum-runlength-limited (MRL) sequences. Our approach is based on a simple, variable-rate technique called bit stuffing. Bit stuffing produces near-capacity achieving codes for a wide range of constraints, encoding is variable-rate, which is unacceptable in most applications. In this work, we design near-capacity fixed-rate codes using a three-step procedure. The fixed-length input data block first undergoes iterative preprocessing, followed by variable-rate bit stuffing, and finally dummy-bit padding to a fixed output length. The iterative preprocessing is key to achieving high encoding rates. We discuss rate computation for the proposed FRB algorithm and show that the asymptotic (in input block length) encoding rate is close to the average rate of the variable-rate bit stuff code. Then, we proceed to explore the effect of decreasing/increasing the number of preprocessing iterations. Finally, we derive a lower bound on the encoding rate with finite-length input blocks and tabulate the parameters required to design FRB codes with rate close to 100/101 and 200/201.
The effect of data constraints on synchronization is quantified by the use of three simple timing metrics that respectively measure the ensemble average, the worst, and the best timing qualities attainable with a give...
详细信息
The effect of data constraints on synchronization is quantified by the use of three simple timing metrics that respectively measure the ensemble average, the worst, and the best timing qualities attainable with a given binary pulse amplitude modulation (PAM) waveform. These timing metrics are computed with the help of a graph which represents the constrained PAM system. The timing metrics of the (0, k) constraint are studied in detail for selected PAM pulses.
A parity code and a distance enhancing constrained code are often concatenated with a Reed-Solomon code to form a coding system for magnetic recording. The tensor-product parity coding scheme helps to improve efficien...
详细信息
A parity code and a distance enhancing constrained code are often concatenated with a Reed-Solomon code to form a coding system for magnetic recording. The tensor-product parity coding scheme helps to improve efficiency of the parity code while retaining the same level of performance. In this paper, we present two methods for combining a tensor-product parity code with a distance-enhancing constrained code. The first method incorporates a constrained code with unconstrained positions. The second method uses a new technique, which we call word-set partitioning, to achieve a higher code rate relative to the first method. We simulate the performance of several coding systems based upon the two combination methods on a perpendicular recording channel, and we compare their symbol error rates and sector error rates with those of a system that uses only a Reed-Solomon code.
暂无评论