J.P. M. Schalkwijk, "An algorithm for source coding," IEEE Trans. Inform. Theory, vol. IT-18, pp. 395-399, May 1972.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....lengths. Run length coding is shown to be closer to optimal for lowsource en tropics, and the new scheme is shown to be practically equivalent to run length coding in this range. I. INTRODUCTION A SOURCE CODING scheme was proposed by Lynch [1] and Davisson [2] in 1966. In 1972, Schalkwijk [3] presented an algorithm for coding binary sources. Davisson [4] pointed out that the Schalkwijk scheme was similar to the Lynch Davisson (LD) scheme. The basic algorithm used was the same in each case. However, Lynch and Davisson implemented the algorithm as a block to variable scheme which does ....

....any message block of length n contains w ones is pw(1 p)n w. 3) If p were known, a per letter codeword length at least equal to the entropy H(p) p log2 p (1 p) log2 (1 p) would be required to block encode the source. Although p is unknown, the composite source output probabilities See [3] for another example of the use of dummy bits. are known. In fact, the probability of any given message containing w ones in n outputs is simply y0 pW(1 p)n w dp n 1 ) 4) Davisson [2] has shown that the probabilities of (4) provide codes as good asymptotically as the probabilities of (3) ....

J.P. M. Schalkwijk, "An algorithm for source coding," IEEE Trans. Inform. Theory, vol. IT-18, pp. 395-399, May 1972.

....for computing and decoding the rank of a vector (or label, or index) in the class of equivalence generated by a given signed leader. A first approach, reminded here, is proposed in [13] for E 8 lattices also called Gosset Lattices. This approach relies on the formula of Schalkwijk introduced in [32], and can be summarized as follows. Submitted to IEEE Trans. on Information Theory April 8, 1998 13 A. Algorithm of Lamblin A.1 Computing the Rank Let l be a signed leader with q different components (a 0 ; a q Gamma1 ) where a 0 Delta Delta Delta a q Gamma1 . Let x be a ....

J. Pieter M. Schalkwijk, "An algorithm for source coding," IEEE trans. on Information theory, vol. 3, no. 18, pp. 395--399, May 1972.

.... obliterated in producing the encoded state, because quantum states cannot be cloned, see, Wootters and Zurek [12] and Dieks [13] Cleve and DiVincenzo [14] have proposed a block coding algorithm, which is, in fact, a generalization of the classical enumerative coding of Cover [15] and Schalkwijk [16]. Recently, Braunstein et al. 17] have studied quantum extensions of Huffman coding. The statistics underlying a quantum memoryless Bernoulli source is completely captured by its density matrix. The fundamental idea behind quantum data compression is to analyze the eigen structure of the joint ....

J. P. M. Schalkwijk, "An algorithm for source coding," IEEE Trans. Inform. Theory, vol. 18, pp. 395--399, 1972.

....= u (2) 0011) However 0011 62 V; and the decoder selects the rst possibility. 5 Enumerative coding Enumerative procedures were developed in source coding to make the storage of a code book unnecessary at the both sides of communication link and essentially reduce computational e orts [7] [8], 9] In this case, the encoder having received a message calculates corresponding codeword, and the decoder calculates the inverse function. Our decoder does not use the code book to decode transmitted codewords, and an enumerative algorithm for messages completely escapes the storage of code ....

....sets: m 2 f1; jUjg; m J 2 f1; jJ s jg; etc. and s = 0; t: The structure of the possible mappings f (s) 2 (m a ) and f (s) 3 (m b ) is evident; the mappings f(m) and 10 f (s) 1 (m J ) are based on the enumeration procedures for binary vectors having a xed Hamming weight [7] [8], 9] Let (m; m 0 ) be the message to be transmitted over the binary adder channel, where m 2 f1; jUjg and m 0 2 f1; jVjg: Encoding and decoding of the message m are obvious : we assign f(m) u; f 1 (u) m: Let us consider encoding and decoding of the message m 0 : Denote K ....

J.P.M.Schalkwijk, "An algorithm for source coding," IEEE Trans. Inform. Theory, vol.18, pp.395-399, May 1972.

.... How many sequences x T are there with components in f Delta Delta Delta ; Gamma3; Gamma1; 1; 3; Delta Delta Deltag and energy E(x T ) E max Are there efficient ways to enumerate these sequences The answer to this questions is affirmative and follows from the work of Schalkwijk [6] and Cover [2] To make things simple we restrict ourselves first to the one sided alphabet f1; 3; Delta Delta Deltag and consider Gamma Gamma Gamma Gamma . Gamma Gamma Gamma Gamma Gamma Gamma Gamma Gamma Gamma Gamma Gamma Gamma Theta Theta Theta ....

....4 with components in f1; 3; Delta Delta Deltag with energy not larger than 28, the question arises how we can enumerate these sequences. In other words, does there exist an ordering that gives the sequences an index which can easily be computed from the sequence and vice versa It follows from [6] and [2] that, if we assume a lexicographical ordering over the sequences, the index can be determined efficiently from the sequence. It turns out that i(u T ) X t=1;T X w u t w2f1;3; Delta Delta Deltag A(t; X s=1;t Gamma1 u 2 s w 2 ) For example, i(3131) A(1; 1 2 ) A(3; ....

[Article contains additional citation context not shown here]

J.P.M. Schalkwijk, "An Algorithm for Source Coding," IEEE Trans. Inform. Theory, vol. IT-18, pp. 395-399, May 1972.

....useful for the insight they give into the structure of the codes that they describe. The trellises may also be useful for such tasks such as error detection (testing a sequence for membership in a code) decoding, sequence detection, and encoding. Schalkwijk s indexing scheme for permutation codes [18] and other indexing schemes known in the literature on combinatorial algorithms [19, Ch. 13] can be viewed as being trellis based. Such schemes are used to compute bijections between integers and trellis paths and hence codewords. The shell mapping algorithm [20, 21, 22, 23] incorporated in the ....

J. P. M. Schalkwijk, "An algorithm for source coding," IEEE Trans. on Inform. Theory, vol. IT-18, pp. 395--399, May 1972.

....Using arithmetic codes it is possible to process source sequences with a large length T . This is often needed to reduce the redundancy per source symbol. Arithmetic codes are based on the Elias algorithm (unpublished, but described by Abramson[1] and Jelinek[4] or on enumeration (e.g. Schalkwijk[15] and Cover[2] Arithmetic coding became feasable only after Rissanen[7] and Pasco[6] had solved the accuracy issues that were involved. We will not discuss such issues here. Instead we will assume that all computations are carried out with infinite precision. 1 The basis of the log( Delta) is ....

J.P.M. Schalkwijk, "An Algorithm for Source Coding," IEEE Trans. Inform. Theory, vol. IT-18, pp. 395-399, May 1972.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC