Search results for "Hardware"

showing 10 items of 1372 documents

Continuous Monitoring of Parasitic Elements in Boost Converter Circuit

2021

The given paper explains the necessity of condition monitoring for DC/DC boost converter circuit. Further, an analytical model of circuit parasitic estimation is presented based on measured quantities in the circuit. The implementation of continuous estimation of circuit parasitic elements is analytically explained and verified by simulations and experimental results. Obtained results are acceptable for condition monitoring.

Computer Science::Hardware ArchitectureComputer Science::Emerging TechnologiesComputer scienceControl theoryContinuous monitoringBoost converterHardware_INTEGRATEDCIRCUITSCondition monitoringHardware_PERFORMANCEANDRELIABILITYMinificationMultiplexing2021 IEEE 12th Energy Conversion Congress & Exposition - Asia (ECCE-Asia)
researchProduct

Multiprocessor SoC Implementation of Neural Network Training on FPGA

2008

Software implementations of artificial neural networks (ANNs) and their training on a sequential processor are inefficient because they do not take advantage of parallelism. ASIC and FPGA implementations employ specific hardware structures to exploit parallelism in order to improve processing speed; however, optimizing resource usage requires the use of fixed-point arithmetic, thereby losing precision, and the final system is restricted to a particular network topology. This paper presents a mixed approach based on a multiprocessor system-on-chip (SoC) on a FPGA. The use of software-driven embedded microprocessors with custom floating-point extensions for ANN related functions allows for gr…

Computer Science::Hardware ArchitectureComputer architectureApplication-specific integrated circuitComputer scienceControl reconfigurationSystem on a chipMultiprocessingField-programmable gate arrayNetwork topologyFixed-point arithmeticFPGA prototype2008 International Conference on Advances in Electronics and Micro-electronics
researchProduct

A Communication-Aware Topological Mapping Technique for NoCs

2008

Networks---on---Chip (NoCs) have been proposed as a promising solution to the complex on-chip communication problems derived from the increasing number of processor cores. The design of NoCs involves several key issues, being the topological mapping (the mapping of the Intellectual Properties (IPs) to network nodes) one of them. Several proposals have been focused on topological mapping last years, but they require the experimental validation of each mapping considered. In this paper, we propose a communication-aware topological mapping technique for NoCs. This technique is based on the experimental correlation of the network model with the actual network performance, thus avoiding the need…

Computer Science::Hardware ArchitectureComputer scienceNode (networking)Distributed computingNetwork performanceTopological mappingEnergy consumptionNetwork topologyNetwork model
researchProduct

Analysis of Interconnected Earthing Systems of MV/LV Substations in Urban Areas

2008

The paper proposes a study of the fault current distribution in an extended interconnection of earthing systems, belonging to secondary substations, during a single-line-to-earth fault. By applying the analysis methodology defined by the same authors in some previous works, the paper shows how the value of some important geometrical and electrical parameters of a MV network can influence the value of the earth current at the fault location.

Computer Science::Hardware ArchitectureInterconnectionEngineeringDistance measurementGroundbusiness.industryElectrical engineeringEarthing systembusinessFault (power engineering)
researchProduct

Domain-Knowledge Optimized Simulated Annealing for Network-on-Chip Application Mapping

2013

Network-on-Chip architectures are scalable on-chip interconnection networks. They replace the inefficient shared buses and are suitable for multicore and manycore systems. This paper presents an Optimized Simulated Annealing (OSA) algorithm for the Network-on-Chip application mapping problem. With OSA, the cores are implicitly and dynamically clustered using knowledge about communication demands. We show that OSA is a more feasible Simulated Annealing approach to NoC application mapping by comparing it with a general Simulated Annealing algorithm and a Branch and Bound algorithm, too. Using real applications we show that OSA is significantly faster than a general Simulated Annealing, withou…

Computer Science::Hardware ArchitectureInterconnectionMulti-core processorNetwork on a chipBranch and boundComputer scienceScalabilitySimulated annealingComputer Science::Networking and Internet ArchitectureParallel computingAdaptive simulated annealingCluster analysis
researchProduct

Upport vector machines for nonlinear kernel ARMA system identification.

2006

Nonlinear system identification based on support vector machines (SVM) has been usually addressed by means of the standard SVM regression (SVR), which can be seen as an implicit nonlinear autoregressive and moving average (ARMA) model in some reproducing kernel Hilbert space (RKHS). The proposal of this letter is twofold. First, the explicit consideration of an ARMA model in an RKHS (SVM-ARMA 2k) is proposed. We show that stating the ARMA equations in an RKHS leads to solving the regularized normal equations in that RKHS, in terms of the autocorrelation and cross correlation of the (nonlinearly) transformed input and output discrete time processes. Second, a general class of SVM-based syste…

Computer Science::Machine LearningStatistics::TheoryComputer Networks and CommunicationsBiomedical signal processingInformation Storage and RetrievalMachine learningcomputer.software_genrePattern Recognition AutomatedStatistics::Machine LearningArtificial IntelligenceApplied mathematicsStatistics::MethodologyAutoregressive–moving-average modelComputer SimulationMathematicsTelecomunicacionesHardware_MEMORYSTRUCTURESSupport vector machinesModels StatisticalNonlinear system identificationbusiness.industryAutocorrelationSystem identificationSignal Processing Computer-AssistedGeneral MedicineComputer Science ApplicationsSupport vector machineNonlinear systemKernelAutoregressive modelNonlinear DynamicsARMA modelling3325 Tecnología de las TelecomunicacionesArtificial intelligenceNeural Networks ComputerbusinesscomputerSoftwareAlgorithmsReproducing kernel Hilbert spaceIEEE transactions on neural networks
researchProduct

Automatic construction of test sets: Theoretical approach

2005

We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS constr…

Computer Science::PerformanceComputer scienceProperty (programming)Simple (abstract algebra)Completeness (order theory)Test setComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSComputer Science::Networking and Internet ArchitectureComputer Science::Programming LanguagesInternal variableArithmeticHardware_LOGICDESIGNTest (assessment)
researchProduct

Restoration of Videos Degraded by Local Isoplanatism Effects in the Near-Infrared Domain

2008

When observing a scene horizontally at a long distance in the near-infrared domain, degradations due to atmospheric turbulence often occur. In our previous work, we presented two hybrid methods to restore videos degraded by such local perturbations. These restoration algorithms take advantages of a space-time Wiener filter and a space-time regularization by the Laplacian operator. Wiener and Laplacian regularization results are mixed differently depending on the distance between the current pixel and the nearest edge point. It was shown that a gradation between Wiener and Laplacian areas improves results quality, so that only the algorithm using a gradation will be used in this article. In …

Computer engineering. Computer hardwareComputer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONRegularization (mathematics)Image (mathematics)Local degradationAdaptive restorationTK7885-7895symbols.namesakeSegmentationComputer visionPixelbusiness.industryWiener filterAtmospheric turbulenceImage and Video ProcessingVideo SurveillanceQA75.5-76.95Video processingElectronic computers. Computer sciencesymbolsGradationComputer Vision and Pattern RecognitionArtificial intelligenceAutomatic segmentationbusinessLaplace operatorSoftwareELCVIA: electronic letters on computer vision and image analysis
researchProduct

Extension of luminance component based demosaicking algorithm to 4- and 5-band multispectral images

2021

Abstract Multispectral imaging systems are currently expanding with a variety of multispectral demosaicking algorithms. But these algorithms have limitations due to the remarkable presence of artifacts in the reconstructed image. In this paper, we propose a powerful multispectral image demosaicking method that focuses on the G band and luminance component. We've first identified a relevant 4-and 5-band multispectral filter array (MSFA) with the dominant G band and then proposed an algorithm that consistently estimates the missing G values and other missing components using a convolution operator and a weighted bilinear interpolation algorithm based on the luminance component. Using the cons…

Computer engineering. Computer hardwareDemosaicingDemosaicking algorithmComputer scienceMultispectral imageBilinear interpolationQA75.5-76.95General MedicineExtension (predicate logic)Filter (signal processing)Multispectral filter arrayLuminanceConvolutionTK7885-7895G bandElectronic computers. Computer scienceComponent (UML)Weighted bilinear interpolationLuminance componentAlgorithmArray
researchProduct

Non-Model Based Method for an Automation of 3D Acquisition and Post-Processing

2008

Most of the automation for 3D acquisition concerns objects with simple shape, like mechanical parts. For cultural heritage artefacts, the process is more complex, and it doesn't exist general solution nowadays. This paper presents a method to generate a complete 3D model of cultural heritage artefacts. In a first step, MVC is used to solve the view planning problem. Then, holes remaining in 3D model are detected, and their features are calculated to finish acquisition. Different post-processing are applied on each view to increase quality of the 3D model. This procedure has been tested with simulated scanner, before being implemented on a motion system with five degrees of freedom.

Computer engineering. Computer hardwareEngineering drawingScannerScanners automationComputer sciencemedia_common.quotation_subjectBéns del patrimoni culturalDegrees of freedom (mechanics)TK7885-7895Adquisició de 3DSimple (abstract algebra)view planningAutomatització de ScannersView planningQuality (business)scanners automationmedia_commonbusiness.industryAutomatización de ScannersProcess (computing)Adquisición de 3Dcultural heritage artefactsQA75.5-76.95Bienes del patrimonio culturalPlanificación de VistaAutomationCultural heritageElectronic computers. Computer scienceCultural heritage artefactsComputer Vision and Pattern RecognitionPlanificació de Vistabusiness3D acquisitionSoftwareMotion systemELCVIA Electronic Letters on Computer Vision and Image Analysis
researchProduct