ESVD: An Integrated Energy Scalable Framework for Low-Power Video Decoding Systems
Directory of Open Access Journals (Sweden)
Wen Ji
2010-01-01
Full Text Available Video applications using mobile wireless devices are a challenging task due to the limited capacity of batteries. The higher complex functionality of video decoding needs high resource requirements. Thus, power efficient control has become more critical design with devices integrating complex video processing techniques. Previous works on power efficient control in video decoding systems often aim at the low complexity design and not explicitly consider the scalable impact of subfunctions in decoding process, and seldom consider the relationship with the features of compressed video date. This paper is dedicated to developing an energy-scalable video decoding (ESVD strategy for energy-limited mobile terminals. First, ESVE can dynamically adapt the variable energy resources due to the device aware technique. Second, ESVD combines the decoder control with decoded data, through classifying the data into different partition profiles according to its characteristics. Third, it introduces utility theoretical analysis during the resource allocation process, so as to maximize the resource utilization. Finally, it adapts the energy resource as different energy budget and generates the scalable video decoding output under energy-limited systems. Experimental results demonstrate the efficiency of the proposed approach.
Gupta, Neha; Parihar, Priyanka; Neema, Vaibhav
2018-04-01
Researchers have proposed many circuit techniques to reduce leakage power dissipation in memory cells. If we want to reduce the overall power in the memory system, we have to work on the input circuitry of memory architecture i.e. row and column decoder. In this research work, low leakage power with a high speed row and column decoder for memory array application is designed and four new techniques are proposed. In this work, the comparison of cluster DECODER, body bias DECODER, source bias DECODER, and source coupling DECODER are designed and analyzed for memory array application. Simulation is performed for the comparative analysis of different DECODER design parameters at 180 nm GPDK technology file using the CADENCE tool. Simulation results show that the proposed source bias DECODER circuit technique decreases the leakage current by 99.92% and static energy by 99.92% at a supply voltage of 1.2 V. The proposed circuit also improves dynamic power dissipation by 5.69%, dynamic PDP/EDP 65.03% and delay 57.25% at 1.2 V supply voltage.
SWIPT in Multiuser MIMO Decode-and-Forward Relay Broadcasting Channel with Energy Harvesting Relays
Benkhelifa, Fatma; Salem, Ahmed Sultan; Alouini, Mohamed-Slim
2017-01-01
In this paper, we consider a multiuser multiple- input multiple-output (MIMO) decode-and-forward (DF) relay broadcasting channel (BC) with single source, multiple energy harvesting relays and multiple destinations. Since the end-to-end sum rate
SWIPT in Multiuser MIMO Decode-and-Forward Relay Broadcasting Channel with Energy Harvesting Relays
Benkhelifa, Fatma
2017-02-09
In this paper, we consider a multiuser multiple- input multiple-output (MIMO) decode-and-forward (DF) relay broadcasting channel (BC) with single source, multiple energy harvesting relays and multiple destinations. Since the end-to-end sum rate maximization problem is intractable, we tackle a simplified problem where we maximize the sum of the harvested energy at the relays, we employ the block diagonalization (BD) procedure at the source, and we mitigate the interference between the relay- destination channels. The interference mitigation at the destinations is managed in two ways: either to fix the interference covariance matrices at the destination and update them at each iteration until convergence, or to cancel the interference using an algorithm similar to the BD method. We provide numerical results to show the relevance of our proposed solution.
Energy transfer in contact binary systems
International Nuclear Information System (INIS)
Robertson, J.A.
1980-01-01
A simple model for the transfer of energy by steady circulation within the envelope of a contact binary system is presented. The model describes the fully compressible, two-dimensional flow of a perfect gas within a rectangular region in a uniform gravitational field. The region is heated non-uniformly from below. Coriolis forces are neglected but the interaction of the circulation with convection is discussed briefly. Numerical solutions of the linearized equations of the problem are discussed in detail, and the results of some non-linear calculations are also presented. The influence of alternative boundary conditions is examined. (author)
Energy Analysis of Decoders for Rakeness-Based Compressed Sensing of ECG Signals.
Pareschi, Fabio; Mangia, Mauro; Bortolotti, Daniele; Bartolini, Andrea; Benini, Luca; Rovatti, Riccardo; Setti, Gianluca
2017-12-01
In recent years, compressed sensing (CS) has proved to be effective in lowering the power consumption of sensing nodes in biomedical signal processing devices. This is due to the fact the CS is capable of reducing the amount of data to be transmitted to ensure correct reconstruction of the acquired waveforms. Rakeness-based CS has been introduced to further reduce the amount of transmitted data by exploiting the uneven distribution to the sensed signal energy. Yet, so far no thorough analysis exists on the impact of its adoption on CS decoder performance. The latter point is of great importance, since body-area sensor network architectures may include intermediate gateway nodes that receive and reconstruct signals to provide local services before relaying data to a remote server. In this paper, we fill this gap by showing that rakeness-based design also improves reconstruction performance. We quantify these findings in the case of ECG signals and when a variety of reconstruction algorithms are used either in a low-power microcontroller or a heterogeneous mobile computing platform.
Amino acid empirical contact energy definitions for fold recognition in the space of contact maps
Directory of Open Access Journals (Sweden)
Fogolari Federico
2003-02-01
Full Text Available Abstract Background Contradicting evidence has been presented in the literature concerning the effectiveness of empirical contact energies for fold recognition. Empirical contact energies are calculated on the basis of information available from selected protein structures, with respect to a defined reference state, according to the quasi-chemical approximation. Protein-solvent interactions are estimated from residue solvent accessibility. Results In the approach presented here, contact energies are derived from the potential of mean force theory, several definitions of contact are examined and their performance in fold recognition is evaluated on sets of decoy structures. The best definition of contact is tested, on a more realistic scenario, on all predictions including sidechains accepted in the CASP4 experiment. In 30 out of 35 cases the native structure is correctly recognized and best predictions are usually found among the 10 lowest energy predictions. Conclusion The definition of contact based on van der Waals radii of alpha carbon and side chain heavy atoms is seen to perform better than other definitions involving only alpha carbons, only beta carbons, all heavy atoms or only backbone atoms. An important prerequisite for the applicability of the approach is that the protein structure under study should not exhibit anomalous solvent accessibility, compared to soluble proteins whose structure is deposited in the Protein Data Bank. The combined evaluation of a solvent accessibility parameter and contact energy allows for an effective gross screening of predictive models.
Benkhelifa, Fatma
2016-09-20
In this paper, we consider a multiuser multipleinput multiple-output (MIMO) decode-and-forward (DF) relay broadcasting channel (BC) with single source, multiple energy harvesting (EH) relays and multiple destinations. All the nodes are equipped with multiple antennas. The EH and information decoding (ID) tasks at the relays and destinations are separated over the time, which is termed as the time switching (TS) scheme. As optimal solutions for the sum-rate maximization problems of BC channels and the MIMO interference channels are hard to obtain, the end-to-end sum rate maximization problem of a multiuser MIMO DF relay BC channel is even harder. In this paper, we propose to tackle a simplified problem where we employ the block diagonalization (BD) procedure at the source, and we mitigate the interference between the relaydestination channels using an algorithm similar to the BD method. In order to show the relevance of our low complex proposed solution, we compare it to the minimum mean-square error (MMSE) solution that was shown in the literature to be equivalent to the solution of the sum-rate maximization in MIMO broadcasting interfering channels. We also investigate the time division multiple access (TDMA) solution which separates all the information transmissions from the source to the relays and from the relays to the destinations over time. We provide numerical results to show the relevance of our proposed solution, in comparison with the no co-channel interference (CCI) case, the TDMA based solution and the MMSE based solution.
Benkhelifa, Fatma; Salem, Ahmed Sultan; Alouini, Mohamed-Slim
2016-01-01
In this paper, we consider a multiuser multipleinput multiple-output (MIMO) decode-and-forward (DF) relay broadcasting channel (BC) with single source, multiple energy harvesting (EH) relays and multiple destinations. All the nodes are equipped with multiple antennas. The EH and information decoding (ID) tasks at the relays and destinations are separated over the time, which is termed as the time switching (TS) scheme. As optimal solutions for the sum-rate maximization problems of BC channels and the MIMO interference channels are hard to obtain, the end-to-end sum rate maximization problem of a multiuser MIMO DF relay BC channel is even harder. In this paper, we propose to tackle a simplified problem where we employ the block diagonalization (BD) procedure at the source, and we mitigate the interference between the relaydestination channels using an algorithm similar to the BD method. In order to show the relevance of our low complex proposed solution, we compare it to the minimum mean-square error (MMSE) solution that was shown in the literature to be equivalent to the solution of the sum-rate maximization in MIMO broadcasting interfering channels. We also investigate the time division multiple access (TDMA) solution which separates all the information transmissions from the source to the relays and from the relays to the destinations over time. We provide numerical results to show the relevance of our proposed solution, in comparison with the no co-channel interference (CCI) case, the TDMA based solution and the MMSE based solution.
Surface Energy and Setting Process of Contacting Surfaces
Directory of Open Access Journals (Sweden)
M. V. Musokhranov
2014-01-01
Full Text Available The paper deals with a challenge in terms of ensuring an accuracy of the relative position of the conjugated surfaces that is to determine a coefficient of friction. To solve it, there is a proposal to use the surface energy, as a tool that influences the contacting parts nature. Presently, energy of the surface layers at best is only stated, but not used in practice.Analysis of the conditions of interaction between two contacting surfaces, such as seizing and setting cannot be explained only from the position of the roughness parameters. It is found that these phenomena are explained by the appearing gripe (setting bridges, which result from the energy of interaction between two or more adjacent surfaces. The emerging phenomenon such as micro welding, i.e. occurring bonds, is caused by the overflow of energy, according to the theory of physics, from the surface with a high level of energy to the surface with the smaller one to balance the system as a whole.The paper shows that through the use of process, controlling the depth of the surface layer and creating a certain structure, the energy level of the material as a whole can be specified. And this will allow us to provide the necessary performance and mechanical properties. It means to create as many gripe bridges as possible to ensure continuous positioning i.e. a fixed connection of the contacting surfaces.It was determined that to increase a value of the friction coefficient, the physical and mechanical properties of the surface layer of the parts material must be taken into account, namely, in the part body accumulate the energy to be consumed for forming the surface.The paper gives recommendations for including the parts of the surface energy in the qualitative indicators of characteristics. This will make a technologist, when routing a process, to choose such operations and modes to provide the designer-specified parameters not only of the accuracy and surface finish, but also of the
High Energy Physics Model Database - HEPMDB - Towards decoding the underlying theory at the LHC
International Nuclear Information System (INIS)
Bondarenko, M.; Belyaev, A.; Basso, L.; Boos, E.; Bunichev, V.; Sekhar Chivukula, R.; Christensen, D.; Cox, S.; De Roeck, A.; Moretti, S.; Pukhov, A.; Sekmen, S.; Semenov, A.; Simmons, E.H.; Shepherd-Themistocleus, C.; Speckner, C.
2012-01-01
We present here the first stage of development of the High Energy Physics Model Data-Base (HEPMDB) which is a convenient centralized storage environment for HEP (High Energy Physics) models, and can accommodate, via web interface to the HPC cluster, the validation of models, evaluation of LHC predictions and event generation-simulation chain. The ultimate goal of HEPMDB is to perform an effective LHC data interpretation isolating the most successful theory for explaining LHC observations. (authors)
Du, Guanyao; Yu, Jianjun
2016-01-01
This paper investigates the system achievable rate for the multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) system with an energy harvesting (EH) relay. Firstly we propose two protocols, time switching-based decode-and-forward relaying (TSDFR) and a flexible power splitting-based DF relaying (PSDFR) protocol by considering two practical receiver architectures, to enable the simultaneous information processing and energy harvesting at the relay. In PSDFR protocol, we introduce a temporal parameter to describe the time division pattern between the two phases which makes the protocol more flexible and general. In order to explore the system performance limit, we discuss the system achievable rate theoretically and formulate two optimization problems for the proposed protocols to maximize the system achievable rate. Since the problems are non-convex and difficult to solve, we first analyze them theoretically and get some explicit results, then design an augmented Lagrangian penalty function (ALPF) based algorithm for them. Numerical results are provided to validate the accuracy of our analytical results and the effectiveness of the proposed ALPF algorithm. It is shown that, PSDFR outperforms TSDFR to achieve higher achievable rate in such a MIMO-OFDM relaying system. Besides, we also investigate the impacts of the relay location, the number of antennas and the number of subcarriers on the system performance. Specifically, it is shown that, the relay position greatly affects the system performance of both protocols, and relatively worse achievable rate is achieved when the relay is placed in the middle of the source and the destination. This is different from the MIMO-OFDM DF relaying system without EH. Moreover, the optimal factor which indicates the time division pattern between the two phases in the PSDFR protocol is always above 0.8, which means that, the common division of the total transmission time into two equal phases in
Occupational contact dermatitis in the wind energy industry.
Lárraga-Piñones, G; Heras-Mendaza, F; Conde-Salazar, L
2012-12-01
In 2010, wind energy coverage in Spain increased by 16%, making the country the world's fourth largest producer in a fast-developing industry that is also a source of employment. Occupational skin diseases in this field have received little attention. The present study aims to describe the main characteristics of skin diseases affecting workers in the wind energy industry and the allergens involved. We performed a descriptive, observational study of workers from the wind energy industry with suspected contact dermatitis who were referred to the occupational dermatology clinic of the National School of Occupational Medicine (Escuela Nacional de Medicina del Trabajo) between 2009 and 2011. We took both a clinical history and an occupational history, and patients underwent a physical examination and patch testing with the materials used in their work. We studied 10 workers (8 men, 2 women), with a mean age of 33.7 years. The main finding was dermatitis, which affected the face, eyelids, forearms, and hands. Sensitization to epoxy resins was detected in 4 workers, 1 of whom was also sensitized to epoxy curing agents. One worker was sensitized to bisphenol F resin but had a negative result with epoxy resin from the standard series. In the 5 remaining cases, the final diagnosis was irritant contact dermatitis due to fiberglass. Occupational skin diseases are increasingly common in the wind energy industry. The main allergens are epoxy resins. Fiberglass tends to produce irritation. Copyright © 2012 Elsevier España, S.L. and AEDV. All rights reserved.
Directory of Open Access Journals (Sweden)
Vicente Palacios
Full Text Available Population monitoring is crucial for wildlife management and conservation. In the last few decades, wildlife researchers have increasingly applied bioacoustics tools to obtain information on several essential ecological parameters, such as distribution and abundance. One such application involves wolves (Canis lupus. These canids respond to simulated howls by emitting group vocalizations known as chorus howls. These responses to simulated howls reveal the presence of wolf litters during the breeding period and are therefore often used to determine the status of wolf populations. However, the acoustic structure of chorus howls is complex and discriminating the presence of pups in a chorus is sometimes difficult, even for experienced observers. In this study, we evaluate the usefulness of analyses of the acoustic energy distribution in chorus howls to identify the presence of pups in a chorus. We analysed 110 Iberian wolf chorus howls with known pack composition and found that the acoustic energy distribution is concentrated at higher frequencies when there are pups vocalizing. We built predictive models using acoustic energy distribution features to determine the presence of pups in a chorus, concluding that the acoustic energy distribution in chorus howls can be used to determine the presence of wolf pups in a pack. The method we outline here is objective, accurate, easily implemented, and independent of the observer's experience. These advantages are especially relevant in the case of broad scale surveys or when many observers are involved. Furthermore, the analysis of the acoustic energy distribution can be implemented for monitoring other social canids that emit chorus howls such as jackals or coyotes, provides an easy way to obtain information on ecological parameters such as reproductive success, and could be useful to study other group vocalizations.
López-Bao, José Vicente; Llaneza, Luis; Fernández, Carlos; Font, Enrique
2016-01-01
Population monitoring is crucial for wildlife management and conservation. In the last few decades, wildlife researchers have increasingly applied bioacoustics tools to obtain information on several essential ecological parameters, such as distribution and abundance. One such application involves wolves (Canis lupus). These canids respond to simulated howls by emitting group vocalizations known as chorus howls. These responses to simulated howls reveal the presence of wolf litters during the breeding period and are therefore often used to determine the status of wolf populations. However, the acoustic structure of chorus howls is complex and discriminating the presence of pups in a chorus is sometimes difficult, even for experienced observers. In this study, we evaluate the usefulness of analyses of the acoustic energy distribution in chorus howls to identify the presence of pups in a chorus. We analysed 110 Iberian wolf chorus howls with known pack composition and found that the acoustic energy distribution is concentrated at higher frequencies when there are pups vocalizing. We built predictive models using acoustic energy distribution features to determine the presence of pups in a chorus, concluding that the acoustic energy distribution in chorus howls can be used to determine the presence of wolf pups in a pack. The method we outline here is objective, accurate, easily implemented, and independent of the observer's experience. These advantages are especially relevant in the case of broad scale surveys or when many observers are involved. Furthermore, the analysis of the acoustic energy distribution can be implemented for monitoring other social canids that emit chorus howls such as jackals or coyotes, provides an easy way to obtain information on ecological parameters such as reproductive success, and could be useful to study other group vocalizations. PMID:27144887
DEFF Research Database (Denmark)
Justesen, Jørn; Høholdt, Tom; Hjaltason, Johan
2005-01-01
We analyze the relation between iterative decoding and the extended parity check matrix. By considering a modified version of bit flipping, which produces a list of decoded words, we derive several relations between decodable error patterns and the parameters of the code. By developing a tree...... of codewords at minimal distance from the received vector, we also obtain new information about the code....
Energy Technology Data Exchange (ETDEWEB)
Holzapfel, Andreas (ed.)
2013-04-01
The manual is in three sections: 1. Parliaments and governments, survey and organization; 2. Biographic section, with 304 biography; 3. Index of names. The first section informs on the organizational structure of parliaments and governments. The subject of energy is discussed three times, i.e. in 'Economics', 'Environment', and 'Research'. For each parliament, the members of the energy policy TCs are listed, followed by names and contact addresses of the senior officials and departments with contact data, both on a national, state, and European scale. The second section contains the biographies of energy policy experts of the German parliament and government, the sixteen land parliaments and governments, and the European Commissions. As the subject of energy is highly interdisciplinary, the authors selected the energy policy committees of the German parliament and state parliaments. The biographies of the committee members are presented in the text.
Decoding Algorithms for Random Linear Network Codes
DEFF Research Database (Denmark)
Heide, Janus; Pedersen, Morten Videbæk; Fitzek, Frank
2011-01-01
We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially...... achieve a high coding throughput, and reduce energy consumption.We use an on-the-fly version of the Gauss-Jordan algorithm as a baseline, and provide several simple improvements to reduce the number of operations needed to perform decoding. Our tests show that the improvements can reduce the number...
Varlamov, Gennadii Borysovich; Romanova, Kateryna Alexandrovna; Nazarova, Iryna; Daschenko, Olga; Kapustiansky, Andry
2017-12-01
Energy efficiency improvement and ecological safety of heat power plants are urgent problems, which require scientifically grounded approaches and solutions. These problems can be solved partly within the presented heat-and-power cycles by including contact energy exchange equipment in the circuits of existing installations. A significant positive effect is obtained in the contact energy exchange installations, such as gas-steam installation `Aquarius' and the contact hydrogen heat generator that also can use hydrogen as a fuel. In these plants, the efficiency increases approximately by 10-12% in comparison with traditional installations, and the concentration of toxic substances, such as nitrogen oxides and carbon monoxide in flue gas can be reduced to 30 mg/m3 and to 5 mg/m3, respectively. Moreover, the plants additionally `generate' the clean water, which can be used for technical purposes.
A singular perturbation limit of diffused interface energy with a fixed contact angle condition
Kagaya, Takashi; Tonegawa, Yoshihiro
2016-01-01
We study a general asymptotic behavior of critical points of a diffused interface energy with a fixed contact angle condition defined on a domain $\\Omega \\subset \\mathbb{R}^n$. We show that the limit varifold derived from the diffused energy satisfies a generalized contact angle condition on the boundary under a set of assumptions.
Forced Sequence Sequential Decoding
DEFF Research Database (Denmark)
Jensen, Ole Riis
In this thesis we describe a new concatenated decoding scheme based on iterations between an inner sequentially decoded convolutional code of rate R=1/4 and memory M=23, and block interleaved outer Reed-Solomon codes with non-uniform profile. With this scheme decoding with good performance...... is possible as low as Eb/No=0.6 dB, which is about 1.7 dB below the signal-to-noise ratio that marks the cut-off rate for the convolutional code. This is possible since the iteration process provides the sequential decoders with side information that allows a smaller average load and minimizes the probability...... of computational overflow. Analytical results for the probability that the first Reed-Solomon word is decoded after C computations are presented. This is supported by simulation results that are also extended to other parameters....
Energy and contact of the one-dimensional Fermi polaron at zero and finite temperature.
Doggen, E V H; Kinnunen, J J
2013-07-12
We use the T-matrix approach for studying highly polarized homogeneous Fermi gases in one dimension with repulsive or attractive contact interactions. Using this approach, we compute ground state energies and values for the contact parameter that show excellent agreement with exact and other numerical methods at zero temperature, even in the strongly interacting regime. Furthermore, we derive an exact expression for the value of the contact parameter in one dimension at zero temperature. The model is then extended and used for studying the temperature dependence of ground state energies and the contact parameter.
Electrode contact configuration and energy consumption in spinal cord stimulation
de Vos, Cecilia Cecilia Clementine; de Vos, Cecile C.; Hilgerink, Marjolein P.; Buschman, Hendrik P.J.; Buschman, H.P.J.; Holsheimer, J.
2009-01-01
Objective. To test the hypothesis that in spinal cord stimulation, in contrast to an increase of the number of anodes which reduces energy consumption per pulse, an increase of the number of cathodes raises the energy per pulse. Methods. Patients with an Itrel 3 pulse generator and a Pisces Quad
Contact configuration and energy consumption in spinal cord stimulation
de Vos, Cecilia Cecilia Clementine; Hilgerink, M.P.; Buschman, H.P.J.; Holsheimer, J.; Vander Sloten, Jos; Verdonck, Pascal; Nyssen, Marc; Haueisen, Jens
2009-01-01
Objective: To test the hypothesis that, in contrast to an increase of the number of anodes which reduces energy consumption per pulse, an increase of the number of cathodes raises the energy consumption. Materials and Methods: Patients with an Itrel 3 Pulse Generator and a Pisces Quad quadripolar
DEFF Research Database (Denmark)
Martins, Bo; Forchhammer, Søren
1999-01-01
MPEG-2 video decoding is examined. A unified approach to quality improvement, chrominance upsampling, de-interlacing and superresolution is presented. The information over several frames is combined as part of the processing....
Forced Sequence Sequential Decoding
DEFF Research Database (Denmark)
Jensen, Ole Riis; Paaske, Erik
1998-01-01
We describe a new concatenated decoding scheme based on iterations between an inner sequentially decoded convolutional code of rate R=1/4 and memory M=23, and block interleaved outer Reed-Solomon (RS) codes with nonuniform profile. With this scheme decoding with good performance is possible as low...... as Eb/N0=0.6 dB, which is about 1.25 dB below the signal-to-noise ratio (SNR) that marks the cutoff rate for the full system. Accounting for about 0.45 dB due to the outer codes, sequential decoding takes place at about 1.7 dB below the SNR cutoff rate for the convolutional code. This is possible since...... the iteration process provides the sequential decoders with side information that allows a smaller average load and minimizes the probability of computational overflow. Analytical results for the probability that the first RS word is decoded after C computations are presented. These results are supported...
General Retarded Contact Self-energies in and beyond the Non-equilibrium Green's Functions Method
Kubis, Tillmann; He, Yu; Andrawis, Robert; Klimeck, Gerhard
2016-03-01
Retarded contact self-energies in the framework of nonequilibrium Green's functions allow to model the impact of lead structures on the device without explicitly including the leads in the actual device calculation. Most of the contact self-energy algorithms are limited to homogeneous or periodic, semi-infinite lead structures. In this work, the complex absorbing potential method is extended to solve retarded contact self-energies for arbitrary lead structures, including irregular and randomly disordered leads. This method is verified for regular leads against common approaches and on physically equivalent, but numerically different irregular leads. Transmission results on randomly alloyed In0.5Ga0.5As structures show the importance of disorder in the leads. The concept of retarded contact self-energies is expanded to model passivation of atomically resolved surfaces without explicitly increasing the device's Hamiltonian.
Monitoring Ion Implantation Energy Using Non-contact Characterization Methods
Tallian, M.; Pap, A.; Mocsar, K.; Somogyi, A.; Nadudvari, Gy.; Kosztka, D.; Pavelka, T.
2011-01-01
State-of-the-art ultra-shallow junctions are produced using extremely low ion implant energies, down to the range of 1-3 keV. This can be achieved by a variety of production techniques; however there is a significant risk that the actual implantation energy differs from the desired value. To detect this, sensitive measurement methods need to be utilized. Experiments show that both Photomodulated Reflection measurements before anneal and Junction Photovoltage-based sheet resistance measurements after anneal are suitable for this purpose.
Contact angle dependence on the fluid-wall dispersive energy
Horsch, M.; Heitzig, M.; Dan, C.M.; Harting, J.D.R.; Hasse, H.; Vrabec, J.
2010-01-01
Menisci of the truncated and shifted Lennard-Jones fluid between parallel planar walls are investigated by molecular dynamics simulation. Thereby, the characteristic energy of the unlike dispersive interaction between fluid molecules and wall atoms is systematically varied to determine its influence
How we promote renewable energies. Financing aids, examples, contacts
International Nuclear Information System (INIS)
1996-08-01
The present brochure informas the reader on possibilities of promotion and financing aids for renewable energies in Germany. In order to facilitate his understanding of the prinicpal technologies eligible for promotion it briefly describes the special features of the relevant technologies in an easily understandable manner. At the end the reader will find useful addresses and literature references. (orig./RHM) [de
Modified Decoding Algorithm of LLR-SPA
Directory of Open Access Journals (Sweden)
Zhongxun Wang
2014-09-01
Full Text Available In wireless sensor networks, the energy consumption is mainly occurred in the stage of information transmission. The Low Density Parity Check code can make full use of the channel information to save energy. Because of the widely used decoding algorithm of the Low Density Parity Check code, this paper proposes a new decoding algorithm which is based on the LLR-SPA (Sum-Product Algorithm in Log-Likelihood-domain to improve the accuracy of the decoding algorithm. In the modified algorithm, a piecewise linear function is used to approximate the complicated Jacobi correction term in LLR-SPA decoding algorithm. Construct the tangent by the tangency point to the function of Jacobi correction term, which is based on the first order Taylor Series. In this way, the proposed piecewise linear approximation offers almost a perfect match to the function of Jacobi correction term. Meanwhile, the proposed piecewise linear approximation could avoid the operation of logarithmic which is more suitable for practical application. The simulation results show that the proposed algorithm could improve the decoding accuracy greatly without noticeable variation of the computational complexity.
International Nuclear Information System (INIS)
Rubin, Gerson Antonio
1979-01-01
An experimental procedure for the determination of the thermal contact conductance between two solid surfaces as a function of the contact pressure and the energy of the laser radiation has been developed using the laser pulse method. A rubi laser with variable energy levels was employed as a radiating pulse energy source. The laser beam was allowed to impinge perpendicularly on the front face of a electrolytic iron 73 4 . The temperature fluctuations resulting on the back surface of the sample was detected by a thermocouple, which Is coupled to a PDP-11/45 Computer 32 Kbytes of memory, through a Analog-Digital Converter. A theoretical function, derived exclusively for the problem mentioned in this work, was adjusted by a method of least square fitting of experimental results. This adjustment yielded the value of a parameter related to the contact conductance between two surfaces. The experimental error obtained for the thermal contact conductance was +- 4.9%. (author)
Decoding communities in networks
Radicchi, Filippo
2018-02-01
According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.
Decoding communities in networks.
Radicchi, Filippo
2018-02-01
According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.
Adaptive decoding of convolutional codes
Directory of Open Access Journals (Sweden)
K. Hueske
2007-06-01
Full Text Available Convolutional codes, which are frequently used as error correction codes in digital transmission systems, are generally decoded using the Viterbi Decoder. On the one hand the Viterbi Decoder is an optimum maximum likelihood decoder, i.e. the most probable transmitted code sequence is obtained. On the other hand the mathematical complexity of the algorithm only depends on the used code, not on the number of transmission errors. To reduce the complexity of the decoding process for good transmission conditions, an alternative syndrome based decoder is presented. The reduction of complexity is realized by two different approaches, the syndrome zero sequence deactivation and the path metric equalization. The two approaches enable an easy adaptation of the decoding complexity for different transmission conditions, which results in a trade-off between decoding complexity and error correction performance.
Adaptive decoding of convolutional codes
Hueske, K.; Geldmacher, J.; Götze, J.
2007-06-01
Convolutional codes, which are frequently used as error correction codes in digital transmission systems, are generally decoded using the Viterbi Decoder. On the one hand the Viterbi Decoder is an optimum maximum likelihood decoder, i.e. the most probable transmitted code sequence is obtained. On the other hand the mathematical complexity of the algorithm only depends on the used code, not on the number of transmission errors. To reduce the complexity of the decoding process for good transmission conditions, an alternative syndrome based decoder is presented. The reduction of complexity is realized by two different approaches, the syndrome zero sequence deactivation and the path metric equalization. The two approaches enable an easy adaptation of the decoding complexity for different transmission conditions, which results in a trade-off between decoding complexity and error correction performance.
DEFF Research Database (Denmark)
Nielsen, Rasmus Refslund
2002-01-01
This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed.......This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed....
Superconducting energy gap of YB6 studied by point-contact spectroscopy
International Nuclear Information System (INIS)
Szabo, Pavol; Kacmarcik, Jozef; Samuely, Peter; Girovsky, Jan; Gabani, Slavomir; Flachbart, Karol; Mori, Takao
2007-01-01
Yttrium hexaboride has the second highest critical temperature, T c ∼ 8 K, among all borides. The presented paper deals with the experimental study of its superconducting energy gap established by the method of the point-contact spectroscopy. The temperature dependence of the energy gap and the strength of the superconducting coupling is presented
International Nuclear Information System (INIS)
Yoon, Hong Min; Kondaraju, Sasidhar; Lee, Jung Shin; Suh, Youngho; Lee, Joonho H.; Lee, Joon Sang
2017-01-01
Highlights: • Contact line forces, including friction and spreading forces are directly calculated. • Overall trends of variations in contact line forces during droplet spreading process show characteristics of contact line forces. • Detail relations of contact line forces and atomic kinetics in the contact line provide a clear evidence of the possible energy dissipation mechanism in droplet spreading process. - Abstract: Recent studies have revealed that contact line forces play an important role in the droplet spreading process. Despite their significance, the physics related to them has been studied only indirectly and the effect of contact line forces is still being disputed. We performed a molecular dynamics simulation and mimicked the droplet spreading process at the nanoscale. Based on the results of the simulation, the contact line forces were directly calculated. We found that the forces acting on the bulk and the contact line region showed different trends. Distinct positive and negative forces, contact line spreading, and friction forces were observed near the contact line. We also observed a strong dependency of the atomic kinetics in the contact line region on the variations in the contact line forces. The atoms of the liquid in the contact line region lost their kinetic energy due to the contact line friction force and became partially immobile on the solid surface. The results of the current study will be useful for understanding the role of the contact line forces on the kinetic energy dissipation in the contact line region.
Energy Technology Data Exchange (ETDEWEB)
Yoon, Hong Min [Department of Mechanical Engineering, Yonsei University, Seoul 120-749 (Korea, Republic of); Kondaraju, Sasidhar [Department of Mechanical Science, Indian Institute of Technology Bhubaneswar, Bhubaneswar, Odisha 751013 (India); Lee, Jung Shin [Department of Mechanical Engineering, Yonsei University, Seoul 120-749 (Korea, Republic of); Suh, Youngho; Lee, Joonho H. [Samsung Electronics, Mechatronics R& D Center, Hwaseong-si, Gyeonggi-do 445-330 (Korea, Republic of); Lee, Joon Sang, E-mail: joonlee@yonsei.ac.kr [Department of Mechanical Engineering, Yonsei University, Seoul 120-749 (Korea, Republic of)
2017-07-01
Highlights: • Contact line forces, including friction and spreading forces are directly calculated. • Overall trends of variations in contact line forces during droplet spreading process show characteristics of contact line forces. • Detail relations of contact line forces and atomic kinetics in the contact line provide a clear evidence of the possible energy dissipation mechanism in droplet spreading process. - Abstract: Recent studies have revealed that contact line forces play an important role in the droplet spreading process. Despite their significance, the physics related to them has been studied only indirectly and the effect of contact line forces is still being disputed. We performed a molecular dynamics simulation and mimicked the droplet spreading process at the nanoscale. Based on the results of the simulation, the contact line forces were directly calculated. We found that the forces acting on the bulk and the contact line region showed different trends. Distinct positive and negative forces, contact line spreading, and friction forces were observed near the contact line. We also observed a strong dependency of the atomic kinetics in the contact line region on the variations in the contact line forces. The atoms of the liquid in the contact line region lost their kinetic energy due to the contact line friction force and became partially immobile on the solid surface. The results of the current study will be useful for understanding the role of the contact line forces on the kinetic energy dissipation in the contact line region.
The role of adhesion energy in controlling cell?cell contacts
Ma?tre, Jean-L?on; Heisenberg, Carl-Philipp
2011-01-01
Recent advances in microscopy techniques and biophysical measurements have provided novel insight into the molecular, cellular and biophysical basis of cell adhesion. However, comparably little is known about a core element of cell?cell adhesion?the energy of adhesion at the cell?cell contact. In this review, we discuss approaches to understand the nature and regulation of adhesion energy, and propose strategies to determine adhesion energy between cells in vitro and in vivo.
International Nuclear Information System (INIS)
Wong, W.H.; Li, H.; Uribe, J.
1998-01-01
A new method for processing signals from Anger position-sensitive detectors used in gamma cameras and PET is proposed for very high count-rate imaging where multiple-event pileups are the norm. This method is designed to sort out and recover every impinging event from multiple-event pileups while maximizing the collection of scintillation signal for every event to achieve optimal accuracy in the measurement of energy and position. For every detected event, this method cancels the remnant signals from previous events, and excludes the pileup of signals from following events. The remnant subtraction is exact even for multiple pileup events. A prototype circuit for energy recovery demonstrated that the maximum count rates can be increased by more than 10 times comparing to the pulse-shaping method, and the energy resolution is as good as pulse shaping (or fixed integration) at low count rates. At 2 x 10 6 events/sec on NaI(Tl), the true counts acquired with this method is 3.3 times more than the delay-line clipping method (256 ns clipping) due to events recovered from pileups. Pulse-height spectra up to 3.5 x 10 6 events/sec have been studied. Monte Carlo simulation studies have been performed for image-quality comparisons between different processing methods
Indian Academy of Sciences (India)
Shannon limit of the channel. Among the earliest discovered codes that approach the. Shannon limit were the low density parity check (LDPC) codes. The term low density arises from the property of the parity check matrix defining the code. We will now define this matrix and the role that it plays in decoding. 2. Linear Codes.
Search for Superconducting Energy Gap in UPt3 by Point-Contact Spectroscopy
International Nuclear Information System (INIS)
Gouchi, Jun; Sumiyama, Akihiko; Yamaguchi, Akira; Motoyama, Gaku; Kimura, Noriaki; Yamamoto, Etsuji; Haga, Yoshinori; Ōnuki, Yoshichika
2015-01-01
We have investigated the differential resistance of the point contacts between heavy-fermion superconductor UPt 3 and a normal metal Pt, which were fabricated using a commercial piezo-electric actuator, and retried the observation of the energy gap of UPt 3 . A V-shaped dip is observed in both normal and superconducting states and disappeared around T K ∼ 20 K, suggesting that it is related to the Kondo effect. Below the superconducting transition temperature, a shallow double-minimum structure, which indicates the energy gap, has been observed for the contacts on the faces perpendicular to the a-, b- and c-axes of UPt 3
Varman, Arul M.; He, Lian; Follenfant, Rhiannon; Wu, Weihua; Wemmer, Sarah; Wrobel, Steven A.; Tang, Yinjie J.; Singh, Seema
2016-01-01
Sphingobium sp. SYK-6 is a soil bacterium boasting a well-studied ligninolytic pathway and the potential for development into a microbial chassis for lignin valorization. An improved understanding of its metabolism will help researchers in the engineering of SYK-6 for the production of value-added chemicals through lignin valorization. We used 13C-fingerprinting, 13C metabolic flux analysis (13C-MFA), and RNA-sequencing differential expression analysis to uncover the following metabolic traits: (i) SYK-6 prefers alkaline conditions, making it an efficient host for the consolidated bioprocessing of lignin, and it also lacks the ability to metabolize sugars or organic acids; (ii) the CO2 release (i.e., carbon loss) from the ligninolysis-based metabolism of SYK-6 is significantly greater than the CO2 release from the sugar-based metabolism of Escherichia coli; (iii) the vanillin catabolic pathway (which is the converging point of majority of the lignin catabolic pathways) is coupled with the tetrahydrofolate-dependent C1 pathway that is essential for the biosynthesis of serine, histidine, and methionine; (iv) catabolic end products of lignin (pyruvate and oxaloacetate) must enter the tricarboxylic acid (TCA) cycle first and then use phosphoenolpyruvate carboxykinase to initiate gluconeogenesis; and (v) 13C-MFA together with RNA-sequencing differential expression analysis establishes the vanillin catabolic pathway as the major contributor of NAD(P)H synthesis. Therefore, the vanillin catabolic pathway is essential for SYK-6 to obtain sufficient reducing equivalents for its healthy growth; cosubstrate experiments support this finding. This unique energy feature of SYK-6 is particularly interesting because most heterotrophs rely on the transhydrogenase, the TCA cycle, and the oxidative pentose phosphate pathway to obtain NADPH. PMID:27634497
On minimizing the maximum broadcast decoding delay for instantly decodable network coding
Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Ai-Naffouri, Tareq Y.
2014-01-01
In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a
Subharmonic energy-gap structure and heating effects in superconducting niobium point contacts
DEFF Research Database (Denmark)
Flensberg, K.; Hansen, Jørn Bindslev
1989-01-01
We present experimental data of the temperature-dependent subharmonic energy-gap structure (SGS) in the current-voltage (I-V) curves of superconducting niobium point contacts. The observed SGS is modified by heating effects. We construct a model of the quasiparticle conductance of metallic...
CERN. Geneva. Audiovisual Unit; Antonerakis, S E
2002-01-01
Decoding the Human genome is a very up-to-date topic, raising several questions besides purely scientific, in view of the two competing teams (public and private), the ethics of using the results, and the fact that the project went apparently faster and easier than expected. The lecture series will address the following chapters: Scientific basis and challenges. Ethical and social aspects of genomics.
Heo, Muyoung; Kim, Suhkmann; Moon, Eun-Joung; Cheon, Mookyung; Chung, Kwanghoon; Chang, Iksoo
2005-07-01
Although a coarse-grained description of proteins is a simple and convenient way to attack the protein folding problem, the construction of a global pairwise energy function which can simultaneously recognize the native folds of many proteins has resulted in partial success. We have sought the possibility of a systematic improvement of this pairwise-contact energy function as we extended the parameter space of amino acids, incorporating local environments of amino acids, beyond a 20×20 matrix. We have studied the pairwise contact energy functions of 20×20 , 60×60 , and 180×180 matrices depending on the extent of parameter space, and compared their effect on the learnability of energy parameters in the context of a gapless threading, bearing in mind that a 20×20 pairwise contact matrix has been shown to be too simple to recognize the native folds of many proteins. In this paper, we show that the construction of a global pairwise energy function was achieved using 1006 training proteins of a homology of less than 30%, which include all representatives of different protein classes. After parametrizing the local environments of the amino acids into nine categories depending on three secondary structures and three kinds of hydrophobicity (desolvation), the 16290 pairwise contact energies (scores) of the amino acids could be determined by perceptron learning and protein threading. These could simultaneously recognize all the native folds of the 1006 training proteins. When these energy parameters were tested on the 382 test proteins of a homology of less than 90%, 370 (96.9%) proteins could recognize their native folds. We set up a simple thermodynamic framework in the conformational space of decoys to calculate the unfolded fraction and the specific heat of real proteins. The different thermodynamic stabilities of E.coli ribonuclease H (RNase H) and its mutants were well described in our calculation, agreeing with the experiment.
Layer-by-layer polyelectrolyte films for contact electric energy harvesting
International Nuclear Information System (INIS)
Guo, X D; Helseth, L E
2015-01-01
We report how self-assembly of polyelectrolyte thin films alters the contact electrification of polyimide polymer films used in contact based triboelectric energy harvesting systems. Polyimide films of the same size do produce a very small current when brought into contact. However, by covering one of the polyimide films with a polyelectrolyte thin film terminated by positively charged poly(allylamine hydrochloride) (PAH), the current is reversed and a much larger current and voltage are generated upon contact with the other polyimide film. A similar increase in contact current is not seen for polyelectrolyte thin films terminated by the negatively charged poly(sodium 4-styrenesulfonate). The PAH-terminated Kapton films are used to create an energy harvesting system providing a voltage of about 60 V and a current of 10 μA. At an average power of 11 μW for a load resistance of 100 MΩ, the energy harvester is able to power several light emitting diodes. Further studies on the contact electrification of the polyelectrolyte demonstrate that nanostructuring of the polymer surface using reactive ion etching does not give rise to polarity reversal. This is explained as hidden pockets of charge not accessible to PAH molecules, but which become accessible when the polymer is put under stress. Although the current originating for a PAH-terminated multilayer film does initially have the opposite sign to that of bare polyimide, it is found that the polarity will switch after subjecting it to a periodical mechanical force. Characteristic changes in current signatures associated with the switch are found, and are interpreted as mechanical interpenetration of the charged layers. (paper)
An infrared-driven flexible pyroelectric generator for non-contact energy harvester
Zhao, Tingting; Jiang, Weitao; Liu, Hongzhong; Niu, Dong; Li, Xin; Liu, Weihua; Li, Xuan; Chen, Bangdao; Shi, Yongsheng; Yin, Lei; Lu, Bingheng
2016-04-01
In recent years, energy harvesting technologies, which can scavenge many kinds of energies from our living environment to power micro/nanodevices, have attracted increasing attention. However, remote energy transmission, flexibility and electric waveform controllability remain the key challenges for wireless power supply by an energy harvester. In this paper, we design a new infrared-driven non-contact pyroelectric generator for harvesting heat energy, which avoids direct contact between the pyroelectric generator and heat source and realizes remote energy transfer exploiting the photothermal and penetrability of infrared light. The output voltage (under the input impedance of 100 MOhm) and short-circuit current of the pyroelectric generator consisting of a CNT/PVDF/CNT layer (20 mm × 5 mm × 100 μm) can be as large as 1.2 V and 9 nA, respectively, under a 1.45 W cm-2 near-infrared laser (808 nm). We also demonstrate the means by which the pyroelectric generator can modulate square waveforms with controllable periods through irradiation frequency, which is essential for signal sources and medical stimulators. The overshoot of square waveforms are in a range of 9.0%-13.1% with a rise time of 120 ms. The prepared pyroelectric generator can light a liquid crystal display (LCD) in a vacuum chamber from outside. This work paves the way for non-contact energy harvesting for some particular occasions where near-field energy control is not available.In recent years, energy harvesting technologies, which can scavenge many kinds of energies from our living environment to power micro/nanodevices, have attracted increasing attention. However, remote energy transmission, flexibility and electric waveform controllability remain the key challenges for wireless power supply by an energy harvester. In this paper, we design a new infrared-driven non-contact pyroelectric generator for harvesting heat energy, which avoids direct contact between the pyroelectric generator and heat
Decoding Facial Expressions: A New Test with Decoding Norms.
Leathers, Dale G.; Emigh, Ted H.
1980-01-01
Describes the development and testing of a new facial meaning sensitivity test designed to determine how specialized are the meanings that can be decoded from facial expressions. Demonstrates the use of the test to measure a receiver's current level of skill in decoding facial expressions. (JMF)
Low-Velocity Impact Wear Behavior of Ball-to-Flat Contact Under Constant Kinetic Energy
Wang, Zhang; Cai, Zhen-bing; Chen, Zhi-qiang; Sun, Yang; Zhu, Min-hao
2017-11-01
The impact tests were conducted on metallic materials with different bulk hardness and Young's moduli. Analysis of the dynamics response during the tribological process showed that the tested materials had similar energy absorption, where the peak contact force increased as the tests continued. Moreover, wear volume decreased with the increase in Young's modulus of metals, except for Cr with a relatively low hardness. Wear rate was gradually reduced to a steady stage with increasing cycles, which was attributed to the decrease in contact stress and work-hardening effect. The main wear mechanism of impact was characterized by delamination, and the specific surface degradation mechanisms were depending on the mechanical properties of materials. The absorbed energy was used to the propagation of micro-cracks in the subsurface instead of plastic deformation, when resistance of friction wear and plastic behavior was improved. Hence, both the hardness and Young's modulus played important roles in the impact wear of metallic materials.
Godet, Christian; David, Denis
2017-12-01
Hamaker interaction energies and cutoff distances have been calculated for disordered carbon films, in contact with purely dispersive (diiodomethane) or polar (water) liquids, using their experimental dielectric functions ɛ ( q, ω) obtained over a broad energy range. In contrast with previous works, a q-averaged q is derived from photoelectron energy-loss spectroscopy (XPS-PEELS) where the energy loss function (ELF) q is a weighted average over allowed transferred wave vector values, q, given by the physics of bulk plasmon excitation. For microcrystalline diamond and amorphous carbon films with a wide range of (sp3/sp2 + sp3) hybridization, non-retarded Hamaker energies, A 132 ( L < 1 nm), were calculated in several configurations, and distance and wavenumber cutoff values were then calculated based on A 132 and the dispersive work of adhesion obtained from contact angles. A geometric average approximation, H 0 CVL = ( H 0 CVC H 0 LVL )1/2, holds for the cutoff separation distances obtained for carbon-vacuum-liquid (CVL), carbon-vacuum-carbon (CVC) and liquid-vacuum-liquid (LVL) equilibrium configurations. The linear dependence found for A CVL, A CLC and A CLV values as a function of A CVC, for each liquid, allows predictive relationships for Hamaker energies (in any configuration) using experimental determination of the dispersive component of the surface tension, {γ}_{CV}^d , and a guess value of the cutoff distance H 0 CVC of the solid. [Figure not available: see fulltext.
Contact angle in thick capillaries: a derivation based on energy balance
International Nuclear Information System (INIS)
Roura, Pere
2007-01-01
When a solid object is partially dipped beneath the surface of a liquid, this surface loses its horizontal shape near the solid surface and forms a meniscus. This phenomenon is governed by the general trend of any system to minimize its energy. In addition, the equilibrium of forces must be ensured for the meniscus. When both conditions (energy minimization and mechanical equilibrium) are considered together, the relationship between the contact angle and surface tensions (Young's equation) is obtained in a natural and simple way. (letters and comments)
List Decoding of Algebraic Codes
DEFF Research Database (Denmark)
Nielsen, Johan Sebastian Rosenkilde
We investigate three paradigms for polynomial-time decoding of Reed–Solomon codes beyond half the minimum distance: the Guruswami–Sudan algorithm, Power decoding and the Wu algorithm. The main results concern shaping the computational core of all three methods to a problem solvable by module...... Hermitian codes using Guruswami–Sudan or Power decoding faster than previously known, and we show how to Wu list decode binary Goppa codes....... to solve such using module minimisation, or using our new Demand–Driven algorithm which is also based on module minimisation. The decoding paradigms are all derived and analysed in a self-contained manner, often in new ways or examined in greater depth than previously. Among a number of new results, we...
Contact angle and detachment energy of shape anisotropic particles at fluid-fluid interfaces.
Anjali, Thriveni G; Basavaraj, Madivala G
2016-09-15
The three phase contact angle of particles, a measure of its wettability, is an important factor that greatly influences their behaviour at interfaces. It is one of the principal design parameters for potential applications of particles as emulsion/foam stabilizers, functional coatings and other novel materials. In the present work, the effect of size, shape and surface chemistry of particles on their contact angle is investigated using the gel trapping technique, which facilitates the direct visualization of the equilibrium position of particles at interfaces. The contact angle of hematite particles of spherocylindrical, peanut and cuboidal shapes, hematite-silica core-shell and silica shells is reported at a single particle level. The spherocylindrical and peanut shaped particles are always positioned with their major axis parallel to the interface. However, for cuboidal particles at air-water as well as decane-water interfaces, different orientations namely - face-up, edge-up and the vertex-up - are observed. The influence of gravity on the equilibrium position of the colloidal particles at the interface is studied using the hematite-silica core-shell particles and the silica shells. The measured contact angle values are utilized in the calculations of the detachment and surface energies of the hematite particles adsorbed at the interface. Copyright © 2016 Elsevier Inc. All rights reserved.
Zi, Yunlong; Wu, Changsheng; Ding, Wenbo; Wang, Zhong Lin
2017-01-01
Recent progress in triboelectric nanogenerators (TENGs) has demonstrated their promising potential as a high-efficiency mechanical energy harvesting technology, and plenty of effort has been devoted to improving the power output by maximizing the triboelectric surface charge density. However, due to high-voltage air breakdown, most of the enhanced surface charge density brought by material/surface optimization or external ion injection is not retainable or usable for electricity generation during the operation of contact-separation-triggered TENGs. Here, the existence of the air breakdown effect in a contact-separation mode TENG with a low threshold surface charge density of ≈40–50 µC m−2 is first validated under the high impedance external load, and then followed by the theoretical study of the maximized effective energy output as limited by air breakdown for contact-separation-triggered TENGs. The effects of air pressure and gas composition are also studied and propose promising solutions for reducing the air breakdown effect. This research provides a crucial fundamental study for TENG technology and its further development and applications.
Zi, Yunlong
2017-05-02
Recent progress in triboelectric nanogenerators (TENGs) has demonstrated their promising potential as a high-efficiency mechanical energy harvesting technology, and plenty of effort has been devoted to improving the power output by maximizing the triboelectric surface charge density. However, due to high-voltage air breakdown, most of the enhanced surface charge density brought by material/surface optimization or external ion injection is not retainable or usable for electricity generation during the operation of contact-separation-triggered TENGs. Here, the existence of the air breakdown effect in a contact-separation mode TENG with a low threshold surface charge density of ≈40–50 µC m−2 is first validated under the high impedance external load, and then followed by the theoretical study of the maximized effective energy output as limited by air breakdown for contact-separation-triggered TENGs. The effects of air pressure and gas composition are also studied and propose promising solutions for reducing the air breakdown effect. This research provides a crucial fundamental study for TENG technology and its further development and applications.
Benkhelifa, Fatma; Salem, Ahmed Sultan; Alouini, Mohamed-Slim
2015-01-01
scenario where both the energy harvesting (EH) receiver and information decoding (ID) receiver at the relay have access to the whole received signal and its energy. The relay harvests the energy while receiving the signal from the source and uses
2014-01-01
Background Binding free energy and binding hot spots at protein-protein interfaces are two important research areas for understanding protein interactions. Computational methods have been developed previously for accurate prediction of binding free energy change upon mutation for interfacial residues. However, a large number of interrupted and unimportant atomic contacts are used in the training phase which caused accuracy loss. Results This work proposes a new method, βACV ASA , to predict the change of binding free energy after alanine mutations. βACV ASA integrates accessible surface area (ASA) and our newly defined β contacts together into an atomic contact vector (ACV). A β contact between two atoms is a direct contact without being interrupted by any other atom between them. A β contact’s potential contribution to protein binding is also supposed to be inversely proportional to its ASA to follow the water exclusion hypothesis of binding hot spots. Tested on a dataset of 396 alanine mutations, our method is found to be superior in classification performance to many other methods, including Robetta, FoldX, HotPOINT, an ACV method of β contacts without ASA integration, and ACV ASA methods (similar to βACV ASA but based on distance-cutoff contacts). Based on our data analysis and results, we can draw conclusions that: (i) our method is powerful in the prediction of binding free energy change after alanine mutation; (ii) β contacts are better than distance-cutoff contacts for modeling the well-organized protein-binding interfaces; (iii) β contacts usually are only a small fraction number of the distance-based contacts; and (iv) water exclusion is a necessary condition for a residue to become a binding hot spot. Conclusions βACV ASA is designed using the advantages of both β contacts and water exclusion. It is an excellent tool to predict binding free energy changes and binding hot spots after alanine mutation. PMID:24568581
Bogler, Carsten; Mehnert, Jan; Steinbrink, Jens; Haynes, John-Dylan
2014-01-01
Sustained, long-term cognitive workload is associated with variations and decrements in performance. Such fluctuations in vigilance can be a risk factor especially during dangerous attention demanding activities. Functional MRI studies have shown that attentional performance is correlated with BOLD-signals, especially in parietal and prefrontal cortical regions. An interesting question is whether these BOLD-signals could be measured in real-world scenarios, say to warn in a dangerous workplace whenever a subjects' vigilance is low. Because fMRI lacks the mobility needed for such applications, we tested whether the monitoring of vigilance might be possible using Near-Infrared Spectroscopy (NIRS). NIRS is a highly mobile technique that measures hemodynamics in the surface of the brain. We demonstrate that non-invasive NIRS signals correlate with vigilance. These signals carry enough information to decode subjects' reaction times at a single trial level.
Directory of Open Access Journals (Sweden)
Carsten Bogler
Full Text Available Sustained, long-term cognitive workload is associated with variations and decrements in performance. Such fluctuations in vigilance can be a risk factor especially during dangerous attention demanding activities. Functional MRI studies have shown that attentional performance is correlated with BOLD-signals, especially in parietal and prefrontal cortical regions. An interesting question is whether these BOLD-signals could be measured in real-world scenarios, say to warn in a dangerous workplace whenever a subjects' vigilance is low. Because fMRI lacks the mobility needed for such applications, we tested whether the monitoring of vigilance might be possible using Near-Infrared Spectroscopy (NIRS. NIRS is a highly mobile technique that measures hemodynamics in the surface of the brain. We demonstrate that non-invasive NIRS signals correlate with vigilance. These signals carry enough information to decode subjects' reaction times at a single trial level.
Astrophysics Decoding the cosmos
Irwin, Judith A
2007-01-01
Astrophysics: Decoding the Cosmos is an accessible introduction to the key principles and theories underlying astrophysics. This text takes a close look at the radiation and particles that we receive from astronomical objects, providing a thorough understanding of what this tells us, drawing the information together using examples to illustrate the process of astrophysics. Chapters dedicated to objects showing complex processes are written in an accessible manner and pull relevant background information together to put the subject firmly into context. The intention of the author is that the book will be a 'tool chest' for undergraduate astronomers wanting to know the how of astrophysics. Students will gain a thorough grasp of the key principles, ensuring that this often-difficult subject becomes more accessible.
Neural Decoder for Topological Codes
Torlai, Giacomo; Melko, Roger G.
2017-07-01
We present an algorithm for error correction in topological codes that exploits modern machine learning techniques. Our decoder is constructed from a stochastic neural network called a Boltzmann machine, of the type extensively used in deep learning. We provide a general prescription for the training of the network and a decoding strategy that is applicable to a wide variety of stabilizer codes with very little specialization. We demonstrate the neural decoder numerically on the well-known two-dimensional toric code with phase-flip errors.
Pairwise contact energy statistical potentials can help to find probability of point mutations.
Saravanan, K M; Suvaithenamudhan, S; Parthasarathy, S; Selvaraj, S
2017-01-01
To adopt a particular fold, a protein requires several interactions between its amino acid residues. The energetic contribution of these residue-residue interactions can be approximated by extracting statistical potentials from known high resolution structures. Several methods based on statistical potentials extracted from unrelated proteins are found to make a better prediction of probability of point mutations. We postulate that the statistical potentials extracted from known structures of similar folds with varying sequence identity can be a powerful tool to examine probability of point mutation. By keeping this in mind, we have derived pairwise residue and atomic contact energy potentials for the different functional families that adopt the (α/β) 8 TIM-Barrel fold. We carried out computational point mutations at various conserved residue positions in yeast Triose phosphate isomerase enzyme for which experimental results are already reported. We have also performed molecular dynamics simulations on a subset of point mutants to make a comparative study. The difference in pairwise residue and atomic contact energy of wildtype and various point mutations reveals probability of mutations at a particular position. Interestingly, we found that our computational prediction agrees with the experimental studies of Silverman et al. (Proc Natl Acad Sci 2001;98:3092-3097) and perform better prediction than i Mutant and Cologne University Protein Stability Analysis Tool. The present work thus suggests deriving pairwise contact energy potentials and molecular dynamics simulations of functionally important folds could help us to predict probability of point mutations which may ultimately reduce the time and cost of mutation experiments. Proteins 2016; 85:54-64. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.
Fast decoding algorithms for geometric coded apertures
International Nuclear Information System (INIS)
Byard, Kevin
2015-01-01
Fast decoding algorithms are described for the class of coded aperture designs known as geometric coded apertures which were introduced by Gourlay and Stephen. When compared to the direct decoding method, the algorithms significantly reduce the number of calculations required when performing the decoding for these apertures and hence speed up the decoding process. Experimental tests confirm the efficacy of these fast algorithms, demonstrating a speed up of approximately two to three orders of magnitude over direct decoding.
Recovery of flue gas energy in heat integrated IGCC power plants using the contact economizer system
CSIR Research Space (South Africa)
Madzivhandila, V
2010-10-01
Full Text Available Asia Pacific Confederation of APCChE 2010 Chemical Engineering Congress October 5-8, 2010, Taipei � �� Recovery of flue gas energy in heat integrated IGCC power plants using the contact economizer system Vhutshilo Madzivhandilaa, Thokozani... temperature and the thermal efficiency of the plant. The 13th Asia Pacific Confederation of APCChE 2010 Chemical Engineering Congress October 5-8, 2010, Taipei � �� 1. Introduction The IGCC (Integrated Gasification Combined Cycle) is one...
General Retarded Contact Self-energies in and beyond the Non-equilibrium Green's Functions Method
International Nuclear Information System (INIS)
Kubis, Tillmann; He, Yu; Andrawis, Robert; Klimeck, Gerhard
2016-01-01
Retarded contact self-energies in the framework of nonequilibrium Green's functions allow to model the impact of lead structures on the device without explicitly including the leads in the actual device calculation. Most of the contact self-energy algorithms are limited to homogeneous or periodic, semi-infinite lead structures. In this work, the complex absorbing potential method is extended to solve retarded contact self-energies for arbitrary lead structures, including irregular and randomly disordered leads. This method is verified for regular leads against common approaches and on physically equivalent, but numerically different irregular leads. Transmission results on randomly alloyed In 0.5 Ga 0.5 As structures show the importance of disorder in the leads. The concept of retarded contact self-energies is expanded to model passivation of atomically resolved surfaces without explicitly increasing the device's Hamiltonian. (paper)
Workshop on Direct Contact Heat Transfer at the Solar Energy Research Institute
Boehm, R
1988-01-01
to increase the use of direct contact processes, the National Science Foundation sup ported a workshop on direct contact heat transfer at the Solar Energy Research Insti tute in the summer of 1985. We served as organizers for this workshop, which em phasized an area of thermal engineering that, in our opinion, has great promise for the future, but has not yet reached the point of wide-spread commercial application. Hence, a summary of the state of knowledge at this point is timely. The workshop had a dual objective: 1. To summarize the current state of knowledge in such a form that industrial practi tioners can make use of the available information. 2. To indicate the research and development needed to advance the state-of-the-art, indicating not only what kind of research is needed, but also the industrial poten tial that could be realized if the information to be obtained through the proposed research activities were available.
Efficient universal computing architectures for decoding neural activity.
Directory of Open Access Journals (Sweden)
Benjamin I Rapoport
is consequently energy efficient. We validate the performance of our overall system by decoding electrophysiologic data from a behaving rodent.
Orientation decoding: Sense in spirals?
Clifford, Colin W G; Mannion, Damien J
2015-04-15
The orientation of a visual stimulus can be successfully decoded from the multivariate pattern of fMRI activity in human visual cortex. Whether this capacity requires coarse-scale orientation biases is controversial. We and others have advocated the use of spiral stimuli to eliminate a potential coarse-scale bias-the radial bias toward local orientations that are collinear with the centre of gaze-and hence narrow down the potential coarse-scale biases that could contribute to orientation decoding. The usefulness of this strategy is challenged by the computational simulations of Carlson (2014), who reported the ability to successfully decode spirals of opposite sense (opening clockwise or counter-clockwise) from the pooled output of purportedly unbiased orientation filters. Here, we elaborate the mathematical relationship between spirals of opposite sense to confirm that they cannot be discriminated on the basis of the pooled output of unbiased or radially biased orientation filters. We then demonstrate that Carlson's (2014) reported decoding ability is consistent with the presence of inadvertent biases in the set of orientation filters; biases introduced by their digital implementation and unrelated to the brain's processing of orientation. These analyses demonstrate that spirals must be processed with an orientation bias other than the radial bias for successful decoding of spiral sense. Copyright © 2014 Elsevier Inc. All rights reserved.
Idarraga Alarcon, G.A.; Burgelman, N.D.M.; Meza Meza, J.; Toro, A.; Li, Z.
2015-01-01
This work investigates the energy dissipation in a wheel/rail system through friction work modeling. In order to identify the effect of the friction coefficient on the energy dissipation in the wheel/rail contact, several simulations were performed using a 3D multibody model of a railway vehicle
Improved decoding for a concatenated coding system
DEFF Research Database (Denmark)
Paaske, Erik
1990-01-01
The concatenated coding system recommended by CCSDS (Consultative Committee for Space Data Systems) uses an outer (255,233) Reed-Solomon (RS) code based on 8-b symbols, followed by the block interleaver and an inner rate 1/2 convolutional code with memory 6. Viterbi decoding is assumed. Two new...... decoding procedures based on repeated decoding trials and exchange of information between the two decoders and the deinterleaver are proposed. In the first one, where the improvement is 0.3-0.4 dB, only the RS decoder performs repeated trials. In the second one, where the improvement is 0.5-0.6 dB, both...... decoders perform repeated decoding trials and decoding information is exchanged between them...
Resonant tunneling diodes as energy-selective contacts used in hot-carrier solar cells
International Nuclear Information System (INIS)
Takeda, Yasuhiko; Sugimoto, Noriaki; Ichiki, Akihisa; Kusano, Yuya; Motohiro, Tomoyoshi
2015-01-01
Among the four features unique to hot-carrier solar cells (HC-SCs): (i) carrier thermalization time and (ii) carrier equilibration time in the absorber, (iii) energy-selection width and (iv) conductance of the energy-selective contacts (ESCs), requisites of (i)-(iii) for high conversion efficiency have been clarified. We have tackled the remaining issues related to (iv) in the present study. The detailed balance model of HC-SC operation has been improved to involve a finite value of the ESC conductance to find the required values, which in turn has been revealed to be feasible using resonant tunneling diodes (RTDs) consisting of semiconductor quantum dots (QDs) and quantum wells (QWs) by means of a formulation to calculate the conductance of the QD- and QW-RTDs derived using the rigorous solutions of the effective-mass Hamiltonians. Thus, all of the four requisites unique to HC-SCs to achieve high conversion efficiency have been elucidated, and the two requisites related to the ESCs can be fulfilled using the QD- and QW-RTDs
Resonant tunneling diodes as energy-selective contacts used in hot-carrier solar cells
Energy Technology Data Exchange (ETDEWEB)
Takeda, Yasuhiko, E-mail: takeda@mosk.tytlabs.co.jp; Sugimoto, Noriaki [Toyota Central Research and Development Laboratories, Inc., 41-1, Yokomichi, Nagakute, Aichi 480-1192 (Japan); Ichiki, Akihisa [Green Mobility Collaborative Research Center, Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8601 (Japan); Kusano, Yuya [Green Mobility Collaborative Research Center, Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8601 (Japan); Toyota Motor Corp., 1200 Mishuku, Susono, Shizuoka 410-1193 (Japan); Motohiro, Tomoyoshi [Toyota Central Research and Development Laboratories, Inc., 41-1, Yokomichi, Nagakute, Aichi 480-1192 (Japan); Green Mobility Collaborative Research Center, Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8601 (Japan); Graduate School of Engineering, Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8601 (Japan)
2015-09-28
Among the four features unique to hot-carrier solar cells (HC-SCs): (i) carrier thermalization time and (ii) carrier equilibration time in the absorber, (iii) energy-selection width and (iv) conductance of the energy-selective contacts (ESCs), requisites of (i)-(iii) for high conversion efficiency have been clarified. We have tackled the remaining issues related to (iv) in the present study. The detailed balance model of HC-SC operation has been improved to involve a finite value of the ESC conductance to find the required values, which in turn has been revealed to be feasible using resonant tunneling diodes (RTDs) consisting of semiconductor quantum dots (QDs) and quantum wells (QWs) by means of a formulation to calculate the conductance of the QD- and QW-RTDs derived using the rigorous solutions of the effective-mass Hamiltonians. Thus, all of the four requisites unique to HC-SCs to achieve high conversion efficiency have been elucidated, and the two requisites related to the ESCs can be fulfilled using the QD- and QW-RTDs.
Soft-decision decoding of RS codes
DEFF Research Database (Denmark)
Justesen, Jørn
2005-01-01
By introducing a few simplifying assumptions we derive a simple condition for successful decoding using the Koetter-Vardy algorithm for soft-decision decoding of RS codes. We show that the algorithm has a significant advantage over hard decision decoding when the code rate is low, when two or more...
Toric Codes, Multiplicative Structure and Decoding
DEFF Research Database (Denmark)
Hansen, Johan Peder
2017-01-01
Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for \\emph{decoding}, resembling the decoding of Reed-Solomon codes and al...
FPGA Realization of Memory 10 Viterbi Decoder
DEFF Research Database (Denmark)
Paaske, Erik; Bach, Thomas Bo; Andersen, Jakob Dahl
1997-01-01
sequence mode when feedback from the Reed-Solomon decoder is available. The Viterbi decoder is realized using two Altera FLEX 10K50 FPGA's. The overall operating speed is 30 kbit/s, and since up to three iterations are performed for each frame and only one decoder is used, the operating speed...
Fačkovec, Boris; Vondrášek, Jiří
2012-10-25
Although a contact is an essential measurement for the topology as well as strength of non-covalent interactions in biomolecules and their complexes, there is no general agreement in the definition of this feature. Most of the definitions work with simple geometric criteria which do not fully reflect the energy content or ability of the biomolecular building blocks to arrange their environment. We offer a reasonable solution to this problem by distinguishing between "productive" and "non-productive" contacts based on their interaction energy strength and properties. We have proposed a method which converts the protein topology into a contact map that represents interactions with statistically significant high interaction energies. We do not prove that these contacts are exclusively stabilizing, but they represent a gateway to thermodynamically important rather than geometry-based contacts. The process is based on protein fragmentation and calculation of interaction energies using the OPLS force field and relies on pairwise additivity of amino acid interactions. Our approach integrates the treatment of different types of interactions, avoiding the problems resulting from different contributions to the overall stability and the different effect of the environment. The first applications on a set of homologous proteins have shown the usefulness of this classification for a sound estimate of protein stability.
Decoding intention at sensorimotor timescales.
Directory of Open Access Journals (Sweden)
Mathew Salvaris
Full Text Available The ability to decode an individual's intentions in real time has long been a 'holy grail' of research on human volition. For example, a reliable method could be used to improve scientific study of voluntary action by allowing external probe stimuli to be delivered at different moments during development of intention and action. Several Brain Computer Interface applications have used motor imagery of repetitive actions to achieve this goal. These systems are relatively successful, but only if the intention is sustained over a period of several seconds; much longer than the timescales identified in psychophysiological studies for normal preparation for voluntary action. We have used a combination of sensorimotor rhythms and motor imagery training to decode intentions in a single-trial cued-response paradigm similar to those used in human and non-human primate motor control research. Decoding accuracy of over 0.83 was achieved with twelve participants. With this approach, we could decode intentions to move the left or right hand at sub-second timescales, both for instructed choices instructed by an external stimulus and for free choices generated intentionally by the participant. The implications for volition are considered.
Dynamics of intracellular information decoding
International Nuclear Information System (INIS)
Kobayashi, Tetsuya J; Kamimura, Atsushi
2011-01-01
A variety of cellular functions are robust even to substantial intrinsic and extrinsic noise in intracellular reactions and the environment that could be strong enough to impair or limit them. In particular, of substantial importance is cellular decision-making in which a cell chooses a fate or behavior on the basis of information conveyed in noisy external signals. For robust decoding, the crucial step is filtering out the noise inevitably added during information transmission. As a minimal and optimal implementation of such an information decoding process, the autocatalytic phosphorylation and autocatalytic dephosphorylation (aPadP) cycle was recently proposed. Here, we analyze the dynamical properties of the aPadP cycle in detail. We describe the dynamical roles of the stationary and short-term responses in determining the efficiency of information decoding and clarify the optimality of the threshold value of the stationary response and its information-theoretical meaning. Furthermore, we investigate the robustness of the aPadP cycle against the receptor inactivation time and intrinsic noise. Finally, we discuss the relationship among information decoding with information-dependent actions, bet-hedging and network modularity
Dynamics of intracellular information decoding.
Kobayashi, Tetsuya J; Kamimura, Atsushi
2011-10-01
A variety of cellular functions are robust even to substantial intrinsic and extrinsic noise in intracellular reactions and the environment that could be strong enough to impair or limit them. In particular, of substantial importance is cellular decision-making in which a cell chooses a fate or behavior on the basis of information conveyed in noisy external signals. For robust decoding, the crucial step is filtering out the noise inevitably added during information transmission. As a minimal and optimal implementation of such an information decoding process, the autocatalytic phosphorylation and autocatalytic dephosphorylation (aPadP) cycle was recently proposed. Here, we analyze the dynamical properties of the aPadP cycle in detail. We describe the dynamical roles of the stationary and short-term responses in determining the efficiency of information decoding and clarify the optimality of the threshold value of the stationary response and its information-theoretical meaning. Furthermore, we investigate the robustness of the aPadP cycle against the receptor inactivation time and intrinsic noise. Finally, we discuss the relationship among information decoding with information-dependent actions, bet-hedging and network modularity.
Human Genome Research: Decoding DNA
dropdown arrow Site Map A-Z Index Menu Synopsis Human Genome Research: Decoding DNA Resources with of the DNA double helix during April 2003. James D. Watson, Francis Crick, and Maurice Wilkins were company Celera announced the completion of a "working draft" reference DNA sequence of the human
Liu, K. Y.
1986-01-01
High-speed decoder intended for use with Reed-Solomon (RS) codes of long code length and high error-correcting capability. Design based on algorithm that includes high-radix Fermat transform procedure, which is most efficient for high speeds. RS code in question has code-word length of 256 symbols, of which 224 are information symbols and 32 are redundant.
On Decoding Interleaved Chinese Remainder Codes
DEFF Research Database (Denmark)
Li, Wenhui; Sidorenko, Vladimir; Nielsen, Johan Sebastian Rosenkilde
2013-01-01
We model the decoding of Interleaved Chinese Remainder codes as that of finding a short vector in a Z-lattice. Using the LLL algorithm, we obtain an efficient decoding algorithm, correcting errors beyond the unique decoding bound and having nearly linear complexity. The algorithm can fail...... with a probability dependent on the number of errors, and we give an upper bound for this. Simulation results indicate that the bound is close to the truth. We apply the proposed decoding algorithm for decoding a single CR code using the idea of “Power” decoding, suggested for Reed-Solomon codes. A combination...... of these two methods can be used to decode low-rate Interleaved Chinese Remainder codes....
Energy conserving schemes for the simulation of musical instrument contact dynamics
Chatziioannou, Vasileios; van Walstijn, Maarten
2015-03-01
Collisions are an innate part of the function of many musical instruments. Due to the nonlinear nature of contact forces, special care has to be taken in the construction of numerical schemes for simulation and sound synthesis. Finite difference schemes and other time-stepping algorithms used for musical instrument modelling purposes are normally arrived at by discretising a Newtonian description of the system. However because impact forces are non-analytic functions of the phase space variables, algorithm stability can rarely be established this way. This paper presents a systematic approach to deriving energy conserving schemes for frictionless impact modelling. The proposed numerical formulations follow from discretising Hamilton's equations of motion, generally leading to an implicit system of nonlinear equations that can be solved with Newton's method. The approach is first outlined for point mass collisions and then extended to distributed settings, such as vibrating strings and beams colliding with rigid obstacles. Stability and other relevant properties of the proposed approach are discussed and further demonstrated with simulation examples. The methodology is exemplified through a case study on tanpura string vibration, with the results confirming the main findings of previous studies on the role of the bridge in sound generation with this type of string instrument.
Energy Technology Data Exchange (ETDEWEB)
Holzapfel, Andreas (ed.)
2011-07-01
The manual is in three sections: 1. Parliaments and governments, survey and organization; 2. Biographic section, with 453 biography; 3. Index of names. The first section informs on the organizational structure of parliaments and governments. The subject of energy is discussed three times, i.e. in 'Economics', 'Environment', and 'Research'. For each parliament, the members of the energy policy TCs are listed, followed by names and contact addresses of the senior officials and departments with contact data, both on a national, state, and European scale. The second section contains the biographies of energy policy experts of the German parliament and government, the sixteen land parliaments and governments, and the European Commissions. As the subject of energy is highly interdisciplinary, the authors selected the energy policy committees of the German parliament and state parliaments. The biographies of the committee members are presented in the text.
... Contact Us Media contacts Advertising contacts AAD logo Advertising, marketing and sponsorships Legal notice Copyright © 2018 American Academy ... strictly prohibited without prior written permission. AAD logo Advertising, marketing and sponsorships Legal notice Copyright © 2017 American Academy ...
LDPC Decoding on GPU for Mobile Device
Directory of Open Access Journals (Sweden)
Yiqin Lu
2016-01-01
Full Text Available A flexible software LDPC decoder that exploits data parallelism for simultaneous multicode words decoding on the mobile device is proposed in this paper, supported by multithreading on OpenCL based graphics processing units. By dividing the check matrix into several parts to make full use of both the local memory and private memory on GPU and properly modify the code capacity each time, our implementation on a mobile phone shows throughputs above 100 Mbps and delay is less than 1.6 millisecond in decoding, which make high-speed communication like video calling possible. To realize efficient software LDPC decoding on the mobile device, the LDPC decoding feature on communication baseband chip should be replaced to save the cost and make it easier to upgrade decoder to be compatible with a variety of channel access schemes.
A class of Sudan-decodable codes
DEFF Research Database (Denmark)
Nielsen, Rasmus Refslund
2000-01-01
In this article, Sudan's algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed-Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based...... on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed-Solomon and Hermitian codes are made....
Interior point decoding for linear vector channels
International Nuclear Information System (INIS)
Wadayama, T
2008-01-01
In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter-symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem
Interior point decoding for linear vector channels
Energy Technology Data Exchange (ETDEWEB)
Wadayama, T [Nagoya Institute of Technology, Gokiso, Showa-ku, Nagoya, Aichi, 466-8555 (Japan)], E-mail: wadayama@nitech.ac.jp
2008-01-15
In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter-symbol interference channels and partial response channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem.
Video encoder/decoder for encoding/decoding motion compensated images
1996-01-01
Video encoder and decoder, provided with a motion compensator for motion-compensated video coding or decoding in which a picture is coded or decoded in blocks in alternately horizontal and vertical steps. The motion compensator is provided with addressing means (160) and controlled multiplexers
Directory of Open Access Journals (Sweden)
Enrico Pagano
2013-03-01
Full Text Available The paper aims to contribute to the use of electric double layer capacitor (EDLC sets for boosting voltages of contact lines in urban and suburban railway traction systems. Different electrical configurations of contact lines are considered and investigated. For each of them, proper mathematical models are suggested to evaluate the electrical performances of the contact lines. They give rise, also, to sample design procedures for the sizing of the most appropriate energy storage systems, to be distributed along the lines, for boosting line voltages and avoiding undesired voltage drops. A numerical example based on the “Cumana” suburban Naples railway network is presented to give an idea of the weights and sizes of electric double layer capacitors needed to boost the voltage of a sample contact line. In particular, three different EDLC systems, for a overall installed energy of 9.6 kWh, have been placed nearby the stations presenting the highest voltage drops during the most representative situation of trains’ service. The new voltage drop is equal to 32% of that obtained in absence of EDLCs.
Energy Technology Data Exchange (ETDEWEB)
Iannuzzi, Diago [University of Federico II, Naples (Italy). Electrical Engineering Department; Pagano, Enrico [University of Federico II, Naples (Italy). Electrical Engineering Department; Tricoli, Pietro [University of Birmingham (United Kingdom). School of Electronic, Electrical and Computer Engineering
2013-04-15
The paper aims to contribute to the use of electric double layer capacitor (EDLC) sets for boosting voltages of contact lines in urban and suburban railway traction systems. Different electrical configurations of contact lines are considered and investigated. For each of them, proper mathematical models are suggested to evaluate the electrical performances of the contact lines. They give rise, also, to sample design procedures for the sizing of the most appropriate energy storage systems, to be distributed along the lines, for boosting line voltages and avoiding undesired voltage drops. A numerical example based on the “Cumana” suburban Naples railway network is presented to give an idea of the weights and sizes of electric double layer capacitors needed to boost the voltage of a sample contact line. In particular, three different EDLC systems, for a overall installed energy of 9.6 kWh, have been placed nearby the stations presenting the highest voltage drops during the most representative situation of trains’ service. The new voltage drop is equal to 32% of that obtained in absence of EDLCs.
Evaluation framework for K-best sphere decoders
Shen, Chungan; Eltawil, Ahmed M.; Salama, Khaled N.
2010-01-01
or receive antennas. Tree-searching type decoder structures such as Sphere decoder and K-best decoder present an interesting trade-off between complexity and performance. Many algorithmic developments and VLSI implementations have been reported in literature
Directory of Open Access Journals (Sweden)
Naotsugu Tsuchiya
Full Text Available Faces are processed by a neural system with distributed anatomical components, but the roles of these components remain unclear. A dominant theory of face perception postulates independent representations of invariant aspects of faces (e.g., identity in ventral temporal cortex including the fusiform gyrus, and changeable aspects of faces (e.g., emotion in lateral temporal cortex including the superior temporal sulcus. Here we recorded neuronal activity directly from the cortical surface in 9 neurosurgical subjects undergoing epilepsy monitoring while they viewed static and dynamic facial expressions. Applying novel decoding analyses to the power spectrogram of electrocorticograms (ECoG from over 100 contacts in ventral and lateral temporal cortex, we found better representation of both invariant and changeable aspects of faces in ventral than lateral temporal cortex. Critical information for discriminating faces from geometric patterns was carried by power modulations between 50 to 150 Hz. For both static and dynamic face stimuli, we obtained a higher decoding performance in ventral than lateral temporal cortex. For discriminating fearful from happy expressions, critical information was carried by power modulation between 60-150 Hz and below 30 Hz, and again better decoded in ventral than lateral temporal cortex. Task-relevant attention improved decoding accuracy more than 10% across a wide frequency range in ventral but not at all in lateral temporal cortex. Spatial searchlight decoding showed that decoding performance was highest around the middle fusiform gyrus. Finally, we found that the right hemisphere, in general, showed superior decoding to the left hemisphere. Taken together, our results challenge the dominant model for independent face representation of invariant and changeable aspects: information about both face attributes was better decoded from a single region in the middle fusiform gyrus.
Concatenated coding system with iterated sequential inner decoding
DEFF Research Database (Denmark)
Jensen, Ole Riis; Paaske, Erik
1995-01-01
We describe a concatenated coding system with iterated sequential inner decoding. The system uses convolutional codes of very long constraint length and operates on iterations between an inner Fano decoder and an outer Reed-Solomon decoder......We describe a concatenated coding system with iterated sequential inner decoding. The system uses convolutional codes of very long constraint length and operates on iterations between an inner Fano decoder and an outer Reed-Solomon decoder...
Application of Beyond Bound Decoding for High Speed Optical Communications
DEFF Research Database (Denmark)
Li, Bomin; Larsen, Knud J.; Vegas Olmos, Juan José
2013-01-01
This paper studies the application of beyond bound decoding method for high speed optical communications. This hard-decision decoding method outperforms traditional minimum distance decoding method, with a total net coding gain of 10.36 dB.......This paper studies the application of beyond bound decoding method for high speed optical communications. This hard-decision decoding method outperforms traditional minimum distance decoding method, with a total net coding gain of 10.36 dB....
Modified Dynamic Decode-and-Forward Relaying Protocol for Type II Relay in LTE-Advanced and Beyond.
Nam, Sung Sik; Alouini, Mohamed-Slim; Choi, Seyeong
2016-01-01
In this paper, we propose a modified dynamic decode-and-forward (MoDDF) relaying protocol to meet the critical requirements for user equipment (UE) relays in next-generation cellular systems (e.g., LTE-Advanced and beyond). The proposed MoDDF realizes the fast jump-in relaying and the sequential decoding with an application of random codeset to encoding and re-encoding process at the source and the multiple UE relays, respectively. A subframe-by-subframe decoding based on the accumulated (or buffered) messages is employed to achieve energy, information, or mixed combining. Finally, possible early termination of decoding at the end user can lead to the higher spectral efficiency and more energy saving by reducing the frequency of redundant subframe transmission and decoding. These attractive features eliminate the need of directly exchanging control messages between multiple UE relays and the end user, which is an important prerequisite for the practical UE relay deployment.
Frank, Florian; Liu, Chen; Scanziani, Alessio; Alpak, Faruk O; Riviere, Beatrice
2018-08-01
We consider an energy-based boundary condition to impose an equilibrium wetting angle for the Cahn-Hilliard-Navier-Stokes phase-field model on voxel-set-type computational domains. These domains typically stem from μCT (micro computed tomography) imaging of porous rock and approximate a (on μm scale) smooth domain with a certain resolution. Planar surfaces that are perpendicular to the main axes are naturally approximated by a layer of voxels. However, planar surfaces in any other directions and curved surfaces yield a jagged/topologically rough surface approximation by voxels. For the standard Cahn-Hilliard formulation, where the contact angle between the diffuse interface and the domain boundary (fluid-solid interface/wall) is 90°, jagged surfaces have no impact on the contact angle. However, a prescribed contact angle smaller or larger than 90° on jagged voxel surfaces is amplified. As a remedy, we propose the introduction of surface energy correction factors for each fluid-solid voxel face that counterbalance the difference of the voxel-set surface area with the underlying smooth one. The discretization of the model equations is performed with the discontinuous Galerkin method. However, the presented semi-analytical approach of correcting the surface energy is equally applicable to other direct numerical methods such as finite elements, finite volumes, or finite differences, since the correction factors appear in the strong formulation of the model. Copyright © 2018 Elsevier Inc. All rights reserved.
An LDPC decoder architecture for wireless sensor network applications.
Biroli, Andrea Dario Giancarlo; Martina, Maurizio; Masera, Guido
2012-01-01
The pervasive use of wireless sensors in a growing spectrum of human activities reinforces the need for devices with low energy dissipation. In this work, coded communication between a couple of wireless sensor devices is considered as a method to reduce the dissipated energy per transmitted bit with respect to uncoded communication. Different Low Density Parity Check (LDPC) codes are considered to this purpose and post layout results are shown for a low-area low-energy decoder, which offers percentage energy savings with respect to the uncoded solution in the range of 40%-80%, depending on considered environment, distance and bit error rate.
An LDPC Decoder Architecture for Wireless Sensor Network Applications
Giancarlo Biroli, Andrea Dario; Martina, Maurizio; Masera, Guido
2012-01-01
The pervasive use of wireless sensors in a growing spectrum of human activities reinforces the need for devices with low energy dissipation. In this work, coded communication between a couple of wireless sensor devices is considered as a method to reduce the dissipated energy per transmitted bit with respect to uncoded communication. Different Low Density Parity Check (LDPC) codes are considered to this purpose and post layout results are shown for a low-area low-energy decoder, which offers percentage energy savings with respect to the uncoded solution in the range of 40%–80%, depending on considered environment, distance and bit error rate. PMID:22438724
On minimizing the maximum broadcast decoding delay for instantly decodable network coding
Douik, Ahmed S.
2014-09-01
In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a definition of delay for IDNC allows a more equitable distribution of the delays between the different receivers and thus a better Quality of Service (QoS). In order to solve this problem, we first derive the expressions for the probability distributions of maximum decoding delay increments. Given these expressions, we formulate the problem as a maximum weight clique problem in the IDNC graph. Although this problem is known to be NP-hard, we design a greedy algorithm to perform effective packet selection. Through extensive simulations, we compare the sum decoding delay and the max decoding delay experienced when applying the policies to minimize the sum decoding delay and our policy to reduce the max decoding delay. Simulations results show that our policy gives a good agreement among all the delay aspects in all situations and outperforms the sum decoding delay policy to effectively minimize the sum decoding delay when the channel conditions become harsher. They also show that our definition of delay significantly improve the number of served receivers when they are subject to strict delay constraints.
Best linear decoding of random mask images
International Nuclear Information System (INIS)
Woods, J.W.; Ekstrom, M.P.; Palmieri, T.M.; Twogood, R.E.
1975-01-01
In 1968 Dicke proposed coded imaging of x and γ rays via random pinholes. Since then, many authors have agreed with him that this technique can offer significant image improvement. A best linear decoding of the coded image is presented, and its superiority over the conventional matched filter decoding is shown. Experimental results in the visible light region are presented. (U.S.)
Oppositional Decoding as an Act of Resistance.
Steiner, Linda
1988-01-01
Argues that contributors to the "No Comment" feature of "Ms." magazine are engaging in oppositional decoding and speculates on why this is a satisfying group process. Also notes such decoding presents another challenge to the idea that mass media has the same effect on all audiences. (SD)
Faults and energy losses in electric contacts; Fallas y perdidas de energia en contactos electricos
Energy Technology Data Exchange (ETDEWEB)
Bratu Serban, Neagu; Campero Littlewood, Eduardo [Universidad Autonoma Metropolitana, Mexico, D. F. (Mexico)
1994-12-31
In this paper a brief description is made of the behavior of the electric contacts and the elements that affect in the heat release during its operation. The mathematical expressions describing this phenomenon are presented. The losses that can be produced at the contacts are evaluated and the graphs, where the behavior of these different operating conditions can be seen, are included. [Espanol] En este articulo se hace una breve descripcion del comportamiento de los contactos electricos y de los elementos que influyen en la generacion de calor durante su operacion. Se presentan las expresiones con las que se describe matematicamente este fenomeno. Se evaluan las perdidas que pueden llegar a tenerse en los contactos y se incluyen graficas donde puede verse el comportamiento de estos en diferentes condiciones de operacion.
Faults and energy losses in electric contacts; Fallas y perdidas de energia en contactos electricos
Energy Technology Data Exchange (ETDEWEB)
Bratu Serban, Neagu; Campero Littlewood, Eduardo [Universidad Autonoma Metropolitana, Mexico, D. F. (Mexico)
1993-12-31
In this paper a brief description is made of the behavior of the electric contacts and the elements that affect in the heat release during its operation. The mathematical expressions describing this phenomenon are presented. The losses that can be produced at the contacts are evaluated and the graphs, where the behavior of these different operating conditions can be seen, are included. [Espanol] En este articulo se hace una breve descripcion del comportamiento de los contactos electricos y de los elementos que influyen en la generacion de calor durante su operacion. Se presentan las expresiones con las que se describe matematicamente este fenomeno. Se evaluan las perdidas que pueden llegar a tenerse en los contactos y se incluyen graficas donde puede verse el comportamiento de estos en diferentes condiciones de operacion.
High Speed Frame Synchronization and Viterbi Decoding
DEFF Research Database (Denmark)
Paaske, Erik; Justesen, Jørn; Larsen, Knud J.
1996-01-01
The purpose of Phase 1 of the study is to describe the system structure and algorithms in sufficient detail to allow drawing the high level architecture of units containing frame synchronization and Viterbi decoding. The systems we consider are high data rate space communication systems. Also...... components. Node synchronization performed within a Viterbi decoder is discussed, and algorithms for frame synchronization are described and analyzed. We present a list of system configurations that we find potentially useful. Further, the high level architecture of units that contain frame synchronization...... and various other functions needed in a complete system is presented. Two such units are described, one for placement before the Viterbi decoder and another for placement after the decoder. The high level architectures of three possible implementations of Viterbi decoders are described: The first...
High Speed Frame Synchronization and Viterbi Decoding
DEFF Research Database (Denmark)
Paaske, Erik; Justesen, Jørn; Larsen, Knud J.
1998-01-01
The study has been divided into two phases. The purpose of Phase 1 of the study was to describe the system structure and algorithms in sufficient detail to allow drawing the high level architecture of units containing frame synchronization and Viterbi decoding. After selection of which specific...... potentially useful.Algorithms for frame synchronization are described and analyzed. Further, the high level architecture of units that contain frame synchronization and various other functions needed in a complete system is presented. Two such units are described, one for placement before the Viterbi decoder...... towards a realization in an FPGA.Node synchronization performed within a Viterbi decoder is discussed, and the high level architectures of three possible implementations of Viterbi decoders are described: The first implementation uses a number of commercially available decoders while the the two others...
The hybrid energy storages based on batteries and ultracapacitors for contact microwelding
Directory of Open Access Journals (Sweden)
Bondarenko Yu. V.
2014-08-01
Full Text Available Micro resistance welding is an effective way to reliably join small-scale parts. It is widely used in electronics and instrument-making. The important particularities of micro resistance welding are pulse character of energy consumption, non-linear load and special form of current pulses. So, these particularities of welding process cause negative influence on the mains. One of the known ways to avoid it is to use autonomous power supplies for micro resistance welding machines. The important task for building autonomous power supplies is to choose effective energy storages, which have high capacity and small internal resistance, and which are capable to be charged and deliver energy to load very quickly. The solution of this task is seen in using hybrid energy storages, which include accumulators and ultracapacitors. The accumulators are able to provide high energy capacitance and the ultracapacitors are able to provide fast energy delivery. The possibility of application of hybrid energy storages, based on accumulator batteries and ultracapacitors, in micro resistance welding machines is confirmed with computer simulation. Two variants of hybrid energy storages are proposed. These hybrid energy storages have high power and dynamic characteristics, which are sufficient to generate current pulses for welding according to necessary settings.
Energy Technology Data Exchange (ETDEWEB)
Belibel, R.; Avramoglou, T. [INSERM U1148, Laboratory for Vascular Translational Science (LVTS), Institut Galilée, Université Paris 13, Sorbonne Paris Cité, 99 Avenue Jean-Baptiste Clément, Villetaneuse F-93430 (France); Garcia, A. [CNRS UPR 3407, Laboratoire des Sciences des Procédés et des Matériau, Institut Galilée, Université Paris 13, Sorbonne Paris Cité, 99 Avenue Jean-Baptiste Clément, Villetaneuse F-93430 (France); Barbaud, C. [INSERM U1148, Laboratory for Vascular Translational Science (LVTS), Institut Galilée, Université Paris 13, Sorbonne Paris Cité, 99 Avenue Jean-Baptiste Clément, Villetaneuse F-93430 (France); Mora, L., E-mail: Laurence.mora@univ-paris13.fr [INSERM U1148, Laboratory for Vascular Translational Science (LVTS), Institut Galilée, Université Paris 13, Sorbonne Paris Cité, 99 Avenue Jean-Baptiste Clément, Villetaneuse F-93430 (France)
2016-02-01
Biodegradable and bioassimilable poly((R,S)-3,3 dimethylmalic acid) (PDMMLA) derivatives were synthesized and characterized in order to develop a new coating for coronary endoprosthesis enabling the reduction of restenosis. The PDMMLA was chemically modified to form different custom groups in its side chain. Three side groups were chosen: the hexyl group for its hydrophobic nature, the carboxylic acid and alcohol groups for their acid and neutral hydrophilic character, respectively. The sessile drop method was applied to characterize the wettability of biodegradable polymer film coatings. Surface energy and components were calculated. The van Oss approach helped reach not only the dispersive and polar acid–base components of surface energy but also acid and basic components. Surface topography was quantified by atomic force microscopy (AFM) and subnanometer average values of roughness (Ra) were obtained for all the analyzed surfaces. Thus, roughness was considered to have a negligible effect on wettability measurements. In contrast, heterogeneous surfaces had to be corrected by the Cassie–Baxter equation for copolymers (10/90, 20/80 and 30/70). The impact of this correction was quantified for all the wettability parameters. Very high relative corrections (%) were found, reaching 100% for energies and 30% for contact angles. - Highlights: • We develop different polymers with various chemical compositions. • Wettability properties were calculated using Cassie corrected contact angles. • Percentage of acid groups in polymers is directly correlated to acid part of SFE. • Cassie corrections are necessary for heterogeneous polymers.
Fast decoders for qudit topological codes
International Nuclear Information System (INIS)
Anwar, Hussain; Brown, Benjamin J; Campbell, Earl T; Browne, Dan E
2014-01-01
Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However, standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyse their error correction thresholds and efficiency. The first decoder is a generalization of a ‘hard-decisions’ decoder due to Bravyi and Haah (arXiv:1112.3252). We modify this decoder to overcome a percolation effect which limits its threshold performance for many-level quantum systems. The second decoder is a generalization of a ‘soft-decisions’ decoder due to Poulin and Duclos-Cianci (2010 Phys. Rev. Lett. 104 050504), with a small cell size to optimize the efficiency of implementation in the high dimensional case. In each case, we estimate thresholds for the uncorrelated bit-flip error model and provide a comparative analysis of the performance of both these approaches to error correction of qudit toric codes. (paper)
Iterative Decoding of Concatenated Codes: A Tutorial
Directory of Open Access Journals (Sweden)
Phillip A. Regalia
2005-05-01
Full Text Available The turbo decoding algorithm of a decade ago constituted a milestone in error-correction coding for digital communications, and has inspired extensions to generalized receiver topologies, including turbo equalization, turbo synchronization, and turbo CDMA, among others. Despite an accrued understanding of iterative decoding over the years, the Ã¢Â€Âœturbo principleÃ¢Â€Â remains elusive to master analytically, thereby inciting interest from researchers outside the communications domain. In this spirit, we develop a tutorial presentation of iterative decoding for parallel and serial concatenated codes, in terms hopefully accessible to a broader audience. We motivate iterative decoding as a computationally tractable attempt to approach maximum-likelihood decoding, and characterize fixed points in terms of a Ã¢Â€ÂœconsensusÃ¢Â€Â property between constituent decoders. We review how the decoding algorithm for both parallel and serial concatenated codes coincides with an alternating projection algorithm, which allows one to identify conditions under which the algorithm indeed converges to a maximum-likelihood solution, in terms of particular likelihood functions factoring into the product of their marginals. The presentation emphasizes a common framework applicable to both parallel and serial concatenated codes.
Junginger, Tobias; Calatroni, S.; Sublet, A.; Terenziani, G.; Prokscha, T.; Salman, Z.; Suter, A.; Proslier, T.; Zasadzinski, J.
2017-12-01
Point contact tunneling and low energy muon spin rotation are used to probe, on the same samples, the surface superconducting properties of micrometer thick niobium films deposited onto copper substrates using different sputtering techniques: diode, dc magnetron and HIPIMS. The combined results are compared to radio-frequency tests performances of RF cavities made with the same processes. Degraded surface superconducting properties are found to correlate to lower quality factors and stronger Q-slope. In addition, both techniques find evidence for surface paramagnetism on all samples and particularly on Nb films prepared by HIPIMS.
Decoding small surface codes with feedforward neural networks
Varsamopoulos, Savvas; Criger, Ben; Bertels, Koen
2018-01-01
Surface codes reach high error thresholds when decoded with known algorithms, but the decoding time will likely exceed the available time budget, especially for near-term implementations. To decrease the decoding time, we reduce the decoding problem to a classification problem that a feedforward neural network can solve. We investigate quantum error correction and fault tolerance at small code distances using neural network-based decoders, demonstrating that the neural network can generalize to inputs that were not provided during training and that they can reach similar or better decoding performance compared to previous algorithms. We conclude by discussing the time required by a feedforward neural network decoder in hardware.
The serial message-passing schedule for LDPC decoding algorithms
Liu, Mingshan; Liu, Shanshan; Zhou, Yuan; Jiang, Xue
2015-12-01
The conventional message-passing schedule for LDPC decoding algorithms is the so-called flooding schedule. It has the disadvantage that the updated messages cannot be used until next iteration, thus reducing the convergence speed . In this case, the Layered Decoding algorithm (LBP) based on serial message-passing schedule is proposed. In this paper the decoding principle of LBP algorithm is briefly introduced, and then proposed its two improved algorithms, the grouped serial decoding algorithm (Grouped LBP) and the semi-serial decoding algorithm .They can improve LBP algorithm's decoding speed while maintaining a good decoding performance.
Fast decoding algorithms for coded aperture systems
International Nuclear Information System (INIS)
Byard, Kevin
2014-01-01
Fast decoding algorithms are described for a number of established coded aperture systems. The fast decoding algorithms for all these systems offer significant reductions in the number of calculations required when reconstructing images formed by a coded aperture system and hence require less computation time to produce the images. The algorithms may therefore be of use in applications that require fast image reconstruction, such as near real-time nuclear medicine and location of hazardous radioactive spillage. Experimental tests confirm the efficacy of the fast decoding techniques
Three phase full wave dc motor decoder
Studer, P. A. (Inventor)
1977-01-01
A three phase decoder for dc motors is disclosed which employs an extremely simple six transistor circuit to derive six properly phased output signals for fullwave operation of dc motors. Six decoding transistors are coupled at their base-emitter junctions across a resistor network arranged in a delta configuration. Each point of the delta configuration is coupled to one of three position sensors which sense the rotational position of the motor. A second embodiment of the invention is disclosed in which photo-optical isolators are used in place of the decoding transistors.
Improved Power Decoding of One-Point Hermitian Codes
DEFF Research Database (Denmark)
Puchinger, Sven; Bouw, Irene; Rosenkilde, Johan Sebastian Heesemann
2017-01-01
We propose a new partial decoding algorithm for one-point Hermitian codes that can decode up to the same number of errors as the Guruswami–Sudan decoder. Simulations suggest that it has a similar failure probability as the latter one. The algorithm is based on a recent generalization of the power...... decoding algorithm for Reed–Solomon codes and does not require an expensive root-finding step. In addition, it promises improvements for decoding interleaved Hermitian codes....
Zhu, Guangpu
2018-01-26
In this paper, a fully discrete scheme which considers temporal and spatial discretizations is presented for the coupled Cahn-Hilliard equation in conserved form with the dynamic contact line condition and the Navier-Stokes equation with the generalized Navier boundary condition. Variable densities and viscosities are incorporated in this model. A rigorous proof of energy stability is provided for the fully discrete scheme based on a semi-implicit temporal discretization and a finite difference method on the staggered grids for the spatial discretization. A splitting method based on the pressure stabilization is implemented to solve the Navier-Stokes equation, while the stabilization approach is also used for the Cahn-Hilliard equation. Numerical results in both 2-D and 3-D demonstrate the accuracy, efficiency and decaying property of discrete energy of the proposed scheme.
Decoding of interleaved Reed-Solomon codes using improved power decoding
DEFF Research Database (Denmark)
Puchinger, Sven; Rosenkilde ne Nielsen, Johan
2017-01-01
We propose a new partial decoding algorithm for m-interleaved Reed-Solomon (IRS) codes that can decode, with high probability, a random error of relative weight 1 − Rm/m+1 at all code rates R, in time polynomial in the code length n. For m > 2, this is an asymptotic improvement over the previous...... state-of-the-art for all rates, and the first improvement for R > 1/3 in the last 20 years. The method combines collaborative decoding of IRS codes with power decoding up to the Johnson radius....
Low-Power Bitstream-Residual Decoder for H.264/AVC Baseline Profile Decoding
Directory of Open Access Journals (Sweden)
Xu Ke
2009-01-01
Full Text Available Abstract We present the design and VLSI implementation of a novel low-power bitstream-residual decoder for H.264/AVC baseline profile. It comprises a syntax parser, a parameter decoder, and an Inverse Quantization Inverse Transform (IQIT decoder. The syntax parser detects and decodes each incoming codeword in the bitstream under the control of a hierarchical Finite State Machine (FSM; the IQIT decoder performs inverse transform and quantization with pipelining and parallelism. Various power reduction techniques, such as data-driven based on statistic results, nonuniform partition, precomputation, guarded evaluation, hierarchical FSM decomposition, TAG method, zero-block skipping, and clock gating , are adopted and integrated throughout the bitstream-residual decoder. With innovative architecture, the proposed design is able to decode QCIF video sequences of 30 fps at a clock rate as low as 1.5 MHz. A prototype H.264/AVC baseline decoding chip utilizing the proposed decoder is fabricated in UMC 0.18 m 1P6M CMOS technology. The proposed design is measured under 1 V 1.8 V supply with 0.1 V step. It dissipates 76 W at 1 V and 253 W at 1.8 V.
Tribology and energy efficiency: from molecules to lubricated contacts to complete machines.
Taylor, Robert Ian
2012-01-01
The impact of lubricants on energy efficiency is considered. Molecular details of base oils used in lubricants can have a great impact on the lubricant's physical properties which will affect the energy efficiency performance of a lubricant. In addition, molecular details of lubricant additives can result in significant differences in measured friction coefficients for machine elements operating in the mixed/boundary lubrication regime. In single machine elements, these differences will result in lower friction losses, and for complete systems (such as cars, trucks, hydraulic circuits, industrial gearboxes etc.) lower fuel consumption or lower electricity consumption can result.
Decoding Dyslexia, a Common Learning Disability
... if they continue to struggle. Read More "Dyslexic" Articles In Their Own Words: Dealing with Dyslexia / Decoding Dyslexia, a Common Learning Disability / What is Dyslexia? / Special Education and Research ...
Multiuser Random Coding Techniques for Mismatched Decoding
Scarlett, Jonathan; Martinez, Alfonso; Guillén i Fàbregas, Albert
2016-01-01
This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth...
Energy Technology Data Exchange (ETDEWEB)
Abad, Enrique
2013-07-01
A new calculational approach to describing metal/organic interfaces. A valuable step towards a better understanding of molecular electronics. Nominated as an outstanding contribution by the Autonomous University of Madrid. In recent years, ever more electronic devices have started to exploit the advantages of organic semiconductors. The work reported in this thesis focuses on analyzing theoretically the energy level alignment of different metal/organic interfaces, necessary to tailor devices with good performance. Traditional methods based on density functional theory (DFT), are not appropriate for analyzing them because they underestimate the organic energy gap and fail to correctly describe the van der Waals forces. Since the size of these systems prohibits the use of more accurate methods, corrections to those DFT drawbacks are desirable. In this work a combination of a standard DFT calculation with the inclusion of the charging energy (U) of the molecule, calculated from first principles, is presented. Regarding the dispersion forces, incorrect long range interaction is substituted by a van der Waals potential. With these corrections, the C60, benzene, pentacene, TTF and TCNQ/Au(111) interfaces are analyzed, both for single molecules and for a monolayer. The results validate the induced density of interface states model.
Decoding reality the universe as quantum information
Vedral, Vlatko
2010-01-01
In Decoding Reality, Vlatko Vedral offers a mind-stretching look at the deepest questions about the universe--where everything comes from, why things are as they are, what everything is. The most fundamental definition of reality is not matter or energy, he writes, but information--and it is the processing of information that lies at the root of all physical, biological, economic, and social phenomena. This view allows Vedral to address a host of seemingly unrelated questions: Why does DNA bind like it does? What is the ideal diet for longevity? How do you make your first million dollars? We can unify all through the understanding that everything consists of bits of information, he writes, though that raises the question of where these bits come from. To find the answer, he takes us on a guided tour through the bizarre realm of quantum physics. At this sub-sub-subatomic level, we find such things as the interaction of separated quantum particles--what Einstein called "spooky action at a distance." In fact, V...
A novel parallel pipeline structure of VP9 decoder
Qin, Huabiao; Chen, Wu; Yi, Sijun; Tan, Yunfei; Yi, Huan
2018-04-01
To improve the efficiency of VP9 decoder, a novel parallel pipeline structure of VP9 decoder is presented in this paper. According to the decoding workflow, VP9 decoder can be divided into sub-modules which include entropy decoding, inverse quantization, inverse transform, intra prediction, inter prediction, deblocking and pixel adaptive compensation. By analyzing the computing time of each module, hotspot modules are located and the causes of low efficiency of VP9 decoder can be found. Then, a novel pipeline decoder structure is designed by using mixed parallel decoding methods of data division and function division. The experimental results show that this structure can greatly improve the decoding efficiency of VP9.
Coding and decoding with dendrites.
Papoutsi, Athanasia; Kastellakis, George; Psarrou, Maria; Anastasakis, Stelios; Poirazi, Panayiota
2014-02-01
Since the discovery of complex, voltage dependent mechanisms in the dendrites of multiple neuron types, great effort has been devoted in search of a direct link between dendritic properties and specific neuronal functions. Over the last few years, new experimental techniques have allowed the visualization and probing of dendritic anatomy, plasticity and integrative schemes with unprecedented detail. This vast amount of information has caused a paradigm shift in the study of memory, one of the most important pursuits in Neuroscience, and calls for the development of novel theories and models that will unify the available data according to some basic principles. Traditional models of memory considered neural cells as the fundamental processing units in the brain. Recent studies however are proposing new theories in which memory is not only formed by modifying the synaptic connections between neurons, but also by modifications of intrinsic and anatomical dendritic properties as well as fine tuning of the wiring diagram. In this review paper we present previous studies along with recent findings from our group that support a key role of dendrites in information processing, including the encoding and decoding of new memories, both at the single cell and the network level. Copyright © 2013 Elsevier Ltd. All rights reserved.
Energy Technology Data Exchange (ETDEWEB)
David E. James; Dennis E. Raunig; Sean S. Cunningham
2014-10-01
On September 25, 2013, a Health Physics Technician (HPT) was performing preparations to support a pneumatic transfer from the HFEF Decon Cell to the Room 130 Glovebox in HFEF, per HFEF OI 3165 section 3.5, Field Preparations. This activity involves an HPT setting up and climbing a portable ladder to remove the 14-C meter probe from above ball valve HBV-7. The HPT source checks the meter and probe and then replaces the probe above HBV-7, which is located above Hood ID# 130 HP. At approximately 13:20, while reaching past the HBV-7 valve position indicator switches in an attempt to place the 14-C meter probe in the desired location, the HPT’s left forearm came in contact with one of the three sets of exposed terminals on the valve position indication switches for HBV 7. This resulted in the HPT receiving an electrical shock from a 120 Volt AC source. Upon moving the arm, following the electrical shock, the HPT noticed two exposed electrical connections on a switch. The HPT then notified the HFEF HPT Supervisor, who in turn notified the MFC Radiological Controls Manager and HFEF Operations Manager of the situation. Work was stopped in the area and the hazard was roped off and posted to prevent access to the hazard. The HPT was escorted by the HPT Supervisor to the MFC Dispensary and then preceded to CFA medical for further evaluation. The individual was evaluated and released without any medical restrictions. Causal Factor (Root Cause) A3B3C01/A5B2C08: - Knowledge based error/Attention was given to wrong issues - Written Communication content LTA, Incomplete/situation not covered The Causal Factor (root cause) was attention being given to the wrong issues during the creation, reviews, verifications, and actual performance of HFEF OI-3165, which covers the need to perform the weekly source check and ensure placement of the probe prior to performing a “rabbit” transfer. This resulted in the hazard not being identified and mitigated in the procedure. Work activities
Jehl, Zacharie; Suchet, Daniel; Julian, Anatole; Bernard, Cyril; Miyashita, Naoya; Gibelli, Francois; Okada, Yoshitaka; Guillemolles, Jean-Francois
2017-02-01
Double resonant tunneling barriers are considered for an application as energy selective contacts in hot carrier solar cells. Experimental symmetric and asymmetric double resonant tunneling barriers are realized by molecular beam epitaxy and characterized by temperature dependent current-voltage measurements. The negative differential resistance signal is enhanced for asymmetric heterostructures, and remains unchanged between low- and room-temperatures. Within Tsu-Esaki description of the tunnel current, this observation can be explained by the voltage dependence of the tunnel transmission amplitude, which presents a resonance under finite bias for asymmetric structures. This effect is notably discussed with respect to series resistance. Different parameters related to the electronic transmission of the structure and the influence of these parameters on the current voltage characteristic are investigated, bringing insights on critical processes to optimize in double resonant tunneling barriers applied to hot carrier solar cells.
Decoding Speech With Integrated Hybrid Signals Recorded From the Human Ventral Motor Cortex
Directory of Open Access Journals (Sweden)
Kenji Ibayashi
2018-04-01
Full Text Available Restoration of speech communication for locked-in patients by means of brain computer interfaces (BCIs is currently an important area of active research. Among the neural signals obtained from intracranial recordings, single/multi-unit activity (SUA/MUA, local field potential (LFP, and electrocorticography (ECoG are good candidates for an input signal for BCIs. However, the question of which signal or which combination of the three signal modalities is best suited for decoding speech production remains unverified. In order to record SUA, LFP, and ECoG simultaneously from a highly localized area of human ventral sensorimotor cortex (vSMC, we fabricated an electrode the size of which was 7 by 13 mm containing sparsely arranged microneedle and conventional macro contacts. We determined which signal modality is the most capable of decoding speech production, and tested if the combination of these signals could improve the decoding accuracy of spoken phonemes. Feature vectors were constructed from spike frequency obtained from SUAs and event-related spectral perturbation derived from ECoG and LFP signals, then input to the decoder. The results showed that the decoding accuracy for five spoken vowels was highest when features from multiple signals were combined and optimized for each subject, and reached 59% when averaged across all six subjects. This result suggests that multi-scale signals convey complementary information for speech articulation. The current study demonstrated that simultaneous recording of multi-scale neuronal activities could raise decoding accuracy even though the recording area is limited to a small portion of cortex, which is advantageous for future implementation of speech-assisting BCIs.
Simulation of the color vision: decoding quantum-electric transduction
Directory of Open Access Journals (Sweden)
Élgion Lúcio da Silva Loreto
2008-08-01
Full Text Available We propose an experimental simulation, using accessible and low cost materials, on the biophysical mechanism of the color vision in accordance with the Young-Helmholtz s Trichromatic Theory, approaching mainly the coding and decoding process of electric signs that arrive to the cerebral cortex. The stimulus that unchains this process is given through transformation of the quantized energy of a light photon that takes place in the photocells of the retina of the human eye. The construction of a simple system of collection and analysis of data, using a multimeter, filters, LDR and LEDs allows us to establish connections between the visual system and the simulation model.
FPGA implementation of low complexity LDPC iterative decoder
Verma, Shivani; Sharma, Sanjay
2016-07-01
Low-density parity-check (LDPC) codes, proposed by Gallager, emerged as a class of codes which can yield very good performance on the additive white Gaussian noise channel as well as on the binary symmetric channel. LDPC codes have gained lots of importance due to their capacity achieving property and excellent performance in the noisy channel. Belief propagation (BP) algorithm and its approximations, most notably min-sum, are popular iterative decoding algorithms used for LDPC and turbo codes. The trade-off between the hardware complexity and the decoding throughput is a critical factor in the implementation of the practical decoder. This article presents introduction to LDPC codes and its various decoding algorithms followed by realisation of LDPC decoder by using simplified message passing algorithm and partially parallel decoder architecture. Simplified message passing algorithm has been proposed for trade-off between low decoding complexity and decoder performance. It greatly reduces the routing and check node complexity of the decoder. Partially parallel decoder architecture possesses high speed and reduced complexity. The improved design of the decoder possesses a maximum symbol throughput of 92.95 Mbps and a maximum of 18 decoding iterations. The article presents implementation of 9216 bits, rate-1/2, (3, 6) LDPC decoder on Xilinx XC3D3400A device from Spartan-3A DSP family.
Performance breakdown in optimal stimulus decoding.
Lubomir Kostal; Lansky, Petr; Pilarski, Stevan
2015-06-01
One of the primary goals of neuroscience is to understand how neurons encode and process information about their environment. The problem is often approached indirectly by examining the degree to which the neuronal response reflects the stimulus feature of interest. In this context, the methods of signal estimation and detection theory provide the theoretical limits on the decoding accuracy with which the stimulus can be identified. The Cramér-Rao lower bound on the decoding precision is widely used, since it can be evaluated easily once the mathematical model of the stimulus-response relationship is determined. However, little is known about the behavior of different decoding schemes with respect to the bound if the neuronal population size is limited. We show that under broad conditions the optimal decoding displays a threshold-like shift in performance in dependence on the population size. The onset of the threshold determines a critical range where a small increment in size, signal-to-noise ratio or observation time yields a dramatic gain in the decoding precision. We demonstrate the existence of such threshold regions in early auditory and olfactory information coding. We discuss the origin of the threshold effect and its impact on the design of effective coding approaches in terms of relevant population size.
Symbol synchronization for the TDRSS decoder
Costello, D. J., Jr.
1983-01-01
Each 8 bits out of the Viterbi decoder correspond to one symbol of the R/S code. Synchronization must be maintained here so that each 8-bit symbol delivered to the R/S decoder corresponds to an 8-bit symbol from the R/S encoder. Lack of synchronization, would cause an error in almost every R/S symbol since even a - 1-bit sync slip shifts every bit in each 8-bit symbol by one position, therby confusing the mapping betweeen 8-bit sequences and symbols. The error correcting capability of the R/S code would be exceeded. Possible ways to correcting this condition include: (1) designing the R/S decoder to recognize the overload and shifting the output sequence of the inner decoder to establish a different sync state; (2) using the characteristics of the inner decoder to establish symbol synchronization for the outer code, with or without a deinterleaver and an interleaver; and (3) modifying the encoder to alternate periodically between two sets of generators.
DEFF Research Database (Denmark)
Gloos, K.; Utko, P.; Aagesen, M.
2006-01-01
We investigate the I(V) characteristics (current versus bias voltage) of side-gated quantum-point contacts, defined in GaAs/AlxGa1-xAs heterostructures. These point contacts are operated in the closed-channel regime, that is, at fixed gate voltages below zero-bias pinch-off for conductance. Our....... Such a built-in energy-voltage calibration allows us to distinguish between the different contributions to the electron transport across the pinched-off contact due to thermal activation or quantum tunneling. The first involves the height of the barrier, and the latter also its length. In the model that we...
Completion time reduction in instantly decodable network coding through decoding delay control
Douik, Ahmed S.
2014-12-01
For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users\\' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.
Completion time reduction in instantly decodable network coding through decoding delay control
Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Al-Naffouri, Tareq Y.
2014-01-01
For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.
NP-hardness of decoding quantum error-correction codes
Hsieh, Min-Hsiu; Le Gall, François
2011-05-01
Although the theory of quantum error correction is intimately related to classical coding theory and, in particular, one can construct quantum error-correction codes (QECCs) from classical codes with the dual-containing property, this does not necessarily imply that the computational complexity of decoding QECCs is the same as their classical counterparts. Instead, decoding QECCs can be very much different from decoding classical codes due to the degeneracy property. Intuitively, one expects degeneracy would simplify the decoding since two different errors might not and need not be distinguished in order to correct them. However, we show that general quantum decoding problem is NP-hard regardless of the quantum codes being degenerate or nondegenerate. This finding implies that no considerably fast decoding algorithm exists for the general quantum decoding problems and suggests the existence of a quantum cryptosystem based on the hardness of decoding QECCs.
NP-hardness of decoding quantum error-correction codes
International Nuclear Information System (INIS)
Hsieh, Min-Hsiu; Le Gall, Francois
2011-01-01
Although the theory of quantum error correction is intimately related to classical coding theory and, in particular, one can construct quantum error-correction codes (QECCs) from classical codes with the dual-containing property, this does not necessarily imply that the computational complexity of decoding QECCs is the same as their classical counterparts. Instead, decoding QECCs can be very much different from decoding classical codes due to the degeneracy property. Intuitively, one expects degeneracy would simplify the decoding since two different errors might not and need not be distinguished in order to correct them. However, we show that general quantum decoding problem is NP-hard regardless of the quantum codes being degenerate or nondegenerate. This finding implies that no considerably fast decoding algorithm exists for the general quantum decoding problems and suggests the existence of a quantum cryptosystem based on the hardness of decoding QECCs.
Generalized Sudan's List Decoding for Order Domain Codes
DEFF Research Database (Denmark)
Geil, Hans Olav; Matsumoto, Ryutaroh
2007-01-01
We generalize Sudan's list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the proposed method is larger than the original list decoding without multiplicity....
Partially blind instantly decodable network codes for lossy feedback environment
Sorour, Sameh; Douik, Ahmed S.; Valaee, Shahrokh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim
2014-01-01
an expression for the expected decoding delay increment for any arbitrary transmission. This expression is then used to find the optimal policy that reduces the decoding delay in such lossy feedback environment. Results show that our proposed solutions both
Neuroprosthetic Decoder Training as Imitation Learning.
Merel, Josh; Carlson, David; Paninski, Liam; Cunningham, John P
2016-05-01
Neuroprosthetic brain-computer interfaces function via an algorithm which decodes neural activity of the user into movements of an end effector, such as a cursor or robotic arm. In practice, the decoder is often learned by updating its parameters while the user performs a task. When the user's intention is not directly observable, recent methods have demonstrated value in training the decoder against a surrogate for the user's intended movement. Here we show that training a decoder in this way is a novel variant of an imitation learning problem, where an oracle or expert is employed for supervised training in lieu of direct observations, which are not available. Specifically, we describe how a generic imitation learning meta-algorithm, dataset aggregation (DAgger), can be adapted to train a generic brain-computer interface. By deriving existing learning algorithms for brain-computer interfaces in this framework, we provide a novel analysis of regret (an important metric of learning efficacy) for brain-computer interfaces. This analysis allows us to characterize the space of algorithmic variants and bounds on their regret rates. Existing approaches for decoder learning have been performed in the cursor control setting, but the available design principles for these decoders are such that it has been impossible to scale them to naturalistic settings. Leveraging our findings, we then offer an algorithm that combines imitation learning with optimal control, which should allow for training of arbitrary effectors for which optimal control can generate goal-oriented control. We demonstrate this novel and general BCI algorithm with simulated neuroprosthetic control of a 26 degree-of-freedom model of an arm, a sophisticated and realistic end effector.
Neuroprosthetic Decoder Training as Imitation Learning.
Directory of Open Access Journals (Sweden)
Josh Merel
2016-05-01
Full Text Available Neuroprosthetic brain-computer interfaces function via an algorithm which decodes neural activity of the user into movements of an end effector, such as a cursor or robotic arm. In practice, the decoder is often learned by updating its parameters while the user performs a task. When the user's intention is not directly observable, recent methods have demonstrated value in training the decoder against a surrogate for the user's intended movement. Here we show that training a decoder in this way is a novel variant of an imitation learning problem, where an oracle or expert is employed for supervised training in lieu of direct observations, which are not available. Specifically, we describe how a generic imitation learning meta-algorithm, dataset aggregation (DAgger, can be adapted to train a generic brain-computer interface. By deriving existing learning algorithms for brain-computer interfaces in this framework, we provide a novel analysis of regret (an important metric of learning efficacy for brain-computer interfaces. This analysis allows us to characterize the space of algorithmic variants and bounds on their regret rates. Existing approaches for decoder learning have been performed in the cursor control setting, but the available design principles for these decoders are such that it has been impossible to scale them to naturalistic settings. Leveraging our findings, we then offer an algorithm that combines imitation learning with optimal control, which should allow for training of arbitrary effectors for which optimal control can generate goal-oriented control. We demonstrate this novel and general BCI algorithm with simulated neuroprosthetic control of a 26 degree-of-freedom model of an arm, a sophisticated and realistic end effector.
Decoding of concatenated codes with interleaved outer codes
DEFF Research Database (Denmark)
Justesen, Jørn; Høholdt, Tom; Thommesen, Christian
2004-01-01
Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes.......Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved (N, K) Reed-Solomon codes, which allows close to N-K errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes....
Binary Systematic Network Coding for Progressive Packet Decoding
Jones, Andrew L.; Chatzigeorgiou, Ioannis; Tassi, Andrea
2015-01-01
We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional net- work coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve ...
Energy Technology Data Exchange (ETDEWEB)
Sinha, Sumona, E-mail: sumona.net.09@gmail.com [Saha Institute of Nuclear Physics, 1/AF, Bidhannagar, Kolkata 700064 (India); Wang, C.-H. [National Synchrotron Radiation Research Center, Hsinchu 30076, Taiwan (China); Mukherjee, M. [Saha Institute of Nuclear Physics, 1/AF, Bidhannagar, Kolkata 700064 (India)
2017-07-01
Highlights: • Impact of contact contaminations on the energy level alignment and molecular conformation at rubrene/Ag interfaces. • Adventitious contamination layer was acted as a spacer layer between Ag substrate surface and rubrene molecular layer. • Hole injection barrier height and interface dipole at rubrene/Ag interfaces depend on the cleanliness of Ag substrate. • Molecular conformation as well as orientation controlled by the cleanliness of Ag surface. • Resulted different surface morphology of rubrene thin films on unclean and clean Ag substrate. - Abstract: This paper addresses the impact of electrode contaminations on the interfacial energy level alignment, the molecular conformation, orientation and surface morphology deposited organic film at organic semiconductor/noble metal interfaces by varying of film thickness from sub-monolayer to multilayer, which currently draws significant attention with regard to its application in organic electronics. The UHV clean Ag and unclean Ag were employed as substrate whereas rubrene was used as an organic semiconducting material. The photoelectron spectroscopy (XPS and UPS) was engaged to investigate the evolution of interfacial energetics; polarization dependent near edge x-ray absorption fine structure spectroscopy (NEXAFS) was employed to understand the molecular conformation as well as orientation whereas atomic force microscopy (AFM) was used to investigate the surface morphologies of the films. The adventitious contamination layer was acted as a spacer layer between clean Ag substrate surface and rubrene molecular layer. As a consequence, hole injection barrier height, interface dipole as well as molecular-conformation, molecular-orientation and surface morphology of rubrene thin films were found to depend on the cleanliness of Ag substrate. The results have important inferences about the understanding of the impact of substrate contamination on the energy level alignment, the molecular conformation
Decoding Hermitian Codes with Sudan's Algorithm
DEFF Research Database (Denmark)
Høholdt, Tom; Nielsen, Rasmus Refslund
1999-01-01
We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q-polynomial, and a reduct......We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q...
Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm
DEFF Research Database (Denmark)
Puchinger, Sven; Müelich, Sven; Mödinger, David
2017-01-01
We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ℓ3n(ω+1)/2log(n)) decoding algorithm for ℓ-Interleaved Gabidulin codes of length n, where ω is the matrix multiplication exponent.......We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an O(ℓ3n(ω+1)/2log(n)) decoding algorithm for ℓ-Interleaved Gabidulin codes of length n, where ω is the matrix multiplication exponent....
Decoding LDPC Convolutional Codes on Markov Channels
Directory of Open Access Journals (Sweden)
Kashyap Manohar
2008-01-01
Full Text Available Abstract This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.
Decoding LDPC Convolutional Codes on Markov Channels
Directory of Open Access Journals (Sweden)
Chris Winstead
2008-04-01
Full Text Available This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.
Decoding algorithm for vortex communications receiver
Kupferman, Judy; Arnon, Shlomi
2018-01-01
Vortex light beams can provide a tremendous alphabet for encoding information. We derive a symbol decoding algorithm for a direct detection matrix detector vortex beam receiver using Laguerre Gauss (LG) modes, and develop a mathematical model of symbol error rate (SER) for this receiver. We compare SER as a function of signal to noise ratio (SNR) for our algorithm and for the Pearson correlation algorithm. To our knowledge, this is the first comprehensive treatment of a decoding algorithm of a matrix detector for an LG receiver.
On Lattice Sequential Decoding for The Unconstrained AWGN Channel
Abediseid, Walid; Alouini, Mohamed-Slim
2013-01-01
channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the \\textit{lattice decoder}. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement
Image transmission system using adaptive joint source and channel decoding
Liu, Weiliang; Daut, David G.
2005-03-01
In this paper, an adaptive joint source and channel decoding method is designed to accelerate the convergence of the iterative log-dimain sum-product decoding procedure of LDPC codes as well as to improve the reconstructed image quality. Error resilience modes are used in the JPEG2000 source codec, which makes it possible to provide useful source decoded information to the channel decoder. After each iteration, a tentative decoding is made and the channel decoded bits are then sent to the JPEG2000 decoder. Due to the error resilience modes, some bits are known to be either correct or in error. The positions of these bits are then fed back to the channel decoder. The log-likelihood ratios (LLR) of these bits are then modified by a weighting factor for the next iteration. By observing the statistics of the decoding procedure, the weighting factor is designed as a function of the channel condition. That is, for lower channel SNR, a larger factor is assigned, and vice versa. Results show that the proposed joint decoding methods can greatly reduce the number of iterations, and thereby reduce the decoding delay considerably. At the same time, this method always outperforms the non-source controlled decoding method up to 5dB in terms of PSNR for various reconstructed images.
Decoding and Encoding Facial Expressions in Preschool-Age Children.
Zuckerman, Miron; Przewuzman, Sylvia J.
1979-01-01
Preschool-age children drew, decoded, and encoded facial expressions depicting five different emotions. Accuracy of drawing, decoding and encoding each of the five emotions was consistent across the three tasks; decoding ability was correlated with drawing ability among female subjects, but neither of these abilities was correlated with encoding…
Nelde, Peter Hans
1995-01-01
Examines the phenomenon of language contact and recent trends in linguistic contact research, which focuses on language use, language users, and language spheres. Also discusses the role of linguistic and cultural conflicts in language contact situations. (13 references) (MDM)
On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes
DEFF Research Database (Denmark)
Beelen, Peter; Høholdt, Tom; Nielsen, Johan Sebastian Rosenkilde
2013-01-01
We derive the Wu list-decoding algorithm for generalized Reed–Solomon (GRS) codes by using Gröbner bases over modules and the Euclidean algorithm as the initial algorithm instead of the Berlekamp–Massey algorithm. We present a novel method for constructing the interpolation polynomial fast. We gi...... and a duality in the choice of parameters needed for decoding, both in the case of GRS codes and in the case of Goppa codes....
Bayesian population decoding of spiking neurons.
Gerwinn, Sebastian; Macke, Jakob; Bethge, Matthias
2009-01-01
The timing of action potentials in spiking neurons depends on the temporal dynamics of their inputs and contains information about temporal fluctuations in the stimulus. Leaky integrate-and-fire neurons constitute a popular class of encoding models, in which spike times depend directly on the temporal structure of the inputs. However, optimal decoding rules for these models have only been studied explicitly in the noiseless case. Here, we study decoding rules for probabilistic inference of a continuous stimulus from the spike times of a population of leaky integrate-and-fire neurons with threshold noise. We derive three algorithms for approximating the posterior distribution over stimuli as a function of the observed spike trains. In addition to a reconstruction of the stimulus we thus obtain an estimate of the uncertainty as well. Furthermore, we derive a 'spike-by-spike' online decoding scheme that recursively updates the posterior with the arrival of each new spike. We use these decoding rules to reconstruct time-varying stimuli represented by a Gaussian process from spike trains of single neurons as well as neural populations.
Faster 2-regular information-set decoding
Bernstein, D.J.; Lange, T.; Peters, C.P.; Schwabe, P.; Chee, Y.M.
2011-01-01
Fix positive integers B and w. Let C be a linear code over F 2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of which has Hamming weight 0 or 2. This problem appears in attacks on the FSB (fast syndrome-based) hash function and
Bayesian population decoding of spiking neurons
Directory of Open Access Journals (Sweden)
Sebastian Gerwinn
2009-10-01
Full Text Available The timing of action potentials in spiking neurons depends on the temporal dynamics of their inputs and contains information about temporal fluctuations in the stimulus. Leaky integrate-and-fire neurons constitute a popular class of encoding models, in which spike times depend directly on the temporal structure of the inputs. However, optimal decoding rules for these models have only been studied explicitly in the noiseless case. Here, we study decoding rules for probabilistic inference of a continuous stimulus from the spike times of a population of leaky integrate-and-fire neurons with threshold noise. We derive three algorithms for approximating the posterior distribution over stimuli as a function of the observed spike trains. In addition to a reconstruction of the stimulus we thus obtain an estimate of the uncertainty as well. Furthermore, we derive a `spike-by-spike' online decoding scheme that recursively updates the posterior with the arrival of each new spike. We use these decoding rules to reconstruct time-varying stimuli represented by a Gaussian process from spike trains of single neurons as well as neural populations.
Sequential decoders for large MIMO systems
Ali, Konpal S.; Abediseid, Walid; Alouini, Mohamed-Slim
2014-01-01
the Sequential Decoder using the Fano Algorithm for large MIMO systems. A parameter called the bias is varied to attain different performance-complexity trade-offs. Low values of the bias result in excellent performance but at the expense of high complexity
2010-10-01
..., satellite, public switched telephone network, or any other source that uses the EAS protocol. (2) Valid..., analog radio and television broadcast stations, analog cable systems and wireless cable systems may... program data must be retained even with power removed. (7) Outputs. Decoders shall have the following...
Older Adults Have Difficulty in Decoding Sarcasm
Phillips, Louise H.; Allen, Roy; Bull, Rebecca; Hering, Alexandra; Kliegel, Matthias; Channon, Shelley
2015-01-01
Younger and older adults differ in performance on a range of social-cognitive skills, with older adults having difficulties in decoding nonverbal cues to emotion and intentions. Such skills are likely to be important when deciding whether someone is being sarcastic. In the current study we investigated in a life span sample whether there are…
Bounded-Angle Iterative Decoding of LDPC Codes
Dolinar, Samuel; Andrews, Kenneth; Pollara, Fabrizio; Divsalar, Dariush
2009-01-01
Bounded-angle iterative decoding is a modified version of conventional iterative decoding, conceived as a means of reducing undetected-error rates for short low-density parity-check (LDPC) codes. For a given code, bounded-angle iterative decoding can be implemented by means of a simple modification of the decoder algorithm, without redesigning the code. Bounded-angle iterative decoding is based on a representation of received words and code words as vectors in an n-dimensional Euclidean space (where n is an integer).
A Scalable Architecture of a Structured LDPC Decoder
Lee, Jason Kwok-San; Lee, Benjamin; Thorpe, Jeremy; Andrews, Kenneth; Dolinar, Sam; Hamkins, Jon
2004-01-01
We present a scalable decoding architecture for a certain class of structured LDPC codes. The codes are designed using a small (n,r) protograph that is replicated Z times to produce a decoding graph for a (Z x n, Z x r) code. Using this architecture, we have implemented a decoder for a (4096,2048) LDPC code on a Xilinx Virtex-II 2000 FPGA, and achieved decoding speeds of 31 Mbps with 10 fixed iterations. The implemented message-passing algorithm uses an optimized 3-bit non-uniform quantizer that operates with 0.2dB implementation loss relative to a floating point decoder.
Energy Technology Data Exchange (ETDEWEB)
Franke, Wolf D. [ADVOLAT Gruppe (Switzerland); Winz, Rainer (eds.) [Hochschule Merseburg (Germany). Fachbereich Informatik und Kommunikationssysteme; ADVOLAT Gruppe (Switzerland)
2012-11-01
The compendium under consideration gives a review on the most important technologies, market tendencies, career chances and training ways within the range of renewable energies. Experts from research, economics and associations present facts and background information according to the power production by sun, wind, water, bio fuels and geothermal energy as well as their practical application in different economic sectors. Prominent enterprises as technology leaders and potential employers are presented. Valuable information, contacts and addresses for the reader are given.
Energy Technology Data Exchange (ETDEWEB)
Franke, Wolf D. (ed.) [ADVOLAT Gruppe (Switzerland)
2010-07-01
The compendium under consideration gives a review on the most important technologies, market tendencies, career chances and training ways within the range of renewable energies. Experts from research, economics and associations present facts and background information according to the power production by sun, wind, water, bio fuels and geothermal energy as well as their practical application in different economic sectors. Prominent enterprises as technology leaders and potential employers are presented. Valuable information, contacts and addresses for the reader are given.
Decoding subjective mental states from fMRI activity patterns
International Nuclear Information System (INIS)
Tamaki, Masako; Kamitani, Yukiyasu
2011-01-01
In recent years, functional magnetic resonance imaging (fMRI) decoding has emerged as a powerful tool to read out detailed stimulus features from multi-voxel brain activity patterns. Moreover, the method has been extended to perform a primitive form of 'mind-reading,' by applying a decoder 'objectively' trained using stimulus features to more 'subjective' conditions. In this paper, we first introduce basic procedures for fMRI decoding based on machine learning techniques. Second, we discuss the source of information used for decoding, in particular, the possibility of extracting information from subvoxel neural structures. We next introduce two experimental designs for decoding subjective mental states: the 'objective-to-subjective design' and the 'subjective-to-subjective design.' Then, we illustrate recent studies on the decoding of a variety of mental states, such as, attention, awareness, decision making, memory, and mental imagery. Finally, we discuss the challenges and new directions of fMRI decoding. (author)
SYMBOL LEVEL DECODING FOR DUO-BINARY TURBO CODES
Directory of Open Access Journals (Sweden)
Yogesh Beeharry
2017-05-01
Full Text Available This paper investigates the performance of three different symbol level decoding algorithms for Duo-Binary Turbo codes. Explicit details of the computations involved in the three decoding techniques, and a computational complexity analysis are given. Simulation results with different couple lengths, code-rates, and QPSK modulation reveal that the symbol level decoding with bit-level information outperforms the symbol level decoding by 0.1 dB on average in the error floor region. Moreover, a complexity analysis reveals that symbol level decoding with bit-level information reduces the decoding complexity by 19.6 % in terms of the total number of computations required for each half-iteration as compared to symbol level decoding.
Belief propagation decoding of quantum channels by passing quantum messages
International Nuclear Information System (INIS)
Renes, Joseph M
2017-01-01
The belief propagation (BP) algorithm is a powerful tool in a wide range of disciplines from statistical physics to machine learning to computational biology, and is ubiquitous in decoding classical error-correcting codes. The algorithm works by passing messages between nodes of the factor graph associated with the code and enables efficient decoding of the channel, in some cases even up to the Shannon capacity. Here we construct the first BP algorithm which passes quantum messages on the factor graph and is capable of decoding the classical–quantum channel with pure state outputs. This gives explicit decoding circuits whose number of gates is quadratic in the code length. We also show that this decoder can be modified to work with polar codes for the pure state channel and as part of a decoder for transmitting quantum information over the amplitude damping channel. These represent the first explicit capacity-achieving decoders for non-Pauli channels. (fast track communication)
Belief propagation decoding of quantum channels by passing quantum messages
Renes, Joseph M.
2017-07-01
The belief propagation (BP) algorithm is a powerful tool in a wide range of disciplines from statistical physics to machine learning to computational biology, and is ubiquitous in decoding classical error-correcting codes. The algorithm works by passing messages between nodes of the factor graph associated with the code and enables efficient decoding of the channel, in some cases even up to the Shannon capacity. Here we construct the first BP algorithm which passes quantum messages on the factor graph and is capable of decoding the classical-quantum channel with pure state outputs. This gives explicit decoding circuits whose number of gates is quadratic in the code length. We also show that this decoder can be modified to work with polar codes for the pure state channel and as part of a decoder for transmitting quantum information over the amplitude damping channel. These represent the first explicit capacity-achieving decoders for non-Pauli channels.
Lin, Shu; Fossorier, Marc
1998-01-01
In a coded communication system with equiprobable signaling, MLD minimizes the word error probability and delivers the most likely codeword associated with the corresponding received sequence. This decoding has two drawbacks. First, minimization of the word error probability is not equivalent to minimization of the bit error probability. Therefore, MLD becomes suboptimum with respect to the bit error probability. Second, MLD delivers a hard-decision estimate of the received sequence, so that information is lost between the input and output of the ML decoder. This information is important in coded schemes where the decoded sequence is further processed, such as concatenated coding schemes, multi-stage and iterative decoding schemes. In this chapter, we first present a decoding algorithm which both minimizes bit error probability, and provides the corresponding soft information at the output of the decoder. This algorithm is referred to as the MAP (maximum aposteriori probability) decoding algorithm.
Directory of Open Access Journals (Sweden)
A. S. Tremsin
2017-01-01
Full Text Available Neutron resonance absorption imaging is a non-destructive technique that can characterize the elemental composition of a sample by measuring nuclear resonances in the spectrum of a transmitted beam. Recent developments in pixelated time-of-flight imaging detectors coupled with pulsed neutron sources pose new opportunities for energy-resolved imaging. In this paper we demonstrate non-contact measurements of the partial pressure of xenon and krypton gases encapsulated in a steel pipe while simultaneously passing the neutron beam through high-Z materials. The configuration was chosen as a proof of principle demonstration of the potential to make non-destructive measurement of gas composition in nuclear fuel rods. The pressure measured from neutron transmission spectra (∼739 ± 98 kPa and ∼751 ± 154 kPa for two Xe resonances is in relatively good agreement with the pressure value of ∼758 ± 21 kPa measured by a pressure gauge. This type of imaging has been performed previously for solids with a spatial resolution of ∼ 100 μm. In the present study it is demonstrated that the high penetration capability of epithermal neutrons enables quantitative mapping of gases encapsulate within high-Z materials such as steel, tungsten, urania and others. This technique may be beneficial for the non-destructive testing of bulk composition of objects (such as spent nuclear fuel assemblies and others containing various elements opaque to other more conventional imaging techniques. The ability to image the gaseous substances concealed within solid materials also allows non-destructive leak testing of various containers and ultimately measurement of gas partial pressures with sub-mm spatial resolution.
D-DSC: Decoding Delay-based Distributed Source Coding for Internet of Sensing Things.
Aktas, Metin; Kuscu, Murat; Dinc, Ergin; Akan, Ozgur B
2018-01-01
Spatial correlation between densely deployed sensor nodes in a wireless sensor network (WSN) can be exploited to reduce the power consumption through a proper source coding mechanism such as distributed source coding (DSC). In this paper, we propose the Decoding Delay-based Distributed Source Coding (D-DSC) to improve the energy efficiency of the classical DSC by employing the decoding delay concept which enables the use of the maximum correlated portion of sensor samples during the event estimation. In D-DSC, network is partitioned into clusters, where the clusterheads communicate their uncompressed samples carrying the side information, and the cluster members send their compressed samples. Sink performs joint decoding of the compressed and uncompressed samples and then reconstructs the event signal using the decoded sensor readings. Based on the observed degree of the correlation among sensor samples, the sink dynamically updates and broadcasts the varying compression rates back to the sensor nodes. Simulation results for the performance evaluation reveal that D-DSC can achieve reliable and energy-efficient event communication and estimation for practical signal detection/estimation applications having massive number of sensors towards the realization of Internet of Sensing Things (IoST).
Alagumariappan, Paramasivam; Krishnamurthy, Kamalanand; Kandiah, Sundravadivelu; Ponnuswamy, Mannar Jawahar
2017-06-01
Electrogastrograms (EGG) are electrical signals originating from the digestive system, which are closely correlated with its mechanical activity. Electrogastrography is an efficient non-invasive method for examining the physiological and pathological states of the human digestive system. There are several factors such as fat conductivity, abdominal thickness, change in electrode surface area etc, which affects the quality of the recorded EGG signals. In this work, the effect of variations in the contact area of surface electrodes on the information content of the measured electrogastrograms is analyzed using Rényi entropy and Teager-Kaiser Energy (TKE). Two different circular cutaneous electrodes with approximate contact areas of 201.14 mm2 and 283.64 mm2, have been adopted and EGG signals were acquired using the standard three electrode protocol. Further, the information content of the measured EGG signals were analyzed using the computed values of entropy and energy. Results demonstrate that the information content of the measured EGG signals increases by 6.72% for an increase in the contact area of the surface electrode by 29.09%. Further, it was observed that the average energy increases with increase in the contact surface area. This work appears to be of high clinical significance since the accurate measurement of EGG signals without loss in its information content, is highly useful for the design of diagnostic assistance tools for automated diagnosis and mass screening of digestive disorders.
Energy Technology Data Exchange (ETDEWEB)
Li, Yang; Tu, Xingchen; Wang, Hao; Hou, Shimin, E-mail: smhou@pku.edu.cn [Centre for Nanoscale Science and Technology, Key Laboratory for the Physics and Chemistry of Nanodevices, Department of Electronics, Peking University, Beijing 100871 (China); Sanvito, Stefano [School of Physics, AMBER and CRANN Institute, Trinity College, Dublin 2 (Ireland)
2015-04-28
The electronic efficiency and binding energy of contacts formed between graphene electrodes and poly-aromatic hydrocarbon (PAH) anchoring groups have been investigated by the non-equilibrium Green’s function formalism combined with density functional theory. Our calculations show that PAH molecules always bind in the interior and at the edge of graphene in the AB stacking manner, and that the binding energy increases following the increase of the number of carbon and hydrogen atoms constituting the PAH molecule. When we move to analyzing the electronic transport properties of molecular junctions with a six-carbon alkyne chain as the central molecule, the electronic efficiency of the graphene-PAH contacts is found to depend on the energy gap between the highest occupied molecular orbital (HOMO) and the lowest unoccupied molecular orbital (LUMO) of the corresponding PAH anchoring group, rather than its size. To be specific, the smaller is the HOMO-LUMO gap of the PAH anchoring group, the higher is the electronic efficiency of the graphene-PAH contact. Although the HOMO-LUMO gap of a PAH molecule depends on its specific configuration, PAH molecules with similar atomic structures show a decreasing trend for their HOMO-LUMO gap as the number of fused benzene rings increases. Therefore, graphene-conjugated molecule-graphene junctions with high-binding and high-conducting graphene-PAH contacts can be realized by choosing appropriate PAH anchor groups with a large area and a small HOMO-LUMO gap.
Li, Yang; Tu, Xingchen; Wang, Hao; Sanvito, Stefano; Hou, Shimin
2015-01-01
© 2015 AIP Publishing LLC. The electronic efficiency and binding energy of contacts formed between graphene electrodes and poly-aromatic hydrocarbon (PAH) anchoring groups have been investigated by the non-equilibrium Green's function formalism combined with density functional theory. Our calculations show that PAH molecules always bind in the interior and at the edge of graphene in the AB stacking manner, and that the binding energy increases following the increase of the number of carbon and hydrogen atoms constituting the PAH molecule. When we move to analyzing the electronic transport properties of molecular junctions with a six-carbon alkyne chain as the central molecule, the electronic efficiency of the graphene-PAH contacts is found to depend on the energy gap between the highest occupied molecular orbital (HOMO) and the lowest unoccupied molecular orbital (LUMO) of the corresponding PAH anchoring group, rather than its size. To be specific, the smaller is the HOMO-LUMO gap of the PAH anchoring group, the higher is the electronic efficiency of the graphene-PAH contact. Although the HOMO-LUMO gap of a PAH molecule depends on its specific configuration, PAH molecules with similar atomic structures show a decreasing trend for their HOMO-LUMO gap as the number of fused benzene rings increases. Therefore, graphene-conjugated molecule-graphene junctions with high-binding and high-conducting graphene-PAH contacts can be realized by choosing appropriate PAH anchor groups with a large area and a small HOMO-LUMO gap.
Benkhelifa, Fatma
2015-05-01
In this paper, we investigate the simultaneous wireless information and power transfer (SWIPT) for a decode-and-forward (DF) multiple-input multiple-output (MIMO) relay system where the relay is an energy harvesting node. We consider the ideal scenario where both the energy harvesting (EH) receiver and information decoding (ID) receiver at the relay have access to the whole received signal and its energy. The relay harvests the energy while receiving the signal from the source and uses the harvested power to forward the signal to the destination. We obtain the optimal precoders at the source and the relay to maximize the achievable throughput rate of the overall link. In the numerical results, the effect of the transmit power at the source and the position of the relay between the source and the destination on the maximum achievable rate are investigated. © 2015 IEEE.
Energy Technology Data Exchange (ETDEWEB)
Clifton B. Higdon III
2012-03-20
A review of current commercially available, industrial-grade, low friction coatings will show that interfacial contact pressures nearing 1GPa ({approx}150ksi) inherently limit surface engineering solutions like WC, TiN, TiAlN, and so forth. Extremely hard coatings, then, are often pursued as the principle path, although they too are not without significant limitations. A majority of these compounds are inherently brittle in nature or may not pair well with their mating substrate. In either case, their durability in high contact stress environments is compromised. In parallel to thin film coatings, many conventional surface treatments do not yield an interface hard enough to withstand extreme stresses under load. New research into advanced, nanocomposite materials like (Ti, Zr)B2 shows great promise. Bulk compacts of this compound have demonstrated an order of magnitude better wear resistance than current offerings, notably materials like tungsten carbide. At a laboratory level, the (Ti,Zr)B2 nanocomposite material exhibited abrasive and erosive wear resistance nearly ten times better than existing mixed-phase boride systems. In ASTM abrasion and erosion testing, these new compositions exhibit wear resistance superior to other known advanced materials such as RocTec 500 and 'Borazon' cubic boron nitride. Many significant challenges exist for mass production of (Ti, Zr)B2, one of which is the necessary processing technology that is capable of minimizing deleterious impurity phases. Secondly, this material's performance is derived from a synergistic effect of the two materials existing as a single phase structure. While the individual constituents of TiB2 and ZrB2 do yield improvements to wear resistance, their singular effects are not as significant. Lastly, deposition of this material on a commercial level requires thorough knowledge of nanocomposite boride solids; the benefits associated with these innovative new materials are just being realized
Zhu, Guangpu; Chen, Huangxin; Sun, Shuyu; Yao, Jun
2018-01-01
In this paper, a fully discrete scheme which considers temporal and spatial discretizations is presented for the coupled Cahn-Hilliard equation in conserved form with the dynamic contact line condition and the Navier-Stokes equation
On Lattice Sequential Decoding for The Unconstrained AWGN Channel
Abediseid, Walid
2013-04-04
In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the \\\\textit{lattice decoder}. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter --- the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.
On Lattice Sequential Decoding for The Unconstrained AWGN Channel
Abediseid, Walid
2012-10-01
In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter --- the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.
Video coding for decoding power-constrained embedded devices
Lu, Ligang; Sheinin, Vadim
2004-01-01
Low power dissipation and fast processing time are crucial requirements for embedded multimedia devices. This paper presents a technique in video coding to decrease the power consumption at a standard video decoder. Coupled with a small dedicated video internal memory cache on a decoder, the technique can substantially decrease the amount of data traffic to the external memory at the decoder. A decrease in data traffic to the external memory at decoder will result in multiple benefits: faster real-time processing and power savings. The encoder, given prior knowledge of the decoder"s dedicated video internal memory cache management scheme, regulates its choice of motion compensated predictors to reduce the decoder"s external memory accesses. This technique can be used in any standard or proprietary encoder scheme to generate a compliant output bit stream decodable by standard CPU-based and dedicated hardware-based decoders for power savings with the best quality-power cost trade off. Our simulation results show that with a relatively small amount of dedicated video internal memory cache, the technique may decrease the traffic between CPU and external memory over 50%.
On Lattice Sequential Decoding for The Unconstrained AWGN Channel
Abediseid, Walid; Alouini, Mohamed-Slim
2012-01-01
In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter --- the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.
Decoding spikes in a spiking neuronal network
Energy Technology Data Exchange (ETDEWEB)
Feng Jianfeng [Department of Informatics, University of Sussex, Brighton BN1 9QH (United Kingdom); Ding, Mingzhou [Department of Mathematics, Florida Atlantic University, Boca Raton, FL 33431 (United States)
2004-06-04
We investigate how to reliably decode the input information from the output of a spiking neuronal network. A maximum likelihood estimator of the input signal, together with its Fisher information, is rigorously calculated. The advantage of the maximum likelihood estimation over the 'brute-force rate coding' estimate is clearly demonstrated. It is pointed out that the ergodic assumption in neuroscience, i.e. a temporal average is equivalent to an ensemble average, is in general not true. Averaging over an ensemble of neurons usually gives a biased estimate of the input information. A method on how to compensate for the bias is proposed. Reconstruction of dynamical input signals with a group of spiking neurons is extensively studied and our results show that less than a spike is sufficient to accurately decode dynamical inputs.
Decoding spikes in a spiking neuronal network
International Nuclear Information System (INIS)
Feng Jianfeng; Ding, Mingzhou
2004-01-01
We investigate how to reliably decode the input information from the output of a spiking neuronal network. A maximum likelihood estimator of the input signal, together with its Fisher information, is rigorously calculated. The advantage of the maximum likelihood estimation over the 'brute-force rate coding' estimate is clearly demonstrated. It is pointed out that the ergodic assumption in neuroscience, i.e. a temporal average is equivalent to an ensemble average, is in general not true. Averaging over an ensemble of neurons usually gives a biased estimate of the input information. A method on how to compensate for the bias is proposed. Reconstruction of dynamical input signals with a group of spiking neurons is extensively studied and our results show that less than a spike is sufficient to accurately decode dynamical inputs
Neural decoding of visual imagery during sleep.
Horikawa, T; Tamaki, M; Miyawaki, Y; Kamitani, Y
2013-05-03
Visual imagery during sleep has long been a topic of persistent speculation, but its private nature has hampered objective analysis. Here we present a neural decoding approach in which machine-learning models predict the contents of visual imagery during the sleep-onset period, given measured brain activity, by discovering links between human functional magnetic resonance imaging patterns and verbal reports with the assistance of lexical and image databases. Decoding models trained on stimulus-induced brain activity in visual cortical areas showed accurate classification, detection, and identification of contents. Our findings demonstrate that specific visual experience during sleep is represented by brain activity patterns shared by stimulus perception, providing a means to uncover subjective contents of dreaming using objective neural measurement.
Power decoding Reed-Solomon codes up to the Johnson radius
DEFF Research Database (Denmark)
Rosenkilde, Johan Sebastian Heesemann
2018-01-01
Power decoding, or "decoding using virtual interleaving" is a technique for decoding Reed-Solomon codes up to the Sudan radius. Since the method's inception, it has been an open question if it is possible to use this approach to decode up to the Johnson radius - the decoding radius of the Guruswami...
Resource Efficient LDPC Decoders for Multimedia Communication
Chandrasetty, Vikram Arkalgud; Aziz, Syed Mahfuzul
2013-01-01
Achieving high image quality is an important aspect in an increasing number of wireless multimedia applications. These applications require resource efficient error correction hardware to detect and correct errors introduced by the communication channel. This paper presents an innovative flexible architecture for error correction using Low-Density Parity-Check (LDPC) codes. The proposed partially-parallel decoder architecture utilizes a novel code construction technique based on multi-level H...
Decoding divergent series in nonparaxial optics.
Borghi, Riccardo; Gori, Franco; Guattari, Giorgio; Santarsiero, Massimo
2011-03-15
A theoretical analysis aimed at investigating the divergent character of perturbative series involved in the study of free-space nonparaxial propagation of vectorial optical beams is proposed. Our analysis predicts a factorial divergence for such series and provides a theoretical framework within which the results of recently published numerical experiments concerning nonparaxial propagation of vectorial Gaussian beams find a meaningful interpretation in terms of the decoding operated on such series by the Weniger transformation.
advance. Your help is appreciated. Contact us by email Email doepatentscomments@osti.gov NOTE: Email us by phone Phone Phone (865) 241-5275 Contact us in writing Mail U.S. Department of Energy Office of non-federal websites. Their policies may differ from this site. Javascript Not Enabled Email Link
Sequential decoders for large MIMO systems
Ali, Konpal S.
2014-05-01
Due to their ability to provide high data rates, multiple-input multiple-output (MIMO) systems have become increasingly popular. Decoding of these systems with acceptable error performance is computationally very demanding. In this paper, we employ the Sequential Decoder using the Fano Algorithm for large MIMO systems. A parameter called the bias is varied to attain different performance-complexity trade-offs. Low values of the bias result in excellent performance but at the expense of high complexity and vice versa for higher bias values. Numerical results are done that show moderate bias values result in a decent performance-complexity trade-off. We also attempt to bound the error by bounding the bias, using the minimum distance of a lattice. The variations in complexity with SNR have an interesting trend that shows room for considerable improvement. Our work is compared against linear decoders (LDs) aided with Element-based Lattice Reduction (ELR) and Complex Lenstra-Lenstra-Lovasz (CLLL) reduction. © 2014 IFIP.
Markov source model for printed music decoding
Kopec, Gary E.; Chou, Philip A.; Maltz, David A.
1995-03-01
This paper describes a Markov source model for a simple subset of printed music notation. The model is based on the Adobe Sonata music symbol set and a message language of our own design. Chord imaging is the most complex part of the model. Much of the complexity follows from a rule of music typography that requires the noteheads for adjacent pitches to be placed on opposite sides of the chord stem. This rule leads to a proliferation of cases for other typographic details such as dot placement. We describe the language of message strings accepted by the model and discuss some of the imaging issues associated with various aspects of the message language. We also point out some aspects of music notation that appear problematic for a finite-state representation. Development of the model was greatly facilitated by the duality between image synthesis and image decoding. Although our ultimate objective was a music image model for use in decoding, most of the development proceeded by using the evolving model for image synthesis, since it is computationally far less costly to image a message than to decode an image.
Kernel Temporal Differences for Neural Decoding
Bae, Jihye; Sanchez Giraldo, Luis G.; Pohlmeyer, Eric A.; Francis, Joseph T.; Sanchez, Justin C.; Príncipe, José C.
2015-01-01
We study the feasibility and capability of the kernel temporal difference (KTD)(λ) algorithm for neural decoding. KTD(λ) is an online, kernel-based learning algorithm, which has been introduced to estimate value functions in reinforcement learning. This algorithm combines kernel-based representations with the temporal difference approach to learning. One of our key observations is that by using strictly positive definite kernels, algorithm's convergence can be guaranteed for policy evaluation. The algorithm's nonlinear functional approximation capabilities are shown in both simulations of policy evaluation and neural decoding problems (policy improvement). KTD can handle high-dimensional neural states containing spatial-temporal information at a reasonable computational complexity allowing real-time applications. When the algorithm seeks a proper mapping between a monkey's neural states and desired positions of a computer cursor or a robot arm, in both open-loop and closed-loop experiments, it can effectively learn the neural state to action mapping. Finally, a visualization of the coadaptation process between the decoder and the subject shows the algorithm's capabilities in reinforcement learning brain machine interfaces. PMID:25866504
Deep Learning Methods for Improved Decoding of Linear Codes
Nachmani, Eliya; Marciano, Elad; Lugosch, Loren; Gross, Warren J.; Burshtein, David; Be'ery, Yair
2018-02-01
The problem of low complexity, close to optimal, channel decoding of linear codes with short to moderate block length is considered. It is shown that deep learning methods can be used to improve a standard belief propagation decoder, despite the large example space. Similar improvements are obtained for the min-sum algorithm. It is also shown that tying the parameters of the decoders across iterations, so as to form a recurrent neural network architecture, can be implemented with comparable results. The advantage is that significantly less parameters are required. We also introduce a recurrent neural decoder architecture based on the method of successive relaxation. Improvements over standard belief propagation are also observed on sparser Tanner graph representations of the codes. Furthermore, we demonstrate that the neural belief propagation decoder can be used to improve the performance, or alternatively reduce the computational complexity, of a close to optimal decoder of short BCH codes.
Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding
Douik, Ahmed
2016-06-27
For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to act completely against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. This paper investigates the effect of controlling the decoding delay to reduce the completion time below its currently best-known solution in both perfect and imperfect feedback with persistent erasure channels. To solve the problem, the decodingdelay- dependent expressions of the users’ and overall completion times are derived in the complete feedback scenario. Although using such expressions to find the optimal overall completion time is NP-hard, the paper proposes two novel heuristics that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Afterward, the paper extends the study to the imperfect feedback scenario in which uncertainties at the sender affects its ability to anticipate accurately the decoding delay increase at each user. The paper formulates the problem in such environment and derives the expression of the minimum increase in the completion time. Simulation results show the performance of the proposed solutions and suggest that both heuristics achieves a lower mean completion time as compared to the best-known heuristics for the completion time reduction in perfect and imperfect feedback. The gap in performance becomes more significant as the erasure of the channel increases.
Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding
Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim
2016-01-01
For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to act completely against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. This paper investigates the effect of controlling the decoding delay to reduce the completion time below its currently best-known solution in both perfect and imperfect feedback with persistent erasure channels. To solve the problem, the decodingdelay- dependent expressions of the users’ and overall completion times are derived in the complete feedback scenario. Although using such expressions to find the optimal overall completion time is NP-hard, the paper proposes two novel heuristics that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Afterward, the paper extends the study to the imperfect feedback scenario in which uncertainties at the sender affects its ability to anticipate accurately the decoding delay increase at each user. The paper formulates the problem in such environment and derives the expression of the minimum increase in the completion time. Simulation results show the performance of the proposed solutions and suggest that both heuristics achieves a lower mean completion time as compared to the best-known heuristics for the completion time reduction in perfect and imperfect feedback. The gap in performance becomes more significant as the erasure of the channel increases.
Observations on Polar Coding with CRC-Aided List Decoding
2016-09-01
TECHNICAL REPORT 3041 September 2016 Observations on Polar Coding with CRC-Aided List Decoding David Wasserman Approved for public release. SSC...described in [2, 3]. In FY15 and FY16 we used cyclic redundancy check (CRC)-aided polar list decoding [4]. Section 2 describes the basics of polar coding ...and gives details of the encoders and decoders we used. In the course of our research, we performed simulations of polar codes in hundreds of cases
Polar Coding with CRC-Aided List Decoding
2015-08-01
TECHNICAL REPORT 2087 August 2015 Polar Coding with CRC-Aided List Decoding David Wasserman Approved...list decoding . RESULTS Our simulation results show that polar coding can produce results very similar to the FEC used in the Digital Video...standard. RECOMMENDATIONS In any application for which the DVB-S2 FEC is considered, polar coding with CRC-aided list decod - ing with N = 65536
A quantum algorithm for Viterbi decoding of classical convolutional codes
Grice, Jon R.; Meyer, David A.
2014-01-01
We present a quantum Viterbi algorithm (QVA) with better than classical performance under certain conditions. In this paper the proposed algorithm is applied to decoding classical convolutional codes, for instance; large constraint length $Q$ and short decode frames $N$. Other applications of the classical Viterbi algorithm where $Q$ is large (e.g. speech processing) could experience significant speedup with the QVA. The QVA exploits the fact that the decoding trellis is similar to the butter...
Design of a VLSI Decoder for Partially Structured LDPC Codes
Directory of Open Access Journals (Sweden)
Fabrizio Vacca
2008-01-01
of their parity matrix can be partitioned into two disjoint sets, namely, the structured and the random ones. For the proposed class of codes a constructive design method is provided. To assess the value of this method the constructed codes performance are presented. From these results, a novel decoding method called split decoding is introduced. Finally, to prove the effectiveness of the proposed approach a whole VLSI decoder is designed and characterized.
Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa
2017-05-16
In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF) relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks.
Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa
2017-01-01
In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF) relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks. PMID:28509841
Directory of Open Access Journals (Sweden)
Jong-Ho Lee
2017-05-01
Full Text Available In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks.
Modified Dynamic Decode-and-Forward Relaying Protocol for Type II Relay in LTE-Advanced and Beyond
Nam, Sung Sik
2016-11-29
In this paper, we propose a modified dynamic decode-and-forward (MoDDF) relaying protocol to meet the critical requirements for user equipment (UE) relays in next-generation cellular systems (e.g., LTE-Advanced and beyond). The proposed MoDDF realizes the fast jump-in relaying and the sequential decoding with an application of random codeset to encoding and re-encoding process at the source and the multiple UE relays, respectively. A subframe-by-subframe decoding based on the accumulated (or buffered) messages is employed to achieve energy, information, or mixed combining. Finally, possible early termination of decoding at the end user can lead to the higher spectral efficiency and more energy saving by reducing the frequency of redundant subframe transmission and decoding. These attractive features eliminate the need of directly exchanging control messages between multiple UE relays and the end user, which is an important prerequisite for the practical UE relay deployment. Copyright: © 2016 Nam et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Modified Dynamic Decode-and-Forward Relaying Protocol for Type II Relay in LTE-Advanced and Beyond
Nam, Sung Sik; Alouini, Mohamed-Slim; Choi, Seyeong
2016-01-01
In this paper, we propose a modified dynamic decode-and-forward (MoDDF) relaying protocol to meet the critical requirements for user equipment (UE) relays in next-generation cellular systems (e.g., LTE-Advanced and beyond). The proposed MoDDF realizes the fast jump-in relaying and the sequential decoding with an application of random codeset to encoding and re-encoding process at the source and the multiple UE relays, respectively. A subframe-by-subframe decoding based on the accumulated (or buffered) messages is employed to achieve energy, information, or mixed combining. Finally, possible early termination of decoding at the end user can lead to the higher spectral efficiency and more energy saving by reducing the frequency of redundant subframe transmission and decoding. These attractive features eliminate the need of directly exchanging control messages between multiple UE relays and the end user, which is an important prerequisite for the practical UE relay deployment. Copyright: © 2016 Nam et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Energy gap in La/sub 1. 85/Sr/sub 0. 15/CuO/sub 4-//sub y/ from point-contact tunneling
Energy Technology Data Exchange (ETDEWEB)
Hawley, M.E.; Gray, K.E.; Capone II, D.W.; Hinks, D.G.
1987-05-01
Point-contact tunneling into the high-T/sub c/ superconductor La/sub 1.85/Sr/sub 0.15/CuO/sub 4-//sub y/ reveals the first direct measure of the energy gap. Values range from 8 to 14 meV with the variation perhaps due to impurity phases, pressure-induced changes, or anisotropy. Even the minimum value indicates a strong-coupling superconductor.
Interpolation decoding method with variable parameters for fractal image compression
International Nuclear Information System (INIS)
He Chuanjiang; Li Gaoping; Shen Xiaona
2007-01-01
The interpolation fractal decoding method, which is introduced by [He C, Yang SX, Huang X. Progressive decoding method for fractal image compression. IEE Proc Vis Image Signal Process 2004;3:207-13], involves generating progressively the decoded image by means of an interpolation iterative procedure with a constant parameter. It is well-known that the majority of image details are added at the first steps of iterations in the conventional fractal decoding; hence the constant parameter for the interpolation decoding method must be set as a smaller value in order to achieve a better progressive decoding. However, it needs to take an extremely large number of iterations to converge. It is thus reasonable for some applications to slow down the iterative process at the first stages of decoding and then to accelerate it afterwards (e.g., at some iteration as we need). To achieve the goal, this paper proposed an interpolation decoding scheme with variable (iteration-dependent) parameters and proved the convergence of the decoding process mathematically. Experimental results demonstrate that the proposed scheme has really achieved the above-mentioned goal
Joint Decoding of Concatenated VLEC and STTC System
Directory of Open Access Journals (Sweden)
Chen Huijun
2008-01-01
Full Text Available Abstract We consider the decoding of wireless communication systems with both source coding in the application layer and channel coding in the physical layer for high-performance transmission over fading channels. Variable length error correcting codes (VLECs and space time trellis codes (STTCs are used to provide bandwidth efficient data compression as well as coding and diversity gains. At the receiver, an iterative joint source and space time decoding scheme are developed to utilize redundancy in both STTC and VLEC to improve overall decoding performance. Issues such as the inseparable systematic information in the symbol level, the asymmetric trellis structure of VLEC, and information exchange between bit and symbol domains have been considered in the maximum a posteriori probability (MAP decoding algorithm. Simulation results indicate that the developed joint decoding scheme achieves a significant decoding gain over the separate decoding in fading channels, whether or not the channel information is perfectly known at the receiver. Furthermore, how rate allocation between STTC and VLEC affects the performance of the joint source and space-time decoder is investigated. Different systems with a fixed overall information rate are studied. It is shown that for a system with more redundancy dedicated to the source code and a higher order modulation of STTC, the joint decoding yields better performance, though with increased complexity.
Joint Decoding of Concatenated VLEC and STTC System
Directory of Open Access Journals (Sweden)
Huijun Chen
2008-07-01
Full Text Available We consider the decoding of wireless communication systems with both source coding in the application layer and channel coding in the physical layer for high-performance transmission over fading channels. Variable length error correcting codes (VLECs and space time trellis codes (STTCs are used to provide bandwidth efficient data compression as well as coding and diversity gains. At the receiver, an iterative joint source and space time decoding scheme are developed to utilize redundancy in both STTC and VLEC to improve overall decoding performance. Issues such as the inseparable systematic information in the symbol level, the asymmetric trellis structure of VLEC, and information exchange between bit and symbol domains have been considered in the maximum a posteriori probability (MAP decoding algorithm. Simulation results indicate that the developed joint decoding scheme achieves a significant decoding gain over the separate decoding in fading channels, whether or not the channel information is perfectly known at the receiver. Furthermore, how rate allocation between STTC and VLEC affects the performance of the joint source and space-time decoder is investigated. Different systems with a fixed overall information rate are studied. It is shown that for a system with more redundancy dedicated to the source code and a higher order modulation of STTC, the joint decoding yields better performance, though with increased complexity.
Grasp movement decoding from premotor and parietal cortex.
Townsend, Benjamin R; Subasi, Erk; Scherberger, Hansjörg
2011-10-05
Despite recent advances in harnessing cortical motor-related activity to control computer cursors and robotic devices, the ability to decode and execute different grasping patterns remains a major obstacle. Here we demonstrate a simple Bayesian decoder for real-time classification of grip type and wrist orientation in macaque monkeys that uses higher-order planning signals from anterior intraparietal cortex (AIP) and ventral premotor cortex (area F5). Real-time decoding was based on multiunit signals, which had similar tuning properties to cells in previous single-unit recording studies. Maximum decoding accuracy for two grasp types (power and precision grip) and five wrist orientations was 63% (chance level, 10%). Analysis of decoder performance showed that grip type decoding was highly accurate (90.6%), with most errors occurring during orientation classification. In a subsequent off-line analysis, we found small but significant performance improvements (mean, 6.25 percentage points) when using an optimized spike-sorting method (superparamagnetic clustering). Furthermore, we observed significant differences in the contributions of F5 and AIP for grasp decoding, with F5 being better suited for classification of the grip type and AIP contributing more toward decoding of object orientation. However, optimum decoding performance was maximal when using neural activity simultaneously from both areas. Overall, these results highlight quantitative differences in the functional representation of grasp movements in AIP and F5 and represent a first step toward using these signals for developing functional neural interfaces for hand grasping.
Sub-quadratic decoding of one-point hermitian codes
DEFF Research Database (Denmark)
Nielsen, Johan Sebastian Rosenkilde; Beelen, Peter
2015-01-01
We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realization of the Guruswami-Sudan algorithm using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimization. The second is a power...... decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. We show how the resulting key equations can be solved by the matrix minimization algorithms from computer algebra, yielding similar asymptotic complexities....
Li, Yang
2015-04-28
© 2015 AIP Publishing LLC. The electronic efficiency and binding energy of contacts formed between graphene electrodes and poly-aromatic hydrocarbon (PAH) anchoring groups have been investigated by the non-equilibrium Green\\'s function formalism combined with density functional theory. Our calculations show that PAH molecules always bind in the interior and at the edge of graphene in the AB stacking manner, and that the binding energy increases following the increase of the number of carbon and hydrogen atoms constituting the PAH molecule. When we move to analyzing the electronic transport properties of molecular junctions with a six-carbon alkyne chain as the central molecule, the electronic efficiency of the graphene-PAH contacts is found to depend on the energy gap between the highest occupied molecular orbital (HOMO) and the lowest unoccupied molecular orbital (LUMO) of the corresponding PAH anchoring group, rather than its size. To be specific, the smaller is the HOMO-LUMO gap of the PAH anchoring group, the higher is the electronic efficiency of the graphene-PAH contact. Although the HOMO-LUMO gap of a PAH molecule depends on its specific configuration, PAH molecules with similar atomic structures show a decreasing trend for their HOMO-LUMO gap as the number of fused benzene rings increases. Therefore, graphene-conjugated molecule-graphene junctions with high-binding and high-conducting graphene-PAH contacts can be realized by choosing appropriate PAH anchor groups with a large area and a small HOMO-LUMO gap.
Sudan-decoding generalized geometric Goppa codes
DEFF Research Database (Denmark)
Heydtmann, Agnes Eileen
2003-01-01
Generalized geometric Goppa codes are vector spaces of n-tuples with entries from different extension fields of a ground field. They are derived from evaluating functions similar to conventional geometric Goppa codes, but allowing evaluation in places of arbitrary degree. A decoding scheme...... for these codes based on Sudan's improved algorithm is presented and its error-correcting capacity is analyzed. For the implementation of the algorithm it is necessary that the so-called increasing zero bases of certain spaces of functions are available. A method to obtain such bases is developed....
Memory-efficient decoding of LDPC codes
Kwok-San Lee, Jason; Thorpe, Jeremy; Hawkins, Jon
2005-01-01
We present a low-complexity quantization scheme for the implementation of regular (3,6) LDPC codes. The quantization parameters are optimized to maximize the mutual information between the source and the quantized messages. Using this non-uniform quantized belief propagation algorithm, we have simulated that an optimized 3-bit quantizer operates with 0.2dB implementation loss relative to a floating point decoder, and an optimized 4-bit quantizer operates less than 0.1dB quantization loss.
[Modulation of Metacognition with Decoded Neurofeedback].
Koizumi, Ai; Cortese, Aurelio; Amano, Kaoru; Kawato, Mitsuo; Lau, Hakwan
2017-12-01
Humans often assess their confidence in their own perception, e.g., feeling "confident" or "certain" of having seen a friend, or feeling "uncertain" about whether the phone rang. The neural mechanism underlying the metacognitive function that reflects subjective perception still remains under debate. We have previously used decoded neurofeedback (DecNef) to demonstrate that manipulating the multivoxel activation patterns in the frontoparietal network modulates perceptual confidence without affecting perceptual performance. The results provided clear evidence for a dissociation between perceptual confidence and performance and suggested a distinct role of the frontoparietal network in metacognition.
Maximum a posteriori decoder for digital communications
Altes, Richard A. (Inventor)
1997-01-01
A system and method for decoding by identification of the most likely phase coded signal corresponding to received data. The present invention has particular application to communication with signals that experience spurious random phase perturbations. The generalized estimator-correlator uses a maximum a posteriori (MAP) estimator to generate phase estimates for correlation with incoming data samples and for correlation with mean phases indicative of unique hypothesized signals. The result is a MAP likelihood statistic for each hypothesized transmission, wherein the highest value statistic identifies the transmitted signal.
Vectorization of Reed Solomon decoding and mapping on the EVP
Kumar, A.; Berkel, van C.H.
2008-01-01
Reed Solomon (RS) codes are used in a variety of (wireless) communication systems. Although commonly implemented in dedicated hardware, this paper explores the mapping of high-throughput RS decoding on vector DSPs. The four modules of such a decoder, viz. Syndrome Computation, Key Equation Solver,
LDPC Codes--Structural Analysis and Decoding Techniques
Zhang, Xiaojie
2012-01-01
Low-density parity-check (LDPC) codes have been the focus of much research over the past decade thanks to their near Shannon limit performance and to their efficient message-passing (MP) decoding algorithms. However, the error floor phenomenon observed in MP decoding, which manifests itself as an abrupt change in the slope of the error-rate curve,…
IQ Predicts Word Decoding Skills in Populations with Intellectual Disabilities
Levy, Yonata
2011-01-01
This is a study of word decoding in adolescents with Down syndrome and in adolescents with Intellectual Deficits of unknown etiology. It was designed as a replication of studies of word decoding in English speaking and in Hebrew speaking adolescents with Williams syndrome ([0230] and [0235]). Participants' IQ was matched to IQ in the groups with…
Word Processing in Dyslexics: An Automatic Decoding Deficit?
Yap, Regina; Van Der Leu, Aryan
1993-01-01
Compares dyslexic children with normal readers on measures of phonological decoding and automatic word processing. Finds that dyslexics have a deficit in automatic phonological decoding skills. Discusses results within the framework of the phonological deficit and the automatization deficit hypotheses. (RS)
Role of Gender and Linguistic Diversity in Word Decoding Development
Verhoeven, Ludo; van Leeuwe, Jan
2011-01-01
The purpose of the present study was to investigate the role of gender and linguistic diversity in the growth of Dutch word decoding skills throughout elementary school for a representative sample of children living in the Netherlands. Following a longitudinal design, the children's decoding abilities for (1) regular CVC words, (2) complex…
Decoding bipedal locomotion from the rat sensorimotor cortex
Rigosa, J.; Panarese, A.; Dominici, N.; Friedli, L.; van den Brand, R.; Carpaneto, J.; DiGiovanna, J.; Courtine, G.; Micera, S.
2015-01-01
Objective. Decoding forelimb movements from the firing activity of cortical neurons has been interfaced with robotic and prosthetic systems to replace lost upper limb functions in humans. Despite the potential of this approach to improve locomotion and facilitate gait rehabilitation, decoding lower
Minho Won; Albalawi, Hassan; Xin Li; Thomas, Donald E
2014-01-01
This paper describes a low-power hardware implementation for movement decoding of brain computer interface. Our proposed hardware design is facilitated by two novel ideas: (i) an efficient feature extraction method based on reduced-resolution discrete cosine transform (DCT), and (ii) a new hardware architecture of dual look-up table to perform discrete cosine transform without explicit multiplication. The proposed hardware implementation has been validated for movement decoding of electrocorticography (ECoG) signal by using a Xilinx FPGA Zynq-7000 board. It achieves more than 56× energy reduction over a reference design using band-pass filters for feature extraction.
Multi-stage decoding of multi-level modulation codes
Lin, Shu; Kasami, Tadao; Costello, Daniel J., Jr.
1991-01-01
Various types of multi-stage decoding for multi-level modulation codes are investigated. It is shown that if the component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. Particularly, it is shown that the difference in performance between the suboptimum multi-stage soft-decision maximum likelihood decoding of a modulation code and the single-stage optimum soft-decision decoding of the code is very small, only a fraction of dB loss in signal to noise ratio at a bit error rate (BER) of 10(exp -6).
Iterative List Decoding of Concatenated Source-Channel Codes
Directory of Open Access Journals (Sweden)
Hedayat Ahmadreza
2005-01-01
Full Text Available Whenever variable-length entropy codes are used in the presence of a noisy channel, any channel errors will propagate and cause significant harm. Despite using channel codes, some residual errors always remain, whose effect will get magnified by error propagation. Mitigating this undesirable effect is of great practical interest. One approach is to use the residual redundancy of variable length codes for joint source-channel decoding. In this paper, we improve the performance of residual redundancy source-channel decoding via an iterative list decoder made possible by a nonbinary outer CRC code. We show that the list decoding of VLC's is beneficial for entropy codes that contain redundancy. Such codes are used in state-of-the-art video coders, for example. The proposed list decoder improves the overall performance significantly in AWGN and fully interleaved Rayleigh fading channels.
Energy Technology Data Exchange (ETDEWEB)
Hatamipour, M.S.; Fakhr Hoseini, S.M.; Tavakkoli, T.; Mehrkesh, A.H. [Chemical Engineering Department, University of Isfahan, Isfahan (Iran)
2010-05-15
Industrial processes are the most energy consuming processes in the world. Modification of these processes helps us with controlling the consumption of energy and minimizing energy loss. Changing raw materials is one of the ways through which we can optimize industrial processes. In this paper, a new solvent mixture (furfural + a co-solvent) was used for the extraction of lubricating base oil from lube-oil cut. It was found that the energy consumption of the new solvent mixture for obtaining a product with the same quality was much lower than the original solvent. By using this new solvent mixture, the operating temperature of the top of tower was reduced by 30 K. This leads to a high reduction in energy consumption in extraction of aromatics from lube oil. At our new extraction process by means of using new solvent mixture, the maximum energy saving was 38% per cubic meter of produced raffinate. (author)
Benkhelifa, Fatma; Salem, Ahmed Sultan; Alouini, Mohamed-Slim
2016-01-01
In this paper, we investigate the simultaneous wireless information and power transfer (SWIPT) in a multiple-input multiple-output (MIMO) decode-and-forward (DF) relay system where the relay is an energy harvesting (EH) multi-antenna node equipped
Oliullah, Md.; Liu, J. Y.; Song, P.; Wang, Y.
2018-06-01
A three-layer theoretical model is developed for the characterization of the electronic transport properties (lifetime τ, diffusion coefficient D, and surface recombination velocity s) with energetic particle irradiation on solar cells using non-contact photocarrier radiometry. Monte Carlo (MC) simulation is carried out to obtain the depth profiles of the proton irradiation layer at different low energies (solar cells are investigated under different low-energy proton irradiation, and the carrier transport parameters of the three layers are obtained by best-fitting of the experimental results. The results show that the low-energy protons have little influence on the transport parameters of the non-irradiated layer, but high influences on both of the p and n-region irradiation layers which are consisted of MC simulation.
Decoding magnetoencephalographic rhythmic activity using spectrospatial information.
Kauppi, Jukka-Pekka; Parkkonen, Lauri; Hari, Riitta; Hyvärinen, Aapo
2013-12-01
We propose a new data-driven decoding method called Spectral Linear Discriminant Analysis (Spectral LDA) for the analysis of magnetoencephalography (MEG). The method allows investigation of changes in rhythmic neural activity as a result of different stimuli and tasks. The introduced classification model only assumes that each "brain state" can be characterized as a combination of neural sources, each of which shows rhythmic activity at one or several frequency bands. Furthermore, the model allows the oscillation frequencies to be different for each such state. We present decoding results from 9 subjects in a four-category classification problem defined by an experiment involving randomly alternating epochs of auditory, visual and tactile stimuli interspersed with rest periods. The performance of Spectral LDA was very competitive compared with four alternative classifiers based on different assumptions concerning the organization of rhythmic brain activity. In addition, the spectral and spatial patterns extracted automatically on the basis of trained classifiers showed that Spectral LDA offers a novel and interesting way of analyzing spectrospatial oscillatory neural activity across the brain. All the presented classification methods and visualization tools are freely available as a Matlab toolbox. © 2013.
Unsupervised learning of facial emotion decoding skills
Directory of Open Access Journals (Sweden)
Jan Oliver Huelle
2014-02-01
Full Text Available Research on the mechanisms underlying human facial emotion recognition has long focussed on genetically determined neural algorithms and often neglected the question of how these algorithms might be tuned by social learning. Here we show that facial emotion decoding skills can be significantly and sustainably improved by practise without an external teaching signal. Participants saw video clips of dynamic facial expressions of five different women and were asked to decide which of four possible emotions (anger, disgust, fear and sadness was shown in each clip. Although no external information about the correctness of the participant’s response or the sender’s true affective state was provided, participants showed a significant increase of facial emotion recognition accuracy both within and across two training sessions two days to several weeks apart. We discuss several similarities and differences between the unsupervised improvement of facial decoding skills observed in the current study, unsupervised perceptual learning of simple stimuli described in previous studies and practise effects often observed in cognitive tasks.
Unsupervised learning of facial emotion decoding skills.
Huelle, Jan O; Sack, Benjamin; Broer, Katja; Komlewa, Irina; Anders, Silke
2014-01-01
Research on the mechanisms underlying human facial emotion recognition has long focussed on genetically determined neural algorithms and often neglected the question of how these algorithms might be tuned by social learning. Here we show that facial emotion decoding skills can be significantly and sustainably improved by practice without an external teaching signal. Participants saw video clips of dynamic facial expressions of five different women and were asked to decide which of four possible emotions (anger, disgust, fear, and sadness) was shown in each clip. Although no external information about the correctness of the participant's response or the sender's true affective state was provided, participants showed a significant increase of facial emotion recognition accuracy both within and across two training sessions two days to several weeks apart. We discuss several similarities and differences between the unsupervised improvement of facial decoding skills observed in the current study, unsupervised perceptual learning of simple stimuli described in previous studies and practice effects often observed in cognitive tasks.
Decoding suprathreshold stochastic resonance with optimal weights
International Nuclear Information System (INIS)
Xu, Liyan; Vladusich, Tony; Duan, Fabing; Gunn, Lachlan J.; Abbott, Derek; McDonnell, Mark D.
2015-01-01
We investigate an array of stochastic quantizers for converting an analog input signal into a discrete output in the context of suprathreshold stochastic resonance. A new optimal weighted decoding is considered for different threshold level distributions. We show that for particular noise levels and choices of the threshold levels optimally weighting the quantizer responses provides a reduced mean square error in comparison with the original unweighted array. However, there are also many parameter regions where the original array provides near optimal performance, and when this occurs, it offers a much simpler approach than optimally weighting each quantizer's response. - Highlights: • A weighted summing array of independently noisy binary comparators is investigated. • We present an optimal linearly weighted decoding scheme for combining the comparator responses. • We solve for the optimal weights by applying least squares regression to simulated data. • We find that the MSE distortion of weighting before summation is superior to unweighted summation of comparator responses. • For some parameter regions, the decrease in MSE distortion due to weighting is negligible
Bayer image parallel decoding based on GPU
Hu, Rihui; Xu, Zhiyong; Wei, Yuxing; Sun, Shaohua
2012-11-01
In the photoelectrical tracking system, Bayer image is decompressed in traditional method, which is CPU-based. However, it is too slow when the images become large, for example, 2K×2K×16bit. In order to accelerate the Bayer image decoding, this paper introduces a parallel speedup method for NVIDA's Graphics Processor Unit (GPU) which supports CUDA architecture. The decoding procedure can be divided into three parts: the first is serial part, the second is task-parallelism part, and the last is data-parallelism part including inverse quantization, inverse discrete wavelet transform (IDWT) as well as image post-processing part. For reducing the execution time, the task-parallelism part is optimized by OpenMP techniques. The data-parallelism part could advance its efficiency through executing on the GPU as CUDA parallel program. The optimization techniques include instruction optimization, shared memory access optimization, the access memory coalesced optimization and texture memory optimization. In particular, it can significantly speed up the IDWT by rewriting the 2D (Tow-dimensional) serial IDWT into 1D parallel IDWT. Through experimenting with 1K×1K×16bit Bayer image, data-parallelism part is 10 more times faster than CPU-based implementation. Finally, a CPU+GPU heterogeneous decompression system was designed. The experimental result shows that it could achieve 3 to 5 times speed increase compared to the CPU serial method.
Squires, Katie Ellen
2013-01-01
This study investigated the differential contribution of auditory-verbal and visuospatial working memory (WM) on decoding skills in second- and fifth-grade children identified with poor decoding. Thirty-two second-grade students and 22 fifth-grade students completed measures that assessed simple and complex auditory-verbal and visuospatial memory,…
Energy Technology Data Exchange (ETDEWEB)
McLane, V.; Layne, A.
1995-06-01
A survey of the DOE facilities was undertaken by the Points-of-Contact for the DOE Review of Laboratory Programs for Women in order to gather data to be used as a baseline against which to measure future progress. We plan to look at current programs already in place and evaluate them with a view to deciding which programs are most effective, and selecting model programs suitable for implementation at other facilities. The survey focused on four areas: 1) statistical data, 2) laboratory policy, 3) formal and informal programs which affect the quality of life in the work environment, and career development and advancement, and 4) educational programs. Although this report focuses on women, the problems discussed affect all DOE facility employees.
O2-GIDNC: Beyond instantly decodable network coding
Aboutorab, Neda
2013-06-01
In this paper, we are concerned with extending the graph representation of generalized instantly decodable network coding (GIDNC) to a more general opportunistic network coding (ONC) scenario, referred to as order-2 GIDNC (O2-GIDNC). In the O2-GIDNC scheme, receivers can store non-instantly decodable packets (NIDPs) comprising two of their missing packets, and use them in a systematic way for later decodings. Once this graph representation is found, it can be used to extend the GIDNC graph-based analyses to the proposed O2-GIDNC scheme with a limited increase in complexity. In the proposed O2-GIDNC scheme, the information of the stored NIDPs at the receivers and the decoding opportunities they create can be exploited to improve the broadcast completion time and decoding delay compared to traditional GIDNC scheme. The completion time and decoding delay minimizing algorithms that can operate on the new O2-GIDNC graph are further described. The simulation results show that our proposed O2-GIDNC improves the completion time and decoding delay performance of the traditional GIDNC. © 2013 IEEE.
On decoding of multi-level MPSK modulation codes
Lin, Shu; Gupta, Alok Kumar
1990-01-01
The decoding problem of multi-level block modulation codes is investigated. The hardware design of soft-decision Viterbi decoder for some short length 8-PSK block modulation codes is presented. An effective way to reduce the hardware complexity of the decoder by reducing the branch metric and path metric, using a non-uniform floating-point to integer mapping scheme, is proposed and discussed. The simulation results of the design are presented. The multi-stage decoding (MSD) of multi-level modulation codes is also investigated. The cases of soft-decision and hard-decision MSD are considered and their performance are evaluated for several codes of different lengths and different minimum squared Euclidean distances. It is shown that the soft-decision MSD reduces the decoding complexity drastically and it is suboptimum. The hard-decision MSD further simplifies the decoding while still maintaining a reasonable coding gain over the uncoded system, if the component codes are chosen properly. Finally, some basic 3-level 8-PSK modulation codes using BCH codes as component codes are constructed and their coding gains are found for hard decision multistage decoding.
Encoder-decoder optimization for brain-computer interfaces.
Merel, Josh; Pianto, Donald M; Cunningham, John P; Paninski, Liam
2015-06-01
Neuroprosthetic brain-computer interfaces are systems that decode neural activity into useful control signals for effectors, such as a cursor on a computer screen. It has long been recognized that both the user and decoding system can adapt to increase the accuracy of the end effector. Co-adaptation is the process whereby a user learns to control the system in conjunction with the decoder adapting to learn the user's neural patterns. We provide a mathematical framework for co-adaptation and relate co-adaptation to the joint optimization of the user's control scheme ("encoding model") and the decoding algorithm's parameters. When the assumptions of that framework are respected, co-adaptation cannot yield better performance than that obtainable by an optimal initial choice of fixed decoder, coupled with optimal user learning. For a specific case, we provide numerical methods to obtain such an optimized decoder. We demonstrate our approach in a model brain-computer interface system using an online prosthesis simulator, a simple human-in-the-loop pyschophysics setup which provides a non-invasive simulation of the BCI setting. These experiments support two claims: that users can learn encoders matched to fixed, optimal decoders and that, once learned, our approach yields expected performance advantages.
Encoder-decoder optimization for brain-computer interfaces.
Directory of Open Access Journals (Sweden)
Josh Merel
2015-06-01
Full Text Available Neuroprosthetic brain-computer interfaces are systems that decode neural activity into useful control signals for effectors, such as a cursor on a computer screen. It has long been recognized that both the user and decoding system can adapt to increase the accuracy of the end effector. Co-adaptation is the process whereby a user learns to control the system in conjunction with the decoder adapting to learn the user's neural patterns. We provide a mathematical framework for co-adaptation and relate co-adaptation to the joint optimization of the user's control scheme ("encoding model" and the decoding algorithm's parameters. When the assumptions of that framework are respected, co-adaptation cannot yield better performance than that obtainable by an optimal initial choice of fixed decoder, coupled with optimal user learning. For a specific case, we provide numerical methods to obtain such an optimized decoder. We demonstrate our approach in a model brain-computer interface system using an online prosthesis simulator, a simple human-in-the-loop pyschophysics setup which provides a non-invasive simulation of the BCI setting. These experiments support two claims: that users can learn encoders matched to fixed, optimal decoders and that, once learned, our approach yields expected performance advantages.
Hard decoding algorithm for optimizing thresholds under general Markovian noise
Chamberland, Christopher; Wallman, Joel; Beale, Stefanie; Laflamme, Raymond
2017-04-01
Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of error-correcting codes have been obtained. However, realistic quantum systems can undergo noise processes that differ significantly from Pauli noise. In this paper, we present an efficient hard decoding algorithm for optimizing thresholds and lowering failure rates of an error-correcting code under general completely positive and trace-preserving (i.e., Markovian) noise. We use our hard decoding algorithm to study the performance of several error-correcting codes under various non-Pauli noise models by computing threshold values and failure rates for these codes. We compare the performance of our hard decoding algorithm to decoders optimized for depolarizing noise and show improvements in thresholds and reductions in failure rates by several orders of magnitude. Our hard decoding algorithm can also be adapted to take advantage of a code's non-Pauli transversal gates to further suppress noise. For example, we show that using the transversal gates of the 5-qubit code allows arbitrary rotations around certain axes to be perfectly corrected. Furthermore, we show that Pauli twirling can increase or decrease the threshold depending upon the code properties. Lastly, we show that even if the physical noise model differs slightly from the hypothesized noise model used to determine an optimized decoder, failure rates can still be reduced by applying our hard decoding algorithm.
Decoding emotional valence from electroencephalographic rhythmic activity.
Celikkanat, Hande; Moriya, Hiroki; Ogawa, Takeshi; Kauppi, Jukka-Pekka; Kawanabe, Motoaki; Hyvarinen, Aapo
2017-07-01
We attempt to decode emotional valence from electroencephalographic rhythmic activity in a naturalistic setting. We employ a data-driven method developed in a previous study, Spectral Linear Discriminant Analysis, to discover the relationships between the classification task and independent neuronal sources, optimally utilizing multiple frequency bands. A detailed investigation of the classifier provides insight into the neuronal sources related with emotional valence, and the individual differences of the subjects in processing emotions. Our findings show: (1) sources whose locations are similar across subjects are consistently involved in emotional responses, with the involvement of parietal sources being especially significant, and (2) even though the locations of the involved neuronal sources are consistent, subjects can display highly varying degrees of valence-related EEG activity in the sources.
Decoding the mechanisms of Antikythera astronomical device
Lin, Jian-Liang
2016-01-01
This book presents a systematic design methodology for decoding the interior structure of the Antikythera mechanism, an astronomical device from ancient Greece. The historical background, surviving evidence and reconstructions of the mechanism are introduced, and the historical development of astronomical achievements and various astronomical instruments are investigated. Pursuing an approach based on the conceptual design of modern mechanisms and bearing in mind the standards of science and technology at the time, all feasible designs of the six lost/incomplete/unclear subsystems are synthesized as illustrated examples, and 48 feasible designs of the complete interior structure are presented. This approach provides not only a logical tool for applying modern mechanical engineering knowledge to the reconstruction of the Antikythera mechanism, but also an innovative research direction for identifying the original structures of the mechanism in the future. In short, the book offers valuable new insights for all...
Academic Training - Bioinformatics: Decoding the Genome
Chris Jones
2006-01-01
ACADEMIC TRAINING LECTURE SERIES 27, 28 February 1, 2, 3 March 2006 from 11:00 to 12:00 - Auditorium, bldg. 500 Decoding the Genome A special series of 5 lectures on: Recent extraordinary advances in the life sciences arising through new detection technologies and bioinformatics The past five years have seen an extraordinary change in the information and tools available in the life sciences. The sequencing of the human genome, the discovery that we possess far fewer genes than foreseen, the measurement of the tiny changes in the genomes that differentiate us, the sequencing of the genomes of many pathogens that lead to diseases such as malaria are all examples of completely new information that is now available in the quest for improved healthcare. New tools have allowed similar strides in the discovery of the associated protein structures, providing invaluable information for those searching for new drugs. New DNA microarray chips permit simultaneous measurement of the state of expression of tens...
Real-time minimal-bit-error probability decoding of convolutional codes
Lee, L.-N.
1974-01-01
A recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.
Real-time minimal bit error probability decoding of convolutional codes
Lee, L. N.
1973-01-01
A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.
Multiple LDPC decoding for distributed source coding and video coding
DEFF Research Database (Denmark)
Forchhammer, Søren; Luong, Huynh Van; Huang, Xin
2011-01-01
Distributed source coding (DSC) is a coding paradigm for systems which fully or partly exploit the source statistics at the decoder to reduce the computational burden at the encoder. Distributed video coding (DVC) is one example. This paper considers the use of Low Density Parity Check Accumulate...... (LDPCA) codes in a DSC scheme with feed-back. To improve the LDPC coding performance in the context of DSC and DVC, while retaining short encoder blocks, this paper proposes multiple parallel LDPC decoding. The proposed scheme passes soft information between decoders to enhance performance. Experimental...
Locally decodable codes and private information retrieval schemes
Yekhanin, Sergey
2010-01-01
Locally decodable codes (LDCs) are codes that simultaneously provide efficient random access retrieval and high noise resilience by allowing reliable reconstruction of an arbitrary bit of a message by looking at only a small number of randomly chosen codeword bits. Local decodability comes with a certain loss in terms of efficiency - specifically, locally decodable codes require longer codeword lengths than their classical counterparts. Private information retrieval (PIR) schemes are cryptographic protocols designed to safeguard the privacy of database users. They allow clients to retrieve rec
Neural network decoder for quantum error correcting codes
Krastanov, Stefan; Jiang, Liang
Artificial neural networks form a family of extremely powerful - albeit still poorly understood - tools used in anything from image and sound recognition through text generation to, in our case, decoding. We present a straightforward Recurrent Neural Network architecture capable of deducing the correcting procedure for a quantum error-correcting code from a set of repeated stabilizer measurements. We discuss the fault-tolerance of our scheme and the cost of training the neural network for a system of a realistic size. Such decoders are especially interesting when applied to codes, like the quantum LDPC codes, that lack known efficient decoding schemes.
EXIT Chart Analysis of Binary Message-Passing Decoders
DEFF Research Database (Denmark)
Lechner, Gottfried; Pedersen, Troels; Kramer, Gerhard
2007-01-01
Binary message-passing decoders for LDPC codes are analyzed using EXIT charts. For the analysis, the variable node decoder performs all computations in the L-value domain. For the special case of a hard decision channel, this leads to the well know Gallager B algorithm, while the analysis can...... be extended to channels with larger output alphabets. By increasing the output alphabet from hard decisions to four symbols, a gain of more than 1.0 dB is achieved using optimized codes. For this code optimization, the mixing property of EXIT functions has to be modified to the case of binary message......-passing decoders....
Turbo decoder architecture for beyond-4G applications
Wong, Cheng-Chi
2013-01-01
This book describes the most recent techniques for turbo decoder implementation, especially for 4G and beyond 4G applications. The authors reveal techniques for the design of high-throughput decoders for future telecommunication systems, enabling designers to reduce hardware cost and shorten processing time. Coverage includes an explanation of VLSI implementation of the turbo decoder, from basic functional units to advanced parallel architecture. The authors discuss both hardware architecture techniques and experimental results, showing the variations in area/throughput/performance with respec
Encoding and Decoding Models in Cognitive Electrophysiology
Directory of Open Access Journals (Sweden)
Christopher R. Holdgraf
2017-09-01
Full Text Available Cognitive neuroscience has seen rapid growth in the size and complexity of data recorded from the human brain as well as in the computational tools available to analyze this data. This data explosion has resulted in an increased use of multivariate, model-based methods for asking neuroscience questions, allowing scientists to investigate multiple hypotheses with a single dataset, to use complex, time-varying stimuli, and to study the human brain under more naturalistic conditions. These tools come in the form of “Encoding” models, in which stimulus features are used to model brain activity, and “Decoding” models, in which neural features are used to generated a stimulus output. Here we review the current state of encoding and decoding models in cognitive electrophysiology and provide a practical guide toward conducting experiments and analyses in this emerging field. Our examples focus on using linear models in the study of human language and audition. We show how to calculate auditory receptive fields from natural sounds as well as how to decode neural recordings to predict speech. The paper aims to be a useful tutorial to these approaches, and a practical introduction to using machine learning and applied statistics to build models of neural activity. The data analytic approaches we discuss may also be applied to other sensory modalities, motor systems, and cognitive systems, and we cover some examples in these areas. In addition, a collection of Jupyter notebooks is publicly available as a complement to the material covered in this paper, providing code examples and tutorials for predictive modeling in python. The aim is to provide a practical understanding of predictive modeling of human brain data and to propose best-practices in conducting these analyses.
Study of bifurcation behavior of two-dimensional turbo product code decoders
International Nuclear Information System (INIS)
He Yejun; Lau, Francis C.M.; Tse, Chi K.
2008-01-01
Turbo codes, low-density parity-check (LDPC) codes and turbo product codes (TPCs) are high performance error-correction codes which employ iterative algorithms for decoding. Under different conditions, the behaviors of the decoders are different. While the nonlinear dynamical behaviors of turbo code decoders and LDPC decoders have been reported in the literature, the dynamical behavior of TPC decoders is relatively unexplored. In this paper, we investigate the behavior of the iterative algorithm of a two-dimensional TPC decoder when the input signal-to-noise ratio (SNR) varies. The quantity to be measured is the mean square value of the posterior probabilities of the information bits. Unlike turbo decoders or LDPC decoders, TPC decoders do not produce a clear 'waterfall region'. This is mainly because the TPC decoding algorithm does not converge to 'indecisive' fixed points even at very low SNR values
Study of bifurcation behavior of two-dimensional turbo product code decoders
Energy Technology Data Exchange (ETDEWEB)
He Yejun [Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hunghom, Hong Kong (China); Lau, Francis C.M. [Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hunghom, Hong Kong (China)], E-mail: encmlau@polyu.edu.hk; Tse, Chi K. [Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hunghom, Hong Kong (China)
2008-04-15
Turbo codes, low-density parity-check (LDPC) codes and turbo product codes (TPCs) are high performance error-correction codes which employ iterative algorithms for decoding. Under different conditions, the behaviors of the decoders are different. While the nonlinear dynamical behaviors of turbo code decoders and LDPC decoders have been reported in the literature, the dynamical behavior of TPC decoders is relatively unexplored. In this paper, we investigate the behavior of the iterative algorithm of a two-dimensional TPC decoder when the input signal-to-noise ratio (SNR) varies. The quantity to be measured is the mean square value of the posterior probabilities of the information bits. Unlike turbo decoders or LDPC decoders, TPC decoders do not produce a clear 'waterfall region'. This is mainly because the TPC decoding algorithm does not converge to 'indecisive' fixed points even at very low SNR values.
Architecture for time or transform domain decoding of reed-solomon codes
Shao, Howard M. (Inventor); Truong, Trieu-Kie (Inventor); Hsu, In-Shek (Inventor); Deutsch, Leslie J. (Inventor)
1989-01-01
Two pipeline (255,233) RS decoders, one a time domain decoder and the other a transform domain decoder, use the same first part to develop an errata locator polynomial .tau.(x), and an errata evaluator polynominal A(x). Both the time domain decoder and transform domain decoder have a modified GCD that uses an input multiplexer and an output demultiplexer to reduce the number of GCD cells required. The time domain decoder uses a Chien search and polynomial evaluator on the GCD outputs .tau.(x) and A(x), for the final decoding steps, while the transform domain decoder uses a transform error pattern algorithm operating on .tau.(x) and the initial syndrome computation S(x), followed by an inverse transform algorithm in sequence for the final decoding steps prior to adding the received RS coded message to produce a decoded output message.
International Nuclear Information System (INIS)
Palanisami, Nallasamy; He, Ke; Moon, Il Shik
2014-01-01
Membrane distillation (MD), a non-isothermal membrane separation process, is based on the phenomenon that pure water in its vapor state can be extracted from aqueous solutions by passing vapor through a hydrophobic microporous membrane when a temperature difference is established across it. We used three commercially available hydrophobic microporous membranes (C02, C07 and C12; based on the pore size 0.2, 0.7 and 1.2 µm respectively) for desalination via direct contact MD (DCMD). The effects of operating parameters on permeation flux were studied. In addition, the desalination of seawater by solar assisted DCMD process was experimentally investigated. First, using solar power only short-term (one day), successful desalination of real seawater was achieved without temperature control under the following conditions: feed inlet temperature 65.0 .deg. C, permeate inlet temperature 25.0 .deg. C, and a flow rate of 2.5 L/min. The developed system also worked well in the long-term (150 days) for seawater desalination using both solar and electric power. Long-term test flux was reduced from 28.48 to only 26.50 L/m 2 hr, indicating system feasibility
Energy Technology Data Exchange (ETDEWEB)
Palanisami, Nallasamy; He, Ke; Moon, Il Shik [Sunchon National University, Suncheon (Korea, Republic of)
2014-01-15
Membrane distillation (MD), a non-isothermal membrane separation process, is based on the phenomenon that pure water in its vapor state can be extracted from aqueous solutions by passing vapor through a hydrophobic microporous membrane when a temperature difference is established across it. We used three commercially available hydrophobic microporous membranes (C02, C07 and C12; based on the pore size 0.2, 0.7 and 1.2 µm respectively) for desalination via direct contact MD (DCMD). The effects of operating parameters on permeation flux were studied. In addition, the desalination of seawater by solar assisted DCMD process was experimentally investigated. First, using solar power only short-term (one day), successful desalination of real seawater was achieved without temperature control under the following conditions: feed inlet temperature 65.0 .deg. C, permeate inlet temperature 25.0 .deg. C, and a flow rate of 2.5 L/min. The developed system also worked well in the long-term (150 days) for seawater desalination using both solar and electric power. Long-term test flux was reduced from 28.48 to only 26.50 L/m{sup 2}hr, indicating system feasibility.
Deleurence, Rémi; Parneix, Caroline; Monteux, Cécile
2014-09-28
We investigate the stabilization of air-water interfaces by mixtures of negatively charged latex particles (sulfate polystyrene) and cationic surfactants (alkyl trimethylammonium bromides). First we report results concerning the binding of surfactant molecules to the latex particles. As the surfactant concentration increases, the charge of the particles reverses, from negative to positive, because CnTAB first binds electrostatically to the latex particles and then through hydrophobic interaction with the monolayer already adsorbed on the particles as well as directly with the hydrophobic surface of the latex. Over a large range of surfactant concentrations around the charge inversion, a strong flocculation is observed and 100 μm large aggregates form in the suspension. Unlike previous studies published on mixtures of inorganic particles with oppositely charged surfactants, we show that we can vary the sign of the zeta potential of the particles without changing the contact angle of the particles over a large range of surfactant concentrations. Indeed, the latex particles that we study are more hydrophobic than inorganic particles, hence adding moderate concentrations of the surfactant results in a weak variation of the contact angle while the charge of the particles can be reversed. This enables decoupling of the effect of zeta potential and contact angle on the interfacial properties of the mixtures. Our study shows that the contact angle and the charge of the particles are not sufficient parameters to control the foam properties, and the key-parameters are the flocculation state and the shear energy applied to produce the foam. Indeed, flocculated samples, whatever the sign of the zeta potential, enable production of a stable armour at the interface. The large aggregates do not adsorb spontaneously at the interface because of their large size, however when a large shear energy is used to produce the foam very stable foam is obtained, where particles are trapped
: (505) 665-3664 ethics@lanl.gov Journalist queries Communications Office (505) 667-7000 Media contacts programs and employee resources. General Employee directory Emergency communication Communications Office (505) 667-7000 Ethics & Audits Internal Audit: (505) 665-3104 Ethics Office: (505) 667-7506 Fax
Construction and decoding of a class of algebraic geometry codes
DEFF Research Database (Denmark)
Justesen, Jørn; Larsen, Knud J.; Jensen, Helge Elbrønd
1989-01-01
A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result is a decod...... is a decoding algorithm which turns out to be a generalization of the Peterson algorithm for decoding BCH decoder codes......A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result...
Toward a universal decoder of linguistic meaning from brain activation.
Pereira, Francisco; Lou, Bin; Pritchett, Brianna; Ritter, Samuel; Gershman, Samuel J; Kanwisher, Nancy; Botvinick, Matthew; Fedorenko, Evelina
2018-03-06
Prior work decoding linguistic meaning from imaging data has been largely limited to concrete nouns, using similar stimuli for training and testing, from a relatively small number of semantic categories. Here we present a new approach for building a brain decoding system in which words and sentences are represented as vectors in a semantic space constructed from massive text corpora. By efficiently sampling this space to select training stimuli shown to subjects, we maximize the ability to generalize to new meanings from limited imaging data. To validate this approach, we train the system on imaging data of individual concepts, and show it can decode semantic vector representations from imaging data of sentences about a wide variety of both concrete and abstract topics from two separate datasets. These decoded representations are sufficiently detailed to distinguish even semantically similar sentences, and to capture the similarity structure of meaning relationships between sentences.
Illustrative examples in a bilingual decoding dictionary: An (un ...
African Journals Online (AJOL)
Keywords: Illustrative Examples, Bilingual Decoding Dictionary, Semantic Differences Between Source Language (Sl) And Target Language (Tl), Grammatical Differences Between Sl And Tl, Translation Of Examples, Transposition, Context-Dependent Translation, One-Word Equivalent, Zero Equivalent, Idiomatic ...
Decoding Reed-Solomon Codes beyond half the minimum distance
DEFF Research Database (Denmark)
Høholdt, Tom; Nielsen, Rasmus Refslund
1999-01-01
We describe an efficient implementation of M.Sudan"s algorithm for decoding Reed-Solomon codes beyond half the minimum distance. Furthermore we calculate an upper bound of the probabilty of getting more than one codeword as output...
An overview of turbo decoding on fading channels
ATILGAN, Doğan
2009-01-01
A review of turbo coding and decoding has been presented in the literature [1]. In that paper, turbo coding and decoding on AWGN (Additive White Gaussian Noise) channels has been elaborated. In wireless communications, a phenomennon called multipath fading is frequently encountered. Therefore, investigation of efficient techniques to tackle with the destructive effects of fading is essential. Turbo coding has been proven as an efficient channel coding technique for AWGN channels. Some of the ...
Performance Analysis of a Decoding Algorithm for Algebraic Geometry Codes
DEFF Research Database (Denmark)
Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund; Høholdt, Tom
1998-01-01
We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance......We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance...
Recent results in the decoding of Algebraic geometry codes
DEFF Research Database (Denmark)
Høholdt, Tom; Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund
1998-01-01
We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is [(dFR-1)/2]+1, where dFR is the Feng-Rao distance......We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is [(dFR-1)/2]+1, where dFR is the Feng-Rao distance...
Effect of video decoder errors on video interpretability
Young, Darrell L.
2014-06-01
The advancement in video compression technology can result in more sensitivity to bit errors. Bit errors can propagate causing sustained loss of interpretability. In the worst case, the decoder "freezes" until it can re-synchronize with the stream. Detection of artifacts enables downstream processes to avoid corrupted frames. A simple template approach to detect block stripes and a more advanced cascade approach to detect compression artifacts was shown to correlate to the presence of artifacts and decoder messages.
Electrophysiological difference between mental state decoding and mental state reasoning.
Cao, Bihua; Li, Yiyuan; Li, Fuhong; Li, Hong
2012-06-29
Previous studies have explored the neural mechanism of Theory of Mind (ToM), but the neural correlates of its two components, mental state decoding and mental state reasoning, remain unclear. In the present study, participants were presented with various photographs, showing an actor looking at 1 of 2 objects, either with a happy or an unhappy expression. They were asked to either decode the emotion of the actor (mental state decoding task), predict which object would be chosen by the actor (mental state reasoning task), or judge at which object the actor was gazing (physical task), while scalp potentials were recorded. Results showed that (1) the reasoning task elicited an earlier N2 peak than the decoding task did over the prefrontal scalp sites; and (2) during the late positive component (240-440 ms), the reasoning task elicited a more positive deflection than the other two tasks did at the prefrontal scalp sites. In addition, neither the decoding task nor the reasoning task has no left/right hemisphere difference. These findings imply that mental state reasoning differs from mental state decoding early (210 ms) after stimulus onset, and that the prefrontal lobe is the neural basis of mental state reasoning. Copyright © 2012 Elsevier B.V. All rights reserved.
Evaluation framework for K-best sphere decoders
Shen, Chungan
2010-08-01
While Maximum-Likelihood (ML) is the optimum decoding scheme for most communication scenarios, practical implementation difficulties limit its use, especially for Multiple Input Multiple Output (MIMO) systems with a large number of transmit or receive antennas. Tree-searching type decoder structures such as Sphere decoder and K-best decoder present an interesting trade-off between complexity and performance. Many algorithmic developments and VLSI implementations have been reported in literature with widely varying performance to area and power metrics. In this semi-tutorial paper we present a holistic view of different Sphere decoding techniques and K-best decoding techniques, identifying the key algorithmic and implementation trade-offs. We establish a consistent benchmark framework to investigate and compare the delay cost, power cost, and power-delay-product cost incurred by each method. Finally, using the framework, we propose and analyze a novel architecture and compare that to other published approaches. Our goal is to explicitly elucidate the overall advantages and disadvantages of each proposed algorithms in one coherent framework. © 2010 World Scientific Publishing Company.
Partially blind instantly decodable network codes for lossy feedback environment
Sorour, Sameh
2014-09-01
In this paper, we study the multicast completion and decoding delay minimization problems for instantly decodable network coding (IDNC) in the case of lossy feedback. When feedback loss events occur, the sender falls into uncertainties about packet reception at the different receivers, which forces it to perform partially blind selections of packet combinations in subsequent transmissions. To determine efficient selection policies that reduce the completion and decoding delays of IDNC in such an environment, we first extend the perfect feedback formulation in our previous works to the lossy feedback environment, by incorporating the uncertainties resulting from unheard feedback events in these formulations. For the completion delay problem, we use this formulation to identify the maximum likelihood state of the network in events of unheard feedback and employ it to design a partially blind graph update extension to the multicast IDNC algorithm in our earlier work. For the decoding delay problem, we derive an expression for the expected decoding delay increment for any arbitrary transmission. This expression is then used to find the optimal policy that reduces the decoding delay in such lossy feedback environment. Results show that our proposed solutions both outperform previously proposed approaches and achieve tolerable degradation even at relatively high feedback loss rates.
Lei, Ted Chih-Wei; Tseng, Fan-Shuo
2017-07-01
This paper addresses the problem of high-computational complexity decoding in traditional Wyner-Ziv video coding (WZVC). The key focus is the migration of two traditionally high-computationally complex encoder algorithms, namely motion estimation and mode decision. In order to reduce the computational burden in this process, the proposed architecture adopts the partial boundary matching algorithm and four flexible types of block mode decision at the decoder. This approach does away with the need for motion estimation and mode decision at the encoder. The experimental results show that the proposed padding block-based WZVC not only decreases decoder complexity to approximately one hundredth that of the state-of-the-art DISCOVER decoding but also outperforms DISCOVER codec by up to 3 to 4 dB.
A practical depth-of-interaction PET/MR detector with dichotomous-orthogonal-symmetry decoding
International Nuclear Information System (INIS)
Zhang, Yuxuan; Baghaei, Hossain; Yan, Han; Wong, Wai-Hoi
2015-01-01
Conventional dual-end depth-of-interaction (DOI) PET detector readout requires two 2D SiPM arrays; with top and bottom SiPM reading the same pixel, there is information redundancy. We proposed a dichotomous-orthogonal-symmetric (DOS) dual-end DOI readout to eliminate this redundancy to significantly reduce SiPM usage, electronic channels, and heat load. Reflecting films are used within the scintillator array to channel light exiting the top along the X-direction, while light exiting the bottom is channeled along the orthogonal Y-direction. Despite the unidirectional channeling on each end, the top readout can provide X-Y information using two 1-D SiPM arrays; similarly, the bottom readout also provides X-Y information with two 1-D SiPM arrays. Thus four 1-D SiPM arrays (4xN) are used to decode XYZ to replace two 2D SiPM arrays (2NxN); SiPM usage is reduced from 2N**2 to 4N. Monte Carlo simulations (GATE) were carried out to study the XY decoding accuracy, energy resolution, and DOI resolution. Coupling the DOS-DOI design with a channel-decoding scheme, an array of 15x15 LSO (2.4x2.4x20 mm pixels) can be decoded by 18 SiPMs (2 rows of nine 3x3mm SiPM) on top and 18 SiPMs at bottom, thus achieving a 10X reduction in SiPM usage, electronic channels and heat load. For BGO detectors, an 8x8 array (2.4x2.4x20 mm pixels) can be achieved with 6.4X reduction. Simulations show 5-6mm DOI resolution, 0.45-0.96mm XY decoding blurring, 20-24% energy resolution. This study shows the feasibility of the DOS-DOI design. Even comparing to non-DOI detectors, there is a 5X/3X SiPM reduction for LSO/BGO. The proposed detector may yield practical ultrahigh-resolution PET/MR systems with depth-of-interaction with a production cost below current non-DOI systems.
Lee, Jinkyu; Song, Yongnam; Shin, Choongsoo S
2018-05-01
During landing, the ankle angle at initial contact (IC) exhibits relatively wide individual variation compared to the knee and hip angles. However, little is known about the effect of different IC ankle angles on energy dissipation. The purpose of this study was to investigate the relationship between individual ankle angles at IC and energy dissipation in the lower extremity joints. Twenty-seven adults performed single-leg landings from a 0.3-m height. Kinetics and kinematics of the lower extremity joints were measured. The relationship between ankle angles at IC and negative work, range of motion, the time to peak ground reaction force, and peak loading rate were analyzed. The ankle angle at IC was positively correlated with ankle negative work (r = 0.80, R 2 = 0.64, p angle was negatively correlated with hip negative work (r = -0.46, R 2 = 0.21, p = 0.01) and the contribution of the hip to total negative work (r = -0.61, R 2 = 0.37, p angle at IC. The ankle angle at IC was positively correlated with total negative work (r = 0.50, R 2 = 0.25, p angle at IC increased, such that the ankle energy dissipation increased and redistributed the energy dissipation in the ankle and hip joints. Further, these results suggest that increased ankle energy dissipation with a higher IC plantar flexion angle may be a potential landing technique for reducing the risk of injury to the anterior cruciate ligament and hip musculature. Copyright © 2018 Elsevier B.V. All rights reserved.
Singer product apertures—A coded aperture system with a fast decoding algorithm
International Nuclear Information System (INIS)
Byard, Kevin; Shutler, Paul M.E.
2017-01-01
A new type of coded aperture configuration that enables fast decoding of the coded aperture shadowgram data is presented. Based on the products of incidence vectors generated from the Singer difference sets, we call these Singer product apertures. For a range of aperture dimensions, we compare experimentally the performance of three decoding methods: standard decoding, induction decoding and direct vector decoding. In all cases the induction and direct vector methods are several orders of magnitude faster than the standard method, with direct vector decoding being significantly faster than induction decoding. For apertures of the same dimensions the increase in speed offered by direct vector decoding over induction decoding is better for lower throughput apertures.
An FPGA Implementation of (3,6-Regular Low-Density Parity-Check Code Decoder
Directory of Open Access Journals (Sweden)
Tong Zhang
2003-05-01
Full Text Available Because of their excellent error-correcting performance, low-density parity-check (LDPC codes have recently attracted a lot of attention. In this paper, we are interested in the practical LDPC code decoder hardware implementations. The direct fully parallel decoder implementation usually incurs too high hardware complexity for many real applications, thus partly parallel decoder design approaches that can achieve appropriate trade-offs between hardware complexity and decoding throughput are highly desirable. Applying a joint code and decoder design methodology, we develop a high-speed (3,k-regular LDPC code partly parallel decoder architecture based on which we implement a 9216-bit, rate-1/2(3,6-regular LDPC code decoder on Xilinx FPGA device. This partly parallel decoder supports a maximum symbol throughput of 54 Mbps and achieves BER 10Ã¢ÂˆÂ’6 at 2 dB over AWGN channel while performing maximum 18 decoding iterations.
Singer product apertures—A coded aperture system with a fast decoding algorithm
Energy Technology Data Exchange (ETDEWEB)
Byard, Kevin, E-mail: kevin.byard@aut.ac.nz [School of Economics, Faculty of Business, Economics and Law, Auckland University of Technology, Auckland 1142 (New Zealand); Shutler, Paul M.E. [National Institute of Education, Nanyang Technological University, 1 Nanyang Walk, Singapore 637616 (Singapore)
2017-06-01
A new type of coded aperture configuration that enables fast decoding of the coded aperture shadowgram data is presented. Based on the products of incidence vectors generated from the Singer difference sets, we call these Singer product apertures. For a range of aperture dimensions, we compare experimentally the performance of three decoding methods: standard decoding, induction decoding and direct vector decoding. In all cases the induction and direct vector methods are several orders of magnitude faster than the standard method, with direct vector decoding being significantly faster than induction decoding. For apertures of the same dimensions the increase in speed offered by direct vector decoding over induction decoding is better for lower throughput apertures.
Guerrero, Antonio; Marchesi, Luís F; Boix, Pablo P; Ruiz-Raga, Sonia; Ripolles-Sanchis, Teresa; Garcia-Belmonte, Germà; Bisquert, Juan
2012-04-24
Electronic equilibration at the metal-organic interface, leading to equalization of the Fermi levels, is a key process in organic optoelectronic devices. How the energy levels are set across the interface determines carrier extraction at the contact and also limits the achievable open-circuit voltage under illumination. Here, we report an extensive investigation of the cathode energy equilibration of organic bulk-heterojunction solar cells. We show that the potential to balance the mismatch between the cathode metal and the organic layer Fermi levels is divided into two contributions: spatially extended band bending in the organic bulk and voltage drop at the interface dipole layer caused by a net charge transfer. We scan the operation of the cathode under a varied set of conditions, using metals of different work functions in the range of ∼2 eV, different fullerene acceptors, and several cathode interlayers. The measurements allow us to locate the charge-neutrality level within the interface density of sates and calculate the corresponding dipole layer strength. The dipole layer withstands a large part of the total Fermi level mismatch when the polymer:fullerene blend ratio approaches ∼1:1, producing the practical alignment between the metal Fermi level and the charge-neutrality level. Origin of the interface states is linked with fullerene reduced molecules covering the metal contact. The dipole contribution, and consequently the band bending, is highly sensitive to the nature and amount of fullerene molecules forming the interface density of states. Our analysis provides a detailed picture of the evolution of the potentials in the bulk and the interface of the solar cell when forward voltage is applied or when photogeneration takes place.
Statistical coding and decoding of heartbeat intervals.
Lucena, Fausto; Barros, Allan Kardec; Príncipe, José C; Ohnishi, Noboru
2011-01-01
The heart integrates neuroregulatory messages into specific bands of frequency, such that the overall amplitude spectrum of the cardiac output reflects the variations of the autonomic nervous system. This modulatory mechanism seems to be well adjusted to the unpredictability of the cardiac demand, maintaining a proper cardiac regulation. A longstanding theory holds that biological organisms facing an ever-changing environment are likely to evolve adaptive mechanisms to extract essential features in order to adjust their behavior. The key question, however, has been to understand how the neural circuitry self-organizes these feature detectors to select behaviorally relevant information. Previous studies in computational perception suggest that a neural population enhances information that is important for survival by minimizing the statistical redundancy of the stimuli. Herein we investigate whether the cardiac system makes use of a redundancy reduction strategy to regulate the cardiac rhythm. Based on a network of neural filters optimized to code heartbeat intervals, we learn a population code that maximizes the information across the neural ensemble. The emerging population code displays filter tuning proprieties whose characteristics explain diverse aspects of the autonomic cardiac regulation, such as the compromise between fast and slow cardiac responses. We show that the filters yield responses that are quantitatively similar to observed heart rate responses during direct sympathetic or parasympathetic nerve stimulation. Our findings suggest that the heart decodes autonomic stimuli according to information theory principles analogous to how perceptual cues are encoded by sensory systems.
Rate Aware Instantly Decodable Network Codes
Douik, Ahmed
2016-02-26
This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. Further, the paper provides a multi-layer solution to improve the completion time approximation. Simulation results suggest that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme. © 2015 IEEE.
Encoding and decoding messages with chaotic lasers
International Nuclear Information System (INIS)
Alsing, P.M.; Gavrielides, A.; Kovanis, V.; Roy, R.; Thornburg, K.S. Jr.
1997-01-01
We investigate the structure of the strange attractor of a chaotic loss-modulated solid-state laser utilizing return maps based on a combination of intensity maxima and interspike intervals, as opposed to those utilizing Poincare sections defined by the intensity maxima of the laser (I=0,Ie<0) alone. We find both experimentally and numerically that a simple, intrinsic relationship exists between an intensity maximum and the pair of preceding and succeeding interspike intervals. In addition, we numerically investigate encoding messages on the output of a chaotic transmitter laser and its subsequent decoding by a similar receiver laser. By exploiting the relationship between the intensity maxima and the interspike intervals, we demonstrate that the method utilized to encode the message is vital to the system close-quote s ability to hide the signal from unwanted deciphering. In this work alternative methods are studied in order to encode messages by modulating the magnitude of pumping of the transmitter laser and also by driving its loss modulation with more than one frequency. copyright 1997 The American Physical Society
Fast mental states decoding in mixed reality.
Directory of Open Access Journals (Sweden)
Daniele eDe Massari
2014-11-01
Full Text Available The combination of Brain-Computer Interface technology, allowing online monitoring and decoding of brain activity, with virtual and mixed reality systems may help to shape and guide implicit and explicit learning using ecological scenarios. Real-time information of ongoing brain states acquired through BCI might be exploited for controlling data presentation in virtual environments. In this context, assessing to what extent brain states can be discriminated during mixed reality experience is critical for adapting specific data features to contingent brain activity. In this study we recorded EEG data while participants experienced a mixed reality scenario implemented through the eXperience Induction Machine (XIM. The XIM is a novel framework modeling the integration of a sensing system that evaluates and measures physiological and psychological states with a number of actuators and effectors that coherently reacts to the user's actions. We then assessed continuous EEG-based discrimination of spatial navigation, reading and calculation performed in mixed reality, using LDA and SVM classifiers. Dynamic single trial classification showed high accuracy of LDA and SVM classifiers in detecting multiple brain states as well as in differentiating between high and low mental workload, using a 5 s time-window shifting every 200 ms. Our results indicate overall better performance of LDA with respect to SVM and suggest applicability of our approach in a BCI-controlled mixed reality scenario. Ultimately, successful prediction of brain states might be used to drive adaptation of data representation in order to boost information processing in mixed reality.
Decoding P4-ATPase substrate interactions.
Roland, Bartholomew P; Graham, Todd R
Cellular membranes display a diversity of functions that are conferred by the unique composition and organization of their proteins and lipids. One important aspect of lipid organization is the asymmetric distribution of phospholipids (PLs) across the plasma membrane. The unequal distribution of key PLs between the cytofacial and exofacial leaflets of the bilayer creates physical surface tension that can be used to bend the membrane; and like Ca 2+ , a chemical gradient that can be used to transduce biochemical signals. PL flippases in the type IV P-type ATPase (P4-ATPase) family are the principle transporters used to set and repair this PL gradient and the asymmetric organization of these membranes are encoded by the substrate specificity of these enzymes. Thus, understanding the mechanisms of P4-ATPase substrate specificity will help reveal their role in membrane organization and cell biology. Further, decoding the structural determinants of substrate specificity provides investigators the opportunity to mutationally tune this specificity to explore the role of particular PL substrates in P4-ATPase cellular functions. This work reviews the role of P4-ATPases in membrane biology, presents our current understanding of P4-ATPase substrate specificity, and discusses how these fundamental aspects of P4-ATPase enzymology may be used to enhance our knowledge of cellular membrane biology.
Fast mental states decoding in mixed reality.
De Massari, Daniele; Pacheco, Daniel; Malekshahi, Rahim; Betella, Alberto; Verschure, Paul F M J; Birbaumer, Niels; Caria, Andrea
2014-01-01
The combination of Brain-Computer Interface (BCI) technology, allowing online monitoring and decoding of brain activity, with virtual and mixed reality (MR) systems may help to shape and guide implicit and explicit learning using ecological scenarios. Real-time information of ongoing brain states acquired through BCI might be exploited for controlling data presentation in virtual environments. Brain states discrimination during mixed reality experience is thus critical for adapting specific data features to contingent brain activity. In this study we recorded electroencephalographic (EEG) data while participants experienced MR scenarios implemented through the eXperience Induction Machine (XIM). The XIM is a novel framework modeling the integration of a sensing system that evaluates and measures physiological and psychological states with a number of actuators and effectors that coherently reacts to the user's actions. We then assessed continuous EEG-based discrimination of spatial navigation, reading and calculation performed in MR, using linear discriminant analysis (LDA) and support vector machine (SVM) classifiers. Dynamic single trial classification showed high accuracy of LDA and SVM classifiers in detecting multiple brain states as well as in differentiating between high and low mental workload, using a 5 s time-window shifting every 200 ms. Our results indicate overall better performance of LDA with respect to SVM and suggest applicability of our approach in a BCI-controlled MR scenario. Ultimately, successful prediction of brain states might be used to drive adaptation of data representation in order to boost information processing in MR.
Observing human movements helps decoding environmental forces.
Zago, Myrka; La Scaleia, Barbara; Miller, William L; Lacquaniti, Francesco
2011-11-01
Vision of human actions can affect several features of visual motion processing, as well as the motor responses of the observer. Here, we tested the hypothesis that action observation helps decoding environmental forces during the interception of a decelerating target within a brief time window, a task intrinsically very difficult. We employed a factorial design to evaluate the effects of scene orientation (normal or inverted) and target gravity (normal or inverted). Button-press triggered the motion of a bullet, a piston, or a human arm. We found that the timing errors were smaller for upright scenes irrespective of gravity direction in the Bullet group, while the errors were smaller for the standard condition of normal scene and gravity in the Piston group. In the Arm group, instead, performance was better when the directions of scene and target gravity were concordant, irrespective of whether both were upright or inverted. These results suggest that the default viewer-centered reference frame is used with inanimate scenes, such as those of the Bullet and Piston protocols. Instead, the presence of biological movements in animate scenes (as in the Arm protocol) may help processing target kinematics under the ecological conditions of coherence between scene and target gravity directions.
Rate Aware Instantly Decodable Network Codes
Douik, Ahmed; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim
2016-01-01
This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. Further, the paper provides a multi-layer solution to improve the completion time approximation. Simulation results suggest that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme. © 2015 IEEE.
Statistical coding and decoding of heartbeat intervals.
Directory of Open Access Journals (Sweden)
Fausto Lucena
Full Text Available The heart integrates neuroregulatory messages into specific bands of frequency, such that the overall amplitude spectrum of the cardiac output reflects the variations of the autonomic nervous system. This modulatory mechanism seems to be well adjusted to the unpredictability of the cardiac demand, maintaining a proper cardiac regulation. A longstanding theory holds that biological organisms facing an ever-changing environment are likely to evolve adaptive mechanisms to extract essential features in order to adjust their behavior. The key question, however, has been to understand how the neural circuitry self-organizes these feature detectors to select behaviorally relevant information. Previous studies in computational perception suggest that a neural population enhances information that is important for survival by minimizing the statistical redundancy of the stimuli. Herein we investigate whether the cardiac system makes use of a redundancy reduction strategy to regulate the cardiac rhythm. Based on a network of neural filters optimized to code heartbeat intervals, we learn a population code that maximizes the information across the neural ensemble. The emerging population code displays filter tuning proprieties whose characteristics explain diverse aspects of the autonomic cardiac regulation, such as the compromise between fast and slow cardiac responses. We show that the filters yield responses that are quantitatively similar to observed heart rate responses during direct sympathetic or parasympathetic nerve stimulation. Our findings suggest that the heart decodes autonomic stimuli according to information theory principles analogous to how perceptual cues are encoded by sensory systems.
A real-time MPEG software decoder using a portable message-passing library
Energy Technology Data Exchange (ETDEWEB)
Kwong, Man Kam; Tang, P.T. Peter; Lin, Biquan
1995-12-31
We present a real-time MPEG software decoder that uses message-passing libraries such as MPL, p4 and MPI. The parallel MPEG decoder currently runs on the IBM SP system but can be easil ported to other parallel machines. This paper discusses our parallel MPEG decoding algorithm as well as the parallel programming environment under which it uses. Several technical issues are discussed, including balancing of decoding speed, memory limitation, 1/0 capacities, and optimization of MPEG decoding components. This project shows that a real-time portable software MPEG decoder is feasible in a general-purpose parallel machine.
Decoding of finger trajectory from ECoG using deep learning
Xie, Ziqian; Schwartz, Odelia; Prasad, Abhishek
2018-06-01
Objective. Conventional decoding pipeline for brain-machine interfaces (BMIs) consists of chained different stages of feature extraction, time-frequency analysis and statistical learning models. Each of these stages uses a different algorithm trained in a sequential manner, which makes it difficult to make the whole system adaptive. The goal was to create an adaptive online system with a single objective function and a single learning algorithm so that the whole system can be trained in parallel to increase the decoding performance. Here, we used deep neural networks consisting of convolutional neural networks (CNN) and a special kind of recurrent neural network (RNN) called long short term memory (LSTM) to address these needs. Approach. We used electrocorticography (ECoG) data collected by Kubanek et al. The task consisted of individual finger flexions upon a visual cue. Our model combined a hierarchical feature extractor CNN and a RNN that was able to process sequential data and recognize temporal dynamics in the neural data. CNN was used as the feature extractor and LSTM was used as the regression algorithm to capture the temporal dynamics of the signal. Main results. We predicted the finger trajectory using ECoG signals and compared results for the least angle regression (LARS), CNN-LSTM, random forest, LSTM model (LSTM_HC, for using hard-coded features) and a decoding pipeline consisting of band-pass filtering, energy extraction, feature selection and linear regression. The results showed that the deep learning models performed better than the commonly used linear model. The deep learning models not only gave smoother and more realistic trajectories but also learned the transition between movement and rest state. Significance. This study demonstrated a decoding network for BMI that involved a convolutional and recurrent neural network model. It integrated the feature extraction pipeline into the convolution and pooling layer and used LSTM layer to capture the
AbuHannoud, Ali
2011-07-01
Water is becoming scarcer and several authors have highlighted the upcoming problem of higher water salinity and the difficulty of treating and discharging water. Moreover, current discoveries of problems with chemicals that have been used for pretreating or post-treating water alerted scientists to research better solutions to treat water. Membrane distillation (MD) is a promising technology that might replace current processes as it has lower pretreatment requirements combined with a tremendous ability to treat a wide range of feed sources while producing very high product quality. If it enters the market, it will have a big influence on all products, from food industry to spaceflight. However, there are several problems which make MD a hot topic for research. One of them is the question about the real cost of MD in terms of heating feed and cooling distillate over time with respect to product quantity and quality. In this work, extensive heating and cooling analyses are covered to answer this question in order to enhance the MD process. Results show energy cost to produce water and the main source of energy loss for direct contact membrane distillation (DCMD), and several suggestions are made in order to better understand and hence enhance the process.
Prioritized Contact Transport Stream
Hunt, Walter Lee, Jr. (Inventor)
2015-01-01
A detection process, contact recognition process, classification process, and identification process are applied to raw sensor data to produce an identified contact record set containing one or more identified contact records. A prioritization process is applied to the identified contact record set to assign a contact priority to each contact record in the identified contact record set. Data are removed from the contact records in the identified contact record set based on the contact priorities assigned to those contact records. A first contact stream is produced from the resulting contact records. The first contact stream is streamed in a contact transport stream. The contact transport stream may include and stream additional contact streams. The contact transport stream may be varied dynamically over time based on parameters such as available bandwidth, contact priority, presence/absence of contacts, system state, and configuration parameters.
Mapping visual stimuli to perceptual decisions via sparse decoding of mesoscopic neural activity.
Sajda, Paul
2010-01-01
In this talk I will describe our work investigating sparse decoding of neural activity, given a realistic mapping of the visual scene to neuronal spike trains generated by a model of primary visual cortex (V1). We use a linear decoder which imposes sparsity via an L1 norm. The decoder can be viewed as a decoding neuron (linear summation followed by a sigmoidal nonlinearity) in which there are relatively few non-zero synaptic weights. We find: (1) the best decoding performance is for a representation that is sparse in both space and time, (2) decoding of a temporal code results in better performance than a rate code and is also a better fit to the psychophysical data, (3) the number of neurons required for decoding increases monotonically as signal-to-noise in the stimulus decreases, with as little as 1% of the neurons required for decoding at the highest signal-to-noise levels, and (4) sparse decoding results in a more accurate decoding of the stimulus and is a better fit to psychophysical performance than a distributed decoding, for example one imposed by an L2 norm. We conclude that sparse coding is well-justified from a decoding perspective in that it results in a minimum number of neurons and maximum accuracy when sparse representations can be decoded from the neural dynamics.
Robust pattern decoding in shape-coded structured light
Tang, Suming; Zhang, Xu; Song, Zhan; Song, Lifang; Zeng, Hai
2017-09-01
Decoding is a challenging and complex problem in a coded structured light system. In this paper, a robust pattern decoding method is proposed for the shape-coded structured light in which the pattern is designed as grid shape with embedded geometrical shapes. In our decoding method, advancements are made at three steps. First, a multi-template feature detection algorithm is introduced to detect the feature point which is the intersection of each two orthogonal grid-lines. Second, pattern element identification is modelled as a supervised classification problem and the deep neural network technique is applied for the accurate classification of pattern elements. Before that, a training dataset is established, which contains a mass of pattern elements with various blurring and distortions. Third, an error correction mechanism based on epipolar constraint, coplanarity constraint and topological constraint is presented to reduce the false matches. In the experiments, several complex objects including human hand are chosen to test the accuracy and robustness of the proposed method. The experimental results show that our decoding method not only has high decoding accuracy, but also owns strong robustness to surface color and complex textures.
Optimal and efficient decoding of concatenated quantum block codes
International Nuclear Information System (INIS)
Poulin, David
2006-01-01
We consider the problem of optimally decoding a quantum error correction code--that is, to find the optimal recovery procedure given the outcomes of partial ''check'' measurements on the system. In general, this problem is NP hard. However, we demonstrate that for concatenated block codes, the optimal decoding can be efficiently computed using a message-passing algorithm. We compare the performance of the message-passing algorithm to that of the widespread blockwise hard decoding technique. Our Monte Carlo results using the five-qubit and Steane's code on a depolarizing channel demonstrate significant advantages of the message-passing algorithms in two respects: (i) Optimal decoding increases by as much as 94% the error threshold below which the error correction procedure can be used to reliably send information over a noisy channel; and (ii) for noise levels below these thresholds, the probability of error after optimal decoding is suppressed at a significantly higher rate, leading to a substantial reduction of the error correction overhead
Distributed coding/decoding complexity in video sensor networks.
Cordeiro, Paulo J; Assunção, Pedro
2012-01-01
Video Sensor Networks (VSNs) are recent communication infrastructures used to capture and transmit dense visual information from an application context. In such large scale environments which include video coding, transmission and display/storage, there are several open problems to overcome in practical implementations. This paper addresses the most relevant challenges posed by VSNs, namely stringent bandwidth usage and processing time/power constraints. In particular, the paper proposes a novel VSN architecture where large sets of visual sensors with embedded processors are used for compression and transmission of coded streams to gateways, which in turn transrate the incoming streams and adapt them to the variable complexity requirements of both the sensor encoders and end-user decoder terminals. Such gateways provide real-time transcoding functionalities for bandwidth adaptation and coding/decoding complexity distribution by transferring the most complex video encoding/decoding tasks to the transcoding gateway at the expense of a limited increase in bit rate. Then, a method to reduce the decoding complexity, suitable for system-on-chip implementation, is proposed to operate at the transcoding gateway whenever decoders with constrained resources are targeted. The results show that the proposed method achieves good performance and its inclusion into the VSN infrastructure provides an additional level of complexity control functionality.
Contact angle and local wetting at contact line.
Li, Ri; Shan, Yanguang
2012-11-06
This theoretical study was motivated by recent experiments and theoretical work that had suggested the dependence of the static contact angle on the local wetting at the triple-phase contact line. We revisit this topic because the static contact angle as a local wetting parameter is still not widely understood and clearly known. To further clarify the relationship of the static contact angle with wetting, two approaches are applied to derive a general equation for the static contact angle of a droplet on a composite surface composed of heterogeneous components. A global approach based on the free surface energy of a thermodynamic system containing the droplet and solid surface shows the static contact angle as a function of local surface chemistry and local wetting state at the contact line. A local approach, in which only local forces acting on the contact line are considered, results in the same equation. The fact that the local approach agrees with the global approach further demonstrates the static contact angle as a local wetting parameter. Additionally, the study also suggests that the wetting described by the Wenzel and Cassie equations is also the local wetting of the contact line rather than the global wetting of the droplet.
Equilibrium contact angle or the most-stable contact angle?
Montes Ruiz-Cabello, F J; Rodríguez-Valverde, M A; Cabrerizo-Vílchez, M A
2014-04-01
It is well-established that the equilibrium contact angle in a thermodynamic framework is an "unattainable" contact angle. Instead, the most-stable contact angle obtained from mechanical stimuli of the system is indeed experimentally accessible. Monitoring the susceptibility of a sessile drop to a mechanical stimulus enables to identify the most stable drop configuration within the practical range of contact angle hysteresis. Two different stimuli may be used with sessile drops: mechanical vibration and tilting. The most stable drop against vibration should reveal the changeless contact angle but against the gravity force, it should reveal the highest resistance to slide down. After the corresponding mechanical stimulus, once the excited drop configuration is examined, the focus will be on the contact angle of the initial drop configuration. This methodology needs to map significantly the static drop configurations with different stable contact angles. The most-stable contact angle, together with the advancing and receding contact angles, completes the description of physically realizable configurations of a solid-liquid system. Since the most-stable contact angle is energetically significant, it may be used in the Wenzel, Cassie or Cassie-Baxter equations accordingly or for the surface energy evaluation. © 2013 Elsevier B.V. All rights reserved.
Lexical decoder for continuous speech recognition: sequential neural network approach
International Nuclear Information System (INIS)
Iooss, Christine
1991-01-01
The work presented in this dissertation concerns the study of a connectionist architecture to treat sequential inputs. In this context, the model proposed by J.L. Elman, a recurrent multilayers network, is used. Its abilities and its limits are evaluated. Modifications are done in order to treat erroneous or noisy sequential inputs and to classify patterns. The application context of this study concerns the realisation of a lexical decoder for analytical multi-speakers continuous speech recognition. Lexical decoding is completed from lattices of phonemes which are obtained after an acoustic-phonetic decoding stage relying on a K Nearest Neighbors search technique. Test are done on sentences formed from a lexicon of 20 words. The results are obtained show the ability of the proposed connectionist model to take into account the sequentiality at the input level, to memorize the context and to treat noisy or erroneous inputs. (author) [fr
Systolic array processing of the sequential decoding algorithm
Chang, C. Y.; Yao, K.
1989-01-01
A systolic array processing technique is applied to implementing the stack algorithm form of the sequential decoding algorithm. It is shown that sorting, a key function in the stack algorithm, can be efficiently realized by a special type of systolic arrays known as systolic priority queues. Compared to the stack-bucket algorithm, this approach is shown to have the advantages that the decoding always moves along the optimal path, that it has a fast and constant decoding speed and that its simple and regular hardware architecture is suitable for VLSI implementation. Three types of systolic priority queues are discussed: random access scheme, shift register scheme and ripple register scheme. The property of the entries stored in the systolic priority queue is also investigated. The results are applicable to many other basic sorting type problems.
Analysis of Minimal LDPC Decoder System on a Chip Implementation
Directory of Open Access Journals (Sweden)
T. Palenik
2015-09-01
Full Text Available This paper presents a practical method of potential replacement of several different Quasi-Cyclic Low-Density Parity-Check (QC-LDPC codes with one, with the intention of saving as much memory as required to implement the LDPC encoder and decoder in a memory-constrained System on a Chip (SoC. The presented method requires only a very small modification of the existing encoder and decoder, making it suitable for utilization in a Software Defined Radio (SDR platform. Besides the analysis of the effects of necessary variable-node value fixation during the Belief Propagation (BP decoding algorithm, practical standard-defined code parameters are scrutinized in order to evaluate the feasibility of the proposed LDPC setup simplification. Finally, the error performance of the modified system structure is evaluated and compared with the original system structure by means of simulation.
Analysis and Design of Binary Message-Passing Decoders
DEFF Research Database (Denmark)
Lechner, Gottfried; Pedersen, Troels; Kramer, Gerhard
2012-01-01
Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the L-value domain. A hard decision channel results...... message-passing decoders. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived....... in the well-know Gallager B algorithm, and increasing the output alphabet from hard decisions to two bits yields a gain of more than 1.0 dB in the required signal to noise ratio when using optimized codes. The code optimization requires adapting the mixing property of EXIT functions to the case of binary...
Error-correction coding and decoding bounds, codes, decoders, analysis and applications
Tomlinson, Martin; Ambroze, Marcel A; Ahmed, Mohammed; Jibril, Mubarak
2017-01-01
This book discusses both the theory and practical applications of self-correcting data, commonly known as error-correcting codes. The applications included demonstrate the importance of these codes in a wide range of everyday technologies, from smartphones to secure communications and transactions. Written in a readily understandable style, the book presents the authors’ twenty-five years of research organized into five parts: Part I is concerned with the theoretical performance attainable by using error correcting codes to achieve communications efficiency in digital communications systems. Part II explores the construction of error-correcting codes and explains the different families of codes and how they are designed. Techniques are described for producing the very best codes. Part III addresses the analysis of low-density parity-check (LDPC) codes, primarily to calculate their stopping sets and low-weight codeword spectrum which determines the performance of these codes. Part IV deals with decoders desi...
The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions
Reed, I. S.; Scholtz, R. A.; Welch, L. R.; Truong, T. K.
1978-01-01
It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform (FFT) algorithm over finite fields GF(F sub n), where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.
Joint Estimation and Decoding of Space-Time Trellis Codes
Directory of Open Access Journals (Sweden)
Zhang Jianqiu
2002-01-01
Full Text Available We explore the possibility of using an emerging tool in statistical signal processing, sequential importance sampling (SIS, for joint estimation and decoding of space-time trellis codes (STTC. First, we provide background on SIS, and then we discuss its application to space-time trellis code (STTC systems. It is shown through simulations that SIS is suitable for joint estimation and decoding of STTC with time-varying flat-fading channels when phase ambiguity is avoided. We used a design criterion for STTCs and temporally correlated channels that combats phase ambiguity without pilot signaling. We have shown by simulations that the design is valid.
Efficient decoding of random errors for quantum expander codes
Fawzi , Omar; Grospellier , Antoine; Leverrier , Anthony
2017-01-01
We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of Leverrier, Tillich and Z\\'emor can correct a constant fraction of random errors with very high probability. This is the first construction of a constant-rate quantum LDPC code with an efficient decoding algorithm that can correct a linear number of random errors with a negligible failure probability. Finding codes with these properties is also motivated by Gottes...
Min-Max decoding for non binary LDPC codes
Savin, Valentin
2008-01-01
Iterative decoding of non-binary LDPC codes is currently performed using either the Sum-Product or the Min-Sum algorithms or slightly different versions of them. In this paper, several low-complexity quasi-optimal iterative algorithms are proposed for decoding non-binary codes. The Min-Max algorithm is one of them and it has the benefit of two possible LLR domain implementations: a standard implementation, whose complexity scales as the square of the Galois field's cardinality and a reduced c...
Decoding ensemble activity from neurophysiological recordings in the temporal cortex.
Kreiman, Gabriel
2011-01-01
We study subjects with pharmacologically intractable epilepsy who undergo semi-chronic implantation of electrodes for clinical purposes. We record physiological activity from tens to more than one hundred electrodes implanted in different parts of neocortex. These recordings provide higher spatial and temporal resolution than non-invasive measures of human brain activity. Here we discuss our efforts to develop hardware and algorithms to interact with the human brain by decoding ensemble activity in single trials. We focus our discussion on decoding visual information during a variety of visual object recognition tasks but the same technologies and algorithms can also be directly applied to other cognitive phenomena.
Linear-time general decoding algorithm for the surface code
Darmawan, Andrew S.; Poulin, David
2018-05-01
A quantum error correcting protocol can be substantially improved by taking into account features of the physical noise process. We present an efficient decoder for the surface code which can account for general noise features, including coherences and correlations. We demonstrate that the decoder significantly outperforms the conventional matching algorithm on a variety of noise models, including non-Pauli noise and spatially correlated noise. The algorithm is based on an approximate calculation of the logical channel using a tensor-network description of the noisy state.
Decoding sequence learning from single-trial intracranial EEG in humans.
Directory of Open Access Journals (Sweden)
Marzia De Lucia
Full Text Available We propose and validate a multivariate classification algorithm for characterizing changes in human intracranial electroencephalographic data (iEEG after learning motor sequences. The algorithm is based on a Hidden Markov Model (HMM that captures spatio-temporal properties of the iEEG at the level of single trials. Continuous intracranial iEEG was acquired during two sessions (one before and one after a night of sleep in two patients with depth electrodes implanted in several brain areas. They performed a visuomotor sequence (serial reaction time task, SRTT using the fingers of their non-dominant hand. Our results show that the decoding algorithm correctly classified single iEEG trials from the trained sequence as belonging to either the initial training phase (day 1, before sleep or a later consolidated phase (day 2, after sleep, whereas it failed to do so for trials belonging to a control condition (pseudo-random sequence. Accurate single-trial classification was achieved by taking advantage of the distributed pattern of neural activity. However, across all the contacts the hippocampus contributed most significantly to the classification accuracy for both patients, and one fronto-striatal contact for one patient. Together, these human intracranial findings demonstrate that a multivariate decoding approach can detect learning-related changes at the level of single-trial iEEG. Because it allows an unbiased identification of brain sites contributing to a behavioral effect (or experimental condition at the level of single subject, this approach could be usefully applied to assess the neural correlates of other complex cognitive functions in patients implanted with multiple electrodes.
Directory of Open Access Journals (Sweden)
David G. Daut
2007-03-01
Full Text Available A joint source-channel decoding method is designed to accelerate the iterative log-domain sum-product decoding procedure of LDPC codes as well as to improve the reconstructed image quality. Error resilience modes are used in the JPEG2000 source codec making it possible to provide useful source decoded information to the channel decoder. After each iteration, a tentative decoding is made and the channel decoded bits are then sent to the JPEG2000 decoder. The positions of bits belonging to error-free coding passes are then fed back to the channel decoder. The log-likelihood ratios (LLRs of these bits are then modified by a weighting factor for the next iteration. By observing the statistics of the decoding procedure, the weighting factor is designed as a function of the channel condition. Results show that the proposed joint decoding methods can greatly reduce the number of iterations, and thereby reduce the decoding delay considerably. At the same time, this method always outperforms the nonsource controlled decoding method by up to 3 dB in terms of PSNR.
Directory of Open Access Journals (Sweden)
Liu Weiliang
2007-01-01
Full Text Available A joint source-channel decoding method is designed to accelerate the iterative log-domain sum-product decoding procedure of LDPC codes as well as to improve the reconstructed image quality. Error resilience modes are used in the JPEG2000 source codec making it possible to provide useful source decoded information to the channel decoder. After each iteration, a tentative decoding is made and the channel decoded bits are then sent to the JPEG2000 decoder. The positions of bits belonging to error-free coding passes are then fed back to the channel decoder. The log-likelihood ratios (LLRs of these bits are then modified by a weighting factor for the next iteration. By observing the statistics of the decoding procedure, the weighting factor is designed as a function of the channel condition. Results show that the proposed joint decoding methods can greatly reduce the number of iterations, and thereby reduce the decoding delay considerably. At the same time, this method always outperforms the nonsource controlled decoding method by up to 3 dB in terms of PSNR.
Performance-complexity tradeoff in sequential decoding for the unconstrained AWGN channel
Abediseid, Walid; Alouini, Mohamed-Slim
2013-01-01
channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement
Construction and decoding of matrix-product codes from nested codes
DEFF Research Database (Denmark)
Hernando, Fernando; Lally, Kristine; Ruano, Diego
2009-01-01
We consider matrix-product codes [C1 ... Cs] · A, where C1, ..., Cs are nested linear codes and matrix A has full rank. We compute their minimum distance and provide a decoding algorithm when A is a non-singular by columns matrix. The decoding algorithm decodes up to half of the minimum distance....
Adaptive decoding of MPEG-4 sprites for memory-constrained embedded systems
Pastrnak, M.; Farin, D.S.; With, de P.H.N.; Cardinal, J.; Cerf, N.; Delgrnage, O.
2005-01-01
Background sprite decoding is an essential part of object-based video coding.The composition and rendering of a final scene involves the placing of individual video objects in a predefined way superimposed on the decoded background image. The MPEG-4 standard includes the decoding algorithm for
International Nuclear Information System (INIS)
Rong-Hua, Li; Ying-Quan, Peng; Chao-Zhu, Ma; Run-Sheng, Wang; Hong-Wei, Xie; Ying, Wang; Wei-Min, Meng
2010-01-01
We numerically investigate the effects of the exciton generation rate G, temperature T, the active layer thickness d and the position of LUMO level E L related to the cathode work function W c at a given energy gap on the open-circuit voltage V oc of single layer organic solar cells with Schottky contact. It is demonstrated that open-circuit voltage increases concomitantly with the decreasing cathode work function W c for given anode work functions and exciton generation rates. In the case of given cathode and anode work functions, the open-circuit voltage first increases with the exciton generation rate and then reaches a saturation value, which equals to the built-in voltage. Additionally, it is worth noting that a significant improvement to V oc could be made by selecting an organic material which has a relative high LUMO level (low |E L | value). However, V oc decreases as the temperature increases, and the decreasing rate reduces with the enhancement of exciton generation rate. Our study also shows that it is of no benefit to improve the open-circuit voltage by increasing the device thickness because of an enhanced charge recombination in thicker devices. (cross-disciplinary physics and related areas of science and technology)
Pandey, Rahul; Chaujar, Rishu
2017-04-01
A 29.5% efficient perovskite/SiC passivated interdigitated back contact silicon heterojunction (IBC-SiHJ) mechanically stacked tandem solar cell device has been designed and simulated. This is a substantial improvement of 40% and 15%, respectively, compared to the transparent perovskite solar cell (21.1%) and Si solar cell (25.6%) operated individually. The perovskite solar cell has been used as a top subcell, whereas 250- and 25-μm-thick IBC-SiHJ solar cells have been used as bottom subcells. The realistic technology computer aided design analysis has been performed to understand the physical processes in the device and to make reliable predictions of the behavior. The performance of the top subcell has been obtained for different acceptor densities and hole mobility in Spiro-MeOTAD along with the impact of counter electrode work function. To incorporate the effect of material quality, the influence of carrier lifetimes has also been studied for perovskite top and IBC-SiHJ bottom subcells. The optical and electrical behavior of the devices has been obtained for both standalone as well as tandem configuration. Results reported in this study reveal that the proposed four-terminal tandem device may open a new door for cost-effective and energy-efficient applications.
... Consumers Consumer Information by Audience For Women Contact Lens Care Share Tweet Linkedin Pin it More sharing ... www.fda.gov/medwatch Learn More about Contact Lens Care Other Tips on Contact Lenses Decorative Contact ...
Decoding sound level in the marmoset primary auditory cortex.
Sun, Wensheng; Marongelli, Ellisha N; Watkins, Paul V; Barbour, Dennis L
2017-10-01
Neurons that respond favorably to a particular sound level have been observed throughout the central auditory system, becoming steadily more common at higher processing areas. One theory about the role of these level-tuned or nonmonotonic neurons is the level-invariant encoding of sounds. To investigate this theory, we simulated various subpopulations of neurons by drawing from real primary auditory cortex (A1) neuron responses and surveyed their performance in forming different sound level representations. Pure nonmonotonic subpopulations did not provide the best level-invariant decoding; instead, mixtures of monotonic and nonmonotonic neurons provided the most accurate decoding. For level-fidelity decoding, the inclusion of nonmonotonic neurons slightly improved or did not change decoding accuracy until they constituted a high proportion. These results indicate that nonmonotonic neurons fill an encoding role complementary to, rather than alternate to, monotonic neurons. NEW & NOTEWORTHY Neurons with nonmonotonic rate-level functions are unique to the central auditory system. These level-tuned neurons have been proposed to account for invariant sound perception across sound levels. Through systematic simulations based on real neuron responses, this study shows that neuron populations perform sound encoding optimally when containing both monotonic and nonmonotonic neurons. The results indicate that instead of working independently, nonmonotonic neurons complement the function of monotonic neurons in different sound-encoding contexts. Copyright © 2017 the American Physiological Society.
Complete ML Decoding orf the (73,45) PG Code
DEFF Research Database (Denmark)
Justesen, Jørn; Høholdt, Tom; Hjaltason, Johan
2005-01-01
Our recent proof of the completeness of decoding by list bit flipping is reviewed. The proof is based on an enumeration of all cosets of low weight in terms of their minimum weight and syndrome weight. By using a geometric description of the error patterns we characterize all remaining cosets....
Decoding Representations: How Children with Autism Understand Drawings
Allen, Melissa L.
2009-01-01
Young typically developing children can reason about abstract depictions if they know the intention of the artist. Children with autism spectrum disorder (ASD), who are notably impaired in social, "intention monitoring" domains, may have great difficulty in decoding vague representations. In Experiment 1, children with ASD are unable to use…
A quantum algorithm for Viterbi decoding of classical convolutional codes
Grice, Jon R.; Meyer, David A.
2015-07-01
We present a quantum Viterbi algorithm (QVA) with better than classical performance under certain conditions. In this paper, the proposed algorithm is applied to decoding classical convolutional codes, for instance, large constraint length and short decode frames . Other applications of the classical Viterbi algorithm where is large (e.g., speech processing) could experience significant speedup with the QVA. The QVA exploits the fact that the decoding trellis is similar to the butterfly diagram of the fast Fourier transform, with its corresponding fast quantum algorithm. The tensor-product structure of the butterfly diagram corresponds to a quantum superposition that we show can be efficiently prepared. The quantum speedup is possible because the performance of the QVA depends on the fanout (number of possible transitions from any given state in the hidden Markov model) which is in general much less than . The QVA constructs a superposition of states which correspond to all legal paths through the decoding lattice, with phase as a function of the probability of the path being taken given received data. A specialized amplitude amplification procedure is applied one or more times to recover a superposition where the most probable path has a high probability of being measured.
The Fluid Reading Primer: Animated Decoding Support for Emergent Readers.
Zellweger, Polle T.; Mackinlay, Jock D.
A prototype application called the Fluid Reading Primer was developed to help emergent readers with the process of decoding written words into their spoken forms. The Fluid Reading Primer is part of a larger research project called Fluid Documents, which is exploring the use of interactive animation of typography to show additional information in…
Adaptive Combined Source and Channel Decoding with Modulation ...
African Journals Online (AJOL)
In this paper, an adaptive system employing combined source and channel decoding with modulation is proposed for slow Rayleigh fading channels. Huffman code is used as the source code and Convolutional code is used for error control. The adaptive scheme employs a family of Convolutional codes of different rates ...
Tracking Perceptual and Memory Decisions by Decoding Brain Activity
van Vugt, Marieke; Brandt, Armin; Schulze-Bonhage, Andreas
2017-01-01
Decision making is thought to involve a process of evidence accumulation, modelled as a drifting diffusion process. This modeling framework suggests that all single-stage decisions involve a similar evidence accumulation process. In this paper we use decoding by machine learning classifiers on
Peeling Decoding of LDPC Codes with Applications in Compressed Sensing
Directory of Open Access Journals (Sweden)
Weijun Zeng
2016-01-01
Full Text Available We present a new approach for the analysis of iterative peeling decoding recovery algorithms in the context of Low-Density Parity-Check (LDPC codes and compressed sensing. The iterative recovery algorithm is particularly interesting for its low measurement cost and low computational complexity. The asymptotic analysis can track the evolution of the fraction of unrecovered signal elements in each iteration, which is similar to the well-known density evolution analysis in the context of LDPC decoding algorithm. Our analysis shows that there exists a threshold on the density factor; if under this threshold, the recovery algorithm is successful; otherwise it will fail. Simulation results are also provided for verifying the agreement between the proposed asymptotic analysis and recovery algorithm. Compared with existing works of peeling decoding algorithm, focusing on the failure probability of the recovery algorithm, our proposed approach gives accurate evolution of performance with different parameters of measurement matrices and is easy to implement. We also show that the peeling decoding algorithm performs better than other schemes based on LDPC codes.
High-throughput GPU-based LDPC decoding
Chang, Yang-Lang; Chang, Cheng-Chun; Huang, Min-Yu; Huang, Bormin
2010-08-01
Low-density parity-check (LDPC) code is a linear block code known to approach the Shannon limit via the iterative sum-product algorithm. LDPC codes have been adopted in most current communication systems such as DVB-S2, WiMAX, WI-FI and 10GBASE-T. LDPC for the needs of reliable and flexible communication links for a wide variety of communication standards and configurations have inspired the demand for high-performance and flexibility computing. Accordingly, finding a fast and reconfigurable developing platform for designing the high-throughput LDPC decoder has become important especially for rapidly changing communication standards and configurations. In this paper, a new graphic-processing-unit (GPU) LDPC decoding platform with the asynchronous data transfer is proposed to realize this practical implementation. Experimental results showed that the proposed GPU-based decoder achieved 271x speedup compared to its CPU-based counterpart. It can serve as a high-throughput LDPC decoder.
Real Time Decoding of Color Symbol for Optical Positioning System
Directory of Open Access Journals (Sweden)
Abdul Waheed Malik
2015-01-01
Full Text Available This paper presents the design and real-time decoding of a color symbol that can be used as a reference marker for optical navigation. The designed symbol has a circular shape and is printed on paper using two distinct colors. This pair of colors is selected based on the highest achievable signal to noise ratio. The symbol is designed to carry eight bit information. Real time decoding of this symbol is performed using a heterogeneous combination of Field Programmable Gate Array (FPGA and a microcontroller. An image sensor having a resolution of 1600 by 1200 pixels is used to capture images of symbols in complex backgrounds. Dynamic image segmentation, component labeling and feature extraction was performed on the FPGA. The region of interest was further computed from the extracted features. Feature data belonging to the symbol was sent from the FPGA to the microcontroller. Image processing tasks are partitioned between the FPGA and microcontroller based on data intensity. Experiments were performed to verify the rotational independence of the symbols. The maximum distance between camera and symbol allowing for correct detection and decoding was analyzed. Experiments were also performed to analyze the number of generated image components and sub-pixel precision versus different light sources and intensities. The proposed hardware architecture can process up to 55 frames per second for accurate detection and decoding of symbols at two Megapixels resolution. The power consumption of the complete system is 342mw.
Fast decoding of codes from algebraic plane curves
DEFF Research Database (Denmark)
Justesen, Jørn; Larsen, Knud J.; Jensen, Helge Elbrønd
1992-01-01
Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented. For codes from an arbitrary regular plane curve the authors correct up to d*/2-m2 /8+m/4-9/8 errors, where d* is the designed distance of the code and m is the degree of the curve. The complexity of finding...
Name that tune: decoding music from the listening brain.
Schaefer, R.S.; Farquhar, J.D.R.; Blokland, Y.M.; Sadakata, M.; Desain, P.W.M.
2011-01-01
In the current study we use electroencephalography (EEG) to detect heard music from the brain signal, hypothesizing that the time structure in music makes it especially suitable for decoding perception from EEG signals. While excluding music with vocals, we classified the perception of seven
Name that tune: Decoding music from the listening brain
Schaefer, R.S.; Farquhar, J.D.R.; Blokland, Y.M.; Sadakata, M.; Desain, P.W.M.
2011-01-01
In the current study we use electroencephalography (EEG) to detect heard music from the brain signal, hypothesizing that the time structure in music makes it especially suitable for decoding perception from EEG signals. While excluding music with vocals, we classified the perception of seven
Decoding English Alphabet Letters Using EEG Phase Information
Directory of Open Access Journals (Sweden)
YiYan Wang
2018-02-01
Full Text Available Increasing evidence indicates that the phase pattern and power of the low frequency oscillations of brain electroencephalograms (EEG contain significant information during the human cognition of sensory signals such as auditory and visual stimuli. Here, we investigate whether and how the letters of the alphabet can be directly decoded from EEG phase and power data. In addition, we investigate how different band oscillations contribute to the classification and determine the critical time periods. An English letter recognition task was assigned, and statistical analyses were conducted to decode the EEG signal corresponding to each letter visualized on a computer screen. We applied support vector machine (SVM with gradient descent method to learn the potential features for classification. It was observed that the EEG phase signals have a higher decoding accuracy than the oscillation power information. Low-frequency theta and alpha oscillations have phase information with higher accuracy than do other bands. The decoding performance was best when the analysis period began from 180 to 380 ms after stimulus presentation, especially in the lateral occipital and posterior temporal scalp regions (PO7 and PO8. These results may provide a new approach for brain-computer interface techniques (BCI and may deepen our understanding of EEG oscillations in cognition.
O2-GIDNC: Beyond instantly decodable network coding
Aboutorab, Neda; Sorour, Sameh; Sadeghi, Parastoo
2013-01-01
In this paper, we are concerned with extending the graph representation of generalized instantly decodable network coding (GIDNC) to a more general opportunistic network coding (ONC) scenario, referred to as order-2 GIDNC (O2-GIDNC). In the O2-GIDNC
EEG source imaging assists decoding in a face recognition task
DEFF Research Database (Denmark)
Andersen, Rasmus S.; Eliasen, Anders U.; Pedersen, Nicolai
2017-01-01
of face recognition. This task concerns the differentiation of brain responses to images of faces and scrambled faces and poses a rather difficult decoding problem at the single trial level. We implement the pipeline using spatially focused features and show that this approach is challenged and source...
LDPC-based iterative joint source-channel decoding for JPEG2000.
Pu, Lingling; Wu, Zhenyu; Bilgin, Ali; Marcellin, Michael W; Vasic, Bane
2007-02-01
A framework is proposed for iterative joint source-channel decoding of JPEG2000 codestreams. At the encoder, JPEG2000 is used to perform source coding with certain error-resilience (ER) modes, and LDPC codes are used to perform channel coding. During decoding, the source decoder uses the ER modes to identify corrupt sections of the codestream and provides this information to the channel decoder. Decoding is carried out jointly in an iterative fashion. Experimental results indicate that the proposed method requires fewer iterations and improves overall system performance.
The electricity market in transition: a decoding
International Nuclear Information System (INIS)
Mathieu, Mathilde; Schwarz, Virginie; Chapon, Antoine; Fouquet, Doerte; Joos, Marine; Jedliczka, Marc; Siess, Damien
2015-01-01
A set of article proposes a discussion of the main challenges for energy transition for the architecture of the European electricity market, an interview of the responsible of the energy department within the French ministry of ecology (she addresses the issues of market, electricity system, renewable energies), a discussion of the first lessons learned from the integration of renewable energies in the electricity market, a comment on hazardous evolutions for independent producers, a discussion of the pilot stage for bidding in Germany, a discussion of false ideas and true challenges in the relationship between demand management and integration, a comment on the evolution towards a complete reform of the support system for renewable energies, and a discussion of the perspectives beyond 40 per cent of renewable energies in the French electricity mix
On Lattice Sequential Decoding for Large MIMO Systems
Ali, Konpal S.
2014-04-01
Due to their ability to provide high data rates, Multiple-Input Multiple-Output (MIMO) wireless communication systems have become increasingly popular. Decoding of these systems with acceptable error performance is computationally very demanding. In the case of large overdetermined MIMO systems, we employ the Sequential Decoder using the Fano Algorithm. A parameter called the bias is varied to attain different performance-complexity trade-offs. Low values of the bias result in excellent performance but at the expense of high complexity and vice versa for higher bias values. We attempt to bound the error by bounding the bias, using the minimum distance of a lattice. Also, a particular trend is observed with increasing SNR: a region of low complexity and high error, followed by a region of high complexity and error falling, and finally a region of low complexity and low error. For lower bias values, the stages of the trend are incurred at lower SNR than for higher bias values. This has the important implication that a low enough bias value, at low to moderate SNR, can result in low error and low complexity even for large MIMO systems. Our work is compared against Lattice Reduction (LR) aided Linear Decoders (LDs). Another impressive observation for low bias values that satisfy the error bound is that the Sequential Decoder\\'s error is seen to fall with increasing system size, while it grows for the LR-aided LDs. For the case of large underdetermined MIMO systems, Sequential Decoding with two preprocessing schemes is proposed – 1) Minimum Mean Square Error Generalized Decision Feedback Equalization (MMSE-GDFE) preprocessing 2) MMSE-GDFE preprocessing, followed by Lattice Reduction and Greedy Ordering. Our work is compared against previous work which employs Sphere Decoding preprocessed using MMSE-GDFE, Lattice Reduction and Greedy Ordering. For the case of large systems, this results in high complexity and difficulty in choosing the sphere radius. Our schemes
Multi-stage decoding for multi-level block modulation codes
Lin, Shu
1991-01-01
In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the probability of an incorrect decoding are derived. Based on our study and computation results, we find that, if component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. In particular, we find that the difference in performance between the suboptimum multi-stage soft-decision maximum likelihood decoding of a modulation code and the single-stage optimum decoding of the overall code is very small: only a fraction of dB loss in SNR at the probability of an incorrect decoding for a block of 10(exp -6). Multi-stage decoding of multi-level modulation codes really offers a way to achieve the best of three worlds, bandwidth efficiency, coding gain, and decoding complexity.
Real-time SHVC software decoding with multi-threaded parallel processing
Gudumasu, Srinivas; He, Yuwen; Ye, Yan; He, Yong; Ryu, Eun-Seok; Dong, Jie; Xiu, Xiaoyu
2014-09-01
This paper proposes a parallel decoding framework for scalable HEVC (SHVC). Various optimization technologies are implemented on the basis of SHVC reference software SHM-2.0 to achieve real-time decoding speed for the two layer spatial scalability configuration. SHVC decoder complexity is analyzed with profiling information. The decoding process at each layer and the up-sampling process are designed in parallel and scheduled by a high level application task manager. Within each layer, multi-threaded decoding is applied to accelerate the layer decoding speed. Entropy decoding, reconstruction, and in-loop processing are pipeline designed with multiple threads based on groups of coding tree units (CTU). A group of CTUs is treated as a processing unit in each pipeline stage to achieve a better trade-off between parallelism and synchronization. Motion compensation, inverse quantization, and inverse transform modules are further optimized with SSE4 SIMD instructions. Simulations on a desktop with an Intel i7 processor 2600 running at 3.4 GHz show that the parallel SHVC software decoder is able to decode 1080p spatial 2x at up to 60 fps (frames per second) and 1080p spatial 1.5x at up to 50 fps for those bitstreams generated with SHVC common test conditions in the JCT-VC standardization group. The decoding performance at various bitrates with different optimization technologies and different numbers of threads are compared in terms of decoding speed and resource usage, including processor and memory.
Decoding bipedal locomotion from the rat sensorimotor cortex
Rigosa, J.; Panarese, A.; Dominici, N.; Friedli, L.; van den Brand, R.; Carpaneto, J.; DiGiovanna, J.; Courtine, G.; Micera, S.
2015-10-01
Objective. Decoding forelimb movements from the firing activity of cortical neurons has been interfaced with robotic and prosthetic systems to replace lost upper limb functions in humans. Despite the potential of this approach to improve locomotion and facilitate gait rehabilitation, decoding lower limb movement from the motor cortex has received comparatively little attention. Here, we performed experiments to identify the type and amount of information that can be decoded from neuronal ensemble activity in the hindlimb area of the rat motor cortex during bipedal locomotor tasks. Approach. Rats were trained to stand, step on a treadmill, walk overground and climb staircases in a bipedal posture. To impose this gait, the rats were secured in a robotic interface that provided support against the direction of gravity and in the mediolateral direction, but behaved transparently in the forward direction. After completion of training, rats were chronically implanted with a micro-wire array spanning the left hindlimb motor cortex to record single and multi-unit activity, and bipolar electrodes into 10 muscles of the right hindlimb to monitor electromyographic signals. Whole-body kinematics, muscle activity, and neural signals were simultaneously recorded during execution of the trained tasks over multiple days of testing. Hindlimb kinematics, muscle activity, gait phases, and locomotor tasks were decoded using offline classification algorithms. Main results. We found that the stance and swing phases of gait and the locomotor tasks were detected with accuracies as robust as 90% in all rats. Decoded hindlimb kinematics and muscle activity exhibited a larger variability across rats and tasks. Significance. Our study shows that the rodent motor cortex contains useful information for lower limb neuroprosthetic development. However, brain-machine interfaces estimating gait phases or locomotor behaviors, instead of continuous variables such as limb joint positions or speeds
Low Complexity Approach for High Throughput Belief-Propagation based Decoding of LDPC Codes
Directory of Open Access Journals (Sweden)
BOT, A.
2013-11-01
Full Text Available The paper proposes a low complexity belief propagation (BP based decoding algorithm for LDPC codes. In spite of the iterative nature of the decoding process, the proposed algorithm provides both reduced complexity and increased BER performances as compared with the classic min-sum (MS algorithm, generally used for hardware implementations. Linear approximations of check-nodes update function are used in order to reduce the complexity of the BP algorithm. Considering this decoding approach, an FPGA based hardware architecture is proposed for implementing the decoding algorithm, aiming to increase the decoder throughput. FPGA technology was chosen for the LDPC decoder implementation, due to its parallel computation and reconfiguration capabilities. The obtained results show improvements regarding decoding throughput and BER performances compared with state-of-the-art approaches.
Low Power LDPC Code Decoder Architecture Based on Intermediate Message Compression Technique
Shimizu, Kazunori; Togawa, Nozomu; Ikenaga, Takeshi; Goto, Satoshi
Reducing the power dissipation for LDPC code decoder is a major challenging task to apply it to the practical digital communication systems. In this paper, we propose a low power LDPC code decoder architecture based on an intermediate message-compression technique which features as follows: (i) An intermediate message compression technique enables the decoder to reduce the required memory capacity and write power dissipation. (ii) A clock gated shift register based intermediate message memory architecture enables the decoder to decompress the compressed messages in a single clock cycle while reducing the read power dissipation. The combination of the above two techniques enables the decoder to reduce the power dissipation while keeping the decoding throughput. The simulation results show that the proposed architecture improves the power efficiency up to 52% and 18% compared to that of the decoder based on the overlapped schedule and the rapid convergence schedule without the proposed techniques respectively.
Design of FBG En/decoders in Coherent 2-D Time-polarization OCDMA Systems
Hou, Fen-fei; Yang, Ming
2012-12-01
A novel fiber Bragg grating (FBG)-based en/decoder for the two-dimensional (2-D) time-spreading and polarization multiplexer optical coding is proposed. Compared with other 2-D en/decoders, the proposed en/decoding for an optical code-division multiple-access (OCDMA) system uses a single phase-encoded FBG and coherent en/decoding. Furthermore, combined with reconstruction-equivalent-chirp technology, such en/decoders can be realized with a conventional simple fabrication setup. Experimental results of such en/decoders and the corresponding system test at a data rate of 5 Gbit/s demonstrate that this kind of 2-D FBG-based en/decoders could improve the performances of OCDMA systems.
Decoding the genome with an integrative analysis tool: combinatorial CRM Decoder.
Kang, Keunsoo; Kim, Joomyeong; Chung, Jae Hoon; Lee, Daeyoup
2011-09-01
The identification of genome-wide cis-regulatory modules (CRMs) and characterization of their associated epigenetic features are fundamental steps toward the understanding of gene regulatory networks. Although integrative analysis of available genome-wide information can provide new biological insights, the lack of novel methodologies has become a major bottleneck. Here, we present a comprehensive analysis tool called combinatorial CRM decoder (CCD), which utilizes the publicly available information to identify and characterize genome-wide CRMs in a species of interest. CCD first defines a set of the epigenetic features which is significantly associated with a set of known CRMs as a code called 'trace code', and subsequently uses the trace code to pinpoint putative CRMs throughout the genome. Using 61 genome-wide data sets obtained from 17 independent mouse studies, CCD successfully catalogued ∼12 600 CRMs (five distinct classes) including polycomb repressive complex 2 target sites as well as imprinting control regions. Interestingly, we discovered that ∼4% of the identified CRMs belong to at least two different classes named 'multi-functional CRM', suggesting their functional importance for regulating spatiotemporal gene expression. From these examples, we show that CCD can be applied to any potential genome-wide datasets and therefore will shed light on unveiling genome-wide CRMs in various species.
Definition and detection of contact in atomistic simulations
Solhjoo, Soheil; Vakis, Antonis I.
2015-01-01
In atomistic simulations, contact depends on the accurate detection of contacting atoms as well as their contact area. While it is common to define contact between atoms based on the so-called ‘contact distance’ where the interatomic potential energy reaches its minimum, this discounts, for example,
Definition and detection of contact in atomistic simulations
Solhjoo, Soheil; Vakis, Antonis I.
In atomistic simulations, contact depends on the accurate detection of contacting atoms as well as their contact area. While it is common to define contact between atoms based on the so-called ‘contact distance’ where the interatomic potential energy reaches its minimum, this discounts, for example,
Transportation Energy - Sandia Energy
Energy Energy Secure & Sustainable Energy Future Search Icon Sandia Home Locations Contact Us Employee Locator Menu Stationary Power solar Energy Conversion Efficiency Increasing the amount of electricity produced from a given thermal energy input. Solar Energy Wind Energy Water Power Supercritical CO2
Energy Research - Sandia Energy
Energy Energy Secure & Sustainable Energy Future Search Icon Sandia Home Locations Contact Us Employee Locator Menu Stationary Power solar Energy Conversion Efficiency Increasing the amount of electricity produced from a given thermal energy input. Solar Energy Wind Energy Water Power Supercritical CO2
Occupational contact urticaria and protein contact dermatitis.
Doutre, Marie-Sylvie
2005-01-01
Irritant dermatitis and eczema are the most prevalent occupational skin diseases. Less common are immediate contact reactions such as contact urticaria and protein contact dermatitis. Occupational contact urticaria can be subdivided into two categories, immunological and non immunological. However, some agents can induce these two types of reactions. Contact urticaria to natural rubber latex is particularly frequent among health care personnel, but contact urticaria to a wide variety of other substances occurs in many other occupations. Among those at risk are cooks, bakers, butchers, restaurant personnel, veterinarians, hairdressers, florists, gardeners, and forestry workers. Protein contact dermatitis in some of these occupations is caused principally by proteins of animal or plant origin, especially among individuals with a history of atopic dermatitis. Diagnosis requires careful interrogation, clinical examination and skin tests (open tests and prick tests with immediate lecture) to identify a particular contact allergen.
Performance-complexity tradeoff in sequential decoding for the unconstrained AWGN channel
Abediseid, Walid
2013-06-01
In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter - the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity. © 2013 IEEE.
Sheikh, Alireza; Amat, Alexandre Graell i.; Liva, Gianluigi
2017-12-01
We analyze the achievable information rates (AIRs) for coded modulation schemes with QAM constellations with both bit-wise and symbol-wise decoders, corresponding to the case where a binary code is used in combination with a higher-order modulation using the bit-interleaved coded modulation (BICM) paradigm and to the case where a nonbinary code over a field matched to the constellation size is used, respectively. In particular, we consider hard decision decoding, which is the preferable option for fiber-optic communication systems where decoding complexity is a concern. Recently, Liga \\emph{et al.} analyzed the AIRs for bit-wise and symbol-wise decoders considering what the authors called \\emph{hard decision decoder} which, however, exploits \\emph{soft information} of the transition probabilities of discrete-input discrete-output channel resulting from the hard detection. As such, the complexity of the decoder is essentially the same as the complexity of a soft decision decoder. In this paper, we analyze instead the AIRs for the standard hard decision decoder, commonly used in practice, where the decoding is based on the Hamming distance metric. We show that if standard hard decision decoding is used, bit-wise decoders yield significantly higher AIRs than symbol-wise decoders. As a result, contrary to the conclusion by Liga \\emph{et al.}, binary decoders together with the BICM paradigm are preferable for spectrally-efficient fiber-optic systems. We also design binary and nonbinary staircase codes and show that, in agreement with the AIRs, binary codes yield better performance.
STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM
Directory of Open Access Journals (Sweden)
H. Prashantha Kumar
2012-03-01
Full Text Available The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes. Therefore, decoding algorithms traditionally proposed for decoding convolutional codes have been applied for decoding certain classes of block codes. This paper presents the decoding of block codes using tree structure. Many good block codes are presently known. Several of them have been used in applications ranging from deep space communication to error control in storage systems. But the primary difficulty with applying Viterbi or BCJR algorithms to decode of block codes is that, even though they are optimum decoding methods, the promised bit error rates are not achieved in practice at data rates close to capacity. This is because the decoding effort is fixed and grows with block length, and thus only short block length codes can be used. Therefore, an important practical question is whether a suboptimal realizable soft decision decoding method can be found for block codes. A noteworthy result which provides a partial answer to this question is described in the following sections. This result of near optimum decoding will be used as motivation for the investigation of different soft decision decoding methods for linear block codes which can lead to the development of efficient decoding algorithms. The code tree can be treated as an expanded version of the trellis, where every path is totally distinct from every other path. We have derived the tree structure for (8, 4 and (16, 11 extended Hamming codes and have succeeded in implementing the soft decision stack algorithm to decode them. For the discrete memoryless channel, gains in excess of 1.5dB at a bit error rate of 10-5 with respect to conventional hard decision decoding are demonstrated for these codes.
Decoding thalamic afferent input using microcircuit spiking activity.
Sederberg, Audrey J; Palmer, Stephanie E; MacLean, Jason N
2015-04-01
A behavioral response appropriate to a sensory stimulus depends on the collective activity of thousands of interconnected neurons. The majority of cortical connections arise from neighboring neurons, and thus understanding the cortical code requires characterizing information representation at the scale of the cortical microcircuit. Using two-photon calcium imaging, we densely sampled the thalamically evoked response of hundreds of neurons spanning multiple layers and columns in thalamocortical slices of mouse somatosensory cortex. We then used a biologically plausible decoder to characterize the representation of two distinct thalamic inputs, at the level of the microcircuit, to reveal those aspects of the activity pattern that are likely relevant to downstream neurons. Our data suggest a sparse code, distributed across lamina, in which a small population of cells carries stimulus-relevant information. Furthermore, we find that, within this subset of neurons, decoder performance improves when noise correlations are taken into account. Copyright © 2015 the American Physiological Society.
Codes on the Klein quartic, ideals, and decoding
DEFF Research Database (Denmark)
Hansen, Johan P.
1987-01-01
descriptions as left ideals in the group-algebra GF(2^{3})[G]. This description allows for easy decoding. For instance, in the case of the single error correcting code of length21and dimension16with minimal distance3. decoding is obtained by multiplication with an idempotent in the group algebra.......A sequence of codes with particular symmetries and with large rates compared to their minimal distances is constructed over the field GF(2^{3}). In the sequence there is, for instance, a code of length 21 and dimension10with minimal distance9, and a code of length21and dimension16with minimal...... distance3. The codes are constructed from algebraic geometry using the dictionary between coding theory and algebraic curves over finite fields established by Goppa. The curve used in the present work is the Klein quartic. This curve has the maximal number of rational points over GF(2^{3})allowed by Serre...
Soft decoding a self-dual (48, 24; 12) code
Solomon, G.
1993-01-01
A self-dual (48,24;12) code comes from restricting a binary cyclic (63,18;36) code to a 6 x 7 matrix, adding an eighth all-zero column, and then adjoining six dimensions to this extended 6 x 8 matrix. These six dimensions are generated by linear combinations of row permutations of a 6 x 8 matrix of weight 12, whose sums of rows and columns add to one. A soft decoding using these properties and approximating maximum likelihood is presented here. This is preliminary to a possible soft decoding of the box (72,36;15) code that promises a 7.7-dB theoretical coding under maximum likelihood.
DECODING OF ACADEMIC CONTENT BY THE 1st GRADE STUDENTS
Directory of Open Access Journals (Sweden)
Kamil Błaszczyński
2017-07-01
Full Text Available In the paper a comparative study conducted on the 1st grade students of sociology and pedagogy is discussed. The study was focused on the language skills of students. The most important skills tested were the abilities to decode academic content. The study shows that the students have very poor language skills in decoding the academic content on every level of its complexity. They also have noticeable problems with the definition of basic academic terms. The significance of the obtained results are high because of the innovative topic and character of the study, which was the first such study conducted on students of a Polish university. Results are also valuable for academic teachers who are interested in such problems as effective communication with students.
Decoding Signal Processing at the Single-Cell Level
Energy Technology Data Exchange (ETDEWEB)
Wiley, H. Steven
2017-12-01
The ability of cells to detect and decode information about their extracellular environment is critical to generating an appropriate response. In multicellular organisms, cells must decode dozens of signals from their neighbors and extracellular matrix to maintain tissue homeostasis while still responding to environmental stressors. How cells detect and process information from their surroundings through a surprisingly limited number of signal transduction pathways is one of the most important question in biology. Despite many decades of research, many of the fundamental principles that underlie cell signal processing remain obscure. However, in this issue of Cell Systems, Gillies et al present compelling evidence that the early response gene circuit can act as a linear signal integrator, thus providing significant insight into how cells handle fluctuating signals and noise in their environment.
Reaction Decoder Tool (RDT): extracting features from chemical reactions.
Rahman, Syed Asad; Torrance, Gilliean; Baldacci, Lorenzo; Martínez Cuesta, Sergio; Fenninger, Franz; Gopal, Nimish; Choudhary, Saket; May, John W; Holliday, Gemma L; Steinbeck, Christoph; Thornton, Janet M
2016-07-01
Extracting chemical features like Atom-Atom Mapping (AAM), Bond Changes (BCs) and Reaction Centres from biochemical reactions helps us understand the chemical composition of enzymatic reactions. Reaction Decoder is a robust command line tool, which performs this task with high accuracy. It supports standard chemical input/output exchange formats i.e. RXN/SMILES, computes AAM, highlights BCs and creates images of the mapped reaction. This aids in the analysis of metabolic pathways and the ability to perform comparative studies of chemical reactions based on these features. This software is implemented in Java, supported on Windows, Linux and Mac OSX, and freely available at https://github.com/asad/ReactionDecoder : asad@ebi.ac.uk or s9asad@gmail.com. © The Author 2016. Published by Oxford University Press.
Fast decoder for local quantum codes using Groebner basis
Haah, Jeongwan
2013-03-01
Based on arXiv:1204.1063. A local translation-invariant quantum code has a description in terms of Laurent polynomials. As an application of this observation, we present a fast decoding algorithm for translation-invariant local quantum codes in any spatial dimensions using the straightforward division algorithm for multivariate polynomials. The running time is O (n log n) on average, or O (n2 log n) on worst cases, where n is the number of physical qubits. The algorithm improves a subroutine of the renormalization-group decoder by Bravyi and Haah (arXiv:1112.3252) in the translation-invariant case. This work is supported in part by the Insitute for Quantum Information and Matter, an NSF Physics Frontier Center, and the Korea Foundation for Advanced Studies.
[Efficacy of decoding training for children with difficulty reading hiragana].
Uchiyama, Hitoshi; Tanaka, Daisuke; Seki, Ayumi; Wakamiya, Eiji; Hirasawa, Noriko; Iketani, Naotake; Kato, Ken; Koeda, Tatsuya
2013-05-01
The present study aimed to clarify the efficacy of decoding training focusing on the correspondence between written symbols and their readings for children with difficulty reading hiragana (Japanese syllabary). Thirty-five children with difficulty reading hiragana were selected from among 367 first-grade elementary school students using a reading aloud test and were then divided into intervention (n=15) and control (n=20) groups. The intervention comprised 5 minutes of decoding training each day for a period of 3 weeks using an original program on a personal computer. Reading time and number of reading errors in the reading aloud test were compared between the groups. The intervention group showed a significant shortening of reading time (F(1,33)=5.40, phiragana.
Full Text Available ... One Use Facts About Colored Contacts and Halloween Safety Colored Contact Lens Facts Over-the-Counter Costume ... Costume Contact Lenses Can Ruin Vision Eye Makeup Safety In fact, it is illegal to sell colored ...
Full Text Available ... One Use Facts About Colored Contacts and Halloween Safety Colored Contact Lens Facts Over-the-Counter Costume ... use of colored contact lenses , from the U.S. Food and Drug Administration (FDA). Are the colored lenses ...
Iterative demodulation and decoding of coded non-square QAM
Li, L.; Divsalar, D.; Dolinar, S.
2003-01-01
Simulation results show that, with iterative demodulation and decoding, coded NS-8QAM performs 0.5 dB better than standard 8QAM and 0.7 dB better than 8PSK at BER= 10(sup -5), when the FEC code is the (15, 11) Hamming code concatenated with a rate-1 accumulator code, while coded NS-32QAM performs 0.25 dB better than standard 32QAM.
Design and Implementation of Viterbi Decoder Using VHDL
Thakur, Akash; Chattopadhyay, Manju K.
2018-03-01
A digital design conversion of Viterbi decoder for ½ rate convolutional encoder with constraint length k = 3 is presented in this paper. The design is coded with the help of VHDL, simulated and synthesized using XILINX ISE 14.7. Synthesis results show a maximum frequency of operation for the design is 100.725 MHz. The requirement of memory is less as compared to conventional method.
Maximum likelihood convolutional decoding (MCD) performance due to system losses
Webster, L.
1976-01-01
A model for predicting the computational performance of a maximum likelihood convolutional decoder (MCD) operating in a noisy carrier reference environment is described. This model is used to develop a subroutine that will be utilized by the Telemetry Analysis Program to compute the MCD bit error rate. When this computational model is averaged over noisy reference phase errors using a high-rate interpolation scheme, the results are found to agree quite favorably with experimental measurements.
Decoding Gimmicks of Financial Shenanigans in Telecom Sector in India
Sandeep GOEL
2013-01-01
Major corporate financial shenanigans get away in the name of creative accounting. But, they need to be studied for lessons learned and strategies to avoid or reduce the incidence of such frauds in the future. It is essential for shareholders, particularly the common man who does not have any access to the company except reported financial numbers. This paper aims to decode the level of financial shenanigans practices in corporate enterprises in telecom sector in India. The reason being is th...
Fast Transform Decoding Of Nonsystematic Reed-Solomon Codes
Truong, Trieu-Kie; Cheung, Kar-Ming; Shiozaki, A.; Reed, Irving S.
1992-01-01
Fast, efficient Fermat number transform used to compute F'(x) analogous to computation of syndrome in conventional decoding scheme. Eliminates polynomial multiplications and reduces number of multiplications in reconstruction of F'(x) to n log (n). Euclidean algorithm used to evaluate F(x) directly, without going through intermediate steps of solving error-locator and error-evaluator polynomials. Algorithm suitable for implementation in very-large-scale integrated circuits.
Efficient algorithms for maximum likelihood decoding in the surface code
Bravyi, Sergey; Suchara, Martin; Vargo, Alexander
2014-09-01
We describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the two-dimensional surface code with a noiseless syndrome extraction. First, we show how to implement MLD exactly in time O (n2), where n is the number of code qubits. Our implementation uses a reduction from MLD to simulation of matchgate quantum circuits. This reduction however requires a special noise model with independent bit-flip and phase-flip errors. Secondly, we show how to implement MLD approximately for more general noise models using matrix product states (MPS). Our implementation has running time O (nχ3), where χ is a parameter that controls the approximation precision. The key step of our algorithm, borrowed from the density matrix renormalization-group method, is a subroutine for contracting a tensor network on the two-dimensional grid. The subroutine uses MPS with a bond dimension χ to approximate the sequence of tensors arising in the course of contraction. We benchmark the MPS-based decoder against the standard minimum weight matching decoder observing a significant reduction of the logical error probability for χ ≥4.
Biological 2-Input Decoder Circuit in Human Cells
2015-01-01
Decoders are combinational circuits that convert information from n inputs to a maximum of 2n outputs. This operation is of major importance in computing systems yet it is vastly underexplored in synthetic biology. Here, we present a synthetic gene network architecture that operates as a biological decoder in human cells, converting 2 inputs to 4 outputs. As a proof-of-principle, we use small molecules to emulate the two inputs and fluorescent reporters as the corresponding four outputs. The experiments are performed using transient transfections in human kidney embryonic cells and the characterization by fluorescence microscopy and flow cytometry. We show a clear separation between the ON and OFF mean fluorescent intensity states. Additionally, we adopt the integrated mean fluorescence intensity for the characterization of the circuit and show that this metric is more robust to transfection conditions when compared to the mean fluorescent intensity. To conclude, we present the first implementation of a genetic decoder. This combinational system can be valuable toward engineering higher-order circuits as well as accommodate a multiplexed interface with endogenous cellular functions. PMID:24694115
An Area-Efficient Reconfigurable LDPC Decoder with Conflict Resolution
Zhou, Changsheng; Huang, Yuebin; Huang, Shuangqu; Chen, Yun; Zeng, Xiaoyang
Based on Turbo-Decoding Message-Passing (TDMP) and Normalized Min-Sum (NMS) algorithm, an area efficient LDPC decoder that supports both structured and unstructured LDPC codes is proposed in this paper. We introduce a solution to solve the memory access conflict problem caused by TDMP algorithm. We also arrange the main timing schedule carefully to handle the operations of our solution while avoiding much additional hardware consumption. To reduce the memory bits needed, the extrinsic message storing strategy is also optimized. Besides the extrinsic message recover and the accumulate operation are merged together. To verify our architecture, a LDPC decoder that supports both China Multimedia Mobile Broadcasting (CMMB) and Digital Terrestrial/ Television Multimedia Broadcasting (DTMB) standards is developed using SMIC 0.13µm standard CMOS process. The core area is 4.75mm2 and the maximum operating clock frequency is 200MHz. The estimated power consumption is 48.4mW at 25MHz for CMMB and 130.9mW at 50MHz for DTMB with 5 iterations and 1.2V supply.
Biological 2-input decoder circuit in human cells.
Guinn, Michael; Bleris, Leonidas
2014-08-15
Decoders are combinational circuits that convert information from n inputs to a maximum of 2(n) outputs. This operation is of major importance in computing systems yet it is vastly underexplored in synthetic biology. Here, we present a synthetic gene network architecture that operates as a biological decoder in human cells, converting 2 inputs to 4 outputs. As a proof-of-principle, we use small molecules to emulate the two inputs and fluorescent reporters as the corresponding four outputs. The experiments are performed using transient transfections in human kidney embryonic cells and the characterization by fluorescence microscopy and flow cytometry. We show a clear separation between the ON and OFF mean fluorescent intensity states. Additionally, we adopt the integrated mean fluorescence intensity for the characterization of the circuit and show that this metric is more robust to transfection conditions when compared to the mean fluorescent intensity. To conclude, we present the first implementation of a genetic decoder. This combinational system can be valuable toward engineering higher-order circuits as well as accommodate a multiplexed interface with endogenous cellular functions.
The basis of orientation decoding in human primary visual cortex: fine- or coarse-scale biases?
Maloney, Ryan T
2015-01-01
Orientation signals in human primary visual cortex (V1) can be reliably decoded from the multivariate pattern of activity as measured with functional magnetic resonance imaging (fMRI). The precise underlying source of these decoded signals (whether by orientation biases at a fine or coarse scale in cortex) remains a matter of some controversy, however. Freeman and colleagues (J Neurosci 33: 19695-19703, 2013) recently showed that the accuracy of decoding of spiral patterns in V1 can be predicted by a voxel's preferred spatial position (the population receptive field) and its coarse orientation preference, suggesting that coarse-scale biases are sufficient for orientation decoding. Whether they are also necessary for decoding remains an open question, and one with implications for the broader interpretation of multivariate decoding results in fMRI studies. Copyright © 2015 the American Physiological Society.
Emotion Decoding and Incidental Processing Fluency as Antecedents of Attitude Certainty.
Petrocelli, John V; Whitmire, Melanie B
2017-07-01
Previous research demonstrates that attitude certainty influences the degree to which an attitude changes in response to persuasive appeals. In the current research, decoding emotions from facial expressions and incidental processing fluency, during attitude formation, are examined as antecedents of both attitude certainty and attitude change. In Experiment 1, participants who decoded anger or happiness during attitude formation expressed their greater attitude certainty, and showed more resistance to persuasion than participants who decoded sadness. By manipulating the emotion decoded, the diagnosticity of processing fluency experienced during emotion decoding, and the gaze direction of the social targets, Experiment 2 suggests that the link between emotion decoding and attitude certainty results from incidental processing fluency. Experiment 3 demonstrated that fluency in processing irrelevant stimuli influences attitude certainty, which in turn influences resistance to persuasion. Implications for appraisal-based accounts of attitude formation and attitude change are discussed.
Coding/decoding two-dimensional images with orbital angular momentum of light.
Chu, Jiaqi; Li, Xuefeng; Smithwick, Quinn; Chu, Daping
2016-04-01
We investigate encoding and decoding of two-dimensional information using the orbital angular momentum (OAM) of light. Spiral phase plates and phase-only spatial light modulators are used in encoding and decoding of OAM states, respectively. We show that off-axis points and spatial variables encoded with a given OAM state can be recovered through decoding with the corresponding complimentary OAM state.
A Low-Complexity Joint Detection-Decoding Algorithm for Nonbinary LDPC-Coded Modulation Systems
Wang, Xuepeng; Bai, Baoming; Ma, Xiao
2010-01-01
In this paper, we present a low-complexity joint detection-decoding algorithm for nonbinary LDPC codedmodulation systems. The algorithm combines hard-decision decoding using the message-passing strategy with the signal detector in an iterative manner. It requires low computational complexity, offers good system performance and has a fast rate of decoding convergence. Compared to the q-ary sum-product algorithm (QSPA), it provides an attractive candidate for practical applications of q-ary LDP...
Potts glass reflection of the decoding threshold for qudit quantum error correcting codes
Jiang, Yi; Kovalev, Alexey A.; Pryadko, Leonid P.
We map the maximum likelihood decoding threshold for qudit quantum error correcting codes to the multicritical point in generalized Potts gauge glass models, extending the map constructed previously for qubit codes. An n-qudit quantum LDPC code, where a qudit can be involved in up to m stabilizer generators, corresponds to a ℤd Potts model with n interaction terms which can couple up to m spins each. We analyze general properties of the phase diagram of the constructed model, give several bounds on the location of the transitions, bounds on the energy density of extended defects (non-local analogs of domain walls), and discuss the correlation functions which can be used to distinguish different phases in the original and the dual models. This research was supported in part by the Grants: NSF PHY-1415600 (AAK), NSF PHY-1416578 (LPP), and ARO W911NF-14-1-0272 (LPP).
Decoding using back-project algorithm from coded image in ICF
International Nuclear Information System (INIS)
Jiang shaoen; Liu Zhongli; Zheng Zhijian; Tang Daoyuan
1999-01-01
The principle of the coded imaging and its decoding in inertial confinement fusion is described simply. The authors take ring aperture microscope for example and use back-project (BP) algorithm to decode the coded image. The decoding program has been performed for numerical simulation. Simulations of two models are made, and the results show that the accuracy of BP algorithm is high and effect of reconstruction is good. Thus, it indicates that BP algorithm is applicable to decoding for coded image in ICF experiments
Analysis of Iterated Hard Decision Decoding of Product Codes with Reed-Solomon Component Codes
DEFF Research Database (Denmark)
Justesen, Jørn; Høholdt, Tom
2007-01-01
Products of Reed-Solomon codes are important in applications because they offer a combination of large blocks, low decoding complexity, and good performance. A recent result on random graphs can be used to show that with high probability a large number of errors can be corrected by iterating...... minimum distance decoding. We present an analysis related to density evolution which gives the exact asymptotic value of the decoding threshold and also provides a closed form approximation to the distribution of errors in each step of the decoding of finite length codes....
VLSI Architectures for Sliding-Window-Based Space-Time Turbo Trellis Code Decoders
Directory of Open Access Journals (Sweden)
Georgios Passas
2012-01-01
Full Text Available The VLSI implementation of SISO-MAP decoders used for traditional iterative turbo coding has been investigated in the literature. In this paper, a complete architectural model of a space-time turbo code receiver that includes elementary decoders is presented. These architectures are based on newly proposed building blocks such as a recursive add-compare-select-offset (ACSO unit, A-, B-, Γ-, and LLR output calculation modules. Measurements of complexity and decoding delay of several sliding-window-technique-based MAP decoder architectures and a proposed parameter set lead to defining equations and comparison between those architectures.
A new LDPC decoding scheme for PDM-8QAM BICM coherent optical communication system
Liu, Yi; Zhang, Wen-bo; Xi, Li-xia; Tang, Xian-feng; Zhang, Xiao-guang
2015-11-01
A new log-likelihood ratio (LLR) message estimation method is proposed for polarization-division multiplexing eight quadrature amplitude modulation (PDM-8QAM) bit-interleaved coded modulation (BICM) optical communication system. The formulation of the posterior probability is theoretically analyzed, and the way to reduce the pre-decoding bit error rate ( BER) of the low density parity check (LDPC) decoder for PDM-8QAM constellations is presented. Simulation results show that it outperforms the traditional scheme, i.e., the new post-decoding BER is decreased down to 50% of that of the traditional post-decoding algorithm.
Multiple-Symbol Noncoherent Decoding of Uncoded and Convolutionally Codes Continous Phase Modulation
Divsalar, D.; Raphaeli, D.
2000-01-01
Recently, a method for combined noncoherent detection and decoding of trellis-codes (noncoherent coded modulation) has been proposed, which can practically approach the performance of coherent detection.
Firing rate estimation using infinite mixture models and its application to neural decoding.
Shibue, Ryohei; Komaki, Fumiyasu
2017-11-01
Neural decoding is a framework for reconstructing external stimuli from spike trains recorded by various neural recordings. Kloosterman et al. proposed a new decoding method using marked point processes (Kloosterman F, Layton SP, Chen Z, Wilson MA. J Neurophysiol 111: 217-227, 2014). This method does not require spike sorting and thereby improves decoding accuracy dramatically. In this method, they used kernel density estimation to estimate intensity functions of marked point processes. However, the use of kernel density estimation causes problems such as low decoding accuracy and high computational costs. To overcome these problems, we propose a new decoding method using infinite mixture models to estimate intensity. The proposed method improves decoding performance in terms of accuracy and computational speed. We apply the proposed method to simulation and experimental data to verify its performance. NEW & NOTEWORTHY We propose a new neural decoding method using infinite mixture models and nonparametric Bayesian statistics. The proposed method improves decoding performance in terms of accuracy and computation speed. We have successfully applied the proposed method to position decoding from spike trains recorded in a rat hippocampus. Copyright © 2017 the American Physiological Society.
Parallel iterative decoding of transform domain Wyner-Ziv video using cross bitplane correlation
DEFF Research Database (Denmark)
Luong, Huynh Van; Huang, Xin; Forchhammer, Søren
2011-01-01
decoding scheme is proposed to improve the coding efficiency of TDWZ video codecs. The proposed parallel iterative LDPC decoding scheme is able to utilize cross bitplane correlation during decoding, by iteratively refining the soft-input, updating a modeled noise distribution and thereafter enhancing......In recent years, Transform Domain Wyner-Ziv (TDWZ) video coding has been proposed as an efficient Distributed Video Coding (DVC) solution, which fully or partly exploits the source statistics at the decoder to reduce the computational burden at the encoder. In this paper, a parallel iterative LDPC...
Visual perception as retrospective Bayesian decoding from high- to low-level features.
Ding, Stephanie; Cueva, Christopher J; Tsodyks, Misha; Qian, Ning
2017-10-24
When a stimulus is presented, its encoding is known to progress from low- to high-level features. How these features are decoded to produce perception is less clear, and most models assume that decoding follows the same low- to high-level hierarchy of encoding. There are also theories arguing for global precedence, reversed hierarchy, or bidirectional processing, but they are descriptive without quantitative comparison with human perception. Moreover, observers often inspect different parts of a scene sequentially to form overall perception, suggesting that perceptual decoding requires working memory, yet few models consider how working-memory properties may affect decoding hierarchy. We probed decoding hierarchy by comparing absolute judgments of single orientations and relative/ordinal judgments between two sequentially presented orientations. We found that lower-level, absolute judgments failed to account for higher-level, relative/ordinal judgments. However, when ordinal judgment was used to retrospectively decode memory representations of absolute orientations, striking aspects of absolute judgments, including the correlation and forward/backward aftereffects between two reported orientations in a trial, were explained. We propose that the brain prioritizes decoding of higher-level features because they are more behaviorally relevant, and more invariant and categorical, and thus easier to specify and maintain in noisy working memory, and that more reliable higher-level decoding constrains less reliable lower-level decoding. Published under the PNAS license.
Contact angles on stretched solids
Mensink, Liz; Snoeijer, Jacco
2017-11-01
The surface energy of solid interfaces plays a central role in wetting, as they dictate the liquid contact angle. Yet, it has been challenging to measure the solid surface energies independently, without making use of Young's law. Here we present Molecular Dynamics (MD) simulations by which we measure the surface properties for all interfaces, including the solids. We observe change in contact angles upon stretching the solid substrates, showing that the surface energy is actually strain dependent. This is clear evidence of the so-called Shuttleworth effect, making it necessary to distinguish surface energy from surface tension. We discuss how this effect gives rise to a new class of elasto-capillary phenomena. ERC Consolidator Grant No. 616918.
Contact Dermatitis in Pediatrics.
Pelletier, Janice L; Perez, Caroline; Jacob, Sharon E
2016-08-01
Contact dermatitis is an umbrella term that describes the skin's reaction to contacted noxious or allergenic substances. The two main categories of contact dermatitis are irritant type and allergic type. This review discusses the signs, symptoms, causes, and complications of contact dermatitis. It addresses the testing, treatment, and prevention of contact dermatitis. Proper management of contact dermatitis includes avoidance measures for susceptible children. Implementation of a nickel directive (regulating the use of nickel in jewelry and other products that come into contact with the skin) could further reduce exposure to the most common allergens in the pediatric population. [Pediatr Ann. 2016;45(8):e287-e292.]. Copyright 2016, SLACK Incorporated.
An Improved Unscented Kalman Filter Based Decoder for Cortical Brain-Machine Interfaces.
Li, Simin; Li, Jie; Li, Zheng
2016-01-01
Brain-machine interfaces (BMIs) seek to connect brains with machines or computers directly, for application in areas such as prosthesis control. For this application, the accuracy of the decoding of movement intentions is crucial. We aim to improve accuracy by designing a better encoding model of primary motor cortical activity during hand movements and combining this with decoder engineering refinements, resulting in a new unscented Kalman filter based decoder, UKF2, which improves upon our previous unscented Kalman filter decoder, UKF1. The new encoding model includes novel acceleration magnitude, position-velocity interaction, and target-cursor-distance features (the decoder does not require target position as input, it is decoded). We add a novel probabilistic velocity threshold to better determine the user's intent to move. We combine these improvements with several other refinements suggested by others in the field. Data from two Rhesus monkeys indicate that the UKF2 generates offline reconstructions of hand movements (mean CC 0.851) significantly more accurately than the UKF1 (0.833) and the popular position-velocity Kalman filter (0.812). The encoding model of the UKF2 could predict the instantaneous firing rate of neurons (mean CC 0.210), given kinematic variables and past spiking, better than the encoding models of these two decoders (UKF1: 0.138, p-v Kalman: 0.098). In closed-loop experiments where each monkey controlled a computer cursor with each decoder in turn, the UKF2 facilitated faster task completion (mean 1.56 s vs. 2.05 s) and higher Fitts's Law bit rate (mean 0.738 bit/s vs. 0.584 bit/s) than the UKF1. These results suggest that the modeling and decoder engineering refinements of the UKF2 improve decoding performance. We believe they can be used to enhance other decoders as well.
Contact mechanics: contact area and interfacial separation from small contact to full contact
International Nuclear Information System (INIS)
Yang, C; Persson, B N J
2008-01-01
We present a molecular dynamics study of the contact between a rigid solid with a randomly rough surface and an elastic block with a flat surface. The numerical calculations mainly focus on the contact area and the interfacial separation from small contact (low load) to full contact (high load). For a small load the contact area varies linearly with the load and the interfacial separation depends logarithmically on the load. For a high load the contact area approaches the nominal contact area (i.e. complete contact), and the interfacial separation approaches zero. The numerical results have been compared with analytical theory and experimental results. They are in good agreement with each other. The present findings may be very important for soft solids, e.g. rubber, or for very smooth surfaces, where complete contact can be reached at moderately high loads without plastic deformation of the solids
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
Lin, Shu
1998-01-01
A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and
Research on coding and decoding method for digital levels
Energy Technology Data Exchange (ETDEWEB)
Tu Lifen; Zhong Sidong
2011-01-20
A new coding and decoding method for digital levels is proposed. It is based on an area-array CCD sensor and adopts mixed coding technology. By taking advantage of redundant information in a digital image signal, the contradiction that the field of view and image resolution restrict each other in a digital level measurement is overcome, and the geodetic leveling becomes easier. The experimental results demonstrate that the uncertainty of measurement is 1mm when the measuring range is between 2m and 100m, which can meet practical needs.
Research on coding and decoding method for digital levels.
Tu, Li-fen; Zhong, Si-dong
2011-01-20
A new coding and decoding method for digital levels is proposed. It is based on an area-array CCD sensor and adopts mixed coding technology. By taking advantage of redundant information in a digital image signal, the contradiction that the field of view and image resolution restrict each other in a digital level measurement is overcome, and the geodetic leveling becomes easier. The experimental results demonstrate that the uncertainty of measurement is 1 mm when the measuring range is between 2 m and 100 m, which can meet practical needs.
Central Decoding for Multiple Description Codes based on Domain Partitioning
Directory of Open Access Journals (Sweden)
M. Spiertz
2006-01-01
Full Text Available Multiple Description Codes (MDC can be used to trade redundancy against packet loss resistance for transmitting data over lossy diversity networks. In this work we focus on MD transform coding based on domain partitioning. Compared to Vaishampayan’s quantizer based MDC, domain based MD coding is a simple approach for generating different descriptions, by using different quantizers for each description. Commonly, only the highest rate quantizer is used for reconstruction. In this paper we investigate the benefit of using the lower rate quantizers to enhance the reconstruction quality at decoder side. The comparison is done on artificial source data and on image data.
Optimized iterative decoding method for TPC coded CPM
Ma, Yanmin; Lai, Penghui; Wang, Shilian; Xie, Shunqin; Zhang, Wei
2018-05-01
Turbo Product Code (TPC) coded Continuous Phase Modulation (CPM) system (TPC-CPM) has been widely used in aeronautical telemetry and satellite communication. This paper mainly investigates the improvement and optimization on the TPC-CPM system. We first add the interleaver and deinterleaver to the TPC-CPM system, and then establish an iterative system to iteratively decode. However, the improved system has a poor convergence ability. To overcome this issue, we use the Extrinsic Information Transfer (EXIT) analysis to find the optimal factors for the system. The experiments show our method is efficient to improve the convergence performance.
Synthesizer for decoding a coded short wave length irradiation
International Nuclear Information System (INIS)
1976-01-01
The system uses point irradiation source, typically an X-ray emitter, which illuminates a three dimensional object consisting of a set of parallel planes, each of which acts as a source of coded information. The secondary source images are superimposed on a common flat screen. The decoding system comprises an imput light-screen detector, a picture screen amplifier, a beam deflector, on output picture screen, an optical focussing unit including three lenses, a masking unit, an output light screen detector and a video signal reproduction unit of cathode ray tube from, or similar, to create a three dimensional image of the object. (G.C.)
New decoding methods of interleaved burst error-correcting codes
Nakano, Y.; Kasahara, M.; Namekawa, T.
1983-04-01
A probabilistic method of single burst error correction, using the syndrome correlation of subcodes which constitute the interleaved code, is presented. This method makes it possible to realize a high capability of burst error correction with less decoding delay. By generalizing this method it is possible to obtain probabilistic method of multiple (m-fold) burst error correction. After estimating the burst error positions using syndrome correlation of subcodes which are interleaved m-fold burst error detecting codes, this second method corrects erasure errors in each subcode and m-fold burst errors. The performance of these two methods is analyzed via computer simulation, and their effectiveness is demonstrated.
Video semaphore decoding for free-space optical communication
Last, Matthew; Fisher, Brian; Ezekwe, Chinwuba; Hubert, Sean M.; Patel, Sheetal; Hollar, Seth; Leibowitz, Brian S.; Pister, Kristofer S. J.
2001-04-01
Using teal-time image processing we have demonstrated a low bit-rate free-space optical communication system at a range of more than 20km with an average optical transmission power of less than 2mW. The transmitter is an autonomous one cubic inch microprocessor-controlled sensor node with a laser diode output. The receiver is a standard CCD camera with a 1-inch aperture lens, and both hardware and software implementations of the video semaphore decoding algorithm. With this system sensor data can be reliably transmitted 21 km form San Francisco to Berkeley.
A Novel Modified Algorithm with Reduced Complexity LDPC Code Decoder
Directory of Open Access Journals (Sweden)
Song Yang
2014-10-01
Full Text Available A novel efficient decoding algorithm reduced the sum-product algorithm (SPA Complexity with LPDC code is proposed. Base on the hyperbolic tangent rule, modified the Check node update with two horizontal process, which have similar calculation, Motivated by the finding that sun- min (MS algorithm reduce the complexity reducing the approximation error in the horizontal process, simplify the information weight small part. Compared with the exiting approximations, the proposed method is less computational complexity than SPA algorithm. Simulation results show that the author algorithm can achieve performance very close SPA.
Benkhelifa, Fatma
2016-08-29
In this paper, we investigate the simultaneous wireless information and power transfer (SWIPT) in a multiple-input multiple-output (MIMO) decode-and-forward (DF) relay system where the relay is an energy harvesting (EH) multi-antenna node equipped with an EH receiver and an information decoding (ID) receiver. The relay harvests the energy from the radio frequency (RF) signals sent by the source and uses it to forward the signals to the destination. The main objective in this paper is to maximize the achievable transmission rate of the overall link by optimizing the source/relay precoders. First, we study an upper bound on the maximum achievable rate where we assume that the EH and ID receivers operate simultaneously and have access to the whole power of the received signals. Afterwards, we study two practical schemes, which are the power splitting (PS) and time switching (TS) schemes, where the ID and EH receivers have partial access to the power or duration of the received signals. For each scheme, we have studied the complexity and the performance comparison. In addition, we considered the case of the imperfect channel estimation error and we have observed its impact on the achievable end-to-end rate and the harvested energy at the relay. © 1972-2012 IEEE.
Abediseid, Walid
2012-01-01
complexity of sphere decoding for the quasi- static, lattice space-time (LAST) coded MIMO channel. Specifically, we drive an upper bound of the tail distribution of the decoder's computational complexity. We show that when the computational complexity exceeds
Response function of a moving contact line
Perrin, H.; Belardinelli, D.; Sbragaglia, M.; Andreotti, B.
2018-04-01
The hydrodynamics of a liquid-vapor interface in contact with a heterogeneous surface is largely impacted by the presence of defects at the smaller scales. Such defects introduce morphological disturbances on the contact line and ultimately determine the force exerted on the wedge of liquid in contact with the surface. From the mathematical point of view, defects introduce perturbation modes, whose space-time evolution is governed by the interfacial hydrodynamic equations of the contact line. In this paper we derive the response function of the contact line to such generic perturbations. The contact line response may be used to design simplified one-dimensional time-dependent models accounting for the complexity of interfacial flows coupled to nanoscale defects, yet offering a more tractable mathematical framework to explore contact line motion through a disordered energy landscape.
Decoding and finding the minimum distance with Gröbner bases : history and new insights
Bulygin, S.; Pellikaan, G.R.; Woungang, I.; Misra, S.; Misra, S.C.
2010-01-01
In this chapter, we discuss decoding techniques and finding the minimum distance of linear codes with the use of Grobner bases. First, we give a historical overview of decoding cyclic codes via solving systems polynominal equations over finite fields. In particular, we mention papers of Cooper,.
Video coding and decoding devices and methods preserving ppg relevant information
2013-01-01
The present invention relates to a video encoding device (10) for encoding video data and a corresponding video decoding device, wherein during decoding PPG relevant information shall be preserved. For this purpose the video coding device (10) comprises a first encoder (20) for encoding input video
A Fully Parallel VLSI-implementation of the Viterbi Decoding Algorithm
DEFF Research Database (Denmark)
Sparsø, Jens; Jørgensen, Henrik Nordtorp; Paaske, Erik
1989-01-01
In this paper we describe the implementation of a K = 7, R = 1/2 single-chip Viterbi decoder intended to operate at 10-20 Mbit/sec. We propose a general, regular and area efficient floor-plan that is also suitable for implementation of decoders for codes with different generator polynomials...
Multi-Trial Guruswami–Sudan Decoding for Generalised Reed–Solomon Codes
DEFF Research Database (Denmark)
Nielsen, Johan Sebastian Rosenkilde; Zeh, Alexander
2013-01-01
An iterated refinement procedure for the Guruswami–Sudan list decoding algorithm for Generalised Reed–Solomon codes based on Alekhnovich’s module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list...
The Three Stages of Coding and Decoding in Listening Courses of College Japanese Specialty
Yang, Fang
2008-01-01
The main focus of research papers on listening teaching published in recent years is the theoretical meanings of decoding on the training of listening comprehension ability. Although in many research papers the bottom-up approach and top-down approach, information processing mode theory, are applied to illustrate decoding and to emphasize the…
A Parallel Decoding Algorithm for Short Polar Codes Based on Error Checking and Correcting
Pan, Xiaofei; Pan, Kegang; Ye, Zhan; Gong, Chao
2014-01-01
We propose a parallel decoding algorithm based on error checking and correcting to improve the performance of the short polar codes. In order to enhance the error-correcting capacity of the decoding algorithm, we first derive the error-checking equations generated on the basis of the frozen nodes, and then we introduce the method to check the errors in the input nodes of the decoder by the solutions of these equations. In order to further correct those checked errors, we adopt the method of modifying the probability messages of the error nodes with constant values according to the maximization principle. Due to the existence of multiple solutions of the error-checking equations, we formulate a CRC-aided optimization problem of finding the optimal solution with three different target functions, so as to improve the accuracy of error checking. Besides, in order to increase the throughput of decoding, we use a parallel method based on the decoding tree to calculate probability messages of all the nodes in the decoder. Numerical results show that the proposed decoding algorithm achieves better performance than that of some existing decoding algorithms with the same code length. PMID:25540813
Iterative channel decoding of FEC-based multiple-description codes.
Chang, Seok-Ho; Cosman, Pamela C; Milstein, Laurence B
2012-03-01
Multiple description coding has been receiving attention as a robust transmission framework for multimedia services. This paper studies the iterative decoding of FEC-based multiple description codes. The proposed decoding algorithms take advantage of the error detection capability of Reed-Solomon (RS) erasure codes. The information of correctly decoded RS codewords is exploited to enhance the error correction capability of the Viterbi algorithm at the next iteration of decoding. In the proposed algorithm, an intradescription interleaver is synergistically combined with the iterative decoder. The interleaver does not affect the performance of noniterative decoding but greatly enhances the performance when the system is iteratively decoded. We also address the optimal allocation of RS parity symbols for unequal error protection. For the optimal allocation in iterative decoding, we derive mathematical equations from which the probability distributions of description erasures can be generated in a simple way. The performance of the algorithm is evaluated over an orthogonal frequency-division multiplexing system. The results show that the performance of the multiple description codes is significantly enhanced.
The Contribution of Attentional Control and Working Memory to Reading Comprehension and Decoding
Arrington, C. Nikki; Kulesz, Paulina A.; Francis, David J.; Fletcher, Jack M.; Barnes, Marcia A.
2014-01-01
Little is known about how specific components of working memory, namely, attentional processes including response inhibition, sustained attention, and cognitive inhibition, are related to reading decoding and comprehension. The current study evaluated the relations of reading comprehension, decoding, working memory, and attentional control in…
Fast N-Gram Language Model Look-Ahead for Decoders With Static Pronunciation Prefix Trees
Huijbregts, M.A.H.; Ordelman, Roeland J.F.; de Jong, Franciska M.G.
2008-01-01
Decoders that make use of token-passing restrict their search space by various types of token pruning. With use of the Language Model Look-Ahead (LMLA) technique it is possible to increase the number of tokens that can be pruned without loss of decoding precision. Unfortunately, for token passing
Scaffolding Students’ Independent Decoding of Unfamiliar Text with a Prototype of an eBook-Feature
DEFF Research Database (Denmark)
Gissel, Stig Toke
2015-01-01
the relevant spelling patterns and in generalizing, in order to strengthen their decoding skills. The prototype was evaluated with Danish students in the second grade to see how and under what circumstances students can use the feature in ways that strengthen their decoding skills and support them in reading...
Hamilton, Stephen; Freed, Erin; Long, Debra L.
2016-01-01
The aim of this study was to examine predictions derived from a proposal about the relation between word-decoding skill and working memory capacity, called verbal efficiency theory. The theory states that poor word representations and slow decoding processes consume resources in working memory that would otherwise be used to execute high-level…
Horikawa, Tomoyasu; Kamitani, Yukiyasu
2017-01-01
Dreaming is generally thought to be generated by spontaneous brain activity during sleep with patterns common to waking experience. This view is supported by a recent study demonstrating that dreamed objects can be predicted from brain activity during sleep using statistical decoders trained with stimulus-induced brain activity. However, it remains unclear whether and how visual image features associated with dreamed objects are represented in the brain. In this study, we used a deep neural network (DNN) model for object recognition as a proxy for hierarchical visual feature representation, and DNN features for dreamed objects were analyzed with brain decoding of fMRI data collected during dreaming. The decoders were first trained with stimulus-induced brain activity labeled with the feature values of the stimulus image from multiple DNN layers. The decoders were then used to decode DNN features from the dream fMRI data, and the decoded features were compared with the averaged features of each object category calculated from a large-scale image database. We found that the feature values decoded from the dream fMRI data positively correlated with those associated with dreamed object categories at mid- to high-level DNN layers. Using the decoded features, the dreamed object category could be identified at above-chance levels by matching them to the averaged features for candidate categories. The results suggest that dreaming recruits hierarchical visual feature representations associated with objects, which may support phenomenal aspects of dream experience.
Decoding error-correcting codes with Gröbner bases
Bulygin, S.; Pellikaan, G.R.; Veldhuis, R.; Cronie, H.; Hoeksema, H.
2007-01-01
The decoding of arbitrary linear block codes is accomplished by solving a system of quadratic equations by means of Buchberger’s algorithm for finding a Gröbner basis. This generalizes the algorithm of Berlekamp-Massey for decoding Reed Solomon, Goppa and cyclic codes up to half the true minimum
Bounded distance decoding of linear error-correcting codes with Gröbner bases
Bulygin, S.; Pellikaan, G.R.
2009-01-01
The problem of bounded distance decoding of arbitrary linear codes using Gröbner bases is addressed. A new method is proposed, which is based on reducing an initial decoding problem to solving a certain system of polynomial equations over a finite field. The peculiarity of this system is that, when
A lossy graph model for delay reduction in generalized instantly decodable network coding
Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim
2014-01-01
, arising from lossy feedback events, when the expected decoding delay of XORing them among themselves or with other certain packets is lower than that expected when sending these packets separately. We compare the decoding delay performance of LG-IDNC and G
Error Recovery Properties and Soft Decoding of Quasi-Arithmetic Codes
Directory of Open Access Journals (Sweden)
Christine Guillemot
2007-08-01
Full Text Available This paper first introduces a new set of aggregated state models for soft-input decoding of quasi arithmetic (QA codes with a termination constraint. The decoding complexity with these models is linear with the sequence length. The aggregation parameter controls the tradeoff between decoding performance and complexity. It is shown that close-to-optimal decoding performance can be obtained with low values of the aggregation parameter, that is, with a complexity which is significantly reduced with respect to optimal QA bit/symbol models. The choice of the aggregation parameter depends on the synchronization recovery properties of the QA codes. This paper thus describes a method to estimate the probability mass function (PMF of the gain/loss of symbols following a single bit error (i.e., of the difference between the number of encoded and decoded symbols. The entropy of the gain/loss turns out to be the average amount of information conveyed by a length constraint on both the optimal and aggregated state models. This quantity allows us to choose the value of the aggregation parameter that will lead to close-to-optimal decoding performance. It is shown that the optimum position for the length constraint is not the last time instant of the decoding process. This observation leads to the introduction of a new technique for robust decoding of QA codes with redundancy which turns out to outperform techniques based on the concept of forbidden symbol.
Using convolutional decoding to improve time delay and phase estimation in digital communications
Ormesher, Richard C [Albuquerque, NM; Mason, John J [Albuquerque, NM
2010-01-26
The time delay and/or phase of a communication signal received by a digital communication receiver can be estimated based on a convolutional decoding operation that the communication receiver performs on the received communication signal. If the original transmitted communication signal has been spread according to a spreading operation, a corresponding despreading operation can be integrated into the convolutional decoding operation.
Padeliadu, Susana; Antoniou, Faye
2014-01-01
Experts widely consider decoding and fluency as the basis of reading comprehension, while at the same time consistently documenting problems in these areas as major characteristics of students with learning disabilities. However, scholars have developed most of the relevant research within phonologically deep languages, wherein decoding problems…
Tingerthal, John Steven
2013-01-01
Using case study methodology and autoethnographic methods, this study examines a process of curricular development known as "Decoding the Disciplines" (Decoding) by documenting the experience of its application in a construction engineering mechanics course. Motivated by the call to integrate what is known about teaching and learning…
Decoding facial blends of emotion: visual field, attentional and hemispheric biases.
Ross, Elliott D; Shayya, Luay; Champlain, Amanda; Monnot, Marilee; Prodan, Calin I
2013-12-01
Most clinical research assumes that modulation of facial expressions is lateralized predominantly across the right-left hemiface. However, social psychological research suggests that facial expressions are organized predominantly across the upper-lower face. Because humans learn to cognitively control facial expression for social purposes, the lower face may display a false emotion, typically a smile, to enable approach behavior. In contrast, the upper face may leak a person's true feeling state by producing a brief facial blend of emotion, i.e. a different emotion on the upper versus lower face. Previous studies from our laboratory have shown that upper facial emotions are processed preferentially by the right hemisphere under conditions of directed attention if facial blends of emotion are presented tachistoscopically to the mid left and right visual fields. This paper explores how facial blends are processed within the four visual quadrants. The results, combined with our previous research, demonstrate that lower more so than upper facial emotions are perceived best when presented to the viewer's left and right visual fields just above the horizontal axis. Upper facial emotions are perceived best when presented to the viewer's left visual field just above the horizontal axis under conditions of directed attention. Thus, by gazing at a person's left ear, which also avoids the social stigma of eye-to-eye contact, one's ability to decode facial expressions should be enhanced. Published by Elsevier Inc.
An Optimized Three-Level Design of Decoder Based on Nanoscale Quantum-Dot Cellular Automata
Seyedi, Saeid; Navimipour, Nima Jafari
2018-03-01
Quantum-dot Cellular Automata (QCA) has been potentially considered as a supersede to Complementary Metal-Oxide-Semiconductor (CMOS) because of its inherent advantages. Many QCA-based logic circuits with smaller feature size, improved operating frequency, and lower power consumption than CMOS have been offered. This technology works based on electron relations inside quantum-dots. Due to the importance of designing an optimized decoder in any digital circuit, in this paper, we design, implement and simulate a new 2-to-4 decoder based on QCA with low delay, area, and complexity. The logic functionality of the 2-to-4 decoder is verified using the QCADesigner tool. The results have shown that the proposed QCA-based decoder has high performance in terms of a number of cells, covered area, and time delay. Due to the lower clock pulse frequency, the proposed 2-to-4 decoder is helpful for building QCA-based sequential digital circuits with high performance.
Row Reduction Applied to Decoding of Rank Metric and Subspace Codes
DEFF Research Database (Denmark)
Puchinger, Sven; Nielsen, Johan Sebastian Rosenkilde; Li, Wenhui
2017-01-01
We show that decoding of ℓ-Interleaved Gabidulin codes, as well as list-ℓ decoding of Mahdavifar–Vardy (MV) codes can be performed by row reducing skew polynomial matrices. Inspired by row reduction of F[x] matrices, we develop a general and flexible approach of transforming matrices over skew...... polynomial rings into a certain reduced form. We apply this to solve generalised shift register problems over skew polynomial rings which occur in decoding ℓ-Interleaved Gabidulin codes. We obtain an algorithm with complexity O(ℓμ2) where μ measures the size of the input problem and is proportional...... to the code length n in the case of decoding. Further, we show how to perform the interpolation step of list-ℓ-decoding MV codes in complexity O(ℓn2), where n is the number of interpolation constraints....
Locating and decoding barcodes in fuzzy images captured by smart phones
Deng, Wupeng; Hu, Jiwei; Liu, Quan; Lou, Ping
2017-07-01
With the development of barcodes for commercial use, people's requirements for detecting barcodes by smart phone become increasingly pressing. The low quality of barcode image captured by mobile phone always affects the decoding and recognition rates. This paper focuses on locating and decoding EAN-13 barcodes in fuzzy images. We present a more accurate locating algorithm based on segment length and high fault-tolerant rate algorithm for decoding barcodes. Unlike existing approaches, location algorithm is based on the edge segment length of EAN -13 barcodes, while our decoding algorithm allows the appearance of fuzzy region in barcode image. Experimental results are performed on damaged, contaminated and scratched digital images, and provide a quite promising result for EAN -13 barcode location and decoding.
Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms
Directory of Open Access Journals (Sweden)
Ahmed Azouaoui
2012-01-01
Full Text Available A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms.
Full Text Available ... Cleveland. "This is far from the truth." Real People, Real Problems with Colored Contact Lenses Julian: Teenager ... about the members of the eye-care team . Consumer warning about the improper use of colored contact ...
Full Text Available ... One Use Facts About Colored Contacts and Halloween Safety Colored Contact Lens Facts Over-the-Counter Costume ... new application of artificial intelligence shows whether a patient’s eyes point to high blood pressure or risk ...
Full Text Available ... Costume Contacts May Contain Chemicals Harmful to Eyes Four Ways Over-the-Counter Costume Contact Lenses Can ... was in severe pain and on medication for four weeks, and couldn't see well enough to ...
Full Text Available ... sell contacts without a prescription are breaking the law, and may be fined $11,000 per violation. " ... wear any kind of contact lens. In Butler's case, the lenses caused an infection and left her ...
Full Text Available ... Hazard: The Hidden Dangers of Buying Decorative Contact Lenses Without a Prescription Leer en Español: Peligros asociados ... truth." Real People, Real Problems with Colored Contact Lenses Julian: Teenager Blinded In One Eye By Non- ...
... Hazard: The Hidden Dangers of Buying Decorative Contact Lenses Without a Prescription Leer en Español: Peligros asociados ... truth." Real People, Real Problems with Colored Contact Lenses Julian: Teenager Blinded In One Eye By Non- ...
Full Text Available ... Cleveland. "This is far from the truth." Real People, Real Problems with Colored Contact Lenses Julian: Teenager ... the lenses. Never share contact lenses with another person. Get follow up exams with your eye care ...
Federal Laboratory Consortium — Description:The FTA32 goniometer provides video-based contact angle and surface tension measurement. Contact angles are measured by fitting a mathematical expression...
Full Text Available ... like a suction cup." Halloween is a popular time for people to use colored contact lenses to ... wear costume contact lenses for Halloween or any time of year, follow these guidelines: Get an eye ...
Full Text Available ... glow-in-the-dark lizard lenses, costume contacts can certainly add a spooky, eye-popping touch. But ... consideration as a standard contact lens because they can be purchased over-the-counter or on the ...
Full Text Available ... contact lenses , from the U.S. Food and Drug Administration (FDA). Are the colored lenses you are considering ... Follow The Academy Professionals: Education Guidelines News Multimedia Public & Patients: Contact Us About the Academy Jobs at ...
Full Text Available ... not require the same level of care or consideration as a standard contact lens because they can ... sell contacts without a prescription are breaking the law, and may be fined $11,000 per violation. " ...
This picture shows a skin inflammation (dermatitis) caused by contact with a material that causes an allergic reaction in this person. Contact dermatitis is a relatively common condition, and can be caused ...
Contact materials for nanoelectronics
Alshareef, Husam N.; Quevedo-Ló pez, Manuel Angel Quevedo; Majhi, Prashant
2011-01-01
In this article, we review current research activities in contact material development for electronic and nanoelectronic devices. A fundamental issue in contact materials research is to understand and control interfacial reactions and phenomena
Full Text Available ... the United States. All contact lenses are medical devices that require a prescription and proper fitting by an eye-care professional. Retailers that sell contacts without a ...
Full Text Available ... prescription. Follow the contact lens care directions for cleaning, disinfecting, and wearing the lenses. Never share contact ... with Industry Medical Disclaimer Privacy Policy Terms of Service For Advertisers For Media Ophthalmology Job Center © American ...
Iterative Decoding for an Optical CDMA based Laser communication System
International Nuclear Information System (INIS)
Kim, Jin Young; Kim, Eun Cheol; Cha, Jae Sang
2008-01-01
An optical CDMA(code division multiple access)based Laser communication system has attracted much attention since it requires minimal optical Laser signal processing and it is virtually delay free, while from the theoretical point of view, its performance depends on the auto and cross correlation properties of employed sequences. Various kinds of channel coding schemes for optical CDMA based Laser communication systems have been proposed and analyzed to compensate nonideal channel and receiver conditions in impaired photon channels. In this paper, we propose and analyze an iterative decoding of optical CDMA based Laser communication signals for both shot noise limited and thermal noise limited systems. It is assumed that optical channel is an intensity modulated (IM)channel and direct detection scheme is employed to detect the received optical signal. The performance is evaluated in terms of bit error probability and throughput. It is demonstrated that the BER and throughput performance is substantially improved with interleaver length for a fixed code rate and with alphabet size of PPM (pulse position modulation). Also, the BER and throughput performance is significantly enhanced with the number of iterations for decoding process. The results in this paper can be applied to the optical CDMA based Laser communication network with multiple access applications
Neural signatures of attention: insights from decoding population activity patterns.
Sapountzis, Panagiotis; Gregoriou, Georgia G
2018-01-01
Understanding brain function and the computations that individual neurons and neuronal ensembles carry out during cognitive functions is one of the biggest challenges in neuroscientific research. To this end, invasive electrophysiological studies have provided important insights by recording the activity of single neurons in behaving animals. To average out noise, responses are typically averaged across repetitions and across neurons that are usually recorded on different days. However, the brain makes decisions on short time scales based on limited exposure to sensory stimulation by interpreting responses of populations of neurons on a moment to moment basis. Recent studies have employed machine-learning algorithms in attention and other cognitive tasks to decode the information content of distributed activity patterns across neuronal ensembles on a single trial basis. Here, we review results from studies that have used pattern-classification decoding approaches to explore the population representation of cognitive functions. These studies have offered significant insights into population coding mechanisms. Moreover, we discuss how such advances can aid the development of cognitive brain-computer interfaces.
Iterative Decoding for an Optical CDMA based Laser communication System
Energy Technology Data Exchange (ETDEWEB)
Kim, Jin Young; Kim, Eun Cheol [Kwangwoon Univ., Seoul (Korea, Republic of); Cha, Jae Sang [Seoul National Univ. of Technology, Seoul (Korea, Republic of)
2008-11-15
An optical CDMA(code division multiple access)based Laser communication system has attracted much attention since it requires minimal optical Laser signal processing and it is virtually delay free, while from the theoretical point of view, its performance depends on the auto and cross correlation properties of employed sequences. Various kinds of channel coding schemes for optical CDMA based Laser communication systems have been proposed and analyzed to compensate nonideal channel and receiver conditions in impaired photon channels. In this paper, we propose and analyze an iterative decoding of optical CDMA based Laser communication signals for both shot noise limited and thermal noise limited systems. It is assumed that optical channel is an intensity modulated (IM)channel and direct detection scheme is employed to detect the received optical signal. The performance is evaluated in terms of bit error probability and throughput. It is demonstrated that the BER and throughput performance is substantially improved with interleaver length for a fixed code rate and with alphabet size of PPM (pulse position modulation). Also, the BER and throughput performance is significantly enhanced with the number of iterations for decoding process. The results in this paper can be applied to the optical CDMA based Laser communication network with multiple access applications.
Discrete decoding based ultrafast multidimensional nuclear magnetic resonance spectroscopy
International Nuclear Information System (INIS)
Wei, Zhiliang; Lin, Liangjie; Ye, Qimiao; Li, Jing; Cai, Shuhui; Chen, Zhong
2015-01-01
The three-dimensional (3D) nuclear magnetic resonance (NMR) spectroscopy constitutes an important and powerful tool in analyzing chemical and biological systems. However, the abundant 3D information arrives at the expense of long acquisition times lasting hours or even days. Therefore, there has been a continuous interest in developing techniques to accelerate recordings of 3D NMR spectra, among which the ultrafast spatiotemporal encoding technique supplies impressive acquisition speed by compressing a multidimensional spectrum in a single scan. However, it tends to suffer from tradeoffs among spectral widths in different dimensions, which deteriorates in cases of NMR spectroscopy with more dimensions. In this study, the discrete decoding is proposed to liberate the ultrafast technique from tradeoffs among spectral widths in different dimensions by focusing decoding on signal-bearing sites. For verifying its feasibility and effectiveness, we utilized the method to generate two different types of 3D spectra. The proposed method is also applicable to cases with more than three dimensions, which, based on the experimental results, may widen applications of the ultrafast technique
Discrete decoding based ultrafast multidimensional nuclear magnetic resonance spectroscopy
Wei, Zhiliang; Lin, Liangjie; Ye, Qimiao; Li, Jing; Cai, Shuhui; Chen, Zhong
2015-07-01
The three-dimensional (3D) nuclear magnetic resonance (NMR) spectroscopy constitutes an important and powerful tool in analyzing chemical and biological systems. However, the abundant 3D information arrives at the expense of long acquisition times lasting hours or even days. Therefore, there has been a continuous interest in developing techniques to accelerate recordings of 3D NMR spectra, among which the ultrafast spatiotemporal encoding technique supplies impressive acquisition speed by compressing a multidimensional spectrum in a single scan. However, it tends to suffer from tradeoffs among spectral widths in different dimensions, which deteriorates in cases of NMR spectroscopy with more dimensions. In this study, the discrete decoding is proposed to liberate the ultrafast technique from tradeoffs among spectral widths in different dimensions by focusing decoding on signal-bearing sites. For verifying its feasibility and effectiveness, we utilized the method to generate two different types of 3D spectra. The proposed method is also applicable to cases with more than three dimensions, which, based on the experimental results, may widen applications of the ultrafast technique.
Artificial spatiotemporal touch inputs reveal complementary decoding in neocortical neurons.
Oddo, Calogero M; Mazzoni, Alberto; Spanne, Anton; Enander, Jonas M D; Mogensen, Hannes; Bengtsson, Fredrik; Camboni, Domenico; Micera, Silvestro; Jörntell, Henrik
2017-04-04
Investigations of the mechanisms of touch perception and decoding has been hampered by difficulties in achieving invariant patterns of skin sensor activation. To obtain reproducible spatiotemporal patterns of activation of sensory afferents, we used an artificial fingertip equipped with an array of neuromorphic sensors. The artificial fingertip was used to transduce real-world haptic stimuli into spatiotemporal patterns of spikes. These spike patterns were delivered to the skin afferents of the second digit of rats via an array of stimulation electrodes. Combined with low-noise intra- and extracellular recordings from neocortical neurons in vivo, this approach provided a previously inaccessible high resolution analysis of the representation of tactile information in the neocortical neuronal circuitry. The results indicate high information content in individual neurons and reveal multiple novel neuronal tactile coding features such as heterogeneous and complementary spatiotemporal input selectivity also between neighboring neurons. Such neuronal heterogeneity and complementariness can potentially support a very high decoding capacity in a limited population of neurons. Our results also indicate a potential neuroprosthetic approach to communicate with the brain at a very high resolution and provide a potential novel solution for evaluating the degree or state of neurological disease in animal models.
Decoding Problem Gamblers' Signals: A Decision Model for Casino Enterprises.
Ifrim, Sandra
2015-12-01
The aim of the present study is to offer a validated decision model for casino enterprises. The model enables those users to perform early detection of problem gamblers and fulfill their ethical duty of social cost minimization. To this end, the interpretation of casino customers' nonverbal communication is understood as a signal-processing problem. Indicators of problem gambling recommended by Delfabbro et al. (Identifying problem gamblers in gambling venues: final report, 2007) are combined with Viterbi algorithm into an interdisciplinary model that helps decoding signals emitted by casino customers. Model output consists of a historical path of mental states and cumulated social costs associated with a particular client. Groups of problem and non-problem gamblers were simulated to investigate the model's diagnostic capability and its cost minimization ability. Each group consisted of 26 subjects and was subsequently enlarged to 100 subjects. In approximately 95% of the cases, mental states were correctly decoded for problem gamblers. Statistical analysis using planned contrasts revealed that the model is relatively robust to the suppression of signals performed by casino clientele facing gambling problems as well as to misjudgments made by staff regarding the clients' mental states. Only if the last mentioned source of error occurs in a very pronounced manner, i.e. judgment is extremely faulty, cumulated social costs might be distorted.
Hardwarearchitektur für einen universellen LDPC Decoder
Directory of Open Access Journals (Sweden)
C. Beuschel
2009-05-01
Full Text Available Im vorliegenden Beitrag wird eine universelle Decoderarchitektur für einen Low-Density Parity-Check (LDPC Code Decoder vorgestellt. Anders als bei den in der Literatur häufig beschriebenen Architekturen für strukturierte Codes ist die hier vorgestellte Architektur frei programmierbar, so dass jeder beliebige LDPC Code durch eine Änderung der Initialisierung des Speichers für die Prüfmatrix mit derselben Hardware decodiert werden kann. Die größte Herausforderung beim Entwurf von teilparallelen LDPC Decoder Architekturen liegt im konfliktfreien Datenaustausch zwischen mehreren parallelen Speichern und Berechnungseinheiten, wozu ein Mapping und Scheduling Algorithmus benötigt wird. Der hier vorgestellte Algorithmus stützt sich auf Graphentheorie und findet für jeden beliebigen LDPC Code eine für die Architektur optimale Lösung. Damit sind keine Wartezyklen notwendig und die Parallelität der Architektur wird zu jedem Zeitpunkt voll ausgenutzt.
Frame Decoder for Consultative Committee for Space Data Systems (CCSDS)
Reyes, Miguel A. De Jesus
2014-01-01
GNU Radio is a free and open source development toolkit that provides signal processing to implement software radios. It can be used with low-cost external RF hardware to create software defined radios, or without hardware in a simulation-like environment. GNU Radio applications are primarily written in Python and C++. The Universal Software Radio Peripheral (USRP) is a computer-hosted software radio designed by Ettus Research. The USRP connects to a host computer via high-speed Gigabit Ethernet. Using the open source Universal Hardware Driver (UHD), we can run GNU Radio applications using the USRP. An SDR is a "radio in which some or all physical layer functions are software defined"(IEEE Definition). A radio is any kind of device that wirelessly transmits or receives radio frequency (RF) signals in the radio frequency. An SDR is a radio communication system where components that have been typically implemented in hardware are implemented in software. GNU Radio has a generic packet decoder block that is not optimized for CCSDS frames. Using this generic packet decoder will add bytes to the CCSDS frames and will not permit for bit error correction using Reed-Solomon. The CCSDS frames consist of 256 bytes, including a 32-bit sync marker (0x1ACFFC1D). This frames are generated by the Space Data Processor and GNU Radio will perform the modulation and framing operations, including frame synchronization.
Mapping of MPEG-4 decoding on a flexible architecture platform
van der Tol, Erik B.; Jaspers, Egbert G.
2001-12-01
In the field of consumer electronics, the advent of new features such as Internet, games, video conferencing, and mobile communication has triggered the convergence of television and computers technologies. This requires a generic media-processing platform that enables simultaneous execution of very diverse tasks such as high-throughput stream-oriented data processing and highly data-dependent irregular processing with complex control flows. As a representative application, this paper presents the mapping of a Main Visual profile MPEG-4 for High-Definition (HD) video onto a flexible architecture platform. A stepwise approach is taken, going from the decoder application toward an implementation proposal. First, the application is decomposed into separate tasks with self-contained functionality, clear interfaces, and distinct characteristics. Next, a hardware-software partitioning is derived by analyzing the characteristics of each task such as the amount of inherent parallelism, the throughput requirements, the complexity of control processing, and the reuse potential over different applications and different systems. Finally, a feasible implementation is proposed that includes amongst others a very-long-instruction-word (VLIW) media processor, one or more RISC processors, and some dedicated processors. The mapping study of the MPEG-4 decoder proves the flexibility and extensibility of the media-processing platform. This platform enables an effective HW/SW co-design yielding a high performance density.
A method for decoding the neurophysiological spike-response transform.
Stern, Estee; García-Crescioni, Keyla; Miller, Mark W; Peskin, Charles S; Brezina, Vladimir
2009-11-15
Many physiological responses elicited by neuronal spikes-intracellular calcium transients, synaptic potentials, muscle contractions-are built up of discrete, elementary responses to each spike. However, the spikes occur in trains of arbitrary temporal complexity, and each elementary response not only sums with previous ones, but can itself be modified by the previous history of the activity. A basic goal in system identification is to characterize the spike-response transform in terms of a small number of functions-the elementary response kernel and additional kernels or functions that describe the dependence on previous history-that will predict the response to any arbitrary spike train. Here we do this by developing further and generalizing the "synaptic decoding" approach of Sen et al. (1996). Given the spike times in a train and the observed overall response, we use least-squares minimization to construct the best estimated response and at the same time best estimates of the elementary response kernel and the other functions that characterize the spike-response transform. We avoid the need for any specific initial assumptions about these functions by using techniques of mathematical analysis and linear algebra that allow us to solve simultaneously for all of the numerical function values treated as independent parameters. The functions are such that they may be interpreted mechanistically. We examine the performance of the method as applied to synthetic data. We then use the method to decode real synaptic and muscle contraction transforms.
Decoding rule search domain in the left inferior frontal gyrus
Babcock, Laura; Vallesi, Antonino
2018-01-01
Traditionally, the left hemisphere has been thought to extract mainly verbal patterns of information, but recent evidence has shown that the left Inferior Frontal Gyrus (IFG) is active during inductive reasoning in both the verbal and spatial domains. We aimed to understand whether the left IFG supports inductive reasoning in a domain-specific or domain-general fashion. To do this we used Multi-Voxel Pattern Analysis to decode the representation of domain during a rule search task. Thirteen participants were asked to extract the rule underlying streams of letters presented in different spatial locations. Each rule was either verbal (letters forming words) or spatial (positions forming geometric figures). Our results show that domain was decodable in the left prefrontal cortex, suggesting that this region represents domain-specific information, rather than processes common to the two domains. A replication study with the same participants tested two years later confirmed these findings, though the individual representations changed, providing evidence for the flexible nature of representations. This study extends our knowledge on the neural basis of goal-directed behaviors and on how information relevant for rule extraction is flexibly mapped in the prefrontal cortex. PMID:29547623
Successful decoding of famous faces in the fusiform face area.
Directory of Open Access Journals (Sweden)
Vadim Axelrod
Full Text Available What are the neural mechanisms of face recognition? It is believed that the network of face-selective areas, which spans the occipital, temporal, and frontal cortices, is important in face recognition. A number of previous studies indeed reported that face identity could be discriminated based on patterns of multivoxel activity in the fusiform face area and the anterior temporal lobe. However, given the difficulty in localizing the face-selective area in the anterior temporal lobe, its role in face recognition is still unknown. Furthermore, previous studies limited their analysis to occipito-temporal regions without testing identity decoding in more anterior face-selective regions, such as the amygdala and prefrontal cortex. In the current high-resolution functional Magnetic Resonance Imaging study, we systematically examined the decoding of the identity of famous faces in the temporo-frontal network of face-selective and adjacent non-face-selective regions. A special focus has been put on the face-area in the anterior temporal lobe, which was reliably localized using an optimized scanning protocol. We found that face-identity could be discriminated above chance level only in the fusiform face area. Our results corroborate the role of the fusiform face area in face recognition. Future studies are needed to further explore the role of the more recently discovered anterior face-selective areas in face recognition.
... There is a risk of eye infection from bacteria in swimming pool water, hot tubs, lakes and the ocean Replace your contact lens storage case every 3 months or as directed by your eye care professional. Other Risks of Contact Lenses Other risks of contact lenses include pink eye ( ...
Hydrogenation of passivated contacts
Energy Technology Data Exchange (ETDEWEB)
Nemeth, William; Yuan, Hao-Chih; LaSalvia, Vincenzo; Stradins, Pauls; Page, Matthew R.
2018-03-06
Methods of hydrogenation of passivated contacts using materials having hydrogen impurities are provided. An example method includes applying, to a passivated contact, a layer of a material, the material containing hydrogen impurities. The method further includes subsequently annealing the material and subsequently removing the material from the passivated contact.
Mixed Lubricated Line Contacts
Faraon, I.C.
2005-01-01
The present work deals with friction in mixed lubricated line contacts. Components in systems are becoming smaller and due to, for instance power transmitted, partial contact may occur. In industrial applications, friction between the moving contacting surfaces cannot be avoided, therefore it is
New Cosmetic Contact Allergens
Directory of Open Access Journals (Sweden)
An Goossens
2015-02-01
Full Text Available Allergic and photo-allergic contact dermatitis, and immunologic contact urticaria are potential immune-mediated adverse effects from cosmetics. Fragrance components and preservatives are certainly the most frequently observed allergens; however, all ingredients must be considered when investigating for contact allergy.
Campbell, Darren; Carnell, Sarah Maria; Eden, Russell John
2013-05-01
Contact angle, as a representative measure of surface wettability, is often employed to interpret contact lens surface properties. The literature is often contradictory and can lead to confusion. This literature review is part of a series regarding the analysis of hydrogel contact lenses using contact angle techniques. Here we present an overview of contact angle terminology, methodology, and analysis. Having discussed this background material, subsequent parts of the series will discuss the analysis of contact lens contact angles and evaluate differences in published laboratory results. The concepts of contact angle, wettability and wetting are presented as an introduction. Contact angle hysteresis is outlined and highlights the advantages in using dynamic analytical techniques over static methods. The surface free energy of a material illustrates how contact angle analysis is capable of providing supplementary surface characterization. Although single values are able to distinguish individual material differences, surface free energy and dynamic methods provide an improved understanding of material behavior. The frequently used sessile drop, captive bubble, and Wilhelmy plate techniques are discussed. Their use as both dynamic and static methods, along with the advantages and disadvantages of each technique, is explained. No single contact angle technique fully characterizes the wettability of a material surface, and the application of complimenting methods allows increased characterization. At present, there is not an ISO standard method designed for soft materials. It is important that each contact angle technique has a standard protocol, as small protocol differences between laboratories often contribute to a variety of published data that are not easily comparable.
International Nuclear Information System (INIS)
Huang Hai-Ping
2015-01-01
The statistical physics properties of low-density parity-check codes for the binary symmetric channel are investigated as a spin glass problem with multi-spin interactions and quenched random fields by the cavity method. By evaluating the entropy function at the Nishimori temperature, we find that irregular constructions with heterogeneous degree distribution of check (bit) nodes have higher decoding thresholds compared to regular counterparts with homogeneous degree distribution. We also show that the instability of the mean-field calculation takes place only after the entropy crisis, suggesting the presence of a frozen glassy phase at low temperatures. When no prior knowledge of channel noise is assumed (searching for the ground state), we find that a reinforced strategy on normal belief propagation will boost the decoding threshold to a higher value than the normal belief propagation. This value is close to the dynamical transition where all local search heuristics fail to identify the true message (codeword or the ferromagnetic state). After the dynamical transition, the number of metastable states with larger energy density (than the ferromagnetic state) becomes exponentially numerous. When the noise level of the transmission channel approaches the static transition point, there starts to exist exponentially numerous codewords sharing the identical ferromagnetic energy. (condensed matter: electronic structure, electrical, magnetic, and optical properties)
Sensing with Superconducting Point Contacts
Directory of Open Access Journals (Sweden)
Argo Nurbawono
2012-05-01
Full Text Available Superconducting point contacts have been used for measuring magnetic polarizations, identifying magnetic impurities, electronic structures, and even the vibrational modes of small molecules. Due to intrinsically small energy scale in the subgap structures of the supercurrent determined by the size of the superconducting energy gap, superconductors provide ultrahigh sensitivities for high resolution spectroscopies. The so-called Andreev reflection process between normal metal and superconductor carries complex and rich information which can be utilized as powerful sensor when fully exploited. In this review, we would discuss recent experimental and theoretical developments in the supercurrent transport through superconducting point contacts and their relevance to sensing applications, and we would highlight their current issues and potentials. A true utilization of the method based on Andreev reflection analysis opens up possibilities for a new class of ultrasensitive sensors.
Joint Carrier-Phase Synchronization and LDPC Decoding
Simon, Marvin; Valles, Esteban
2009-01-01
A method has been proposed to increase the degree of synchronization of a radio receiver with the phase of a suppressed carrier signal modulated with a binary- phase-shift-keying (BPSK) or quaternary- phase-shift-keying (QPSK) signal representing a low-density parity-check (LDPC) code. This method is an extended version of the method described in Using LDPC Code Constraints to Aid Recovery of Symbol Timing (NPO-43112), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 54. Both methods and the receiver architectures in which they would be implemented belong to a class of timing- recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. The proposed method calls for the use of what is known in the art as soft decision feedback to remove the modulation from a replica of the incoming signal prior to feeding this replica to a phase-locked loop (PLL) or other carrier-tracking stage in the receiver. Soft decision feedback refers to suitably processed versions of intermediate results of iterative computations involved in the LDPC decoding process. Unlike a related prior method in which hard decision feedback (the final sequence of decoded symbols) is used to remove the modulation, the proposed method does not require estimation of the decoder error probability. In a basic digital implementation of the proposed method, the incoming signal (having carrier phase theta theta (sub c) plus noise would first be converted to inphase (I) and quadrature (Q) baseband signals by mixing it with I and Q signals at the carrier frequency [wc/(2 pi)] generated by a local oscillator. The resulting demodulated signals would be processed through one-symbol-period integrate and- dump filters, the outputs of which would be sampled and held, then multiplied by a soft-decision version of the baseband modulated signal. The resulting I and Q products consist of terms proportional to the cosine
Low Complexity List Decoding for Polar Codes with Multiple CRC Codes
Directory of Open Access Journals (Sweden)
Jong-Hwan Kim
2017-04-01
Full Text Available Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity. Since the development of polar codes, there have been many studies to improve their finite-length performance. As a result, polar codes are now adopted as a channel code for the control channel of 5G new radio of the 3rd generation partnership project. However, the decoder implementation is one of the big practical problems and low complexity decoding has been studied. This paper addresses a low complexity successive cancellation list decoding for polar codes utilizing multiple cyclic redundancy check (CRC codes. While some research uses multiple CRC codes to reduce memory and time complexity, we consider the operational complexity of decoding, and reduce it by optimizing CRC positions in combination with a modified decoding operation. Resultingly, the proposed scheme obtains not only complexity reduction from early stopping of decoding, but also additional reduction from the reduced number of decoding paths.
On the decoding process in ternary error-correcting output codes.
Escalera, Sergio; Pujol, Oriol; Radeva, Petia
2010-01-01
A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-Correcting Output Codes (ECOC) represent a successful framework to deal with these type of problems. Recent works in the ECOC framework showed significant performance improvements by means of new problem-dependent designs based on the ternary ECOC framework. The ternary framework contains a larger set of binary problems because of the use of a "do not care" symbol that allows us to ignore some classes by a given classifier. However, there are no proper studies that analyze the effect of the new symbol at the decoding step. In this paper, we present a taxonomy that embeds all binary and ternary ECOC decoding strategies into four groups. We show that the zero symbol introduces two kinds of biases that require redefinition of the decoding design. A new type of decoding measure is proposed, and two novel decoding strategies are defined. We evaluate the state-of-the-art coding and decoding strategies over a set of UCI Machine Learning Repository data sets and into a real traffic sign categorization problem. The experimental results show that, following the new decoding strategies, the performance of the ECOC design is significantly improved.
Cellular automaton decoders of topological quantum memories in the fault tolerant setting
International Nuclear Information System (INIS)
Herold, Michael; Eisert, Jens; Kastoryano, Michael J; Campbell, Earl T
2017-01-01
Active error decoding and correction of topological quantum codes—in particular the toric code—remains one of the most viable routes to large scale quantum information processing. In contrast, passive error correction relies on the natural physical dynamics of a system to protect encoded quantum information. However, the search is ongoing for a completely satisfactory passive scheme applicable to locally interacting two-dimensional systems. Here, we investigate dynamical decoders that provide passive error correction by embedding the decoding process into local dynamics. We propose a specific discrete time cellular-automaton decoder in the fault tolerant setting and provide numerical evidence showing that the logical qubit has a survival time extended by several orders of magnitude over that of a bare unencoded qubit. We stress that (asynchronous) dynamical decoding gives rise to a Markovian dissipative process. We hence equate cellular-automaton decoding to a fully dissipative topological quantum memory, which removes errors continuously. In this sense, uncontrolled and unwanted local noise can be corrected for by a controlled local dissipative process. We analyze the required resources, commenting on additional polylogarithmic factors beyond those incurred by an ideal constant resource dynamical decoder. (paper)
Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
Hashemi, Seyyed Ali; Condo, Carlo; Gross, Warren J.
2017-11-01
Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL) decoding provides a reasonable trade-off between the error-correction performance and hardware implementation complexity when used to decode polar codes, at the cost of limited throughput. The simplified SCL (SSCL) and its extension SSCL-SPC increase the speed of decoding by removing redundant calculations when encountering particular information and frozen bit patterns (rate one and single parity check codes), while keeping the error-correction performance unaltered. In this paper, we improve SSCL and SSCL-SPC by proving that the list size imposes a specific number of bit estimations required to decode rate one and single parity check codes. Thus, the number of estimations can be limited while guaranteeing exactly the same error-correction performance as if all bits of the code were estimated. We call the new decoding algorithms Fast-SSCL and Fast-SSCL-SPC. Moreover, we show that the number of bit estimations in a practical application can be tuned to achieve desirable speed, while keeping the error-correction performance almost unchanged. Hardware architectures implementing both algorithms are then described and implemented: it is shown that our design can achieve 1.86 Gb/s throughput, higher than the best state-of-the-art decoders.
Prior Knowledge Improves Decoding of Finger Flexion from Electrocorticographic (ECoG Signals
Directory of Open Access Journals (Sweden)
Zuoguan eWang
2011-11-01
Full Text Available Brain-computer interfaces (BCIs use brain signals to convey a user's intent. Some BCI approaches begin by decoding kinematic parameters of movements from brain signals, and then proceed to using these signals, in absence of movements, to allow a user to control an output. Recent results have shown that electrocorticographic (ECoG recordings from the surface of the brain in humans can give information about kinematic parameters (eg{} hand velocity or finger flexion. The decoding approaches in these studies usually employed classical classification/regression algorithms that derive a linear mapping between brain signals and outputs. However, they typically only incorporate little prior information about the target movement parameter. In this paper, we incorporate prior knowledge using a Bayesian decoding method, and use it to decode finger flexion from ECoG signals. Specifically, we exploit the anatomic constraints and dynamic constraints that govern finger flexion and incorporate these constraints in the construction, structure, and the probabilistic functions of the prior model of a switched non-parametric dynamic system (SNDS. Given a measurement model resulting from a traditional linear regression method, we decoded finger flexion using posterior estimation that combined the prior and measurement models. Our results show that the application of the Bayesian decoding model, which incorporates prior knowledge, improves decoding performance compared to the application of a linear regression model, which does not incorporate prior knowledge. Thus, the results presented in this paper may ultimately lead to neurally controlled hand prostheses with full fine-grained finger articulation.
Directory of Open Access Journals (Sweden)
S. V. LOSKUTOV
2018-05-01
Full Text Available Purpose. To determine the contribution of the real contact spots distribution in the total conductivity of the conductors contact. Methodology. The electrical contact resistance research was carried out on models. The experimental part of this work was done on paper with a graphite layer with membranes (the first type and conductive liquids with discrete partitions (the second type. Findings. It is shown that the contact electrical resistance is mainly determined by the real area of metal contact. The experimental dependence of the electrical resistance of the second type model on the distance between the electrodes and the potential distribution along the sample surface for the first type model were obtained. The theoretical model based on the principle of electric field superposition was considered. The dependences obtained experimentally and calculated by using the theoretical model are in good agreement. Originality. The regularity of the electrical contact resistance formation on a large number of membranes was researched for the first time. A new model of discrete electrical contact based on the liquid as the conducting environment with nuclear membrane partitions was developed. The conclusions of the additivity of contact and bulk electrical resistance were done. Practical value. Based on these researches, a new experimental method of kinetic macroidentation that as a parameter of the metal surface layer deformation uses the real contact area was developed. This method allows to determine the value of average contact stresses, yield point, change of the stress on the depth of deformation depending on the surface treatment.
Clusterless Decoding of Position From Multiunit Activity Using A Marked Point Process Filter
Deng, Xinyi; Liu, Daniel F.; Kay, Kenneth; Frank, Loren M.; Eden, Uri T.
2016-01-01
Point process filters have been applied successfully to decode neural signals and track neural dynamics. Traditionally, these methods assume that multiunit spiking activity has already been correctly spike-sorted. As a result, these methods are not appropriate for situations where sorting cannot be performed with high precision such as real-time decoding for brain-computer interfaces. As the unsupervised spike-sorting problem remains unsolved, we took an alternative approach that takes advantage of recent insights about clusterless decoding. Here we present a new point process decoding algorithm that does not require multiunit signals to be sorted into individual units. We use the theory of marked point processes to construct a function that characterizes the relationship between a covariate of interest (in this case, the location of a rat on a track) and features of the spike waveforms. In our example, we use tetrode recordings, and the marks represent a four-dimensional vector of the maximum amplitudes of the spike waveform on each of the four electrodes. In general, the marks may represent any features of the spike waveform. We then use Bayes’ rule to estimate spatial location from hippocampal neural activity. We validate our approach with a simulation study and with experimental data recorded in the hippocampus of a rat moving through a linear environment. Our decoding algorithm accurately reconstructs the rat’s position from unsorted multiunit spiking activity. We then compare the quality of our decoding algorithm to that of a traditional spike-sorting and decoding algorithm. Our analyses show that the proposed decoding algorithm performs equivalently or better than algorithms based on sorted single-unit activity. These results provide a path toward accurate real-time decoding of spiking patterns that could be used to carry out content-specific manipulations of population activity in hippocampus or elsewhere in the brain. PMID:25973549
Decoding the Nature of Emotion in the Brain.
Kragel, Philip A; LaBar, Kevin S
2016-06-01
A central, unresolved problem in affective neuroscience is understanding how emotions are represented in nervous system activity. After prior localization approaches largely failed, researchers began applying multivariate statistical tools to reconceptualize how emotion constructs might be embedded in large-scale brain networks. Findings from pattern analyses of neuroimaging data show that affective dimensions and emotion categories are uniquely represented in the activity of distributed neural systems that span cortical and subcortical regions. Results from multiple-category decoding studies are incompatible with theories postulating that specific emotions emerge from the neural coding of valence and arousal. This 'new look' into emotion representation promises to improve and reformulate neurobiological models of affect. Copyright © 2016 Elsevier Ltd. All rights reserved.
Probabilistic Amplitude Shaping With Hard Decision Decoding and Staircase Codes
Sheikh, Alireza; Amat, Alexandre Graell i.; Liva, Gianluigi; Steiner, Fabian
2018-05-01
We consider probabilistic amplitude shaping (PAS) as a means of increasing the spectral efficiency of fiber-optic communication systems. In contrast to previous works in the literature, we consider probabilistic shaping with hard decision decoding (HDD). In particular, we apply the PAS recently introduced by B\\"ocherer \\emph{et al.} to a coded modulation (CM) scheme with bit-wise HDD that uses a staircase code as the forward error correction code. We show that the CM scheme with PAS and staircase codes yields significant gains in spectral efficiency with respect to the baseline scheme using a staircase code and a standard constellation with uniformly distributed signal points. Using a single staircase code, the proposed scheme achieves performance within $0.57$--$1.44$ dB of the corresponding achievable information rate for a wide range of spectral efficiencies.
Coding and decoding for code division multiple user communication systems
Healy, T. J.
1985-01-01
A new algorithm is introduced which decodes code division multiple user communication signals. The algorithm makes use of the distinctive form or pattern of each signal to separate it from the composite signal created by the multiple users. Although the algorithm is presented in terms of frequency-hopped signals, the actual transmitter modulator can use any of the existing digital modulation techniques. The algorithm is applicable to error-free codes or to codes where controlled interference is permitted. It can be used when block synchronization is assumed, and in some cases when it is not. The paper also discusses briefly some of the codes which can be used in connection with the algorithm, and relates the algorithm to past studies which use other approaches to the same problem.
Efficiency turns the table on neural encoding, decoding and noise.
Deneve, Sophie; Chalk, Matthew
2016-04-01
Sensory neurons are usually described with an encoding model, for example, a function that predicts their response from the sensory stimulus using a receptive field (RF) or a tuning curve. However, central to theories of sensory processing is the notion of 'efficient coding'. We argue here that efficient coding implies a completely different neural coding strategy. Instead of a fixed encoding model, neural populations would be described by a fixed decoding model (i.e. a model reconstructing the stimulus from the neural responses). Because the population solves a global optimization problem, individual neurons are variable, but not noisy, and have no truly invariant tuning curve or receptive field. We review recent experimental evidence and implications for neural noise correlations, robustness and adaptation. Copyright © 2016. Published by Elsevier Ltd.
Brief report: decoding representations: how children with autism understand drawings.
Allen, Melissa L
2009-03-01
Young typically developing children can reason about abstract depictions if they know the intention of the artist. Children with autism spectrum disorder (ASD), who are notably impaired in social, 'intention monitoring' domains, may have great difficulty in decoding vague representations. In Experiment 1, children with ASD are unable to use another person's eye gaze as a cue for figuring out what an abstract picture represents. In contrast, when the participants themselves are the artists (Experiment 2), children with ASD are equally proficient as controls at identifying their own perceptually identical pictures (e.g. lollipop and balloon) after a delay, based upon what they intended them to be. Results are discussed in terms of intention and understanding of visual representation in autism.
Decoding Computer Games: Studying “Special Operation 85”
Directory of Open Access Journals (Sweden)
Bahareh Jalalzadeh
2009-11-01
Full Text Available As other media, computer games convey messages which have tow features: explicit and implicit. Semiologically studying computer games and comparing them with narrative structures, the present study attempts to discover the messages they convey. Therefore we have studied and decoded “Special operation 85” as a semiological text. Results show that the game’s features, as naming, interests and motivations of the engaged people, and the events narrated, all lead the producers to their goals of introducing and publicizing Iranian-Islamic cultural values. Although this feature makes “Special Opreation 85” a unique game, it fails in its attempt to produce a mythical personage in Iranian-Islamic cultural context.
Exact performance analysis of decode-and-forward opportunistic relaying
Tourki, Kamel
2010-06-01
In this paper, we investigate a dual-hop decode-and-forward opportunistic relaying scheme where the source may or may not be able to communicate directly with the destination. In our study, we consider a regenerative relaying scheme in which the decision to cooperate takes into account the effect of the possible erroneously detected and transmitted data at the best relay. We derive an exact closed-form expression for the end-to-end bit-error rate (BER) of binary phase-shift keying (BPSK) modulation based on the exact statistics of each hop. Unlike existing works where the analysis focused on high signal-to-noise ratio (SNR) regime, such results are important to enable the designers to take decisions regarding practical systems that operate at low SNR regime. We show that performance simulation results coincide with our analytical results.
Decoding a combined amplitude modulated and frequency modulated signal
DEFF Research Database (Denmark)
2015-01-01
The present disclosure relates to a method for decoding a combined AM/FM encoded signal, comprising the steps of: combining said encoded optical signal with light from a local oscillator configured with a local oscillator frequency; converting the combined local oscillator and encoded optical...... signal into one or more electrical signals by means of at least one opto-electrical converter having a predefined frequency bandwidth, thereby providing an amplified and encoded electrical signal having one or more encoded signal current(s), where one type of states have a higher oscillation frequency...... than other type of states; rectifying the encoded signal current(s), thereby obtaining an encoded power spectrum, wherein said power spectrum has different states, such as "0"-states and "1"-states, with different power levels such that they can be discriminated, said local oscillator frequency...
Selection combining for noncoherent decode-and-forward relay networks
Directory of Open Access Journals (Sweden)
Nguyen Ha
2011-01-01
Full Text Available Abstract This paper studies a new decode-and-forward relaying scheme for a cooperative wireless network composed of one source, K relays, and one destination and with binary frequency-shift keying modulation. A single threshold is employed to select retransmitting relays as follows: a relay retransmits to the destination if its decision variable is larger than the threshold; otherwise, it remains silent. The destination then performs selection combining for the detection of transmitted information. The average end-to-end bit-error-rate (BER is analytically determined in a closed-form expression. Based on the derived BER, the problem of choosing an optimal threshold or jointly optimal threshold and power allocation to minimize the end-to-end BER is also investigated. Both analytical and simulation results reveal that the obtained optimal threshold scheme or jointly optimal threshold and power-allocation scheme can significantly improve the BER performance compared to a previously proposed scheme.
Motor-commands decoding using peripheral nerve signals: a review
Hong, Keum-Shik; Aziz, Nida; Ghafoor, Usman
2018-06-01
During the last few decades, substantial scientific and technological efforts have been focused on the development of neuroprostheses. The major emphasis has been on techniques for connecting the human nervous system with a robotic prosthesis via natural-feeling interfaces. The peripheral nerves provide access to highly processed and segregated neural command signals from the brain that can in principle be used to determine user intent and control muscles. If these signals could be used, they might allow near-natural and intuitive control of prosthetic limbs with multiple degrees of freedom. This review summarizes the history of neuroprosthetic interfaces and their ability to record from and stimulate peripheral nerves. We also discuss the types of interfaces available and their applications, the kinds of peripheral nerve signals that are used, and the algorithms used to decode them. Finally, we explore the prospects for future development in this area.
Outage analysis of opportunistic decode-and-forward relaying
Tourki, Kamel
2010-09-01
In this paper, we investigate a dual-hop opportunistic decode-and-forward relaying scheme where the source may or not be able to communicate directly with the destination. We first derive statistics based on exact probability density function (PDF) of each hop. Then, the PDFs are used to determine closed-form outage probability expression for a transmission rate R. Furthermore, we evaluate the asymptotic outage performance and the diversity order is deduced. Unlike existing works where the analysis focused on high signal-to-noise ratio (SNR) regime, such results are important to enable the designers to take decisions regarding practical systems that operate at low SNR regime. We show that performance simulation results coincide with our analytical results under practical assumption of unbalanced hops. © 2010 IEEE.
Remote Control and Testing of the Interactive TV-Decoder
Directory of Open Access Journals (Sweden)
K. Vlcek
1995-12-01
Full Text Available The article deals with assembling and application of a complex sequential circuit VHDL (VHSIC (Very High-Speed Integrated Circuit Hardware Description Language model. The circuit model is a core of a cryptographic device for the signal encoding and decoding of discreet transmissions by TV-cable net. The cryptographic algorithm is changable according to the user's wishes. The principles of creation and example implementations are presented in the article. The behavioural model is used to minimize mistakes in the ASICs (Application Specific Integrated Circuits. The circuit implementation uses the FPGA (Field Programmable Gate Array technology. The diagnostics of the circuit is based on remote testing by the IEEE Std 1149.1-1990. The VHDL model of diagnostic subsystem is created as an orthogonal model in relation to the cryptographic circuit VHDL model.
Generalized instantly decodable network coding for relay-assisted networks
Elmahdy, Adel M.
2013-09-01
In this paper, we investigate the problem of minimizing the frame completion delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless multicast networks. We first propose a packet recovery algorithm in the single relay topology which employs generalized IDNC instead of strict IDNC previously proposed in the literature for the same relay-assisted topology. This use of generalized IDNC is supported by showing that it is a super-set of the strict IDNC scheme, and thus can generate coding combinations that are at least as efficient as strict IDNC in reducing the average completion delay. We then extend our study to the multiple relay topology and propose a joint generalized IDNC and relay selection algorithm. This proposed algorithm benefits from the reception diversity of the multiple relays to further reduce the average completion delay in the network. Simulation results show that our proposed solutions achieve much better performance compared to previous solutions in the literature. © 2013 IEEE.
Contact and symplectic topology
Colin, Vincent; Stipsicz, András
2014-01-01
Symplectic and contact geometry naturally emerged from the mathematical description of classical physics. The discovery of new rigidity phenomena and properties satisfied by these geometric structures launched a new research field worldwide. The intense activity of many European research groups in this field is reflected by the ESF Research Networking Programme "Contact And Symplectic Topology" (CAST). The lectures of the Summer School in Nantes (June 2011) and of the CAST Summer School in Budapest (July 2012) provide a nice panorama of many aspects of the present status of contact and symplectic topology. The notes of the minicourses offer a gentle introduction to topics which have developed in an amazing speed in the recent past. These topics include 3-dimensional and higher dimensional contact topology, Fukaya categories, asymptotically holomorphic methods in contact topology, bordered Floer homology, embedded contact homology, and flexibility results for Stein manifolds.
Energy Fact Sheets - Sandia Energy
Energy Energy Secure & Sustainable Energy Future Search Icon Sandia Home Locations Contact Us Employee Locator Menu Stationary Power solar Energy Conversion Efficiency Increasing the amount of electricity produced from a given thermal energy input. Solar Energy Wind Energy Water Power Supercritical CO2
Using Social Scientific Criteria to Evaluate Cultural Theories: Encoding/Decoding Evaluated
Directory of Open Access Journals (Sweden)
Evan L. Kropp
2015-12-01
Full Text Available This article transcends the issue of conflicting theoretical schools of thought to formulate a method of social scientific style theory evaluation for cultural studies. It is suggested that positivist social scientific models of theory critique can be used to assess cultural models of communication to determine if they should be classified as theories. A set of evaluation criteria is formulated as a guide and applied to Stuart Hall’s Encoding/Decoding to determine if it is a theory. Conclusions find the sharing of criteria between schools of thought is judicious, Encoding/Decoding fits the established criteria, and Encoding/Decoding should be referred to as a theory.
Mutiple LDPC Decoding using Bitplane Correlation for Transform Domain Wyner-Ziv Video Coding
DEFF Research Database (Denmark)
Luong, Huynh Van; Huang, Xin; Forchhammer, Søren
2011-01-01
Distributed video coding (DVC) is an emerging video coding paradigm for systems which fully or partly exploit the source statistics at the decoder to reduce the computational burden at the encoder. This paper considers a Low Density Parity Check (LDPC) based Transform Domain Wyner-Ziv (TDWZ) video...... codec. To improve the LDPC coding performance in the context of TDWZ, this paper proposes a Wyner-Ziv video codec using bitplane correlation through multiple parallel LDPC decoding. The proposed scheme utilizes inter bitplane correlation to enhance the bitplane decoding performance. Experimental results...
Performance Analysis of Iterative Decoding Algorithms for PEG LDPC Codes in Nakagami Fading Channels
Directory of Open Access Journals (Sweden)
O. Al Rasheed
2013-11-01
Full Text Available In this paper we give a comparative analysis of decoding algorithms of Low Density Parity Check (LDPC codes in a channel with the Nakagami distribution of the fading envelope. We consider the Progressive Edge-Growth (PEG method and Improved PEG method for the parity check matrix construction, which can be used to avoid short girths, small trapping sets and a high level of error floor. A comparative analysis of several classes of LDPC codes in various propagation conditions and decoded using different decoding algorithms is also presented.
Mapping of H.264 decoding on a multiprocessor architecture
van der Tol, Erik B.; Jaspers, Egbert G.; Gelderblom, Rob H.
2003-05-01
Due to the increasing significance of development costs in the competitive domain of high-volume consumer electronics, generic solutions are required to enable reuse of the design effort and to increase the potential market volume. As a result from this, Systems-on-Chip (SoCs) contain a growing amount of fully programmable media processing devices as opposed to application-specific systems, which offered the most attractive solutions due to a high performance density. The following motivates this trend. First, SoCs are increasingly dominated by their communication infrastructure and embedded memory, thereby making the cost of the functional units less significant. Moreover, the continuously growing design costs require generic solutions that can be applied over a broad product range. Hence, powerful programmable SoCs are becoming increasingly attractive. However, to enable power-efficient designs, that are also scalable over the advancing VLSI technology, parallelism should be fully exploited. Both task-level and instruction-level parallelism can be provided by means of e.g. a VLIW multiprocessor architecture. To provide the above-mentioned scalability, we propose to partition the data over the processors, instead of traditional functional partitioning. An advantage of this approach is the inherent locality of data, which is extremely important for communication-efficient software implementations. Consequently, a software implementation is discussed, enabling e.g. SD resolution H.264 decoding with a two-processor architecture, whereas High-Definition (HD) decoding can be achieved with an eight-processor system, executing the same software. Experimental results show that the data communication considerably reduces up to 65% directly improving the overall performance. Apart from considerable improvement in memory bandwidth, this novel concept of partitioning offers a natural approach for optimally balancing the load of all processors, thereby further improving the
Modeling task-specific neuronal ensembles improves decoding of grasp
Smith, Ryan J.; Soares, Alcimar B.; Rouse, Adam G.; Schieber, Marc H.; Thakor, Nitish V.
2018-06-01
Objective. Dexterous movement involves the activation and coordination of networks of neuronal populations across multiple cortical regions. Attempts to model firing of individual neurons commonly treat the firing rate as directly modulating with motor behavior. However, motor behavior may additionally be associated with modulations in the activity and functional connectivity of neurons in a broader ensemble. Accounting for variations in neural ensemble connectivity may provide additional information about the behavior being performed. Approach. In this study, we examined neural ensemble activity in primary motor cortex (M1) and premotor cortex (PM) of two male rhesus monkeys during performance of a center-out reach, grasp and manipulate task. We constructed point process encoding models of neuronal firing that incorporated task-specific variations in the baseline firing rate as well as variations in functional connectivity with the neural ensemble. Models were evaluated both in terms of their encoding capabilities and their ability to properly classify the grasp being performed. Main results. Task-specific ensemble models correctly predicted the performed grasp with over 95% accuracy and were shown to outperform models of neuronal activity that assume only a variable baseline firing rate. Task-specific ensemble models exhibited superior decoding performance in 82% of units in both monkeys (p < 0.01). Inclusion of ensemble activity also broadly improved the ability of models to describe observed spiking. Encoding performance of task-specific ensemble models, measured by spike timing predictability, improved upon baseline models in 62% of units. Significance. These results suggest that additional discriminative information about motor behavior found in the variations in functional connectivity of neuronal ensembles located in motor-related cortical regions is relevant to decode complex tasks such as grasping objects, and may serve the basis for more
Utaka, Yoshio; Saito, Akio; Nakata, Naoki
The objectives of this report are to propose a new method of the high performance cold energy storage using ice as a phase change material and to clarify the heat transfer characteristics of the apparatus of ice cold energy storage based on the proposed principle. A working medium vapor layer a water layer and a working medium liquid layer stratified in this order from the top were kept in an enclosure composed of a condenser, an evaporator and a condensate receiver-and-return tube. The direct contact heat transfers between water or ice and a working medium in an enclosure were applied for realizing the high performance cold energy storage and release. In the storage and release processes, water changes the phase between the liquid and the solid, and the working medium cnanges between the vapor and the liquid with a natural circulation. Experimental apparatus was manufactured and R12 and R114 were selected as working media in the thermal energy storage enclosure. It was confirmed by the measurements that the efficient formation and melting of ice were achieved. Then, th e heat transfer characteristics were clarified for the effects of the initial water height, the initial height of woking medium liquid layer and the inlet coolant temperature.
Introduction to contact mechanics
Fischer-Cripps, Anthony C
2000-01-01
Contact mechanics deals with the elastic or plastic contact between two solid objects, and is thus intimately connected with such topics as fracture, hardness, and elasticity.This text, intended for advanced undergraduates, begins with an introduction to the mechanical properties of materials, general fracture mechanics, and fractures in brittle solids.This is followed by a detailed discussion of stresses and the nature of elastic and elastic-plastic contact.
Full Text Available ... also available in Spanish . Follow The Academy Professionals: Education Guidelines News Multimedia Public & Patients: Contact Us About the Academy Jobs at the Academy Financial ...
Directory of Open Access Journals (Sweden)
Meltem Önder
2009-03-01
Full Text Available Allergic contact dermatitis is the delayed type hypersensitivity reaction to exogenous agents. Allergic contact dermatitis may clinically present acutely after allergen exposure and initial sensitization in a previously sensitized individual. Acute phase is characterized by erythematous, scaly plaques. In severe cases vesiculation and bullae in exposed areas are very characteristic. Repeated or continuous exposure of sensitized individual with allergen result in chronic dermatitis. Lichenification, erythematous plaques, hyperkeratosis and fissuring may develop in chronic patients. Allergic contact dermatitis is very common dermatologic problem in dermatology daily practice. A diagnosis of contact dermatitis requires the careful consideration of patient history, physical examination and patch testing. The knowledge of the clinical features of the skin reactions to various contactans is important to make a correct diagnosis of contact dermatitis. It can be seen in every age, in children textile product, accessories and touch products are common allergens, while in adults allergic contact dermatitis may be related with topical medicaments. The contact pattern of contact dermatitis depends on fashion and local traditions as well. The localization of allergic reaction should be evaluated and patients’ occupation and hobbies should be asked. The purpose of this review is to introduce to our collaques up dated allergic contact dermatitis literatures both in Turkey and in the World.
Colors and contact dermatitis.
Bonamonte, Domenico; Foti, Caterina; Romita, Paolo; Vestita, Michelangelo; Angelini, Gianni
2014-01-01
The diagnosis of skin diseases relies on several clinical signs, among which color is of paramount importance. In this review, we consider certain clinical presentations of both eczematous and noneczematous contact dermatitis in which color plays a peculiar role orientating toward the right diagnosis. The conditions that will be discussed include specific clinical-morphologic subtypes of eczematous contact dermatitis, primary melanocytic, and nonmelanocytic contact hyperchromia, black dermographism, contact chemical leukoderma, and others. Based on the physical, chemical, and biologic factors underlying a healthy skin color, the various skin shades drawing a disease picture are thoroughly debated, stressing their etiopathogenic origins and histopathologic aspects.
Building and maintaining media contacts
International Nuclear Information System (INIS)
Fenton, Bob
2000-01-01
This presentation is answering the question: 'how does British Energy build and maintain its relationships with journalists in so many areas', not only the basic industrial correspondents that you would expect to have to deal with an industry British Energy, but those dealing with science and technology, the environment, personnel and training, city and financial, political, and on and on, and that is just the national press. Then add the local and regional media around power station sites - literally hundreds of contacts and you start to get an idea about the size of our media contact database. But it is managed it rather well. Every six months British Energy takes part in a survey run by one of the UK's leading market research companies who conducts a poll among journalists and then rate each company's performance. In the last three years British Energy has not been outside the top five in most categories, and in the top two in several. The answer is a lot of work over a long period of time. You cannot expect to build trusting relationships with a journalist overnight. At British Energy the key is being open and honest, and always available. Of course good media relations is not a one-way street, and there has to be some element of compromise if you are to achieve a relationship based on mutual trust
Energy Technology Data Exchange (ETDEWEB)
Kuepers, Michael; Konze, Philipp M.; Maintz, Stefan; Steinberg, Simon [Institute of Inorganic Chemistry, Chair of Solid-State and Quantum Chemistry, RWTH Aachen University (Germany); Mio, Antonio M.; Cojocaru-Miredin, Oana; Zhu, Min; Wuttig, Matthias [I. Physikalisches Institut, RWTH Aachen University (Germany); Mueller, Merlin; Mayer, Joachim [Gemeinschaftslabor fuer Elektronenmikroskopie, RWTH Aachen University (Germany); Luysberg, Martina [Ernst-Ruska-Center, Forschungszentrum Juelich GmbH (Germany); Dronskowski, Richard [Institute of Inorganic Chemistry, Chair of Solid-State and Quantum Chemistry, RWTH Aachen University (Germany); Juelich-Aachen Research Alliance (JARA-HPC), RWTH Aachen University (Germany)
2017-08-14
A hexagonal phase in the ternary Ge-Se-Te system with an approximate composition of GeSe{sub 0.75}Te{sub 0.25} has been known since the 1960s but its structure has remained unknown. We have succeeded in growing single crystals by chemical transport as a prerequisite to solve and refine the Ge{sub 4}Se{sub 3}Te structure. It consists of layers that are held together by van der Waals type weak chalcogenide-chalcogenide interactions but also display unexpected Ge-Ge contacts, as confirmed by electron microscopy analysis. The nature of the electronic structure of Ge{sub 4}Se{sub 3}Te was characterized by chemical bonding analysis, in particular by the newly introduced density of energy (DOE) function. The Ge-Ge bonding interactions serve to hold electrons that would otherwise go into antibonding Ge-Te contacts. (copyright 2017 Wiley-VCH Verlag GmbH and Co. KGaA, Weinheim)
Full Text Available ... eye-care professional. Retailers that sell contacts without a prescription are breaking the law, and may be fined $11,000 per violation. "Many of the lenses found online or in beauty salons, novelty shops or in pop-up ... contact lenses from a retailer that does not ask for a prescription. ...
International Nuclear Information System (INIS)
Cuthrell, R.E.
1976-01-01
Electrical contacts must function properly in many types of components used in nuclear weapon systems. Design, application, and testing of these components require detailed knowledge of chemical and physical phenomena associated with stockpile storage, stockpile testing, and operation. In the past, investigation of these phenomena has led to significant discoveries on the effects of surface contaminants, friction and wear, and the mechanics of closure on contact performance. A recent investigation of contact arcing phenomena which revealed that, preceding contact closure, arcs may occur at voltages lower than had been previously known is described. This discovery is important, since arcing may damage contacts, and repetitive testing of contacts performed as part of a quality assurance program might produce cumulative damage that would yield misleading life-test data and could prevent proper operation of the contacts at some time in the future. This damage can be avoided by determining the conditions under which arcing occurs, and ensuring that these conditions are avoided in contact testing
Full Text Available ... Get follow up exams with your eye care provider. If you notice redness, swelling, excessive discharge, pain or discomfort from wearing contact lenses, remove the lenses and seek immediate medical attention from an ophthalmologist. Related resources: Learn how to properly care for contact lenses . ...
African Journals Online (AJOL)
Principal Contact. Ehouan Etienne Ehile Professor University of Abobo-Adjamé 02 BP 801 Abidjan 02. Phone: (+225) 2030 4201. Fax: (+225) 2030 4203. Email: eh_ehile@yahoo.fr. Support Contact. Irie Zoro Bi Email: banhiakalou@yahoo.fr. ISSN: 1812-0741. AJOL African Journals Online. HOW TO USE AJOL.