Search results for "Telecommunication"

showing 10 items of 1769 documents

2017

Dielectric loaded surface plasmon waveguides (DLSPPWs) comprised of polymer ridges deposited on top of CMOS compatible metal thin films are investigated at telecom wavelengths. We perform a direct comparison of the properties of copper (Cu), aluminum (Al), titanium nitride (TiN) and gold (Au) based waveguides by implementing the same plasmonic waveguiding configuration for each metal. The DLSPPWs are characterized by leakage radiation microscopy and a fiber-to-fiber configuration mimicking the cut-back method. We introduce the ohmic loss rate (OLR) to analyze quantitatively the properties of the CMOS metal based DLSPPWs relative to the corresponding Au based waveguides. We show that the Cu,…

Materials sciencebusiness.industrySurface plasmonchemistry.chemical_element02 engineering and technologyDielectric021001 nanoscience & nanotechnology01 natural sciencesAtomic and Molecular Physics and Optics010309 opticsOpticsSemiconductorchemistry0103 physical sciencesSurface roughnessThin film0210 nano-technologyTelecommunicationsbusinessTinOhmic contactPlasmonOptics Express
researchProduct

Broadband asymmetric transmission of THz radiation through double metallic gratings

2013

We analyse numerically and experimentally the asymmetric transmission through sub-wavelength double metallic gratings. The possibility of achieving a broadband unidirectional transmission of THz waves through the grating is confirmed. The proposed gratings allow for efficient one-way transmission in the wavelength range from 2.5 to 3.5 mm.

Materials sciencebusiness.industryWavelength rangeTerahertz radiationPhysics::OpticsGratingOpticsTransmission (telecommunications)Thz radiationThz wavesBroadbandOptoelectronicsPhysics::Atomic PhysicsbusinessDiffraction grating2013 15th International Conference on Transparent Optical Networks (ICTON)
researchProduct

Intelligent Multi-Start Methods

2018

Heuristic search procedures aimed at finding globally optimal solutions to hard combinatorial optimization problems usually require some type of diversification to overcome local optimality. One way to achieve diversification is to re-start the procedure from a new solution once a region has been explored, which constitutes a multi-start procedure. In this chapter we describe the best known multi-start methods for solving optimization problems. We also describe their connections with other metaheuristic methodologies. We propose classifying these methods in terms of their use of randomization, memory and degree of rebuild. We also present a computational comparison of these methods on solvi…

Mathematical optimization021103 operations researchOptimization problemDegree (graph theory)Computer sciencemedia_common.quotation_subject0211 other engineering and technologiesCombinatorial optimization problem020206 networking & telecommunications02 engineering and technologyDiversification (marketing strategy)0202 electrical engineering electronic engineering information engineeringQuality (business)Metaheuristicmedia_common
researchProduct

On Equivalent Random Traffic method extension

2011

The key result of the paper is the Equivalent Random Traffic (ERT) method extension for estimation of the throughput for schemes with traffic splitting. The excellent accuracy (relative error is less than 1%) is shown in numerical example. A numerical algorithm is given — how to estimate the throughput for schemes at traffic splitting and merging. The paper also contains new Erlang-B formula algorithm for non-integer number of channels based on parabolic approximation.

Mathematical optimizationApproximation errorTelecommunication channelsNumerical analysisComputer Science::Networking and Internet ArchitectureKey (cryptography)Integrated opticsExtension (predicate logic)Throughput (business)Erlang (unit)AlgorithmMathematics2011 Baltic Congress on Future Internet and Communications
researchProduct

Resource allocation for OFDMA systems with multi-cell joint transmission

2012

This paper considers the downlink resource allocation of a coordinated multi-cell cluster in OFDMA systems with universal frequency reuse. Multi-cell joint transmission is considered via zero-forcing precoding. Furthermore, joint optimization of the user selection and power allocation across multiple subchannels and multiple cells is studied. The objective is to maximize the weighted sum rate under per-base-station power constraints. Based on general duality theory, two iterative resource allocation algorithms are proposed and compared with the optimal solution, which requires an exhaustive search of all possible combinations of users over all subchannels. Simulation results show that the t…

Mathematical optimizationComputational complexity theoryComputer scienceOrthogonal frequency-division multiplexingIterative methodTelecommunications linkBrute-force searchPrecodingScheduling (computing)Power control2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
researchProduct

Explicit Recursive and Adaptive Filtering in Reproducing Kernel Hilbert Spaces

2014

This brief presents a methodology to develop recursive filters in reproducing kernel Hilbert spaces. Unlike previous approaches that exploit the kernel trick on filtered and then mapped samples, we explicitly define the model recursivity in the Hilbert space. For that, we exploit some properties of functional analysis and recursive computation of dot products without the need of preimaging or a training dataset. We illustrate the feasibility of the methodology in the particular case of the $\gamma$ -filter, which is an infinite impulse response filter with controlled stability and memory depth. Different algorithmic formulations emerge from the signal model. Experiments in chaotic and elect…

Mathematical optimizationComputer Networks and Communications02 engineering and technologyautoregressive and moving-averagekernel methodssymbols.namesakeArtificial Intelligence0202 electrical engineering electronic engineering information engineeringKernel adaptive filterInfinite impulse responseMathematicsfilterrecursiveHilbert space020206 networking & telecommunicationsFilter (signal processing)AdaptiveComputer Science ApplicationsAdaptive filterKernel methodKernel (statistics)symbols020201 artificial intelligence & image processingAlgorithmSoftwareReproducing kernel Hilbert spaceIEEE Transactions on Neural Networks and Learning Systems
researchProduct

Partial joint processing with efficient backhauling using particle swarm optimization

2012

In cellular communication systems with frequency reuse factor of one, user terminals (UT) at the cell-edge are prone to intercell interference. Joint processing is one of the coordinated multipoint transmission techniques proposed to mitigate this interference. In the case of centralized joint processing, the channel state information fed back by the users need to be available at the central coordination node for precoding. The precoding weights (with the user data) need to be available at the corresponding base stations to serve the UTs. These increase the backhaul traffic. In this article, partial joint processing (PJP) is considered as a general framework that allows reducing the amount …

Mathematical optimizationComputer Networks and CommunicationsComputer scienceReal-time computingSignal-to-interference-plus-noise ratio02 engineering and technologycoordinated multipointPrecodingFrequency reusejoint processingBase station0203 mechanical engineering0202 electrical engineering electronic engineering information engineeringZero-forcing precodingComunicació i tecnologiaprecodingOther Electrical Engineering Electronic Engineering Information Engineeringparticle swarm optimizationComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSParticle swarm optimization020206 networking & telecommunications020302 automobile design & engineeringstochastic optimizationComputer Science ApplicationsBackhaul (telecommunications)Channel state informationSignal ProcessingTelecommunicationsStochastic optimizationEURASIP Journal on Wireless Communications and Networking
researchProduct

Quasi-nash equilibria for non-convex distributed power allocation games in cognitive radios

2013

In this paper, we consider a sensing-based spectrum sharing scenario in cognitive radio networks where the overall objective is to maximize the sum-rate of each cognitive radio user by optimizing jointly both the detection operation based on sensing and the power allocation, taking into account the influence of the sensing accuracy and the interference limitation to the primary users. The resulting optimization problem for each cognitive user is non-convex, thus leading to a non-convex game, which presents a new challenge when analyzing the equilibria of this game where each cognitive user represents a player. In order to deal with the non-convexity of the game, we use a new relaxed equilib…

Mathematical optimizationComputer Science::Computer Science and Game TheoryOptimization problemApplied MathematicsDistributed power020302 automobile design & engineering020206 networking & telecommunications02 engineering and technologyComputer Science ApplicationsTelecomunicaciósymbols.namesakeCognitive radio0203 mechanical engineeringNash equilibriumVariational inequality0202 electrical engineering electronic engineering information engineeringsymbolsLinear independenceElectrical and Electronic EngineeringPerformance improvementInterior point methodMathematicsIEEE Transactions on Wireless Communications
researchProduct

Optimization of two-step batch processes and the method of compensation for random error

2012

This paper considers the problem of the optimal setting of controllable variables in two-step processes with quality constraints. The optimal setting minimizes the cost and satisfies quality constraints defined for the final output. The main emphasis is given to processes where it is possible to make intermediate measurements after the first processing step and to utilize these measurements before the control variables in the second step are set. Optimization based on this method of compensation for random error can yield substantially lower cost than does optimization based on a strategy where all variables are fixed before the process starts. An example of application of the method is tak…

Mathematical optimizationComputer scienceApplied Mathematicsmedia_common.quotation_subjectTwo stepEmphasis (telecommunications)Process (computing)Control variableAnalytical ChemistryCompensation (engineering)Set (abstract data type)Random errorQuality (business)media_commonJournal of Chemometrics
researchProduct

A new strategy for effective learning in population Monte Carlo sampling

2016

In this work, we focus on advancing the theory and practice of a class of Monte Carlo methods, population Monte Carlo (PMC) sampling, for dealing with inference problems with static parameters. We devise a new method for efficient adaptive learning from past samples and weights to construct improved proposal functions. It is based on assuming that, at each iteration, there is an intermediate target and that this target is gradually getting closer to the true one. Computer simulations show and confirm the improvement of the proposed strategy compared to the traditional PMC method on a simple considered scenario.

Mathematical optimizationComputer scienceMonte Carlo methodInference02 engineering and technology01 natural sciencesHybrid Monte Carlo010104 statistics & probabilitysymbols.namesake[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing0202 electrical engineering electronic engineering information engineeringQuasi-Monte Carlo methodKinetic Monte Carlo0101 mathematicsComputingMilieux_MISCELLANEOUSbusiness.industryRejection samplingSampling (statistics)020206 networking & telecommunicationsMarkov chain Monte CarloDynamic Monte Carlo methodsymbolsMonte Carlo integrationMonte Carlo method in statistical physicsArtificial intelligenceParticle filterbusiness[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingMonte Carlo molecular modeling
researchProduct