An iterative algorithm to construct optimal binary AIFV-m codes.
Hirosuke YamamotoKen-ichi IwataPublished in: ITW (2017)
Keyphrases
- dynamic programming
- computational complexity
- optimal solution
- worst case
- experimental evaluation
- cost function
- computationally efficient
- matching algorithm
- learning algorithm
- np hard
- detection algorithm
- computational cost
- high accuracy
- theoretical analysis
- optimization algorithm
- objective function
- times faster
- search space
- preprocessing
- significant improvement
- closed form
- exhaustive search
- globally optimal
- optimal parameters
- error correction
- locally optimal
- binary tree
- single pass
- optimal path
- non binary
- expectation maximization
- tree structure
- evolutionary algorithm
- particle swarm optimization