Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Power packet transferability via symbol propagation matrix
(Kyoto University)
KTH, Skolan för elektroteknik och datavetenskap (EECS).ORCID-id: 0000-0002-4266-6746
(Kyoto University)
2018 (engelsk)Inngår i: Proceedings of the Royal Society. Mathematical, Physical and Engineering Sciences, ISSN 1364-5021, E-ISSN 1471-2946, Vol. 474, nr 2213, artikkel-id 20170552Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

A power packet is a unit of electric power composed of a power pulse and an information tag. In Shannon’s information theory, messages are represented by symbol sequences in a digitized manner. Referring to this formulation, we define symbols in power packetization as a minimum unit of power transferred by a tagged pulse. Here, power is digitized and quantized. In this paper, we consider packetized power in networks for a finite duration, giving symbols and their energies to the networks. A network structure is defined using a graph whose nodes represent routers, sources and destinations. First, we introduce the concept of a symbol propagation matrix (SPM) in which symbols are transferred at links during unit times. Packetized power is described as a network flow in a spatio-temporal structure. Then, we study the problem of selecting an SPM in terms of transferability, that is, the possibility to represent given energies at sources and destinations during the finite duration. To select an SPM, we consider a network flow problem of packetized power. The problem is formulated as an M-convex submodular flow problem which is a solvable generalization of the minimum cost flow problem. Finally, through examples, we verify that this formulation provides reasonable packetized power.

sted, utgiver, år, opplag, sider
Royal Society Publishing , 2018. Vol. 474, nr 2213, artikkel-id 20170552
HSV kategori
Forskningsprogram
Elektro- och systemteknik
Identifikatorer
URN: urn:nbn:se:kth:diva-228464DOI: 10.1098/rspa.2017.0552ISI: 000433498800003Scopus ID: 2-s2.0-85047560728OAI: oai:DiVA.org:kth-228464DiVA, id: diva2:1209910
Merknad

QC 20180612

Tilgjengelig fra: 2018-05-24 Laget: 2018-05-24 Sist oppdatert: 2018-06-19bibliografisk kontrollert

Open Access i DiVA

fulltext(572 kB)21 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 572 kBChecksum SHA-512
85533c90da98e88a3f82fd0c66a8a154be97bedbb16f9f009b143438fe9bbfc7d39bb904a94df7a0a28d5869580bc0e8910a6faf79dc970850a8a7cb5f40065e
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Maki, Atsuto

Søk i DiVA

Av forfatter/redaktør
Maki, Atsuto
Av organisasjonen
I samme tidsskrift
Proceedings of the Royal Society. Mathematical, Physical and Engineering Sciences

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 21 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 60 treff
RefereraExporteraLink to record
Permanent link

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