Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation
Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arith...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Hwang, Jeng-Kuang [verfasserIn] Li, Yuan-Ping [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2009 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of VLSI signal processing systems for signal, image and video technology - Springer Netherlands, 1989, 60(2009), 1 vom: 16. Sept., Seite 71-80 |
|---|---|
| Übergeordnetes Werk: |
volume:60 ; year:2009 ; number:1 ; day:16 ; month:09 ; pages:71-80 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11265-009-0404-x |
|---|
| Katalog-ID: |
SPR018322387 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR018322387 | ||
| 003 | DE-627 | ||
| 005 | 20201124222405.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201006s2009 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11265-009-0404-x |2 doi | |
| 035 | |a (DE-627)SPR018322387 | ||
| 035 | |a (SPR)s11265-009-0404-x-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Hwang, Jeng-Kuang |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation |
| 264 | 1 | |c 2009 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required. | ||
| 650 | 4 | |a Discrete Fourier transform |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Efficient complex multiplication |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Complex valued arithmetic |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Sliding DFT |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Li, Yuan-Ping |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of VLSI signal processing systems for signal, image and video technology |d Springer Netherlands, 1989 |g 60(2009), 1 vom: 16. Sept., Seite 71-80 |w (DE-627)SPR018308090 |7 nnns |
| 773 | 1 | 8 | |g volume:60 |g year:2009 |g number:1 |g day:16 |g month:09 |g pages:71-80 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s11265-009-0404-x |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_2027 | ||
| 951 | |a AR | ||
| 952 | |d 60 |j 2009 |e 1 |b 16 |c 09 |h 71-80 | ||
| author_variant |
j k h jkh y p l ypl |
|---|---|
| matchkey_str |
hwangjengkuangliyuanping:2009----:fiinrcriedtceeocmlxaudinlitpeetvmxmm |
| hierarchy_sort_str |
2009 |
| publishDate |
2009 |
| allfields |
10.1007/s11265-009-0404-x doi (DE-627)SPR018322387 (SPR)s11265-009-0404-x-e DE-627 ger DE-627 rakwb eng Hwang, Jeng-Kuang verfasserin aut Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation 2009 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required. Discrete Fourier transform (dpeaa)DE-He213 Efficient complex multiplication (dpeaa)DE-He213 Complex valued arithmetic (dpeaa)DE-He213 Sliding DFT (dpeaa)DE-He213 Li, Yuan-Ping verfasserin aut Enthalten in Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands, 1989 60(2009), 1 vom: 16. Sept., Seite 71-80 (DE-627)SPR018308090 nnns volume:60 year:2009 number:1 day:16 month:09 pages:71-80 https://dx.doi.org/10.1007/s11265-009-0404-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 AR 60 2009 1 16 09 71-80 |
| spelling |
10.1007/s11265-009-0404-x doi (DE-627)SPR018322387 (SPR)s11265-009-0404-x-e DE-627 ger DE-627 rakwb eng Hwang, Jeng-Kuang verfasserin aut Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation 2009 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required. Discrete Fourier transform (dpeaa)DE-He213 Efficient complex multiplication (dpeaa)DE-He213 Complex valued arithmetic (dpeaa)DE-He213 Sliding DFT (dpeaa)DE-He213 Li, Yuan-Ping verfasserin aut Enthalten in Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands, 1989 60(2009), 1 vom: 16. Sept., Seite 71-80 (DE-627)SPR018308090 nnns volume:60 year:2009 number:1 day:16 month:09 pages:71-80 https://dx.doi.org/10.1007/s11265-009-0404-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 AR 60 2009 1 16 09 71-80 |
| allfields_unstemmed |
10.1007/s11265-009-0404-x doi (DE-627)SPR018322387 (SPR)s11265-009-0404-x-e DE-627 ger DE-627 rakwb eng Hwang, Jeng-Kuang verfasserin aut Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation 2009 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required. Discrete Fourier transform (dpeaa)DE-He213 Efficient complex multiplication (dpeaa)DE-He213 Complex valued arithmetic (dpeaa)DE-He213 Sliding DFT (dpeaa)DE-He213 Li, Yuan-Ping verfasserin aut Enthalten in Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands, 1989 60(2009), 1 vom: 16. Sept., Seite 71-80 (DE-627)SPR018308090 nnns volume:60 year:2009 number:1 day:16 month:09 pages:71-80 https://dx.doi.org/10.1007/s11265-009-0404-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 AR 60 2009 1 16 09 71-80 |
| allfieldsGer |
10.1007/s11265-009-0404-x doi (DE-627)SPR018322387 (SPR)s11265-009-0404-x-e DE-627 ger DE-627 rakwb eng Hwang, Jeng-Kuang verfasserin aut Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation 2009 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required. Discrete Fourier transform (dpeaa)DE-He213 Efficient complex multiplication (dpeaa)DE-He213 Complex valued arithmetic (dpeaa)DE-He213 Sliding DFT (dpeaa)DE-He213 Li, Yuan-Ping verfasserin aut Enthalten in Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands, 1989 60(2009), 1 vom: 16. Sept., Seite 71-80 (DE-627)SPR018308090 nnns volume:60 year:2009 number:1 day:16 month:09 pages:71-80 https://dx.doi.org/10.1007/s11265-009-0404-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 AR 60 2009 1 16 09 71-80 |
| allfieldsSound |
10.1007/s11265-009-0404-x doi (DE-627)SPR018322387 (SPR)s11265-009-0404-x-e DE-627 ger DE-627 rakwb eng Hwang, Jeng-Kuang verfasserin aut Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation 2009 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required. Discrete Fourier transform (dpeaa)DE-He213 Efficient complex multiplication (dpeaa)DE-He213 Complex valued arithmetic (dpeaa)DE-He213 Sliding DFT (dpeaa)DE-He213 Li, Yuan-Ping verfasserin aut Enthalten in Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands, 1989 60(2009), 1 vom: 16. Sept., Seite 71-80 (DE-627)SPR018308090 nnns volume:60 year:2009 number:1 day:16 month:09 pages:71-80 https://dx.doi.org/10.1007/s11265-009-0404-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 AR 60 2009 1 16 09 71-80 |
| language |
English |
| source |
Enthalten in Journal of VLSI signal processing systems for signal, image and video technology 60(2009), 1 vom: 16. Sept., Seite 71-80 volume:60 year:2009 number:1 day:16 month:09 pages:71-80 |
| sourceStr |
Enthalten in Journal of VLSI signal processing systems for signal, image and video technology 60(2009), 1 vom: 16. Sept., Seite 71-80 volume:60 year:2009 number:1 day:16 month:09 pages:71-80 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Discrete Fourier transform Efficient complex multiplication Complex valued arithmetic Sliding DFT |
| isfreeaccess_bool |
false |
| container_title |
Journal of VLSI signal processing systems for signal, image and video technology |
| authorswithroles_txt_mv |
Hwang, Jeng-Kuang @@aut@@ Li, Yuan-Ping @@aut@@ |
| publishDateDaySort_date |
2009-09-16T00:00:00Z |
| hierarchy_top_id |
SPR018308090 |
| id |
SPR018322387 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR018322387</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124222405.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2009 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11265-009-0404-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR018322387</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11265-009-0404-x-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hwang, Jeng-Kuang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Fourier transform</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Efficient complex multiplication</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complex valued arithmetic</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sliding DFT</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Yuan-Ping</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of VLSI signal processing systems for signal, image and video technology</subfield><subfield code="d">Springer Netherlands, 1989</subfield><subfield code="g">60(2009), 1 vom: 16. Sept., Seite 71-80</subfield><subfield code="w">(DE-627)SPR018308090</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:60</subfield><subfield code="g">year:2009</subfield><subfield code="g">number:1</subfield><subfield code="g">day:16</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:71-80</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11265-009-0404-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">60</subfield><subfield code="j">2009</subfield><subfield code="e">1</subfield><subfield code="b">16</subfield><subfield code="c">09</subfield><subfield code="h">71-80</subfield></datafield></record></collection>
|
| author |
Hwang, Jeng-Kuang |
| spellingShingle |
Hwang, Jeng-Kuang misc Discrete Fourier transform misc Efficient complex multiplication misc Complex valued arithmetic misc Sliding DFT Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation |
| authorStr |
Hwang, Jeng-Kuang |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR018308090 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation Discrete Fourier transform (dpeaa)DE-He213 Efficient complex multiplication (dpeaa)DE-He213 Complex valued arithmetic (dpeaa)DE-He213 Sliding DFT (dpeaa)DE-He213 |
| topic |
misc Discrete Fourier transform misc Efficient complex multiplication misc Complex valued arithmetic misc Sliding DFT |
| topic_unstemmed |
misc Discrete Fourier transform misc Efficient complex multiplication misc Complex valued arithmetic misc Sliding DFT |
| topic_browse |
misc Discrete Fourier transform misc Efficient complex multiplication misc Complex valued arithmetic misc Sliding DFT |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Journal of VLSI signal processing systems for signal, image and video technology |
| hierarchy_parent_id |
SPR018308090 |
| hierarchy_top_title |
Journal of VLSI signal processing systems for signal, image and video technology |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)SPR018308090 |
| title |
Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation |
| ctrlnum |
(DE-627)SPR018322387 (SPR)s11265-009-0404-x-e |
| title_full |
Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation |
| author_sort |
Hwang, Jeng-Kuang |
| journal |
Journal of VLSI signal processing systems for signal, image and video technology |
| journalStr |
Journal of VLSI signal processing systems for signal, image and video technology |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2009 |
| contenttype_str_mv |
txt |
| container_start_page |
71 |
| author_browse |
Hwang, Jeng-Kuang Li, Yuan-Ping |
| container_volume |
60 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Hwang, Jeng-Kuang |
| doi_str_mv |
10.1007/s11265-009-0404-x |
| author2-role |
verfasserin |
| title_sort |
efficient recursive idft scheme for complex-valued signals in tap-selective maximum-likelihood channel estimation |
| title_auth |
Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation |
| abstract |
Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required. |
| abstractGer |
Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required. |
| abstract_unstemmed |
Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 |
| container_issue |
1 |
| title_short |
Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation |
| url |
https://dx.doi.org/10.1007/s11265-009-0404-x |
| remote_bool |
true |
| author2 |
Li, Yuan-Ping |
| author2Str |
Li, Yuan-Ping |
| ppnlink |
SPR018308090 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11265-009-0404-x |
| up_date |
2024-07-03T18:54:10.542Z |
| _version_ |
1803585166290976768 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR018322387</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124222405.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2009 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11265-009-0404-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR018322387</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11265-009-0404-x-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hwang, Jeng-Kuang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient Recursive IDFT Scheme for Complex-valued Signals in Tap-selective Maximum-likelihood Channel Estimation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper presents several efficient, recursive inverse discrete Fourier transform (IDFT) schemes for complex-valued input data in tap-selective maximum-likelihood channel estimation; the results of their implementation are also presented. The proposed schemes employ only real-valued arithmetic, which reduces the number of required real multiplication operations in comparison with conventional IDFT approaches; however, the number of real additions increases significantly due to the sliding window scheme. The results show that the schemes can reduce the computational complexity and enhance flexibility when only several subsets of the IDFT output bins are required.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Fourier transform</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Efficient complex multiplication</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complex valued arithmetic</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sliding DFT</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Yuan-Ping</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of VLSI signal processing systems for signal, image and video technology</subfield><subfield code="d">Springer Netherlands, 1989</subfield><subfield code="g">60(2009), 1 vom: 16. Sept., Seite 71-80</subfield><subfield code="w">(DE-627)SPR018308090</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:60</subfield><subfield code="g">year:2009</subfield><subfield code="g">number:1</subfield><subfield code="g">day:16</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:71-80</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11265-009-0404-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">60</subfield><subfield code="j">2009</subfield><subfield code="e">1</subfield><subfield code="b">16</subfield><subfield code="c">09</subfield><subfield code="h">71-80</subfield></datafield></record></collection>
|
| score |
7.400528 |