Relevant bibliographies by topics / Discrete sine transform / Journal articles
To see the other types of publications on this topic, follow the link: Discrete sine transform.

Journal articles on the topic 'Discrete sine transform'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 March 2023

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Discrete sine 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Kober, Vitaly. "Fast Hopping Discrete Sine Transform." IEEE Access 9 (2021): 94293–98. http://dx.doi.org/10.1109/access.2021.3094277.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Zhongde. "Fast discrete sine transform algorithms." Signal Processing 19, no. 2 (February 1990): 91–102. http://dx.doi.org/10.1016/0165-1684(90)90033-u.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kasparyan, M. S. "GENERALIZED DISCRETE ORTHOGONAL SINE-COSINE TRANSFORM." Computer Optics 38, no. 4 (January 1, 2014): 881–85. http://dx.doi.org/10.18287/0134-2452-2014-38-4-881-885.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Britaňák, Vladimir. "A unified discrete cosine and discrete sine transform computation." Signal Processing 43, no. 3 (May 1995): 333–39. http://dx.doi.org/10.1016/0165-1684(95)00010-b.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Zhongde, and Lifeng Wang. "Interpolation using the fast discrete sine transform." Signal Processing 26, no. 1 (January 1992): 131–37. http://dx.doi.org/10.1016/0165-1684(92)90059-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Murty, M. Narayan, and K. Sreekanth. "Relation between Type-II Discrete Sine Transform and Type -I Discrete Hartley Transform." International Journal of Engineering Research and Applications 07, no. 06 (June 2017): 26–30. http://dx.doi.org/10.9790/9622-0706012630.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pan, Sung Bum. "Unified systolic array for fast computation of the discrete cosine transform, discrete sine transform, and discrete Hartley transform." Optical Engineering 36, no. 12 (December 1, 1997): 3439. http://dx.doi.org/10.1117/1.601583.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

CHAU, LAP-PUI, and WAN-CHI SIU. "Transform domain recursive algorithm to compute discrete cosine and sine transforms." International Journal of Electronics 80, no. 3 (March 1996): 433–39. http://dx.doi.org/10.1080/002072196137273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Junhe Zhou and Min Zhang. "All-Optical Discrete Sine Transform and Discrete Cosine Transform Based on Multimode Interference Couplers." IEEE Photonics Technology Letters 22, no. 5 (March 2010): 317–19. http://dx.doi.org/10.1109/lpt.2009.2038713.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Poornachandra, S., V. Ravichandran, and N. Kumaravel. "Mapping of Discrete Cosine Transform (DCT) and Discrete Sine Transform (DST) based on Symmetries." IETE Journal of Research 49, no. 1 (January 2003): 35–42. http://dx.doi.org/10.1080/03772063.2003.11416321.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Brus, Adam, Jiří Hrivnák, and Lenka Motlochová. "Discrete Transforms and Orthogonal Polynomials of (Anti)symmetric Multivariate Sine Functions." Entropy 20, no. 12 (December 6, 2018): 938. http://dx.doi.org/10.3390/e20120938.

Full text
Abstract:
Sixteen types of the discrete multivariate transforms, induced by the multivariate antisymmetric and symmetric sine functions, are explicitly developed. Provided by the discrete transforms, inherent interpolation methods are formulated. The four generated classes of the corresponding orthogonal polynomials generalize the formation of the Chebyshev polynomials of the second and fourth kinds. Continuous orthogonality relations of the polynomials together with the inherent weight functions are deduced. Sixteen cubature rules, including the four Gaussian, are produced by the related discrete transforms. For the three-dimensional case, interpolation tests, unitary transform matrices and recursive algorithms for calculation of the polynomials are presented.
APA, Harvard, Vancouver, ISO, and other styles
12

Choi, Jun-woo, Nam-Uk Kim, Sung-Chang Lim, Jungwon Kang, Hui Yong Kim, and Yung-Lyul Lee. "Shuffled Discrete Sine Transform in Inter-Prediction Coding." ETRI Journal 39, no. 5 (October 2017): 672–82. http://dx.doi.org/10.4218/etrij.17.0116.0867.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Kober, V. "Fast recursive algorithm for sliding discrete sine transform." Electronics Letters 38, no. 25 (2002): 1747. http://dx.doi.org/10.1049/el:20021098.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Ma, W. "Multiplicative complexity of discrete cosine and sine transform." Electronics Letters 27, no. 11 (May 23, 1991): 962–64. http://dx.doi.org/10.1049/el:19910600.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Guo, Jiun-In, Chein-Wei Jen, and Chingson Chen. "Unified array architecture for discrete cosine transform, sine transform and their inverses." Electronics Letters 31, no. 21 (October 12, 1995): 1811–12. http://dx.doi.org/10.1049/el:19951254.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Zhou, Junhe. "Two-Dimensional Discrete Sine Transform and Discrete Cosine Transform Based on Two-Dimensional Multimode Interference Couplers." IEEE Photonics Technology Letters 22, no. 21 (November 2010): 1613–15. http://dx.doi.org/10.1109/lpt.2010.2076356.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Pelaes, E. G., and Y. Iano. "Image coding using discrete sine transform with axis rotation." IEEE Transactions on Consumer Electronics 44, no. 4 (1998): 1284–90. http://dx.doi.org/10.1109/30.735828.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Chiper, D. F., M. N. S. Swamy, M. O. Ahmad, and T. Stouraitis. "A systolic array architecture for the discrete sine transform." IEEE Transactions on Signal Processing 50, no. 9 (September 2002): 2347–54. http://dx.doi.org/10.1109/tsp.2002.801940.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Gupta, A., and K. R. Rao. "A fast recursive algorithm for the discrete sine transform." IEEE Transactions on Acoustics, Speech, and Signal Processing 38, no. 3 (March 1990): 553–57. http://dx.doi.org/10.1109/29.106875.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Curci, Giuseppe, and Fulvio Corsi. "Discrete sine transform for multi-scale realized volatility measures." Quantitative Finance 12, no. 2 (February 2012): 263–79. http://dx.doi.org/10.1080/14697688.2010.490561.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Wang, Z., G. A. Jullien, and W. C. Miller. "Interpolation using the discrete sine transform with increased accuracy." Electronics Letters 29, no. 22 (1993): 1918. http://dx.doi.org/10.1049/el:19931277.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Wang, Z., G. A. Jullien, and W. C. Miller. "Recursive algorithm for discrete sine transform with regular structure." Electronics Letters 30, no. 24 (November 24, 1994): 2011–13. http://dx.doi.org/10.1049/el:19941394.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Jain, Priyanka, Balbir Kumar, and S. B. Jain. "A general design for one dimensional discrete sine transform." Analog Integrated Circuits and Signal Processing 61, no. 2 (February 15, 2009): 211–14. http://dx.doi.org/10.1007/s10470-009-9283-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Kekre, Dr H. B., Dr Tanuja Sarode, and Prachi Natu. "STUDY OF INCREASE IN GLOBAL COMPONENTS IN HYBRID WAVELETS ON DATA COMPRESSION." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 9, no. 2 (July 15, 2013): 1028–39. http://dx.doi.org/10.24297/ijct.v9i2.4173.

Full text
Abstract:
This paper presents a hybrid wavelet transform technique which studies the effect of global components on the quality of image compression. Hybrid wavelet transform is generated using two different component orthogonal transforms. One orthogonal transform represents global featuresof image in betterway and another is used to represent local features. Walsh transform of size 8x8 is used as a base transform i.e. to represent global characteristics of image. Other transforms like DCT, Discrete Real Fourier Transform,DiscreteHartley transform (DHT), Discrete Sine Transform (DST), Discrete Kekre Transform (DKT) and Slant transform of size 32x32 are used to focus on local characteristics of an image.256x256 hybrid wavelet transform is generated and multiple iterations of global components are included using columns of base transform and its effect on reconstructed image quality is observed in terms of Root Mean Square Error (RMSE) and Peak Signal to Noise Ratio (PSNR). Â From the experiments it has been observed that when DCT is used to extract local features, best results are obtained among all combinations with Walsh transform. These results are also compared with Walsh transform and observed to be much superior at higher compression ratios giving better image quality.
APA, Harvard, Vancouver, ISO, and other styles
25

Brus, Adam, Jiří Hrivnák, and Lenka Motlochová. "Connecting (Anti)Symmetric Trigonometric Transforms to Dual-Root Lattice Fourier–Weyl Transforms." Symmetry 13, no. 1 (December 31, 2020): 61. http://dx.doi.org/10.3390/sym13010061.

Full text
Abstract:
Explicit links of the multivariate discrete (anti)symmetric cosine and sine transforms with the generalized dual-root lattice Fourier–Weyl transforms are constructed. Exact identities between the (anti)symmetric trigonometric functions and Weyl orbit functions of the crystallographic root systems A1 and Cn are utilized to connect the kernels of the discrete transforms. The point and label sets of the 32 discrete (anti)symmetric trigonometric transforms are expressed as fragments of the rescaled dual root and weight lattices inside the closures of Weyl alcoves. A case-by-case analysis of the inherent extended Coxeter–Dynkin diagrams specifically relates the weight and normalization functions of the discrete transforms. The resulting unique coupling of the transforms is achieved by detailing a common form of the associated unitary transform matrices. The direct evaluation of the corresponding unitary transform matrices is exemplified for several cases of the bivariate transforms.
APA, Harvard, Vancouver, ISO, and other styles
26

Song, Hyeonju, and Yung-Lyul Lee. "Inverse Transform Using Linearity for Video Coding." Electronics 11, no. 5 (March 1, 2022): 760. http://dx.doi.org/10.3390/electronics11050760.

Full text
Abstract:
In hybrid block-based video coding, transform plays an important role in energy compaction. Transform coding converts residual data in the spatial domain into frequency domain data, thereby concentrating energy in a lower frequency band. In VVC (versatile video coding), the primary transform is performed using DCT-II (discrete cosine transform type 2), DST-VII (discrete sine transform type 7), and DCT-VIII (discrete cosine transform type 8). Considering that DCT-II, DST-VII, and DCT-VIII are all linear transforms, inverse transform is proposed to reduce the number of computations by using the linearity of transform. When the proposed inverse transform using linearity is applied to the VVC encoder and decoder, run-time savings can be achieved without decreasing the coding performance relative to the VVC decoder. It is shown that, under VVC common-test conditions (CTC), average decoding time savings values of 4% and 10% are achieved for all intra (AI) and random access (RA) configurations, respectively.
APA, Harvard, Vancouver, ISO, and other styles
27

Gupta, A., and K. R. Rao. "An efficient FFT algorithm based on the discrete sine transform." IEEE Transactions on Signal Processing 39, no. 2 (1991): 486–90. http://dx.doi.org/10.1109/78.80835.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Murthy, N. R., and M. N. S. Swamy. "On the computation of running discrete cosine and sine transform." IEEE Transactions on Signal Processing 40, no. 6 (June 1992): 1430–37. http://dx.doi.org/10.1109/78.139246.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Murty, M. N., S. S. Nayak, B. Padhy, and S. N. Panda. "Systolic Architecture for Implementation of 2-D Discrete Sine Transform." Procedia Engineering 30 (2012): 441–48. http://dx.doi.org/10.1016/j.proeng.2012.01.883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Fan, Mingquan, and Hongxia Wang. "Chaos-based discrete fractional Sine transform domain audio watermarking scheme." Computers & Electrical Engineering 35, no. 3 (May 2009): 506–16. http://dx.doi.org/10.1016/j.compeleceng.2008.12.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Macleod, M. D. "Comment: Interpolation using the discrete sine transform with increased accuracy." Electronics Letters 30, no. 6 (March 17, 1994): 479–80. http://dx.doi.org/10.1049/el:19940337.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Wang, Z., G. A. Jullien, and W. C. Miller. "Reply: Interpolation using the discrete sine transform with increased accuracy." Electronics Letters 30, no. 6 (March 17, 1994): 480. http://dx.doi.org/10.1049/el:19940338.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Jain, Priyanka, Balbir Kumar, and Shail Bala Jain. "Discrete sine transform and its inverse—realization through recursive algorithms." International Journal of Circuit Theory and Applications 36, no. 4 (2008): 441–49. http://dx.doi.org/10.1002/cta.447.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Yip, P., and Fangming Wang. "A prime-factor decomposed algorithm for the discrete sine transform." Computers & Electrical Engineering 16, no. 1 (January 1990): 43–49. http://dx.doi.org/10.1016/0045-7906(90)90007-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Tabassum, Saadia, Sajjad Hussain, and Abdul Ghafoor. "Peak to Average Power Ratio Reduction in NC–OFDM Systems." Journal of Electrical Engineering 66, no. 3 (May 1, 2015): 154–58. http://dx.doi.org/10.2478/jee-2015-0024.

Full text
Abstract:
Abstract Non contiguous orthogonal frequency division multiplexing (NC-OFDM) is an efficient and adaptable multicarrier modulation scheme to be used in cognitive radio communications. However like OFDM, NC-OFDM also suffers from the main drawback of high peak to average power ratio (PAPR). In this paper PAPR has been reduced by employing three different trigonometric transforms. Discrete cosine transform (DCT), discrete sine transform (DST) and fractional fourier transform (FRFT) has been combined with conventional selected level mapping (SLM) technique to reduce the PAPR of both OFDM and NC-OFDM based systems. The method combines all the transforms with SLM in different ways. Transforms DCT, DST and FRFT have been applied before the SLM block or inside the SLM block before IFFT. Simulation results show the comparative analysis of all the transforms using SLM in case of both OFDM and NC-OFDM based systems.
APA, Harvard, Vancouver, ISO, and other styles
36

CHIPER, DORU FLORIN. "A new integer algorithm for an efficient VLSI implementation of DST using obfuscation technique." Journal of Engineering Sciences and Innovation 7, no. 1 (March 5, 2022): 97–104. http://dx.doi.org/10.56958/jesi.2022.7.1.97.

Full text
Abstract:
In this paper we propose a new VLSI algorithm for an integer based discrete sine transform (IntDST) that allows an efficient VLSI implementation using systolic arrays. The proposed algorithm have all the benefits of an integer transform as a good approximation of irrational transform coefficients and allows an efficient restructuring into a regular and modular computation structure that allows an efficient VLSI implementation using systolic arrays. An efficient VLSI architecture for discrete sine transform can be obtained that allows an efficient incorporation of the obfuscation technique that significantly improves the hardware security and offering high speed performances due to a concurrent computation and using pipelining technique at a low hardware complexity.
APA, Harvard, Vancouver, ISO, and other styles
37

Tereshchenko, Andrii, and Valeriy Zadiraka. "Implementation of Multidigit Multiplication Basing on Discrete Cosine and Sine Transforms." Cybernetics and Computer Technologies, no. 4 (December 30, 2021): 61–79. http://dx.doi.org/10.34229/2707-451x.21.4.7.

Full text
Abstract:
Introduction. The emergence of new parallel computing systems such as multi-core processors, clusters, distributed systems, due to the solution of various applications in different spheres. Among such problems are the calculation of systems of linear algebraic equations with the number of unknown 33-35 million, the calculation of nuclear reactor shells, modeling of physical and chemical processes, aerodynamics, hydrodynamics, information security, and so on. This greatly expands the use of multidigit arithmetic, due to the fact that ignoring rounding errors leads to the fact that sometimes computer solutions are obtained that do not correspond to the physical content. Multidigit multiplication operation is an integral part of the exponentiation by module operation, the speed of which determines the speed of asymmetric cryptographic software and hardware complexes. This paper presents algorithms for implementing the multiplication operation of two N-digit numbers based on discrete cosine and sine transforms (DCT and DST) by separating the calculation for the real and imaginary parts of the DFT. Calculation of DCT and DST at the expense of additional bit shifts, additions and subtractions reduces the algorithm complexity to linear complexity by the number of integer multiplication operations. The purpose of the article is to reduce the number of multiplication operations to speed up the execution time of the multiplication operation of two N-bit numbers based on discrete transforms. Reduce the number of complex multiplication operations. Reduce the overall computational complexity and find a modification in which the calculation steps will correspond to DCT, DSP, IDCT and IDST. Use the coefficients to take into account the rounding errors to exclude multiplication operations on calculating DCT, DST, IDCT and IDST. Results. The relationship between DCT, DST and DFT of a real signal is considered, which allows to separate calculations for real and imaginary parts of DFT of real signals. The computational complexity is reduced almost twice at the expense of use of DFT properties of real signals. It is shown that after optimization steps of the algorithm calculation correspond to DCT, DST, IDCT and IDST. Using additional coefficients, which allow to take into account rounding errors at each step so that all calculations use integers. An analysis of the choice of word length in the calculation is given. For each algorithm, examples of calculation are given. Tables of dependence of the minimum lengths of the coefficients on the length of the multidigit number and the length of the digit (in bits) are given. Conclusions. Multiplication algorithms of two N-digit numbers based on discrete cosine and sine transforms (DCT and DST) are presented in this paper. Separating the calculation for the real and imaginary parts of the DFT allows to reduce the number of multiplication operations by 33%. The use of additional coefficients and calculation of DCT, DST, IDCT, IDST at the expense of bit shifts, additions and subtractions reduces the complexity of the multiplication algorithm of two N-digit numbers to linear complexity by the number of simple integer multiplication operations. Based on comparative analysis, it is shown that the proposed method of multiplication based on DCT and DST using integers begins to exceed the Karatsuba method by the number of 32-bit multiplication operations when multiplying numbers, starting with a length of 4096 bits. Keywords: multidigit multiplication, multidigit arithmetic, asymmetric cryptography, discrete cosine transform, discrete sine transform, discrete Fourier transform, fast algorithm for Fourier calculation.
APA, Harvard, Vancouver, ISO, and other styles
38

Kim, Do Nyeon. "Two-dimensional discrete sine transform scheme for image mirroring and rotation." Journal of Electronic Imaging 17, no. 1 (January 1, 2008): 013011. http://dx.doi.org/10.1117/1.2885257.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Wang Zhongde. "Comments on "A Fast Computational Algorithm for the Discrete Sine Transform"." IEEE Transactions on Communications 34, no. 2 (February 1986): 204–5. http://dx.doi.org/10.1109/tcom.1986.1096496.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Kar, D. C., and V. V. Bapeswara Rao. "On the prime factor decomposition algorithm for the discrete sine transform." IEEE Transactions on Signal Processing 42, no. 11 (1994): 3258–60. http://dx.doi.org/10.1109/78.330383.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Martucci, Stephen A. "Digital filtering of images using the discrete sine or cosine transform." Optical Engineering 35, no. 1 (January 1, 1996): 119. http://dx.doi.org/10.1117/1.600882.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Al-kamali, Faisal. "New single-carrier transceiver scheme based on the discrete sine transform." Journal of Engineering 2014, no. 5 (May 1, 2014): 214–18. http://dx.doi.org/10.1049/joe.2013.0189.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Chiper, Doru Florin. "A HARDWARE ACCELERATOR FOR THE COMPUTATION OF MODIFIED DISCRETE SINE TRANSFORM." Annals of the Academy of Romanian Scientists Series on Science and Technology of Information 14, no. 1-2 (2021): 57–66. http://dx.doi.org/10.56082/annalsarsciinfo.2021.1-2.57.

Full text
Abstract:
This work presents an efficient hardware implementation of a hardware accelerator for the computation of the Modified Discrete Sine transform (MDST) using a new VLSI algorithm based on a appropriate reformulation of the MDST algorithm using some auxiliary input and output sequences. The obtained hardware implementation is using a low complexity implementation based on only adders/subtracters and has a reduced critical path that can be exploited to obtain a significant reduction of the power consumption.
APA, Harvard, Vancouver, ISO, and other styles
44

Keefe, C. Dale, and Melvin B. Comisarow. "Exact Interpolation of Apodized, Magnitude-Mode Fourier Transform Spectra." Applied Spectroscopy 43, no. 4 (May 1989): 605–7. http://dx.doi.org/10.1366/0003702894202418.

Full text
Abstract:
A procedure is developed for the exact interpolation of apodized, magnitude-mode Fourier transform (FT) spectra. The procedure gives the true center frequency, i.e., the location of the continuous peak, from just the largest three discrete intensities in the discrete magnitude spectrum. The procedure is applicable for the peaks in the apodized magnitude spectrum of a time signal of the form f( t) = cos( ωt) exp(– t/τ). There are no restrictions on the value of the damping ratio T/τ. The procedure is demonstrated for the sine-bell and Hanning windows and is generalizable to other windows which consist of a sum of constants and sine/cosine terms. This includes the majority of commonly used windows.
APA, Harvard, Vancouver, ISO, and other styles
45

Zhi Yion, Khoo, and Ab Al-Hadi Ab Rahman. "Exploring the Design Space of HEVC Inverse Transforms with Dataflow Programming." Indonesian Journal of Electrical Engineering and Computer Science 6, no. 1 (April 1, 2017): 104. http://dx.doi.org/10.11591/ijeecs.v6.i1.pp104-109.

Full text
Abstract:
<p>This paper presents the design space exploration of the hardware-based inverse fixed-point integer transform for High Efficiency Video Coding (HEVC). The designs are specified at high-level using CAL dataflow language and automatically synthesized to HDL for FPGA implementation. Several parallel design alternatives are proposed with trade-off between performance and resource. The HEVC transform consists of several independent components from 4x4 to 32x32 discrete cosine transform and 4x4 discrete sine transform. This work explores the strategies to efficiently compute the transforms by applying data parallelism on the different components. Results show that an intermediate version of parallelism, whereby the 4x4 and 8x8 are merged together, and the 16x16 and 32x32 merged together gives the best trade-off between performance and resource. The results presented in this work also give an insight on how the HEVC transform can be designed efficiently in parallel for hardware implementation.</p>
APA, Harvard, Vancouver, ISO, and other styles
46

Jain, Priyanka, Balbir Kumar, and Shailbala Jain. "An efficient approach for realization of discrete sine transform and its inverse." IETE Journal of Research 54, no. 4 (2008): 285. http://dx.doi.org/10.4103/0377-2063.44232.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Meher, Pramod Kumar, and M. N. S. Swamy. "New Systolic Algorithm and Array Architecture for Prime-Length Discrete Sine Transform." IEEE Transactions on Circuits and Systems II: Express Briefs 54, no. 3 (March 2007): 262–66. http://dx.doi.org/10.1109/tcsii.2006.889453.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Scarabotti, Fabio. "The Discrete Sine Transform and the Spectrum of the Finiteq-ary Tree." SIAM Journal on Discrete Mathematics 19, no. 4 (January 2005): 1004–10. http://dx.doi.org/10.1137/s0895480104445344.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Wang, Zhongde, and Shenglong Xu. "Comments on “on the computation and the effectiveness of discrete sine transform”." Computers & Electrical Engineering 12, no. 1-2 (January 1986): 23–27. http://dx.doi.org/10.1016/0045-7906(86)90016-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Kosloff, Dan, and José M. Carcione. "Two-dimensional simulation of Rayleigh waves with staggered sine/cosine transforms and variable grid spacing." GEOPHYSICS 75, no. 4 (July 2010): T133—T140. http://dx.doi.org/10.1190/1.3429951.

Full text
Abstract:
Simulation of Rayleigh waves requires high accuracy and an adequate spatial sampling at the surface. Discrete cosine and sine transforms are used to compute spatial derivatives along the direction perpendicular to the surface of the earth. Unlike the standard Fourier method, these transforms allow nonperiodic boundary conditions to be satisfied, in particular, the stress-free conditions at the surface. Because simulation of surface waves requires more points per minimum wavelength at the surface than simulation of body waves, the equispaced grid is not efficient. To overcome this problem, a grid compression is performed at the surface to obtain a denser spatial sampling. Grid size is minimal at the surface and increases with depth until reaching, at a relatively shallow depth, the grid points per wavelength required by the body waves. The stress-free boundary conditions are naturally handled by expanding the appropriate stress components in terms of the discrete sine transform. The wave equation is solved in the particle-velocity and stress formulation using a Runge-Kutta time integration and the convolutional PML (CPML) method to prevent reflections from the mesh boundaries. The simulations are very accurate for shallow sources and receivers and large offsets.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Discrete sine transform' for other source types:
Dissertations / Theses
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!

To the bibliography