Optimization of Information Rate Upper and Lower Bounds for Channels With Memory
-
Altmetric Citations
Sadeghi, Parastoo; Vontobel, Pascal; Shams, Ramtin
Description
We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial response channels, or they can have an infinite state space, such as time-varying fading channels. We optimize recently proposed information rate bounds for such channels, which make use of auxiliary finite-state machine channels (FSMCs). Our main contribution...[Show more]
dc.contributor.author | Sadeghi, Parastoo | |
---|---|---|
dc.contributor.author | Vontobel, Pascal | |
dc.contributor.author | Shams, Ramtin | |
dc.date.accessioned | 2015-12-10T22:15:27Z | |
dc.identifier.issn | 0018-9448 | |
dc.identifier.uri | http://hdl.handle.net/1885/50674 | |
dc.description.abstract | We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial response channels, or they can have an infinite state space, such as time-varying fading channels. We optimize recently proposed information rate bounds for such channels, which make use of auxiliary finite-state machine channels (FSMCs). Our main contribution in this paper is to provide iterative expectation-maximization (EM) type algorithms to optimize the parameters of the auxiliary FSMC to tighten these bounds. We provide an explicit, iterative algorithm that improves the upper bound at each iteration. We also provide an effective method for iteratively optimizing the lower bound. To demonstrate the effectiveness of our algorithms, we provide several examples of partial response and fading channels where the proposed optimization techniques significantly tighten the initial upper and lower bounds. Finally, we compare our results with results obtained by the conjugate gradient optimization algorithm and an improved variation of the simplex algorithm, called Soblex. While the computational complexities of our algorithms are similar to the conjugate gradient method and less than the Soblex algorithm, our algorithms robustly find the tightest bounds. Interestingly, from a channel coding/decoding perspective, optimizing the lower bound is related to increasing the achievable mismatched information rate, i.e., the information rate of a communication system where the decoder at the receiver is matched to the auxiliary channel, and not to the original channel. | |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE Inc) | |
dc.source | IEEE Transactions on Information Theory | |
dc.subject | Keywords: Algorithms; Approximation theory; Channel capacity; Communication systems; Conjugate gradient method; Contour followers; Control theory; Decoding; Fading (radio); Iterative methods; Optimization; Signal encoding; Finite-state machine channels; Information Finite-state machine channels; Information rate; Lower bounds; Mismatched decoding; Optimization; Stationary and ergodic channels; Upper bound | |
dc.title | Optimization of Information Rate Upper and Lower Bounds for Channels With Memory | |
dc.type | Journal article | |
local.description.notes | Imported from ARIES | |
local.identifier.citationvolume | 55 | |
dc.date.issued | 2009 | |
local.identifier.absfor | 080401 - Coding and Information Theory | |
local.identifier.ariespublication | u4334215xPUB208 | |
local.type.status | Published Version | |
local.contributor.affiliation | Sadeghi, Parastoo, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Vontobel, Pascal, Hewlett-Packard Laboratories | |
local.contributor.affiliation | Shams, Ramtin, College of Engineering and Computer Science, ANU | |
local.description.embargo | 2037-12-31 | |
local.bibliographicCitation.issue | 2 | |
local.bibliographicCitation.startpage | 663 | |
local.bibliographicCitation.lastpage | 688 | |
local.identifier.doi | 10.1109/TIT.2008.2009581 | |
dc.date.updated | 2016-02-24T10:59:06Z | |
local.identifier.scopusID | 2-s2.0-61349094791 | |
local.identifier.thomsonID | 000263375500016 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Sadeghi_Optimization_of_Information_2009.pdf | 604.31 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator