Extremal Problems of Information Combining
|
|
- Blaise Ezra Wilcox
- 6 years ago
- Views:
Transcription
1 Extreml Problems of Informtion Combining Yibo Jing, Alexei Ashikhmin, Rlf Koetter, nd Andrew C Singer Coordinted Science Lbortory University of Illinois t Urbn-Chmpign, Urbn, IL 680, USA Emil: {yjing, koetter, csinger}@uiucedu Bell Lbortories, Lucent Technologies 600 Mountin Avenue, Murry Hill, NJ 07974, USA Emil: e@reserchbell-lbscom Abstrct In this pper we study moments of soft-bits of binry-input symmetric-output chnnels nd solve some extreml problems of the moments We use these results to solve the extreml informtion combining problem Further, we extend the informtion combining problem by dding constrint on the second moment of soft-bits, nd find the extreme distributions for this new problem I INTRODUCTION The extrinsic informtion trnsfer (EXIT) chrt method [] hs proven useful in prctice, for exmple, in the design of low-density prity-check (LDPC) codes [2], nd simple since it trcks only one prmeter, nmely mutul informtion It is usully ssumed tht priori informtion is conditionlly Gussin distributed In the belief propgtion decoding of LDPC codes [3], however, the distributions of messges re often non-gussin Therefore, the EXIT chrt method only provides n pproximtion to the rel decoding trjectory Thus it is worthwhile to conduct more rigorous nlysis Bounds on the extrinsic mutul informtion t either vrible node decoder (VND) or check node decoder (CND) will be useful nd led to upper nd lower bounds on the decoding trjectory of mutul informtion This motivtes the study of informtion combining problems The notion of informtion combining ws introduced by Huettinger et l in [4], [5] for the study of conctented coding systems In prticulr, in the belief propgtion decoding of LDPC codes, the processings t vrible nd check nodes cn be interpreted s opertions of informtion combining, ie combining the mutul informtion contined messges incoming to node Let (X,,X d ) be codeword of either [d, ] repetition code or [d, d ] single prity-check code, which models degree d vrible node or degree d check node respectively Assume d 3 to void trivil cses Assume X i is binry phse shift keying (BPSK) modulted under the mpping 0 + nd, nd trnsmitted through binry-input symmetric-output chnnel with output Y i, i d, ie p(y i = y X i =)=p(y i = y X i = ) These d chnnels re ssumed to be independent The nottion X i Y i is used to indicte the i-th chnnel The soft-bit T i for the i-th chnnel is defined s T i = p(x i = Y i ) p(x i = Y i ), nd is sufficient sttistic Although the trnsition probbility distribution of ech chnnel is unknown, the mutul informtion of ech chnnel is ssumed to be known Without loss of generlity, one cn focus on X d nd sk the following question: cn we find tight lower nd upper bounds on the combined informtion I(X d ; Y,Y 2,,Y d ), ie the extrinsic mutul informtion? Such n extreml problem ws first considered in [6] for [3, ] repetition code It ws shown tht I(X 3 ; Y,Y 2 ) is mximized (or minimized) when both X Y nd X 2 Y 2 re binry ersure chnnels (BECs) (or binry symmetric chnnels (BSCs)) with prescribed mutul informtion vlues In [7], the cse of [3, 2] single pritycheck codes ws studied, nd it ws shown tht BSCs chieve the upper bound, nd BECs chieve the lower bound In [8], [9], [0], [] the bove results were extended to rbitrry codeword length d for both repetition codes nd single pritycheck codes In [6], [7], [8], [9], the extrinsic mutul informtion I(X d ; Y,Y 2,,Y d ) is optimized over ll chnnels subject to their individul mutul informtion constrints In [0], [], the problems were generlized by optimizing with respect to single chnnel Fix the trnsition probbility distributions of X i Y i, i d 2 nd fix the mutul informtion of X d Y d It ws shown in [] tht for repetition code, when X d Y d is BEC (BSC), the extrinsic mutul informtion I(X d ; Y,Y 2,,Y d ) is mximized (minimized) For single prity-check code, the roles of BEC nd BSC re reversed All the results bove were obtined by proving new mutul informtion inequlities nd using vrious existing inequlities nd identities of mutul informtion The work by Shron et l, [2], [3], provides frmework of the moments of soft-bits nd expresses both the mutul informtion of binry-input symmetric-output chnnel nd the extrinsic mutul informtion of [d, d ] single prity-check code s serieses of moments of chnnel soft-bits In this pper, we study vrious properties of the moments nd moment sequences We prove tht mong ll binry-input symmetric-output chnnels with fixed mutul informtion, the BSC (BEC) mximizes (minimizes) the second moment of chnnel soft-bits We lso determine the ordering between the moment sequences of BSC (or BEC) nd ny other chnnel By using the properties of the moment sequences, we solve
2 the extreml informtion combining problem t the check nodes proposed in [] Lter, we extend the problem by dding constrint on the second moment of chnnel softbits It is lso solved by moments pproch, nd the best nd worst chnnel distributions in the sense of mximizing nd minimizing the extrinsic mutul informtion re determined The following nottions re used in this pper Underscores denote vectors The symbol y [j] is used to denote the vector obtined by deleting the j-th element of y Subscript b nd w stnd for best nd worst, respectively All proofs re omitted due to the limittion of spce II T-CONSISTENCY AND MUTUAL INFORMATION In [2], [3], the concept of T-consistency nd some relted mutul informtion results were proposed We give short summry for completeness Let X nd Y be rndom vribles t the input nd output of binry-input symmetric-output chnnel respectively, with trnsition probbility density function f stisfying f Y X (Y X =)=f Y X ( Y X = ) Define the chnnel soft-bit T s T = Pr(X = Y ) Pr(X = Y ) It is esy to see tht T =(e L )/(e L +)=tnh(l/2) where L is the log-likelihood-rtio (LLR) It ws shown in [3] tht the conditionl probbility density p(t X) stisfies p(t = t X =)=p(t = t X =) +t t, () nd p(t = t X =)=p(t = t X = ) Such rndom vrible is clled T-consistent For BSC chnnel with cpcity I, its T vrible tkes two vlues { 2h [ I], 2h [ I] }, where h[x] = x log 2 x ( x)log 2 ( x) is the binry entropy function nd h [x] [0, 05] For BEC chnnel, its T vrible lwys tkes three vlues {, 0, } Assume X is n equiprobble binry rndom vrible The mutul informtion between X nd T is [2], [3] + I(X; T )= log 2 ( + t)p(t = t X =)dt = (2) ln 2 2i(2i ) m 2i, where m 2i = + Note tht 0 m 2i nd ln 2 t 2i p(t = t X =)dt (3) 2i(2i ) =log 2( + t) t= =, therefore the right-hnd-side of Eq (2) is convergent We point out tht the singulrity of log 2 ( + t) t t = does not ffect the integrl (2) since one knows p(t = X =)=0from () Consider n [n, k] binry liner code Its codeword is BPSK modulted nd trnsmitted through n binry-input symmetricoutput independent chnnels Let x nd y indicte the input nd output vector The extrinsic soft-bit for X j posteriori probbility (APP) decoder is defined s of n T E,j = Pr(X j = Y [j] ) Pr(X j = Y [j] ) (4) Let c 0 be the ll-zero codeword It is shown [3] tht T E,j is T-consistent nd p(t E,j = t X j =)=p(t E,j = t c 0 trnsmitted) (5) Furthermore, for n [n, n ] single prity-check code, T E,j = n k=,k j T k where T k = Pr(X k = Y k ) Pr(X k = Y k ) Thus the extrinsic mutul informtion is I E,j = I(X j ; T E,j ) = ln 2 2i(2i ) n k=,k j E[T 2i k X k =] III TCHEBYCHEFF SYSTEM Tchebycheff system (T-system) theory is used to solve extreml problems of moments For completeness, we give n introduction to some of the key concepts nd results of T-system theory For <bfinite nd rel, set of rel continuous functions {u i (t)} n i=0 defined on [, b] is clled T-system [4], [5] if every nontrivil rel liner combintion n i=0 iu i (t) hs t most n distinct zeros in [, b] It is esy to show tht {u i (t)} n i=0 is T-system if nd only if the determinnt u 0 (t 0 ) u 0 (t ) u 0 (t n ) u (t 0 ) u (t ) u (t n ) det (7) u n (t 0 ) u n (t ) u n (t n ) does not vnish whenever t 0 <t < <t n b Since the determinnt (7) is continuous function of t i,itis equivlent to require tht the determinnt (7) mintins fixed strict sign Without loss of generlity, in [5], [4], {u i (t)} n i=0 is clled T-system if the determinnt (7) is strictly positive whenever t 0 <t < <t n b Let us introduce the concept of distribution [4, p5] on [, b] A distribution is nondecresing, right-continuous (except t the left endpoint) function For distribution σ(t), the mss t point ξ (, b] is σ(ξ) σ(ξ 0), nd the mss t the left endpoint is σ( +0) σ(), where σ(ξ 0) nd σ( +0) indicte the left nd right limits respectively Note tht distribution is not necessrily probbility distribution (totl mss on [, b] is, ie dσ =) The moment spce M n+ induced by the T-system {u i (t)} n i=0 is { } M n+ = (c 0,,c n ) c i = u i (t)dσ(t), 0 i n (8) where σ goes through the set of ll vlid distributions Geometriclly, M n+ is closed convex cone Assume c = {c k } n 0 M n+ Define set V (c) to be V (c) ={σ u i(t)dσ(t) =c i, 0 i n} In generl, V (c) contins either one distribution (if nd only if c is boundry point of M n+ ) or infinitely mny distributions (if nd only if c is n interior point of M n+ (denoted by c IntM n+ )) Assume {u i (t)} n i=0 is T-system Let σ be distribution in V (c) Ifσ(t) hs finitely mny points of increse t < (6)
3 t 2 < <t m b, the representtion for c becomes m c i = u i (t)dσ(t) = ρ k u i (t k ), 0 i n, (9) k= where ρ k is the mss t the point t k The points {t k } m re clled roots of the representtion (9), nd σ(t) is clled the distribution ssocited with the representtion (9) As in [4], n index function ɛ(t) is defined s ɛ(t) =2for <t<b, nd ɛ() = ɛ(b) = The index of the representtion (9) is defined s the sum m k= ɛ(t k) Now we introduce two importnt concepts, cnonicl representtion nd principle representtion If the index of representtion is n +2,the representtion is sid to be cnonicl If the index is n +, the representtion is sid to be principle Furthermore, if cnonicl (principle) representtion hs root t b, it is further clled n upper cnonicl (principle) representtion On the other hnd, if b is not root, it is clled lower cnonicl (principle) representtion From [5, Coro 3, Sec II3] or [4, Theorem 5, Sec III5], it is true tht Theorem : For ech c IntM n+, there exists exctly one lower principle representtion nd exctly one upper principle representtion The roots of these two representtions strictly interlce Theorem 2: (p77 of [4], p45 of [5]): The roots of lower nd upper principle representtions hve the following properties () for n odd (n =2q ): lower principle representtion: ll mss is concentrted t q interior points of [, b], ie <t <t 2 < <t q < b; upper principle representtion: ll mss is concentrted t q interior points of [, b], nd t both endpoints, b, ie = s <s 2 < <s q <s q+ = b (2) for n even (n =2q): lower principle representtion: ll mss is concentrted t q interior points of [, b], nd t the endpoint, ie = t <t 2 < <t q+ <b; upper principle representtion: ll mss is concentrted t q interior points of [, b], nd t the endpoint b, ie <s <s 2 < <s q <s q+ = b Let Ω(t) be continuous function Define u n+ (t) =Ω(t) Theorem 3: ([4, Theorem, Sec IV], [5, Theorem, Sec III]): Let c IntM n+ If both {u i (t)} n i=0 nd the ugmented system {u i(t)} n+ i=0 re T- systems, mx Ω(t)dσ(t) is ttined uniquely for the distribution σ ssocited with the upper principle σ V (c) representtion of c, nd min σ V (c) Ω(t)dσ(t) is ttined uniquely for the distribution σ ssocited with the lower principle representtion of c It is remrkble tht s long s the ugmented system {u i (t)} n+ i=0 is T-system, the mximizing nd the minimizing distributions (σ nd σ ) re independent of the function Ω(t) IV THE EXTREMAL INFORMATION COMBINING PROBLEM In this section, we re focusing on the type of extreml problems of informtion combining proposed in [] Let us first consider check node with degree d One cn tret such node s [d, d ] single prity-check code Its codeword is BPSK modulted Let x nd y stnd for BPSK-modulted codeword nd chnnel output vector respectively All chnnels X i Y i re binry-input symmetric-output, ie T-consistent, but not necessrily hve the sme distribution The chnnels re independent, ie p(y x) = d p(y i x i ) Without loss of generlity, the extreml problem of informtion combining t check node cn be stted s follows Problem : Fix the chnnels X i Y i, i d 2 Find T-consistent probbility densities P b nd P w for X d Y d tht mximize nd minimize the extrinsic mutul informtion I(X d ; T E,d ) respectively, subject to I(X d ; T d )= I d Let p(t) p(t d = t X d =)nd p(t) should be T- consistent, ie p(t) = p( t)( + t)/( t) In the constrint I d = I(X d ; T d ), where the right-hnd-side is relted to p(t) by (2), one cn see the integrnd log( + t) is not continuous on [, ] One knows T-system theory requires ll the integrnd functions to be continuous on closed intervl Thus we use the T-consistency of p(t) to trnsform the integrnd into continuous function First, p(t) is mpped into new density ˆp(t) on [0, ] ˆp(t) = Then one obtins { p(t)+p( t) =p(t)2/( + t), t (0, ] p(0), t =0 + (0) I d = I(X d ; T d )= ( h[( t)/2])ˆp(t)dt 0 = ln 2 2i(2i ) m 2i () where m 2i = + 0 t 2i ˆp(t)dt Note tht h[( t)/2] is continuous function on [0, ] Another merit of (0) is tht the T-consistency requirement on p(t) is utomticlly tken into ccount in () Define β 2i = d 2 2i k= E[Tk X k =], from (6), one obtins I E,d = I(X d ; T E,d )= ln 2 2i(2i ) β 2im 2i (2) Fix β 2i for i The extreml informtion combining problem t the check node cn be reformulted s: subject to (), determine the best or worst densities of ˆp such tht I E,d (2) is mximized or minimized respectively In wht follows we will show tht the extreme densities for this optimiztion problem re exctly the densities corresponding to the extreme distributions of the following one Problem 2: Among ll probbility distributions on [0, ] which stisfy the constrint (), determine the probbility distribution σ b (σ w ) which mximizes (minimizes) the 2nd moment m 2
4 T-system theory is perfect tool to solve it Let u 0 (t), u (t) h[( t)/2], Ω(t) t 2 nd c (,I d ) We prove tht Lemm : Both {u 0,u } nd the ugmented system {u 0,u, Ω} re T-systems on [0, ] V (c) ={σ 0 u i(t)dσ(t) =c i,i=0, } is the set of distributions which re probbility distributions nd stisfy () By Theorem 3 one concludes tht the distribution σ ssocited with the upper principle representtion of c mximizes m 2, thus σ w = σ The distribution σ ssocited with the lower principle representtion of c minimizes m 2, thus σ b = σ According to Theorem 2, since n =is odd, q =,ll probbility mss of σ b concentrtes t n interior point t, nd ll probbility mss of σ w concentrtes t two endpoints {0, } By solving () for σ b, ie u (t )=I d, one cn obtin t = 2h [ I d ] According to (0), the T-consistent distribution corresponding to σ b hs probbility mss of ( + t )/2 t t nd probbility mss of ( t )/2 t t This exctly corresponds to BSC chnnel with cpcity I d Similrly, for σ w, one cn esily obtin tht the probbility mss t is I d The T-consistent distribution corresponding to σ w hs probbility mss of I d t, nd probbility mss of I d t 0 This exctly corresponds to BEC chnnel with cpcity I d Thus we conclude tht Theorem 4: Among binry-input symmetric-output chnnels with fixed mutul informtion, BSC (BEC) mximizes (minimizes) m 2 Lemm 2: A moment sequence {m 2i } hs the following properties: ) {m 2i } is nonincresing; 2) The rtio sequence {r 2i = m2i m 2i+2 } is nonincresing For BSC, its moment sequence {m b,2i = t 2i } is geometric sequence For BEC, its moment sequence {m w,2i = I d } is constnt sequence Using these fcts, Theorem 4, Lemm 2 nd the constrint (), we show tht Lemm 3: There re two possible types of ordering for the moment sequence {m b,2i } of BSC nd the moment sequence {m σ,2i } for ny non-bsc σ V (c) ) m b,2i >m σ,2i for i<i 0, nd m b,2i <m σ,2i for i i 0 ; 2) m b,2i >m σ,2i for i<i 0, m b,2i0 = m σ,2i0 nd m b,2i <m σ,2i for i>i 0 ; where i 0 is n integer depending on σ Similrly, we cn show Lemm 4: There re two possible types of ordering for the moment sequence {m w,2i } of BEC nd the moment sequence {m σ,2i } for ny non-bec σ V (c) ) m σ,2i >m w,2i for i<i, nd m σ,2i <m w,2i for i i ; 2) m σ,2i >m w,2i for i<i, m σ,2i = m w,2i nd m σ,2i <m w,2i for i>i, where i is n integer depending on σ The following lemm is useful We prove tht Lemm 5: Assume i > 0 for i, b b 2 b i 0 For sequences {x i }, {y i} which stisfy ) x i 0, y i 0, fori ; 2) ix i = iy i ; 3) x i >y i for i k, nd x i <y i for i>k, it is true tht ib i x i ib i y i Using Lemm 3, Lemm 4, Lemm 5, () nd (2), we conclude tht subject to the mutul informtion constrint (), BSC mximizes nd BEC minimizes I E,d (2), ie P b =BSC nd P w =BEC As pointed out before, they re lso the extreme distributions with respect to optimizing m 2 For the cse [7] where the distribution of ech chnnel is llowed to vry subject to mutul informtion constrint, one cn esily conclude tht when ll of them re BSCs (BECs), the extrinsic mutul informtion is mximized (minimized) For the extreml informtion combining problem t the vrible nodes, by Lemm 3 [, SecIV], one cn conclude tht BEC nd BSC re the mximizer nd minimizer respectively V EXTENSION OF THE ORIGINAL EXTREMAL INFORMATION COMBINING PROBLEM We consider n extension of the originl extreml informtion combining problem by dding constrint on the 2nd moment m 2 Problem 3: Fix the chnnels X i Y i, i d 2 Find T-consistent probbility densities P b nd P w for X d Y d tht mximize nd minimize the extrinsic mutul informtion I(X d ; T E,d ) respectively, subject to constrints: I(X d ; T d )=I d ; m 2 = θ The motivtion for considering this problem is to obtin smller gp between mximized nd minimized I E,d compred to Problem First we gin consider different optimiztion problem Lter we will show tht the solution to the following problem leds to the solution of Problem 3 by tking n inverse mpping of (0) Problem 4: Among ll probbility distributions on [0, ] which stisfy the constrint () nd m 2 = θ, determine the probbility distribution σ b ( σ w ) which mximizes (minimizes) the 4th moment m 4 Agin, we use T-system theory Define u 0 (t), u (t) t 2, u 2 (t) h[( t)/2], Ω(t) t 4 nd c (,θ,i d ) We prove tht Lemm 6: Both {u 0,u,u 2 } nd the ugmented system {u 0,u,u 2, Ω} re T-systems on [0, ] V (c) = {σ 0 u i(t)dσ(t) = c i,i= 0,, 2} is set of distributions which re probbility distributions nd stisfy both () nd m 2 = θ By Theorem 3 one concludes tht the distribution σ ssocited with the upper principle representtion of c mximizes m 4, thus σ w = σ The distribution σ ssocited with the lower principle representtion of c minimizes m 4, thus σ b = σ
5 According to Theorem 2, since n = 2 is even, q =, ll probbility mss of σ b concentrtes t two points {0,t } where t is n interior point, nd ll probbility mss of σ w concentrtes t two points {s, } where 0 s t The T-consistent density P 4,b corresponding to σ b hs probbility mss of p 0 t 0, probbility mss of p t t nd probbility mss of p 0 p t t From the constrints nd the distribution structure, we cn determine tht t = f ( Id θ ) h[( x)/2], where f(x) = x 2, p = θ ( + t ) 2t 2, p 0 = 2p +t Similrly, the T-consistent density P 4,w corresponding to σ w s hs probbility mss of p t s, probbility mss of p +s t s nd probbility mss of p 2 t From the constrints nd the distribution structure, we cn determine tht ( ) s = g Id h[( x)/2], where g(x) = θ x 2, θ p = 2( s ), p 2 = θ s2 s 2 In summry, we hve Lemm 7: Among binry-input symmetric-output chnnels with fixed mutul informtion nd fixed m 2, the chnnel corresponding to P 4,b (P 4,w ) mximizes (minimizes) m 4 Observe tht the moment sequence { m b,2i of the best density P 4,b is geometric sequence Along with Lemm 2, Lemm 7 nd (), we show tht Lemm 8: There re two possible types of ordering for the moment sequence { m b,2i } of P 4,b nd the moment sequence {m σ,2i } of ny non-p 4,b σ V (c) ) m b,2i >m σ,2i for 2 i i 0, nd m b,2i <m σ,2i for i>i 0 ; 2) m b,2i >m σ,2i for 2 i<i 0, m b,2i0 = m σ,2i0 nd m b,2i <m σ,2i for i>i 0 ; where i 0 is n integer depending on σ Obviously m b,2 = m σ,2 = θ Although its proof is quite complex, we still cn show Lemm 9: There re two possible types of ordering for the moment sequence { m w,2i } of P 4,w nd the moment sequence {m σ,2i } of ny non-p 4,w σ V (c) ) m σ,2i > m w,2i for 2 i i, nd m σ,2i < m w,2i for i>i ; 2) m σ,2i > m w,2i for 2 i<i, m σ,2i = m w,2i nd m σ,2i < m w,2i for i>i ; where i is n integer depending on σ Obviously m w,2 = m σ,2 = θ By Lemm 8, Lemm 9, Lemm 5, we cn conclude tht subject to the mutul informtion constrint () nd m 2 = θ, the distributions P 4,b nd P 4,w mximize nd minimize the extrinsic mutul informtion I E,d respectively Thus s pointed out before, Pb = P 4,b nd P w = P 4,w Extended to the cse where the distribution of ech chnnel is llowed to vry subject to () nd m 2 = θ constrints, = θt 2i 2 } it is not difficult to see tht when ll of the chnnels re of the type of P b (with pproprite prmeters), the extrinsic mutul informtion is mximized Similrly, when ll of the chnnels re of the type of P w (with pproprite prmeters), the extrinsic mutul informtion is minimized In [6], we use the results of this section to bound the CND EXIT functions with Gussin priors, nd s prt of procedure which computes (potentilly) improved overll best nd worst performnce bounds on the mutul informtion trjectory of the belief propgtion decoding of LDPC codes VI CONCLUSIONS In this pper, we showed tht BSC (BEC) mximizes (minimizes) m 2 mong ll binry-input symmetric-output chnnels with fixed mutul informtion We lso proved some ordering properties of moment sequences We solved both the originl nd extended extreml problems of informtion combining Ongoing nd future work includes finding more pplictions for the extension problem, considering more complicted codes nd chnnels REFERENCES [] S ten Brink, Convergence behvior of itertively decoded prllel conctented codes, IEEE Trns Commun, vol 49, no 0, pp , Oct 200 [2] S ten Brink, G Krmer, nd A Ashikhmin, Design of low-density prity-check codes for modultion nd detection, IEEE Trns Commun, vol 52, no 4, pp , Apr 2004 [3] T Richrdson nd R Urbnke, The cpcity of low-density pritycheck codes under messge-pssing decoding, IEEE Trns Inform Theory, vol 47, no 2, pp , Feb 200 [4] S Huettinger, J Huber, R Johnnesson, nd R Fischer, Informtion processing in soft-output decoding, in Proc Allerton Conf on Communictions, Control, nd Computing, Monticello, IL, Oct 200 [5] S Huettinger, J Huber, R Fischer, nd R Johnnesson, Soft-outputdecoding: Some spects from informtion theory, in Proc Int ITG Conf on Source nd Chnnel Coding, Berlin, Germny, Jn 2002, pp 8 90 [6] I Lnd, S Huettinger, P A Hoeher, nd J Huber, Bounds on informtion combining, in Proc Int Symp on Turbo Codes & Rel Topics, Brest, Frnce, Sept 2003, pp [7], Bounds on informtion combining, IEEE Trns Inform Theory, vol 5, no 2, pp 62 69, Feb 2005 [8] I Lnd, P A Hoeher, nd J Huber, Bounds on informtion combining for prity-check equtions, in Proc Int Zurich Seminr on Communictions (IZS), Zurich, Switzerlnd, Feb 2004, pp 68 7 [9] I Lnd, S Huettinger, P A Hoeher, nd J Huber, Bounds on mutul informtion for simple codes using informtion combining, Annls of Telecomm, Jn 2005, ccepted for publiction [0] I Sutskover, S Shmi, nd J Ziv, Extremes of informtion combining, in Proceedings of the 4st Annul Allerton Conference on Communictions, Conrol nd Computing, Monticello, IL, Oct 2003, pp [], Extremes of informtion combining, IEEE Trns Inform Theory, vol 5, no 4, pp , Apr 2005 [2] E Shron, A Ashikhmin, nd S Litsyn, EXIT functions for the Gussin chnnel, in Proceedings of 4st Annul Allerton Conference on Communiction, Control nd Computing, Monticello, Illinois, Oct 2003, pp [3], EXIT functions for continuous chnnels: Prt I Constituent codes, IEEE Trns Commun, submitted for publiction, 2004 [4] M G Krein nd A A Nudel mn, The Mrkov Moment Problem nd Extreml Problems Providence, Rhode Islnd: Americn Mthemticl Society, 977 [5] S Krlin nd W J Studden, Tchebycheff Systems: with Applictions in Anlysis nd Sttistics New York: Interscience Publishers, 966 [6] Y Jing, A Ashikhmin, R Koetter, nd A C Singer, Extreml problems of informtion combining, 2005, in preprtion
X Z Y Table 1: Possibles values for Y = XZ. 1, p
ECE 534: Elements of Informtion Theory, Fll 00 Homework 7 Solutions ll by Kenneth Plcio Bus October 4, 00. Problem 7.3. Binry multiplier chnnel () Consider the chnnel Y = XZ, where X nd Z re independent
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 information1 1D heat and wave equations on a finite interval
1 1D het nd wve equtions on finite intervl In this section we consider generl method of seprtion of vribles nd its pplictions to solving het eqution nd wve eqution on finite intervl ( 1, 2. Since by trnsltion
More informationTutorial 4. b a. h(f) = a b a ln 1. b a dx = ln(b a) nats = log(b a) bits. = ln λ + 1 nats. = log e λ bits. = ln 1 2 ln λ + 1. nats. = ln 2e. bits.
Tutoril 4 Exercises on Differentil Entropy. Evlute the differentil entropy h(x) f ln f for the following: () The uniform distribution, f(x) b. (b) The exponentil density, f(x) λe λx, x 0. (c) The Lplce
More informationDefinite integral. Mathematics FRDIS MENDELU
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová Brno 1 Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function defined on [, b]. Wht is the re of the
More informationGeneralized Fano and non-fano networks
Generlized Fno nd non-fno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationDefinite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová (Mendel University) Definite integrl MENDELU / Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function
More informationContinuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationChapter 5 : Continuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 216 Néhémy Lim Chpter 5 : Continuous Rndom Vribles Nottions. N {, 1, 2,...}, set of nturl numbers (i.e. ll nonnegtive integers); N {1, 2,...}, set of ll
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationCalculus of Variations
Clculus of Vritions Com S 477/577 Notes) Yn-Bin Ji Dec 4, 2017 1 Introduction A functionl ssigns rel number to ech function or curve) in some clss. One might sy tht functionl is function of nother function
More informationLecture 14: Quadrature
Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
More information1.2. Linear Variable Coefficient Equations. y + b "! = a y + b " Remark: The case b = 0 and a non-constant can be solved with the same idea as above.
1 12 Liner Vrible Coefficient Equtions Section Objective(s): Review: Constnt Coefficient Equtions Solving Vrible Coefficient Equtions The Integrting Fctor Method The Bernoulli Eqution 121 Review: Constnt
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More information221B Lecture Notes WKB Method
Clssicl Limit B Lecture Notes WKB Method Hmilton Jcobi Eqution We strt from the Schrödinger eqution for single prticle in potentil i h t ψ x, t = [ ] h m + V x ψ x, t. We cn rewrite this eqution by using
More informationPre-Session Review. Part 1: Basic Algebra; Linear Functions and Graphs
Pre-Session Review Prt 1: Bsic Algebr; Liner Functions nd Grphs A. Generl Review nd Introduction to Algebr Hierrchy of Arithmetic Opertions Opertions in ny expression re performed in the following order:
More informationSOME PROPERTIES OF CHEBYSHEV SYSTEMS
SOME PROPERTIES OF CHEBYSHEV SYSTEMS RICHARD A. ZALIK Abstrct. We study Chebyshev systems defined on n intervl, whose constituent functions re either complex or rel vlued, nd focus on problems tht my hve
More information. Double-angle formulas. Your answer should involve trig functions of θ, and not of 2θ. sin 2 (θ) =
Review of some needed Trig. Identities for Integrtion. Your nswers should be n ngle in RADIANS. rccos( 1 ) = π rccos( - 1 ) = 2π 2 3 2 3 rcsin( 1 ) = π rcsin( - 1 ) = -π 2 6 2 6 Cn you do similr problems?
More information13: Diffusion in 2 Energy Groups
3: Diffusion in Energy Groups B. Rouben McMster University Course EP 4D3/6D3 Nucler Rector Anlysis (Rector Physics) 5 Sept.-Dec. 5 September Contents We study the diffusion eqution in two energy groups
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationCalculus of Variations: The Direct Approach
Clculus of Vritions: The Direct Approch Lecture by Andrejs Treibergs, Notes by Bryn Wilson June 7, 2010 The originl lecture slides re vilble online t: http://www.mth.uth.edu/~treiberg/directmethodslides.pdf
More information4. Calculus of Variations
4. Clculus of Vritions Introduction - Typicl Problems The clculus of vritions generlises the theory of mxim nd minim. Exmple (): Shortest distnce between two points. On given surfce (e.g. plne), nd the
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationNote 16. Stokes theorem Differential Geometry, 2005
Note 16. Stokes theorem ifferentil Geometry, 2005 Stokes theorem is the centrl result in the theory of integrtion on mnifolds. It gives the reltion between exterior differentition (see Note 14) nd integrtion
More informationARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac
REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationThe Wave Equation I. MA 436 Kurt Bryan
1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string
More informationNOTE ON TRACES OF MATRIX PRODUCTS INVOLVING INVERSES OF POSITIVE DEFINITE ONES
Journl of pplied themtics nd Computtionl echnics 208, 7(), 29-36.mcm.pcz.pl p-issn 2299-9965 DOI: 0.752/jmcm.208..03 e-issn 2353-0588 NOE ON RCES OF RIX PRODUCS INVOLVING INVERSES OF POSIIVE DEFINIE ONES
More information21.6 Green Functions for First Order Equations
21.6 Green Functions for First Order Equtions Consider the first order inhomogeneous eqution subject to homogeneous initil condition, B[y] y() = 0. The Green function G( ξ) is defined s the solution to
More informationSummary: Method of Separation of Variables
Physics 246 Electricity nd Mgnetism I, Fll 26, Lecture 22 1 Summry: Method of Seprtion of Vribles 1. Seprtion of Vribles in Crtesin Coordintes 2. Fourier Series Suggested Reding: Griffiths: Chpter 3, Section
More informationVariational Techniques for Sturm-Liouville Eigenvalue Problems
Vritionl Techniques for Sturm-Liouville Eigenvlue Problems Vlerie Cormni Deprtment of Mthemtics nd Sttistics University of Nebrsk, Lincoln Lincoln, NE 68588 Emil: vcormni@mth.unl.edu Rolf Ryhm Deprtment
More informationMatrices, Moments and Quadrature, cont d
Jim Lmbers MAT 285 Summer Session 2015-16 Lecture 2 Notes Mtrices, Moments nd Qudrture, cont d We hve described how Jcobi mtrices cn be used to compute nodes nd weights for Gussin qudrture rules for generl
More informationMapping the delta function and other Radon measures
Mpping the delt function nd other Rdon mesures Notes for Mth583A, Fll 2008 November 25, 2008 Rdon mesures Consider continuous function f on the rel line with sclr vlues. It is sid to hve bounded support
More informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More informationMath Advanced Calculus II
Mth 452 - Advnced Clculus II Line Integrls nd Green s Theorem The min gol of this chpter is to prove Stoke s theorem, which is the multivrible version of the fundmentl theorem of clculus. We will be focused
More informationLecture notes. Fundamental inequalities: techniques and applications
Lecture notes Fundmentl inequlities: techniques nd pplictions Mnh Hong Duong Mthemtics Institute, University of Wrwick Emil: m.h.duong@wrwick.c.uk Februry 8, 207 2 Abstrct Inequlities re ubiquitous in
More information. Double-angle formulas. Your answer should involve trig functions of θ, and not of 2θ. cos(2θ) = sin(2θ) =.
Review of some needed Trig Identities for Integrtion Your nswers should be n ngle in RADIANS rccos( 1 2 ) = rccos( - 1 2 ) = rcsin( 1 2 ) = rcsin( - 1 2 ) = Cn you do similr problems? Review of Bsic Concepts
More informationAMATH 731: Applied Functional Analysis Fall Some basics of integral equations
AMATH 731: Applied Functionl Anlysis Fll 2009 1 Introduction Some bsics of integrl equtions An integrl eqution is n eqution in which the unknown function u(t) ppers under n integrl sign, e.g., K(t, s)u(s)
More informationNotes on length and conformal metrics
Notes on length nd conforml metrics We recll how to mesure the Eucliden distnce of n rc in the plne. Let α : [, b] R 2 be smooth (C ) rc. Tht is α(t) (x(t), y(t)) where x(t) nd y(t) re smooth rel vlued
More informationA HELLY THEOREM FOR FUNCTIONS WITH VALUES IN METRIC SPACES. 1. Introduction
Ttr Mt. Mth. Publ. 44 (29), 159 168 DOI: 1.2478/v1127-9-56-z t m Mthemticl Publictions A HELLY THEOREM FOR FUNCTIONS WITH VALUES IN METRIC SPACES Miloslv Duchoň Peter Mličký ABSTRACT. We present Helly
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More informationLecture 21: Order statistics
Lecture : Order sttistics Suppose we hve N mesurements of sclr, x i =, N Tke ll mesurements nd sort them into scending order x x x 3 x N Define the mesured running integrl S N (x) = 0 for x < x = i/n for
More informationS. S. Dragomir. 2, we have the inequality. b a
Bull Koren Mth Soc 005 No pp 3 30 SOME COMPANIONS OF OSTROWSKI S INEQUALITY FOR ABSOLUTELY CONTINUOUS FUNCTIONS AND APPLICATIONS S S Drgomir Abstrct Compnions of Ostrowski s integrl ineulity for bsolutely
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationJim Lambers MAT 169 Fall Semester Lecture 4 Notes
Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of
More informationThe First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).
The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples
More informationIN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A2 IN GAUSSIAN INTEGERS X + Y = Z HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH Elis Lmpkis Lmpropoulou (Term), Kiprissi, T.K: 24500,
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which
More information3.4 Numerical integration
3.4. Numericl integrtion 63 3.4 Numericl integrtion In mny economic pplictions it is necessry to compute the definite integrl of relvlued function f with respect to "weight" function w over n intervl [,
More informationNumerical Integration
Chpter 5 Numericl Integrtion Numericl integrtion is the study of how the numericl vlue of n integrl cn be found. Methods of function pproximtion discussed in Chpter??, i.e., function pproximtion vi the
More informationMA 124 January 18, Derivatives are. Integrals are.
MA 124 Jnury 18, 2018 Prof PB s one-minute introduction to clculus Derivtives re. Integrls re. In Clculus 1, we lern limits, derivtives, some pplictions of derivtives, indefinite integrls, definite integrls,
More informationx = b a N. (13-1) The set of points used to subdivide the range [a, b] (see Fig. 13.1) is
Jnury 28, 2002 13. The Integrl The concept of integrtion, nd the motivtion for developing this concept, were described in the previous chpter. Now we must define the integrl, crefully nd completely. According
More informationIntegral points on the rational curve
Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin - Mrinette 750 W. Byshore Street Mrinette, WI 5443-453 Also: Konstntine Zeltor P.O. Box
More information440-2 Geometry/Topology: Differentiable Manifolds Northwestern University Solutions of Practice Problems for Final Exam
440-2 Geometry/Topology: Differentible Mnifolds Northwestern University Solutions of Prctice Problems for Finl Exm 1) Using the cnonicl covering of RP n by {U α } 0 α n, where U α = {[x 0 : : x n ] RP
More informationAbstract inner product spaces
WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationSolution for Assignment 1 : Intro to Probability and Statistics, PAC learning
Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (
More informationMath& 152 Section Integration by Parts
Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible
More informationarxiv:math/ v2 [math.ho] 16 Dec 2003
rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,
More informationNumerical integration
2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter
More information221A Lecture Notes WKB Method
A Lecture Notes WKB Method Hmilton Jcobi Eqution We strt from the Schrödinger eqution for single prticle in potentil i h t ψ x, t = [ ] h m + V x ψ x, t. We cn rewrite this eqution by using ψ x, t = e
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 information1.9 C 2 inner variations
46 CHAPTER 1. INDIRECT METHODS 1.9 C 2 inner vritions So fr, we hve restricted ttention to liner vritions. These re vritions of the form vx; ǫ = ux + ǫφx where φ is in some liner perturbtion clss P, for
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationNumerical Analysis: Trapezoidal and Simpson s Rule
nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =
More informationIndefinite Integral. Chapter Integration - reverse of differentiation
Chpter Indefinite Integrl Most of the mthemticl opertions hve inverse opertions. The inverse opertion of differentition is clled integrtion. For exmple, describing process t the given moment knowing the
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More informationProperties of the Riemann Integral
Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University Februry 15, 2018 Outline 1 Some Infimum nd Supremum Properties 2
More informationAn instructive toy model: two paradoxes
Tel Aviv University, 2006 Gussin rndom vectors 27 3 Level crossings... the fmous ice formul, undoubtedly one of the most importnt results in the ppliction of smooth stochstic processes..j. Adler nd J.E.
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationConservation Law. Chapter Goal. 5.2 Theory
Chpter 5 Conservtion Lw 5.1 Gol Our long term gol is to understnd how mny mthemticl models re derived. We study how certin quntity chnges with time in given region (sptil domin). We first derive the very
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationMain topics for the First Midterm
Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the
More informationResearch Article Moment Inequalities and Complete Moment Convergence
Hindwi Publishing Corportion Journl of Inequlities nd Applictions Volume 2009, Article ID 271265, 14 pges doi:10.1155/2009/271265 Reserch Article Moment Inequlities nd Complete Moment Convergence Soo Hk
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1
MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further
More informationJoint distribution. Joint distribution. Marginal distributions. Joint distribution
Joint distribution To specify the joint distribution of n rndom vribles X 1,...,X n tht tke vlues in the smple spces E 1,...,E n we need probbility mesure, P, on E 1... E n = {(x 1,...,x n ) x i E i, i
More informationWHEN IS A FUNCTION NOT FLAT? 1. Introduction. {e 1 0, x = 0. f(x) =
WHEN IS A FUNCTION NOT FLAT? YIFEI PAN AND MEI WANG Abstrct. In this pper we prove unique continution property for vector vlued functions of one vrible stisfying certin differentil inequlity. Key words:
More informationLecture 19: Continuous Least Squares Approximation
Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationINDIAN INSTITUTE OF TECHNOLOGY BOMBAY MA205 Complex Analysis Autumn 2012
Lecture 6: Line Integrls INDIAN INSTITUTE OF TECHNOLOGY BOMBAY MA205 Complex Anlysis Autumn 2012 August 8, 2012 Lecture 6: Line Integrls Lecture 6: Line Integrls Lecture 6: Line Integrls Integrls of complex
More informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More informationTime Optimal Control of the Brockett Integrator
Milno (Itly) August 8 - September, 011 Time Optiml Control of the Brockett Integrtor S. Sinh Deprtment of Mthemtics, IIT Bomby, Mumbi, Indi (emil : sunnysphs4891@gmil.com) Abstrct: The Brockett integrtor
More informationINTRODUCTION TO LINEAR ALGEBRA
ME Applied Mthemtics for Mechnicl Engineers INTRODUCTION TO INEAR AGEBRA Mtrices nd Vectors Prof. Dr. Bülent E. Pltin Spring Sections & / ME Applied Mthemtics for Mechnicl Engineers INTRODUCTION TO INEAR
More informationMath 120 Answers for Homework 13
Mth 12 Answers for Homework 13 1. In this problem we will use the fct tht if m f(x M on n intervl [, b] (nd if f is integrble on [, b] then (* m(b f dx M(b. ( The function f(x = 1 + x 3 is n incresing
More informationLecture 4: Piecewise Cubic Interpolation
Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics - A Peirce UBC Lecture 4: Piecewise Cubic Interpoltion Compiled 5 September In this lecture we consider piecewise cubic interpoltion
More informationDefinition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim
Mth 9 Course Summry/Study Guide Fll, 2005 [1] Limits Definition of Limit: We sy tht L is the limit of f(x) s x pproches if f(x) gets closer nd closer to L s x gets closer nd closer to. We write lim f(x)
More informationINEQUALITIES FOR GENERALIZED WEIGHTED MEAN VALUES OF CONVEX FUNCTION
INEQUALITIES FOR GENERALIZED WEIGHTED MEAN VALUES OF CONVEX FUNCTION BAI-NI GUO AND FENG QI Abstrct. In the rticle, using the Tchebycheff s integrl inequlity, the suitble properties of double integrl nd
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More information