A method is presented for designing lossless sliding block compression schemes that map constrained sequences onto unconstrained ones The new compression scheme is incorporated into a coding technique for noisy constrained channels which has appli cations to magnetic and optical storage As suggested recently by Immink the use of a lossless compression code can improve the performance of a modi ...

Since the standardization of the JPEG 2000, it has found its way into many different applications such as DICOM (digital imaging and communication in medicine), satellite photography, military surveillance, digital cinema initiative, professional video cameras, and so on. The unified framework of the JPEG 2000 architecture makes practical high quality real-time compression possible even in vide...

11, we present two methods for the constuction codes and in section 111, we describe the soft decoding algorithm and give some results of RS soft decoding. In section IV, we give the soft decision algorithm derived from the theoretical Log-Likelihood-Ratio and in section V we describe the iterative algorithm for decoding RS product codes. Section VI and VI1 are dedicated to simulation results o...

We study modular, automatic code generation from hierarchical block diagrams with synchronous semantics. Such diagrams are the fundamental model behind widespread tools such as Simulink and SCADE. Modularity means code is generated for a given composite block independently from context, that is, without knowing in which diagrams this block is going to be used. This can be achieved by abstractin...

ALinear binary [n, k]-code is a k-dimensional subspaces of the n-dimensional vector space GF (2) over the finite field GF (2) with 2 elements. The 2 codewords of length n are the elements of the subspace, they are written as row vectors. The weight wt(c) of a codeword is defined to be the number of nonzero entries of c and the minimum distance dist(C) of a code C is the minimum of all weights o...

—In this paper, we propose two new systematic ways to construct amicable orthogonal designs (AOD), with an aim to facilitate the construction of power-balanced orthogonal space-time block codes (O-STBC) with favorable practical attributes. We also show that an AOD can be constructed from an Amicable Family (AF), and such a construction is crucial for achieving a power-balanced O-STBC. In additi...

The previous chapter defined some properties of linear block codes and discussed two examples of linear block codes (rectangular parity and the Hamming code), but the approaches presented for decoding them were specific to those codes. Here, we will describe a general strategy for encoding and decoding linear block codes. The decoding procedure we describe is syndrome decoding, which uses the s...

The previous chapter defined some properties of linear block codes and discussed two examples of linear block codes (rectangular parity and the Hamming code), but the approaches presented for decoding them were specific to those codes. Here, we will describe a general strategy for encoding and decoding linear block codes. The decoding procedure we describe is syndrome decoding, which uses the s...

SEEP executes the code under test symbolically to extract all code paths and their path constraints. On basis of these results, SEEP crafts program code with predefined input data, so-called path entities. For each path entity, SEEP generates a runtime execution trace by executing them on a test system and increments a block counter for every basic block (branchless sequence of code) each time ...