In this paper, performance of a turbo-coded OFDM system is analyzed and simulated in a power line communication channel. Since the power line communication system typically operates in a hostile environment, turbo code has been employed to enhance reliability of transmitted data. The performance is evaluated in terms of bit error probability. As turbo decoding algorithms, MAP (maximum a posteri...

Given a positive real value δ, a set P of points along a line and a distance function d, in the movement to independence problem, we wish to move the points to new positions on the line such that for every two points pi, pj ∈ P , we have d(pi, pj) ≥ δ while minimizing the sum of movements of all points. This measure of the cost for moving the points was previously unsolved in this setting. Howe...

Let P be a simple polygon and let f(ui; u 0 i)g be m pairs of distinct vertices of P where for every distinct i; j m, there exist pairwise disjoint paths connecting ui to u 0 i and uj to u 0 j. We wish to construct m pairwise disjoint paths in the interior of P connecting ui to u 0 i for i = 1; : : : ; m, with minimal total number of line segments. We give an approximation algorithm which in O(...

It has been suggested that a developmental log-to-linear shift in children’s performance on number line estimation tasks is diagnostic of their underlying representations of numerical magnitude (Siegler & Opfer, 2003). However, in the study presented herein, we were able to induce a similar log-tolinear shift on number line estimation tasks among adults by manipulating their familiarity with th...

We present a deterministic algorithm running in space O log2 n= log log n solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.

We introduce and develop a theory of orthogonality with respect to Sobolev inner products on the real line for sequences functions tridiagonal, skew-Hermitian differentiation matrix. While such L2 -orthogonal systems is well established, requires new concepts their analysis. characterize completely as appropriately weighted Fourier transforms orthogonal polynomials present number illustrative e...

We present a new line sweep algorithm, HeapSweep, for reporting bichromatic (`purple') intersections between a red and a blue family of line segments. If the union of the segments in each family is connected as a point set, HeapSweep reports all k purple intersections in time O((n + k)(n) log 3 n), where n is the total number of input segments and (n) is the familiar inverse Ackermann function....

Given an n-vertex outer-planar graph G and a set P of n points in the plane, we present an O(n log 3 n) time and O(n) space algorithm to compute a straight-line embedding of G in P, improving upon the algorithm in GMPP91, CU96] that requires O(n 2) time. Our algorithm is near-optimal as there is an (n log n) lower bound for the problem BMS95]. We present a simpler O(nd) time and O(n) space algo...