2-norm-based iterative design of filterbank transceivers: a control perspective (Q983334): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58646011, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal sampled-data control systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model validation of multirate systems from time-domain experimental data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Design for Channel Equalization via the Filterbank Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of nonuniform filter bank transceivers for frequency selective channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel identification for high speed digital communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear periodically time-varying discrete-time systems: Aliasing and LTI approximations / rank
 
Normal rank

Latest revision as of 01:41, 3 July 2024

scientific article
Language Label Description Also known as
English
2-norm-based iterative design of filterbank transceivers: a control perspective
scientific article

    Statements

    2-norm-based iterative design of filterbank transceivers: a control perspective (English)
    0 references
    0 references
    0 references
    0 references
    22 July 2010
    0 references
    Summary: This paper considers design of filterbank-based transceivers. A composite error criterion is proposed to capture all the three traditional distortions. Incorporating noise attenuation and filter bandlimiting properties into this error criterion, an optimal design procedure is developed and applied to a transceiver design example, yielding an FIR transceiver that has good frequency-selective properties and is close to perfect reconstruction. As a least-squares solution is given in closed form in each iteration, the algorithm is easy to implement.
    0 references
    0 references
    0 references
    0 references