Low Complexity, High Efficiency Probability Model for Hyper-spectral Image Coding

Author(s):  
Francesc Auli-Llinas ◽  
Joan Bartrina-Rapesta ◽  
Joan Serra-Sagrista ◽  
Michael W. Marcellin
Author(s):  
Teresa V.V ◽  
Anand. B

Objective: In this research work presents an efficient way Carry Select Adder (CSLA) performance and estimation. The CSLA is utilized in several system to mitigate the issue of carry propagation delay that is happens by severally generating various carries and to get the sum, select a carry because of the uses of various pairs of RCA to provide the sum of the partial section also carry by consisting carry input but the CSLA isn't time economical, then by the multiplexers extreme total and carry is chosen in the selected section. Methodology: The fundamental plan of this work is to attain maximum speed and minimum power consumption by using Binary to Excess-1. Convertor rather than RCA within the regular CSLA. Here RCA denotes the Ripple Carry Adder section. At the span to more cut back the facility consumption, a method of CSLA with D LATCH is implemented during this research work. The look of Updated Efficient Area -Carry Select Adder (UEA-CSLA) is evaluated and intended in XILINX ISE design suite 14. 5 tools. This VLSI arrangement is utilized in picture preparing application by concluding the cerebrum tumor discovery. Conclusion: In this study, medicinal pictures estimation, investigation districts in the multi phantom picture isn't that much proficient to defeat this disadvantage here utilized hyper spectral picture method is presented a sifting procedure in VLSI innovation restriction of cerebrum tumor is performed Updated Efficient Area - Carry Select Adder propagation result dependent on Matrix Laboratory in the adaptation of R2018b.


2021 ◽  
Author(s):  
lingling zhang ◽  
baoguo yu ◽  
Chengkai Tang ◽  
yi zhang ◽  
Houbing Song

Abstract The growing scale of marine exploration requires high-resolution underwater localization, which necessitates cooperation among underwater network nodes, considering the channel complexity and power efficiency. In this paper, we proposed factor graph weight particles aided distributed underwater nodes cooperative positioning algorithm (WP-DUCP). It capitalized on the factor graph and sum-product algorithm to decompose the global optimization to the product of several local optimization functions. Combined with the Gaussian parameters to construct the weighted particles and to realize the belief transfer, it shows low complexity and high efficiency, suitable to the energy-restricted and communication distance-limited underwater networks. In terms of convergence, localization resolution, and computation complexity, we conducted the simulation and real-test with comparison to the existing co-localization methods. The results verified a higher resolution of the proposed method with no extra computation burden.


Author(s):  
Ibtissam Banit' ◽  
N.A. ouagua ◽  
Mounir Ait Kerroum ◽  
Ahmed Hammouch ◽  
Driss Aboutajdine

2016 ◽  
Vol 65 (2) ◽  
pp. 297-307 ◽  
Author(s):  
Khalid Al-Hussaini ◽  
Borhanuddin M. Ali ◽  
Pooria Varahram ◽  
Shaiful Jahari Hashim ◽  
Ronan Farrell

Sign in / Sign up

Export Citation Format

Share Document