scholarly journals FPGA implementation of new LM-SPIHT colored image compression with reduced complexity and low memory requirement compatible for 5G

Author(s):  
Yasmine M. Tabra ◽  
Bayan Mahdi Sabbar

<span lang="EN-US">The revolution in 5G mobile systems require changes to how image is handled. These changes are represented by the required processing time, the amount of space for uploading and downloading. In this paper, a development on WT (Wavelet Transform) along with LM-SPIHT (Listless-Modified Set Partitioning in Hierarchical tree) coding and with additional level of Runlength encoding for image compression has been proposed. The new implementation reduces the amount of data needed to be stored in several stages, also the amount of time required for processing. The compression has been implemented using VHDL (Very High Descriptive Language) on netFPGA-1G-CLM Kintex-7 board. The new implementation results show a reduction in the complexity as processing time.</span>

2012 ◽  
Vol E95.B (9) ◽  
pp. 2906-2913
Author(s):  
Farid GHANI ◽  
Abdul KADER ◽  
Ekram KHAN ◽  
Badlishah AHMAD

2001 ◽  
Vol 35 (4) ◽  
pp. 33-45 ◽  
Author(s):  
Peter Hogarth

Between 23rd and 25th July 2001 GeoSwath, a high specification shallow water wide swath bathymetry system, was used to survey the entire Portsmouth NH Harbor area. This paper deals with the results of this survey, illustrating the potential for significant reductions in the high costs, which have prevented widespread proliferation of Swath Bathymetry systems to date. Data, including a complete DTM gridded to 1 m resolution, will be presented and discussed in detail. These results show that the system is very easy to set up and use, requires greatly reduced boat and processing time, whilst offering high accuracy and very high coverage and resolution when used in a real-world survey of a dynamic harbor environment.


2017 ◽  
Vol 6 (1) ◽  
pp. 1
Author(s):  
NI KADEK MAYULIANA ◽  
EKA N. KENCANA ◽  
LUH PUTU IDA HARINI

Genetic algorithm is a part of heuristic algorithm which can be applied to solve various computational problems. This work is directed to study the performance of the genetic algorithm (GA) to solve Multi Traveling Salesmen Problem (multi-TSP). GA is simulated to determine the shortest route for 5 to 10 salesmen who travelled 10 to 30 cities. The performance of this algorithm is studied based on the minimum distance and the processing time required for 10 repetitions for each of cities-salesmen combination. The result showed that the minimum distance and the processing time of the GA increase consistently whenever the number of cities to visit increase. In addition, different number of sales who visited certain number of cities proved significantly affect the running time of GA, but did not prove significantly affect the minimum distance.


2004 ◽  
Vol 120 ◽  
pp. 555-562
Author(s):  
D. Apelian ◽  
S. K. Chaudhury

Heat Treatment and post casting treatments of cast components has always been an important step in the control of microstructure, and resultant properties. In the past, the solutionizing, quenching and ageing process steps may have “required” in total over 20 hours of processing time. With the advent of fluidized bed reactors (FB), processing time has been dramatically reduced. For example, instead of 8-10 hours solutionizing time in a conventional furnace, the time required in FB is less than an hour. Experiments with Al-Si-Mg alloy, (both modified with Sr, and unmodified) were performed, having different diffusion distances (different DAS), and for different reaction times and temperatures. Both the model and the experimental results are presented and discussed.


Sign in / Sign up

Export Citation Format

Share Document