• Title/Summary/Keyword: Receiver Complexity

Search Result 314, Processing Time 0.03 seconds

Transmit Antenna Selection for Spatial Multiplexing with Per Antenna Rate Control and Successive Interference Cancellation (순차적인 간섭제거를 사용하는 공간 다중화 전송 MIMO 시스템의 전송 안테나 선택 방법에 관한 연구)

  • Mun Cheol;Jung Chang-Kyoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6C
    • /
    • pp.560-569
    • /
    • 2005
  • This paper proposes an algorithm for transmit antenna selection in a multi-input multi-output(MIMO) spatial multiplexing system with per antenna rate control(PARC) and an ordered successive interference cancellation (OSIC) receiver. The active antenna subset is determined at the receiver and conveyed to the transmitter using feedback information on transmission rate per antenna. We propose a serial decision procedure consisting of a successive process that tests whether antenna selection gain exists when the antenna with the lowest pre-processing signal to interference and noise ratio(SINR) is discarded at each stage. Furthermore, we show that 'reverse detection ordering', whereby the signal with the lowest SINR is decoded at each stage of successive decoding, widens the disparities among fractions of the whole capacity allocated to each individual antenna and thus maximizes a gain of antenna selection. Numerical results show that the proposed reverse detection ordering based serial antenna selection approaches the closed-loop MIMO capacity and that it induces a negligible capacity loss compared with the heuristic selection strategy even with considerably reduced complexity.

Research on Digital Complex-Correlator of Synthetic Aperture Radiometer: theory and simulation result

  • Jingye, Yan;Ji, Wu;Yunhua, Zhang;Jiang, Changhong;Tao, Wang;Jianhua, Ren;Jingshan, Jiang
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.587-592
    • /
    • 2002
  • A new digital correlator fur an airborne synthetic aperture radiometer was designed in order to replace the conventional analog correlator unit which will become very complicated while the number of channels is increasing. The digital correlator uses digital IQ demodulator instead of the intermediate frequency (IF) phase shifter to make the correlation processing performed digitally at base band instead of analogly at IF. This technique has been applied to the digital receiver in softradio. The down-converted IF signals from each pair of receiver channels become low rate base-band digital signals after under-sampled, Digitally Down-Converted (DDC), decimated and filtered by FIR filters. The digital signals are further processed by two digital multipliers (complex correlation), the products are integrated by the integrators and finally the outputs from the integrators compose of the real part and the imaginary part of a sample of the visibility function. This design is tested by comparing the results from digital correlators and that from analog correlators. They are agreed with each other very well. Due to the fact that the digital correlators are realized with the help of Analog-Digital Converter (ADC) chips and the FPGA technology, the realized volume, mass, power consumption and complexity turned out to be greatly reduced compared with that of the analog correlators. Simulations show that the resolution of ADC has an influence on the synthesized antenna patterns, but this can be neglected if more than 2bit is used.

  • PDF

Spatial Correlation-based Resource Sharing in Cognitive Radio SWIPT Networks

  • Rong, Mei;Liang, Zhonghua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3172-3193
    • /
    • 2022
  • Cognitive radio-simultaneous wireless information and power transfer (CR-SWIPT) has attracted much interest since it can improve both the spectrum and energy efficiency of wireless networks. This paper focuses on the resource sharing between a point-to-point primary system (PRS) and a multiuser multi-antenna cellular cognitive radio system (CRS) containing a large number of cognitive users (CUs). The resource sharing optimization problem is formulated by jointly scheduling CUs and adjusting the transmit power at the cognitive base station (CBS). The effect of accessing CUs' spatial channel correlation on the possible transmit power of the CBS is investigated. Accordingly, we provide a low-complexity suboptimal approach termed the semi-correlated semi-orthogonal user selection (SC-SOUS) algorithm to enhance the spectrum efficiency. In the proposed algorithm, CUs that are highly correlated to the information decoding primary receiver (IPR) and mutually near orthogonal are selected for simultaneous transmission to reduce the interference to the IPR and increase the sum rate of the CRS. We further develop a spatial correlation-based resource sharing (SC-RS) strategy to improve energy sharing performance. CUs nearly orthogonal to the energy harvesting primary receiver (EPR) are chosen as candidates for user selection. Therefore, the EPR can harvest more energy from the CBS so that the energy utilization of the network can improve. Besides, zero-forcing precoding and power control are adopted to eliminate interference within the CRS and meet the transmit power constraints. Simulation results and analysis show that, compared with the existing CU selection methods, the proposed low-complex strategy can enhance both the achievable sum rate of the CRS and the energy sharing capability of the network.

Tone Interference Cancellation Algorithm for Direct-Sequence Spread-Spectrum Systems (직접 대역 확산 시스템을 위한 톤 간섭 제거 알고리듬)

  • Lee, Yong-Wook;Kang, Dong-Hoon;Park, Hyo-Bae;Oh, Wang-Rok
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.8
    • /
    • pp.10-15
    • /
    • 2009
  • In this paper, we propose a frequency-domain tone interference cancellation algorithm for direct-sequence spread spectrum systems. In the previously proposed frequency-domain interference cancellation algorithms, the interference signal is estimated and compensated in the frequency-domain and then, with IFFT (inverse Fourier transform), the compensated frequency-domain signal is transformed to the time domain signal for the remaining receiver operations. Unlike the previous works, the proposed algorithm does not requires IFFT and thus, the proposed algorithm not only shows the virtually identical performance but also requires lower hardware complexity compared to the previous works.

Lattice-Reduction-Aided Preceding Using Seysen's Algorithm for Multi-User MIMO Systems (다중 사용자 다중 입출력 시스템에서 Seysen 기법을 이용한 격자 감소 기반 전부호화 기법)

  • Song, Hyung-Joon;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.6
    • /
    • pp.86-93
    • /
    • 2009
  • We investigate lattice-reduction-aided precoding techniques for multi-user multiple-input multiple-output (MIMO) channels. When assuming full knowledge of the channel state information only at the transmitter, a vector perturbation (VP) is a promising precoding scheme that approaches sum capacity and has simple receiver. However, its encoding is nondeterministic polynomial time (NP)-hard problem. Vector perturbation using lattice reduction algorithms can remarkably reduce its encoding complexity. In this paper, we propose a vector perturbation scheme using Seysen's lattice reduction (VP-SLR) with simultaneously reducing primal basis and dual one. Simulation results show that the proposed VP-SLR has better bit error rate (BER) and larger capacity than vector perturbation with Lenstra-Lenstra-Lovasz lattice reduction (VP-LLL) in addition to less encoding complexity.

Adaptive SLM and Side Information Insertion Method (적응 SLM 방식과 부가정보 삽입기법)

  • 정락규;유흥균
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.3
    • /
    • pp.276-282
    • /
    • 2003
  • OFDM is effective for the high speed data transmission. However, the nonlinear distortion is a serious problem because of the high PAPR due to many subcarriers. The conventional SLM selects the OFDM signal with the lowest PAPR. In this method, OFDM data can be correctly recovered only if the side information about the phase sequence is transmitted to receiver. This paper proposes a new method of side information insertion into the conventional SLM and reduces the computational complexity by adaptive method. Performances are compared in case that three kinds of phase sequences are used for phase rotation factor. The adaptive SLM method has the same PAPR reduction as the conventional SLM method. The required BER can be guaranteed by the proposed method. When subcarrier number N=32, computational complexity is reduced to 48 %, 72 % and 51 % for the branch number U=4, 8 and 16, respectively.

LP-Based SNR Estimation with Low Computation Complexity (낮은 계산 복잡도를 갖는 Linear Prediction 기반의 SNR 추정 기법)

  • Kim, Seon-Ae;Jo, Byung-Gak;Baek, Gwang-Hoon;Ryu, Heung-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.20 no.12
    • /
    • pp.1287-1296
    • /
    • 2009
  • It is very important to estimate the Signal to Noise Ratio(SNR) of received signal in time varying channel state. Most SNR estimation techniques derive the SNR estimates solely from the samples of the received signal after the matched filter. In the severe distorted wireless channel, the performance of these estimators become unstable and degraded. LP-based SNR estimator which can operate on data samples collected at the front-end of a receiver shows more stable performance than other SNR estimator. In this paper, we study an efficient SNR estimation algorithm based on LP and propose a new estimation method to decrease the computation complexity. Proposed algorithm accomplishes the SNR estimation process efficiently because it uses the forward prediction error and its conjugate value during the linear prediction error update. Via the computer simulation, the performance of this proposed estimation method is compared and discussed with other conventional SNR estimators in digital communication channels.

On the Gain of Component-Swapping Technique with DVB-T2 16K LDPC Codes in MIMO-OFDM Systems (DVB-T2 16K LDPC 부호가 적용된 MIMO-OFDM 시스템에서의 성분 맞교환 기술 이득)

  • Jeon, Sung-Ho;Yim, Zung-Kon;Kyung, Il-Soo;Kim, Man-Sik
    • Journal of Broadcast Engineering
    • /
    • v.15 no.6
    • /
    • pp.749-756
    • /
    • 2010
  • The signal space diversity is one of the promising transmission techniques in next generation mobile TV service. However, DVB-T2 does not consider the multiple antennas (MIMO) so that the cyclic Q-delay method, a component interleaver in DVB-T2, causes a critical issue in detecting symbols at the receiver side by increasing the inter-symbol dependency. To solve this problem, the component-swapping technique is proposed, which limits the inter-symbol dependency in order to reduce detection complexity. In this paper, the achievable gain of a component-swapping technique combined with 16K LDPC code defined in DVB-T2 is evaluated by computer simulations. From the results, the gain is confirmed in terms of BER and receive complexity compared to legacy component interleaver methods.

Analysis of Low Computational Complexity DSP Algorithm for Phase Noise Compensation in Coherent Optical Communication Systems (코히어런트 광통신에서 위상잡음 보상을 위한 저계산 복잡도 DSP 알고리즘 제안 및 분석)

  • Park, Hyoung-Joon;Jung, Sang-Min;Han, Dong-Yoon;Han, Sang-Kook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.5
    • /
    • pp.413-417
    • /
    • 2014
  • In coherent superhigh speed optical transmission link, compensating the system impairments are critical issues. Among these issues, phase noise and carrier frequency offset are the most important impairments which interrupt the signal recovery. This paper suggests a algorithm of digital signal processing that compensates the phase noise and carrier frequency offset and verified its validity. The suggested digital signal processing algorithm has a lower computational complexity compared with the previous algorithms, so it can ease the burden of signal processing at the receiver to provide high speed optical transmission system.

Information Coding Schemes for the Frequency Hopping Communication (주파수 도약 통신에 적합한 정보부호화 기법)

  • 박대철;김용선;한성우;전용억;전병민
    • Journal of Broadcast Engineering
    • /
    • v.4 no.1
    • /
    • pp.32-43
    • /
    • 1999
  • This paper addresses schemes which securely transmit voice and data information under the worst communication environment using the frequency hopping(FH) communication system to avoid monitoring or interference against enemy. In case of using the conventional FEC and bit interleaving scheme. the processing time for error control coding and bit interleaving due to system complexity is highly demanded. In this paper. the effective information coding scheme of maprity error correction and block interleaving compatible to the proposed FH communication system is proposed to transmit voice or data (I6Kbps. 4.8Kbps. 2.4Kbps. 1.2Kbps, O.6Kbps) under the worst FH communication channel. In transmitter. low rate data signals are configured to majority data blocks. and transmitted repeatedly to FH channel which are structured to 20Kbps hopping frame cells. In receiver. the received data are decoded block by block, and taken majority error correction. Consequently. burst or random errors are corrected at the block deinterleaver and the majority decoder. The proposed coder structure reduces the coding/decnding processing time as well as the jamming interferences, and further simplify the data processing complexity for FH communication. Improved performance of the proposed scheme was verified under simulated channel environments.

  • PDF