Iterative Source-Channel Coding Approach to Witsenhausen's Counterexample
2011 (English)In: Proceedings of the American Control Conference, NEW YORK: IEEE , 2011, 5348-5353 p.Conference paper (Refereed)
In 1968, Witsenhausen introduced his famous counterexample where he showed that even in the simple linear quadratic static team decision problem, complex nonlinear decisions could outperform any given linear decision. This problem has served as a benchmark problem for decades where researchers try to achieve the optimal solution. This paper introduces a systematic iterative source-channel coding approach to solve problems of the Witsenhausen Counterexample-character. The advantage of the presented approach is its simplicity. Also, no assumptions are made about the shape of the space of policies. The minimal cost obtatined using the introduced method is 0.16692462, which is the lowest known thus far.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2011. 5348-5353 p.
, Proceedings of the American Control Conference, ISSN 0743-1619
NOISY CHANNELS, QUANTIZATION, DESIGN
IdentifiersURN: urn:nbn:se:kth:diva-50907ISI: 000295376006061ScopusID: 2-s2.0-80053148886ISBN: 978-1-4577-0081-1OAI: oai:DiVA.org:kth-50907DiVA: diva2:463014
American Control Conference (ACC). San Fransisco, CA. JUN 29-JUL 01, 2011
FunderEU, FP7, Seventh Framework Programme, 223866ICT - The Next Generation
© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
QC 201112122012-01-022011-12-082012-01-03Bibliographically approved