2012
DOI: 10.1049/iet-smt.2011.0158
|View full text |Cite
|
Sign up to set email alerts
|

Novel binary tree Huffman decoding algorithm and field programmable gate array implementation for terrestrial-digital multimedia broadcasting mobile handheld

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 6 publications
0
7
0
Order By: Relevance
“…7(b). The model use exactly the shape of Uljin #3, 4 nuclear power plant, however, as said before it can be parameterized to model other nuclear power plant which have the same shape with Uljin #3, 4 [20].…”
Section: Discussionmentioning
confidence: 99%
“…7(b). The model use exactly the shape of Uljin #3, 4 nuclear power plant, however, as said before it can be parameterized to model other nuclear power plant which have the same shape with Uljin #3, 4 [20].…”
Section: Discussionmentioning
confidence: 99%
“…These studies analyzed the relation of p-r-d, and developed an optimization approach to improve energy efficiency for handheld devices. [19] et al proposed an energy-efficient JPEG compression technique for wireless handheld devices that uses fast DCT computation to increase efficiency and maintain acceptable image quality. These works did not consider multicore-based handheld devices, but they did consider Image quality degradation according to compression rate.…”
Section: Quality-optimization Approachesmentioning
confidence: 99%
“…In computer science, a binary tree is a data structure widely used in searching algorithms. Computer networks [2], [3], compression [4], automatic control [5], [6], or cryptography [7] are some application areas of binary trees. Many examples of hardware implementations that perform searches on binary trees can be found in the literature.…”
Section: Introductionmentioning
confidence: 99%
“…Internet protocol (IP) address look-up engines for high-speed hardware routers are usually implemented by using binary trees [2]. Huffman decoders, which require to process binary trees, are implemented on hardware in order to speed up decompression algorithms [4]. In [3], a packet classifier based on a binary tree for network intrusion detection systems is proposed.…”
Section: Introductionmentioning
confidence: 99%