Exhaustive Search and Power-Based Gradient Descent Algorithms for Time-Delayed FIR Models

<div>The parameter estimation errors <svg height="8.11156pt" id="M203" style="vertical-align:-2.15065pt" version="1.1" viewbox="-0.0498162 -5.96091 5.41045 8.11156" width="5.41045pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M384 393C384 425 346 448 294 448C244 448 200 431 150 399C75 351 23 271 23 176C23 90 52 45 132 19C150 13 166 9 195 2C245 -10 260 -27 260 -55C260 -92 234 -127 218 -145L237 -159C271 -137 333 -93 333 -18C333 43 283 62 228 74C199 80 186 84 172 89C116 109 101 150 101 210C101 318 164 400 241 400C276 400 301 390 327 356C334 347 338 343 346 345C367 349 384 374 384 393Z"></path></g></svg> versus <span class="nowrap"><svg height="9.49473pt" id="M204" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 6.66314 9.49473" width="6.66314pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M480 416C480 431 465 448 438 448C388 448 312 383 252 330C217 299 188 273 155 237H153L257 680C262 700 263 712 253 712C240 712 183 684 97 674L92 648L126 647C166 646 172 645 163 606L23 -6L29 -12C51 -5 77 2 107 8C115 62 130 128 142 180C153 193 179 220 204 241C231 170 259 106 288 54C317 0 336 -12 358 -12C381 -12 423 2 477 80L460 100C434 74 408 54 398 54C385 54 374 65 351 107C326 154 282 241 263 299C296 332 351 377 403 377C424 377 436 372 445 368C449 366 456 368 462 375C472 386 480 402 480 416Z"></path></g></svg>.</span></div>

Complexity

fig1

Figure 1

Figure 1: Exhaustive Search and Power-Based Gradient Descent Algorithms for Time-Delayed FIR Models 