DATA WRITING IN SYSTEM WITH ALIGNMENT RESTRICTION OR VECTOR-BASED SYSTEMS

Information

  • Patent Application
  • 20070234001
  • Publication Number
    20070234001
  • Date Filed
    January 16, 2007
    18 years ago
  • Date Published
    October 04, 2007
    17 years ago
Abstract
It is proposed a method for writing data in a system with alignment restriction, wherein first destination data (22′) generated from first source data (21′) located in a storage range (21) starting at a first source position (21a) are written in a storage range starting (22) at a non-aligned position (22a). Said method comprises the steps of extracting second source data (27′) from a storage range (27) starting at a second source position (27) a preceding the first source position (21a), said second source data (27′) comprising said first source data (21′), generating (23) second destination data (24′) from said second source data (27′), said second destination data (24′) comprising said first destination data (22′), writing said second destination data (24′) in a storage range (24) starting at an aligned position (24a), wherein the second source position (24′) is set such that said first destination data (22′) are written in a storage range starting at said non-aligned position (22a).
Description

The features, objects, and advantages of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings, wherein:



FIG. 1 shows a known technique of writing data according to the prior art,



FIG. 2 shows an embodiment for writing data in a vector-based system according to the invention, and



FIGS. 3 to 5 show a method for writing data in a vector-based system according to the invention.


Claims
  • 1. A method for writing data in a system with alignment restriction, wherein first destination data (22′) generated from first source data (21′) located in a storage range (21) starting at a first source position (21a) are written in a storage range starting (22) at a non-aligned position (22a), comprising extracting second source data (27′) from a storage range (27) starting at a second source position (27a) preceding the first source position (21a), said second source data (27′) comprising said first source data (21′),generating (23) second destination data (24′) from said second source data (27′), said second destination data (24′) comprising said first destination data (22′), andwriting said second destination data (24′) in a storage range (24) starting at an aligned position (24a),wherein the second source position (24′) is set such that said first destination data (22′) are written in a storage range starting at said non-aligned position (22a).
  • 2. A method according to claim 1, wherein said first destination data (22′) are generated by a process that generates output data from input data, and the method comprisesdetermining said second source position (27a) on the basis of a ratio reflecting the relationship between the size of said output data and the size of said input data.
  • 3. A method according to claim 2, wherein said second source position (27a) is determined on the basis of the distance between said non-aligned position (22a) and said aligned position (24a).
  • 4. A method according to anyone of the claims 2 to 3, wherein said second source position (27a) is determined according to following equation: SP2=SP1−d/rwhereinSP1 is the value of the first source position (21a),SP2 is the value of the second source position (27a),r is the ratio of the size of said output data to the size of said input datad is the distance between the non-aligned position (22a) and the aligned position (24a).
  • 5. A method according to anyone of the preceding claims, comprising the step of determining said second source position (27a) on the basis of the size of said first source data (21′) and said first destination data (22′) and on the basis of the distance between the non-aligned position (22a) and the aligned position (24a).
  • 6. A method according to anyone of the preceding claims, wherein the aligned position (24a) is the first aligned position preceding said non-aligned position (22a).
  • 7. A method according to anyone of the preceding claims, wherein the size of said second source data (27′) is chosen such that said second destination data (24′) fit between said aligned position (24a) and a further aligned position (24b).
  • 8. A method according to claim 7, whereinsaid first destination data (22′) are generated by a process that generates output data from input data, and the storage range of said second source data (27′) stops at a third source position (27b) that is determined on the basis of a ratio reflecting the relationship between the size of said output data and the size of said input data.
  • 9. A method according to claim 8, wherein said third source position (27b) is determined on the basis of the distance between said aligned position (24a) and said further aligned position (24b).
  • 10. A method according to claim 8 or 9, wherein said third source position (27b) is computed as follows: SP3=SP2+d′/r whereinSP3 is the value of the third source position (27b),SP2 is the value of the second source position (27a),r is the ratio of the size of said output data to the size of said input data,d′ is the distance between the aligned position (24a) and the further aligned position (24b).
  • 11. A method according to anyone of the claims 7 to 10, wherein a third source position (27b), which is defined as being the stop position of the storage range of said second source data (27′), is determined on the basis of the size of said first source data (21′) and said first destination data 22′ and on the basis of the distance between the aligned position (24a) and the further aligned position (24b).
  • 12. A method according to anyone of the claims 7 to 11, wherein the further aligned position (24b) is the first aligned position following the storage range of said first destination data (22′).
  • 13. A method according to anyone of the preceding claims, wherein said first source data (21′) and said first destination data (22′) are video data.
  • 14. A method according to anyone of the preceding claims, wherein said first source data (21′) and said first destination data (22′) are audio data.
  • 15. A method according to anyone of the preceding claims, wherein said second destination data (24′) are generated by a filter or a one-dimensional filter.
  • 16. A method according to anyone of the preceding claims, wherein said second destination data (24′) are generated by a linear filter, a non-linear filter, a data rate change filter, or a data delay filter.
  • 17. A method for writing destination data (22′) in a storage range of a vector-based system starting at a non-aligned position (22a), said destination data (22′) being generated from data contained in a source storage range (21), comprising extending (28, 29) said source storage range (21),generating temporary data (24′) from the data in the extended source storage range (27), said temporary data (24′) comprising said destination data (22′), andwriting said temporary data (24′) in a storage range of said vector-based system starting at an aligned position (24a),said source storage range (21) being extended such that said destination data (22′) are written at a storage range starting at said non-aligned position (22a).
  • 18. A computer program product adapted to implement a method according to anyone of the preceding claims when run in a computing system.
  • 19. A system for writing data comprising a first memory (31) comprising first source data (21′) located in a storage range starting at a first source position (21a),a processing unit for generating (23) first destination data (22′) from said first source data (21′), anda second memory (32) with alignment restriction for receiving first destination data (22′) in a storage range starting at a non-aligned position (22a),whereinextracting means is adapted to extract second source data (27′) from a storage range starting at a second source position (27a) of the first memory, said second source position (27a) preceding the first source position (21a) and said second source data (27′) comprising said first source data (21′),said processing unit is adapted to generate a second destination data (24′) from said second source data (27′), said second destination data (24′) comprising said first destination data (22′), andwriting means is adapted to write said second destination data (24′) in a storage range starting at an aligned position (24a) of the second memory (32),wherein the second source position (27a) used by said extracting means is such that said first destination data (22′) are stored in a storage range of the second memory (32) starting at said non-aligned position (22a).
  • 20. A system according to claim 19, wherein determining means is adapted to determine said second source position (27a) on the basis of a ratio reflecting the relationship between the size of output data of said processing unit and the size of input data of said processing unit.
  • 21. A system according to claim 20, wherein determining means is adapted to determine said second source position (27a) on the basis of the distance between said non-aligned position (22a) and said aligned position (24a).
  • 22. A system according to anyone of the claims 20 to 21, wherein determining means is adapted to determine said second source position (27a) according to following equation: SP2=SP1−d/r whereinSP1 is the value of the first source position (21a),SP2 is the value of the second source position (27a),r is the ratio of the size of said output data to the size of said input datad is the distance between the non-aligned position (22a) and the aligned position (24a).
  • 23. A system according to anyone of the claims 19 to 22, wherein determining means is adapted to determine said second source position (27a) on the basis of the size of said first source data (21′) and said first destination data (22′) and on the basis of the distance between the non-aligned position (22a) and the aligned position (24a).
  • 24. A system according to anyone of the claims 19 to 23, wherein the aligned position (24a) is the first aligned position preceding said non-aligned position (22a).
  • 25. A system according to anyone of the claims 19 to 24, wherein determining means is adapted to determine the size of said second source data (27′) such that said second destination data (24′) fit between said aligned position (24a) and a further aligned position (24b).
  • 26. A system according to claim 25, wherein determining means is adapted to determine a third source position (27b) on the basis of a ratio reflecting the relationship between the size of output data of said processing unit and the size of input data of said processing unit, said third source position (27b) being the position where the storage range of said second source data (27′) stops.
  • 27. A system according to claim 26, wherein determining means is adapted to determine said third source position (27b) on the basis of the distance between said aligned position (24a) and said further aligned position (24b).
  • 28. A system according to claim 26 or 27, wherein said third source position (27b) is computed as follows: SP3=SP2+d′/r whereinSP3 is the value of the third source position (27b),SP2 is the value of the second source position (27a),r is the ratio of the size of said output data to the size of said input data,d′ is the distance between the aligned position (22a) and the further aligned position (24b).
  • 29. A system according to anyone of the claims 25 to 28, wherein determining means is adapted to determine a third source position (27b), which is defined as being the stop position of the storage range of said second source data (27′), on the basis of the size of said first source data (21′) and said first destination data (22′) and on the basis of the distance between the aligned position (24a) and the further aligned position (24b).
  • 30. A system according to anyone of the claims 25 to 29, wherein the further aligned position (24b) is the first aligned position following the storage range of said first destination data (22′).
  • 31. A system according to anyone of the claims 19 to 30, wherein said first source data (21′) and said first destination data (22′) are video data.
  • 32. A system according to anyone of the claims 19 to 31, wherein said first source data (21′) and said first destination data (22′) are audio data.
  • 33. A system according to anyone of the claims 19 to 32, wherein said second destination data (24′) are generated by a filter or a one-dimensional filter.
  • 34. A system according to anyone of the claims 19 to 33, wherein said second destination data (24′) are generated by a linear filter, a non-linear filter, a data rate change filter, or a data delay filter.
  • 35. A system according to anyone of the claims 19 to 34, wherein first memory (31) and second memory (32) are parts of a common memory.
  • 36. A system according to anyone of the claims 20 to 23, 25 to 27 or 29, wherein determining means is a computing means or one or a plurality of look-up tables.
Priority Claims (1)
Number Date Country Kind
06 006 570.3 Mar 2006 EP regional