A Fast Computational Algorithm for the Discrete Sine Transform

A sparse-matrix factorization is developed for the discrete sine transform (DST). This factorization has a recursive structure and leads directly to an efficient algorithm for implementing the DST, a feature most desirable and very similar ot that of the DCT. This algorithm requires fewer arithmetic...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on communications Ročník 28; číslo 2; s. 304 - 307
Hlavní autoři: Yip, P., Rao, K.
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.02.1980
Témata:
Bit error rate
Computational modeling
Convolutional codes
Decoding
Discrete transforms
Equations
Error analysis
Power generation
Statistics
Viterbi algorithm
ISSN:0090-6778
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract A sparse-matrix factorization is developed for the discrete sine transform (DST). This factorization has a recursive structure and leads directly to an efficient algorithm for implementing the DST, a feature most desirable and very similar ot that of the DCT. This algorithm requires fewer arithmetic operations compared to that for the discrete cosine transform (DCT).
AbstractList A sparse-matrix factorization is developed for the discrete sine transform (DST). This factorization has a recursive structure and leads directly to an efficient algorithm for implementing the DST, a feature most desirable and very similar ot that of the DCT. This algorithm requires fewer arithmetic operations compared to that for the discrete cosine transform (DCT).
Author Yip, P.
Rao, K.
Author_xml – sequence: 1
  givenname: P.
  surname: Yip
  fullname: Yip, P.
  organization: McMaster Univ., Hamilton, Ont., Canada
– sequence: 2
  givenname: K.
  surname: Rao
  fullname: Rao, K.
BookMark eNotj8tKAzEYRrOoYFt9AHGTF5j65z7ZCMNoVah04bgumcw_NjKXksSFb2_Brj4OBw58K7KY5gkJuWOwYQzsQ1Pv3zfMlmcEK7XSC7IEsFBoY8prskrpGwAkCLEkjxXdupRpPY-nn-xymCc30Gr4mmPIx5H2c6T5iPQpJB8xI_0IE9Imuimd1XhDrno3JLy97Jp8bp-b-rXY7V_e6mpXeK5FLhQ3inOvpWCsk7ZnnnlVeunbrrdW2FaJtjQtQy25wQ64415x0VlQXlkEsSb3_92AiIdTDKOLv4fLPfEHq7VGxA
CODEN IECMBT
CitedBy_id crossref_primary_10_1016_j_laa_2017_05_050
crossref_primary_10_1007_BF02510504
crossref_primary_10_1016_0165_1684_94_00132_J
crossref_primary_10_1109_83_210861
crossref_primary_10_1016_j_cam_2008_05_023
crossref_primary_10_1109_78_502341
crossref_primary_10_1109_78_330383
crossref_primary_10_1109_82_718813
crossref_primary_10_1016_S0165_1684_00_00211_5
crossref_primary_10_1080_00207219308907100
crossref_primary_10_1137_S1064827597330169
crossref_primary_10_1016_j_proeng_2012_01_883
crossref_primary_10_1109_26_46533
crossref_primary_10_1016_0045_7906_90_90007_3
crossref_primary_10_1016_0165_1684_88_90095_3
crossref_primary_10_1109_ACCESS_2021_3120051
crossref_primary_10_1016_j_sigpro_2006_09_003
crossref_primary_10_1109_TBME_1985_325527
crossref_primary_10_1016_0378_4754_85_90061_8
crossref_primary_10_1007_BF01816549
crossref_primary_10_1007_s00034_018_0891_8
crossref_primary_10_1137_17M1114557
crossref_primary_10_1109_TSP_2007_907919
crossref_primary_10_1145_1824801_1824809
crossref_primary_10_1007_BF01190982
crossref_primary_10_1137_S009753970139272X
crossref_primary_10_1007_BF01600005
crossref_primary_10_1007_s11277_014_1819_7
crossref_primary_10_1109_78_542176
crossref_primary_10_1137_0614014
crossref_primary_10_1007_BF01599167
crossref_primary_10_1016_j_imavis_2006_05_018
crossref_primary_10_1109_78_157188
crossref_primary_10_1109_78_298269
crossref_primary_10_1016_0745_7138_91_90011_F
crossref_primary_10_3390_electronics13245056
crossref_primary_10_1016_0165_1684_90_90033_U
crossref_primary_10_1080_02533839_2003_9670764
crossref_primary_10_1109_TSP_2021_3099623
ContentType Journal Article
DOI 10.1109/TCOM.1980.1094656
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Statistics
EndPage 307
ExternalDocumentID 1094656
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACKIV
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
VH1
ZCA
ZCG
ID FETCH-LOGICAL-c263t-527522c64311d49f1c1c58c4cbdf9939b53b87b1e6427ed02a2c523d905c59e03
IEDL.DBID RIE
ISICitedReferencesCount 50
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=1094656&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0090-6778
IngestDate Wed Aug 27 02:49:10 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c263t-527522c64311d49f1c1c58c4cbdf9939b53b87b1e6427ed02a2c523d905c59e03
PageCount 4
ParticipantIDs ieee_primary_1094656
PublicationCentury 1900
PublicationDate 1980-February
PublicationDateYYYYMMDD 1980-02-01
PublicationDate_xml – month: 02
  year: 1980
  text: 1980-February
PublicationDecade 1980
PublicationTitle IEEE transactions on communications
PublicationTitleAbbrev TCOMM
PublicationYear 1980
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0004033
Score 1.3593631
Snippet A sparse-matrix factorization is developed for the discrete sine transform (DST). This factorization has a recursive structure and leads directly to an...
SourceID ieee
SourceType Publisher
StartPage 304
SubjectTerms Bit error rate
Computational modeling
Convolutional codes
Decoding
Discrete transforms
Equations
Error analysis
Power generation
Statistics
Viterbi algorithm
Title A Fast Computational Algorithm for the Discrete Sine Transform
URI https://ieeexplore.ieee.org/document/1094656
Volume 28
WOSCitedRecordID wos1094656&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Xplore
  issn: 0090-6778
  databaseCode: RIE
  dateStart: 19720101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://ieeexplore.ieee.org/
  omitProxy: false
  ssIdentifier: ssj0004033
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61FUMZeLQg3vLASEocJ7GzIFWFigEKEgV1q2L7ApUgRSXl93NOwktiYbNs2bLOsv199t13AMexzCKpaQNaa4mgpCrydIbc04ihSbM0EGUszMOVHI3UZJLcNuDkKxYGEUvnM-y5YvmXb-dm6Z7KaIcnTt6rCU0p4ypW6zsG0he14qRzZ5eq_sGkLqfjwc11j8h1qZ3kBviVSaW8SIbr_5vCBqzVgJH1qxXehAbmHVj9ISPYgbZDjJXgchfO-myYvhWsStdQP_Wx_vPjfDErnl4YgVRGoI-dz-jAIMTM7mggNv7Er1twP7wYDy69OkmCZ4JYFEQkJUEoQ8CCcxsmGTfcRMqERtuMsEeiI6GV1ByJaEi0fpAGhsinTfzIRAn6Yhta-TzHHWBCaevEeXwT8pCb2CWrErHWvlVSUMMudJ1Bpq-VDsa0tsXe39X70HY2rzycD6BVLJZ4CCvmnQyyOCoX7wPbvZe_
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD7MKTgfvGwT7-bBRzuTpm3aF2FMx8RtClbZ22gu1YFuMjt_vydtvYEvvoWEhHBCku9LzvkOwEkgUl9I3IBaayQoSeg7MjXMkcZ4KkkTl-exMA99MRyGo1F0W4HTr1gYY0zufGZatpj_5euZWtinMtzhkZX3WoJl3_NcWkRrfUdBUl5qTlqHdhGWf5jY6Szu3AxaSK9z9SQ7xK9cKvlV0t343yQ2Yb2EjKRdrPEWVMy0Dms_hATrULOYsZBcbsB5m3STt4wUCRvKxz7Sfn6czSfZ0wtBmEoQ9pGLCR4ZiJnJHQ5E4k8E24T77mXc6TllmgRHuQHPkEoKBFEKoQVj2otSppjyQ-UpqVNEH5H0uQyFZAaphjCauomrkH7qiPrKjwzl21CdzqZmBwgPpbbyPFR5zGMqsOmqeCAl1aHg2LALDWuQ8WuhhDEubbH3d_UxrPbiQX_cvxpe70PN2r_wdz6AajZfmENYUe9onPlRvpAf9jibBg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Fast+Computational+Algorithm+for+the+Discrete+Sine+Transform&rft.jtitle=IEEE+transactions+on+communications&rft.au=Yip%2C+P.&rft.au=Rao%2C+K.&rft.date=1980-02-01&rft.pub=IEEE&rft.issn=0090-6778&rft.volume=28&rft.issue=2&rft.spage=304&rft.epage=307&rft_id=info:doi/10.1109%2FTCOM.1980.1094656&rft.externalDocID=1094656
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon