Gotowe bibliografie tematyczne / Quantization density

Gotowa bibliografia na temat „Quantization density”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 25 stycznia 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Quantization density”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Quantization density"

1

AURICH, R., i J. BOLTE. "QUANTIZATION RULES FOR STRONGLY CHAOTIC SYSTEMS". Modern Physics Letters B 06, nr 27 (20.11.1992): 1691–719. http://dx.doi.org/10.1142/s0217984992001393.

Pełny tekst źródła
Streszczenie:
We discuss the quantization of strongly chaotic systems and apply several quantization rules to a model system given by the unconstrained motion of a particle on a compact surface of constant negative Gaussian curvature. We study the periodic-orbit theory for distinct symmetry classes corresponding to a parity operation which is always present when such a surface has genus two. Recently, several quantization rules based on periodic orbit theory have been introduced. We compare quantizations using the dynamical zeta function Z(s) with the quantization condition [Formula: see text] where a periodic-orbit expression for the spectral staircase N(E) is used. A general discussion of the efficiency of periodic-orbit quantization then allows us to compare the different methods. The system dependence of the efficiency, which is determined by the topological entropy τ and the mean level density [Formula: see text], is emphasized.
Style APA, Harvard, Vancouver, ISO itp.
2

Kivelson, S., i S. A. Trugman. "Quantization of the Hall conductance from density quantization alone". Physical Review B 33, nr 6 (15.03.1986): 3629–35. http://dx.doi.org/10.1103/physrevb.33.3629.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Hulle, Marc M. Van, i Dominique Martinez. "On an Unsupervised Learning Rule for Scalar Quantization following the Maximum Entropy Principle". Neural Computation 5, nr 6 (listopad 1993): 939–53. http://dx.doi.org/10.1162/neco.1993.5.6.939.

Pełny tekst źródła
Streszczenie:
A novel unsupervised learning rule, called Boundary Adaptation Rule (BAR), is introduced for scalar quantization. It is shown that the rule maximizes information-theoretic entropy and thus yields equiprobable quantizations of univariate probability density functions. It is shown by simulations that BAR outperforms other unsupervised competitive learning rules in generating equiprobable quantizations. It is also shown that our rule can do better or worse than the Lloyd I algorithm in minimizing average mean square error, depending on the input distribution. Finally, an application to adaptive non-uniform analog to digital (A/D) conversion is considered.
Style APA, Harvard, Vancouver, ISO itp.
4

Kwiat, Doron. "Gravitation, Density, Black Holes and Spatial Quantization". Journal of High Energy Physics, Gravitation and Cosmology 08, nr 04 (2022): 990–1011. http://dx.doi.org/10.4236/jhepgc.2022.84070.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Lafferty, John D. "The density manifold and configuration space quantization". Transactions of the American Mathematical Society 305, nr 2 (1.02.1988): 699. http://dx.doi.org/10.1090/s0002-9947-1988-0924776-9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Weissbach, S., F. Wyrowski i O. Bryngdahl. "Quantization noise in pulse density modulated holograms". Optics Communications 67, nr 3 (lipiec 1988): 167–71. http://dx.doi.org/10.1016/0030-4018(88)90373-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Aleksić, Danijela, i Zoran Perić. "ONE-BIT QUANTIZER PARAMETRIZATION FOR ARBITRARY LAPLACIAN SOURCES". Facta Universitatis, Series: Automatic Control and Robotics 1, nr 1 (14.07.2022): 035. http://dx.doi.org/10.22190/fuacr220321004a.

Pełny tekst źródła
Streszczenie:
In this paper we suggest an exact formula for the total distortion of one-bit quantizer and for the arbitrary Laplacian probability density function (pdf). Suggested formula additionally extends normalized case of zero mean and unit variance, which is the most applied quantization case not only in traditional quantization rather in contemporary solutions that involve quantization. Additionally symmetrical quantizer’s representation levels are calculated from minimal distortion criteria. Note that one-bit quantization is the most sensitive quantization from the standpoint of accuracy degradation and quantization error, thus increasing importance of the suggested parameterization of one-bit quantizer.
Style APA, Harvard, Vancouver, ISO itp.
8

GAITE, J. "ANGULAR QUANTIZATION AND THE DENSITY MATRIX RENORMALIZATION GROUP". Modern Physics Letters A 16, nr 17 (7.06.2001): 1109–16. http://dx.doi.org/10.1142/s0217732301004364.

Pełny tekst źródła
Streszczenie:
Path integral techniques for the density matrix of a one-dimensional statistical system near a boundary previously employed in black-hole physics are applied to provide a new interpretation of the density matrix renormalization group: Its efficacy is due to the concentration of quantum states near the boundary.
Style APA, Harvard, Vancouver, ISO itp.
9

Seo, Sanghyun, i Juntae Kim. "Efficient Weights Quantization of Convolutional Neural Networks Using Kernel Density Estimation based Non-uniform Quantizer". Applied Sciences 9, nr 12 (23.06.2019): 2559. http://dx.doi.org/10.3390/app9122559.

Pełny tekst źródła
Streszczenie:
Convolutional neural networks (CNN) have achieved excellent results in the field of image recognition that classifies objects in images. A typical CNN consists of a deep architecture that uses a large number of weights and layers to achieve high performance. CNN requires relatively large memory space and computational costs, which not only increase the time to train the model but also limit the real-time application of the trained model. For this reason, various neural network compression methodologies have been studied to efficiently use CNN in small embedded hardware such as mobile and edge devices. In this paper, we propose a kernel density estimation based non-uniform quantization methodology that can perform compression efficiently. The proposed method performs efficient weights quantization using a significantly smaller number of sampled weights than the number of original weights. Four-bit quantization experiments on the classification of the ImageNet dataset with various CNN architectures show that the proposed methodology can perform weights quantization efficiently in terms of computational costs without significant reduction in model performance.
Style APA, Harvard, Vancouver, ISO itp.
10

Tadic, Predrag, Zeljko Djurovic i Branko Kovacevic. "Analysis of speech waveform quantization methods". Journal of Automatic Control 18, nr 1 (2008): 19–22. http://dx.doi.org/10.2298/jac0801019t.

Pełny tekst źródła
Streszczenie:
Digitalization, consisting of sampling and quantization, is the first step in any digital signal processing algorithm. In most cases, the quantization is uniform. However, having knowledge of certain stochastic attributes of the signal (namely, the probability density function, or pdf), quantization can be made more efficient, in the sense of achieving a greater signal to quantization noise ratio. This means that narrower channel bandwidths are required for transmitting a signal of the same quality. Alternatively, if signal storage is of interest, rather than transmission, considerable savings in memory space can be made. This paper presents several available methods for speech signal pdf estimation, and quantizer optimization in the sense of minimizing the quantization error power.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Quantization density"

1

Pinto, J. A. "Some aspects of geometric quantization and their physical basis". Thesis, University of St Andrews, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.377329.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Tehranchi, Babak 1968. "Time-interval quantization in a high-density optical data storage system". Thesis, The University of Arizona, 1992. http://hdl.handle.net/10150/278151.

Pełny tekst źródła
Streszczenie:
A hardware system for investigating Intersymbol Interference (ISI) in an optical data storage system has been designed and constructed by the author. The system consists of a pattern generator which produces data patterns of variable lengths and bit rates to be recorded on the optical disk. Data marks of the readback signal are quantized by a light-speed clock-counter system, and transferred in parallel to a personal computer for analysis. SNR values for collected data are obtained by computing mark size deviations of the readback signal from the original marks. A pseudo-random pattern of 31 bits is used for calculating SNR values for different spot sizes. Finally, Additive Interleaving Detection (AID) technique is implemented to compute another set of SNR values. 3-5db SNR improvement is observed when AID technique is used.
Style APA, Harvard, Vancouver, ISO itp.
3

Gaddam, Purna Chandra Srinivas Kumar, i Prathik Sunkara. "Advanced Image Processing Using Histogram Equalization and Android Application Implementation". Thesis, Blekinge Tekniska Högskola, Institutionen för tillämpad signalbehandling, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13735.

Pełny tekst źródła
Streszczenie:
Now a days the conditions at which the image taken may lead to near zero visibility for the human eye. They may usually due to lack of clarity, just like effects enclosed on earth’s atmosphere which have effects upon the images due to haze, fog and other day light effects. The effects on such images may exists, so useful information taken under those scenarios should be enhanced and made clear to recognize the objects and other useful information. To deal with such issues caused by low light or through the imaging devices experience haze effect many image processing algorithms were implemented. These algorithms also provide nonlinear contrast enhancement to some extent. We took pre-existed algorithms like SMQT (Successive mean Quantization Transform), V Transform, histogram equalization algorithms to improve the visual quality of digital picture with large range scenes and with irregular lighting conditions. These algorithms were performed in two different method and tested using different image facing low light and color change and succeeded in obtaining the enhanced image. These algorithms helps in various enhancements like color, contrast and very accurate results of images with low light. Histogram equalization technique is implemented by interpreting histogram of image as probability density function. To an image cumulative distribution function is applied so that accumulated histogram values are obtained. Then the values of the pixels are changed based on their probability and spread over the histogram. From these algorithms we choose histogram equalization, MATLAB code is taken as reference and made changes to implement in API (Application Program Interface) using JAVA and confirms that the application works properly with reduction of execution time.
Style APA, Harvard, Vancouver, ISO itp.
4

Kasaei, Shohreh. "Fingerprint analysis using wavelet transform with application to compression and feature extraction". Thesis, Queensland University of Technology, 1998. https://eprints.qut.edu.au/36053/7/36053_Digitised_Thesis.pdf.

Pełny tekst źródła
Streszczenie:
The main goal of this research is to design an efficient compression al~ gorithm for fingerprint images. The wavelet transform technique is the principal tool used to reduce interpixel redundancies and to obtain a parsimonious representation for these images. A specific fixed decomposition structure is designed to be used by the wavelet packet in order to save on the computation, transmission, and storage costs. This decomposition structure is based on analysis of information packing performance of several decompositions, two-dimensional power spectral density, effect of each frequency band on the reconstructed image, and the human visual sensitivities. This fixed structure is found to provide the "most" suitable representation for fingerprints, according to the chosen criteria. Different compression techniques are used for different subbands, based on their observed statistics. The decision is based on the effect of each subband on the reconstructed image according to the mean square criteria as well as the sensitivities in human vision. To design an efficient quantization algorithm, a precise model for distribution of the wavelet coefficients is developed. The model is based on the generalized Gaussian distribution. A least squares algorithm on a nonlinear function of the distribution model shape parameter is formulated to estimate the model parameters. A noise shaping bit allocation procedure is then used to assign the bit rate among subbands. To obtain high compression ratios, vector quantization is used. In this work, the lattice vector quantization (LVQ) is chosen because of its superior performance over other types of vector quantizers. The structure of a lattice quantizer is determined by its parameters known as truncation level and scaling factor. In lattice-based compression algorithms reported in the literature the lattice structure is commonly predetermined leading to a nonoptimized quantization approach. In this research, a new technique for determining the lattice parameters is proposed. In the lattice structure design, no assumption about the lattice parameters is made and no training and multi-quantizing is required. The design is based on minimizing the quantization distortion by adapting to the statistical characteristics of the source in each subimage. 11 Abstract Abstract Since LVQ is a multidimensional generalization of uniform quantizers, it produces minimum distortion for inputs with uniform distributions. In order to take advantage of the properties of LVQ and its fast implementation, while considering the i.i.d. nonuniform distribution of wavelet coefficients, the piecewise-uniform pyramid LVQ algorithm is proposed. The proposed algorithm quantizes almost all of source vectors without the need to project these on the lattice outermost shell, while it properly maintains a small codebook size. It also resolves the wedge region problem commonly encountered with sharply distributed random sources. These represent some of the drawbacks of the algorithm proposed by Barlaud [26). The proposed algorithm handles all types of lattices, not only the cubic lattices, as opposed to the algorithms developed by Fischer [29) and Jeong [42). Furthermore, no training and multiquantizing (to determine lattice parameters) is required, as opposed to Powell's algorithm [78). For coefficients with high-frequency content, the positive-negative mean algorithm is proposed to improve the resolution of reconstructed images. For coefficients with low-frequency content, a lossless predictive compression scheme is used to preserve the quality of reconstructed images. A method to reduce bit requirements of necessary side information is also introduced. Lossless entropy coding techniques are subsequently used to remove coding redundancy. The algorithms result in high quality reconstructed images with better compression ratios than other available algorithms. To evaluate the proposed algorithms their objective and subjective performance comparisons with other available techniques are presented. The quality of the reconstructed images is important for a reliable identification. Enhancement and feature extraction on the reconstructed images are also investigated in this research. A structural-based feature extraction algorithm is proposed in which the unique properties of fingerprint textures are used to enhance the images and improve the fidelity of their characteristic features. The ridges are extracted from enhanced grey-level foreground areas based on the local ridge dominant directions. The proposed ridge extraction algorithm, properly preserves the natural shape of grey-level ridges as well as precise locations of the features, as opposed to the ridge extraction algorithm in [81). Furthermore, it is fast and operates only on foreground regions, as opposed to the adaptive floating average thresholding process in [68). Spurious features are subsequently eliminated using the proposed post-processing scheme.
Style APA, Harvard, Vancouver, ISO itp.
5

Hanzálek, Pavel. "Praktické ukázky zpracování signálů". Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-400849.

Pełny tekst źródła
Streszczenie:
The thesis focuses on the issue of signal processing. Using practical examples, it tries to show the use of individual signal processing operations from a practical point of view. For each of the selected signal processing operations, an application is created in MATLAB, including a graphical interface for easier operation. The division of the thesis is such that each chapter is first analyzed from a theoretical point of view, then it is shown using a practical demonstration of what the operation is used in practice. Individual applications are described here, mainly in terms of how they are handled and their possible results. The results of the practical part are presented in the attachment of the thesis.
Style APA, Harvard, Vancouver, ISO itp.
6

Haimovich, Hernan. "Quantisation Issues in Feedback Control". Thesis, 2006. http://hdl.handle.net/1959.13/24692.

Pełny tekst źródła
Streszczenie:
Systems involving quantisation arise in many areas of engineering, especially when digital implementations are involved. In this thesis we consider different aspects of quantisation in feedback control systems. We study two topics of interest: (a) quantisers that quadratically stabilise a given system and are efficient in the use of their quantisation levels and (b) the derivation of ultimate bounds for perturbed systems, especially when the perturbations arise from the use of quantisers. In the first part of the thesis we address problem (a) above. We consider quadratic stabilisation of discrete-time multiple-input systems by means of quantised static feedback and we measure the efficiency of a quantiser via the concept of quantisation density. Intuitively, the lower the density of a quantiser is, the more separated its quantisation levels are. We thus deal with the problem of optimising density over all quantisers that quadratically stabilise a given system with respect to a given control Lyapunov function. Most of the available results on this problem treat single-input systems, and the ones that deal with the multiple-input case consider only two-input systems. In this thesis, we derive several new results for multiple-input systems and also provide an alternative approach to deal with the single-input case. Our new results for multiple-input systems include the derivation of the structure of optimal quantisers and the explicit design of multivariable quantisers with finite density that are able to quadratically stabilise systems having an arbitrary number of inputs. For single-input systems, we provide an alternative approach to the analysis and design of optimal quantisers by establishing a link between the separation of the quantisation levels of a quantiser and the size of its quantisation regions. In the second part of the thesis we address problem (b) above. In the presence of perturbations, asymptotic stabilisation may not be possible. However, there may exist a bounded region that contains the equilibrium point and has the property that the system trajectories converge to this bounded region. When this bounded region exists, we say that the system trajectories are ultimately bounded, and that this bounded region is an ultimate bound for the system. The size of the ultimate bound quantifies the performance of the system in steady state. Hence, it is important to derive ultimate bounds that are as tight as possible. This part of the thesis addresses the problem of ultimate bound computation in settings involving several scalar quantisers, each having different features. We consider each quantised variable in the system to be a perturbed copy of the corresponding unquantised variable. This turns the original quantised system into a perturbed system, where the perturbation has a natural \emph{componentwise} bound. Moreover, according to the type of quantiser employed, the perturbation bound may depend on the system state. Typical methods to estimate ultimate bounds are based on the use of Lyapunov functions and usually require a bound on the norm of the perturbation. Applying these methods in the setting considered here may disregard important information on the structure of the perturbation bound. We therefore derive ultimate bounds on the system states that explicitly take account of the componentwise structure of the perturbation bound. The ultimate bounds derived also have a componentwise form, and can be systematically computed without having to, e.g. select a suitable Lyapunov function for the system. The results of this part of the thesis, though motivated by quantised systems, apply to more general perturbations, not necessarily arising from quantisation.
PhD Doctorate
Style APA, Harvard, Vancouver, ISO itp.
7

Haimovich, Hernan. "Quantisation Issues in Feedback Control". 2006. http://hdl.handle.net/1959.13/24692.

Pełny tekst źródła
Streszczenie:
Systems involving quantisation arise in many areas of engineering, especially when digital implementations are involved. In this thesis we consider different aspects of quantisation in feedback control systems. We study two topics of interest: (a) quantisers that quadratically stabilise a given system and are efficient in the use of their quantisation levels and (b) the derivation of ultimate bounds for perturbed systems, especially when the perturbations arise from the use of quantisers. In the first part of the thesis we address problem (a) above. We consider quadratic stabilisation of discrete-time multiple-input systems by means of quantised static feedback and we measure the efficiency of a quantiser via the concept of quantisation density. Intuitively, the lower the density of a quantiser is, the more separated its quantisation levels are. We thus deal with the problem of optimising density over all quantisers that quadratically stabilise a given system with respect to a given control Lyapunov function. Most of the available results on this problem treat single-input systems, and the ones that deal with the multiple-input case consider only two-input systems. In this thesis, we derive several new results for multiple-input systems and also provide an alternative approach to deal with the single-input case. Our new results for multiple-input systems include the derivation of the structure of optimal quantisers and the explicit design of multivariable quantisers with finite density that are able to quadratically stabilise systems having an arbitrary number of inputs. For single-input systems, we provide an alternative approach to the analysis and design of optimal quantisers by establishing a link between the separation of the quantisation levels of a quantiser and the size of its quantisation regions. In the second part of the thesis we address problem (b) above. In the presence of perturbations, asymptotic stabilisation may not be possible. However, there may exist a bounded region that contains the equilibrium point and has the property that the system trajectories converge to this bounded region. When this bounded region exists, we say that the system trajectories are ultimately bounded, and that this bounded region is an ultimate bound for the system. The size of the ultimate bound quantifies the performance of the system in steady state. Hence, it is important to derive ultimate bounds that are as tight as possible. This part of the thesis addresses the problem of ultimate bound computation in settings involving several scalar quantisers, each having different features. We consider each quantised variable in the system to be a perturbed copy of the corresponding unquantised variable. This turns the original quantised system into a perturbed system, where the perturbation has a natural \emph{componentwise} bound. Moreover, according to the type of quantiser employed, the perturbation bound may depend on the system state. Typical methods to estimate ultimate bounds are based on the use of Lyapunov functions and usually require a bound on the norm of the perturbation. Applying these methods in the setting considered here may disregard important information on the structure of the perturbation bound. We therefore derive ultimate bounds on the system states that explicitly take account of the componentwise structure of the perturbation bound. The ultimate bounds derived also have a componentwise form, and can be systematically computed without having to, e.g. select a suitable Lyapunov function for the system. The results of this part of the thesis, though motivated by quantised systems, apply to more general perturbations, not necessarily arising from quantisation.
PhD Doctorate
Style APA, Harvard, Vancouver, ISO itp.
8

"A 280 mW, 0.07 % THD+N Class-D Audio Amplifier Using a Frequency-Domain Quantizer". Doctoral diss., 2011. http://hdl.handle.net/2286/R.I.9517.

Pełny tekst źródła
Streszczenie:
abstract: Pulse Density Modulation- (PDM-) based class-D amplifiers can reduce non-linearity and tonal content due to carrier signal in Pulse Width Modulation - (PWM-) based amplifiers. However, their low-voltage analog implementations also require a linear- loop filter and a quantizer. A PDM-based class-D audio amplifier using a frequency-domain quantization is presented in this paper. The digital-intensive frequency domain approach achieves high linearity under low-supply regimes. An analog comparator and a single-bit quantizer are replaced with a Current-Controlled Oscillator- (ICO-) based frequency discriminator. By using the ICO as a phase integrator, a third-order noise shaping is achieved using only two analog integrators. A single-loop, singlebit class-D audio amplifier is presented with an H-bridge switching power stage, which is designed and fabricated on a 0.18 um CMOS process, with 6 layers of metal achieving a total harmonic distortion plus noise (THD+N) of 0.065% and a peak power efficiency of 80% while driving a 4-ohms loudspeaker load. The amplifier can deliver the output power of 280 mW.
Dissertation/Thesis
Ph.D. Electrical Engineering 2011
Style APA, Harvard, Vancouver, ISO itp.
9

Uppal, Momin Ayub. "Coding for Cooperative Communications". Thesis, 2010. http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8475.

Pełny tekst źródła
Streszczenie:
The area of cooperative communications has received tremendous research interest in recent years. This interest is not unwarranted, since cooperative communications promises the ever-so-sought after diversity and multiplexing gains typically associated with multiple-input multiple-output (MIMO) communications, without actually employing multiple antennas. In this dissertation, we consider several cooperative communication channels, and for each one of them, we develop information theoretic coding schemes and derive their corresponding performance limits. We next develop and design practical coding strategies which perform very close to the information theoretic limits. The cooperative communication channels we consider are: (a) The Gaussian relay channel, (b) the quasi-static fading relay channel, (c) cooperative multiple-access channel (MAC), and (d) the cognitive radio channel (CRC). For the Gaussian relay channel, we propose a compress-forward (CF) coding strategy based on Wyner-Ziv coding, and derive the achievable rates specifically with BPSK modulation. The CF strategy is implemented with low-density parity-check (LDPC) and irregular repeataccumulate codes and is found to operate within 0.34 dB of the theoretical limit. For the quasi-static fading relay channel, we assume that no channel state information (CSI) is available at the transmitters and propose a rateless coded protocol which uses rateless coded versions of the CF and the decode-forward (DF) strategy. We implement the protocol with carefully designed Raptor codes and show that the implementation suffers a loss of less than 10 percent from the information theoretical limit. For the MAC, we assume quasi-static fading, and consider cooperation in the low-power regime with the assumption that no CSI is available at the transmitters. We develop cooperation methods based on multiplexed coding in conjunction with rateless codes and find the achievable rates and in particular the minimum energy per bit to achieve a certain outage probability. We then develop practical coding methods using Raptor codes, which performs within 1.1 dB of the performance limit. Finally, we consider a CRC and develop a practical multi-level dirty-paper coding strategy using LDPC codes for channel coding and trellis-coded quantization for source coding. The designed scheme is found to operate within 0.78 dB of the theoretical limit. By developing practical coding strategies for several cooperative communication channels which exhibit performance close to the information theoretic limits, we show that cooperative communications not only provide great benefits in theory, but can possibly promise the same benefits when put into practice. Thus, our work can be considered a useful and necessary step towards the commercial realization of cooperative communications.
Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Quantization density"

1

van Houselt, Arie, i Harold J. W. Zandvliet. Self-organizing atom chains. Redaktorzy A. V. Narlikar i Y. Y. Fu. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780199533046.013.9.

Pełny tekst źródła
Streszczenie:
This article examines the intriguing physical properties of nanowires, with particular emphasis on self-organizing atom chains. It begins with an overview of the one-dimensional free electron model and some interesting phenomena of one-dimensional electron systems. It derives an expression for the 1D density of states, which exhibits a singularity at the bottom of the band and extends the free-electron model, taking into consideration a weak periodic potential that is induced by the lattice. It also describes the electrostatic interactions between the electrons and goes on to discuss two interesting features of 1D systems: the quantization of conductance and Peierls instability. Finally, the article presents the experimental results of a nearly ideal one-dimensional system, namely self-organizing platinum atom chains on a Ge(001) surface, focusing on their formation, quantum confinement between the Pt chains and the occurrence of a Peierls transition within the chains.
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Quantization density"

1

Fedosov, Boris V. "On the Trace Density in Deformation Quantization". W Partial Differential Operators and Mathematical Physics, 133–34. Basel: Birkhäuser Basel, 1995. http://dx.doi.org/10.1007/978-3-0348-9092-2_14.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Dehghani, Mahdieh, Ali Kamandi i Ali Moeini. "Density-Based Clustering by Double-Bit Quantization Hashing". W Communications in Computer and Information Science, 301–14. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-33495-6_23.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Chang, Chin-Chen, i Chih-Yang Lin. "Density-Based Image Vector Quantization Using a Genetic Algorithm". W Lecture Notes in Computer Science, 289–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/978-3-540-69423-6_29.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Azzolini, Alisson G., Ricardo P. V. Violato i Fernando J. Von Zuben. "Density Preservation and Vector Quantization in Immune-Inspired Algorithms". W Lecture Notes in Computer Science, 33–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14547-6_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Skubalska-Rafajłowicz, Ewa. "Controlling the Asymptotic Level Density for Quantization Processes with Self-Organizing Maps". W Neural Networks and Soft Computing, 638–43. Heidelberg: Physica-Verlag HD, 2003. http://dx.doi.org/10.1007/978-3-7908-1902-1_98.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Thurber, J. K., i P. Ajanapon. "A functional density matrix for quantum electrodynamics and its classical limit". W The Physics of Phase Space Nonlinear Dynamics and Chaos Geometric Quantization, and Wigner Function, 305–7. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-17894-5_369.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Kurz, Thomas, i Gottfried Mayer-Kress. "Dimension density — an intensive measure of chaos, in spatially extended turbulent systems". W The Physics of Phase Space Nonlinear Dynamics and Chaos Geometric Quantization, and Wigner Function, 39–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17894-5_314.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Elia, Nicola, i Emilio Frazzoli. "Quantized Stabilization of Two-Input Linear Systems: A Lower Bound on the Minimal Quantization Density". W Hybrid Systems: Computation and Control, 179–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45873-5_16.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Smith, Kyle K. G., i David A. Dixon. "Quantization of Hamilton's equations and the classical phase space density". W Annual Reports in Computational Chemistry, 3–15. Elsevier, 2020. http://dx.doi.org/10.1016/bs.arcc.2020.07.002.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Basu, Prasanta Kumar, Bratati Mukhopadhyay i Rikmantra Basu. "Basic properties of semiconductors". W Semiconductor Nanophotonics, 22–61. Oxford University PressOxford, 2022. http://dx.doi.org/10.1093/oso/9780198784692.003.0002.

Pełny tekst źródła
Streszczenie:
Abstract This chapter presents the basic properties of bulk semiconductors, their heterostructures and of Quantum Well (QW) structures. The outline of band structure, density-of-states (DOS), elementary transport properties, and optical processes in bulk semiconductors are first introduced. The heterostructure formation and different band alignments are then introduced. the first example of nanostructure, that is the QW, quantization of electron motion in it, DOS function, and a few optical processes are briefly introduced. elementary properties of multiple QWs, superlattices, quantum wires, and quantum dots are discussed next. Finally, strained heterostructures and band structure alteration due to strain are considered.
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Quantization density"

1

Li, Minyue, Janusz Klejsa, Alexey Ozerov i W. Bastiaan Kleijn. "Audio codingwith power spectral density preserving quantization". W ICASSP 2012 - 2012 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2012. http://dx.doi.org/10.1109/icassp.2012.6287904.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Zhang, Z., L. Dolecek, M. Wainwright, V. Anantharam i B. Nikolic. "Quantization Effects in Low-Density Parity-Check Decoders". W 2007 IEEE International Conference on Communications. IEEE, 2007. http://dx.doi.org/10.1109/icc.2007.1032.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Chung, Cha-Hao, Yeong-Luh Ueng, Ming-Che Lu i Mao-Chao Lin. "Adaptive quantization for low-density-parity-check decoders". W Its Applications (Isita2010). IEEE, 2010. http://dx.doi.org/10.1109/isita.2010.5649830.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Bocchieri, E. "Vector quantization for the efficient computation of continuous density likelihoods". W Proceedings of ICASSP '93. IEEE, 1993. http://dx.doi.org/10.1109/icassp.1993.319405.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Parameswaran, Kamalaruban. "Vector quantization, density estimation and outlier detection on cricket dataset". W 2013 International Conference on Computer Communication and Informatics (ICCCI). IEEE, 2013. http://dx.doi.org/10.1109/iccci.2013.6466249.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Mak, Brian, Siu-Kei Au Yeung, Yiu-Pong Lai i Manhung Siu. "High-density discrete HMM with the use of scalar quantization indexing". W Interspeech 2005. ISCA: ISCA, 2005. http://dx.doi.org/10.21437/interspeech.2005-690.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Vasquez, Karina, Yeshwanth Venkatesha, Abhiroop Bhattacharjee, Abhishek Moitra i Priyadarshini Panda. "Activation Density based Mixed-Precision Quantization for Energy Efficient Neural Networks". W 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 2021. http://dx.doi.org/10.23919/date51398.2021.9474031.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Liu, Tianhe, Ye Liang, Yiming Cheng, Lin Zhang, Changhong Wang i Jun Wang. "Non-Weighted H∞ Filtering for Networked Systems with Variable Quantization Density". W 2018 Eighth International Conference on Information Science and Technology (ICIST). IEEE, 2018. http://dx.doi.org/10.1109/icist.2018.8426172.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Parashar, Karthick, Daniel Menard, Romuald Rocher i Olivier Sentieys. "Shaping probability density function of quantization noise in fixed point systems". W 2010 44th Asilomar Conference on Signals, Systems and Computers. IEEE, 2010. http://dx.doi.org/10.1109/acssc.2010.5757824.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Mezey, Paul G. "The Holographic Electron Density Theorem, de-quantization, re-quantization, and nuclear charge space extrapolations of the Universal Molecule Model". W PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2017 (ICCMSE-2017). Author(s), 2017. http://dx.doi.org/10.1063/1.5012279.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Quantization density” dla poszczególnych typów źródeł:
Artykuły w czasopismach
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii