In this communication, necessary and sufficient conditions are presented for the unique blind identification of possibly nonminimum phase channels driven by cyclostationary processes. Using a frequencydomain formulation, it is first shown that a channel can be identified by the second-order statistics of the observation if and only if the channel transfer function does not have special uniformly spaced zeros. This condition leads to several necessary and sufficient conditions on the observation spectra and the channel impulse response. Based on the frequency-domain formulation, a new identification algorithm is proposed

Blind channel identification based on second-order statistics: a frequency-domain approach

Distributed Rs Coded Cooperation: Optimized Code Construction and Decoding by Critical SNR Aided

Matrix factorizations or matrix decompositions are methods that represent a matrix as a product of two or more matrices. There are various types of matrix factorizations such as LU factorization, Cholesky factorization, singular value decomposition etc. Matrix factorization is widely used in pattern recognition, image denoising, data clustering etc. Motivated by these applications, some properties and applications of various types of matrix factorizations are studied. One of the purposes of matrix factorization is to ease the computation. Thus, comparisons in term of computation time of various matrix factorizations in different areas are carried out.

/pdf/some-properties-of-various-types-of-matrix-factorization-193oz4wqim.pdf

Some properties of various types of matrix factorization

Jointly optimized quasi-cyclic LDPC codes for coded-cooperative wireless networks based on split labeling diversity

This chapter introduces the Reed-Solomon (RS) codes and the distributed RS-coded cooperative system over the Rayleigh fading channel, where the encoding and decoding procedures of the RS codes are elaborated. Besides, two optimized selection approaches, i.e., the exhaustive search approach and partial search approach, are employed in the relay to obtain a resultant code at the destination with better weight distribution. Moreover, the two joint decoding algorithms, namely naive and smart algorithms, are presented that further improve the overall average bit error rate (BER) performance of the cooperative scheme. Also, the performance analysis of the distributed RS-coded cooperative scheme is provided in detailed. 

RS Codes and Optimized Distributed RS-Coded Relay Cooperative Communications: Code Constructions and Performance Analysis

. This paper proposes a distributed Reed-Solomon coded cooperative labeling diversity (DRSCC-LD) scheme over the Rayleigh frequency-ﬂat fast fading channel to further improve the BER performance. The non-binary Reed-Solomon (RS) code with more consecutive roots is applied at the relay to provide additional redundancy. As a novel diversity technique, labeling diversity (LD) with three diﬀerent mappers is employed in the proposed DRSCC-LD scheme utilizing 16-QAM and 64-QAM, respectively, which may achieve diversity gain and greatly decrease the error ﬂoor (EF). Be-sides, a reduced-complexity detection algorithm based on a variable signal subset (RC-VSS) is proposed to lower the complexity of detection at both relay and destination. The proposed critical SNR-assisted (CSA) joint decoding algorithm then collaborates with the joint detection based on the RC-VSS algorithm to improve the overall BER performance. Theoretical analysis and Monte Carlo simulated results reveal that the proposed DRSCC-LD scheme clearly outperforms its corresponding non-cooperative RS coded scheme by a gain of more than 7 dB and the existing schemes by a margin of more than 3.5 dB under the identical conditions, respectively.

/pdf/distributed-reed-solomon-coded-cooperative-space-time-1z1xoql2.pdf

Distributed Reed-Solomon Coded Cooperative Space-Time Labeling Diversity Network

Using QR Factorization in Subspace Based Blind Channel Identification

. In order to improve the adverse influence of fading channel in communication system, a distributed Goppa coding scheme is proposed in this paper. Two Goppa codes are set at the source node and the relay node in this scheme respectively. An optimal design criterion at the relay is proposed to obtain the optimal joint resultant code at the destination. Furthermore, two novel joint decoding algorithms are proposed to enhance the overall BER performance of the proposed scheme. Monte Carlo simulations show that the proposed distributed Goppa coding scheme outperforms the non-cooperative scheme. Moreover, the proper information selection approach at the relay performs better than random selection in the proposed distributed Goppa coding scheme.

/pdf/jointly-optimized-design-of-distributed-goppa-codes-and-1mrglzxg.pdf

Jointly Optimized Design of Distributed Goppa Codes and Decoding

. This paper proposes a novel optimized-Goppa-coded cooperative generalized spatial modulation (OGCC-GSM) scheme for short-to-medium information block transmission. In the proposed OGCC-GSM scheme, an efficient Goppa polynomial selection approach is designed to ensure that the selected Goppa codes applied in the source and relay nodes both have the largest minimum Hamming distance (MHD) and the optimal weight distribution. Compared to conventional coded cooperation (CC) with a single antenna, the proposed scheme employs the generalized spatial modulation (GSM) technique to achieve more diversity gains, where each node is equipped with multiple antennas and more than one transmit antenna (TA) is activated at each time-instant transmission. As a benchmark comparison, the OGCC spatial modulation (OGCC-SM) scheme is also investigated with a single TA active. Moreover, the reduced-complexity transmit antenna combination (RC-TAC) selection algorithm utilized in GSM is first developed with the aid of the channel state information (CSI) to reconcile computational complexity and system performance. In addition, joint decoding is conducted on the destination terminal to further enhance the performance of the proposed scheme. The simulated results indicate the performance of the proposed OGCC-GSM scheme is superior to that of its benchmark OGCC-SM scheme, with a substantial reduction in the number of TAs. Besides, Monte Carlo simulations demonstrate that the proposed OGCC-GSM scheme prevails over its counterparts by a margin of over 4.2 dB under identical conditions.

Optimized-Goppa Codes Based on the Effective Selection of Goppa Polynomials for Coded-Cooperative Generalized Spatial Modulation Network

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

C Y Chen

Author Tools

Chat about Author

Papers

Distributed Reed-Solomon Coded Cooperative Space-Time Labeling Diversity Network

Using QR Factorization in Subspace Based Blind Channel Identification

Jointly Optimized Design of Distributed Goppa Codes and Decoding

Optimized-Goppa Codes Based on the Effective Selection of Goppa Polynomials for Coded-Cooperative Generalized Spatial Modulation Network