The complexity of channel equalization using the BCJR algorithm grows exponentially with the channel memory and signal cardinality. In this paper we present a novel reduced complexity equalization algorithm where independent forward and... more
The complexity of channel equalization using the BCJR algorithm grows exponentially with the channel memory and signal cardinality. In this paper we present a novel reduced complexity equalization algorithm where independent forward and backward trellises are formed based on decision feedback sequence estimation (DFSE) idea. Performance of the new equalizer algorithm is evaluated for turbo equalization of the EDGE (Enhanced Data rate for GSM Evolution) system. We also consider the effect of delayed APP calculation on BER performance and show that BER performance can be improved by choosing a proper delay value depending on the channel impulse response.
The "covariance" of complex random variables and processes, when defined consistently with the corresponding notion for real random variables, is shown to be determined by the usual (complex) covariance together with a quantity... more
The "covariance" of complex random variables and processes, when defined consistently with the corresponding notion for real random variables, is shown to be determined by the usual (complex) covariance together with a quantity called the pseudo-covariance. A characterization of uncorrelatedness and wide-sense stationarity in terms of covariance and pseudo- covariance is given. Complex random variables and processes with a vanishing
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
One consequential feature of Converged Enhanced Ethernet (CEE) is losslessness, achieved through L2 Priority Flow Control (PFC) and Quantized Congestion Notification (QCN). We focus on QCN and its effectiveness in identifying congestive... more
One consequential feature of Converged Enhanced Ethernet (CEE) is losslessness, achieved through L2 Priority Flow Control (PFC) and Quantized Congestion Notification (QCN). We focus on QCN and its effectiveness in identifying congestive flows in input-buffered CEE switches. QCN assumes an idealized, output-queued switch; however, as future switches scale to higher port counts and link speeds, purely output-queued or sharedmemory architectures lead to excessive memory bandwidth requirements; moreover, PFC typically requires dedicated buffers per input. Our objective is to complement PFC’s coarse per-port/priority granularity with QCN’s per-flow control. By detecting buffer overload early, QCN can drastically reduce PFC’s side effects.We install QCN congestion points (CPs) at input buffers with virtual output queues and demonstrate that arrival-based marking cannot correctly discriminate between culprits and victims. Our main contribution is occupancy sampling (QCN-OS), a novel, QCN-c...