Abstract: In this paper, we focus on the design of a multi-line
copper wire (MLCW) communication system. First, we construct
our proposed MLCW channel and verify its characteristics based
on the Kolmogorov-Smirnov test. In addition, we apply Middleton
class A impulsive noise (IN) to the copper channel for further
investigation. Second, the MIMO G.fast system is adopted utilizing
the proposed MLCW channel model and is compared to a single
line G-fast system. Second, the performance of the coded system
is obtained utilizing concatenated interleaved Reed-Solomon (RS)
code with four-dimensional trellis-coded modulation (4D TCM), and
compared to the single line G-fast system. Simulations are obtained
for high quadrature amplitude modulation (QAM) constellations
that are commonly used with G-fast communications, the results
demonstrate that the bit error rate (BER) performance of the coded
MLCW system shows an improvement compared to the single line
G-fast systems.
Abstract: Cooperative communication provides transmit diversity, even when, due to size constraints, mobile units cannot accommodate multiple antennas. A versatile cooperation method called coded cooperation has been developed, in which cooperation is implemented through channel coding with a view to controlling the errors inherent in wireless communication. In this work we evaluate the performance of coded cooperation in flat Rayleigh fading environment using a concept known as the pair wise error probability (PEP). We derive the PEP for a flat fading scenario in coded cooperation and then compare with the signal-to-noise ratio of the users in the network. Results show that an increase in the SNR leads to a decrease in the PEP. We also carried out simulations to validate the result.
Abstract: Flash memory has become an important storage device
in many embedded systems because of its high performance, low
power consumption and shock resistance. Multi-level cell (MLC) is
developed as an effective solution for reducing the cost and increasing
the storage density in recent years. However, most of flash file system
cannot handle the error correction sufficiently. To correct more errors
for MLC, we implement Reed-Solomon (RS) code to YAFFS, what is
widely used for flash-based file system. RS code has longer computing
time but the correcting ability is much higher than that of Hamming
code.
Abstract: In this paper we proposed multistage adaptive
ARQ/HARQ/HARQ scheme. This method combines pure ARQ
(Automatic Repeat reQuest) mode in low channel bit error rate and
hybrid ARQ method using two different Reed-Solomon codes in
middle and high error rate conditions. It follows, that our scheme has
three stages. The main goal is to increase number of states in adaptive
HARQ methods and be able to achieve maximum throughput for
every channel bit error rate. We will prove the proposal by
calculation and then with simulations in land mobile satellite channel
environment. Optimization of scheme system parameters is described
in order to maximize the throughput in the whole defined Signal-to-
Noise Ratio (SNR) range in selected channel environment.
Abstract: A new code synchronization algorithm is proposed in
this paper for the secondary cell-search stage in wideband CDMA
systems. Rather than using the Cyclically Permutable (CP) code in the
Secondary Synchronization Channel (S-SCH) to simultaneously
determine the frame boundary and scrambling code group, the new
synchronization algorithm implements the same function with less
system complexity and less Mean Acquisition Time (MAT). The
Secondary Synchronization Code (SSC) is redesigned by splitting into
two sub-sequences. We treat the information of scrambling code group
as data bits and use simple time diversity BCH coding for further
reliability. It avoids involved and time-costly Reed-Solomon (RS)
code computations and comparisons. Analysis and simulation results
show that the Synchronization Error Rate (SER) yielded by the new
algorithm in Rayleigh fading channels is close to that of the
conventional algorithm in the standard. This new synchronization
algorithm reduces system complexities, shortens the average
cell-search time and can be implemented in the slot-based cell-search
pipeline. By taking antenna diversity and pipelining correlation
processes, the new algorithm also shows its flexible application in
multiple antenna systems.
Abstract: In this paper, a two factor scheme is proposed to
generate cryptographic keys directly from biometric data, which
unlike passwords, are strongly bound to the user. Hash value of the
reference iris code is used as a cryptographic key and its length
depends only on the hash function, being independent of any other
parameter. The entropy of such keys is 94 bits, which is much higher
than any other comparable system. The most important and distinct
feature of this scheme is that it regenerates the reference iris code by
providing a genuine iris sample and the correct user password. Since
iris codes obtained from two images of the same eye are not exactly
the same, error correcting codes (Hadamard code and Reed-Solomon
code) are used to deal with the variability. The scheme proposed here
can be used to provide keys for a cryptographic system and/or for
user authentication. The performance of this system is evaluated on
two publicly available databases for iris biometrics namely CBS and
ICE databases. The operating point of the system (values of False
Acceptance Rate (FAR) and False Rejection Rate (FRR)) can be set
by properly selecting the error correction capacity (ts) of the Reed-
Solomon codes, e.g., on the ICE database, at ts = 15, FAR is 0.096%
and FRR is 0.76%.