We consider the blind identification of a FIR channel when the errors on the observations (received signal) are bounded. We show that, using the fact that the input signal is in a finite alphabet, the channel parameters and the bound can be estimated on-line. However, since the input sequence is unknown, the number of estimators to be run in parallel grows exponentially fast. A sub-optimal approach is thus considered, which consists in retaining only the K best candidate sequences for the L/sub /spl infin//-norm.
展开▼
机译：当观测值（接收信号）的误差有界时，我们考虑对FIR通道进行盲目识别。我们表明，利用输入信号为有限字母这一事实，可以在线估算通道参数和边界。但是，由于输入序列未知，因此要并行运行的估算器的数量呈指数增长。因此，考虑了次优方法，该方法包括仅保留L / sub / spl infin //-范数的K个最佳候选序列。
展开▼
