318 research outputs found
A low Complexity Wireless Gigabit Ethernet IFoF 60 GHz H/W Platform and Issues
6 pagesInternational audienceThis paper proposes a complete IFoF system architecture derived from simplified IEEE802.15.3c PHY layer proposal to successfully ensure near 1 Gbps on the air interface. The system architecture utilizes low complexity baseband processing modules. The byte/frame synchronization technique is designed to provide a high value of preamble detection probability and a very small value of the false detection probability. Conventional Reed-Solomon RS (255, 239) coding is used for Channel Forward Error Correction (FEC). Good communication link quality and Bit Error Rate (BER) results at 875 Mbps are achieved with directional antennas
Block-MDS QC-LDPC Codes for Information Reconciliation in Key Distribution
Quantum key distribution (QKD) is a popular protocol that provides
information theoretically secure keys to multiple parties. Two important
post-processing steps of QKD are 1) the information reconciliation (IR) step,
where parties reconcile mismatches in generated keys through classical
communication, and 2) the privacy amplification (PA) step, where parties
distill their common key into a new secure key that the adversary has little to
no information about. In general, these two steps have been abstracted as two
distinct problems. In this work, we consider a new technique of performing the
IR and PA steps jointly through sampling that relaxes the requirement on the IR
step, allowing for more success in key creation. We provide a novel LDPC code
construction known as Block-MDS QC-LDPC codes that can utilize the relaxed
requirement by creating LDPC codes with pre-defined sub-matrices of full-rank.
We demonstrate through simulations that our technique of sampling can provide
notable gains in successfully creating secret keys.Comment: 7 pages, 1 figure, submitted to the International Symposium on
Information Theory (ISIT) 202
VLSI Implementation of a Rate Decoder for Structural LDPC Channel Codes
AbstractThis paper proposes a low complexity low-density parity check decoder (LDPC) design. The design mainly accomplishes a message passing algorithm and systolic high throughput architecture. The typical mathematical calculations are based on the observation that nodes with high log likelihood ratio provide almost same information in every iteration and can be considered as stationary, we propose an algorithm in which the parity check matrix H is updated to a reduced complexity form every time a stationary node is encountered which results in lesser number of numerical computations in subsequent iterations. In this paper, we contemplately focuses on computational complexity and the decoder design significantly benefits from the high throughput point of view and the various improvisations introduced at various levels of abstraction in the decoder design. Threshold Controlled Min Sum Algorithm implements the LDPC decoder design for a code compliant with wired and wireless applications. A high performance LDPC decoder has been designed that achieves a throughput of 0.890 Gbps. The whole design of LDPC Decoder is designed, simulated and synthesized using Xilinx ISE 13.1 EDA Tool
Bridging the complexity gap in Tbps-achieving THz-band baseband processing
Recent advances in electronic and photonic technologies have allowed
efficient signal generation and transmission at terahertz (THz) frequencies.
However, as the gap in THz-operating devices narrows, the demand for
terabit-per-second (Tbps)-achieving circuits is increasing. Translating the
available hundreds of gigahertz (GHz) of bandwidth into a Tbps data rate
requires processing thousands of information bits per clock cycle at
state-of-the-art clock frequencies of digital baseband processing circuitry of
a few GHz. This paper addresses these constraints and emphasizes the importance
of parallelization in signal processing, particularly for channel code
decoding. By leveraging structured sub-spaces of THz channels, we propose
mapping bits to transmission resources using shorter code words, extending
parallelizability across all baseband processing blocks. THz channels exhibit
quasi-deterministic frequency, time, and space structures that enable efficient
parallel bit mapping at the source and provide pseudo-soft bit reliability
information for efficient detection and decoding at the receiver
- …