Although numerous channel estimation and multiuser detection approaches have appeared for long-code uplink CDMA systems, joint performance study of channel estimators and symbol detectors remains largely open. In this paper, we construct three typical symbol-level linear receivers upon existing channel estimationmethod, known as zero-forcing (ZF), minimummean-square-error (MMSE), and RAKE recei...

Suppose we have a concatenated code where the outer code is an [N,K,D]Q code, and the inner code is an [n, k, d]q code, with Q = q. In section 4 we will see that the concatenated code is actually an [Nn,Kk, Dd]q code, but for now we will show the weaker property that it is an [Nn,Kk, Dd/2]q. Consider the näıve decoding procedure which uses the inner decoding scheme on each received symbol, then...

MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of redundancy or parity symbols. If an MDS code has r parities and no more than r erasures occur, then by transmitting all the remaining data in the code, the original information can be recovered. However, it was shown that in order to recover a single symbol erasure, only a fraction of 1/...

We proposed a novel rate-1, space-frequency (SF) code for an Orthogonal Frequencey Division Multiplexing (OFDM) system with transmit (M ) and receive (N ) antennas that achieves the maximum diversity attainable over frequencyselective channels. Since the SF code symbol is transmitted in one OFDM block duration, it has smaller processing delay than previously proposed Space-Time-Frequency (STF) ...

We proposed a novel rate-1, space-frequency (SF) code for an Orthogonal Frequencey Division Multiplexing (OFDM) system with transmit (M ) and receive (N ) antennas that achieves the maximum diversity attainable over frequencyselective channels. Since the SF code symbol is transmitted in one OFDM block duration, it has smaller processing delay than previously proposed Space-Time-Frequency (STF) ...

The existing C++ compilers are designed to translate C++ source programs into target codes and then execute them. This translation method is that a compiler that translates C++ source programs to target codes has to be available for each platform. Reusability and portability of codes will also decrease because target codes have to be different for each platform they are run under. For that reas...

Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convolutional codes over both extension elds GF(q = p a) and integer rings Z q are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more eecient for high-rate codes. The suitabil-ity of the proposed algorithms is demonstrated by applying them to a pa...

instructions Control stack Program Data parallel environment communication association Fig. 2. A heterogeneous associative model. represented as an associative frame, and uses associative vectors to facilitate fast backtracking. The vectors are indexed with respect to the base of the current frame. Variable aliases are indicated by filter vectors and are tracked by the alias management table. T...

An adaptive minimum symbol error rate (MSER) linear multiuser detector (MUD) is proposed for direct sequence code division multiple access (DS-CDMA) systems employing multilevel pulseamplitude modulation ( -PAM) scheme. Based on a kernel density estimation for approximating the symbol error rate (SER) from training data, a least mean squares (LMS) style stochastic gradient algorithm called the ...

A pipeline decoder for woven convolutional codes (WCCs) is introduced. The decoding is performed iteratively by shifting a window over the received sequence. For the symbol–by–symbol a posteriori (s/s– APP) decoding of convolutional code segments, a windowed version of the BCJR algorithm is applied. This pipeline concept allows a trade–off between decoding delay, decoding complexity, and perfor...