• 제목/요약/키워드: 16 bit communication

Search Result 249, Processing Time 0.026 seconds

A performance analysis of layered LDPC decoder for mobile WiMAX system (모바일 WiMAX용 layered LDPC 복호기의 성능분석)

  • Kim, Eun-Suk;Kim, Hae-Ju;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.921-929
    • /
    • 2011
  • This paper describes an analysis of the decoding performance and decoding convergence speed of layered LDPC(low-density parity-check) decoder for mobile WiMAX system, and the optimal design conditions for hardware implementation are searched. A fixed-point model of LDPC decoder, which is based on the min-sum algorithm and layered decoding scheme, is implemented and simulated using Matlab model. Through fixed-point simulations for the block lengths of 576, 1440, 2304 bits and the code rates of 1/2, 2/3A, 2/3B, 3/4A, 3/4B, 5/6 specified in the IEEE 802.16e standard, the effect of internal bit-width, block length and code rate on the decoding performance are analyzed. Simulation results show that fixed-point bit-width larger than 8 bits with integer part of 5 bits should be used for acceptable decoding performance.

Design of Low-Area and Low-Power 1-kbit EEPROM (저면적.저전력 1Kb EEPROM 설계)

  • Yu, Yi-Ning;Yang, Hui-Ling;Jin, Li-Yan;Jang, Ji-Hye;Ha, Pan-Bong;Kim, Young-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.913-920
    • /
    • 2011
  • In this paper, a logic process based 1-kbit EEPROM IP for RFID tag chips of 900MHz is designed. The cell array of the designed 1-kbit EEPROM IP is arranged in a form of four blocks of 16 rows x 16 columns, that is in a two-dimensional arrangement of one-word EEPROM phantom cells. We can reduce the IP size by making four memory blocks share CG (control gate) and TG (tunnel gate) driver circuits. We propose a TG switch circuit to supply respective TG bias voltages according to operational modes and to keep voltages between devices within 5.5V in terms of reliability in order to share the TG driver circuit. Also, we can reduce the power consumption in the read mode by using a partial activation method to activate just one of four memory blocks. Furthermore, we can reduce the access time by making BL (bit line) switching times faster in the read mode from reduced number of cells connected to each column. We design and compare two 1-kbit EEPROM IPs, two blocks of 32 rows ${\times}$ 16 columns and four blocks of 16 rows ${\times}$ 16 columns, which use Tower's $0.18{\mu}m$ CMOS process. The four-block IP is smaller by 11.9% in the layout size and by 51% in the power consumption in the read mode than the two-block counterpart.

Performance Improvements of WiBro System Using the LVQ Blind Equalization (LVQ 자력등화를 이용한 와이브로 시스템의 성능 개선)

  • Park, Jin-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.10
    • /
    • pp.2247-2253
    • /
    • 2010
  • WiBro(Wireless Broadband Internet) is the standard of high-speed portable internet based on OFDMA/TDD (Orthogonal frequency division multiple access / Time division duplexing) techniques, and the subset of consolidated version of IEEE802.16e Wireless MAN standard. In this paper, we propose performance improvements of WiBro system using the LVQ(Learning Vector Quantization) blind equalization. Proposed method used the prefiltering LVQ neural network blind equalization in the Broadband WiBro system receiver. The prefiltering LVQ neural network constellates 16QAM that is transmitter data shape and the blind equalization removes ICI(Inter Carrier Interference). To verificate the proposed method usability, the MSE(Mean Square Error) and the BER(Bit Error Rate) are simulated. The simulation results shown that is improved the performances of the proposed WiBro system using the LVQ blind equalization than the existing WiBro system.

New High Speed Parallel Multiplier for Real Time Multimedia Systems (실시간 멀티미디어 시스템을 위한 새로운 고속 병렬곱셈기)

  • Cho, Byung-Lok;Lee, Mike-Myung-Ok
    • The KIPS Transactions:PartA
    • /
    • v.10A no.6
    • /
    • pp.671-676
    • /
    • 2003
  • In this paper, we proposed a new First Partial product Addition (FPA) architecture with new compressor (or parallel counter) to CSA tree built in the process of adding partial product for improving speed in the fast parallel multiplier to improve the speed of calculating partial product by about 20% compared with existing parallel counter using full Adder. The new circuit reduces the CLA bit finding final sum by N/2 using the novel FPA architecture. A 5.14nS of multiplication speed of the $16{\times}16$ multiplier is obtained using $0.25\mu\textrm{m}$ CMOS technology. The architecture of the multiplier is easily opted for pipeline design and demonstrates high speed performance.

Design of a Low-Power 8-bit 1-MS/s CMOS Asynchronous SAR ADC for Sensor Node Applications (센서 노드 응용을 위한 저전력 8비트 1MS/s CMOS 비동기 축차근사형 ADC 설계)

  • Jihun Son;Minseok Kim;Jimin Cheon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.16 no.6
    • /
    • pp.454-464
    • /
    • 2023
  • This paper proposes a low-power 8-bit asynchronous SAR ADC with a sampling rate of 1 MS/s for sensor node applications. The ADC uses bootstrapped switches to improve linearity and applies a VCM-based CDAC switching technique to reduce the power consumption and area of the DAC. Conventional synchronous SAR ADCs that operate in synchronization with an external clock suffer from high power consumption due to the use of a clock faster than the sampling rate, which can be overcome by using an asynchronous SAR ADC structure that handles internal comparisons in an asynchronous manner. In addition, the SAR logic is designed using dynamic logic circuits to reduce the large digital power consumption that occurs in low resolution ADC designs. The proposed ADC was simulated in a 180-nm CMOS process, and at a 1.8 V supply voltage and a sampling rate of 1 MS/s, it consumed 46.06 𝜇W of power, achieved an SNDR of 49.76 dB and an ENOB of 7.9738 bits, and obtained a FoM of 183.2 fJ/conv-step. The simulated DNL and INL are +0.186/-0.157 LSB and +0.111/-0.169 LSB.

Selective Demodulation Scheme Based on Log-Likelihood Ratio Threshold

  • Huang, Yuheng;Dong, Yan;Jo, Minho;Liu, Yingzhuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.767-783
    • /
    • 2013
  • This paper aims at designing a selective demodulation scheme based on Log-likelihood Ratio threshold (SDLT) instead of the conventional adaptive demodulation (ADM) scheme, by using rateless codes. The major difference is that the Log-likelihood ratio (LLR) threshold is identified as a key factor to control the demodulation rate, while the ADM uses decision region set (DRS) to adjust the bit rate. In the 16-QAM SDLT scheme, we deduce the decision regions over an additive white Gaussian channel, corresponding to the variation of LLR threshold and channel states. We also derived the equations to calculate demodulation rate and bit error rate (BER), which could be proven by simulation results. We present an adaptation strategy for SDLT, and compare it with ADM and adaptive modulation (AM). The simulation results show that our scheme not only significantly outperforms the ADM in terms of BER, but also achieves a performance as good as the AM scheme. Moreover, the proposed scheme can support much more rate patterns over a wide range of channel states.

Zero-Watermarking Algorithm in Transform Domain Based on RGB Channel and Voting Strategy

  • Zheng, Qiumei;Liu, Nan;Cao, Baoqin;Wang, Fenghua;Yang, Yanan
    • Journal of Information Processing Systems
    • /
    • v.16 no.6
    • /
    • pp.1391-1406
    • /
    • 2020
  • A zero-watermarking algorithm in transform domain based on RGB channel and voting strategy is proposed. The registration and identification of ownership have achieved copyright protection for color images. In the ownership registration, discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) are used comprehensively because they have the characteristics of multi-resolution, energy concentration and stability, which is conducive to improving the robustness of the proposed algorithm. In order to take full advantage of the characteristics of the image, we use three channels of R, G, and B of a color image to construct three master shares, instead of using data from only one channel. Then, in order to improve security, the master share is superimposed with the copyright watermark encrypted by the owner's key to generate an ownership share. When the ownership is authenticated, copyright watermarks are extracted from the three channels of the disputed image. Then using voting decisions, the final copyright information is determined by comparing the extracted three watermarks bit by bit. Experimental results show that the proposed zero watermarking scheme is robust to conventional attacks such as JPEG compression, noise addition, filtering and tampering, and has higher stability in various common color images.

Rotationally Invariant Space-Time Trellis Codes with 4-D Rectangular Constellations for High Data Rate Wireless Communications

  • Sterian, Corneliu Eugen D.;Wang, Cheng-Xiang;Johnsen, Ragnar;Patzold, Matthias
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.258-268
    • /
    • 2004
  • We demonstrate rotationally invariant space-time (ST) trellis codes with a 4-D rectangular signal constellation for data transmission over fading channels using two transmit antennas. The rotational invariance is a good property to have that may alleviate the task of the carrier phase tracking circuit in the receiver. The transmitted data stream is segmented into eight bit blocks and quadrature amplitude modulated using a 256 point 4-D signal constellation whose 2-D constituent constellation is a 16 point square constellation doubly partitioned. The 4-D signal constellation is simply the Cartesian product of the 2-D signal constellation with it-self and has 32 subsets. The partition is performed on one side into four subsets A, B, C, and D with increased minimum-squared Euclidian distance, and on the other side into four rings, where each ring includes four points of equal energy. We propose both linear and nonlinear ST trellis codes and perform simulations using an appropriate multiple-input multiple-output (MIMO) channel model. The 4-D ST codes constructed here demonstrate about the same frame error rate (FER) performance as their 2-D counterparts, having however the added value of rotational invariance.

An optimization technique for simultaneous reduction of PAPR and out-of-band power in NC-OFDM-based cognitive radio systems

  • Kaliki, Sravan Kumar;Golla, Shiva Prasad;Kurukundu, Rama Naidu
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.7-16
    • /
    • 2021
  • Noncontiguous orthogonal frequency division multiplexing (NC-OFDM)-based cognitive radio (CR) systems achieve highly efficient spectrum utilization by transmitting unlicensed users' data on subcarriers of licensed users' data when they are free. However, there are two disadvantages to the NC-OFDM system: out-of-band power (OBP) and a high peak-to-average power ratio (PAPR). OBP arises due to side lobes of an NC-OFDM signal in the frequency domain, and it interferes with the spectrum for unlicensed users. A high PAPR occurs due to the inverse fast Fourier transform (IFFT) block used in an NC-OFDM system, and it induces nonlinear effects in power amplifiers. In this study, we propose an algorithm called "Alternative Projections onto Convex and Non-Convex Sets" that reduces the OBP and PAPR simultaneously. The alternate projections are performed onto these sets to form an iteration, and it converges to the specified limits of in-band-power, peak amplitude, and OBP. Furthermore, simulations show that the bit error rate performance is not degraded while reducing OBP and PAPR.

Optimizations for Mobile MIMO Relay Molecular Communication via Diffusion with Network Coding

  • Cheng, Zhen;Sun, Jie;Yan, Jun;Tu, Yuchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1373-1391
    • /
    • 2022
  • We investigate mobile multiple-input multiple-output (MIMO) molecular communication via diffusion (MCvD) system which is consisted of two source nodes, two destination nodes and one relay node in the mobile three-dimensional channel. First, the combinations of decode-and-forward (DF) relaying protocol and network coding (NC) scheme are implemented at relay node. The adaptive thresholds at relay node and destination nodes can be obtained by maximum a posteriori (MAP) probability detection method. Then the mathematical expressions of the average bit error probability (BEP) of this mobile MIMO MCvD system based on DF and NC scheme are derived. Furthermore, in order to minimize the average BEP, we establish the optimization problem with optimization variables which include the ratio of the number of emitted molecules at two source nodes and the initial position of relay node. We put forward an iterative scheme based on block coordinate descent algorithm which can be used to solve the optimization problem and get optimal values of the optimization variables simultaneously. Finally, the numerical results reveal that the proposed iterative method has good convergence behavior. The average BEP performance of this system can be improved by performing the joint optimizations.