Log in

Relevant bibliographies by topics / Walsh-Hadamard transform

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Walsh-Hadamard transform'

Author: Grafiati

Published: 4 June 2021

Last updated: 15 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Walsh-Hadamard transform.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Walsh-Hadamard transform"

1

ASAHI, Hideyasu. "A Function Generator for Walsh Order Hadamard Matrix and Fast Walsh-Hadamard Transform." Geoinformatics 11, no. 1 (2000): 3–9. http://dx.doi.org/10.6010/geoinformatics1990.11.1_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Venkataraman, S., V. R. Kanchan, K. R. Rao, and M. Mohanty. "Discrete transforms via the Walsh-Hadamard transform." Signal Processing 14, no. 4 (1988): 371–82. http://dx.doi.org/10.1016/0165-1684(88)90095-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

HSU, CHAU-YUN, and JA-LING WU. "The Walsh-Hadamard/discrete Hartley transform." International Journal of Electronics 62, no. 5 (1987): 747–55. http://dx.doi.org/10.1080/00207218708921026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hamood, M. T., and S. Boussakta. "Fast Walsh–Hadamard–Fourier Transform Algorithm." IEEE Transactions on Signal Processing 59, no. 11 (2011): 5627–31. http://dx.doi.org/10.1109/tsp.2011.2162836.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kountchev, Roumen K., Rumen P. Mironov, and Roumiana A. Kountcheva. "Hierarchical Cubical Tensor Decomposition through Low Complexity Orthogonal Transforms." Symmetry 12, no. 5 (2020): 864. http://dx.doi.org/10.3390/sym12050864.

Full text

Abstract:

In this work, new approaches are proposed for the 3D decomposition of a cubical tensor of size N × N × N for N = 2n through hierarchical deterministic orthogonal transforms with low computational complexity, whose kernels are based on the Walsh-Hadamard Transform (WHT) and the Complex Hadamard Transform (CHT). On the basis of the symmetrical properties of the real and complex Walsh-Hadamard matrices are developed fast computational algorithms whose computational complexity is compared with that of the famous deterministic transforms: the 3D Fast Fourier Transform, the 3D Discrete Wavelet Transform and the statistical Hierarchical Tucker decomposition. The comparison results show the lower computational complexity of the offered algorithms. Additionally, they ensure the high energy concentration of the original tensor into a small number of coefficients of the so calculated transformed spectrum tensor. The main advantage of the proposed algorithms is the reduction of the needed calculations due to the low number of hierarchical levels compared to the significant number of iterations needed to achieve the required decomposition accuracy based on the statistical methods. The choice of the 3D hierarchical decomposition is defined by the requirements and limitations related to the corresponding application area.

APA, Harvard, Vancouver, ISO, and other styles

6

Balsa, Jose. "Comparison of Image Compressions: Analog Transformations." Proceedings 54, no. 1 (2020): 37. http://dx.doi.org/10.3390/proceedings2020054037.

Full text

Abstract:

A comparison between the four most used transforms, the discrete Fourier transform (DFT), discrete cosine transform (DCT), the Walsh–Hadamard transform (WHT) and the Haar-wavelet transform (DWT), for the transmission of analog images, varying their compression and comparing their quality, is presented. Additionally, performance tests are done for different levels of white Gaussian additive noise.

APA, Harvard, Vancouver, ISO, and other styles

7

Mardan, Suha Suliman, and Mounir Taha Hamood. "New fast Walsh–Hadamard–Hartley transform algorithm." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 2 (2023): 1533. http://dx.doi.org/10.11591/ijece.v13i2.pp1533-1540.

Full text

Abstract:

<span lang="EN-US">This paper presents an efficient fast Walsh–Hadamard–Hartley transform (FWHT) algorithm that incorporates the computation of the Walsh-Hadamard transform (WHT) with the discrete Hartley transform (DHT) into an orthogonal, unitary single fast transform possesses the block diagonal structure. The proposed algorithm is implemented in an integrated butterfly structure utilizing the sparse matrices factorization approach and the Kronecker (tensor) product technique, which proved a valuable and fast tool for developing and analyzing the proposed algorithm. The proposed approach was distinguished by ease of implementation and reduced computational complexity compared to previous algorithms, which were based on the concatenation of WHT and FHT by saving up to 3N-4 of real multiplication and 7.5N-10 of real addition.</span>

APA, Harvard, Vancouver, ISO, and other styles

8

Arambepola, B., and K. C. Partington. "Walsh-Hadamard transform for complex-valued signals." Electronics Letters 28, no. 3 (1992): 259. http://dx.doi.org/10.1049/el:19920160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Irfan, Mohammad, and Soo Young Shin. "Robust Walsh–Hadamard transform-based spatial modulation." Digital Signal Processing 64 (May 2017): 1–7. http://dx.doi.org/10.1016/j.dsp.2017.01.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Al-Ubaidi, Safaa M. Z. "Design and Implementation of Sequency-Ordered Fast Walsh-Hadamard Transform (FWHT) in WCDMA." Tikrit Journal of Engineering Sciences 21, no. 3 (2013): 26–31. http://dx.doi.org/10.25130/tjes.21.3.03.

Full text

Abstract:

This paper presents the implementation of the Fast Walsh Hadamard Transform (FWHT) in sequenceordered method, in order to minimize the interference due to two users trying to transmit at the same time,and an attempt has made to simulate them. The simulations designed satisfy most of the requirements ofthe parameters mentioned in the 3GPP specifications. The main objectives of this paper are to construct amodel using MATLAB 7.4.0(R2007a) to illustrate the simulation.In image processing and pattern recognition the motivation for using transforms other than Fourier iseither to reduce computation time for a given resolution, or to increase resolution without increasing thelength of the computation time and to minimize the hardware resources. Fast Walsh-Hadamard Transformhas been used effectively to satisfy these requirements.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Walsh-Hadamard transform"

1

Furis, Mihai Alexandru Johnson Jeremy. "Cache miss analysis of Walsh-Hadamard Transform algorithms /." Philadelphia : Drexel University, 2003. http://dspace.library.drexel.edu/handle/1721.1/109.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sagdicoglu, Serhat. "Cryptological Viewpoint Of Boolean Functions." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/1082403/index.pdf.

Full text

Abstract:

Boolean functions are the main building blocks of most cipher systems. Various aspects of their cryptological characteristics are examined and investigated by many researchers from different fields. This thesis has no claim to obtain original results but consists in an attempt at giving a unified survey of the main results of the subject. In this thesis, the theory of boolean functions is presented in details, emphasizing some important cryptological properties such as balance, nonlinearity, strict avalanche criterion and propagation criterion. After presenting many results about these criteria with detailed proofs, two upper bounds and two lower bounds on the nonlinearity of a boolean function due to Zhang and Zheng are proved. Because of their importance in the theory of boolean functions, construction of Sylvester-Hadamard matrices are shown and most of their properties used in cryptography are proved. The Walsh transform is investigated in detail by proving many properties. By using a property of Sylvester-Hadamard matrices, the fast Walsh transform is presented and its application in finding the nonlinearity of a boolean function is demonstrated. One of the most important classes of boolean functions, so called bent functions, are presented with many properties and by giving several examples, from the paper of Rothaus. By using bent functions, relations between balance, nonlinearity and propagation criterion are presented and it is shown that not all these criteria can be simultaneously satisfied completely. For this reason, several constructions of functions optimizing these criteria which are due to Seberry, Zhang and Zheng are presented.

APA, Harvard, Vancouver, ISO, and other styles

3

RAJYALAKSHMI, P. S., and R. K. RAJANGAM. "DATA COMPRESSION SYSTEM FOR VIDEO IMAGES." International Foundation for Telemetering, 1986. http://hdl.handle.net/10150/615539.

Full text

Abstract:

International Telemetering Conference Proceedings / October 13-16, 1986 / Riviera Hotel, Las Vegas, Nevada<br>In most transmission channels, bandwidth is at a premium and an important attribute of any good digital signalling scheme is to optimally utilise the bandwidth for transmitting the information. The Data Compression System in this way plays a significant role in the transmission of picture data from any Remote Sensing Satellite by exploiting the statistical properties of the imagery. The data rate required for transmission to ground can be reduced by using suitable compression technique. A data compression algorithm has been developed for processing the images of Indian Remote Sensing Satellite. Sample LANDSAT imagery and also a reference photo are used for evaluating the performance of the system. The reconstructed images are obtained after compression for 1.5 bits per pixel and 2 bits per pixel as against the original of 7 bits per pixel. The technique used is uni-dimensional Hadamard Transform Technique. The Histograms are computed for various pictures which are used as samples. This paper describes the development of such a hardware and software system and also indicates how hardware can be adopted for a two dimensional Hadamard Transform Technique.

APA, Harvard, Vancouver, ISO, and other styles

4

El, Omer. "Avalanche Properties And Randomness Of The Twofish Cipher." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605571/index.pdf.

Full text

Abstract:

In this thesis, one finalist cipher of the Advanced Encryption Standard (AES) block cipher contest, Twofish proposed by Schneier et al, is studied in order to observe the validity of the statement made by Arikan about the randomness of the cipher, which contradicts National Institute of Standards and Technology (NIST)&rsquo<br>s results. The strength of the cipher to cryptanalytic attacks is investigated by measuring its randomness according to the avalanche criterion. The avalanche criterion results are compared with those of the Statistical Test Suite of the NIST and discrepancies in the second and third rounds are explained theoretically.

APA, Harvard, Vancouver, ISO, and other styles

5

Millan, William L. "Analysis and design of Boolean functions for cryptographic applications." Thesis, Queensland University of Technology, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sertkaya, Isa. "Nonlinearity Preserving Post-transformations." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605183/index.pdf.

Full text

Abstract:

Boolean functions are accepted to be cryptographically strong if they satisfy some common pre-determined criteria. It is expected that any design criteria should remain invariant under a large group of transformations due to the theory of similarity of secrecy systems proposed by Shannon. One of the most important design criteria for cryptographically strong Boolean functions is the nonlinearity criterion. Meier and Staffelbach studied nonlinearity preserving transformations, by considering the invertible transformations acting on the arguments of Boolean functions, namely the pre-transformations. In this thesis, first, the results obtained by Meier and Staffelbach are presented. Then, the invertible transformations acting on the truth tables of Boolean functions, namely the post-transformations, are studied in order to determine whether they keep the nonlinearity criterion invariant. The equivalent counterparts of Meier and Staffelbach&rsquo<br>s results are obtained in terms of the post-transformations. In addition, the existence of nonlinearity preserving post-transformations, which are not equivalent to pre-transformations, is proved. The necessary and sufficient conditions for an affine post-transformation to preserve nonlinearity are proposed and proved. Moreover, the sufficient conditions for an non-affine post-transformation to keep nonlinearity invariant are proposed. Furthermore, it is proved that the smart hill climbing method, which is introduced to improve nonlinearity of Boolean functions by Millan et. al., is equivalent to applying a post-transformation to a single Boolean function. Finally, the necessary and sufficient condition for an affine pre-transformation to preserve the strict avalanche criterion is proposed and proved.

APA, Harvard, Vancouver, ISO, and other styles

7

Lin, Chun-Fan, and 林純帆. "Study of Orthogonal STBC Using Walsh-Hadamard Transform with Decoupling in Time Domain." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/01353163889531838536.

Full text

Abstract:

碩士<br>國立東華大學<br>電機工程學系<br>101<br>This thesis presents the Space-Time Block Codes (STBC) constructed by using the diagonal orthogonal coefficient with decoupling in time domain. The novel Walsh-Hadamard STBC (WHSTBC) gives full rate and full diversity order with appropriate pre-coding of the PSK or QAM modulated symbols, when the number of receiver antennas is at least equal to the number of transmit antennas. Hadamard matrices exist for orders equal to N=2^n, where n≥1, and the receiver allows for some decoupling methods and decoding with Maximal Ratio Combining (MRC). Finally, the performance will be different because of the different antennas and time arrangement.

APA, Harvard, Vancouver, ISO, and other styles

8

Ting, Kou-Cheng, and 丁國政. "Designing Fast Walsh Hadamard Transform on Various Interconnection Networks Using Tensor Product Formulation." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/r8f2ma.

Full text

Abstract:

碩士<br>逢甲大學<br>資訊工程所<br>91<br>The fast Walsh Hadamard transform is a simple and important algorithm in digital signal processing, especially, in digital image compression. The fast Walsh Hadamard transform is a block recursive algorithm, which can be easily expressed as a tensor product formula. Also, the tensor product notation can be used to express the topology of interconnection networks. In this thesis, we will emerge the specification of tensor product formulation of block recursive algorithms and interconnection networks to design fast Walsh Hadamard transform algorithms on various interconnection networks, including hypercube networks, omega networks, and baseline networks. The design process starts from a tensor product formula of the fast Walsh Hadamard transform. Given a specific interconnection network, we will manipulate the tensor product formula of the fast Walsh Hadamard transform to an equivalent formula which fits the form of the tensor product formula of that interconnection network. The resulting algorithms are suitable for designing VLSI circuits of DSP algorithms.

APA, Harvard, Vancouver, ISO, and other styles

9

Chen, Kuan-Han, and 陳冠翰. "SELECTIVE MAPPING SCHEME COMBINING WITH WALSH HADAMARD TRANSFORM FOR PAPR REDUCTION OF OFDM SYSTEMS." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/58893504047388376254.

Full text

Abstract:

碩士<br>大同大學<br>通訊工程研究所<br>97<br>Orthogonal Frequency Division Multiplex (OFDM) is a very suitable technique for achieving high-rate wireless data transmission. High spectral efficiency, robustness to channel fading, immunity to impulse interference and less non linear distortion are among the favorite properties of OFDM. One major drawback of OFDM is high Peak to Average Power Ratio (PAPR) of the transmitted signal. The high peaks of an OFDM signal are distorted nonlinearly by the high power amplifier (HPA) because the HPA heavily distorts all signal parts that come close to or exceed saturation. The distortion causes inter carrier interference (ICI) and out-of-band (OOB) radiation. While ICI disturbs the transmitted signal, it degrades the bit error rate (BER). OOB radiation disturbs signals on adjacent frequency bands, so it should be avoided. Several methods have been proposed in the literature to reduce the peak power of OFDM signals and substantial gains were reported. SLM (selective mapping) method is one of the efficient methods to reduce PAPR in OFDM system. However, SLM method has a serious disadvantage high calculation complexity. In this thesis, the proposed method using modified SLM scheme with WHT (Walsh Hadamard transform) to lower the high PAPR of OFDM system and lower the calculation complexity effectively

APA, Harvard, Vancouver, ISO, and other styles

10

Chen, Chien-Hung, and 陳建宏. "The Joint Use of the Walsh-Hadamard Transform and Signal Companding Techniques for PAPR Reduction in OFDM Systems." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/59838485929160687499.

Full text

Abstract:

碩士<br>國立高雄第一科技大學<br>電腦與通訊工程所<br>92<br>The orthogonal frequency division multiplexing (OFDM) technique is one of the most attractive multicarrier modulation schemes for its high bandwidth efficiency and strong immunity to multipath fading. Even though there are many advantages of OFDM, it has two main drawbacks: high Peak to Average Power Ratio (PAPR) and frequency offset. To overcome these PAPR probblems, different methods have been proposed to mitigate the PAPR problem of OFDM. These techniques can be divided into two categories: Signal scrambling and Signal distortion technique. In the thesis, we study the PAPR reduction of OFDM transmission system by jointly using both Walsh-Hadamard transform and companding technique. First, Hadamard transform is used to decompose the correlation relationship of OFDM input sequence. On the other hand, since OFDM signal is similar to speech signals in the sense that large signals occur very infrequently, the companding technique usually applying to these signals might be used to improve OFDM transmission performance. Finally, we verify our analytical results by using Monte Carlo simulation.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Walsh-Hadamard transform"

1

Srivastva, Ranjeet, and Yogendra Narain Singh. "ECG Biometric Analysis Using Walsh–Hadamard Transform." In Advances in Data and Information Sciences. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-8360-0_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Diana Andrushia, A., and R. Thangarjan. "Saliency-Based Image Compression Using Walsh–Hadamard Transform (WHT)." In Biologically Rationalized Computing Techniques For Image Processing Applications. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61316-1_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yang, XiQuan, and Ying Sun. "Significant Target Detection of Traffic Signs Based on Walsh-Hadamard Transform." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22871-2_73.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Dave, Vipul K., Vinay Vakharia, and Sukhjeet Singh. "Ball Bearing Fault Diagnosis Using Mutual Information and Walsh–Hadamard Transform." In Reliability, Safety and Hazard Assessment for Risk-Based Technologies. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-9008-1_51.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Yu, Ying, Jie Lin, and Jian Yang. "Bottom-Up Visual Saliency Using Binary Spectrum of Walsh-Hadamard Transform." In Neural Information Processing. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12643-2_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Dhavale, Sunita V., R. S. Deodhar, and L. M. Patnaik. "Walsh Hadamard Transform Based Robust Blind Watermarking for Digital Audio Copyright Protection." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25734-6_77.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Dave, Vipul, and V. Vakharia. "Fault Diagnosis of Ball Bearing Using Walsh–Hadamard Transform and Random Tree Classifier." In Lecture Notes in Mechanical Engineering. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3746-2_34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Alman, Josh. "Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite Fields using Lookup Tables." In Symposium on Simplicity in Algorithms (SOSA). Society for Industrial and Applied Mathematics, 2023. http://dx.doi.org/10.1137/1.9781611977585.ch13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zheng, Peijia, and Jiwu Huang. "Walsh-Hadamard Transform in the Homomorphic Encrypted Domain and Its Application in Image Watermarking." In Information Hiding. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36373-3_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kekre, H. B., Sudeep D. Thepade, and Varun K. Banura. "Image Retrieval Using Texture Patterns Generated from Walsh-Hadamard Transform Matrix and Image Bitmaps." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20209-4_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Walsh-Hadamard transform"

1

Lee, Man Hee, Muhammad Basit Shahab, Md Fazlul Kader, and Soo Young Shin. "Spatial multiplexing using walsh-hadamard transform." In 2016 International Conference on Smart Green Technology in Electrical and Information Systems (ICSGTEIS). IEEE, 2016. http://dx.doi.org/10.1109/icsgteis.2016.7885764.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lu, Yi. "Practical tera-scale Walsh-Hadamard Transform." In 2016 Future Technologies Conference (FTC). IEEE, 2016. http://dx.doi.org/10.1109/ftc.2016.7821757.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Wei, Zhimin Zhang, Jipeng Jia, and Lin Qi. "STC-GFDM systems with Walsh-Hadamard transform." In 2016 IEEE International Conference on Electronic Information and Communication Technology (ICEICT). IEEE, 2016. http://dx.doi.org/10.1109/iceict.2016.7879674.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bhatnagar, Gaurav, and Balasubramanian Raman. "Robust Watermarking in Multiresolution Walsh-Hadamard Transform." In 2009 IEEE International Advance Computing Conference (IACC 2009). IEEE, 2009. http://dx.doi.org/10.1109/iadcc.2009.4809134.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wei-Ren Peng, I. Morita, and T. Tsuritani. "Modified Walsh-Hadamard Transform for PDL Mitigation." In 39th European Conference and Exhibition on Optical Communication (ECOC 2013). Institution of Engineering and Technology, 2013. http://dx.doi.org/10.1049/cp.2013.1593.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ghosh, Sudip, Somsubhra Talapatra, Santi P. Maity, and Hafizur Rahaman. "A novel VLSI architecture for Walsh-Hadamard transform." In 2010 2nd Asia Symposium on Quality Electronic Design (ASQED 2010). IEEE, 2010. http://dx.doi.org/10.1109/asqed.2010.5548230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

El Allali, Abdelhadi, Jamal Elabbadi, and Elhassan Iben Elahaj. "Video object watermarking using 3D-Walsh Hadamard transform and Arnold transform." In 2012 International Conference on Multimedia Computing and Systems (ICMCS). IEEE, 2012. http://dx.doi.org/10.1109/icmcs.2012.6320214.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Al-Attraqchi, M., S. Boussakta, and S. Le Goff. "An Enhanced OFDM/OQAM System Exploiting Walsh-Hadamard Transform." In 2011 IEEE Vehicular Technology Conference (VTC 2011-Spring). IEEE, 2011. http://dx.doi.org/10.1109/vetecs.2011.5956311.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Uzun-Per, Meryem, and Muhittin Gokmen. "Face recognition with Local Walsh-Hadamard Transform around landmarks." In 2015 23th Signal Processing and Communications Applications Conference (SIU). IEEE, 2015. http://dx.doi.org/10.1109/siu.2015.7130089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Khosravy, Mahdi, Natasha Punkoska, Faramarz Asharif, and Mohammad Reza Asharif. "Acoustic OFDM data embedding by reversible Walsh-Hadamard transform." In INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2014 (ICCMSE 2014). AIP Publishing LLC, 2014. http://dx.doi.org/10.1063/1.4897833.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!