Upper bounds on the capacity of discrete-time blockwise white Gaussian channels with feedback.
Han Wu ChenKenjiro YanagiPublished in: IEEE Trans. Inf. Theory (2000)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- tight bounds
- linear quadratic
- branch and bound algorithm
- channel state information
- usage statistics
- markov chain
- worst case
- multi channel
- lower and upper bounds
- special case
- efficiently computable
- gaussian distribution
- gaussian mixture model
- sample size
- relevance feedback
- upper bounding
- tight upper and lower bounds
- sample complexity
- impulse response
- permutation flowshop
- theoretical analysis
- scheduling problem