6 resultados para sparse coding

em Martin Luther Universitat Halle Wittenberg, Germany


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Kernel-Functions, Machine Learning, Least Squares, Speech Recognition, Classification, Regression

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Monkey, neuron, auditory cortex, temporal processing, nonlinear interaction, sequence, temporal coding

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Object-oriented simulation, mechatronic systems, non-iterative algorithm, electric components, piezo-actuator, symbolic computation, Maple, Sparse-Tableau, Library of components

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Speaker Recognition, Speaker Verification, Sparse Kernel Logistic Regression, Support Vector Machine

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper the construction of Reed-Solomon RS(255,239) codeword is described and the process of coding and decoding a message is simulated and verified. RS(255,239), or its shortened version RS(224,208) is used as a coding technique in Low-Power Single Carrier (LPSC) physical layer, as described in IEEE 802.11ad standard. The encoder takes 239 8-bit information symbols, adds 16 parity symbols and constructs 255-byte codeword to be transmitted through wireless communication channel. RS(255,239) codeword is defined over Galois Field GF and is used for correcting upto 8 symbol errors. RS(255,239) code construction is fully implemented and Simulink test project is constructed for testing and analyzing purposes.