Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
|
|
- Britton Gilbert
- 6 years ago
- Views:
Transcription
1 Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channes arxiv:cs/060700v1 [cs.it] 6 Ju 006 Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department University of Michigan, Ann Arbor, MI, emai: {chhsu, anastas}@umich.edu Abstract The asymptotic iterative decoding performances of ow-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding agorithms on memoryess binary-input output-symmetric (MBIOS) channes are anayzed in this paper. For MS decoding, the anaysis is done by upper bounding the bit error probabiity of the root bit of a tree code by the sequence error probabiity of a subcode of the tree code assuming the transmission of the azero codeword. The resut is a recursive upper bound on the bit error probabiity after each iteration. For SP decoding, we derive a tighter recursivey determined upper bound on the bit error probabiity by tracking the evoution of the Bhattacharryya parameters associated with the decoding messages after each iteration. This recursive upper bound recovers the density evoution equation of LDPC codes on the binary erasure channe (BEC) with inequaities satisfied with equaities. A significant impication of this resut is that the performance of LDPC codes under SP decoding on the BEC is a ower bound of the performance on a MBIOS channes with the same Bhattacharryya parameter. A resuts hod for the more genera muti-edge type LDPC codes. 1 Introduction Low-density parity-check (LDPC) codes, first introduced by Gaager [1], have been shown to be powerfu channe codes under iterative decoding by numerous simuations in the iterature. However, the oopy graphica structure of the LDPC codes generay prohibits their iterative decoding performance from being exacty anayzed. This probem has been partiay soved in [] by considering the asymptotic average performance of an ensembe of LDPC codes when their codeword ength goes to infinity. In particuar, the authors in [] proved that the performance of each code in the ensembe asymptoticay approaches the average performance of the ensembe with oop-free oca structure within finite iterations as the codeword ength goes to infinity. This resut gave birth to the density evoution (DE) method proposed in [], and was used to provide the exact asymptotic performance of LDPC codes after an arbitrary number of iterations on memoryess binary-input output-symmetric (MBIOS) channes. A major drawback of the DE method is that the evoved densities in genera require an infinite dimensiona description. Therefore, DE is not suitabe for the derivation of anaytica performance bounds. To sove this probem, severa approaches have been proposed that track the evoution
2 of the densities projected to some specific finite dimensiona space. These incude the Gaussian approximation [3], the extrinsic information transfer (EXIT) chart [4], and the generaized EXIT (GEXIT) [5] chart methods. Unfortunatey, since the EXIT and GEXIT chart methods sti require numerica cacuations, and the Gaussian approximation does not impy any upper or ower bounds on the exact performance, these resuts sti can not be used for guaranteeing the code performance. In [6], the authors propose to map the evoved densities to Bhattacharryya parameters, which are further used to bound the bit error probabiity of the LDPC codes under sum-product (SP) decoding [7] on MBIOS channes. It turns out that an upper bound on the Bhattacharryya parameters can be obtained by a recursion invoving ony one-dimensiona rea numbers, so the whoe resut can be used to determine a guaranteed decoding capabiity for the LDPC codes. In this paper, we improve this resut of [6] in two different directions. First, we show that the same recursivey determined upper bound on the bit error probabiity of the LDPC codes not ony hods for the SP decoding, but aso hods for the min-sum (MS) decoding [7]. This resut is attained by upper bounding the probabiity of error of the root bit of a tree code by a sequence error probabiity of a subcode of the tree code, and then using the union bound. Therefore, the whoe proof does not invove the Bhattacharryya parameters. Then, we turn our attention to SP decoding and derive a new recursive upper bound on the Bhattacharryya parameter. Compared with the recursion in [6], our recursion gives significanty tighter upper bounds in the sense that the upper bounds become exact and recover the one-dimensiona density evoution equation on the BEC. Expoiting the resembance of our recursion to the DE equation on the BEC, we prove that LDPC codes under SP decoding on an MBIOS channe with Bhattacharryya parameter D aways have an equa or better performance than that on the BEC with erasure probabiity ǫ = D. Since an abundance of studies have resuted in LDPC codes working reiaby on any given BEC, we can aways find codes working reiaby on any given MBIOS channe according to this resut. Note aso that, due the nature of the proofs of the main emmas, this connection between BEC and MBIOS channes is aso true for the genera famiy of muti-edge type LDPC codes [8], incuding the irreguar repeat-accumuate (IRA) codes [9,10] and the ow-density parity-check and generator matrix (LDPC-GM) codes [11]. The remaining of this paper is structured as foows. In Section, we review the preiminary background on the Bhattacharryya parameters, MBIOS channes, and the asymptotic anaysis of LDPC codes. Then, we present our asymptotic performance anaysis of LDPC codes on MBIOS channes under MS and SP decoding in Section 3 and 4, respectivey. Finay, we concude this paper in Section 5. Preiminaries Let the random variabe Y from the aphabet Y be an observation of the binary variabe X from the aphabet X {0, 1}. Suppose Y is a discrete random variabe, and its statistics are competey characterized by the conditiona probabiity mass function p(y x). In the two-hypothesis testing probem of decoding X given a reaization y of Y, the Bhattacharyya parameter B is defined as B y Y p(y 0)p(y 1), and it is shown in [1, Theorem 7.5] that B is an upper bound on the maximum-ikeihood (ML) decoding error probabiity. Notice that a our resuts hod aso when Y is a continuous random variabe. In which case, we simpy treat p(y x) as a conditiona probabiity density function and the summation sign as an integration sign. However, for convenience, we wi assume Y to be a discrete random variabe whenever we refer to this kind of scenarios throughout
3 this paper. A property of B foowing from the Cauchy-Schwarz inequaity is that 0 B = ( )( ) p(y 0)p(y 1) p(y 0) p(y 1) = 1 (1) y Y y Y y Y If x and y are the input and output symbos, respectivey, of an MBIOS channe, then we may assume that Y is the set of rea numbers R and further have the symmetry condition: p(y 0) = p( y 1), y R () To anayze the asymptotic average iterative decoding performance of a (λ, ρ) irreguar LDPC ensembe when the codeword ength goes to infinity, where λ(x) λ ix i 1, and ρ(x) ρ ix i 1 are the standard variabe and check node degree distributions, respectivey, from the edge perspective as defined in [13], it is shown in [] that we can as we consider the cyce-free case. In this case, the probabiity of bit error after decoding iterations is the probabiity of decoding error of the root bit on the tree of + 1 (variabe node) eves whose construction is dictated by the degree distributions (λ, ρ) as in [13]. Due to the symmetry condition of MBIOS channes, we can aso assume without oss of generaity that the a-zero codeword is transmitted. Hence, in the foowing two sections, we wi anayze the asymptotic MS and SP iterative decoding performance of the (λ, ρ) LDPC ensembe on MBIOS channes by considering the corresponding tree codes and assuming the transmission of the a-zero codeword. 3 Min-Sum Decoding Performance Anaysis Consider an arbitrary binary tree code whose codebook is C = {c 0 = 0,c 1,...,c M }, where c i = (c i1, c i,..., c in ) is a codeword of ength n for a i, and c 0 is the a-zero codeword. Let c i1 be the root bit of this tree for a i, x = (x 1, x,...,x n ) the transmitted codeword, and y = (y 1, y,...,y n ) the received sequence from an MBIOS channe with conditiona probabiity mass function p(y x). When min-sum (MS) decoding is performed on this tree, it essentiay performs maximum ikeihood sequence detection (MLSqD) on the whoe sequence to produce an estimate ĉ = (ĉ 1, ĉ,..., ĉ n ). Therefore, if we define the decision region for the codeword c i as U i k i U ik, (3) where U ik { y R n p(y j c ij ) } p(y j c kj ), (4) then the probabiity of the root bit being in error under MS decoding assuming x = 0 is ( = Pr(ĉ 1 = 1 x = c 0 ) = Pr y ) U i x = c 0. (5) P MS b i,c i1 =1 We woud ike to find a compact representation of the set U U i, (6) i,c i1 =1
4 or at east a superset of U so that we can bound Pb MS from above. Note that such an upper bound is aso a vaid upper bound on the probabiity of root bit error Pb SP when the SP decoding is performed on the tree since the SP decoding essentiay performs optima maximum ikeihood decoding for each bit. Define the subcode C r of C as the set of codewords in C such that the root bit is 1, and each check node has exacty one chid variabe node of vaue 1 if it has a parent node of vaue 1, and zero chid nodes of vaue 1 if it has a parent node of vaue 0. We show how we can use this reduced codebook C r to characterize U in the foowing emma. Lemma 1 U i,c i C r U i0. Proof: Given any y U = i,c i1 =1 U i, there exists a k such that y U k and c k1 = 1. To proceed with our proof, we first carry out the foowing abeing procedure. 1. At the initia state, the root bit is abeed as survivor, and a the other variabe nodes are unabeed. Note that in this abeing procedure, the survivor variabe nodes wi aways have vaue 1 in c k. We first consider the check nodes at the topmost eve of the tree.. For every check node h at this eve whose parent node is abeed as survivor, it must have at east one chid variabe node with vaue 1 in c k since survivor nodes aways have vaue 1 in c k. Choose an arbitrary chid variabe node of h with vaue 1 in c k, and abe it as survivor. Then, abe the subtrees emanating from the other unabeed chid variabe nodes of h as dropped. 3. If there are no check nodes at the next ower eve of the tree, stop. Otherwise, move to the check nodes at the next ower eve and go back to. As we can see after this abeing procedure, the check nodes with a survivor parent node a have exacty one survivor chid node, and the ones with a dropped parent node have purey dropped chid nodes. Therefore, if we et { 0 for a dropped bits c m = (7) 1 = c k for a survivor bits then we have c m C r C. In the foowing, we woud ike to prove that y U m0, which competes the proof. Let { c k for a dropped bits c = (8) 0 for a survivor bits i.e., et c be the bitwise XOR of c k and c m. Then, since c k and c m are vaid codewords in C, so is c. Moreover, since y U k impies y U k, we have from (4) that p(y j c kj ) p(y j c j ) p(y j c kj ) p(y j c j ) which proves that y U m0 as desired. a survivor bits j a survivor bits j p(y j c mj ) p(y j c mj ) a survivor bits j a survivor bits j p(y j 0) p(y j 0) (9)
5 This emma shows that we can upper bound Pb MS by the probabiity of MLSqD error Ps MLSqD on the reduced codebook C r assuming that the a-zero codeword is transmitted. One way to proceed from here is to use union bound and the fact (see [1, Theorem 7.5] for a proof) that Pr(y U i0 x = c 0 ) D w(c i), i (10) where w(c i ) denotes the Hamming weight of c i, and D is the Bhattacharryya parameter associated with the MBIOS channe p(y x), to further upper bound Ps MLSqD. For this purpose, we woud ike to introduce the weight enumerator N (x) of the reduced codebook C of the tree code G of eve +1 associated with a randomy drawn code from the (λ, ρ) LDPC ensembe. Let A i be the number of codewords of weight i in C. We define N (x) by N (x) A ix i. Moreover, et N (x) denote the expected vaue of N (x) averaged over the whoe (λ, ρ) LDPC ensembe. We have the foowing emma. Lemma N 0 (x) = x and where ρ (x) denotes the derivative of ρ(x). N (x) = λ(ρ (1)N 1 (x)), 1 (11) Proof: It is obvious that N 0 (x) = x. To prove the recursion for N (x), first consider the subtree emanating from the ith check node h i immediatey beow the root bit. Let Z (i) (x) denote the weight enumerator of the reduced codebook of this subtree. Since, the root bit is 1 for a codewords in the reduced codebook C, there is exacty one chid subtree with root 1 emanating from c for a codewords in C. Therefore, if c has degree d c, then we have Z (i) (x) = (d c 1)N 1 (x) Z (i) (x) = Simiary, if the root bit has degree d v, then we have N (x) = d c 1 Z (i) (x) N (x) = d c 1 (i 1)N 1 (x)ρ i = ρ (1)N 1 (x). (1) Z (i) (x)λ j = i=j d c 1 Z (i) (x)λ j = λ(z (1) (x)) (13) where the second equaity foows from the fact that the subtrees emanating from different h i s are generated independenty, and the third equaity foows from the fact that Z (i) (x) does not depend on i as shown in (1). Combining (1) and (13), the emma is proved. Using this emma and the union bound on Ps MLSqD, we have the foowing theorem. Theorem 1 Given any (λ, ρ) LDPC ensembe, et P MS and P SP be its asymptotic (as the codeword ength approaches infinity) average bit error probabiity after iterations under MS and SP decoding, respectivey, on an MBIOS channe with Bhattacharryya parameter D. If we define the sequence {z } =0 by z 0 = D, and z = λ(ρ (1)z 1 ), for a 1, then we have P SP P MS z, for a 0. Proof: From Lemma we see that z = N (D) for a. Now, the emma foows from the union bound on Ps MLSqD as discussed above. A simiar resut to Theorem 1 is estabished in [6, Lemma 1]. However, Theorem 1 differs from [6, Lemma 1] in two aspects. First, Theorem 1 hods for both MS and SP decoding whie [6, Lemma 1] hods ony for the SP decoding. Second, we did not keep track of the evoution of the Bhattacharryya parameters, which are used in [6] to bound P SP for a. In the next section when we focus ony on the SP decoding, we wi keep track of the evoution of the Bhattacharryya parameters as in [6, Lemma 1] to estabish a stronger resut than [6, Lemma 1].
6 4 Sum-Product Decoding Performance Anaysis Let m = og[p(y 0)/p(y 1)] be the og-ikeihood ratio (LLR) of x given the observation y, where the statistics of y are reated to x by the conditiona probabiity mass function p(y x). Assuming x = 0, the Bhattacharyya parameter associated with p(y x) can be expressed as B = y p(y 0) p(y 1) p(y 0) = E [ e Now, consider the SP decoding on a tree code used on an MBIOS channe. As shown in [], a the SP decoding messages can be represented by the LLR s and satisfy the symmetry condition (). Assuming that the a-zero codeword is transmitted, we have the foowing emma describing the reationship between Bhattacharryya parameters associated with the incoming and outgoing messages of a variabe node. Lemma 3 Let v be a variabe node of degree d v. Furthermore, et m 0 be the incoming message from the channe, m v the outgoing message on an edge, and m 1, m,...,m dv 1 the incoming messages from the other edges. Assuming a the incoming messages are independent with each other, we have [ ] d v 1 [ E e mv = E Proof: It foows directy from the fact that under SP decoding [], m v = d v 1 i=0 m i, and the independence of the incoming messages. A simiar reationship for a check node is aso derived. However, since the derivation is more compicated than the one for a variabe node, we first consider the simpe case where the check node is of degree 3. Lemma 4 Let c be a check node of degree 3. Furthermore, et m c be the outgoing message on an edge, and m 1 and m the incoming messages from the other edges. Assuming a the incoming messages are independent with each other, we have [ E e mc ] 1 i=0 e m i ( [ 1 E Proof: Under SP decoding, we have from [] that ( 1 + m c =og tanh ) m i 1 tanh = og m i ] e m i m] ]) ( 1 + e m 1 ) e m e m 1 + e m Let p 1 and p be the conditiona probabiity mass functions associated with m 1 and m, respectivey, such that (14) (15) (16) (17) m i = og p i(y 0) p i (y 1) = og p i(y 0), i = 1, (18) p i ( y 0) Writing p i (y 0) as p i (y) for a i for conciseness, we have on the eft hand side of (16) that [ ] [ ] E e mc e m 1 + e m = E 1 + e m 1 e m = p 1 ( y 1 )p (y ) + p 1 (y 1 )p ( y ) p 1 (y 1 )p (y ) p y 1,y 1 (y 1 )p (y ) + p 1 ( y 1 )p ( y ) (19)
7 Since for a y i such that p i (y i ) p i ( y i ), there exists a y i = y i such that p i (y i) p i ( y i), and vice versa for a i, it foows that [ ] E e mc = p 1 ( y 1 )p (y ) + p 1 (y 1 )p ( y ) [p 1 (y 1 )p (y ) + p 1 ( y 1 )p ( y )] p 1 (y 1 )p (y ) + p 1 ( y 1 )p ( y ) = y i : p i ( y i ) p i (y i ) 1, + [p 1 (y 1 )p ( y ) + p 1 ( y 1 )p (y )] y i : p i ( y i ) p i (y i ) 1,, p 1 (y 1 )p (y ) p 1 (y 1 )p (y ) + p 1 ( y 1 )p ( y ) p 1 ( y 1 )p (y ) + p 1 (y 1 )p ( y ) ][ p1 ( y 1 ) p 1 (y 1 )p (y ) p 1 (y 1 ) + p ] ( y ) p (y ) [ 1 + p 1( y 1 )p ( y ) Simiary, the right hand side of (16) can be written as foows. ( [ ]) [ ( )( )] 1 1 E e m i =E 1 1 e m 1 1 e m = = [p (y ) + p ( y )] p1 (y 1 )p 1 ( y 1 ) y i : p i ( y i ) p i (y i ) 1,, y i : p i ( y i ) (0) + [p 1 (y 1 ) + p 1 ( y 1 )] p (y )p ( y ) 4 p 1 (y 1 )p 1 ( y 1 )p (y )p ( y ) [ ( 1 + p ) ( y ) p 1 ( y 1 ) p (y ) p 1 (y 1 ) + p 1 (y 1 )p (y ) p i (y i ) 1,, ( 1 + p 1( y 1 ) p 1 (y 1 ) ) p ( y ) p (y ) ] p 1 ( y 1 )p ( y ) p 1 (y 1 )p (y ) where the first equaity foows from the independence of m 1 and m. For any given y i, et a i p i ( y i )/p i (y i ), for i = 1,. Then, we see from (0) and (1) that it is sufficient to prove (1 + a1 a )(a 1 + a ) (1 + a ) a 1 + (1 + a 1 ) a a 1 a () for a 0 a i 1, for a i. Now, since [(1 + a ) a 1 + (1 + a 1 ) a a 1 a ] (1 + a 1 a )(a 1 + a ) = a 1 a [4 a 1 a + (1 + a 1 )(1 + a ) (1 + a 1 ) a (1 + a ) a 1 ] = a 1 a (1 a 1 ) (1 a ) 0 (3) () is true and the emma is proved. Armed with the previous emma, we can proceed to the genera case where the check node has degree d c by an induction argument. Coroary 1 Let c be a check node of degree d c. Furthermore, et m c be the outgoing message on an edge, and m 1, m,...,m dc 1 the incoming messages from the other edges. Assuming a the incoming messages are independent with each other, we have [ E e mc ] 1 d c 1 ( [ 1 E e m i ]) (1) (4)
8 Proof: We can aways first take m 1 and m to form a temporary outgoing message m of a check node. Then take m and m 3 to form another temporary outgoing message m 3. By repeatedy appying this procedure, we wi get the desired outgoing message in d c steps. Since for each of the above steps, Lemma 4 hods, and 0 E [ ] e m 1, for a LLR m as shown in (1), we have [ ] ( [ ]) ( ]) E e mc 1 1 E e m dc 1 1 E [e m dc ( [ ])( [ ]) ( ]) 1 1 E e m dc 1 1 E e m dc 1 E [e m dc 3 1 ( [ 1 E e m dc 1 ])( [ 1 E e m dc ]) ( [ ]) 1 E e m 1 (5) Hence the coroary is true. For a tree code used on an MBIOS channe under SP decoding, a the incoming messages to the variabe and check nodes are independent with each other. Hence, Lemma 3 and Coroary 1 can be used to characterize the evoution of the Bhattacharryya parameters associated with the messages after processes of the variabe and check nodes on a tree, and impy the foowing theorem. Theorem For the (λ, ρ) LDPC ensembe used on an MBIOS channe with conditiona probabiity mass function q(y x), the Bhattacharyya parameter B associated with the outgoing message of any variabe node after the th decoding iteration asymptoticay satisfies where D y q(y 0)q(y 1), and B0 = D. B Dλ (1 ρ (1 B 1 )) (6) Proof: As discussed in Section, the Bhattacharyya parameter associated with the outgoing message of any variabe node after the th decoding iteration is, asymptoticay as the codeword ength goes to infinity, the one of the root variabe node of a tree of eve +1. Since a the variabe and check nodes in the tree have exacty the same degree distributions λ and ρ, respectivey, and the channe is memoryess, a the incoming messages from chid nodes to a parent node are independent and identicay distributed. Hence, if we et v be a variabe node in the tree, d v a random variabe denoting its degree, m v its outgoing message, and m c one of its incoming message, then we have from Lemma 3 that E [ e mv ] = E [ ] e mv d v = i λ i = [ E e mc ] (i 1) ( [ λi = λ E Simiary, if we et c be a check node in the tree, d c a random variabe denoting its degree, m c its outgoing message, and m v one of its incoming message, then we have from Coroary 1 that [ ] [ ] E e mc = E e mc d c = i =1 ρ ρ i [ ( [ ]) ] (i 1) 1 1 E e mv ρ i ( [ ]) 1 E e mv where the ast equaity foows from the fact that ρ(1) = 1. Combining (7), (8), and the fact that λ is a monotonicay increasing function (since a λ i s are nonnegative), the theorem is proved. e mc ]) (7) (8)
9 Notice that on the binary erasure channe (BEC) of erasure probabiity ǫ, the Bhattacharryya parameter of this channe is aso ǫ. Hence, (6) is satisfied with equaity, and recovers the weknown DE equation x = ǫλ (1 ρ (1 x 1 )), x 0 = ǫ (9) where x is the bit erasure probabiity after the th iteration on the BEC. Using this fact, we have the foowing coroary. Coroary For any (λ, ρ) LDPC ensembe, its asymptotic SP decoding performance on the MBIOS channe with Bhattacharryya parameter D is aways better than its asymptotic SP decoding performance on the BEC with erasure probabiity ǫ D. Proof: From (6) and (9), we have x B for a 0 when ǫ D. Since B is an upper bound on the bit error probabiity under SP decoding after iterations on the MBIOS channe whose Bhattacharyya parameter is equa to D, the coroary is proved. Notice that, Lemma 3 and Coroary 1 can aso be used in the more genera famiy of mutiedge type LDPC codes [8], incuding the irreguar repeat-accumuate (IRA) codes [9, 10] and the ow-density parity-check and generator matrix (LDPC-GM) codes [11], to produce simiar resuts. Hence, Coroary is not restricted to the irreguar LDPC codes, but aso hods for the genera muti-edge type LDPC codes. 5 Concusion In this paper, we anayze the asymptotic performance of LDPC codes under MS and SP decoding on MBIOS channes. This is done by upper bounding the bit error probabiity of the root bit of the tree code associated with the (λ, ρ) LDPC ensembe assuming the a-zero codeword is transmitted. When MS decoding is performed on this tree code, we upper bound the probabiity of the root bit being in error by the probabiity of sequence error under ML decoding of a subcode of the tree code. A recursive equation describing the evoution of the weight enumerator of this subcode after each iteration is then derived and used in a union bound to bound the ML decoded sequence error of this subcode. As a resut, we obtain a recursive upper bound on the bit error probabiity as a function of the number iterations for the LDPC codes under MS decoding on MBIOS channes. Note that these upper bounds are aso upper bounds for the SP decoding since SP decoding is optima on the bit error probabiity for tree codes. This resut is very simiar to [6, Lemma 1] with the difference being that we estabish it not ony for the SP decoding, but aso for the MS decoding, and that we obtain it via a totay different approach. When SP decoding performance is considered, we derive a recursive upper bound on the Bhattacharryya parameter associated with the outgoing message of the root bit as a function of the number of iterations. More significanty, this recursion recovers the DE equation on the BEC for LDPC codes with the upper bound being an exact equaity. This further impies that the SP decoding performance of LDPC codes on the BEC can serve as a ower bound of the performance on a MBIOS channes with the same Bhattacharryya parameter. This resut is aso true for the more genera muti-edge type LDPC codes, incuding IRA and LDPC-GM codes, since the main ingredient in the proof, i.e., Lemma 3 and Coroary 1, can aso be utiized for these codes.
10 References [1] R. G. Gaager, Low density parity check codes, IEEE Trans. Information Theory, vo. 8, pp. 1 8, Jan [] T. J. Richardson and R. L. Urbanke, The capacity of ow-density parity-check codes under message-passing decoding, IEEE Trans. Information Theory, vo. 47, no., pp , Feb [3] T. J. Richardson S.-Y. Chung and R. L. Urbanke, Anaysis of sum-product decoding of ow-density parity-check codes using a Gaussian approximation, IEEE Trans. Information Theory, vo. 47, no., pp , Feb [4] S. ten Brink, Convergence behavior of iterativey decoded parae concatenated codes, IEEE Trans. Communications, vo. 49, no. 10, pp , Oct [5] C. Measson, A. Montanari, and R. Urbanke, Why we can not surpass capacity: The matching condition, in Proc. Aerton Conf. Commun., Contro, Comp., Monticeo, IL, Sept [6] M. Lentmaier, D. Truhachev, K. Zigangirov, and D. Costeo, An anaysis of the bock error probabiity performance of iterative decoding, IEEE Trans. Information Theory, vo. 51, no. 11, pp , Nov [7] N. Wiberg, Codes and Decoding on Genera Graphs, Ph.D. thesis, Linköping University, Linköping, Sweden, [8] T. Richardson and R. Urbanke, Muti-edge type dpc codes, 004, [Onine]. Avaiabe: [9] H. Jin, A. Khandekar, and R. J. McEiece, Irreguar repeat-accumuate codes, in Proc. Internationa Symposium on Turbo Codes and Reated Topics, Brest, France, Sept. 000, pp [10] H. D. Pfister, I. Sason, and R. Urbanke, Capacity-achieving ensembes for the binary erasure channe with bounded compexity, IEEE Trans. Information Theory, vo. 51, no. 7, pp , Juy 005. [11] C.-H. Hsu and A. Anastasopouos, Capacity-achieving codes with bounded graphica compexity on noisy channes, in Proc. Aerton Conf. Commun., Contro, Comp., Monticeo, IL, Sept [1] R. J. McEiece, The Theory of Information and Coding, nd ed., Cambridge University Press, Cambridge, UK, 00. [13] T. J. Richardson, M. A. Shokroahi, and R. L. Urbanke, Design of capacity-approaching irreguar ow-density parity-check codes, IEEE Trans. Information Theory, vo. 47, no., pp , Feb. 001.
Forty-Seventh Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 30 - October 2, 2009
Forty-Seventh Annua Aerton Conference Aerton House, UIUC, Iinois, USA September 30 - October 2, 2009 On systematic design of universay capacity approaching rate-compatibe sequences of LDPC code ensembes
More informationTrapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles
Trapping Set Enumerators for Repeat Mutipe Accumuate Code Ensembes Christian Koer, Aexandre Grae i Amat, Jörg Kiewer, and Danie J. Costeo, Jr. Department of Eectrica Engineering, University of Notre Dame,
More informationOn the Achievable Extrinsic Information of Inner Decoders in Serial Concatenation
On the Achievabe Extrinsic Information of Inner Decoders in Seria Concatenation Jörg Kiewer, Axe Huebner, and Danie J. Costeo, Jr. Department of Eectrica Engineering, University of Notre Dame, Notre Dame,
More informationImproved Min-Sum Decoding of LDPC Codes Using 2-Dimensional Normalization
Improved Min-Sum Decoding of LDPC Codes sing -Dimensiona Normaization Juntan Zhang and Marc Fossorier Department of Eectrica Engineering niversity of Hawaii at Manoa Honouu, HI 968 Emai: juntan, marc@spectra.eng.hawaii.edu
More informationCS229 Lecture notes. Andrew Ng
CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view
More informationA Brief Introduction to Markov Chains and Hidden Markov Models
A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,
More informationarxiv: v1 [math.co] 17 Dec 2018
On the Extrema Maximum Agreement Subtree Probem arxiv:1812.06951v1 [math.o] 17 Dec 2018 Aexey Markin Department of omputer Science, Iowa State University, USA amarkin@iastate.edu Abstract Given two phyogenetic
More informationAsymptotic Properties of a Generalized Cross Entropy Optimization Algorithm
1 Asymptotic Properties of a Generaized Cross Entropy Optimization Agorithm Zijun Wu, Michae Koonko, Institute for Appied Stochastics and Operations Research, Caustha Technica University Abstract The discrete
More informationTurbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University
Turbo Codes Coding and Communication Laboratory Dept. of Eectrica Engineering, Nationa Chung Hsing University Turbo codes 1 Chapter 12: Turbo Codes 1. Introduction 2. Turbo code encoder 3. Design of intereaver
More informationArticle An Efficient Method to Construct Parity-Check Matrices for Recursively Encoding Spatially Coupled LDPC Codes
entropy Artice An Efficient Method to Construct Parity-Check Matrices for Recursivey Encoding Spatiay Couped LDPC Codes Zhongwei Si, Sijie Wang and Junyang Ma Key Laboratory of Universa Wireess Communications,
More informationSequential Decoding of Polar Codes with Arbitrary Binary Kernel
Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient
More informationMaximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem
1 Maximum ikeihood decoding of treis codes in fading channes with no receiver CSI is a poynomia-compexity probem Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department
More informationLimited magnitude error detecting codes over Z q
Limited magnitude error detecting codes over Z q Noha Earief choo of Eectrica Engineering and Computer cience Oregon tate University Corvais, OR 97331, UA Emai: earief@eecsorstedu Bea Bose choo of Eectrica
More informationEfficiently Generating Random Bits from Finite State Markov Chains
1 Efficienty Generating Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown
More informationError Floor Approximation for LDPC Codes in the AWGN Channel
submitted to IEEE TRANSACTIONS ON INFORMATION THEORY VERSION: JUNE 4, 2013 1 Error Foor Approximation for LDPC Codes in the AWGN Channe Brian K. Buter, Senior Member, IEEE, Pau H. Siege, Feow, IEEE arxiv:1202.2826v2
More informationMARKOV CHAINS AND MARKOV DECISION THEORY. Contents
MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After
More informationOn Generalized EXIT Charts of LDPC Code Ensembles over Binary-Input Output-Symmetric Memoryless Channels
2012 IEEE International Symposium on Information Theory Proceedings On Generalied EXIT Charts of LDPC Code Ensembles over Binary-Input Output-Symmetric Memoryless Channels H Mamani 1, H Saeedi 1, A Eslami
More informationMany-Help-One Problem for Gaussian Sources with a Tree Structure on their Correlation
Many-Hep-One Probem for Gaussian Sources with a Tree Structure on their Correation Yasutada Oohama arxiv:090988v csit 4 Jan 009 Abstract In this paper we consider the separate coding probem for + correated
More informationAnalysis of Emerson s Multiple Model Interpolation Estimation Algorithms: The MIMO Case
Technica Report PC-04-00 Anaysis of Emerson s Mutipe Mode Interpoation Estimation Agorithms: The MIMO Case João P. Hespanha Dae E. Seborg University of Caifornia, Santa Barbara February 0, 004 Anaysis
More informationCoded Caching for Files with Distinct File Sizes
Coded Caching for Fies with Distinct Fie Sizes Jinbei Zhang iaojun Lin Chih-Chun Wang inbing Wang Department of Eectronic Engineering Shanghai Jiao ong University China Schoo of Eectrica and Computer Engineering
More information6 Wave Equation on an Interval: Separation of Variables
6 Wave Equation on an Interva: Separation of Variabes 6.1 Dirichet Boundary Conditions Ref: Strauss, Chapter 4 We now use the separation of variabes technique to study the wave equation on a finite interva.
More informationA. Distribution of the test statistic
A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch
More informationRate-Distortion Theory of Finite Point Processes
Rate-Distortion Theory of Finite Point Processes Günther Koiander, Dominic Schuhmacher, and Franz Hawatsch, Feow, IEEE Abstract We study the compression of data in the case where the usefu information
More informationA proposed nonparametric mixture density estimation using B-spline functions
A proposed nonparametric mixture density estimation using B-spine functions Atizez Hadrich a,b, Mourad Zribi a, Afif Masmoudi b a Laboratoire d Informatique Signa et Image de a Côte d Opae (LISIC-EA 4491),
More informationAkaike Information Criterion for ANOVA Model with a Simple Order Restriction
Akaike Information Criterion for ANOVA Mode with a Simpe Order Restriction Yu Inatsu * Department of Mathematics, Graduate Schoo of Science, Hiroshima University ABSTRACT In this paper, we consider Akaike
More informationA NOTE ON QUASI-STATIONARY DISTRIBUTIONS OF BIRTH-DEATH PROCESSES AND THE SIS LOGISTIC EPIDEMIC
(January 8, 2003) A NOTE ON QUASI-STATIONARY DISTRIBUTIONS OF BIRTH-DEATH PROCESSES AND THE SIS LOGISTIC EPIDEMIC DAMIAN CLANCY, University of Liverpoo PHILIP K. POLLETT, University of Queensand Abstract
More informationPricing Multiple Products with the Multinomial Logit and Nested Logit Models: Concavity and Implications
Pricing Mutipe Products with the Mutinomia Logit and Nested Logit Modes: Concavity and Impications Hongmin Li Woonghee Tim Huh WP Carey Schoo of Business Arizona State University Tempe Arizona 85287 USA
More informationT.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA
ON THE SYMMETRY OF THE POWER INE CHANNE T.C. Banwe, S. Gai {bct, sgai}@research.tecordia.com Tecordia Technoogies, Inc., 445 South Street, Morristown, NJ 07960, USA Abstract The indoor power ine network
More informationBICM Performance Improvement via Online LLR Optimization
BICM Performance Improvement via Onine LLR Optimization Jinhong Wu, Mostafa E-Khamy, Jungwon Lee and Inyup Kang Samsung Mobie Soutions Lab San Diego, USA 92121 Emai: {Jinhong.W, Mostafa.E, Jungwon2.Lee,
More informationAn Introduction to Low Density Parity Check (LDPC) Codes
An Introduction to Low Density Parity Check (LDPC) Codes Jian Sun jian@csee.wvu.edu Wireless Communication Research Laboratory Lane Dept. of Comp. Sci. and Elec. Engr. West Virginia University June 3,
More informationOn the Block Error Probability of LP Decoding of LDPC Codes
On the Block Error Probability of LP Decoding of LDPC Codes Ralf Koetter CSL and Dept. of ECE University of Illinois at Urbana-Champaign Urbana, IL 680, USA koetter@uiuc.edu Pascal O. Vontobel Dept. of
More informationA Branch and Cut Algorithm to Design. LDPC Codes without Small Cycles in. Communication Systems
A Branch and Cut Agorithm to Design LDPC Codes without Sma Cyces in Communication Systems arxiv:1709.09936v1 [cs.it] 28 Sep 2017 Banu Kabakuak 1, Z. Caner Taşkın 1, and Ai Emre Pusane 2 1 Department of
More informationEfficient Generation of Random Bits from Finite State Markov Chains
Efficient Generation of Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown
More informationAn explicit Jordan Decomposition of Companion matrices
An expicit Jordan Decomposition of Companion matrices Fermín S V Bazán Departamento de Matemática CFM UFSC 88040-900 Forianópois SC E-mai: fermin@mtmufscbr S Gratton CERFACS 42 Av Gaspard Coriois 31057
More informationWeek 6 Lectures, Math 6451, Tanveer
Fourier Series Week 6 Lectures, Math 645, Tanveer In the context of separation of variabe to find soutions of PDEs, we encountered or and in other cases f(x = f(x = a 0 + f(x = a 0 + b n sin nπx { a n
More informationA Statistical Framework for Real-time Event Detection in Power Systems
1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem
More information2146 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 61, NO. 6, JUNE 2013
246 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 6, NO. 6, JUNE 203 On Achieving an Asymptoticay Error-Free Fixed-Point of Iterative Decoding for Perfect APrioriInformation Jörg Kiewer, Senior Member, IEEE,
More informationLecture Note 3: Stationary Iterative Methods
MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or
More informationUniformly Reweighted Belief Propagation: A Factor Graph Approach
Uniformy Reweighted Beief Propagation: A Factor Graph Approach Henk Wymeersch Chamers University of Technoogy Gothenburg, Sweden henkw@chamers.se Federico Penna Poitecnico di Torino Torino, Itay federico.penna@poito.it
More informationAsynchronous Control for Coupled Markov Decision Systems
INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of
More informationLower Bounds on the Graphical Complexity of Finite-Length LDPC Codes
Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology Haifa 32000, Israel 2009 IEEE International
More informationSUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS
ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia
More informationUnconditional security of differential phase shift quantum key distribution
Unconditiona security of differentia phase shift quantum key distribution Kai Wen, Yoshihisa Yamamoto Ginzton Lab and Dept of Eectrica Engineering Stanford University Basic idea of DPS-QKD Protoco. Aice
More informationNearly Optimal Constructions of PIR and Batch Codes
arxiv:700706v [csit] 5 Jun 07 Neary Optima Constructions of PIR and Batch Codes Hia Asi Technion - Israe Institute of Technoogy Haifa 3000, Israe shea@cstechnionaci Abstract In this work we study two famiies
More informationAge of Information: The Gamma Awakening
Age of Information: The Gamma Awakening Eie Najm and Rajai Nasser LTHI, EPFL, Lausanne, Switzerand Emai: {eie.najm, rajai.nasser}@epf.ch arxiv:604.086v [cs.it] 5 Apr 06 Abstract Status update systems is
More informationWhy We Can Not Surpass Capacity: The Matching Condition
Why We Can Not Surpass Capacity: The Matching Condition Cyril Méasson EPFL CH-1015 Lausanne cyril.measson@epfl.ch, Andrea Montanari LPT, ENS F-75231 Paris montanar@lpt.ens.fr Rüdiger Urbanke EPFL CH-1015
More informationNumerical solution of one dimensional contaminant transport equation with variable coefficient (temporal) by using Haar wavelet
Goba Journa of Pure and Appied Mathematics. ISSN 973-1768 Voume 1, Number (16), pp. 183-19 Research India Pubications http://www.ripubication.com Numerica soution of one dimensiona contaminant transport
More informationHomogeneity properties of subadditive functions
Annaes Mathematicae et Informaticae 32 2005 pp. 89 20. Homogeneity properties of subadditive functions Pá Burai and Árpád Száz Institute of Mathematics, University of Debrecen e-mai: buraip@math.kte.hu
More informationProblem set 6 The Perron Frobenius theorem.
Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator
More informationResearch Article On the Lower Bound for the Number of Real Roots of a Random Algebraic Equation
Appied Mathematics and Stochastic Anaysis Voume 007, Artice ID 74191, 8 pages doi:10.1155/007/74191 Research Artice On the Lower Bound for the Number of Rea Roots of a Random Agebraic Equation Takashi
More informationTHE THREE POINT STEINER PROBLEM ON THE FLAT TORUS: THE MINIMAL LUNE CASE
THE THREE POINT STEINER PROBLEM ON THE FLAT TORUS: THE MINIMAL LUNE CASE KATIE L. MAY AND MELISSA A. MITCHELL Abstract. We show how to identify the minima path network connecting three fixed points on
More informationOn the Goal Value of a Boolean Function
On the Goa Vaue of a Booean Function Eric Bach Dept. of CS University of Wisconsin 1210 W. Dayton St. Madison, WI 53706 Lisa Heerstein Dept of CSE NYU Schoo of Engineering 2 Metrotech Center, 10th Foor
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sampe cover image for this issue The actua cover is not yet avaiabe at this time) This artice appeared in a journa pubished by Esevier The attached copy is furnished to the author for interna
More informationA Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes
A Fundamenta Storage-Communication Tradeoff in Distributed Computing with Stragging odes ifa Yan, Michèe Wigger LTCI, Téécom ParisTech 75013 Paris, France Emai: {qifa.yan, michee.wigger} @teecom-paristech.fr
More informationExpectation-Maximization for Estimating Parameters for a Mixture of Poissons
Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Brandon Maone Department of Computer Science University of Hesini February 18, 2014 Abstract This document derives, in excrutiating
More informationSome Measures for Asymmetry of Distributions
Some Measures for Asymmetry of Distributions Georgi N. Boshnakov First version: 31 January 2006 Research Report No. 5, 2006, Probabiity and Statistics Group Schoo of Mathematics, The University of Manchester
More informationEE229B - Final Project. Capacity-Approaching Low-Density Parity-Check Codes
EE229B - Final Project Capacity-Approaching Low-Density Parity-Check Codes Pierre Garrigues EECS department, UC Berkeley garrigue@eecs.berkeley.edu May 13, 2005 Abstract The class of low-density parity-check
More informationarxiv: v1 [math.fa] 23 Aug 2018
An Exact Upper Bound on the L p Lebesgue Constant and The -Rényi Entropy Power Inequaity for Integer Vaued Random Variabes arxiv:808.0773v [math.fa] 3 Aug 08 Peng Xu, Mokshay Madiman, James Mebourne Abstract
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 2, FEBRUARY
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 5, NO. 2, FEBRUARY 206 857 Optima Energy and Data Routing in Networks With Energy Cooperation Berk Gurakan, Student Member, IEEE, OmurOze,Member, IEEE,
More informationSecure Information Flow Based on Data Flow Analysis
SSN 746-7659, Engand, UK Journa of nformation and Computing Science Vo., No. 4, 007, pp. 5-60 Secure nformation Fow Based on Data Fow Anaysis Jianbo Yao Center of nformation and computer, Zunyi Norma Coege,
More information6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7
6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17 Soution 7 Probem 1: Generating Random Variabes Each part of this probem requires impementation in MATLAB. For the
More informationThe Binary Space Partitioning-Tree Process Supplementary Material
The inary Space Partitioning-Tree Process Suppementary Materia Xuhui Fan in Li Scott. Sisson Schoo of omputer Science Fudan University ibin@fudan.edu.cn Schoo of Mathematics and Statistics University of
More informationEfficient Generation of Random Bits from Finite State Markov Chains
Efficient Generation of Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE arxiv:0.5339v [cs.it] 4 Dec 00 Abstract The probem of random number generation from an uncorreated
More informationAalborg Universitet. Bounds on information combining for parity-check equations Land, Ingmar Rüdiger; Hoeher, A.; Huber, Johannes
Aalborg Universitet Bounds on information combining for parity-check equations Land, Ingmar Rüdiger; Hoeher, A.; Huber, Johannes Published in: 2004 International Seminar on Communications DOI link to publication
More informationFast Blind Recognition of Channel Codes
Fast Bind Recognition of Channe Codes Reza Moosavi and Erik G. Larsson Linköping University Post Print N.B.: When citing this work, cite the origina artice. 213 IEEE. Persona use of this materia is permitted.
More informationSchedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness
1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea-Time Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process
More informationc 2016 Georgios Rovatsos
c 2016 Georgios Rovatsos QUICKEST CHANGE DETECTION WITH APPLICATIONS TO LINE OUTAGE DETECTION BY GEORGIOS ROVATSOS THESIS Submitted in partia fufiment of the requirements for the degree of Master of Science
More informationTwo-sample inference for normal mean vectors based on monotone missing data
Journa of Mutivariate Anaysis 97 (006 6 76 wwweseviercom/ocate/jmva Two-sampe inference for norma mean vectors based on monotone missing data Jianqi Yu a, K Krishnamoorthy a,, Maruthy K Pannaa b a Department
More informationApproximate Bandwidth Allocation for Fixed-Priority-Scheduled Periodic Resources (WSU-CS Technical Report Version)
Approximate Bandwidth Aocation for Fixed-Priority-Schedued Periodic Resources WSU-CS Technica Report Version) Farhana Dewan Nathan Fisher Abstract Recent research in compositiona rea-time systems has focused
More informationPower Control and Transmission Scheduling for Network Utility Maximization in Wireless Networks
ower Contro and Transmission Scheduing for Network Utiity Maximization in Wireess Networks Min Cao, Vivek Raghunathan, Stephen Hany, Vinod Sharma and. R. Kumar Abstract We consider a joint power contro
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Agorithmic Operations Research Vo.4 (29) 49 57 Approximated MLC shape matrix decomposition with intereaf coision constraint Antje Kiese and Thomas Kainowski Institut für Mathematik, Universität Rostock,
More informationUniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete
Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg yi}@it.uu.se Abstract Deciding the feasibiity
More informationSmoothers for ecient multigrid methods in IGA
Smoothers for ecient mutigrid methods in IGA Cemens Hofreither, Stefan Takacs, Water Zuehner DD23, Juy 2015 supported by The work was funded by the Austrian Science Fund (FWF): NFN S117 (rst and third
More informationarxiv: v1 [cs.db] 25 Jun 2013
Communication Steps for Parae Query Processing Pau Beame, Paraschos Koutris and Dan Suciu {beame,pkoutris,suciu}@cs.washington.edu University of Washington arxiv:1306.5972v1 [cs.db] 25 Jun 2013 June 26,
More informationLDPC Codes. Slides originally from I. Land p.1
Slides originally from I. Land p.1 LDPC Codes Definition of LDPC Codes Factor Graphs to use in decoding Decoding for binary erasure channels EXIT charts Soft-Output Decoding Turbo principle applied to
More informationSuccessive Cancellation Decoding of Single Parity-Check Product Codes
Successive Cancellation Decoding of Single Parity-Check Product Codes Mustafa Cemil Coşkun, Gianluigi Liva, Alexandre Graell i Amat and Michael Lentmaier Institute of Communications and Navigation, German
More informationConvergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems
Convergence Property of the Iri-Imai Agorithm for Some Smooth Convex Programming Probems S. Zhang Communicated by Z.Q. Luo Assistant Professor, Department of Econometrics, University of Groningen, Groningen,
More informationAn Introduction to Low-Density Parity-Check Codes
An Introduction to Low-Density Parity-Check Codes Paul H. Siegel Electrical and Computer Engineering University of California, San Diego 5/ 3/ 7 Copyright 27 by Paul H. Siegel Outline Shannon s Channel
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Approximated MLC shape matrix decomposition with intereaf coision constraint Thomas Kainowski Antje Kiese Abstract Shape matrix decomposition is a subprobem in radiation therapy panning. A given fuence
More informationTHE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES
THE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES by Michae Neumann Department of Mathematics, University of Connecticut, Storrs, CT 06269 3009 and Ronad J. Stern Department of Mathematics, Concordia
More informationCodes between MBR and MSR Points with Exact Repair Property
Codes between MBR and MSR Points with Exact Repair Property 1 Toni Ernva arxiv:1312.5106v1 [cs.it] 18 Dec 2013 Abstract In this paper distributed storage systems with exact repair are studied. A construction
More informationPrimal and dual active-set methods for convex quadratic programming
Math. Program., Ser. A 216) 159:469 58 DOI 1.17/s117-15-966-2 FULL LENGTH PAPER Prima and dua active-set methods for convex quadratic programming Anders Forsgren 1 Phiip E. Gi 2 Eizabeth Wong 2 Received:
More informationInvestigation on spectrum of the adjacency matrix and Laplacian matrix of graph G l
Investigation on spectrum of the adjacency matrix and Lapacian matrix of graph G SHUHUA YIN Computer Science and Information Technoogy Coege Zhejiang Wani University Ningbo 3500 PEOPLE S REPUBLIC OF CHINA
More informationOblivious Transfer over Wireless Channels
1 Obivious Transfer over Wireess Channes Jithin Ravi, Bikash Kumar Dey, Emanuee Viterbo arxiv:158664v1 [csit 4 Aug 15 Abstract We consider the probem of obivious transfer OT over OFDM and MIMO wireess
More informationDelay Asymptotics with Retransmissions and Fixed Rate Codes over Erasure Channels
Deay Asymptotics with Retransmissions and Fixed Rate Codes over Erasure Channes Jian Tan, Yang Yang, Ness B. Shroff, Hesham E Gama Department of Eectrica and Computer Engineering The Ohio State University,
More informationLDPC Code Ensembles that Universally Achieve Capacity under BP Decoding: A Simple Derivation
LDPC Code Ensembles that Universally Achieve Capacity under BP Decoding: A Simple Derivation Anatoly Khina EE Systems Dept., TAU Tel Aviv, Israel Email: anatolyk@eng.tau.ac.il Yair Yona Dept. of EE, UCLA
More informationJoint Iterative Decoding of LDPC Codes and Channels with Memory
Joint Iterative Decoding of LDPC Codes and Channels with Memory Henry D. Pfister and Paul H. Siegel University of California, San Diego 3 rd Int l Symposium on Turbo Codes September 1, 2003 Outline Channels
More informationPartial permutation decoding for MacDonald codes
Partia permutation decoding for MacDonad codes J.D. Key Department of Mathematics and Appied Mathematics University of the Western Cape 7535 Bevie, South Africa P. Seneviratne Department of Mathematics
More informationMaximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SIR
1 Maximizing Sum Rate and Minimizing MSE on Mutiuser Downink: Optimaity, Fast Agorithms and Equivaence via Max-min SIR Chee Wei Tan 1,2, Mung Chiang 2 and R. Srikant 3 1 Caifornia Institute of Technoogy,
More informationBOUNDS ON THE MAP THRESHOLD OF ITERATIVE DECODING SYSTEMS WITH ERASURE NOISE. A Thesis CHIA-WEN WANG
BOUNDS ON THE MAP THRESHOLD OF ITERATIVE DECODING SYSTEMS WITH ERASURE NOISE A Thesis by CHIA-WEN WANG Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the
More informationExplicit overall risk minimization transductive bound
1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,
More informationIntegrality ratio for Group Steiner Trees and Directed Steiner Trees
Integraity ratio for Group Steiner Trees and Directed Steiner Trees Eran Haperin Guy Kortsarz Robert Krauthgamer Aravind Srinivasan Nan Wang Abstract The natura reaxation for the Group Steiner Tree probem,
More informationLOW-density parity-check (LDPC) codes were invented
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 1, JANUARY 2008 51 Extremal Problems of Information Combining Yibo Jiang, Alexei Ashikhmin, Member, IEEE, Ralf Koetter, Senior Member, IEEE, and Andrew
More informationPerformance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels
Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering
More informationNOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS
NOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS TONY ALLEN, EMILY GEBHARDT, AND ADAM KLUBALL 3 ADVISOR: DR. TIFFANY KOLBA 4 Abstract. The phenomenon of noise-induced stabiization occurs
More informationThe Streaming-DMT of Fading Channels
The Streaming-DMT of Fading Channes Ashish Khisti Member, IEEE, and Star C. Draper Member, IEEE arxiv:30.80v3 cs.it] Aug 04 Abstract We consider the sequentia transmission of a stream of messages over
More informationBayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?
Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine
More informationOn Achievable Rates and Complexity of LDPC Codes over Parallel Channels: Bounds and Applications
On Achievable Rates and Complexity of LDPC Codes over Parallel Channels: Bounds and Applications Igal Sason, Member and Gil Wiechman, Graduate Student Member Abstract A variety of communication scenarios
More informationC. Fourier Sine Series Overview
12 PHILIP D. LOEWEN C. Fourier Sine Series Overview Let some constant > be given. The symboic form of the FSS Eigenvaue probem combines an ordinary differentia equation (ODE) on the interva (, ) with a
More informationA Novel Learning Method for Elman Neural Network Using Local Search
Neura Information Processing Letters and Reviews Vo. 11, No. 8, August 2007 LETTER A Nove Learning Method for Eman Neura Networ Using Loca Search Facuty of Engineering, Toyama University, Gofuu 3190 Toyama
More information