#### Filter Results:

#### Publication Year

2001

2008

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Following the same argument in Section IV, T = i i, we have the spectral entropy H(S) = 0 i i T log i T : Then the Campbell bandwidth is W c = (1=2)e H(S) , and we can say the Campbell bandwidth is the minimum average bandwidth for encoding the process across all possible distortion levels. IX. CONCLUSION We have presented two new derivations of the… (More)

—The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence , followed by a forward sum–product recursion on the joint source/channel trellis. This method is extended to compute upper and lower bounds on the information rate of very… (More)

— Efficient implementations of the sum-product algorithm (SPA) for decoding low-density parity-check (LDPC) codes using log-likelihood ratios (LLR) as messages between symbol and parity-check nodes are presented. Various reduced-complexity derivatives of the LLR-SPA are proposed. Both serial and parallel implementations are investigated , leading to trellis… (More)

—The classical Blahut–Arimoto algorithm (BAA) is a well-known algorithm that optimizes a discrete memoryless source (DMS) at the input of a discrete memoryless channel (DMC) in order to maximize the mutual information between channel input and output. This paper considers the problem of optimizing finite-state machine sources (FSMSs) at the input of… (More)

- ‹
- 1
- ›