liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Real-Time Communication Systems based on Taut Strings
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering. Univ Vienna, Austria.
Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Faculty of Science & Engineering.
2018 (English)In: Journal of Communications and Networks, ISSN 1229-2370, E-ISSN 1976-5541, Vol. 20, no 2, p. 207-218Article in journal (Refereed) 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.

Place, publisher, year, edition, pages
IEEE, 2018. Vol. 20, no 2, p. 207-218
Keywords [en]
Buffers; distortion; real-time systems; source coding; taut string
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:liu:diva-148263DOI: 10.1109/JCN.2018.000027ISI: 000432478900009OAI: oai:DiVA.org:liu-148263DiVA, id: diva2:1213350
Note

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

Available from: 2018-06-04 Created: 2018-06-04 Last updated: 2018-06-21
In thesis
1. Taut Strings and Real Interpolation
Open this publication in new window or tab >>Taut Strings and Real Interpolation
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
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.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. p. 24
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1801
National Category
Mathematical Analysis
Identifiers
urn:nbn:se:liu:diva-132421 (URN)10.3384/diss.diva-132421 (DOI)9789176856499 (ISBN)
Public defence
2016-12-02, Nobel BL32, B-huset, Campus Valla, Linköping, 13:15 (English)
Opponent
Supervisors
Available from: 2016-11-10 Created: 2016-11-10 Last updated: 2018-06-21Bibliographically approved

Open Access in DiVA

fulltext(484 kB)31 downloads
File information
File name FULLTEXT01.pdfFile size 484 kBChecksum SHA-512
4aefeb48f3c1b2616aac51e5d4ad647efce9f3149cbc907cfe60b06c8f025d932a3d1d91f76b15c00d4ba44c36343a0fd4d8a241f35f5d231e0375b10cfb0224
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Setterqvist, EricForchheimer, Robert

Search in DiVA

By author/editor
Setterqvist, EricForchheimer, Robert
By organisation
Mathematics and Applied MathematicsFaculty of Science & EngineeringInformation Coding
In the same journal
Journal of Communications and Networks
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 31 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 1067 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf