liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Real-Time Communication Systems based on Taut Strings
Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska fakulteten. Univ Vienna, Austria.
Linköpings universitet, Institutionen för systemteknik, Informationskodning. Linköpings universitet, Tekniska fakulteten.
2018 (Engelska)Ingår i: Journal of Communications and Networks, ISSN 1229-2370, E-ISSN 1976-5541, Vol. 20, nr 2, s. 207-218Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

We consider buffered real-time communication over channels with time-dependent capacities which are known in advance. The real-time constraint is imposed in terms of limited transmission time between sender and receiver. For a network consisting of a single channel it is shown that there is a coding rate strategy, geometrically characterized as a taut string, which minimizes the average distortion with respect to all convex distortionrate functions. Utilizing the taut string characterization further, an algorithm that computes the optimal coding rate strategy is provided. We then consider more general networks with several connected channels in parallel or series with intermediate buffers. It is shown that also for these networks there is a coding rate strategy, geometrically characterized as a taut string, which minimizes the average distortion with respect to all convex distortion-rate functions. The optimal offline strategy provides a benchmark for the evaluation of different coding rate strategies. Further, it guides us in the construction of a simple but rather efficient strategy for channels in the online setting which alternates between a good and a bad state.

Ort, förlag, år, upplaga, sidor
IEEE, 2018. Vol. 20, nr 2, s. 207-218
Nyckelord [en]
Buffers; distortion; real-time systems; source coding; taut string
Nationell ämneskategori
Telekommunikation
Identifikatorer
URN: urn:nbn:se:liu:diva-148263DOI: 10.1109/JCN.2018.000027ISI: 000432478900009OAI: oai:DiVA.org:liu-148263DiVA, id: diva2:1213350
Anmärkning

Funding Agencies|Research School in Interdisciplinary Mathematics at Linkoping University; Swedish Research Council [2014-6230]

Tillgänglig från: 2018-06-04 Skapad: 2018-06-04 Senast uppdaterad: 2018-06-21
Ingår i avhandling
1. Taut Strings and Real Interpolation
Öppna denna publikation i ny flik eller fönster >>Taut Strings and Real Interpolation
2016 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

The taut string problem concerns finding the function with the shortest graph length, i.e. the taut string, in a certain set  of continuous piecewise linear functions. It has appeared in a broad range of applications including statistics, image processing and economics. As it turns out, the taut string has besides minimal graph length also minimal energy and minimal total variation among the functions in Ω.

The theory of real interpolation is based on Peetre’s K-functional. In terms of the K-functional, we introduce invariant K-minimal sets and show a close connection between taut strings and invariant K-minimal sets.

This insight leads to new problems of interpolation theory, gives possibility to generalize the notion of taut strings and provides new applications.

The thesis consists of four papers. In paper I, connections between invariant K-minimal sets and various forms of taut strings are investigated. It is shown that the set Ω′ of the derivatives of the functions in  can be interpreted as an invariant K-minimal set for the Banach couple (ℓ1, ℓ) on Rn. In particular, the derivative of the taut string has minimal K-functional in Ω′. A characterization of all bounded, closed and convex sets in Rn that are invariant K-minimal for (ℓ1, ℓ) is established.

Paper II presents examples of invariant K-minimal sets in Rn for (ℓ1, ℓ). A convergent algorithm for computing the element with minimal K-functional in such sets is given. In the infinite-dimensional setting, a sufficient condition for a set to be invariant K-minimal with respect to the Banach couple L1 ([0,1]m) ,L ([0,1]m) is established. With this condition at hand, different examples of invariant K-minimal sets for this couple are constructed.

Paper III considers an application of taut strings to buffered real-time communication systems. The optimal buffer management strategy, with respect to minimization of a class of convex distortion functions, is characterized in terms of a taut string. Further, an algorithm for computing the optimal buffer management strategy is provided.

In paper IV, infinite-dimensional taut strings are investigated in connection with the Wiener process. It is shown that the average energy per unit of time of the taut string in the long run converges, if it is constrained to stay within the distance r > 0 from the trajectory of a Wiener process, to a constant C2/r2 where C ∈ (0,∞). While the exact value of C is unknown, the numerical estimate C ≈ 0.63 is obtained through simulations on a super computer. These simulations are based on a certain algorithm for constructing finite-dimensional taut strings.

Ort, förlag, år, upplaga, sidor
Linköping: Linköping University Electronic Press, 2016. s. 24
Serie
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1801
Nationell ämneskategori
Matematisk analys
Identifikatorer
urn:nbn:se:liu:diva-132421 (URN)10.3384/diss.diva-132421 (DOI)9789176856499 (ISBN)
Disputation
2016-12-02, Nobel BL32, B-huset, Campus Valla, Linköping, 13:15 (Engelska)
Opponent
Handledare
Tillgänglig från: 2016-11-10 Skapad: 2016-11-10 Senast uppdaterad: 2019-10-29Bibliografiskt granskad

Open Access i DiVA

fulltext(484 kB)92 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 484 kBChecksumma SHA-512
4aefeb48f3c1b2616aac51e5d4ad647efce9f3149cbc907cfe60b06c8f025d932a3d1d91f76b15c00d4ba44c36343a0fd4d8a241f35f5d231e0375b10cfb0224
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltext

Personposter BETA

Setterqvist, EricForchheimer, Robert

Sök vidare i DiVA

Av författaren/redaktören
Setterqvist, EricForchheimer, Robert
Av organisationen
Matematik och tillämpad matematikTekniska fakultetenInformationskodning
I samma tidskrift
Journal of Communications and Networks
Telekommunikation

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 92 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 1172 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf