Patent Application
20110204934
The field of the invention relates to a calibration system and a method for calculating a fraction of a delay along a signal path.
The use of mobile communications networks has increased over the last decade. Operators of mobile communication networks have increased the number of base stations in order to meet an increased request for service by users of mobile communications networks. It is of interest for the operator of the mobile communications network to reduce the running costs of the base stations. It is one option to implement the radio system as an antenna embedded radio system. In the antenna embedded radio system, some of the hardware components of the radio system may be implemented on a chip. The antenna embedded radio system therefore reduces running costs of the base station. Implementing the radio system as the antenna embedded radio system reduces space needed to house the hardware components of the base station. Power consumption during normal operation of the radio system is reduced when implanting the antenna invaded radio system comprising the chip.
It is of interest to provide a reliable quality of service to individual users of the mobile communication network given the increase in the number of users. Several techniques have been suggested in order to deal with the increased number of users within the mobile communications network. One of these several techniques is the provision of beam forming capabilities in order to direct a beam relayed by the radio system in different directions to improve service coverage of the mobile communications network. The beam forming techniques rely on defined phase and amplitude relations between several ones of antenna elements of the active antenna system. Delays along a transmit path and/or a receive path (commonly termed “signal path”) may cause a delay for signals travelling along the signal path. Likewise phase and amplitude of the signal travelling along the signal path may change when the signal travels along the signal path. For some applications it is of interest to calibrate a transmit time or the delay accumulated along the signal path. The calibration of the delay is of interest, should the delay vary with conditions of the signal path, such as but not limited to start-up conditions of the signal path. A change in the delay depending on the start-up conditions is, for example, relevant for the signal paths relaying digital signals. Buffers in the digital signal path may introduce the variable delay depending on the start-up conditions. Frequently the signal path may be operating at a higher frequency and a higher sampling rate than the signal entering the signal path.
The prior art discloses the examples of the measurement of the delay introduced by the signal path at a coarse sampling rate corresponding to the lower frequency of the signal entering the signal path.
Several concepts for calibrating an active antenna system comprising several signal paths relaying signals in a well-defined fashion are known. For example, “Investigation of a calibration concept of optimum performance of adapted antenna systems” by Passmann et al. of Robert Bosch GmbH at Vehicular Technology Conference, 1998, VTC98, p. 577-580, discloses a calibration concept for an adaptive antenna system. The calibration concept consists of (i) offline calibration of passive components after the manufacture; and (ii) an on-line calibration of active components during operation.
Korean Patent Application Number 1020050089853A (assigned to DA TANG Mobile Communications) teaches a method for calibrating smart antenna array systems in real time. The DA TANG application teaches a iterative method of calibrating smart antenna array systems using compensation factors of previous calibrations in order to calibrate transmit and receive paths.
U.S. Pat. No. 6,693,588 B1 (assigned to Siemens) discloses an electronically phase controlled group antenna. The electronically phase controlled group antenna is calibrated using a reference point shared by all the reference signals. In the downlink reference signals which can be distinguished from one another are simultaneously transmitted by individual antenna elements of the group antenna and suitably separated after reception at the shared reference. The Siemens system requires a fixed special arrangement of the antenna elements.
International Patent Application Number WO 2007/049023 A1 (assigned to Mitsubishi Ltd.) teaches a signal processing and time delay measurement based on combined correlation and differential correlation. Two versions of a binary signal having an irregular sequence of states are processed by dividing (i) the first value which represents the average time derivative of one signal at the times of transitions in the other signal, and (ii) a correlation value for the two signals, and then combining the first value with the correlation value. For a given relative delay introduced between the signals, the resultant combined value indicates whether the introduced delay brings the transitions in the two signals into coincidence. This process can be repeated for other introduced delays to determine the amount of delay between the two signals.
UK Patent Application Number GB 2 447 981 A (assigned to Mitsubishi electric information technology Centre Europe B. V.) discloses a time delay measurement for global navigations satellite system receivers. A method is provided for processing first and second signals having a delay there between, whereby at least the first signal is an irregular binary signal having chip boundaries. The method comprises introducing a plurality of different delays between the first and second signals, the successive delay amounts differing from each other by less than the interval between chip boundaries. For each introduced delay, summing the samples of the second signal which are obtained at the times when the chip boundaries between bits of the first signal have the same state (i.e. a transition from 1 to 0, from 1 to 0, from 0 to 0, or from 1 to 1) in order to obtain a value, and thereby obtaining a representation of how the value varies according to the introduced delay, such that the representation contains a level change associated with an introduced delay which bears a predetermined relationship to the delay between the first and the second signal. Values corresponding to different transitions may be subtracted from one another. The method is particularly suited for processing signals in GPS or other similar positioning signals, for example, in a tracking loop phase error discriminator for DLL code alignment, or in line of sight signal (LoS) signal timing recovery from multi path contamination.
The present disclosure teaches a calibration system. The calibration system comprises an injector, a calibration signal generator, a correlator, a detector unit, a polygon generator and a pattern classifier unit. The injector injects a pilot signal upstream of a signal path. The calibration signal generator provides a calibration signal sampled at a coarse sampling rate. The correlator calculates a correlation of the calibration signal with an input signal. The detector unit detects a peak region in the correlation. The polygon generator forms a set of polygons from the peak region. The pattern classifier unit calculates a fraction of a delay from the set of polygons. The delay is accumulated along the signal path. The fraction of the delay is indicative of an accuracy of the delay at a fine sampling rate. The fine sampling rate is an integer multiple of the coarse sampling rate.
The term “coarse sampling rate” and “a fine sampling rate being an integer multiple of the coarse sampling rate” as used within this disclosure are defined as follows. An analogue signal is sampled to represent the analogue signal in a digital domain. A “sampling rate” defines how often the analogue signal is sampled during a given time period. For time varying signals the sampling rate needs to be sufficiently high to capture all of the variations of the time varying signal. A minimal sampling rate is given by the Nyquist criterion. The sampling rate defines a sequence of equally spaced points in time. The interval between the equally spaced points is termed “sampling time”.
A time resolution at the sampling rate is given by the sampling time. Time intervals smaller than the sampling time associated with the sampling rate may not be determined when sampling at the sampling rate.
The fine sampling rate in this disclosure is an integer multiple of the coarse sampling rate. The sampling time of the coarse sampling rate is divided into an integer number of sub-sampling times or fractions. The sub-sampling time or individual fractions correspond to the fine sampling time at the fine sampling rate.
The delay was measurable at a time resolution of the coarse sampling time in the prior art as the calibration signal could only be sampled at this time resolution. The present disclosure teaches a measurement of the delay to the fraction of the delay, i.e. as if the calibration signal was sampled at the fine sampling rate. Using the calibration system of the present disclosure it is not necessary to oversample the calibration signal.
The present disclosure further teaches a method for calibrating the signal path. The method comprises a generating of a calibration signal sampled at a coarse sampling rate. The method further comprises an injecting of a pilot signal and generating a correlation of the calibration signal and an input signal. A peak region is detected in the correlation and the method comprises a step of forming a set of polygons from the peak region. A fraction of a delay is calculated from the set of polygons. The fraction of the delay provides an accuracy of the delay at a fine sampling rate. The fine sampling rate is an integer multiple of the coarse sampling rate.
The present disclosure further teaches a calibration apparatus. The calibration apparatus comprises an injector, a calibration signal generator, a correlator and a correlation pattern detector. The injector injects a pilot signal upstream of at least one signal path. The calibration signal generator provides a calibration signal. The correlator provides a correlation of the calibration signal with an input signal sampled at a coarse sampling rate. A correlation pattern detector generates an interpolated correlation for detecting a fraction of the delay. The fraction is indicative of an accuracy of the delay at a fine sampling rate. The fine sampling rate is an integer multiple of the coarse sampling rate.
The present disclosure further teaches a method for delay calibration. The method comprises generating a calibration signal sampled at a coarse sampling rate and injecting a pilot signal. A correlation of an input signal with the calibration signal is generated. The method comprises a step of oversampling and a step of identifying a peak in a correlation pattern. A fraction of a delay is deducible from the correlation pattern. The fraction of the delay is indicative of an accuracy of the delay at a fine sampling rate. The fine sampling rate is an integer multiple of the coarse sampling rate.
The present disclosure further teaches a computer program product comprising instructions for a manufacture of the calibration system.
The present disclosure further teaches a computer program product comprising instructions enabling a processor for the method for delay calibration.
The present disclosure further teaches a computer program product comprising instructions enabling a processor for manufacture of the calibration apparatus.
The present disclosure further teaches a computer program product comprising instructions enabling a processor to execute the method for delay calibration.
a shows a peak region in a correlation.
b shows scaled sample points, in a peak region
c shows a set of polygons formed from the squared sample points in a peak region.
d shows an aspect of a training unit.
e shows an aspect of a pattern classifier.
a shows a projection of feature vectors.
b shows a classification according to template feature vectors.
a shows a diagram of a method for calibrating.
b shows details of a step of forming polygons.
c shows further details of the method of calibrating.
d shows details of a training step.
The invention will now be described on the basis of the drawings. It will be understood that the embodiments and aspects described herein are only examples and do not limit the protective scope of the claims in any way. The invention is defined by the claims and their equivalents. It will also be understood that features of one aspect can be combined with features of a different aspect.
The present disclosure enables the calibration system 10 to correct for a fraction F of the delay D accumulated along the signal path Sp. For a coherent transmission of the signal path Sp it is of interest to compensate for the fraction F of the delay D of individual ones of the signal paths Sp. As mentioned previously the delay D is typically sampled at the coarse sampling rate Rs. The delay D and the fraction F of the delay provide an accuracy of the delay D as if the delay D was measured at a fine sampling rate Rf. The fine sampling rate Rf is typically an integer multiple of the coarse sampling rate Rs. In a typical situation the fine sampling rate Rf is eight times faster than the coarse sampling rate Rs. Upstream of the signal path Sp a pilot signal Pi is injected into the signal entering the signal path Sp from the left, for example the payload signal 11, as depicted in
From the signal leaving the signal path Sp, for example the transmit signal 90, an input signal I is extracted for a correlator 120. The input signal I may for example be extracted using a directional coupler or the like. The input signal I comprises a portion of a transmit signal 90 being forwarded to an antenna element 85. The calibration signal generator 400 generates a calibration signal 40. The calibration signal 40 is provided in the base band. Therefore the calibration signal 40 is sampled on the coarse sampling rate Rs. the calibration signal 40 may also be provided in the transmit frequency band, i.e. sampled at the fine sampling rate Rf.
The correlator 120 correlates the input signal I and the calibration signal 40. The correlator 120 calculates a correlation C. The correlation C provides information as to on a degree of similarity between the input signal I and the calibration signal 40. The correlation C is calculated with respect to the coarse sampling rate Rs. Therefore the correlation C appears sampled at the coarse sampling rate Rs. It is conceivable but expensive to provide the correlation C sampled at the fine sampling rate Rf, as hardware required for sampling at the fine sampling rate is substantially more complex and expensive than a hardware for sampling at the coarse sampling rate Rs. Time taken for generation of the correlation will also increase if the input signal I and/or the calibration signal 40 are sampled at the fine sampling rate Rf. In many situations it is not possible to provide the correlator 120 such that the correlation C appears sampled at the fine sampling rate Rf, as available sampling rates for the correlator 120 may depend on general features of the calibration system 10. In such cases a change in the sampling rate for the correlator 120 would require a substantial redesign of the calibration apparatus 10 causing a substantial increase in hardware costs.
A detector unit 122 is adapted to identify a peak region PR in the correlation C (see
The polygon former 124 generates a set of polygons p1, p2, . . . , pn. The polygons p1, p2, . . . , pn are forwarded to a pattern classifier 126. The pattern classifier 126 calculates the fraction F of the delay D at the fine sampling rate Rf. The delay D and the fraction F of the delay D provide an accuracy of the delay D as if the delay D was measured at the fine sampling rate Rf. The fraction F represents a number of sub-sample steps which are to be added or subtracted from the delay D in order to calculate the delay D in terms of the fine sampling rate Rf. The operation of the polygon former 124 and the pattern classifier 126 will be explained with respect to
a shows an example of the peak region PR of the correlation C as generated by the correlator 120. The individual points P1, P2, P3, P4 and P5 of the correlation C may be interpreted as vertices of a polygon. In
The present disclosure teaches the application of well known methods in the field of pattern recognition in order to identify the fraction F at the fine sampling rate Rf from a shape of one or more polygons formed from the individual points P1, P2, . . . , Pn in the peak region PR. The shape of the one or more polygons may be described by a feature vector, which may be transformed to a low-dimensional space using a Karhunen Loève transform in order to reduce complexity and improve performance. The individual points P1, P2, . . . , Pn in the peak region PR are separated by the sampling time Ts.
b shows the peak region PR with scaled sample points after a non-linear function was applied to the individual points P1, P2, . . . , P5 of
c shows an exemplary separation of the peak region PR (see
We first define the following moments of order zero, one and two of a polygon p. For a reference regarding a concept of moments, see e.g. C. Steger, “On the Calculations of Arbitrary Moments of Polygons”, Technical Report FGBV-96-05, Technische Universtiat Munich.
wherein
i is a cyclic index over the points P1, P2, . . . , Pn forming the polygon p,
xi is an x coordinate of the i-th point Pi of the polygon p,
yi is a y coordinate of the i-th point Pi of the polygon p,
a is a measure of an area of the polygon p.
Moments of order zero, one and two will be used to extract features from the points P1, P2, . . . , Pn in the peak region PR. Moments of first order may be defined by:
Moments of second order μ2,0(p), μ1,1(p) and μ0,2(p) may be defined by:
We formally define a polygon as an ordered sequence p=[(xi, yi) ∀i=1 . . . v] of pairs of x coordinates and y coordinates.
Next, we calculate
and form the 18-dimensional feature vector
f=(f1,f2, . . . , f18).
The moments described above may be calculated using the training unit 128 shown in
It is possible to describe a variety of feature vectors f for the set of the polygons p1, p2, . . . , pn describing different ones of the sub-sample delays, i.e. different ones of the fraction F of the delay D. The set of the polygons p1, p2, . . . pn may be measured and a feature vector f generated to represent the set of the polygons p1, p2, . . . , pn.
e shows details of the training unit 128. A training set of feature vectors ft enters the training unit 128 from the right hand side. The training set of feature vectors ft comprise a plurality of feature vectors associated with to a known fraction F of the delay D. The training set of feature vectors ft are be actually measured values and/or simulated feature vectors. The training unit 128 is useable independently from the calibration system 10. The training set feature vectors reach a PCA module comprising a covariance module 140. The covariance module 140 generates a covariance matrix M from the training set feature vectors ft. The training unit 128 is typically used during a training period prior to an operation of the calibration system 10. The PCA module further comprises an Eigenvalue module 145. The Eigenvalue module 145 calculates Eigenvectors and Eigenvalues of the covariance matrix M and is not required during runtime of the calibration system 10. The covariance module 140 may without limitation hold a copy of the covariance matrix M determined earlier during a training step, as will be explaining below.
The training set feature vectors ft are also forwarded to a sorting module 152. The sorting module 152 is adapted to sort the individual ones of the training set feature vectors ft according to the fraction F of the delay D. Each one of the training set feature vectors ft is transformed by a projection module 150. The projection module 150 uses a transformation matrix T to provide a transformation or projection of the training set feature vectors ft from a high-dimensional space (in the above example: 18-dimensional) to a low dimensional sub-space such that principle components of the training set feature vectors ft are also represented in the lower dimensional sub-space. The dimension of this sub-space is, for example, three. The transformation matrix T may be obtained from the same set of training set feature vectors by applying principle component analysis (PCA). For this purpose a covariance matrix M is calculated from the (training set) feature vectors ft. Calculating the Eigenvectors of the covariance matrix M pertaining to a selected number of largest Eigenvalues, and arranging these Eigenvectors into a matrix then yields a transformation matrix T, which can be used to transform any feature vector into a lower dimensional subspace. Such a transformation or projection of feature vectors is commonly called Karhunan Loève transform in the field of pattern recognition. Feature vectors sorted by the sorting module 152 and transformed by the projection module 150 are forwarded to a template feature vector unit 148. The template feature vector unit 148 provides a set of template feature vectors TFV. The template feature vectors TFV provide a grouping of feature vectors (measured or calculated) in the lower-dimensional sub-space pertaining to an individual one of the fractions F of the delay D, as depicted in
It will be noted that the template feature vector 148 may use some sort of averaging over several ones of the training set feature vectors ft pertaining to a given fraction F in order to form the set of template feature vectors TFV. The averaging may be carried out prior or after the transformation carried out but the projection module 150. The set of template feature vectors TFV and the transformation matrix T are forwarded from the training unit 128 to the pattern classifier 126.
e shows the pattern classifier 126. The individual points P1, P2, . . . , Pn in the peak region PR (also referred to as the points P1, P2, . . . , Pn) enter the pattern classifier unit 126 from the right hand side during an operation of the calibration system 10. A non-linear function is applied to the points P1, P2, . . . , Pn by the non-linearity module 132. A feature extraction module 134 extracts an experimental feature vector fe from the points P1, P2, . . . , Pn. A transformation unit 149 performs a transformation from the 18-dimensional space of the experimental feature vector fe to the lower-dimensional space, for example three-dimensional space) using the transformation matrix T by left-multiplying the experimental feature vector fe with the transformation matrix T. The corresponding three-dimensional vector is characteristic for a pattern shape in the peak region PR formed by points P1, P2, . . . , Pn. It is to be understood that the points P1, P2, . . . , Pn entering the pattern classifier 126 are typically generated during the run time of the calibration system 10, whereas the transformation matrix T and/or the set of template feature vectors TFV may have been generated during a training period using the training unit 128.
Projecting the feature vectors fe onto the sub-space formed by the selected Eigenvectors yields a three dimensional vector. The three dimensional vector represents index values for fractions F, i.e. different ones of the sub-sample shifts. The index values for fractions F may be identified using the set of template feature vectors TFV as discussed above. Let us further assume that the fine sampling rate Rf is eight times faster than the coarse sampling rate Rs. If one wishes to measure the fraction F in steps of the fine sampling time Tf, The set of template feature vectors TFV comprises nine three dimensional vectors, corresponding to the different ones of the fraction F
(−4, . . . , 0, . . . 4)·Ts/8.
The polygon classifier 126 as shown in
a shows vectors corresponding to the different ones of the sub-sample shifts or the different values of the fraction F in steps of the fine sampling time Tf. The triangles pointing downwards represent a negative shift, triangles pointing upwards a positive shift and circles represent no shift. Together, the triangles and the circle represent the set of template feature vector set TFV.
(−4,−3,−2,−1,0,1,2,3,4)/Rs/8,
provided the coarse sampling rate Rs is eight times slower than the fine sampling rate Rf.
The cloud of data points in
b illustrates the classification of the feature vectors f to one of the possible values of the fraction F. The classification may yield an overlap between adjacent ones of the fractions F. There are, for example, feature vectors f that may be classified as +4 and as +3 as shown in
It is possible to use a higher sampling rate Rf for the calibration signal 400. It is costly and not always possible to use the fine sampling rate Rf for the calibration signal 40. Another option to detect the fraction F of the delay D is to correlate an oversampled correlation measurement. Another option is to interpolate a correlation C and to derive the fraction F from the interpolated correlation iC, as will be explained below.
It is to be understood that the calibration system 10 may be used for a system relaying any types of signals, such as but not limited to the transmit signal 90 or a receive signal 55 being sampled at the low sampling rate Rs. It is to be understood that the calibration system 10 is adapted to provide the delay D accumulated along a signal path Sp and a fraction F of the Delay D according to the fine sampling rate. The fraction F is indicative of the accuracy of the delay D as if the delay D was measured at the fine sampling rate Rf.
The aspect of the calibration system 10 is not limited to relaying systems such as the active antenna system 1 discussed so far. One may contemplate measuring delays D through the signal paths SP of, for example, sound systems. If the delay D in the sound system is measured at the coarse sampling rate Rs the present disclosure enables a calculation of the fraction F of the delay D up to an accuracy being an integer multiple higher than the coarse sampling rate Rs at which the pilot signal Pi is being sampled.
Another application of the calibration system 10 of the present disclosure is to use the calibration system 10 in combination with an active antenna system 1. It is to be understood that the calibration system 10 of this disclosure has only been disclosed for an individual one of the signal path SP in the form of a transmit path 70-1, 70-2, . . . , 70-N (see
The present disclosure further provides a method for calibration of the signal paths SP.
In a step 1200 the correlation C of the calibration signal 40 and the input signal I is generated. In a step 1300 the peak region PR is detected within the correlation C. In a step 1400 the set of polygons p1, p2, . . . , pn is formed from points P1, P2, . . . , Pn within the peak region PR. In a step 1500 the fraction F of the delay D is deduced from the set of polygons p1, p2, . . . , pn. The fraction F of the delay D indicates an accuracy of the delay D at the fine sampling rate Rf as if the delay was measured at the fine sampling rate Rf. The fine sampling rate is an integer multiple of the coarse sampling rate Rs. A step 1600 comprises a deducing of the delay D on the coarse sampling rate Rs. A step 1700 comprises an optional synchronising of the pilot signal Pi to the calibration signal 40.
b shows details of the step 1400 of forming the set of polygons p1, p2, . . . , pn. In a step 1410 a non-linear function is applied to the points P1, P2, . . . , Pn in the peak region PR generating scaled sample points (as was discussed with respect to
c shows details of the step 1500 of deducing the fraction F. In a step 1510 a training step is executed. The training step 1510 may be carried out independently from operation of the calibration system 10. It is to be understood that the training step 1510 may be carried out prior to an execution of the remaining steps of the step 1500. A step 1570 comprises a forming of the experimental feature vectors fe. The experimental feature vectors fe are formed by applying a non-linear function to measured points P1, P2, . . . , Pn as described above. A step 1580 comprises a projection of the experimental feature vectors fe onto the lower-dimensional sub-space.
In a step 1590 a minimal distance for a selected one of the experimental feature vectors fe to the template feature vectors TFV is determined after projecting step 1580, as explained with respect to
d shows details of the training step 1510.
A step 1520 comprises a generating of training feature vectors t. A large number of training feature vectors ft may be generated in the step 1520.
The step 1530 comprises a calculating of a covariance matrix M of the training feature vectors ft.
In a step 1540 Eigenvectors and Eigenvalues of the covariance matrix M are identified.
In a step 1550 a transformation matrix T is determined. The transformation matrix T provides a transformation from a high-dimensional vector space of the feature vectors ft on to a lower-dimensional sub-space generated by those Eigenvectors of the covariance matrix M pertaining to the largest Eigenvalues of the covariance matrix M.
In a step 1560 the template feature vectors TFV are generated. The template feature vectors TFV are generated by transforming a group of training feature vectors t using the transformation matrix T on to the lower-dimensional sub-space; as discussed with respect to
The calibration apparatus 20 further comprises injectors 14-1, 14-2, . . . , 14-N for each one of the transmit paths 70-1, 70-2, . . . , 70-N. The injectors 14-1, 14-2, . . . , 14-N are adapted to inject the calibration signal 40 and/or the pilot signal Pi. A time delay adjustment unit 65-1, 65-2, . . . , 65-N is provided for each one of the transmit paths 70-1, 70-2, . . . , 70-N. The time delay adjustment unit 65-1, 65-2, . . . , 65-N provides an adjustment of the delay D in a high frequency domain. Therefore an adjustment of the delay D is possible to an accuracy of the fraction F with the fraction F being measured at the fine sampling rate Rf being an integer multiple of the coarse sampling rate Rs used for the correlation calculated by the correlator 120 and/or for a sampling of the calibration signal 40 by the calibration signal generator 400.
In
The calibration apparatus 20 may comprise a down converting unit 110 downstream of the combiner 100. The down converting unit 110 converts the coupled transmit signals 90-1, 90-2, . . . , 90-N from the transmit band into the base band or the intermediate frequency band, as mentioned above.
A correlation pattern detector 200 may generate an interpolated correlation oC for detecting a fraction F of the delay D. The interpolated correlation oC allows a determination of the subsample shift by a position of a maximum within the interpolated correlation.
The correlation pattern detector 200 may use a set of sample patterns Sc. The sample patterns comprise the correlations C for individual ones of the fraction F of the delay D. The set of sample patterns Sc may be oversampled, i.e. sampled at the fine sampling rate Rf. The correlation pattern detector 200 deduces the fraction F of the delay D sampled at the fine sampling rate Rf in order to add an appropriate compensation to the time delay adjustment unit 65-1, 65-2, . . . , 65-N, such that the delay D accumulated along the signal path Sp, can be compensated for up to an accuracy of the fine sampling rate Rf.
A shape of the sample patterns Sc is indicative of the fraction F of the delay D. The collection of the sample patterns Sc as shown in
The interpolated correlation iC may be achieved using an interpolation plus an alias filtering such that a peak in the correlation fingers as shown in
The present disclosure further teaches a method for a delay calibration 2000.
An oversampling is carried out in a step 2400. The oversampling may comprise an oversampling of the input signal I in a step 2410, an oversampling of the calibration signal 40 in a step 2420 or an interpolating 2430 of the correlation C or any combination of the steps 2410, 2420 and 2430. The term oversampling shall be construed as sampling the signal at to the fine sampling rate Rf. The step 2430 may be implemented as an interpolating and filtering of the correlation C, yielding the interpolated correlation iC.
In a step 2500, a peak in the interpolated correlation pattern iC is identified. The fraction F of the delay D is deducible from the peak. The fraction F of the delay D is indicative of an accuracy of the delay D as if the delay D was measured at the fine sampling rate Rf. The fine sampling rate Rf is an integer multiple of the coarse sampling rate Rs, as discussed before. The method 2000 was only explained with respect to an individual signal path SP. It is to be understood that the method 2000 may comprise a selecting of a signal path SP. The method further comprises a step 2700 of adjusting the delay D to an accuracy of the fraction F as if the delay D was sampled at the high sampling rate Rf. The adjusting 2700 may be carried out using the time delay adjustment unit 65-1, 65-2, . . . , 65-N. The time delay adjustment unit 65-1, 65-2, . . . , 65-n may be implemented as a programmable delay buffer running at a sampling rate of at least Rf. The delay buffer allows delaying a buffer signal by up to n samples. For implementing negative fractions F of the delay D, the buffer signal is advanced by one sample in the base-band sampling domain (sampled at the coarse sampling rate Rs) and afterwards delayed in the high-speed sampling domain by an appropriate number of steps representing the fraction F correctly at the fine sampling rate Rf.
A delay adjustment can also be realized by a programmable symmetric FIR filter comprising a finite impulse response. The programmable symmetric FIR filter is already implemented as an alias-filter for the up-converting (for example in the transmit path 70-1, . . . , 70-N of
m/2*Tf.
The fraction F can be reduced by effectively shortening the symmetric FIR filter. Hence, an advancing of the filtering signal in time in fractions F according to the fine sampling rate Rf will be performed by shortening the symmetric FIR filter. The time delay may be carried out by delaying the filter signal by one sample in the base-band domain (or the intermediate frequency band) and subsequently shortening the FIR filter by an appropriate number of steps according to the fine sampling rate Rf.
The present disclosure further teaches a computer program product comprising instructions enabling a processor for manufacture of a calibration system 10 according to the present disclosure.
The present disclosure further teaches a computer program product comprising instructions enabling a processor to execute a method 1000 for calibrating.
The present disclosure teaches a computer program product comprising instructions enabling a processor for a manufacture of a calibration apparatus 20 according to the present disclosure.
While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example, and not limitation. It will be apparent to persons skilled in the relevant arts that various changes in form and detail can be made therein without departing from the scope of the invention. In addition to using hardware (e.g., within or coupled to a Central Processing Unit (“CPU”), microprocessor, microcontroller, digital signal processor, processor core, System on Chip (“SOC”), or any other device), implementations may also be embodied in software (e.g., computer readable code, program code, and/or instructions disposed in any form, such as source, object or machine language) disposed, for example, in a computer usable (e.g., readable) medium configured to store the software. Such software can enable, for example, the function, fabrication, modelling, simulation, description and/or testing of the apparatus and methods described herein. For example, this can be accomplished through the use of general programming languages (e.g., C, C++), hardware description languages (HDL) including Verilog HDL, VHDL, and so on, or other available programs. Such software can be disposed in any known computer usable medium such as semiconductor, magnetic disk, or optical disc (e.g., CD-ROM, DVD-ROM, etc.). The software can also be disposed as a computer data signal embodied in a computer usable (e.g., readable) transmission medium (e.g., carrier wave or any other medium including digital, optical, or analog-based medium). Embodiments of the present invention may include methods of providing the apparatus described herein by providing software describing the apparatus and subsequently transmitting the software as a computer data signal over a communication network including the Internet and intranets.
It is understood that the apparatus and method described herein may be included in a semiconductor intellectual property core, such as a microprocessor core (e.g., embodied in HDL) and transformed to hardware in the production of integrated circuits. Additionally, the apparatus and methods described herein may be embodied as a combination of hardware and software. Thus, the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.
