Preferred Language
Articles
/
joe-220
Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix
...Show More Authors

The encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and this introduces extra complexity over the codes with full rank parity matrix. In this paper an encoding scheme of QC-LDPC codes is presented that is suitable for codes with full rank parity matrix and rank deficient parity matrx. The extra effort required by the codes with rank deficient parity matrix over the codes of full rank parity matrix is investigated.

 

 

View Publication Preview PDF
Quick Preview PDF
Publication Date
Sat Apr 09 2022
Journal Name
Wireless Personal Communications
Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
...Show More Authors

View Publication
Scopus Clarivate Crossref
Publication Date
Sun Oct 02 2005
Journal Name
Journal Of The Faculty Of Medicine Baghdad
parity and atherosclerosis
...Show More Authors

Background:

View Publication Preview PDF
Crossref
Publication Date
Sat Feb 26 2022
Journal Name
Iraqi Journal Of Science
New Class of Rank 1 Update for Solving Unconstrained Optimization Problem: New Class of Rank 1 Update for solving Unconstrained Optimization Problem
...Show More Authors

     The focus of this article is to add a new class of rank one of  modified Quasi-Newton techniques to solve the problem of unconstrained optimization by updating the inverse Hessian matrix with an update of rank 1, where a diagonal matrix is the first component of the next inverse Hessian approximation, The inverse Hessian matrix is  generated by the method proposed which is symmetric and it satisfies the condition of modified quasi-Newton, so the global convergence is retained. In addition, it is positive definite that  guarantees the existence of the minimizer at every iteration of the objective function. We use  the program MATLAB to solve an algorithm function to introduce the feasibility of

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (1)
Scopus Crossref
Publication Date
Mon Aug 01 2011
Journal Name
Journal Of Engineering
LDPC CODED MULTIUSER MC-CDMA PERFORMANCE OVERMULTIPATH RAYLEIGH FADING CHANNEL
...Show More Authors

This work presents the simulation of a Low density Parity Check (LDPC) coding scheme with
multiuserMulti-Carrier Code Division Multiple Access (MC-CDMA) system over Additive White
Gaussian Noise (AWGN) channel and multipath fading channels. The decoding technique used in
the simulation was iterative decoding since it gives maximum efficiency with ten iterations.
Modulation schemes that used are Phase Shift Keying (BPSK, QPSK and 16 PSK), along with the
Orthogonal Frequency Division Multiplexing (OFDM). A 12 pilot carrier were used in the estimator
to compensate channel effect. The channel model used is Long Term Evolution (LTE) channel with
Technical Specification TS 25.101v2.10 and 5 MHz bandwidth including the chan

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat Dec 30 2023
Journal Name
Iraqi Journal Of Science
On Almost Maximum Distance Separable Codes
...Show More Authors

The main goal of this paper is to make link between the subjects of projective
geometry, vector space and linear codes. The properties of codes and some examples
are shown. Furthermore, we will give some information about the geometrical
structure of the arcs. All these arcs are give rise to an error-correcting code that
corrects the maximum possible number of errors for its length.

View Publication Preview PDF
Publication Date
Mon Apr 15 2019
Journal Name
Proceedings Of The International Conference On Information And Communication Technology
Hybrid LDPC-STBC communications system based on chaos
...Show More Authors

View Publication
Scopus Clarivate Crossref
Publication Date
Sun Jun 20 2021
Journal Name
Baghdad Science Journal
Projective MDS Codes Over GF(27)‎
...Show More Authors

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix.   In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over  of length  and 28 have been found.

View Publication Preview PDF
Scopus (3)
Scopus Clarivate Crossref
Publication Date
Tue Aug 31 2021
Journal Name
Iraqi Journal Of Science
Image Watermarking Based on IWT and Parity Bit Checking
...Show More Authors

     Various document types play an influential role in a lot of our lives activities today; hence preserving their integrity is an important matter. Such documents have various forms, including texts, videos, sounds, and images.  The latter types' authentication will be our concern here in this paper. Images can be handled spatially by doing the proper modification directly on their pixel values or spectrally through conducting some adjustments to some of the addressed coefficients. Due to spectral (frequency) domain flexibility in handling data, the domain coefficients are utilized for the watermark embedding purpose. The integer wavelet transform (IWT), which is a wavelet transform based on the lifting scheme,

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
Positive Definiteness of Symmetric Rank 1 (H-Version) Update for Unconstrained Optimization
...Show More Authors

Several attempts have been made to modify the quasi-Newton condition in order to obtain rapid convergence with complete properties (symmetric and positive definite) of the inverse of  Hessian matrix (second derivative of the objective function). There are many unconstrained optimization methods that do not generate positive definiteness of the inverse of Hessian matrix. One of those methods is the symmetric rank 1( H-version) update (SR1 update), where this update satisfies the quasi-Newton condition and the symmetric property of inverse of Hessian matrix, but does not preserve the positive definite property of the inverse of Hessian matrix where the initial inverse of Hessian matrix is positive definiteness. The positive definite prope

... Show More
View Publication Preview PDF
Scopus (9)
Crossref (7)
Scopus Clarivate Crossref
Publication Date
Fri Jul 21 2023
Journal Name
Journal Of Engineering
Performance Evaluation and Comparison Between LDPC and Turbo Coded MC-CDMA
...Show More Authors

This work presents a comparison between the Convolutional Encoding CE, Parallel Turbo code and Low density Parity Check (LDPC) coding schemes with a MultiUser Single Output MUSO Multi-Carrier Code Division Multiple Access (MC-CDMA) system over multipath fading channels. The decoding technique used in the simulation was iterative decoding since it gives maximum efficiency at higher iterations. Modulation schemes used is Quadrature Amplitude Modulation QAM. An 8 pilot carrier were
used to compensate channel effect with Least Square Estimation method. The channel model used is Long Term Evolution (LTE) channel with Technical Specification TS 25.101v2.10 and 5 MHz bandwidth bandwidth including the channels of indoor to outdoor/ pedestrian

... Show More
View Publication Preview PDF
Crossref (1)
Crossref