Randomized modulation of power converters via Markov chains

Stanković, A.M.; Verghese, George C.; Perreault, David J.

doi:10.1109/87.553665

Cited by 23 publications

(11 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since (m) P is irreducible for all m, it follows that X (m) constitutes an irreducible Markov chain for all m [6].…”

Section: Switching Synthesis With Markov Chainsmentioning

confidence: 99%

“…Analogous with the notion of truncated Markov chains with absorbing states [6], we propose a simplified model of Markov chains for random modulation.…”

Section: Switching Synthesis With Markov Chainsmentioning

confidence: 99%

“…The case of pulse trains specified by periodic Markov chains is denoted as ergodic cyclic [4], [5]. We assume that the state of the chain goes through a sequence of n classes of states C i , occupying a state in each class for an average time σ i , i = 1, ..., n. The time-average autocorrelation [6] of a random process f(t) is defined as:…”

Section: Switching Synthesis With Markov Chainsmentioning

confidence: 99%

“…The periodic Markov chain shown in figure 3, with six states divided to three classes, is an example of a solution to such a problem [6], [7]. A short (duration 3/4) and a long (duration 5/4) cycle is available in each of the four classes.…”

Section: Example Of Pulse Width Modulation Governed By Periodic Markomentioning

confidence: 99%

“…This approach has a few advantages: the randomized modulation of switching in power converters reduces filtering equipments and allows an explicit control in time domain performance. Randomized modulation is very effective for narrow band constraints [6]; therefore it is proper to be implemented into the command of the railway data transmitter for the traffic security. This paper is organized as follows: Section 2 describes the working principles of security railway data transmitter CN-75-6.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Reliability Markov Chains for Security Data Transmitter Analysis

Ciufudean

Satco

Filote

2007

The Second International Conference on Availability, Reliability and Security (ARES'07)

View full text Add to dashboard Cite

Security communication systems composed of highly reliable components may have few if any failures while undergoing heavy testing or field-usage. This paper combines (i) analysis of randomized pulse modulation schemes based on finite Markov chains with (ii) security communication systems failure as a rare event with a finite-state, discrete-parameter, recurrent Markov chain that models the failures. An application of these results would be (i) in the analysis of randomized pulse width modulation implemented into the command of the railway data transmitter for the traffic security, and (ii) in the analysis of these system`s reliability.

show abstract

“…Since (m) P is irreducible for all m, it follows that X (m) constitutes an irreducible Markov chain for all m [6].…”

Section: Switching Synthesis With Markov Chainsmentioning

confidence: 99%

“…Analogous with the notion of truncated Markov chains with absorbing states [6], we propose a simplified model of Markov chains for random modulation.…”

Section: Switching Synthesis With Markov Chainsmentioning

confidence: 99%