An efficient RNS parity checker for moduli set {2 n − 1, 2 n + 1, 22n + 1} and its applications

Ma, Shang; Hu, Jianhao; Zhang, Lin; Ling, Xiang

doi:10.1007/s11432-008-0097-y

Cited by 14 publications

(11 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From the definition of the PAPR in (2), the output of OFDM in (1), and the output of RNS-OFDM in (9), the PAPR of OFDM can be presented by (12) PAPR OFDM = 10 log…”

Section: Papr Reductionmentioning

confidence: 99%

“…In conventional OFDM, the output s k gets the high value when the phrases of subcarriers are close to each other. Extremely, if these phrases of all subcarriers equal zero, the output has the highest value from (12). Then, the range of the output is [ 0, 128, 000) from (1).…”

Section: Papr Reductionmentioning

confidence: 99%

“…Thus, RNS has received wide attention in very large scale integration applications. The activities of RNS focus on RNSto-binary conversion, RNS parity check, and RNS scaling scheme [11][12][13]. Recently, more attention is also paid to RNS in a parallel communication field because of its parallel and fault-tolerant properties [14][15][16][17][18][19].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A PAPR reduction scheme with residue number system for OFDM

2013

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

The peak-to-average power (PAPR) is one of the main challenges in multicarrier transmissions. Aiming at reducing the PAPR, we propose a residue number system (RNS)-based OFDM parallel transmission scheme. The key idea of the proposed scheme is to utilize the parallel property of RNS to convert the input signals into the parallel smaller residue signals while utilizing the characteristic of RNS modular operation to effectively limit the output in each residue subchannel after inverse fast Fourier transform, which is smaller than the corresponding modulus. The main contribution of the proposed scheme is to reduce the dynamic range of the transmitted signal without nonlinear distortion so as to reduce the PAPR during the transmission. A generalized performance of the proposed scheme is analyzed in this paper, including the PAPR reduction, the complexity, the transmission bandwidth, etc. Also, an approximate formula to calculate the transmission bandwidth of the proposed scheme is derived, which simplifies design procedure in practice and implies that a minor increase of the dynamic range of RNS will bring comparative improvement of the transmission bandwidth consumption. Theoretical analysis and simulation results demonstrate that the proposed scheme has the ability to achieve desirable PAPR reduction and low computational complexity without nonlinear distortion.

show abstract

“…From the definition of the PAPR in (2), the output of OFDM in (1), and the output of RNS-OFDM in (9), the PAPR of OFDM can be presented by (12) PAPR OFDM = 10 log…”

Section: Papr Reductionmentioning

confidence: 99%

Section: Papr Reductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A PAPR reduction scheme with residue number system for OFDM

2013

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, if the product of one odd and one even or two evens is odd, then there is overflow. Thus, we can get the sign of X by determining the parity of Z = 2X directly [5].…”

Section: Sign Detectionmentioning

confidence: 99%

“…In the past few decades, RNS has been studied extensively in digital signal processing (DSP) applications, such as finite impulse response (FIR) filters, discrete wavelet transform (DWT), fast Fourier transform (FFT), source coding and channel decoding, and so on [3,4]. However, some issues, such as magnitude comparison, scaling, and division in RNS are not as simple as those in binary system because of the non-weighted property of RNS [5].…”

Section: Introductionmentioning

confidence: 99%

A 2 n scaling scheme for signed RNS integers and its VLSI implementation

et al. 2010

Sci. China Inf. Sci.

Self Cite

View full text Add to dashboard Cite

High efficient implementation of scaling in residue number system (RNS) is one of the critical issues for the applications of RNS in digital signal processing (DSP) systems. In this paper, an efficient scaling algorithm for signed integers in RNS is proposed firstly through introducing a correction constant in negative integers scaling procedure. Based on the proposed scaling algorithm, an efficient RNS 2 n scaling implementation method is presented, in which Chinese remainder theorem (CRT) and a redundant modulus are used to perform the base extension to obtain the least significant n bits of RNS integers. With the redundant modulus, the RNS sign detection can be achieved by the parity detection. And then, an approach to update the residue digit of the redundant channel is also proposed. Meanwhile, this paper provides a method of computing the correction constant of the redundant channel in negative integers scaling. The analysis results indicate that the complexity of the proposed scaling algorithm grows linearly with the word-length of the RNS dynamic range without using Look-up Table (LUT). Furthermore, the proposed algorithm is employed for a specific moduli set 2 n scaling. The synthesis results show that the critical path of the proposed algorithm is shortened by 12%, the area and power consumption performance is improved by about 35%, compared to the existing cascading 2 n scaling method for very large scale integration (VLSI) implementation under the same restriction. Besides, the VLSI layout indicates that the parallel structure is simpler. CitationMa S, Hu J H, Ye Y L, et al. A 2 n scaling scheme for signed RNS integers and its VLSI implementation.

show abstract

Efficient CRT-based residue-to-binary converter for the arbitrary moduli set

Chen

Yao

2010

Sci. China Inf. Sci.

View full text Add to dashboard Cite

The conversion from residue to weighted binary representation plays an important role in the residue number system. Based on Chinese Remainder Theorem, a new residue-to-binary converter using arbitrary moduli set is proposed. The new converter uses the difference-correction algorithm for the conversion output and eliminates the modulo M operation, where M is the dynamic range of the residue number system. The sizes of the multipliers and modular multipliers in the new converter are small, thereby reducing the area and delay of the proposed converter. Simulation and synthesis results indicate that the new converter is more area-time efficient than the published converters based on Chinese Remainder Theorem.

show abstract

An efficient RNS parity checker for moduli set {2 n − 1, 2 n + 1, 22n + 1} and its applications

Cited by 14 publications

References 20 publications

A PAPR reduction scheme with residue number system for OFDM

A PAPR reduction scheme with residue number system for OFDM

A 2 n scaling scheme for signed RNS integers and its VLSI implementation

Efficient CRT-based residue-to-binary converter for the arbitrary moduli set

Contact Info

Product

Resources

About